[{"conference":{"start_date":"2022-05-23","name":"SP: Symposium on Security and Privacy","location":"San Francisco, CA, United States","end_date":"2022-05-26"},"citation":{"mla":"Das, Sourav, et al. “Practical Asynchronous Distributed Key Generation.” <i>2022 IEEE Symposium on Security and Privacy</i>, IEEE, 2022, pp. 2518–34, doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>.","chicago":"Das, Sourav, Thomas Yurek, Zhuolun Xiang, Andrew Miller, Eleftherios Kokoris Kogias, and Ling Ren. “Practical Asynchronous Distributed Key Generation.” In <i>2022 IEEE Symposium on Security and Privacy</i>, 2518–34. IEEE, 2022. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>.","ieee":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, and L. Ren, “Practical asynchronous distributed key generation,” in <i>2022 IEEE Symposium on Security and Privacy</i>, San Francisco, CA, United States, 2022, pp. 2518–2534.","ama":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. Practical asynchronous distributed key generation. In: <i>2022 IEEE Symposium on Security and Privacy</i>. IEEE; 2022:2518-2534. doi:<a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">10.1109/sp46214.2022.9833584</a>","apa":"Das, S., Yurek, T., Xiang, Z., Miller, A., Kokoris Kogias, E., &#38; Ren, L. (2022). Practical asynchronous distributed key generation. In <i>2022 IEEE Symposium on Security and Privacy</i> (pp. 2518–2534). San Francisco, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/sp46214.2022.9833584\">https://doi.org/10.1109/sp46214.2022.9833584</a>","ista":"Das S, Yurek T, Xiang Z, Miller A, Kokoris Kogias E, Ren L. 2022. Practical asynchronous distributed key generation. 2022 IEEE Symposium on Security and Privacy. SP: Symposium on Security and Privacy, 2518–2534.","short":"S. Das, T. Yurek, Z. Xiang, A. Miller, E. Kokoris Kogias, L. Ren, in:, 2022 IEEE Symposium on Security and Privacy, IEEE, 2022, pp. 2518–2534."},"publication_identifier":{"eissn":["2375-1207"],"eisbn":["9781665413169"]},"publisher":"IEEE","publication_status":"published","abstract":[{"lang":"eng","text":"Distributed Key Generation (DKG) is a technique to bootstrap threshold cryptosystems without a trusted third party and is a building block to decentralized protocols such as randomness beacons, threshold signatures, and general multiparty computation. Until recently, DKG protocols have assumed the synchronous model and thus are vulnerable when their underlying network assumptions do not hold. The recent advancements in asynchronous DKG protocols are insufficient as they either have poor efficiency or limited functionality, resulting in a lack of concrete implementations. In this paper, we present a simple and concretely efficient asynchronous DKG (ADKG) protocol. In a network of n nodes, our ADKG protocol can tolerate up to t<n/3 malicious nodes and have an expected O(κn3) communication cost, where κ is the security parameter. Our ADKG protocol produces a field element as the secret and is thus compatible with off-the-shelf threshold cryptosystems. We implement our ADKG protocol and evaluate it using a network of up to 128 nodes in geographically distributed AWS instances. Our evaluation shows that our protocol takes as low as 3 and 9.5 seconds to terminate for 32 and 64 nodes, respectively. Also, each node sends only 0.7 Megabytes and 2.9 Megabytes of data during the two experiments, respectively."}],"oa_version":"Preprint","acknowledgement":"The authors would like to thank Amit Agarwal, Adithya Bhat, Kobi Gurkan, Dakshita Khurana, Nibesh Shrestha, and Gilad Stern for the helpful discussions related to the paper.\r\nAlso, the authors would like to thank Sylvain Bellemare for helping with the hbACSS codebase and Nicolas Gailly for helping with running the Drand experiments.","doi":"10.1109/sp46214.2022.9833584","quality_controlled":"1","year":"2022","status":"public","date_published":"2022-07-27T00:00:00Z","_id":"12300","language":[{"iso":"eng"}],"scopus_import":"1","department":[{"_id":"ElKo"}],"oa":1,"article_processing_charge":"No","date_created":"2023-01-16T10:06:11Z","publication":"2022 IEEE Symposium on Security and Privacy","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2021/1591"}],"title":"Practical asynchronous distributed key generation","month":"07","fulldoi":"https://doi.org/10.1109/sp46214.2022.9833584","date_updated":"2026-08-12T06:40:50Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","author":[{"full_name":"Das, Sourav","last_name":"Das","first_name":"Sourav"},{"first_name":"Thomas","last_name":"Yurek","full_name":"Yurek, Thomas"},{"last_name":"Xiang","first_name":"Zhuolun","full_name":"Xiang, Zhuolun"},{"last_name":"Miller","first_name":"Andrew","full_name":"Miller, Andrew"},{"first_name":"Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","orcid":"0000-0002-8827-3382","full_name":"Kokoris Kogias, Eleftherios"},{"first_name":"Ling","last_name":"Ren","full_name":"Ren, Ling"}],"day":"27","page":"2518-2534"},{"_id":"12273","date_published":"2022-08-01T00:00:00Z","status":"public","year":"2022","quality_controlled":"1","volume":68,"doi":"10.1109/tit.2022.3167554","oa_version":"Preprint","corr_author":"1","abstract":[{"lang":"eng","text":"We study communication in the presence of a jamming adversary where quadratic power constraints are imposed on the transmitter and the jammer. The jamming signal is allowed to be a function of the codebook, and a noncausal but noisy observation of the transmitted codeword. For a certain range of the noise-to-signal ratios (NSRs) of the transmitter and the jammer, we are able to characterize the capacity of this channel under deterministic encoding or stochastic encoding, i.e., with no common randomness between the encoder/decoder pair. For the remaining NSR regimes, we determine the capacity under the assumption of a small amount of common randomness (at most 2log(n) bits in one sub-regime, and at most Ω(n) bits in the other sub-regime) available to the encoder-decoder pair. Our proof techniques involve a novel myopic list-decoding result for achievability, and a Plotkin-type push attack for the converse in a subregion of the NSRs, both of which may be of independent interest. We also give bounds on the strong secrecy capacity of this channel assuming that the jammer is simultaneously eavesdropping."}],"publication_status":"published","publisher":"IEEE","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"citation":{"ista":"Zhang Y, Vatedka S, Jaggi S, Sarwate AD. 2022. Quadratically constrained myopic adversarial channels. IEEE Transactions on Information Theory. 68(8), 4901–4948.","short":"Y. Zhang, S. Vatedka, S. Jaggi, A.D. Sarwate, IEEE Transactions on Information Theory 68 (2022) 4901–4948.","ama":"Zhang Y, Vatedka S, Jaggi S, Sarwate AD. Quadratically constrained myopic adversarial channels. <i>IEEE Transactions on Information Theory</i>. 2022;68(8):4901-4948. doi:<a href=\"https://doi.org/10.1109/tit.2022.3167554\">10.1109/tit.2022.3167554</a>","apa":"Zhang, Y., Vatedka, S., Jaggi, S., &#38; Sarwate, A. D. (2022). Quadratically constrained myopic adversarial channels. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/tit.2022.3167554\">https://doi.org/10.1109/tit.2022.3167554</a>","ieee":"Y. Zhang, S. Vatedka, S. Jaggi, and A. D. Sarwate, “Quadratically constrained myopic adversarial channels,” <i>IEEE Transactions on Information Theory</i>, vol. 68, no. 8. IEEE, pp. 4901–4948, 2022.","chicago":"Zhang, Yihan, Shashank Vatedka, Sidharth Jaggi, and Anand D. Sarwate. “Quadratically Constrained Myopic Adversarial Channels.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/tit.2022.3167554\">https://doi.org/10.1109/tit.2022.3167554</a>.","mla":"Zhang, Yihan, et al. “Quadratically Constrained Myopic Adversarial Channels.” <i>IEEE Transactions on Information Theory</i>, vol. 68, no. 8, IEEE, 2022, pp. 4901–48, doi:<a href=\"https://doi.org/10.1109/tit.2022.3167554\">10.1109/tit.2022.3167554</a>."},"intvolume":"        68","article_processing_charge":"No","oa":1,"scopus_import":"1","department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}],"isi":1,"fulldoi":"https://doi.org/10.1109/tit.2022.3167554","date_updated":"2026-08-12T06:41:20Z","month":"08","issue":"8","title":"Quadratically constrained myopic adversarial channels","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1801.05951","open_access":"1"}],"publication":"IEEE Transactions on Information Theory","date_created":"2023-01-16T10:01:19Z","external_id":{"arxiv":["1801.05951"],"isi":["000838527100004"]},"article_type":"original","page":"4901-4948","author":[{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","full_name":"Zhang, Yihan","orcid":"0000-0002-6465-6258","first_name":"Yihan","last_name":"Zhang"},{"first_name":"Shashank","last_name":"Vatedka","full_name":"Vatedka, Shashank"},{"full_name":"Jaggi, Sidharth","first_name":"Sidharth","last_name":"Jaggi"},{"full_name":"Sarwate, Anand D.","last_name":"Sarwate","first_name":"Anand D."}],"day":"01","arxiv":1,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"article_processing_charge":"No","scopus_import":"1","department":[{"_id":"MaMo"}],"oa":1,"language":[{"iso":"eng"}],"isi":1,"date_published":"2022-11-01T00:00:00Z","_id":"12233","year":"2022","status":"public","quality_controlled":"1","volume":70,"doi":"10.1109/tcomm.2022.3211101","oa_version":"Preprint","abstract":[{"lang":"eng","text":"A novel recursive list decoding (RLD) algorithm for Reed-Muller (RM) codes based on successive permutations (SP) of the codeword is presented. A low-complexity SP scheme applied to a subset of the symmetry group of RM codes is first proposed to carefully select a good codeword permutation on the fly. Then, the proposed SP technique is integrated into an improved RLD algorithm that initializes different decoding paths with random codeword permutations, which are sampled from the full symmetry group of RM codes. Finally, efficient latency and complexity reduction schemes are introduced that virtually preserve the error-correction performance of the proposed decoder. Simulation results demonstrate that at the target frame error rate of 10−3 for the RM code of length 256 with 163 information bits, the proposed decoder reduces 6% of the computational complexity and 22% of the decoding latency of the state-of-the-art semi-parallel simplified successive-cancellation decoder with fast Hadamard transform (SSC-FHT) that uses 96 permutations from the full symmetry group of RM codes, while relatively maintaining the error-correction performance and memory consumption of the semi-parallel permuted SSC-FHT decoder."}],"publication_identifier":{"issn":["0090-6778"],"eissn":["1558-0857"]},"publisher":"IEEE","publication_status":"published","intvolume":"        70","citation":{"ieee":"N. Doan, S. A. Hashemi, M. Mondelli, and W. J. Gross, “Decoding Reed-Muller codes with successive codeword permutations,” <i>IEEE Transactions on Communications</i>, vol. 70, no. 11. IEEE, pp. 7134–7145, 2022.","chicago":"Doan, Nghia, Seyyed Ali Hashemi, Marco Mondelli, and Warren J. Gross. “Decoding Reed-Muller Codes with Successive Codeword Permutations.” <i>IEEE Transactions on Communications</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/tcomm.2022.3211101\">https://doi.org/10.1109/tcomm.2022.3211101</a>.","mla":"Doan, Nghia, et al. “Decoding Reed-Muller Codes with Successive Codeword Permutations.” <i>IEEE Transactions on Communications</i>, vol. 70, no. 11, IEEE, 2022, pp. 7134–45, doi:<a href=\"https://doi.org/10.1109/tcomm.2022.3211101\">10.1109/tcomm.2022.3211101</a>.","ama":"Doan N, Hashemi SA, Mondelli M, Gross WJ. Decoding Reed-Muller codes with successive codeword permutations. <i>IEEE Transactions on Communications</i>. 2022;70(11):7134-7145. doi:<a href=\"https://doi.org/10.1109/tcomm.2022.3211101\">10.1109/tcomm.2022.3211101</a>","apa":"Doan, N., Hashemi, S. A., Mondelli, M., &#38; Gross, W. J. (2022). Decoding Reed-Muller codes with successive codeword permutations. <i>IEEE Transactions on Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/tcomm.2022.3211101\">https://doi.org/10.1109/tcomm.2022.3211101</a>","short":"N. Doan, S.A. Hashemi, M. Mondelli, W.J. Gross, IEEE Transactions on Communications 70 (2022) 7134–7145.","ista":"Doan N, Hashemi SA, Mondelli M, Gross WJ. 2022. Decoding Reed-Muller codes with successive codeword permutations. IEEE Transactions on Communications. 70(11), 7134–7145."},"external_id":{"isi":["000937284600006"],"arxiv":["2109.02122"]},"article_type":"original","day":"01","author":[{"full_name":"Doan, Nghia","first_name":"Nghia","last_name":"Doan"},{"first_name":"Seyyed Ali","last_name":"Hashemi","full_name":"Hashemi, Seyyed Ali"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli"},{"last_name":"Gross","first_name":"Warren J.","full_name":"Gross, Warren J."}],"page":"7134-7145","arxiv":1,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.1109/tcomm.2022.3211101","date_updated":"2026-08-12T06:41:04Z","issue":"11","month":"11","title":"Decoding Reed-Muller codes with successive codeword permutations","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2109.02122","open_access":"1"}],"publication":"IEEE Transactions on Communications","date_created":"2023-01-16T09:50:38Z"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.13378"}],"title":"Parallelism versus latency in simplified successive-cancellation decoding of polar codes","date_created":"2021-11-28T23:01:29Z","publication":"IEEE Transactions on Wireless Communications","date_updated":"2026-08-12T06:43:01Z","fulldoi":"https://doi.org/10.1109/TWC.2021.3125626","issue":"6","month":"06","author":[{"full_name":"Hashemi, Seyyed Ali","last_name":"Hashemi","first_name":"Seyyed Ali"},{"last_name":"Mondelli","first_name":"Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"last_name":"Fazeli","first_name":"Arman","full_name":"Fazeli, Arman"},{"first_name":"Alexander","last_name":"Vardy","full_name":"Vardy, Alexander"},{"first_name":"John","last_name":"Cioffi","full_name":"Cioffi, John"},{"first_name":"Andrea","last_name":"Goldsmith","full_name":"Goldsmith, Andrea"}],"day":"01","page":"3909-3920","arxiv":1,"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"10053","status":"public","relation":"earlier_version"}]},"external_id":{"isi":["000809406400028"],"arxiv":["2012.13378"]},"article_type":"original","oa_version":"Preprint","abstract":[{"text":"This paper characterizes the latency of the simplified successive-cancellation (SSC) decoding scheme for polar codes under hardware resource constraints. In particular, when the number of processing elements P that can perform SSC decoding operations in parallel is limited, as is the case in practice, the latency of SSC decoding is O(N1-1/μ + N/P log2 log2 N/P), where N is the block length of the code and μ is the scaling exponent of the channel. Three direct consequences of this bound are presented. First, in a fully-parallel implementation where P = N/2, the latency of SSC decoding is O(N1-1/μ), which is sublinear in the block length. This recovers a result from our earlier work. Second, in a fully-serial implementation where P = 1, the latency of SSC decoding scales as O(N log2 log2 N). The multiplicative constant is also calculated: we show that the latency of SSC decoding when P = 1 is given by (2 + o(1))N log2 log2 N. Third, in a semi-parallel implementation, the smallest P that gives the same latency as that of the fully-parallel implementation is P = N1/μ. The tightness of our bound on SSC decoding latency and the applicability of the foregoing results is validated through extensive simulations.","lang":"eng"}],"publication_identifier":{"eissn":["1558-2248"],"issn":["1536-1276"]},"publisher":"IEEE","publication_status":"published","intvolume":"        21","citation":{"short":"S.A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, A. Goldsmith, IEEE Transactions on Wireless Communications 21 (2022) 3909–3920.","ista":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. 2022. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. IEEE Transactions on Wireless Communications. 21(6), 3909–3920.","ieee":"S. A. Hashemi, M. Mondelli, A. Fazeli, A. Vardy, J. Cioffi, and A. Goldsmith, “Parallelism versus latency in simplified successive-cancellation decoding of polar codes,” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no. 6. IEEE, pp. 3909–3920, 2022.","chicago":"Hashemi, Seyyed Ali, Marco Mondelli, Arman Fazeli, Alexander Vardy, John Cioffi, and Andrea Goldsmith. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>. IEEE, 2022. <a href=\"https://doi.org/10.1109/TWC.2021.3125626\">https://doi.org/10.1109/TWC.2021.3125626</a>.","mla":"Hashemi, Seyyed Ali, et al. “Parallelism versus Latency in Simplified Successive-Cancellation Decoding of Polar Codes.” <i>IEEE Transactions on Wireless Communications</i>, vol. 21, no. 6, IEEE, 2022, pp. 3909–20, doi:<a href=\"https://doi.org/10.1109/TWC.2021.3125626\">10.1109/TWC.2021.3125626</a>.","ama":"Hashemi SA, Mondelli M, Fazeli A, Vardy A, Cioffi J, Goldsmith A. Parallelism versus latency in simplified successive-cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. 2022;21(6):3909-3920. doi:<a href=\"https://doi.org/10.1109/TWC.2021.3125626\">10.1109/TWC.2021.3125626</a>","apa":"Hashemi, S. A., Mondelli, M., Fazeli, A., Vardy, A., Cioffi, J., &#38; Goldsmith, A. (2022). Parallelism versus latency in simplified successive-cancellation decoding of polar codes. <i>IEEE Transactions on Wireless Communications</i>. IEEE. <a href=\"https://doi.org/10.1109/TWC.2021.3125626\">https://doi.org/10.1109/TWC.2021.3125626</a>"},"date_published":"2022-06-01T00:00:00Z","_id":"10364","year":"2022","status":"public","quality_controlled":"1","volume":21,"acknowledgement":"S. A. Hashemi is supported by a Postdoctoral Fellowship from the Natural Sciences and\r\nEngineering Research Council of Canada (NSERC) and by Huawei. M. Mondelli is partially\r\nsupported by the 2019 Lopez-Loreta Prize. A. Fazeli and A. Vardy were supported in part by\r\nthe National Science Foundation under Grant CCF-1764104.","doi":"10.1109/TWC.2021.3125626","isi":1,"project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"article_processing_charge":"No","department":[{"_id":"MaMo"}],"scopus_import":"1","oa":1,"language":[{"iso":"eng"}]},{"publication":"iScience","date_created":"2022-07-03T22:01:33Z","has_accepted_license":"1","title":"A systematic characterization of microglia-like cell occurrence during retinal organoid differentiation","issue":"7","month":"07","file_date_updated":"2022-07-04T08:19:25Z","fulldoi":"https://doi.org/10.1016/j.isci.2022.104580","date_updated":"2026-08-12T08:45:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"status":"public","id":"12117","relation":"other"},{"relation":"dissertation_contains","id":"20074","status":"public"}]},"type":"journal_article","day":"15","author":[{"id":"4D883232-F248-11E8-B48F-1D18A9856A87","full_name":"Bartalska, Katarina","last_name":"Bartalska","first_name":"Katarina"},{"id":"32B7C918-F248-11E8-B48F-1D18A9856A87","full_name":"Hübschmann, Verena","first_name":"Verena","last_name":"Hübschmann"},{"orcid":"0000-0003-4309-2251","full_name":"Korkut, Medina","id":"4B51CE74-F248-11E8-B48F-1D18A9856A87","first_name":"Medina","last_name":"Korkut"},{"id":"850B2E12-9CD4-11E9-837F-E719E6697425","full_name":"Cubero, Ryan J","orcid":"0000-0003-0002-1867","first_name":"Ryan J","last_name":"Cubero"},{"last_name":"Venturino","first_name":"Alessandro","full_name":"Venturino, Alessandro","orcid":"0000-0003-2356-9403","id":"41CB84B2-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rössler","first_name":"Karl","full_name":"Rössler, Karl"},{"first_name":"Thomas","last_name":"Czech","full_name":"Czech, Thomas"},{"last_name":"Siegert","first_name":"Sandra","full_name":"Siegert, Sandra","orcid":"0000-0001-8635-0877","id":"36ACD32E-F248-11E8-B48F-1D18A9856A87"}],"article_type":"original","file":[{"file_name":"2022_iScience_Bartalska.pdf","file_size":19400048,"date_updated":"2022-07-04T08:19:25Z","creator":"cchlebak","success":1,"access_level":"open_access","relation":"main_file","checksum":"a470b74e1b3796c710189c81a4cd4329","content_type":"application/pdf","file_id":"11480","date_created":"2022-07-04T08:19:25Z"}],"external_id":{"pmid":["35789843"],"isi":["000830428500005"]},"intvolume":"        25","citation":{"ama":"Bartalska K, Hübschmann V, Korkut M, et al. A systematic characterization of microglia-like cell occurrence during retinal organoid differentiation. <i>iScience</i>. 2022;25(7). doi:<a href=\"https://doi.org/10.1016/j.isci.2022.104580\">10.1016/j.isci.2022.104580</a>","apa":"Bartalska, K., Hübschmann, V., Korkut, M., Cubero, R. J., Venturino, A., Rössler, K., … Siegert, S. (2022). A systematic characterization of microglia-like cell occurrence during retinal organoid differentiation. <i>IScience</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.isci.2022.104580\">https://doi.org/10.1016/j.isci.2022.104580</a>","mla":"Bartalska, Katarina, et al. “A Systematic Characterization of Microglia-like Cell Occurrence during Retinal Organoid Differentiation.” <i>IScience</i>, vol. 25, no. 7, 104580, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.isci.2022.104580\">10.1016/j.isci.2022.104580</a>.","ieee":"K. Bartalska <i>et al.</i>, “A systematic characterization of microglia-like cell occurrence during retinal organoid differentiation,” <i>iScience</i>, vol. 25, no. 7. Elsevier, 2022.","chicago":"Bartalska, Katarina, Verena Hübschmann, Medina Korkut, Ryan J Cubero, Alessandro Venturino, Karl Rössler, Thomas Czech, and Sandra Siegert. “A Systematic Characterization of Microglia-like Cell Occurrence during Retinal Organoid Differentiation.” <i>IScience</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.isci.2022.104580\">https://doi.org/10.1016/j.isci.2022.104580</a>.","ista":"Bartalska K, Hübschmann V, Korkut M, Cubero RJ, Venturino A, Rössler K, Czech T, Siegert S. 2022. A systematic characterization of microglia-like cell occurrence during retinal organoid differentiation. iScience. 25(7), 104580.","short":"K. Bartalska, V. Hübschmann, M. Korkut, R.J. Cubero, A. Venturino, K. Rössler, T. Czech, S. Siegert, IScience 25 (2022)."},"publication_identifier":{"eissn":["2589-0042"]},"ec_funded":1,"publication_status":"published","publisher":"Elsevier","abstract":[{"lang":"eng","text":"Cerebral organoids differentiated from human-induced pluripotent stem cells (hiPSC) provide a unique opportunity to investigate brain development. However, organoids usually lack microglia, brain-resident immune cells, which are present in the early embryonic brain and participate in neuronal circuit development. Here, we find IBA1+ microglia-like cells alongside retinal cups between week 3 and 4 in 2.5D culture with an unguided retinal organoid differentiation protocol. Microglia do not infiltrate the neuroectoderm and instead enrich within non-pigmented, 3D-cystic compartments that develop in parallel to the 3D-retinal organoids. When we guide the retinal organoid differentiation with low-dosed BMP4, we prevent cup development and enhance microglia and 3D-cysts formation. Mass spectrometry identifies these 3D-cysts to express mesenchymal and epithelial markers. We confirmed this microglia-preferred environment also within the unguided protocol, providing insight into microglial behavior and migration and offer a model to study how they enter and distribute within the human brain."}],"corr_author":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"acknowledgement":"We thank the scientific service units at ISTA, specifically the lab support facility and imaging & optics facility for their support; Nicolas Armel for performing the Mass Spectrometry. We thank Alexandra Lang and Tanja Peilnsteiner for their help in human brain tissue collection, Rouven Schulz for his insights into the functional assays We thank all members of the Siegert group for constant feedback on the project and Margaret Maes, Rouven Schulz, and Marco Benevento for feedback on the manuscript. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant No. 715571 to S.S.) and from the Gesellschaft für Forschungsförderung Niederösterreich (grant No. Sc19-017 to V.H.).","doi":"10.1016/j.isci.2022.104580","volume":25,"quality_controlled":"1","year":"2022","status":"public","date_published":"2022-07-15T00:00:00Z","_id":"11478","isi":1,"ddc":["610"],"pmid":1,"language":[{"iso":"eng"}],"department":[{"_id":"SaSi"}],"scopus_import":"1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"article_number":"104580","oa":1,"article_processing_charge":"Yes","project":[{"name":"Microglia action towards neuronal circuit formation and function in health and disease","call_identifier":"H2020","grant_number":"715571","_id":"25D4A630-B435-11E9-9278-68D0E5697425"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"_id":"9B99D380-BA93-11EA-9121-9846C619BF3A","name":"How human microglia shape developing neurons during health and inflammation","grant_number":"SC19-017"}]},{"oa":1,"department":[{"_id":"TaHa"}],"scopus_import":"1","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"article_processing_charge":"No","language":[{"iso":"eng"}],"isi":1,"status":"public","year":"2022","_id":"12793","date_published":"2022-08-29T00:00:00Z","doi":"10.2140/pjm.2022.321.193","acknowledgement":"I’d like to thank Prof. Chaudouard for introducing me to this area. I’d like to thank Prof. Harris for asking me the question that makes Section 10 possible. I’m grateful for the support of Prof. Hausel and IST Austria. The author was funded by an ISTplus fellowship: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411.","quality_controlled":"1","volume":321,"abstract":[{"text":"Let F be a global function field with constant field Fq. Let G be a reductive group over Fq. We establish a variant of Arthur's truncated kernel for G and for its Lie algebra which generalizes Arthur's original construction. We establish a coarse geometric expansion for our variant truncation.\r\nAs applications, we consider some existence and uniqueness problems of some cuspidal automorphic representations for the functions field of the projective line P1Fq with two points of ramifications.","lang":"eng"}],"corr_author":"1","oa_version":"Preprint","citation":{"ista":"Yu H. 2022. A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. Pacific Journal of Mathematics. 321(1), 193–237.","short":"H. Yu, Pacific Journal of Mathematics 321 (2022) 193–237.","ama":"Yu H. A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. <i>Pacific Journal of Mathematics</i>. 2022;321(1):193-237. doi:<a href=\"https://doi.org/10.2140/pjm.2022.321.193\">10.2140/pjm.2022.321.193</a>","apa":"Yu, H. (2022). A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications. <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/pjm.2022.321.193\">https://doi.org/10.2140/pjm.2022.321.193</a>","mla":"Yu, Hongjie. “A Coarse Geometric Expansion of a Variant of Arthur’s Truncated Traces and Some Applications.” <i>Pacific Journal of Mathematics</i>, vol. 321, no. 1, Mathematical Sciences Publishers, 2022, pp. 193–237, doi:<a href=\"https://doi.org/10.2140/pjm.2022.321.193\">10.2140/pjm.2022.321.193</a>.","ieee":"H. Yu, “A coarse geometric expansion of a variant of Arthur’s truncated traces and some applications,” <i>Pacific Journal of Mathematics</i>, vol. 321, no. 1. Mathematical Sciences Publishers, pp. 193–237, 2022.","chicago":"Yu, Hongjie. “A Coarse Geometric Expansion of a Variant of Arthur’s Truncated Traces and Some Applications.” <i>Pacific Journal of Mathematics</i>. Mathematical Sciences Publishers, 2022. <a href=\"https://doi.org/10.2140/pjm.2022.321.193\">https://doi.org/10.2140/pjm.2022.321.193</a>."},"intvolume":"       321","publisher":"Mathematical Sciences Publishers","publication_status":"published","ec_funded":1,"publication_identifier":{"issn":["0030-8730"],"eissn":["1945-5844"]},"external_id":{"arxiv":["2109.10245"],"isi":["000954466300006"]},"article_type":"original","keyword":["Arthur–Selberg trace formula","cuspidal automorphic representations","global function fields"],"arxiv":1,"page":"193-237","day":"29","author":[{"first_name":"Hongjie","last_name":"Yu","id":"3D7DD9BE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5128-7126","full_name":"Yu, Hongjie"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","date_updated":"2026-08-12T08:44:28Z","fulldoi":"https://doi.org/10.2140/pjm.2022.321.193","month":"08","issue":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2109.10245","open_access":"1"}],"title":"A coarse geometric expansion of a variant of Arthur's truncated traces and some applications","date_created":"2023-04-02T22:01:11Z","publication":"Pacific Journal of Mathematics"},{"isi":1,"scopus_import":"1","department":[{"_id":"JuFi"}],"oa":1,"article_processing_charge":"No","language":[{"iso":"eng"}],"abstract":[{"text":"Consider a linear elliptic partial differential equation in divergence form with a random coefficient field. The solution operator displays fluctuations around its expectation. The recently developed pathwise theory of fluctuations in stochastic homogenization reduces the characterization of these fluctuations to those of the so-called standard homogenization commutator. In this contribution, we investigate the scaling limit of this key quantity: starting\r\nfrom a Gaussian-like coefficient field with possibly strong correlations, we establish the convergence of the rescaled commutator to a fractional Gaussian field, depending on the decay of correlations of the coefficient field, and we\r\ninvestigate the (non)degeneracy of the limit. This extends to general dimension $d\\ge1$ previous results so far limited to dimension $d=1$, and to the continuum setting with strong correlations recent results in the discrete iid case.","lang":"eng"}],"corr_author":"1","oa_version":"Preprint","intvolume":"        32","citation":{"ista":"Duerinckx M, Fischer JL, Gloria A. 2022. Scaling limit of the homogenization commutator for Gaussian coefficient  fields. Annals of Applied Probability. 32(2), 1179–1209.","short":"M. Duerinckx, J.L. Fischer, A. Gloria, Annals of Applied Probability 32 (2022) 1179–1209.","ieee":"M. Duerinckx, J. L. Fischer, and A. Gloria, “Scaling limit of the homogenization commutator for Gaussian coefficient  fields,” <i>Annals of Applied Probability</i>, vol. 32, no. 2. Institute of Mathematical Statistics, pp. 1179–1209, 2022.","mla":"Duerinckx, Mitia, et al. “Scaling Limit of the Homogenization Commutator for Gaussian Coefficient  Fields.” <i>Annals of Applied Probability</i>, vol. 32, no. 2, Institute of Mathematical Statistics, 2022, pp. 1179–209, doi:<a href=\"https://doi.org/10.1214/21-AAP1705\">10.1214/21-AAP1705</a>.","chicago":"Duerinckx, Mitia, Julian L Fischer, and Antoine Gloria. “Scaling Limit of the Homogenization Commutator for Gaussian Coefficient  Fields.” <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2022. <a href=\"https://doi.org/10.1214/21-AAP1705\">https://doi.org/10.1214/21-AAP1705</a>.","apa":"Duerinckx, M., Fischer, J. L., &#38; Gloria, A. (2022). Scaling limit of the homogenization commutator for Gaussian coefficient  fields. <i>Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/21-AAP1705\">https://doi.org/10.1214/21-AAP1705</a>","ama":"Duerinckx M, Fischer JL, Gloria A. Scaling limit of the homogenization commutator for Gaussian coefficient  fields. <i>Annals of Applied Probability</i>. 2022;32(2):1179-1209. doi:<a href=\"https://doi.org/10.1214/21-AAP1705\">10.1214/21-AAP1705</a>"},"publication_identifier":{"issn":["1050-5164"]},"publisher":"Institute of Mathematical Statistics","publication_status":"published","year":"2022","status":"public","date_published":"2022-04-28T00:00:00Z","_id":"10548","acknowledgement":"The authors thank Ivan Nourdin and Felix Otto for inspiring discussions. The work of MD is financially supported by the CNRS-Momentum program. Financial support of AG is acknowledged from the European Research Council under the European Community’s Seventh Framework Programme (FP7/2014-2019 Grant Agreement QUANTHOM 335410).","doi":"10.1214/21-AAP1705","quality_controlled":"1","volume":32,"arxiv":1,"day":"28","author":[{"first_name":"Mitia","last_name":"Duerinckx","full_name":"Duerinckx, Mitia"},{"last_name":"Fischer","first_name":"Julian L","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L"},{"last_name":"Gloria","first_name":"Antoine","full_name":"Gloria, Antoine"}],"page":"1179-1209","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","external_id":{"arxiv":["1910.04088"],"isi":["000791003700011"]},"article_type":"original","main_file_link":[{"url":"https://arxiv.org/abs/1910.04088","open_access":"1"}],"title":"Scaling limit of the homogenization commutator for Gaussian coefficient  fields","date_created":"2021-12-16T12:10:16Z","publication":"Annals of Applied Probability","date_updated":"2026-08-12T09:22:31Z","fulldoi":"https://doi.org/10.1214/21-AAP1705","issue":"2","month":"04"},{"_id":"14597","date_published":"2022-03-31T00:00:00Z","status":"public","year":"2022","doi":"10.48550/ARXIV.2203.17143","oa_version":"Preprint","corr_author":"1","abstract":[{"text":"Phase-field models such as the Allen-Cahn equation may give rise to the formation and evolution of geometric shapes, a phenomenon that may be analyzed rigorously in suitable scaling regimes. In its sharp-interface limit, the vectorial Allen-Cahn equation with a potential with N≥3 distinct minima has been conjectured to describe the evolution of branched interfaces by multiphase mean curvature flow.\r\nIn the present work, we give a rigorous proof for this statement in two and three ambient dimensions and for a suitable class of potentials: As long as a strong solution to multiphase mean curvature flow exists, solutions to the vectorial Allen-Cahn equation with well-prepared initial data converge towards multiphase mean curvature flow in the limit of vanishing interface width parameter ε↘0. We even establish the rate of convergence O(ε1/2).\r\nOur approach is based on the gradient flow structure of the Allen-Cahn equation and its limiting motion: Building on the recent concept of \"gradient flow calibrations\" for multiphase mean curvature flow, we introduce a notion of relative entropy for the vectorial Allen-Cahn equation with multi-well potential. This enables us to overcome the limitations of other approaches, e.g. avoiding the need for a stability analysis of the Allen-Cahn operator or additional convergence hypotheses for the energy at positive times.","lang":"eng"}],"publication_status":"draft","ec_funded":1,"citation":{"ieee":"J. L. Fischer and A. Marveggio, “Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow,” <i>arXiv</i>. .","mla":"Fischer, Julian L., and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” <i>ArXiv</i>, 2203.17143, doi:<a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">10.48550/ARXIV.2203.17143</a>.","chicago":"Fischer, Julian L, and Alice Marveggio. “Quantitative Convergence of the Vectorial Allen-Cahn Equation towards Multiphase Mean Curvature Flow.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">https://doi.org/10.48550/ARXIV.2203.17143</a>.","apa":"Fischer, J. L., &#38; Marveggio, A. (n.d.). Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">https://doi.org/10.48550/ARXIV.2203.17143</a>","ama":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2203.17143\">10.48550/ARXIV.2203.17143</a>","short":"J.L. Fischer, A. Marveggio, ArXiv (n.d.).","ista":"Fischer JL, Marveggio A. Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow. arXiv, 2203.17143."},"project":[{"name":"Bridging Scales in Random Materials","call_identifier":"H2020","grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d"}],"article_processing_charge":"No","oa":1,"article_number":"2203.17143","department":[{"_id":"JuFi"}],"language":[{"iso":"eng"}],"date_updated":"2026-08-12T09:15:49Z","fulldoi":"https://doi.org/10.48550/ARXIV.2203.17143","month":"03","title":"Quantitative convergence of the vectorial Allen-Cahn equation towards multiphase mean curvature flow","main_file_link":[{"url":"https://arxiv.org/abs/2203.17143","open_access":"1"}],"date_created":"2023-11-23T09:30:02Z","publication":"arXiv","external_id":{"arxiv":["2203.17143"]},"author":[{"first_name":"Julian L","last_name":"Fischer","id":"2C12A0B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0479-558X","full_name":"Fischer, Julian L"},{"first_name":"Alice","last_name":"Marveggio","id":"25647992-AA84-11E9-9D75-8427E6697425","full_name":"Marveggio, Alice"}],"day":"31","arxiv":1,"type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"14587","status":"public","relation":"dissertation_contains"},{"relation":"later_version","id":"17481","status":"public"}]}},{"publication":"Development","date_created":"2023-01-16T09:50:12Z","has_accepted_license":"1","title":"Admp regulates tail bending by controlling ventral epidermal cell polarity via phosphorylated myosin localization in Ciona","issue":"21","month":"11","fulldoi":"https://doi.org/10.1242/dev.200215","date_updated":"2026-08-12T09:59:24Z","file_date_updated":"2023-01-27T10:36:50Z","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Yuki S.","last_name":"Kogure","full_name":"Kogure, Yuki S."},{"full_name":"Muraoka, Hiromochi","last_name":"Muraoka","first_name":"Hiromochi"},{"first_name":"Wataru C.","last_name":"Koizumi","full_name":"Koizumi, Wataru C."},{"first_name":"Raphaël","last_name":"Gelin-alessi","full_name":"Gelin-alessi, Raphaël"},{"id":"33280250-F248-11E8-B48F-1D18A9856A87","full_name":"Godard, Benoit G","last_name":"Godard","first_name":"Benoit G"},{"full_name":"Oka, Kotaro","first_name":"Kotaro","last_name":"Oka"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg","first_name":"Carl-Philipp J"},{"full_name":"Hotta, Kohji","first_name":"Kohji","last_name":"Hotta"}],"day":"01","keyword":["Developmental Biology","Molecular Biology"],"file":[{"date_updated":"2023-01-27T10:36:50Z","file_name":"2022_Development_Kogure.pdf","file_size":9160451,"relation":"main_file","access_level":"open_access","success":1,"creator":"dernst","file_id":"12423","checksum":"871b9c58eb79b9e60752de25a46938d6","content_type":"application/pdf","date_created":"2023-01-27T10:36:50Z"}],"article_type":"original","external_id":{"isi":["000903991700002"],"pmid":["36227591"]},"publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"publisher":"Company of Biologists","publication_status":"published","intvolume":"       149","citation":{"ista":"Kogure YS, Muraoka H, Koizumi WC, Gelin-alessi R, Godard BG, Oka K, Heisenberg C-PJ, Hotta K. 2022. Admp regulates tail bending by controlling ventral epidermal cell polarity via phosphorylated myosin localization in Ciona. Development. 149(21), dev200215.","short":"Y.S. Kogure, H. Muraoka, W.C. Koizumi, R. Gelin-alessi, B.G. Godard, K. Oka, C.-P.J. Heisenberg, K. Hotta, Development 149 (2022).","ama":"Kogure YS, Muraoka H, Koizumi WC, et al. Admp regulates tail bending by controlling ventral epidermal cell polarity via phosphorylated myosin localization in Ciona. <i>Development</i>. 2022;149(21). doi:<a href=\"https://doi.org/10.1242/dev.200215\">10.1242/dev.200215</a>","apa":"Kogure, Y. S., Muraoka, H., Koizumi, W. C., Gelin-alessi, R., Godard, B. G., Oka, K., … Hotta, K. (2022). Admp regulates tail bending by controlling ventral epidermal cell polarity via phosphorylated myosin localization in Ciona. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.200215\">https://doi.org/10.1242/dev.200215</a>","chicago":"Kogure, Yuki S., Hiromochi Muraoka, Wataru C. Koizumi, Raphaël Gelin-alessi, Benoit G Godard, Kotaro Oka, Carl-Philipp J Heisenberg, and Kohji Hotta. “Admp Regulates Tail Bending by Controlling Ventral Epidermal Cell Polarity via Phosphorylated Myosin Localization in Ciona.” <i>Development</i>. Company of Biologists, 2022. <a href=\"https://doi.org/10.1242/dev.200215\">https://doi.org/10.1242/dev.200215</a>.","mla":"Kogure, Yuki S., et al. “Admp Regulates Tail Bending by Controlling Ventral Epidermal Cell Polarity via Phosphorylated Myosin Localization in Ciona.” <i>Development</i>, vol. 149, no. 21, dev200215, Company of Biologists, 2022, doi:<a href=\"https://doi.org/10.1242/dev.200215\">10.1242/dev.200215</a>.","ieee":"Y. S. Kogure <i>et al.</i>, “Admp regulates tail bending by controlling ventral epidermal cell polarity via phosphorylated myosin localization in Ciona,” <i>Development</i>, vol. 149, no. 21. Company of Biologists, 2022."},"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"corr_author":"1","abstract":[{"lang":"eng","text":"Ventral tail bending, which is transient but pronounced, is found in many chordate embryos and constitutes an interesting model of how tissue interactions control embryo shape. Here, we identify one key upstream regulator of ventral tail bending in embryos of the ascidian Ciona. We show that during the early tailbud stages, ventral epidermal cells exhibit a boat-shaped morphology (boat cell) with a narrow apical surface where phosphorylated myosin light chain (pMLC) accumulates. We further show that interfering with the function of the BMP ligand Admp led to pMLC localizing to the basal instead of the apical side of ventral epidermal cells and a reduced number of boat cells. Finally, we show that cutting ventral epidermal midline cells at their apex using an ultraviolet laser relaxed ventral tail bending. Based on these results, we propose a previously unreported function for Admp in localizing pMLC to the apical side of ventral epidermal cells, which causes the tail to bend ventrally by resisting antero-posterior notochord extension at the ventral side of the tail."}],"volume":149,"quality_controlled":"1","acknowledgement":"iona intestinalis adults were provided by Dr Yutaka Satou (Kyoto University) and Dr Manabu Yoshida (the University of Tokyo) with support from the National Bio-Resource Project of AMED, Japan. We thank Dr Hidehiko Hashimoto and Dr Yuji Mizotani for technical information about 1P-myosin antibody staining. We thank Dr Kaoru Imai and Dr Yutaka Satou for valuable discussion about Admp and for the DNA construct of Bmp2/4 under the Dlx.b upstream sequence. We thank Ms Maki Kogure for constructing the FUSION360 of the intercalating epidermal cell.\r\nThis work was supported by funding from the Japan Society for the Promotion of Science (JP16H01451, JP21H00440). Open Access funding provided by Keio University: Keio Gijuku Daigaku.","doi":"10.1242/dev.200215","date_published":"2022-11-01T00:00:00Z","_id":"12231","year":"2022","status":"public","isi":1,"ddc":["570"],"language":[{"iso":"eng"}],"pmid":1,"article_processing_charge":"No","scopus_import":"1","department":[{"_id":"CaHe"}],"article_number":"dev200215","oa":1},{"author":[{"full_name":"Soto, Ximena","first_name":"Ximena","last_name":"Soto"},{"first_name":"Joshua","last_name":"Burton","full_name":"Burton, Joshua"},{"full_name":"Manning, Cerys S.","first_name":"Cerys S.","last_name":"Manning"},{"full_name":"Minchington, Thomas","id":"7d1648cb-19e9-11eb-8e7a-f8c037fb3e3f","last_name":"Minchington","first_name":"Thomas"},{"last_name":"Lea","first_name":"Robert","full_name":"Lea, Robert"},{"last_name":"Lee","first_name":"Jessica","full_name":"Lee, Jessica"},{"first_name":"Jochen","last_name":"Kursawe","full_name":"Kursawe, Jochen"},{"last_name":"Rattray","first_name":"Magnus","full_name":"Rattray, Magnus"},{"first_name":"Nancy","last_name":"Papalopulu","full_name":"Papalopulu, Nancy"}],"day":"01","related_material":{"link":[{"url":" https://github.com/burtonjosh/StepwiseMir9","relation":"software"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","external_id":{"isi":["000918161000003"],"pmid":["36189829"]},"file":[{"relation":"main_file","access_level":"open_access","success":1,"creator":"dernst","file_size":9348839,"date_updated":"2023-01-30T08:35:44Z","file_name":"2022_Development_Soto.pdf","date_created":"2023-01-30T08:35:44Z","file_id":"12438","checksum":"d7c29b74e9e4032308228cc704a30e88","content_type":"application/pdf"}],"article_type":"original","keyword":["Developmental Biology","Molecular Biology"],"title":"Sequential and additive expression of miR-9 precursors control timing of neurogenesis","has_accepted_license":"1","date_created":"2023-01-16T09:53:17Z","publication":"Development","file_date_updated":"2023-01-30T08:35:44Z","fulldoi":"https://doi.org/10.1242/dev.200474","date_updated":"2026-08-12T09:59:40Z","month":"10","issue":"19","ddc":["570"],"isi":1,"oa":1,"article_number":"dev200474","scopus_import":"1","department":[{"_id":"AnKi"}],"article_processing_charge":"No","pmid":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"MicroRNAs (miRs) have an important role in tuning dynamic gene expression. However, the mechanism by which they are quantitatively controlled is unknown. We show that the amount of mature miR-9, a key regulator of neuronal development, increases during zebrafish neurogenesis in a sharp stepwise manner. We characterize the spatiotemporal profile of seven distinct microRNA primary transcripts (pri-mir)-9s that produce the same mature miR-9 and show that they are sequentially expressed during hindbrain neurogenesis. Expression of late-onset pri-mir-9-1 is added on to, rather than replacing, the expression of early onset pri-mir-9-4 and -9-5 in single cells. CRISPR/Cas9 mutation of the late-onset pri-mir-9-1 prevents the developmental increase of mature miR-9, reduces late neuronal differentiation and fails to downregulate Her6 at late stages. Mathematical modelling shows that an adaptive network containing Her6 is insensitive to linear increases in miR-9 but responds to stepwise increases of miR-9. We suggest that a sharp stepwise increase of mature miR-9 is created by sequential and additive temporal activation of distinct loci. This may be a strategy to overcome adaptation and facilitate a transition of Her6 to a new dynamic regime or steady state."}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","citation":{"chicago":"Soto, Ximena, Joshua Burton, Cerys S. Manning, Thomas Minchington, Robert Lea, Jessica Lee, Jochen Kursawe, Magnus Rattray, and Nancy Papalopulu. “Sequential and Additive Expression of MiR-9 Precursors Control Timing of Neurogenesis.” <i>Development</i>. Company of Biologists, 2022. <a href=\"https://doi.org/10.1242/dev.200474\">https://doi.org/10.1242/dev.200474</a>.","ieee":"X. Soto <i>et al.</i>, “Sequential and additive expression of miR-9 precursors control timing of neurogenesis,” <i>Development</i>, vol. 149, no. 19. Company of Biologists, 2022.","mla":"Soto, Ximena, et al. “Sequential and Additive Expression of MiR-9 Precursors Control Timing of Neurogenesis.” <i>Development</i>, vol. 149, no. 19, dev200474, Company of Biologists, 2022, doi:<a href=\"https://doi.org/10.1242/dev.200474\">10.1242/dev.200474</a>.","apa":"Soto, X., Burton, J., Manning, C. S., Minchington, T., Lea, R., Lee, J., … Papalopulu, N. (2022). Sequential and additive expression of miR-9 precursors control timing of neurogenesis. <i>Development</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/dev.200474\">https://doi.org/10.1242/dev.200474</a>","ama":"Soto X, Burton J, Manning CS, et al. Sequential and additive expression of miR-9 precursors control timing of neurogenesis. <i>Development</i>. 2022;149(19). doi:<a href=\"https://doi.org/10.1242/dev.200474\">10.1242/dev.200474</a>","short":"X. Soto, J. Burton, C.S. Manning, T. Minchington, R. Lea, J. Lee, J. Kursawe, M. Rattray, N. Papalopulu, Development 149 (2022).","ista":"Soto X, Burton J, Manning CS, Minchington T, Lea R, Lee J, Kursawe J, Rattray M, Papalopulu N. 2022. Sequential and additive expression of miR-9 precursors control timing of neurogenesis. Development. 149(19), dev200474."},"intvolume":"       149","publisher":"Company of Biologists","publication_status":"published","publication_identifier":{"issn":["0950-1991"],"eissn":["1477-9129"]},"status":"public","year":"2022","_id":"12245","date_published":"2022-10-01T00:00:00Z","doi":"10.1242/dev.200474","acknowledgement":"We are grateful to Dr Tom Pettini for the advice on smiFISH technique and Dr Laure Bally-Cuif for sharing plasmids. The authors also thank the Biological Services Facility, Bioimaging and Systems Microscopy Facilities of the University of Manchester for technical support.\r\nThis work was supported by a Wellcome Trust Senior Research Fellowship (090868/Z/09/Z) and a Wellcome Trust Investigator Award (224394/Z/21/Z) to N.P. and a Medical Research Council Career Development Award to C.S.M. (MR/V032534/1). J.B. was supported by a Wellcome Trust Four-Year PhD Studentship in Basic Science (219992/Z/19/Z). Open Access funding provided by The University of Manchester. Deposited in PMC for immediate release.","volume":149,"quality_controlled":"1"},{"scopus_import":"1","department":[{"_id":"KiMo"}],"oa":1,"article_number":"135802","article_processing_charge":"No","pmid":1,"language":[{"iso":"eng"}],"ddc":["530"],"isi":1,"year":"2022","status":"public","date_published":"2022-01-20T00:00:00Z","_id":"10735","acknowledgement":"YJ was supported by the National Research Foundation of Korea (NRF) (Grant Nos. NRF-2018K2A9A1A06069211 and NRF-2019R1A2C1089017). The work at Yonsei was supported by the NRF (Grant Nos. NRF-2017R1A5A-1014862 (SRC program: vdWMRC center), NRF-2019R1A2C2002601, and NRF-2021R1A2C1006375). WK acknowledges the support by the NRF (Grant Nos. 2018R1D1A1B07050087, 2018R1A6A1A03025340).","doi":"10.1088/1361-648X/ac484d","volume":34,"quality_controlled":"1","abstract":[{"lang":"eng","text":"Magnetic anisotropy in strontium iridate (Sr2IrO4) is essential because of its strong spin–orbit coupling and crystal field effect. In this paper, we present a detailed mapping of the out-of-plane (OOP) magnetic anisotropy in Sr2IrO4 for different sample orientations using torque magnetometry measurements in the low-magnetic-field region before the isospins are completely ordered. Dominant in-plane anisotropy was identified at low fields, confirming the b axis as an easy magnetization axis. Based on the fitting analysis of the strong uniaxial magnetic anisotropy, we observed that the main anisotropic effect arises from a spin–orbit-coupled magnetic exchange interaction affecting the OOP interaction. The effect of interlayer exchange interaction results in additional anisotropic terms owing to the tilting of the isospins. The results are relevant for understanding OOP magnetic anisotropy and provide a new way to analyze the effects of spin–orbit-coupling and interlayer magnetic exchange interactions. This study provides insight into the understanding of bulk magnetic, magnetotransport, and spintronic behavior on Sr2IrO4 for future studies."}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":"        34","citation":{"short":"M. Nauman, T. Hussain, J. Choi, N. Lee, Y.J. Choi, W. Kang, Y. Jo, Journal of Physics: Condensed Matter 34 (2022).","ista":"Nauman M, Hussain T, Choi J, Lee N, Choi YJ, Kang W, Jo Y. 2022. Low-field magnetic anisotropy of Sr2IrO4. Journal of Physics: Condensed Matter. 34(13), 135802.","chicago":"Nauman, Muhammad, Tayyaba Hussain, Joonyoung Choi, Nara Lee, Young Jai Choi, Woun Kang, and Younjung Jo. “Low-Field Magnetic Anisotropy of Sr2IrO4.” <i>Journal of Physics: Condensed Matter</i>. IOP Publishing, 2022. <a href=\"https://doi.org/10.1088/1361-648X/ac484d\">https://doi.org/10.1088/1361-648X/ac484d</a>.","mla":"Nauman, Muhammad, et al. “Low-Field Magnetic Anisotropy of Sr2IrO4.” <i>Journal of Physics: Condensed Matter</i>, vol. 34, no. 13, 135802, IOP Publishing, 2022, doi:<a href=\"https://doi.org/10.1088/1361-648X/ac484d\">10.1088/1361-648X/ac484d</a>.","ieee":"M. Nauman <i>et al.</i>, “Low-field magnetic anisotropy of Sr2IrO4,” <i>Journal of Physics: Condensed Matter</i>, vol. 34, no. 13. IOP Publishing, 2022.","apa":"Nauman, M., Hussain, T., Choi, J., Lee, N., Choi, Y. J., Kang, W., &#38; Jo, Y. (2022). Low-field magnetic anisotropy of Sr2IrO4. <i>Journal of Physics: Condensed Matter</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1361-648X/ac484d\">https://doi.org/10.1088/1361-648X/ac484d</a>","ama":"Nauman M, Hussain T, Choi J, et al. Low-field magnetic anisotropy of Sr2IrO4. <i>Journal of Physics: Condensed Matter</i>. 2022;34(13). doi:<a href=\"https://doi.org/10.1088/1361-648X/ac484d\">10.1088/1361-648X/ac484d</a>"},"publication_identifier":{"eissn":["1361-648X"]},"publisher":"IOP Publishing","publication_status":"published","external_id":{"pmid":["34986467"],"isi":["000775191800001"]},"file":[{"file_id":"10741","checksum":"b6c705c7f03dcb1dbcb06b1b4d4938d6","content_type":"application/pdf","date_created":"2022-02-07T10:35:28Z","file_size":1742414,"date_updated":"2022-02-07T10:35:28Z","file_name":"2022_JPhysCondensMatter_Nauman.pdf","access_level":"open_access","relation":"main_file","creator":"cchlebak","success":1}],"article_type":"original","day":"20","author":[{"last_name":"Nauman","first_name":"Muhammad","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","full_name":"Nauman, Muhammad","orcid":"0000-0002-2111-4846"},{"last_name":"Hussain","first_name":"Tayyaba","full_name":"Hussain, Tayyaba"},{"first_name":"Joonyoung","last_name":"Choi","full_name":"Choi, Joonyoung"},{"last_name":"Lee","first_name":"Nara","full_name":"Lee, Nara"},{"last_name":"Choi","first_name":"Young Jai","full_name":"Choi, Young Jai"},{"first_name":"Woun","last_name":"Kang","full_name":"Kang, Woun"},{"last_name":"Jo","first_name":"Younjung","full_name":"Jo, Younjung"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","file_date_updated":"2022-02-07T10:35:28Z","date_updated":"2026-08-12T14:03:01Z","fulldoi":"https://doi.org/10.1088/1361-648X/ac484d","issue":"13","month":"01","has_accepted_license":"1","title":"Low-field magnetic anisotropy of Sr2IrO4","publication":"Journal of Physics: Condensed Matter","date_created":"2022-02-06T23:01:31Z"},{"file":[{"date_created":"2022-07-27T09:30:30Z","content_type":"application/pdf","checksum":"95903f9d1649e8e437a967b6f2f64730","file_id":"11661","access_level":"open_access","relation":"main_file","creator":"scultrer","file_size":564836,"file_name":"window 1.pdf","date_updated":"2022-07-27T09:30:30Z"}],"day":"25","author":[{"last_name":"Biswas","first_name":"Ranita","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sebastiano","last_name":"Cultrera di Montesano","full_name":"Cultrera di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"last_name":"Saghafian","first_name":"Morteza","full_name":"Saghafian, Morteza"}],"related_material":{"record":[{"status":"public","id":"15094","relation":"dissertation_contains"},{"id":"13182","status":"public","relation":"later_version"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","file_date_updated":"2022-07-27T09:30:30Z","date_updated":"2026-08-13T09:41:58Z","month":"07","title":"A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs","has_accepted_license":"1","publication":"LIPIcs","date_created":"2022-07-27T09:31:15Z","oa":1,"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"article_processing_charge":"No","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"language":[{"iso":"eng"}],"ddc":["510"],"status":"public","year":"2022","_id":"11660","alternative_title":["LIPIcs"],"date_published":"2022-07-25T00:00:00Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. ","quality_controlled":"1","abstract":[{"text":"We characterize critical points of 1-dimensional maps paired in persistent homology geometrically and this way get elementary proofs of theorems about the symmetry of persistence diagrams and the variation of such maps. In particular, we identify branching points and endpoints of networks as the sole source of asymmetry and relate the cycle basis in persistent homology with a version of the stable marriage problem. Our analysis provides the foundations of fast algorithms for maintaining collections of interrelated sorted lists together with their persistence diagrams. ","lang":"eng"}],"corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa_version":"Submitted Version","citation":{"apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., &#38; Saghafian, M. (n.d.). A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs. <i>LIPIcs</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs. <i>LIPIcs</i>.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “A Window to the Persistence of 1D Maps. I: Geometric Characterization of Critical Point Pairs.” <i>LIPIcs</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, n.d.","mla":"Biswas, Ranita, et al. “A Window to the Persistence of 1D Maps. I: Geometric Characterization of Critical Point Pairs.” <i>LIPIcs</i>, Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs,” <i>LIPIcs</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. A window to the persistence of 1D maps. I: Geometric characterization of critical point pairs. LIPIcs.","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, LIPIcs (n.d.)."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"submitted","ec_funded":1},{"title":"ABP1–TMK auxin perception for global phosphorylation and auxin canalization","has_accepted_license":"1","date_created":"2023-01-16T10:04:48Z","publication":"Nature","date_updated":"2026-08-14T09:33:45Z","fulldoi":"https://doi.org/10.1038/s41586-022-05187-x","file_date_updated":"2023-11-02T17:12:37Z","month":"09","issue":"7927","page":"575-581","day":"15","author":[{"first_name":"Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"},{"first_name":"Michelle C","last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87","full_name":"Gallei, Michelle C","orcid":"0000-0003-1286-7368"},{"first_name":"Zuzana","last_name":"Gelová","full_name":"Gelová, Zuzana","orcid":"0000-0003-4783-1752","id":"0AE74790-0E0B-11E9-ABC7-1ACFE5697425"},{"full_name":"Johnson, Alexander J","orcid":"0000-0002-2739-8843","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander J","last_name":"Johnson"},{"full_name":"Mazur, Ewa","first_name":"Ewa","last_name":"Mazur"},{"id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","full_name":"Monzer, Aline","last_name":"Monzer","first_name":"Aline"},{"orcid":"0000-0002-7244-7237","full_name":"Rodriguez Solovey, Lesia","id":"3922B506-F248-11E8-B48F-1D18A9856A87","last_name":"Rodriguez Solovey","first_name":"Lesia"},{"first_name":"Mark","last_name":"Roosjen","full_name":"Roosjen, Mark"},{"orcid":"0000-0001-7241-2328","full_name":"Verstraeten, Inge","id":"362BF7FE-F248-11E8-B48F-1D18A9856A87","first_name":"Inge","last_name":"Verstraeten"},{"full_name":"Živanović, Branka D.","last_name":"Živanović","first_name":"Branka D."},{"id":"5c243f41-03f3-11ec-841c-96faf48a7ef9","full_name":"Zou, Minxia","last_name":"Zou","first_name":"Minxia"},{"full_name":"Fiedler, Lukas","id":"7c417475-8972-11ed-ae7b-8b674ca26986","last_name":"Fiedler","first_name":"Lukas"},{"full_name":"Giannini, Caterina","id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4","last_name":"Giannini","first_name":"Caterina"},{"last_name":"Grones","first_name":"Peter","full_name":"Grones, Peter"},{"last_name":"Hrtyan","first_name":"Mónika","id":"45A71A74-F248-11E8-B48F-1D18A9856A87","full_name":"Hrtyan, Mónika"},{"id":"3F99E422-F248-11E8-B48F-1D18A9856A87","full_name":"Kaufmann, Walter","orcid":"0000-0001-9735-5315","first_name":"Walter","last_name":"Kaufmann"},{"first_name":"Andre","last_name":"Kuhn","full_name":"Kuhn, Andre"},{"last_name":"Narasimhan","first_name":"Madhumitha","id":"44BF24D0-F248-11E8-B48F-1D18A9856A87","full_name":"Narasimhan, Madhumitha","orcid":"0000-0002-8600-0671"},{"first_name":"Marek","last_name":"Randuch","full_name":"Randuch, Marek","id":"6ac4636d-15b2-11ec-abd3-fb8df79972ae"},{"full_name":"Rýdza, Nikola","last_name":"Rýdza","first_name":"Nikola"},{"first_name":"Koji","last_name":"Takahashi","full_name":"Takahashi, Koji"},{"last_name":"Tan","first_name":"Shutang","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","full_name":"Tan, Shutang","orcid":"0000-0002-0471-8285"},{"id":"e3736151-106c-11ec-b916-c2558e2762c6","full_name":"Teplova, Anastasiia","first_name":"Anastasiia","last_name":"Teplova"},{"first_name":"Toshinori","last_name":"Kinoshita","full_name":"Kinoshita, Toshinori"},{"last_name":"Weijers","first_name":"Dolf","full_name":"Weijers, Dolf"},{"first_name":"Hana","last_name":"Rakusová","full_name":"Rakusová, Hana"}],"type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20364"},{"id":"19395","status":"public","relation":"dissertation_contains"}]},"external_id":{"pmid":["36071161"],"isi":["000851357500002"]},"article_type":"original","file":[{"date_updated":"2023-11-02T17:12:37Z","file_name":"Friml Nature 2022_merged.pdf","file_size":79774945,"relation":"main_file","access_level":"open_access","creator":"amally","success":1,"file_id":"14483","checksum":"a6055c606aefb900bf62ae3e7d15f921","content_type":"application/pdf","date_created":"2023-11-02T17:12:37Z"}],"oa_version":"Submitted Version","abstract":[{"lang":"eng","text":"The phytohormone auxin triggers transcriptional reprogramming through a well-characterized perception machinery in the nucleus. By contrast, mechanisms that underlie fast effects of auxin, such as the regulation of ion fluxes, rapid phosphorylation of proteins or auxin feedback on its transport, remain unclear1,2,3. Whether auxin-binding protein 1 (ABP1) is an auxin receptor has been a source of debate for decades1,4. Here we show that a fraction of Arabidopsis thaliana ABP1 is secreted and binds auxin specifically at an acidic pH that is typical of the apoplast. ABP1 and its plasma-membrane-localized partner, transmembrane kinase 1 (TMK1), are required for the auxin-induced ultrafast global phospho-response and for downstream processes that include the activation of H+-ATPase and accelerated cytoplasmic streaming. abp1 and tmk mutants cannot establish auxin-transporting channels and show defective auxin-induced vasculature formation and regeneration. An ABP1(M2X) variant that lacks the capacity to bind auxin is unable to complement these defects in abp1 mutants. These data indicate that ABP1 is the auxin receptor for TMK1-based cell-surface signalling, which mediates the global phospho-response and auxin canalization."}],"corr_author":"1","ec_funded":1,"publisher":"Springer Nature","publication_status":"published","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"citation":{"chicago":"Friml, Jiří, Michelle C Gallei, Zuzana Gelová, Alexander J Johnson, Ewa Mazur, Aline Monzer, Lesia Rodriguez Solovey, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>. Springer Nature, 2022. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>.","mla":"Friml, Jiří, et al. “ABP1–TMK Auxin Perception for Global Phosphorylation and Auxin Canalization.” <i>Nature</i>, vol. 609, no. 7927, Springer Nature, 2022, pp. 575–81, doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>.","ieee":"J. Friml <i>et al.</i>, “ABP1–TMK auxin perception for global phosphorylation and auxin canalization,” <i>Nature</i>, vol. 609, no. 7927. Springer Nature, pp. 575–581, 2022.","apa":"Friml, J., Gallei, M. C., Gelová, Z., Johnson, A. J., Mazur, E., Monzer, A., … Rakusová, H. (2022). ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-022-05187-x\">https://doi.org/10.1038/s41586-022-05187-x</a>","ama":"Friml J, Gallei MC, Gelová Z, et al. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. <i>Nature</i>. 2022;609(7927):575-581. doi:<a href=\"https://doi.org/10.1038/s41586-022-05187-x\">10.1038/s41586-022-05187-x</a>","ista":"Friml J, Gallei MC, Gelová Z, Johnson AJ, Mazur E, Monzer A, Rodriguez Solovey L, Roosjen M, Verstraeten I, Živanović BD, Zou M, Fiedler L, Giannini C, Grones P, Hrtyan M, Kaufmann W, Kuhn A, Narasimhan M, Randuch M, Rýdza N, Takahashi K, Tan S, Teplova A, Kinoshita T, Weijers D, Rakusová H. 2022. ABP1–TMK auxin perception for global phosphorylation and auxin canalization. Nature. 609(7927), 575–581.","short":"J. Friml, M.C. Gallei, Z. Gelová, A.J. Johnson, E. Mazur, A. Monzer, L. Rodriguez Solovey, M. Roosjen, I. Verstraeten, B.D. Živanović, M. Zou, L. Fiedler, C. Giannini, P. Grones, M. Hrtyan, W. Kaufmann, A. Kuhn, M. Narasimhan, M. Randuch, N. Rýdza, K. Takahashi, S. Tan, A. Teplova, T. Kinoshita, D. Weijers, H. Rakusová, Nature 609 (2022) 575–581."},"intvolume":"       609","_id":"12291","date_published":"2022-09-15T00:00:00Z","status":"public","year":"2022","volume":609,"quality_controlled":"1","doi":"10.1038/s41586-022-05187-x","acknowledgement":"We acknowledge K. Kubiasová for excellent technical assistance, J. Neuhold, A. Lehner and A. Sedivy for technical assistance with protein production and purification at Vienna Biocenter Core Facilities; Creoptix for performing GCI; and the Bioimaging, Electron Microscopy and Life Science Facilities at ISTA, the Plant Sciences Core Facility of CEITEC Masaryk University, the Core Facility CELLIM (MEYS CR, LM2018129 Czech-BioImaging) and J. Sprakel for their assistance. J.F. is grateful to R. Napier for many insightful suggestions and support. We thank all past and present members of the Friml group for their support and for other contributions to this effort to clarify the controversial role of ABP1 over the past seven years. The project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation program (grant agreement no. 742985 to J.F. and 833867 to D.W.); the Austrian Science Fund (FWF; P29988 to J.F.); the Netherlands Organization for Scientific Research (NWO; VICI grant 865.14.001 to D.W. and VENI grant VI.Veni.212.003 to A.K.); the Ministry of Education, Science and Technological Development of the Republic of Serbia (contract no. 451-03-68/2022-14/200053 to B.D.Ž.); and the MEXT/JSPS KAKENHI to K.T. (20K06685) and T.K. (20H05687 and 20H05910).","ddc":["580"],"isi":1,"project":[{"name":"Tracing Evolution of Auxin Transport and Polarity in Plants","call_identifier":"H2020","grant_number":"742985","_id":"261099A6-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"RNA-directed DNA methylation in plant development","grant_number":"P29988","_id":"262EF96E-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"LifeSc"}],"oa":1,"scopus_import":"1","department":[{"_id":"JiFr"},{"_id":"GradSch"},{"_id":"EvBe"},{"_id":"EM-Fac"}],"language":[{"iso":"eng"}],"pmid":1},{"type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","related_material":{"record":[{"id":"11366","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"7808"},{"relation":"part_of_dissertation","status":"public","id":"10666"},{"relation":"part_of_dissertation","status":"public","id":"10667"},{"relation":"part_of_dissertation","status":"public","id":"10665"}]},"day":"12","author":[{"first_name":"Mathias","last_name":"Lechner","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"}],"page":"124","keyword":["neural networks","verification","machine learning"],"file":[{"creator":"mlechner","relation":"source_file","access_level":"closed","file_size":13210143,"date_updated":"2022-05-13T12:49:00Z","file_name":"src.zip","date_created":"2022-05-13T12:33:26Z","file_id":"11378","checksum":"8eefa9c7c10ca7e1a2ccdd731962a645","content_type":"application/zip"},{"file_name":"thesis_main-a2.pdf","file_size":2732536,"date_updated":"2022-05-17T15:19:39Z","creator":"mlechner","access_level":"open_access","relation":"main_file","content_type":"application/pdf","checksum":"1b9e1e5a9a83ed9d89dad2f5133dc026","file_id":"11382","date_created":"2022-05-16T08:02:28Z"}],"supervisor":[{"last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2022-05-12T07:14:01Z","OA_place":"publisher","has_accepted_license":"1","title":"Learning verifiable representations","month":"05","license":"https://creativecommons.org/licenses/by-nd/4.0/","date_updated":"2026-08-19T09:28:05Z","fulldoi":"https://doi.org/10.15479/at:ista:11362","file_date_updated":"2022-05-17T15:19:39Z","ddc":["004"],"language":[{"iso":"eng"}],"degree_awarded":"PhD","article_processing_charge":"No","project":[{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"oa":1,"publication_identifier":{"isbn":["978-3-99078-017-6"]},"ec_funded":1,"publisher":"Institute of Science and Technology Austria","publication_status":"published","citation":{"mla":"Lechner, Mathias. <i>Learning Verifiable Representations</i>. Institute of Science and Technology Austria, 2022, doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>.","chicago":"Lechner, Mathias. “Learning Verifiable Representations.” Institute of Science and Technology Austria, 2022. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>.","ieee":"M. Lechner, “Learning verifiable representations,” Institute of Science and Technology Austria, 2022.","apa":"Lechner, M. (2022). <i>Learning verifiable representations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:11362\">https://doi.org/10.15479/at:ista:11362</a>","ama":"Lechner M. Learning verifiable representations. 2022. doi:<a href=\"https://doi.org/10.15479/at:ista:11362\">10.15479/at:ista:11362</a>","short":"M. Lechner, Learning Verifiable Representations, Institute of Science and Technology Austria, 2022.","ista":"Lechner M. 2022. Learning verifiable representations. Institute of Science and Technology Austria."},"oa_version":"Published Version","tmp":{"image":"/image/cc_by_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","short":"CC BY-ND (4.0)"},"abstract":[{"text":"Deep learning has enabled breakthroughs in challenging computing problems and has emerged as the standard problem-solving tool for computer vision and natural language processing tasks.\r\nOne exception to this trend is safety-critical tasks where robustness and resilience requirements contradict the black-box nature of neural networks. \r\nTo deploy deep learning methods for these tasks, it is vital to provide guarantees on neural network agents' safety and robustness criteria. \r\nThis can be achieved by developing formal verification methods to verify the safety and robustness properties of neural networks.\r\n\r\nOur goal is to design, develop and assess safety verification methods for neural networks to improve their reliability and trustworthiness in real-world applications.\r\nThis thesis establishes techniques for the verification of compressed and adversarially trained models as well as the design of novel neural networks for verifiably safe decision-making.\r\n\r\nFirst, we establish the problem of verifying quantized neural networks. Quantization is a technique that trades numerical precision for the computational efficiency of running a neural network and is widely adopted in industry.\r\nWe show that neglecting the reduced precision when verifying a neural network can lead to wrong conclusions about the robustness and safety of the network, highlighting that novel techniques for quantized network verification are necessary. We introduce several bit-exact verification methods explicitly designed for quantized neural networks and experimentally confirm on realistic networks that the network's robustness and other formal properties are affected by the quantization.\r\n\r\nFurthermore, we perform a case study providing evidence that adversarial training, a standard technique for making neural networks more robust, has detrimental effects on the network's performance. This robustness-accuracy tradeoff has been studied before regarding the accuracy obtained on classification datasets where each data point is independent of all other data points. On the other hand, we investigate the tradeoff empirically in robot learning settings where a both, a high accuracy and a high robustness, are desirable.\r\nOur results suggest that the negative side-effects of adversarial training outweigh its robustness benefits in practice.\r\n\r\nFinally, we consider the problem of verifying safety when running a Bayesian neural network policy in a feedback loop with systems over the infinite time horizon. Bayesian neural networks are probabilistic models for learning uncertainties in the data and are therefore often used on robotic and healthcare applications where data is inherently stochastic.\r\nWe introduce a method for recalibrating Bayesian neural networks so that they yield probability distributions over safe decisions only.\r\nOur method learns a safety certificate that guarantees safety over the infinite time horizon to determine which decisions are safe in every possible state of the system.\r\nWe demonstrate the effectiveness of our approach on a series of reinforcement learning benchmarks.","lang":"eng"}],"corr_author":"1","doi":"10.15479/at:ista:11362","date_published":"2022-05-12T00:00:00Z","_id":"11362","alternative_title":["ISTA Thesis"],"year":"2022","status":"public"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2003.07287"}],"title":"Arithmetic purity of the Hardy-Littlewood property and geometric sieve for affine quadrics","date_created":"2022-02-20T23:01:30Z","publication":"Advances in Mathematics","fulldoi":"https://doi.org/10.1016/j.aim.2022.108236","supplementarymaterial":"no","date_updated":"2026-08-19T13:00:41Z","researchdata_availability":"no","month":"03","issue":"3","author":[{"first_name":"Yang","last_name":"Cao","full_name":"Cao, Yang"},{"id":"21f1b52f-2fd1-11eb-a347-a4cdb9b18a51","full_name":"Huang, Zhizhong","first_name":"Zhizhong","last_name":"Huang"}],"day":"26","arxiv":1,"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["000792517300014"],"arxiv":["2003.07287"]},"das_tickbox":"0","article_type":"original","oa_version":"Preprint","corr_author":"1","abstract":[{"lang":"eng","text":"We establish the Hardy-Littlewood property (à la Borovoi-Rudnick) for Zariski open subsets in affine quadrics of the form q(x1,...,xn)=m, where q is a non-degenerate integral quadratic form in  n>3 variables and m is a non-zero integer. This gives asymptotic formulas for the density of integral points taking coprime polynomial values, which is a quantitative version of the arithmetic purity of strong approximation property off infinity for affine quadrics."}],"publisher":"Elsevier","publication_status":"published","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"citation":{"short":"Y. Cao, Z. Huang, Advances in Mathematics 398 (2022).","ista":"Cao Y, Huang Z. 2022. Arithmetic purity of the Hardy-Littlewood property and geometric sieve for affine quadrics. Advances in Mathematics. 398(3), 108236.","ieee":"Y. Cao and Z. Huang, “Arithmetic purity of the Hardy-Littlewood property and geometric sieve for affine quadrics,” <i>Advances in Mathematics</i>, vol. 398, no. 3. Elsevier, 2022.","chicago":"Cao, Yang, and Zhizhong Huang. “Arithmetic Purity of the Hardy-Littlewood Property and Geometric Sieve for Affine Quadrics.” <i>Advances in Mathematics</i>. Elsevier, 2022. <a href=\"https://doi.org/10.1016/j.aim.2022.108236\">https://doi.org/10.1016/j.aim.2022.108236</a>.","mla":"Cao, Yang, and Zhizhong Huang. “Arithmetic Purity of the Hardy-Littlewood Property and Geometric Sieve for Affine Quadrics.” <i>Advances in Mathematics</i>, vol. 398, no. 3, 108236, Elsevier, 2022, doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108236\">10.1016/j.aim.2022.108236</a>.","apa":"Cao, Y., &#38; Huang, Z. (2022). Arithmetic purity of the Hardy-Littlewood property and geometric sieve for affine quadrics. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2022.108236\">https://doi.org/10.1016/j.aim.2022.108236</a>","ama":"Cao Y, Huang Z. Arithmetic purity of the Hardy-Littlewood property and geometric sieve for affine quadrics. <i>Advances in Mathematics</i>. 2022;398(3). doi:<a href=\"https://doi.org/10.1016/j.aim.2022.108236\">10.1016/j.aim.2022.108236</a>"},"intvolume":"       398","_id":"10765","date_published":"2022-03-26T00:00:00Z","status":"public","year":"2022","quality_controlled":"1","volume":398,"doi":"10.1016/j.aim.2022.108236","acknowledgement":"We are grateful to Mikhail Borovoi, Zeev Rudnick and Olivier Wienberg for their interest in our\r\nwork. We would like to address our gratitude to Ulrich Derenthal for his generous support at Leibniz Universitat Hannover. We are in debt to Tim Browning for an enlightening discussion and to the anonymous referees for critical comments, which lead to overall improvements of various preliminary versions of this paper. Part of this work was carried out and reported during a visit to the University of Science and Technology of China. We thank Yongqi Liang for offering warm hospitality. The first author was supported by a Humboldt-Forschungsstipendium. The second author was supported by grant DE 1646/4-2 of the Deutsche Forschungsgemeinschaft.","isi":1,"article_processing_charge":"No","article_number":"108236","oa":1,"department":[{"_id":"TiBr"}],"scopus_import":"1","language":[{"iso":"eng"}]},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2104.14946","open_access":"1"}],"title":"On the leading constant in the Manin-type conjecture for Campana points","publication":"Acta Arithmetica","date_created":"2024-05-28T13:39:26Z","supplementarymaterial":"no","fulldoi":"https://doi.org/10.4064/aa210430-1-7","date_updated":"2026-08-19T12:54:59Z","researchdata_availability":"no","issue":"4","month":"08","author":[{"id":"440EB050-F248-11E8-B48F-1D18A9856A87","full_name":"Shute, Alec L","orcid":"0000-0002-1812-2810","last_name":"Shute","first_name":"Alec L"}],"day":"22","page":"317-346","arxiv":1,"type":"journal_article","related_material":{"record":[{"status":"public","id":"12077","relation":"earlier_version"}]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"arxiv":["2104.14946"],"isi":["000844789100001"]},"das_tickbox":"0","article_type":"original","oa_version":"Preprint","abstract":[{"text":"We compare the Manin-type conjecture for Campana points recently formulated by Pieropan, Smeets, Tanimoto and Várilly-Alvarado with an alternative prediction of Browning and Van Valckenborgh in the special case of the orbifold (P1,D), where D=1/2[0]+1/2[1]+1/2[∞]. We find that the two predicted leading constants do not agree, and we discuss whether thin sets could explain this discrepancy. Motivated by this, we provide a counterexample to the Manin-type conjecture for Campana points, by considering orbifolds corresponding to squareful values of binary quadratic forms.","lang":"eng"}],"corr_author":"1","publication_identifier":{"issn":["0065-1036"],"eissn":["1730-6264"]},"publication_status":"published","publisher":"Institute of Mathematics","intvolume":"       204","citation":{"apa":"Shute, A. L. (2022). On the leading constant in the Manin-type conjecture for Campana points. <i>Acta Arithmetica</i>. Institute of Mathematics. <a href=\"https://doi.org/10.4064/aa210430-1-7\">https://doi.org/10.4064/aa210430-1-7</a>","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. <i>Acta Arithmetica</i>. 2022;204(4):317-346. doi:<a href=\"https://doi.org/10.4064/aa210430-1-7\">10.4064/aa210430-1-7</a>","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” <i>Acta Arithmetica</i>, vol. 204, no. 4. Institute of Mathematics, pp. 317–346, 2022.","mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>Acta Arithmetica</i>, vol. 204, no. 4, Institute of Mathematics, 2022, pp. 317–46, doi:<a href=\"https://doi.org/10.4064/aa210430-1-7\">10.4064/aa210430-1-7</a>.","chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” <i>Acta Arithmetica</i>. Institute of Mathematics, 2022. <a href=\"https://doi.org/10.4064/aa210430-1-7\">https://doi.org/10.4064/aa210430-1-7</a>.","short":"A.L. Shute, Acta Arithmetica 204 (2022) 317–346.","ista":"Shute AL. 2022. On the leading constant in the Manin-type conjecture for Campana points. Acta Arithmetica. 204(4), 317–346."},"date_published":"2022-08-22T00:00:00Z","_id":"17058","year":"2022","status":"public","quality_controlled":"1","volume":204,"doi":"10.4064/aa210430-1-7","isi":1,"article_processing_charge":"No","department":[{"_id":"TiBr"}],"scopus_import":"1","oa":1,"language":[{"iso":"eng"}]},{"month":"12","issue":"12","fulldoi":"https://doi.org/10.1103/PhysRevMaterials.6.125605","date_updated":"2026-08-27T11:42:43Z","publication":"Physical Review Materials","date_created":"2023-01-08T23:00:53Z","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2209.01889","open_access":"1"}],"title":"Quantifying nanoscale charge density features of contact-charged surfaces with an FEM/KPFM-hybrid approach","article_type":"original","external_id":{"isi":["000908384800001"],"arxiv":["2209.01889"]},"type":"journal_article","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","related_material":{"record":[{"id":"20203","status":"public","relation":"dissertation_contains"},{"status":"public","id":"22684","relation":"dissertation_contains"}]},"day":"29","author":[{"last_name":"Pertl","first_name":"Felix","orcid":"0000-0003-0463-5794","full_name":"Pertl, Felix","id":"6313aec0-15b2-11ec-abd3-ed67d16139af"},{"first_name":"Juan Carlos A","last_name":"Sobarzo Ponce","full_name":"Sobarzo Ponce, Juan Carlos A","id":"4B807D68-AE37-11E9-AC72-31CAE5697425"},{"first_name":"Lubuna B","last_name":"Shafeek","orcid":"0000-0001-7180-6050","full_name":"Shafeek, Lubuna B","id":"3CD37A82-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Cramer, Tobias","first_name":"Tobias","last_name":"Cramer"},{"last_name":"Waitukaitis","first_name":"Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R"}],"arxiv":1,"volume":6,"quality_controlled":"1","doi":"10.1103/PhysRevMaterials.6.125605","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 949120). This research was supported by the Scientific Service Units of the Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine\r\nShop, the Nanofabrication Facility, and the Scientific Computing Facility. We thank F. Stumpf from Park Systems for useful discussions and support with scanning probe microscopy.\r\nF.P. and J.C.S. contributed equally to this work.","_id":"12109","date_published":"2022-12-29T00:00:00Z","status":"public","year":"2022","publication_status":"published","ec_funded":1,"publisher":"American Physical Society","publication_identifier":{"eissn":["2475-9953"]},"citation":{"short":"F. Pertl, J.C.A. Sobarzo Ponce, L.B. Shafeek, T. Cramer, S.R. Waitukaitis, Physical Review Materials 6 (2022).","ista":"Pertl F, Sobarzo Ponce JCA, Shafeek LB, Cramer T, Waitukaitis SR. 2022. Quantifying nanoscale charge density features of contact-charged surfaces with an FEM/KPFM-hybrid approach. Physical Review Materials. 6(12), 125605.","mla":"Pertl, Felix, et al. “Quantifying Nanoscale Charge Density Features of Contact-Charged Surfaces with an FEM/KPFM-Hybrid Approach.” <i>Physical Review Materials</i>, vol. 6, no. 12, 125605, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.6.125605\">10.1103/PhysRevMaterials.6.125605</a>.","ieee":"F. Pertl, J. C. A. Sobarzo Ponce, L. B. Shafeek, T. Cramer, and S. R. Waitukaitis, “Quantifying nanoscale charge density features of contact-charged surfaces with an FEM/KPFM-hybrid approach,” <i>Physical Review Materials</i>, vol. 6, no. 12. American Physical Society, 2022.","chicago":"Pertl, Felix, Juan Carlos A Sobarzo Ponce, Lubuna B Shafeek, Tobias Cramer, and Scott R Waitukaitis. “Quantifying Nanoscale Charge Density Features of Contact-Charged Surfaces with an FEM/KPFM-Hybrid Approach.” <i>Physical Review Materials</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/PhysRevMaterials.6.125605\">https://doi.org/10.1103/PhysRevMaterials.6.125605</a>.","apa":"Pertl, F., Sobarzo Ponce, J. C. A., Shafeek, L. B., Cramer, T., &#38; Waitukaitis, S. R. (2022). Quantifying nanoscale charge density features of contact-charged surfaces with an FEM/KPFM-hybrid approach. <i>Physical Review Materials</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevMaterials.6.125605\">https://doi.org/10.1103/PhysRevMaterials.6.125605</a>","ama":"Pertl F, Sobarzo Ponce JCA, Shafeek LB, Cramer T, Waitukaitis SR. Quantifying nanoscale charge density features of contact-charged surfaces with an FEM/KPFM-hybrid approach. <i>Physical Review Materials</i>. 2022;6(12). doi:<a href=\"https://doi.org/10.1103/PhysRevMaterials.6.125605\">10.1103/PhysRevMaterials.6.125605</a>"},"intvolume":"         6","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Kelvin probe force microscopy (KPFM) is a powerful tool for studying contact electrification (CE) at the nanoscale, but converting KPFM voltage maps to charge density maps is nontrivial due to long-range forces and complex system geometry. Here we present a strategy using finite-element method (FEM) simulations to determine the Green's function of the KPFM probe/insulator/ground system, which allows us to quantitatively extract surface charge. Testing our approach with synthetic data, we find that accounting for the atomic force microscope (AFM) tip, cone, and cantilever is necessary to recover a known input and that existing methods lead to gross miscalculation or even the incorrect sign of the underlying charge. Applying it to experimental data, we demonstrate its capacity to extract realistic surface charge densities and fine details from contact-charged surfaces. Our method gives a straightforward recipe to convert qualitative KPFM voltage data into quantitative charge data over a range of experimental conditions, enabling quantitative CE at the nanoscale."}],"corr_author":"1","language":[{"iso":"eng"}],"article_processing_charge":"No","project":[{"grant_number":"949120","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","call_identifier":"H2020","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa"}],"article_number":"125605","oa":1,"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"}],"scopus_import":"1","department":[{"_id":"ScWa"},{"_id":"NanoFab"}],"isi":1},{"place":"Cham","external_id":{"isi":["000832305300028"]},"author":[{"last_name":"Alwen","first_name":"Joël","full_name":"Alwen, Joël"},{"last_name":"Auerbach","first_name":"Benedikt","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","orcid":"0000-0002-7553-6606","full_name":"Auerbach, Benedikt"},{"first_name":"Miguel","last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel"},{"last_name":"Klein","first_name":"Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","full_name":"Klein, Karen"},{"full_name":"Pascual Perez, Guillermo","orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","last_name":"Pascual Perez"},{"first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"}],"day":"25","page":"815–844","type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18088"}]},"fulldoi":"https://doi.org/10.1007/978-3-031-07085-3_28","date_updated":"2026-09-07T14:12:36Z","month":"05","main_file_link":[{"url":"https://eprint.iacr.org/2022/251","open_access":"1"}],"title":"CoCoA: Concurrent continuous group key agreement","date_created":"2022-06-30T16:48:00Z","publication":"Advances in Cryptology – EUROCRYPT 2022","project":[{"_id":"258AA5B2-B435-11E9-9278-68D0E5697425","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","grant_number":"682815"},{"grant_number":"665385","name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"KrPi"}],"oa":1,"language":[{"iso":"eng"}],"isi":1,"date_published":"2022-05-25T00:00:00Z","alternative_title":["LNCS"],"_id":"11476","year":"2022","status":"public","volume":13276,"quality_controlled":"1","acknowledgement":"We thank Marta Mularczyk and Yiannis Tselekounis for their very helpful feedback on an earlier draft of this paper.","doi":"10.1007/978-3-031-07085-3_28","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Messaging platforms like Signal are widely deployed and provide strong security in an asynchronous setting. It is a challenging problem to construct a protocol with similar security guarantees that can efficiently scale to large groups. A major bottleneck are the frequent key rotations users need to perform to achieve post compromise forward security.\r\n\r\nIn current proposals – most notably in TreeKEM (which is part of the IETF’s Messaging Layer Security (MLS) protocol draft) – for users in a group of size n to rotate their keys, they must each craft a message of size log(n) to be broadcast to the group using an (untrusted) delivery server.\r\n\r\nIn larger groups, having users sequentially rotate their keys requires too much bandwidth (or takes too long), so variants allowing any T≤n users to simultaneously rotate their keys in just 2 communication rounds have been suggested (e.g. “Propose and Commit” by MLS). Unfortunately, 2-round concurrent updates are either damaging or expensive (or both); i.e. they either result in future operations being more costly (e.g. via “blanking” or “tainting”) or are costly themselves requiring Ω(T) communication for each user [Bienstock et al., TCC’20].\r\n\r\nIn this paper we propose CoCoA; a new scheme that allows for T concurrent updates that are neither damaging nor costly. That is, they add no cost to future operations yet they only require Ω(log2(n)) communication per user. To circumvent the [Bienstock et al.] lower bound, CoCoA increases the number of rounds needed to complete all updates from 2 up to (at most) log(n); though typically fewer rounds are needed.\r\n\r\nThe key insight of our protocol is the following: in the (non-concurrent version of) TreeKEM, a delivery server which gets T concurrent update requests will approve one and reject the remaining T−1. In contrast, our server attempts to apply all of them. If more than one user requests to rotate the same key during a round, the server arbitrarily picks a winner. Surprisingly, we prove that regardless of how the server chooses the winners, all previously compromised users will recover after at most log(n) such update rounds.\r\n\r\nTo keep the communication complexity low, CoCoA is a server-aided CGKA. That is, the delivery server no longer blindly forwards packets, but instead actively computes individualized packets tailored to each user. As the server is untrusted, this change requires us to develop new mechanisms ensuring robustness of the protocol."}],"corr_author":"1","publication_identifier":{"eisbn":["9783031070853"],"issn":["0302-9743"],"isbn":["9783031070846"],"eissn":["1611-3349"]},"ec_funded":1,"publication_status":"published","publisher":"Springer Nature","intvolume":"     13276","conference":{"location":"Trondheim, Norway","end_date":"2022-06-03","start_date":"2022-05-30","name":"EUROCRYPT: Theory and Applications of Cryptology and Information Security"},"citation":{"short":"J. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, in:, Advances in Cryptology – EUROCRYPT 2022, Springer Nature, Cham, 2022, pp. 815–844.","ista":"Alwen J, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ, Walter M. 2022. CoCoA: Concurrent continuous group key agreement. Advances in Cryptology – EUROCRYPT 2022. EUROCRYPT: Theory and Applications of Cryptology and Information Security, LNCS, vol. 13276, 815–844.","mla":"Alwen, Joël, et al. “CoCoA: Concurrent Continuous Group Key Agreement.” <i>Advances in Cryptology – EUROCRYPT 2022</i>, vol. 13276, Springer Nature, 2022, pp. 815–844, doi:<a href=\"https://doi.org/10.1007/978-3-031-07085-3_28\">10.1007/978-3-031-07085-3_28</a>.","chicago":"Alwen, Joël, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, and Michael Walter. “CoCoA: Concurrent Continuous Group Key Agreement.” In <i>Advances in Cryptology – EUROCRYPT 2022</i>, 13276:815–844. Cham: Springer Nature, 2022. <a href=\"https://doi.org/10.1007/978-3-031-07085-3_28\">https://doi.org/10.1007/978-3-031-07085-3_28</a>.","ieee":"J. Alwen <i>et al.</i>, “CoCoA: Concurrent continuous group key agreement,” in <i>Advances in Cryptology – EUROCRYPT 2022</i>, Trondheim, Norway, 2022, vol. 13276, pp. 815–844.","ama":"Alwen J, Auerbach B, Cueto Noval M, et al. CoCoA: Concurrent continuous group key agreement. In: <i>Advances in Cryptology – EUROCRYPT 2022</i>. Vol 13276. Cham: Springer Nature; 2022:815–844. doi:<a href=\"https://doi.org/10.1007/978-3-031-07085-3_28\">10.1007/978-3-031-07085-3_28</a>","apa":"Alwen, J., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., Pietrzak, K. Z., &#38; Walter, M. (2022). CoCoA: Concurrent continuous group key agreement. In <i>Advances in Cryptology – EUROCRYPT 2022</i> (Vol. 13276, pp. 815–844). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-07085-3_28\">https://doi.org/10.1007/978-3-031-07085-3_28</a>"}},{"file":[{"relation":"main_file","access_level":"open_access","success":1,"creator":"dernst","file_name":"2022_LIPICs_Chatterjee.pdf","file_size":657396,"date_updated":"2023-01-20T10:19:19Z","date_created":"2023-01-20T10:19:19Z","content_type":"application/pdf","checksum":"a21e3ba2421e2c4a06aa2cb6d530ede1","file_id":"12323"}],"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"dissertation_contains","id":"20138","status":"public"}]},"day":"14","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Ibsen-Jensen, Rasmus","orcid":"0000-0003-4783-0389","id":"3B699956-F248-11E8-B48F-1D18A9856A87","first_name":"Rasmus","last_name":"Ibsen-Jensen"},{"first_name":"Ismael R","last_name":"Jecker","id":"85D7C63E-7D5D-11E9-9C0F-98C4E5697425","full_name":"Jecker, Ismael R"},{"orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","first_name":"Jakub"}],"month":"12","fulldoi":"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11","date_updated":"2026-09-16T06:59:32Z","file_date_updated":"2023-01-20T10:19:19Z","date_created":"2023-01-01T23:00:50Z","publication":"42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science","title":"Complexity of spatial games","has_accepted_license":"1","language":[{"iso":"eng"}],"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"article_processing_charge":"No","oa":1,"article_number":"11:1-11:14","scopus_import":"1","department":[{"_id":"KrCh"}],"ddc":["000"],"volume":250,"quality_controlled":"1","doi":"10.4230/LIPIcs.FSTTCS.2022.11","acknowledgement":"Krishnendu Chatterjee: The research was partially supported by the ERC CoG 863818\r\n(ForM-SMArt).\r\nIsmaël Jecker: The research was partially supported by the ERC grant 950398 (INFSYS).\r\nJakub Svoboda: The research was partially supported by the ERC CoG 863818 (ForM-SMArt)","_id":"12101","date_published":"2022-12-14T00:00:00Z","status":"public","year":"2022","ec_funded":1,"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["9783959772617"],"issn":["1868-8969"]},"conference":{"name":"FSTTCS: Foundations of Software Technology and Theoretical Computer Science","start_date":"2022-12-18","end_date":"2022-12-20","location":"Madras, India"},"citation":{"chicago":"Chatterjee, Krishnendu, Rasmus Ibsen-Jensen, Ismael R Jecker, and Jakub Svoboda. “Complexity of Spatial Games.” In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Vol. 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11</a>.","mla":"Chatterjee, Krishnendu, et al. “Complexity of Spatial Games.” <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 250, 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11\">10.4230/LIPIcs.FSTTCS.2022.11</a>.","ieee":"K. Chatterjee, R. Ibsen-Jensen, I. R. Jecker, and J. Svoboda, “Complexity of spatial games,” in <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Madras, India, 2022, vol. 250.","apa":"Chatterjee, K., Ibsen-Jensen, R., Jecker, I. R., &#38; Svoboda, J. (2022). Complexity of spatial games. In <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 250). Madras, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11\">https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11</a>","ama":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. Complexity of spatial games. In: <i>42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 250. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2022. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FSTTCS.2022.11\">10.4230/LIPIcs.FSTTCS.2022.11</a>","ista":"Chatterjee K, Ibsen-Jensen R, Jecker IR, Svoboda J. 2022. Complexity of spatial games. 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Foundations of Software Technology and Theoretical Computer Science vol. 250, 11:1-11:14.","short":"K. Chatterjee, R. Ibsen-Jensen, I.R. Jecker, J. Svoboda, in:, 42nd IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2022."},"intvolume":"       250","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","corr_author":"1","abstract":[{"lang":"eng","text":"Spatial games form a widely-studied class of games from biology and physics modeling the evolution of social behavior. Formally, such a game is defined by a square (d by d) payoff matrix M and an undirected graph G. Each vertex of G represents an individual, that initially follows some strategy i ∈ {1,2,…,d}. In each round of the game, every individual plays the matrix game with each of its neighbors: An individual following strategy i meeting a neighbor following strategy j receives a payoff equal to the entry (i,j) of M. Then, each individual updates its strategy to its neighbors' strategy with the highest sum of payoffs, and the next round starts. The basic computational problems consist of reachability between configurations and the average frequency of a strategy. For general spatial games and graphs, these problems are in PSPACE. In this paper, we examine restricted setting: the game is a prisoner’s dilemma; and G is a subgraph of grid. We prove that basic computational problems for spatial games with prisoner’s dilemma on a subgraph of a grid are PSPACE-hard."}]},{"type":"journal_article","related_material":{"record":[{"id":"20138","status":"public","relation":"dissertation_contains"}]},"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","day":"29","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","last_name":"Zikelic"},{"last_name":"Pavlogiannis","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87","full_name":"Pavlogiannis, Andreas","orcid":"0000-0002-8943-0722"},{"first_name":"Josef","last_name":"Tkadlec","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684"}],"arxiv":1,"article_type":"original","external_id":{"isi":["000870243100001"],"arxiv":["2210.02394"]},"publication":"Physical Review E","date_created":"2023-01-16T09:57:57Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2210.02394","open_access":"1"}],"title":"Social balance on networks: Local minima and best-edge dynamics","issue":"3","month":"09","date_updated":"2026-09-16T06:59:33Z","fulldoi":"https://doi.org/10.1103/physreve.106.034321","isi":1,"language":[{"iso":"eng"}],"project":[{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","grant_number":"P 23499-N23","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"article_processing_charge":"No","scopus_import":"1","department":[{"_id":"KrCh"}],"article_number":"034321","oa":1,"publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"publication_status":"published","ec_funded":1,"publisher":"American Physical Society","intvolume":"       106","citation":{"short":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, J. Tkadlec, Physical Review E 106 (2022).","ista":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. 2022. Social balance on networks: Local minima and best-edge dynamics. Physical Review E. 106(3), 034321.","ama":"Chatterjee K, Svoboda J, Zikelic D, Pavlogiannis A, Tkadlec J. Social balance on networks: Local minima and best-edge dynamics. <i>Physical Review E</i>. 2022;106(3). doi:<a href=\"https://doi.org/10.1103/physreve.106.034321\">10.1103/physreve.106.034321</a>","apa":"Chatterjee, K., Svoboda, J., Zikelic, D., Pavlogiannis, A., &#38; Tkadlec, J. (2022). Social balance on networks: Local minima and best-edge dynamics. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physreve.106.034321\">https://doi.org/10.1103/physreve.106.034321</a>","chicago":"Chatterjee, Krishnendu, Jakub Svoboda, Dorde Zikelic, Andreas Pavlogiannis, and Josef Tkadlec. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” <i>Physical Review E</i>. American Physical Society, 2022. <a href=\"https://doi.org/10.1103/physreve.106.034321\">https://doi.org/10.1103/physreve.106.034321</a>.","mla":"Chatterjee, Krishnendu, et al. “Social Balance on Networks: Local Minima and Best-Edge Dynamics.” <i>Physical Review E</i>, vol. 106, no. 3, 034321, American Physical Society, 2022, doi:<a href=\"https://doi.org/10.1103/physreve.106.034321\">10.1103/physreve.106.034321</a>.","ieee":"K. Chatterjee, J. Svoboda, D. Zikelic, A. Pavlogiannis, and J. Tkadlec, “Social balance on networks: Local minima and best-edge dynamics,” <i>Physical Review E</i>, vol. 106, no. 3. American Physical Society, 2022."},"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Structural balance theory is an established framework for studying social relationships of friendship and enmity. These relationships are modeled by a signed network whose energy potential measures the level of imbalance, while stochastic dynamics drives the network toward a state of minimum energy that captures social balance. It is known that this energy landscape has local minima that can trap socially aware dynamics, preventing it from reaching balance. Here we first study the robustness and attractor properties of these local minima. We show that a stochastic process can reach them from an abundance of initial states and that some local minima cannot be escaped by mild perturbations of the network. Motivated by these anomalies, we introduce best-edge dynamics (BED), a new plausible stochastic process. We prove that BED always reaches balance and that it does so fast in various interesting settings."}],"quality_controlled":"1","volume":106,"acknowledgement":"K.C. acknowledges support from ERC Start Grant No. (279307: Graph Games), ERC Consolidator Grant No. (863818: ForM-SMart), and Austrian Science Fund (FWF)\r\nGrants No. P23499-N23 and No. S11407-N23 (RiSE). This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie\r\nSkłodowska-Curie Grant Agreement No. 665385.","doi":"10.1103/physreve.106.034321","date_published":"2022-09-29T00:00:00Z","_id":"12257","year":"2022","status":"public"}]