[{"abstract":[{"text":"We investigate magnetic active matter in confined geometries using both experiments with magnetic toy robots, Hexbugs, and simulations of elongated magnetic active Brownian particles in circular domains. Standard active particles tend to accumulate at boundaries, forming clusters even at relatively low densities. In the presence of magnetic interactions, we provide evidence for a  effect that inhibits clustering and shifts its onset to higher packing fractions. Moreover, magnetic dipolar interactions give rise to collective behaviors such as train-like formations, rotating pairs, and rotating clusters.","lang":"eng"}],"researchdata_availability":"no","date_updated":"2026-07-14T07:00:17Z","scopus_import":"1","date_created":"2026-07-13T10:53:06Z","acknowledgement":"The authors acknowledge discussions with Lorenzo\r\nCaprini. A.G., M.P., and A.P. acknowledge funding from the\r\nItalianMinistero dell’Università e della Ricerca under the program\r\nPRIN 2022 (“Re-ranking of the final lists”), Grants No.\r\n2022KWTEB7 with CUP No. B53C24006470006. L.A. acknowledges\r\nfunding from the ItalianMinistero dell’Università\r\ne della Ricerca under the program PRIN 2020, Grant No.\r\n2020PFCXPE.","external_id":{"arxiv":["2511.21472"]},"dataavailabilitystatement":"The data that support the findings of this article are not\r\npublicly available upon publication because it is not technically\r\nfeasible and/or the cost of preparing, depositing, and\r\nhosting the data would be prohibitive within the terms of this\r\nresearch project. The data are available from the authors upon\r\nreasonable request.","article_type":"original","doi":"10.1103/hylm-ljlf","article_processing_charge":"Yes (in subscription journal)","citation":{"ieee":"M. Musacchio, M. Felber, M. Paoluzzi, A. Gnoli, A. Puglisi, and L. Angelani, “Fluidization induced by magnetic interactions in confined active matter,” <i>Physical Review E</i>, vol. 113, no. 5. American Physical Society, 2026.","ama":"Musacchio M, Felber M, Paoluzzi M, Gnoli A, Puglisi A, Angelani L. Fluidization induced by magnetic interactions in confined active matter. <i>Physical Review E</i>. 2026;113(5). doi:<a href=\"https://doi.org/10.1103/hylm-ljlf\">10.1103/hylm-ljlf</a>","chicago":"Musacchio, Marco, Markus Felber, Matteo Paoluzzi, Andrea Gnoli, Andrea Puglisi, and Luca Angelani. “Fluidization Induced by Magnetic Interactions in Confined Active Matter.” <i>Physical Review E</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/hylm-ljlf\">https://doi.org/10.1103/hylm-ljlf</a>.","short":"M. Musacchio, M. Felber, M. Paoluzzi, A. Gnoli, A. Puglisi, L. Angelani, Physical Review E 113 (2026).","ista":"Musacchio M, Felber M, Paoluzzi M, Gnoli A, Puglisi A, Angelani L. 2026. Fluidization induced by magnetic interactions in confined active matter. Physical Review E. 113(5), 055413.","mla":"Musacchio, Marco, et al. “Fluidization Induced by Magnetic Interactions in Confined Active Matter.” <i>Physical Review E</i>, vol. 113, no. 5, 055413, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/hylm-ljlf\">10.1103/hylm-ljlf</a>.","apa":"Musacchio, M., Felber, M., Paoluzzi, M., Gnoli, A., Puglisi, A., &#38; Angelani, L. (2026). Fluidization induced by magnetic interactions in confined active matter. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/hylm-ljlf\">https://doi.org/10.1103/hylm-ljlf</a>"},"_id":"22307","day":"18","article_number":"055413","date_published":"2026-05-18T00:00:00Z","publisher":"American Physical Society","file":[{"content_type":"application/pdf","date_created":"2026-07-14T06:58:35Z","file_id":"22332","access_level":"open_access","checksum":"f029efcf6dd51e10e3bc7623b5365da6","success":1,"file_name":"2026_PhysicalReviewE_Musacchio.pdf","creator":"dernst","relation":"main_file","file_size":1836050,"date_updated":"2026-07-14T06:58:35Z"}],"publication":"Physical Review E","department":[{"_id":"ScWa"},{"_id":"GradSch"}],"month":"05","year":"2026","OA_type":"hybrid","type":"journal_article","publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"has_accepted_license":"1","issue":"5","intvolume":"       113","author":[{"first_name":"Marco","full_name":"Musacchio, Marco","last_name":"Musacchio"},{"full_name":"Felber, Markus","first_name":"Markus","id":"c12d7e3a-4e8f-11ef-ad48-ffba54b8aa10","last_name":"Felber"},{"full_name":"Paoluzzi, Matteo","first_name":"Matteo","last_name":"Paoluzzi"},{"full_name":"Gnoli, Andrea","first_name":"Andrea","last_name":"Gnoli"},{"last_name":"Puglisi","full_name":"Puglisi, Andrea","first_name":"Andrea"},{"first_name":"Luca","full_name":"Angelani, Luca","last_name":"Angelani"}],"oa":1,"supplementarymaterial":"no","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","ddc":["530"],"status":"public","file_date_updated":"2026-07-14T06:58:35Z","publication_status":"published","quality_controlled":"1","oa_version":"Published Version","PlanS_conform":"1","volume":113,"title":"Fluidization induced by magnetic interactions in confined active matter","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"oa_version":"Preprint","language":[{"iso":"eng"}],"page":"6404–6418","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"title":"Speculative decoding speed-of-light: Optimal lower bounds via branching random walks","corr_author":"1","publication_status":"published","quality_controlled":"1","status":"public","OA_place":"repository","supplementarymaterial":"no","das_tickbox":"0","author":[{"last_name":"Pankratov","id":"f773bf05-72ef-11ef-b75a-a383d22f454b","first_name":"Sergei","full_name":"Pankratov, Sergei"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"year":"2026","month":"04","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"type":"conference","OA_type":"green","day":"01","publication":"Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics","publisher":"Association for Computational Linguistics","date_published":"2026-04-01T00:00:00Z","doi":"10.18653/v1/2026.eacl-long.301","external_id":{"arxiv":["2512.11718"]},"date_created":"2026-07-13T10:48:03Z","_id":"22302","citation":{"ieee":"S. Pankratov and D.-A. Alistarh, “Speculative decoding speed-of-light: Optimal lower bounds via branching random walks,” in <i>Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics</i>, Rabat, Morocco, 2026, pp. 6404–6418.","ama":"Pankratov S, Alistarh D-A. Speculative decoding speed-of-light: Optimal lower bounds via branching random walks. In: <i>Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics</i>. Association for Computational Linguistics; 2026:6404–6418. doi:<a href=\"https://doi.org/10.18653/v1/2026.eacl-long.301\">10.18653/v1/2026.eacl-long.301</a>","short":"S. Pankratov, D.-A. Alistarh, in:, Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics, Association for Computational Linguistics, 2026, pp. 6404–6418.","chicago":"Pankratov, Sergei, and Dan-Adrian Alistarh. “Speculative Decoding Speed-of-Light: Optimal Lower Bounds via Branching Random Walks.” In <i>Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics</i>, 6404–6418. Association for Computational Linguistics, 2026. <a href=\"https://doi.org/10.18653/v1/2026.eacl-long.301\">https://doi.org/10.18653/v1/2026.eacl-long.301</a>.","mla":"Pankratov, Sergei, and Dan-Adrian Alistarh. “Speculative Decoding Speed-of-Light: Optimal Lower Bounds via Branching Random Walks.” <i>Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics</i>, Association for Computational Linguistics, 2026, pp. 6404–6418, doi:<a href=\"https://doi.org/10.18653/v1/2026.eacl-long.301\">10.18653/v1/2026.eacl-long.301</a>.","ista":"Pankratov S, Alistarh D-A. 2026. Speculative decoding speed-of-light: Optimal lower bounds via branching random walks. Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics. EACL:  Conference of the European Chapter of the Association for Computational Linguistics, 6404–6418.","apa":"Pankratov, S., &#38; Alistarh, D.-A. (2026). Speculative decoding speed-of-light: Optimal lower bounds via branching random walks. In <i>Proceedings of the 19th Conference of the European Chapter of the Association for Computational Linguistics</i> (pp. 6404–6418). Rabat, Morocco: Association for Computational Linguistics. <a href=\"https://doi.org/10.18653/v1/2026.eacl-long.301\">https://doi.org/10.18653/v1/2026.eacl-long.301</a>"},"article_processing_charge":"No","researchdata_availability":"no","abstract":[{"text":"Speculative generation has emerged as a promising technique to accelerate inference in large language models (LLMs) by leveraging parallelism to verify multiple draft tokens simultaneously. However, the fundamental limits on the achievable speedup remain poorly understood. In this work, we establish the first “tight” lower bounds on the runtime of any deterministic speculative generation algorithm. This is achieved by drawing a parallel between the token generation process and branching random walks, which allows us to analyze the optimal draft tree selection problem. We prove, under basic assumptions, that the expected number of tokens successfully predicted per speculative iteration is bounded as \\mathbb{E}[X] ≤ (𝜇 + 𝜇(2))log(B )/𝜇2 + O(1), where B is the verifier’s batch size, 𝜇 is the expected entropy of the verifier’s output distribution, and 𝜇(2) is this entropy’s second moment. This result provides new insights into the limits of parallel token generation, and could guide the design of future speculative decoding systems. Empirical evaluations on Llama models validate our theoretical predictions, confirming the tightness of our bounds in practical settings.","lang":"eng"}],"scopus_import":"1","date_updated":"2026-07-14T06:18:11Z","conference":{"location":"Rabat, Morocco","start_date":"2026-03-24","name":"EACL:  Conference of the European Chapter of the Association for Computational Linguistics","end_date":"2026-03-29"}},{"has_accepted_license":"1","das_tickbox":"1","author":[{"last_name":"Hino","id":"5299a9ce-7679-11eb-a7bc-d1e62b936307","first_name":"Naoya","full_name":"Hino, Naoya"},{"first_name":"Tushna","full_name":"Kapoor, Tushna","last_name":"Kapoor","id":"e3b3eda7-fd4d-11eb-8fd8-c40af7a478b1"},{"last_name":"Gubbala","id":"bb4a0dc4-32c9-11ee-b5ce-a97ceedd5924","first_name":"Uday R","full_name":"Gubbala, Uday R"},{"full_name":"Hannezo, Edouard B","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561","last_name":"Hannezo"},{"id":"39427864-F248-11E8-B48F-1D18A9856A87","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","first_name":"Carl-Philipp J"}],"oa":1,"ddc":["570"],"status":"public","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"supplementarymaterial":"yes","publication_status":"draft","file_date_updated":"2026-07-13T09:16:28Z","oa_version":"Preprint","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Epithelial spreading","tissue tension","mechanosensation","aPKC","Kibra","zebrafish"],"corr_author":"1","title":"Apical domain mechanosensation regulates tissue tension homeostasis","researchdata_availability":"yes","abstract":[{"text":"Tissue tension is a key determinant of tissue shape, and its regulation is essential for both morphogenesis and the maintenance of tissue integrity. During zebrafish embryogenesis, the enveloping layer (EVL) – an epithelial monolayer covering the blastoderm – undergoes extensive spreading that is driven by pulling forces exerted at its margin and more than doubles its surface area. Yet whether and how the EVL actively regulates its tissue tension during this process remains unclear. Here, we show that the EVL maintains constant tissue tension while spreading, and that it achieves this by reducing apical cell contractility in response to the same pulling forces that drive its spreading. We identify a mechanosensitive pathway underlying this response, mediated by the scaffold/adaptor protein Kibra regulating the activity of atypical protein kinase C (aPKC) at the apical domain of EVL cells. Under low mechanical stretch, Kibra forms condensates at the base of actin-based apical projections, where it activates Myosin II to increase apical contractility through aPKC downregulation. As mechanical stretch increases, apical projections disassemble, Kibra condensates dissolve, and aPKC activity rises. Elevated aPKC activity in turn reduces apical contractility by reducing Myosin II activity, thereby maintaining constant tissue tension despite increased mechanical stretch. Together, these findings reveal a mechanosensitive mechanism that enables robust adaptation of tissue tension to changing mechanical stretch, ensuring efficient tissue spreading and morphogenesis.","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"21864"}]},"date_updated":"2026-07-14T07:07:41Z","dataavailabilitystatement":"The MATLAB code for image analysis, and the full model code, including all parameter values\r\nand condition-specific settings, are available on GitHub at https://github.com/uday2607/EVL-tension-homeostasis.git.","acknowledgement":"We thank all members of the Heisenberg group for discussion and feedback on the manuscript, and the Imaging and Optics Facility, the Life Science Support Facility and the Electron Microscopy Facility of the Institute of Science and Technology Austria (ISTA) for their continued support. We are grateful to M. Sonawane (Tata Institute of Fundamental Research, India) for providing the pCS2-HA-aPKC (PKCι)-V260F (DN) and pCS2-HA-aPKC (PKCι)-A122E (CA) plasmids, and to I. Mayer for the discussion. Molecular graphics and analyses were performed with UCSF ChimeraX, developed by the Resource for Biocomputing, Visualization, and Informatics at the University of California, San Francisco, with support from National Institutes of Health R01-GM129325 and the Office of Cyber Infrastructure and Computational Biology, National Institute of Allergy and Infectious Diseases. This research was funded in whole or in part by the Austrian Science Fund (FWF; grant no. PAT5044023) to C.-P.H., and by a JSPS Overseas Research Fellowship and an EMBO Postdoctoral Fellowship (ALTF 16-2022) to N.H.","date_created":"2026-07-13T09:03:26Z","_id":"22276","citation":{"apa":"Hino, N., Kapoor, T., Gubbala, U. R., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (n.d.). Apical domain mechanosensation regulates tissue tension homeostasis. Institute of Science and Technology Austria.","ieee":"N. Hino, T. Kapoor, U. R. Gubbala, E. B. Hannezo, and C.-P. J. Heisenberg, “Apical domain mechanosensation regulates tissue tension homeostasis.” Institute of Science and Technology Austria.","chicago":"Hino, Naoya, Tushna Kapoor, Uday R Gubbala, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Apical Domain Mechanosensation Regulates Tissue Tension Homeostasis.” Institute of Science and Technology Austria, n.d.","ama":"Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation regulates tissue tension homeostasis.","short":"N. Hino, T. Kapoor, U.R. Gubbala, E.B. Hannezo, C.-P.J. Heisenberg, (n.d.).","mla":"Hino, Naoya, et al. <i>Apical Domain Mechanosensation Regulates Tissue Tension Homeostasis</i>. Institute of Science and Technology Austria.","ista":"Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation regulates tissue tension homeostasis."},"article_processing_charge":"No","day":"14","file":[{"date_updated":"2026-07-13T09:16:20Z","file_size":12477675,"relation":"main_file","creator":"nhino","file_name":"Main_text_and_figures.pdf","success":1,"access_level":"open_access","checksum":"66444afd243dce7d383d52d44e8d34a4","date_created":"2026-07-13T09:16:20Z","file_id":"22283","content_type":"application/pdf"},{"success":1,"checksum":"90bceb34de64ec792c5de117f0890d05","access_level":"open_access","file_id":"22284","date_created":"2026-07-13T09:16:25Z","content_type":"application/pdf","file_size":4545901,"date_updated":"2026-07-13T09:16:25Z","relation":"main_file","creator":"nhino","file_name":"Supplementary_figures.pdf"},{"success":1,"checksum":"9d9ab89c372142f2ffb6c8c625334d7f","access_level":"open_access","file_id":"22285","date_created":"2026-07-13T09:16:28Z","content_type":"video/mp4","date_updated":"2026-07-13T09:16:28Z","file_size":10349451,"relation":"main_file","creator":"nhino","file_name":"Supplementary_Video1.mp4"}],"publisher":"Institute of Science and Technology Austria","date_published":"2026-07-14T00:00:00Z","project":[{"grant_number":"PAT 5044023","_id":"8f060199-16d5-11f0-9cad-f3253b266c46","name":"Keratins in epithelial tissue spreading"},{"name":"Mechanosensitive signaling activation in the crosstalk between mechanical force and tissuefluidity","_id":"34dd7f3b-11ca-11ed-8bc3-856f2c87f5da","grant_number":"LTF 16-2022"}],"year":"2026","department":[{"_id":"CaHe"},{"_id":"EdHa"},{"_id":"GradSch"}],"month":"07","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"EM-Fac"}],"OA_type":"green","type":"preprint"},{"article_type":"original","external_id":{"arxiv":["2512.15981"]},"acknowledgement":"Bardiya Aryanfard and Monika Henzinger were supported by the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (Grant agreement\r\nNo. 101019564). For open access purposes, the author has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript version arising from this submission. Funded by the\r\nEuropean union. Views and opinions expressed are however those of the author(s) only and do\r\nnot necessarily reflect those of the European Union or the European Research Council Executive\r\nAgency. Neither the European Union nor the granting authority can be held responsible for them","date_created":"2026-07-14T05:33:58Z","ec_funded":1,"doi":"10.1145/3801903","article_processing_charge":"Yes","_id":"22322","citation":{"mla":"Aryanfard, Bardiya, et al. “Improved Lower Bounds for Privacy under Continual Release.” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2, Association for Computing Machinery, 2026, pp. 1–27, doi:<a href=\"https://doi.org/10.1145/3801903\">10.1145/3801903</a>.","ista":"Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. 2026. Improved lower bounds for privacy under continual release. Proceedings of the ACM on Management of Data. 4(2), 1–27.","chicago":"Aryanfard, Bardiya, Monika Henzinger, David Saulpic, and A. R. Sricharan. “Improved Lower Bounds for Privacy under Continual Release.” <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3801903\">https://doi.org/10.1145/3801903</a>.","ieee":"B. Aryanfard, M. Henzinger, D. Saulpic, and A. R. Sricharan, “Improved lower bounds for privacy under continual release,” <i>Proceedings of the ACM on Management of Data</i>, vol. 4, no. 2. Association for Computing Machinery, pp. 1–27, 2026.","ama":"Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. Improved lower bounds for privacy under continual release. <i>Proceedings of the ACM on Management of Data</i>. 2026;4(2):1-27. doi:<a href=\"https://doi.org/10.1145/3801903\">10.1145/3801903</a>","short":"B. Aryanfard, M. Henzinger, D. Saulpic, A.R. Sricharan, Proceedings of the ACM on Management of Data 4 (2026) 1–27.","apa":"Aryanfard, B., Henzinger, M., Saulpic, D., &#38; Sricharan, A. R. (2026). Improved lower bounds for privacy under continual release. <i>Proceedings of the ACM on Management of Data</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3801903\">https://doi.org/10.1145/3801903</a>"},"researchdata_availability":"no","abstract":[{"text":"We study the problem of continually releasing statistics of an evolving dataset under differential privacy. In the event-level setting, we show the first polynomial lower bounds on the additive error for insertions-only graph problems such as maximum matching, degree histogram and k-core number computation. These results represent an exponential improvement on the polylogarithmic lower bounds of Fichtenberger, Henzinger and Ost [ESA 2021] for the former two problems, and are the first lower bounds in the continual release setting for the latter problem. Our results run counter to the intuition that the difference between insertions-only vs fully dynamic updates causes the gap between polylogarithmic and polynomial additive error. Indeed, we show that for estimating the size of the maximum matching or k-core number of a vertex, allowing small multiplicative approximations is what brings the additive error down to polylogarithmic. We complement these results with improved upper bounds on the additive error when no multiplicative approximation is allowed.\r\nBeyond graphs, our techniques also show that polynomial additive error is unavoidable for the Simultaneous Norm Estimation problem in the insertions-only setting. When multiplicative approximations are allowed, we circumvent this lower bound by giving the first continual mechanism with polylogarithmic additive error under (1 + ζ) multiplicative approximations, for any ζ > 0, for estimating all monotone symmetric norms simultaneously.\r\nIn the item-level setting, we show polynomial lower bounds on the product of the multiplicative and the additive error of continual mechanisms for a large range of graph problems. To the best of our knowledge, these are the first lower bounds shown for any differentially private mechanism under continual release with multiplicative error. To obtain these results, we prove a new lower bound on the product of multiplicative and additive error for the 1-Way-Marginals problem, and give reductions from 1-Way-Marginals to our desired graph problems. This generalizes the prior results of Hardt and Talwar [STOC 2010] and Bun, Ullman and Vadhan [STOC 2014, SIAM J. Comput. 2018], who gave lower bounds on the additive error for the special case of mechanisms with no multiplicative error.","lang":"eng"}],"date_updated":"2026-07-16T09:30:31Z","scopus_import":"1","year":"2026","department":[{"_id":"MoHe"},{"_id":"GradSch"}],"month":"06","publication_identifier":{"issn":["2836-6573"]},"type":"journal_article","OA_type":"gold","day":"01","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"}],"date_published":"2026-06-01T00:00:00Z","publication":"Proceedings of the ACM on Management of Data","file":[{"file_id":"22349","date_created":"2026-07-16T09:29:08Z","content_type":"application/pdf","success":1,"checksum":"21a48a620e415a31a3874077c55bc6c3","access_level":"open_access","file_name":"2026_ACMMgmtData_Aryanfard.pdf","file_size":934963,"date_updated":"2026-07-16T09:29:08Z","relation":"main_file","creator":"dernst"}],"publisher":"Association for Computing Machinery","oa":1,"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","supplementarymaterial":"no","status":"public","ddc":["000"],"has_accepted_license":"1","issue":"2","intvolume":"         4","author":[{"last_name":"Aryanfard","id":"1e8f4084-31df-11ee-b195-f706b4b77091","first_name":"Bardiya","full_name":"Aryanfard, Bardiya"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","last_name":"Saulpic","full_name":"Saulpic, David","first_name":"David"},{"first_name":"A. R.","full_name":"Sricharan, A. R.","last_name":"Sricharan"}],"das_tickbox":"0","oa_version":"Published Version","PlanS_conform":"1","volume":4,"arxiv":1,"title":"Improved lower bounds for privacy under continual release","corr_author":"1","page":"1-27","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","file_date_updated":"2026-07-16T09:29:08Z","quality_controlled":"1"},{"title":"Nonlocal decoding of positional and correlational information during development","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"oa_version":"Published Version","PlanS_conform":"1","volume":137,"quality_controlled":"1","file_date_updated":"2026-07-16T09:54:55Z","publication_status":"published","supplementarymaterial":"no","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["530"],"status":"public","oa":1,"author":[{"id":"81b43fb8-c9d5-11ef-bf68-ade532a1f204","last_name":"Zhang","full_name":"Zhang, Chen Y","first_name":"Chen Y"},{"first_name":"Pablo","full_name":"Mateu Hoyos, Pablo","last_name":"Mateu Hoyos","id":"50b236c7-50c1-11ef-bb9a-a2375694f8b5"},{"full_name":"Brückner, David","first_name":"David","id":"e1e86031-6537-11eb-953a-f7ab92be508d","orcid":"0000-0001-7205-2975","last_name":"Brückner"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper"}],"das_tickbox":"1","has_accepted_license":"1","intvolume":"       137","type":"journal_article","OA_type":"hybrid","publication_identifier":{"issn":["0031-9007"],"eissn":[" 1079-7114"]},"department":[{"_id":"GaTk"},{"_id":"EdHa"},{"_id":"GradSch"}],"month":"07","year":"2026","date_published":"2026-07-15T00:00:00Z","project":[{"grant_number":"101118866","name":"Transcription in 4D: the dynamic interplay between chromatin architecture and gene expression in developing pseudo-embryos","_id":"7bfe6a29-9f16-11ee-852c-c0da5e2045d9"}],"article_number":"038401","file":[{"content_type":"application/pdf","file_id":"22352","date_created":"2026-07-16T09:54:55Z","checksum":"28861d31d0f6cf541aaca04faaed1767","access_level":"open_access","success":1,"file_name":"2026_PhysicalReviewLetters_Zhang.pdf","relation":"main_file","creator":"dernst","file_size":2550345,"date_updated":"2026-07-16T09:54:55Z"}],"publisher":"American Physical Society","publication":"Physical Review Letters","day":"15","article_processing_charge":"Yes (via OA deal)","citation":{"ista":"Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. 2026. Nonlocal decoding of positional and correlational information during development. Physical Review Letters. 137, 038401.","mla":"Zhang, Chen Y., et al. “Nonlocal Decoding of Positional and Correlational Information during Development.” <i>Physical Review Letters</i>, vol. 137, 038401, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/mbjk-v4ym\">10.1103/mbjk-v4ym</a>.","chicago":"Zhang, Chen Y, Pablo Mateu Hoyos, David Brückner, and Gašper Tkačik. “Nonlocal Decoding of Positional and Correlational Information during Development.” <i>Physical Review Letters</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/mbjk-v4ym\">https://doi.org/10.1103/mbjk-v4ym</a>.","short":"C.Y. Zhang, P. Mateu Hoyos, D. Brückner, G. Tkačik, Physical Review Letters 137 (2026).","ieee":"C. Y. Zhang, P. Mateu Hoyos, D. Brückner, and G. Tkačik, “Nonlocal decoding of positional and correlational information during development,” <i>Physical Review Letters</i>, vol. 137. American Physical Society, 2026.","ama":"Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. Nonlocal decoding of positional and correlational information during development. <i>Physical Review Letters</i>. 2026;137. doi:<a href=\"https://doi.org/10.1103/mbjk-v4ym\">10.1103/mbjk-v4ym</a>","apa":"Zhang, C. Y., Mateu Hoyos, P., Brückner, D., &#38; Tkačik, G. (2026). Nonlocal decoding of positional and correlational information during development. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/mbjk-v4ym\">https://doi.org/10.1103/mbjk-v4ym</a>"},"_id":"22326","acknowledgement":"This work was supported in part\r\nby European Research Council No. ERC-2023-SyG\r\n“DynaTrans” Grant No. 101118866 (G. T.). We thank\r\nPieter Rein ten Wolde and Vahe Galstyan for stimulating\r\ndiscussions.","date_created":"2026-07-14T05:38:28Z","dataavailabilitystatement":"Code to evaluate PI, to run algorithmic implementations of ALP and RLP decoding, and to\r\nperform simulations is publicly available at https://github.com/alex-chenyi-zhang/nonlocdec_pici.","article_type":"original","doi":"10.1103/mbjk-v4ym","date_updated":"2026-07-16T09:58:04Z","scopus_import":"1","abstract":[{"text":"In many developmental systems, cells differentiate into a tissue by reading out morphogen concentration fields, a process fundamentally limited by noise. How much can the precision of this process be improved by nonlocal information, e.g., via cell-cell communication? Using a Bayes-optimal framework, we show that positional inference depends crucially on morphogen spatial correlations and on the \"structural prior\" that encodes the geometry of the cellular lattice performing the readout, thereby determining what a cell can reliably assume about the position of its neighbors when interpreting nonlocal morphogen signals. We derive upper bounds on positional information gain due to nonlocal readout and identify signal processing algorithms that approximate optimal positional inference, as well as simple chemical reaction schemes which implement such algorithms. Our theory suggests that correlational information can be exploited to significantly enhance developmental precision.","lang":"eng"}],"researchdata_availability":"no"},{"year":"2026","department":[{"_id":"PaSc"},{"_id":"GradSch"}],"month":"04","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"publication_identifier":{"eissn":["2699-0016"]},"type":"journal_article","OA_type":"gold","day":"16","date_published":"2026-04-16T00:00:00Z","project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"},{"grant_number":"26777","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches"}],"publication":"Magnetic Resonance","publisher":"Copernicus Publications","article_type":"original","date_created":"2026-05-03T22:01:36Z","external_id":{"pmid":["42057802"]},"acknowledgement":"We thank Ben P. Tatman for insightful discussions. This research was supported by the Scientific Service Units (SSUs) of ISTA through resources provided by the Nuclear Magnetic Resonance Facility and the Lab Support Facility. We thank Prof. Tobias Madl (Medical University Graz) for a sample of Omniscan. Lea M. Becker is the recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","doi":"10.5194/mr-7-29-2026","article_processing_charge":"Yes","_id":"21777","main_file_link":[{"url":"https://doi.org/10.5194/mr-7-29-2026","open_access":"1"}],"citation":{"apa":"Becker, L. M., Toscano, G., Kapitonova, A., Singh, R., Guillerm, U., Lichtenecker, R. J., &#38; Schanda, P. (2026). Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. <i>Magnetic Resonance</i>. Copernicus Publications. <a href=\"https://doi.org/10.5194/mr-7-29-2026\">https://doi.org/10.5194/mr-7-29-2026</a>","ieee":"L. M. Becker <i>et al.</i>, “Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants,” <i>Magnetic Resonance</i>, vol. 7, no. 1. Copernicus Publications, pp. 29–37, 2026.","short":"L.M. Becker, G. Toscano, A. Kapitonova, R. Singh, U. Guillerm, R.J. Lichtenecker, P. Schanda, Magnetic Resonance 7 (2026) 29–37.","chicago":"Becker, Lea Marie, Giorgia Toscano, Anna Kapitonova, Rajkumar Singh, Undina Guillerm, Roman J. Lichtenecker, and Paul Schanda. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” <i>Magnetic Resonance</i>. Copernicus Publications, 2026. <a href=\"https://doi.org/10.5194/mr-7-29-2026\">https://doi.org/10.5194/mr-7-29-2026</a>.","ama":"Becker LM, Toscano G, Kapitonova A, et al. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. <i>Magnetic Resonance</i>. 2026;7(1):29-37. doi:<a href=\"https://doi.org/10.5194/mr-7-29-2026\">10.5194/mr-7-29-2026</a>","mla":"Becker, Lea Marie, et al. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” <i>Magnetic Resonance</i>, vol. 7, no. 1, Copernicus Publications, 2026, pp. 29–37, doi:<a href=\"https://doi.org/10.5194/mr-7-29-2026\">10.5194/mr-7-29-2026</a>.","ista":"Becker LM, Toscano G, Kapitonova A, Singh R, Guillerm U, Lichtenecker RJ, Schanda P. 2026. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. Magnetic Resonance. 7(1), 29–37."},"abstract":[{"lang":"eng","text":"The advantageous characteristics attributed to the 19F nucleus have made it a popular target for nuclear magnetic resonance (NMR) once again in recent years. Aside from solution NMR, an increasing number of studies have been conducted applying solid-state magic-angle spinning (MAS) NMR to fluorine-labelled samples. Here, the high chemical shift anisotropy and strong dipolar couplings can be utilised to get structural insights into proteins and measure long distances. Despite increasing popularity and promising benefits, the sensitivity of biomolecular 19F MAS NMR often suffers from slow longitudinal T1 relaxation and therefore long recycle delays. In this work, we expand paramagnetic doping, an approach commonly used to reduce proton T1 relaxation times, to 19F-labelled biological samples. We study the effect of Gd(DTPA) and Gd(DTPA-BMA) on 19F T1 and T2, and 13C T1 and T2 relaxation in a [5-19F13C]-tryptophan-labelled protein via 19F-detected MAS NMR experiments. The observed paramagnetic relaxation enhancement substantially reduces measurement times of 19F MAS NMR experiments without compromising resolution. Additionally, we report the chemical shift assignments of all four fluorotryptophan signals in the 12×39 kDa-large protein TET2 using a mutagenesis approach."}],"date_updated":"2026-07-20T09:49:12Z","scopus_import":"1","related_material":{"record":[{"id":"22334","status":"public","relation":"dissertation_contains"}]},"oa_version":"Published Version","PlanS_conform":"1","volume":7,"DOAJ_listed":"1","title":"Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants","corr_author":"1","page":"29-37","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","quality_controlled":"1","pmid":1,"oa":1,"OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","ddc":["540"],"has_accepted_license":"1","issue":"1","intvolume":"         7","author":[{"first_name":"Lea Marie","full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151","last_name":"Becker","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"},{"last_name":"Toscano","id":"334a5e40-8747-11f0-b671-ba1f5154b4b4","first_name":"Giorgia","full_name":"Toscano, Giorgia"},{"full_name":"Kapitonova, Anna","first_name":"Anna","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","last_name":"Kapitonova"},{"full_name":"Singh, Rajkumar","first_name":"Rajkumar","id":"a3089acd-6806-11ee-bacc-f0c7d500ad20","last_name":"Singh"},{"id":"bb74f472-ae54-11eb-9835-bc9c22fb1183","last_name":"Guillerm","full_name":"Guillerm, Undina","first_name":"Undina"},{"full_name":"Lichtenecker, Roman J.","first_name":"Roman J.","last_name":"Lichtenecker"},{"full_name":"Schanda, Paul","first_name":"Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda","orcid":"0000-0002-9350-7606"}]},{"month":"07","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"year":"2026","type":"dissertation","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"CampIT"}],"publication_identifier":{"issn":["2663-337X"]},"day":"11","file":[{"access_level":"open_access","checksum":"8201cb5a427656a41828ecde8a85c04b","date_created":"2026-07-14T10:48:45Z","file_id":"22337","content_type":"application/pdf","file_size":1260717,"date_updated":"2026-07-14T10:48:45Z","creator":"yli","relation":"main_file","file_name":"2026_Li_Yunzhe_Thesis.pdf"},{"file_id":"22339","date_created":"2026-07-14T11:07:18Z","content_type":"application/x-zip-compressed","checksum":"19ee8461ed77f5b7980fc9461f778b6f","access_level":"closed","file_name":"2026_Li_Yunzhe_Thesis.zip","date_updated":"2026-07-20T14:00:33Z","file_size":418752,"creator":"yli","relation":"source_file"}],"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","project":[{"name":"Spectral rigidity and integrability for billiards and geodesic flows","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","grant_number":"885707"}],"date_published":"2026-07-11T00:00:00Z","doi":"10.15479/AT-ISTA-22255","acknowledgement":"The financial support of the ERC grant SPERIG #885707 is gratefully acknowledged.\r\n","date_created":"2026-07-08T12:44:31Z","ec_funded":1,"citation":{"apa":"Li, Y. (2026). <i>Spectral rigidity and nonrigidity of dynamical systems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22255\">https://doi.org/10.15479/AT-ISTA-22255</a>","ama":"Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22255\">10.15479/AT-ISTA-22255</a>","chicago":"Li, Yunzhe. “Spectral Rigidity and Nonrigidity of Dynamical Systems.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22255\">https://doi.org/10.15479/AT-ISTA-22255</a>.","short":"Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute of Science and Technology Austria, 2026.","ieee":"Y. Li, “Spectral rigidity and nonrigidity of dynamical systems,” Institute of Science and Technology Austria, 2026.","ista":"Li Y. 2026. Spectral rigidity and nonrigidity of dynamical systems. Institute of Science and Technology Austria.","mla":"Li, Yunzhe. <i>Spectral Rigidity and Nonrigidity of Dynamical Systems</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22255\">10.15479/AT-ISTA-22255</a>."},"degree_awarded":"PhD","_id":"22255","article_processing_charge":"No","abstract":[{"lang":"eng","text":"This thesis studies spectral rigidity and nonrigidity phenomena in dynamical systems. The central question is whether a dynamical system can be determined, up to a natural conjugacy, from its spectrum. We consider three related spectra: the length spectrum, the action spectrum, and the Lyapunov spectrum.\r\n\r\nThe first part of the thesis concerns Liouville metrics on the two-dimensional torus. It is a long-standing folklore conjecture that Liouville metrics are the only integrable metrics on the torus. We prove a length-spectral rigidity result for linear conformal deformations of Liouville metrics by exploiting the dynamical properties of the rational tori -- analogues of the resonant convex caustics in billiards. We also establish a complementary classification result showing that marked-length-isospectral Liouville metrics are characterized by rearrangements of the one-dimensional functions appearing in their conformal factors, generalizing a theorem of Abbondandolo-Mazzucchelli. In particular, the second result gives nonrigidity examples within the class of Liouville metrics.\r\n\r\nThe second part of the thesis studies the standard map from the viewpoint of action and Lyapunov spectra. We construct nontrivial deformations of the standard map which preserve the symplectic actions (respectively, the Lyapunov exponents) of infinitely many periodic orbits accumulating on an invariant curve. The proof combines a resonant normal form construction with Picard iteration schemes to obtain a sequence of periodic orbits accumulating on an invariant curve with a Liouville rotation number. Within the resonant normal forms we capture the dependence of these periodic orbits on the resonant Fourier coefficients of the dynamics on the invariant curve and, using the contraction mapping principle, obtain a suitable deformation achieving the prescribed spectral data associated with this sequence of orbits. The result can be viewed as a symplectic twist-map analogue of a length-spectral nonrigidity phenomenon for Riemannian manifolds and convex billiards, and it motivates the existence problem for similar 'partially length-isospectral' deformations of strictly convex billiard tables.\r\n"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"22340"},{"status":"public","relation":"part_of_dissertation","id":"22341"}]},"date_updated":"2026-07-20T14:58:23Z","oa_version":"Published Version","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"page":"131","title":"Spectral rigidity and nonrigidity of dynamical systems","corr_author":"1","file_date_updated":"2026-07-20T14:00:33Z","publication_status":"published","doi_confirm":"1","oa":1,"status":"public","ddc":["515"],"supervisor":[{"full_name":"Kaloshin, Vadim","first_name":"Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","last_name":"Kaloshin"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","has_accepted_license":"1","author":[{"id":"41cb05d3-f128-11eb-9611-e4e2b3cfba31","last_name":"Li","full_name":"Li, Yunzhe","first_name":"Yunzhe"}]},{"date_created":"2026-07-19T22:01:48Z","external_id":{"pmid":["42429166"]},"acknowledgement":"Funded by the European Union (ERC, C-HANCE, 101142915 to N.M.). Views and opinions expressed are, however, those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. This research was funded in full or in part by the Austrian Science Fund (FWF, 10.55776/P37182 to N.M.). The technical staff of the NMR Centre of the Faculty of Chemistry (University of Vienna) are acknowledged for crucial NMR measurements and expert advice with spectral analysis. The authors thank the Core Facility Crystal Structure Analysis (U. Vienna) for determination of the crystal structures. The authors are also grateful to the University of Vienna for its continued support of our research programs.\r\n\r\nOpen Access funding provided by Universität Wien.","article_type":"original","dataavailabilitystatement":"The data that supports the findings of this study are available in the supplementary material of this article.","doi":"10.1002/anie.1233707","article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Hofmeister, Angela K., et al. “Unified Synthesis of Unconventional α-Polyhalogenated Amines through Hydroaminoalkylation.” <i>Angewandte Chemie International Edition</i>, e1233707, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/anie.1233707\">10.1002/anie.1233707</a>.","ista":"Hofmeister AK, Iannelli G, Angyal P, Malandain A, Kaiser D, Maryasin B, Kählig H, Barel M, Novarino G, Maulide N. 2026. Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. Angewandte Chemie International Edition., e1233707.","ieee":"A. K. Hofmeister <i>et al.</i>, “Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation,” <i>Angewandte Chemie International Edition</i>. Wiley, 2026.","chicago":"Hofmeister, Angela K., Giulia Iannelli, Péter Angyal, Augustin Malandain, Daniel Kaiser, Boris Maryasin, Hanspeter Kählig, Matteo Barel, Gaia Novarino, and Nuno Maulide. “Unified Synthesis of Unconventional α-Polyhalogenated Amines through Hydroaminoalkylation.” <i>Angewandte Chemie International Edition</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/anie.1233707\">https://doi.org/10.1002/anie.1233707</a>.","short":"A.K. Hofmeister, G. Iannelli, P. Angyal, A. Malandain, D. Kaiser, B. Maryasin, H. Kählig, M. Barel, G. Novarino, N. Maulide, Angewandte Chemie International Edition (2026).","ama":"Hofmeister AK, Iannelli G, Angyal P, et al. Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. <i>Angewandte Chemie International Edition</i>. 2026. doi:<a href=\"https://doi.org/10.1002/anie.1233707\">10.1002/anie.1233707</a>","apa":"Hofmeister, A. K., Iannelli, G., Angyal, P., Malandain, A., Kaiser, D., Maryasin, B., … Maulide, N. (2026). Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.1233707\">https://doi.org/10.1002/anie.1233707</a>"},"_id":"22370","abstract":[{"text":"We report a unified method for the synthesis of α-polyhalomethyl amines from alkenes and alkynes, enabled by readily available hemiaminal reagents. This operationally simple transformation allows for the introduction of not only well-established CF3 and CF2H groups, but also the synthetically (and medicinally) underexplored CF2Cl and CFClH motifs—thereby broadening access to previously inaccessible chemical space of halogenated amine scaffolds. The method displays broad substrate scope and functional-group tolerance while operating under mild conditions. Late-stage functionalization of drug-like derivatives of Oxaprozin, Erlotinib, and Ibuprofen (among others) is reported.","lang":"eng"}],"researchdata_availability":"no","date_updated":"2026-07-21T07:19:26Z","scopus_import":"1","department":[{"_id":"GaNo"},{"_id":"GradSch"}],"month":"07","year":"2026","OA_type":"hybrid","type":"journal_article","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"day":"10","date_published":"2026-07-10T00:00:00Z","article_number":"e1233707","publisher":"Wiley","publication":"Angewandte Chemie International Edition","pmid":1,"supplementarymaterial":"yes","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","status":"public","ddc":["570","540"],"has_accepted_license":"1","author":[{"last_name":"Hofmeister","first_name":"Angela K.","full_name":"Hofmeister, Angela K."},{"last_name":"Iannelli","first_name":"Giulia","full_name":"Iannelli, Giulia"},{"first_name":"Péter","full_name":"Angyal, Péter","last_name":"Angyal"},{"first_name":"Augustin","full_name":"Malandain, Augustin","last_name":"Malandain"},{"first_name":"Daniel","full_name":"Kaiser, Daniel","last_name":"Kaiser"},{"last_name":"Maryasin","first_name":"Boris","full_name":"Maryasin, Boris"},{"last_name":"Kählig","first_name":"Hanspeter","full_name":"Kählig, Hanspeter"},{"first_name":"Matteo","full_name":"Barel, Matteo","last_name":"Barel","id":"8959927b-2236-11ed-bd6e-ea83d94ade0e"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","last_name":"Novarino","full_name":"Novarino, Gaia","first_name":"Gaia"},{"last_name":"Maulide","full_name":"Maulide, Nuno","first_name":"Nuno"}],"das_tickbox":"1","oa_version":"Published Version","title":"Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication_status":"epub_ahead","quality_controlled":"1"},{"file":[{"date_created":"2026-07-16T09:39:37Z","file_id":"22350","content_type":"application/pdf","success":1,"access_level":"open_access","checksum":"d872ca35d9d2c7821642fda520be2c15","file_name":"2026_PhysicalReviewApplied_Leonard.pdf","file_size":2750867,"date_updated":"2026-07-16T09:39:37Z","creator":"dernst","relation":"main_file"}],"publisher":"American Physical Society","publication":"Physical Review Applied","date_published":"2026-07-10T00:00:00Z","project":[{"_id":"34a66131-11ca-11ed-8bc3-a31681c6b03e","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional  and unconventional topological superconductors","grant_number":"F8606"}],"article_number":"014031","day":"10","type":"journal_article","OA_type":"hybrid","publication_identifier":{"issn":["2331-7019"]},"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"department":[{"_id":"GradSch"},{"_id":"AnHi"},{"_id":"GeKa"}],"month":"07","year":"2026","scopus_import":"1","date_updated":"2026-07-21T12:01:49Z","abstract":[{"text":"Arrays of Josephson junctions can be tuned through anomalous metallic, quantum-critical, and insulating regimes. We introduce an alternative experimental probe, capturing microwave radiation across all three regimes, using a two-dimensional array of superconductor-semiconductor hybrid Josephson junctions as a model system. Our approach allows  calibration of the sample’s circuit parameters and provides isolation from measurement back-action effects. We measure the radiation temperature of the anomalous metal and find that it is hotter than both the quantum-critical and insulating regimes. We further show that the anomalous metallic regime is more susceptible to additional heating than other regimes, explaining its emergence in otherwise thermalized systems. Turning to the quantum-critical regime, we discover nonlinear scaling of radiative noise with applied bias, consistent with theoretical predictions of universal nonequilibrium behavior at quantum-critical points.","lang":"eng"}],"researchdata_availability":"yes","citation":{"apa":"Léonard, K. W., Bubis, A., Mikalsen, M., Schiela, W. F., Elfeky, B. H., Strickland, W. M., … Higginbotham, A. P. (2026). Microwave radiometry of a quantum-critical hybrid Josephson array. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/75bl-mm3b\">https://doi.org/10.1103/75bl-mm3b</a>","mla":"Léonard, Kristen Williams, et al. “Microwave Radiometry of a Quantum-Critical Hybrid Josephson Array.” <i>Physical Review Applied</i>, vol. 26, 014031, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/75bl-mm3b\">10.1103/75bl-mm3b</a>.","ista":"Léonard KW, Bubis A, Mikalsen M, Schiela WF, Elfeky BH, Strickland WM, Phan DT, Shabani J, Higginbotham AP. 2026. Microwave radiometry of a quantum-critical hybrid Josephson array. Physical Review Applied. 26, 014031.","short":"K.W. Léonard, A. Bubis, M. Mikalsen, W.F. Schiela, B.H. Elfeky, W.M. Strickland, D.T. Phan, J. Shabani, A.P. Higginbotham, Physical Review Applied 26 (2026).","ama":"Léonard KW, Bubis A, Mikalsen M, et al. Microwave radiometry of a quantum-critical hybrid Josephson array. <i>Physical Review Applied</i>. 2026;26. doi:<a href=\"https://doi.org/10.1103/75bl-mm3b\">10.1103/75bl-mm3b</a>","chicago":"Léonard, Kristen Williams, Anton Bubis, Melissa Mikalsen, William F. Schiela, Bassel H. Elfeky, William M. Strickland, Duc T Phan, Javad Shabani, and Andrew P Higginbotham. “Microwave Radiometry of a Quantum-Critical Hybrid Josephson Array.” <i>Physical Review Applied</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/75bl-mm3b\">https://doi.org/10.1103/75bl-mm3b</a>.","ieee":"K. W. Léonard <i>et al.</i>, “Microwave radiometry of a quantum-critical hybrid Josephson array,” <i>Physical Review Applied</i>, vol. 26. American Physical Society, 2026."},"_id":"22323","article_processing_charge":"Yes (via OA deal)","doi":"10.1103/75bl-mm3b","external_id":{"arxiv":["2409.09835"]},"date_created":"2026-07-14T05:35:24Z","acknowledgement":"We gratefully acknowledge feedback on the preprint\r\nfrom Charles Marcus, Vadim Khrapai, Joel Moore,\r\nAndrew Green, Shivaji Sondhi, Rufus Boyack, and\r\nLuca Delacr´etaz. This work was primarily supported by\r\nthe NOMIS foundation. This work was partially supported\r\nby the University of Chicago Materials Research Science\r\nand Engineering Center, which is funded by the National\r\nScience Foundation under Award No. DMR-2011854, and\r\nby the SFB Q-M&S funded by the Austrian Science Fund\r\n(FWF). We acknowledge technical support from the\r\nNanofabrication Facility and the MIBA machine shop at\r\nIST Austria.","dataavailabilitystatement":"The data that support the findings of this article are openly available under 10.5281/zenodo\r\n.19615009. ","article_type":"original","quality_controlled":"1","file_date_updated":"2026-07-16T09:39:37Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"title":"Microwave radiometry of a quantum-critical hybrid Josephson array","corr_author":"1","arxiv":1,"volume":26,"PlanS_conform":"1","oa_version":"Published Version","author":[{"last_name":"Galvin","id":"41737c86-5355-11ee-ae5a-d2146bfd0877","first_name":"Kristen W","full_name":"Galvin, Kristen W"},{"first_name":"Anton","full_name":"Bubis, Anton","last_name":"Bubis","id":"1f6212b5-f795-11ec-9c0c-de4780302890"},{"last_name":"Mikalsen","first_name":"Melissa","full_name":"Mikalsen, Melissa"},{"last_name":"Schiela","first_name":"William F.","full_name":"Schiela, William F."},{"last_name":"Elfeky","full_name":"Elfeky, Bassel H.","first_name":"Bassel H."},{"last_name":"Strickland","full_name":"Strickland, William M.","first_name":"William M."},{"id":"29C8C0B4-F248-11E8-B48F-1D18A9856A87","last_name":"Phan","full_name":"Phan, Duc T","first_name":"Duc T"},{"last_name":"Shabani","first_name":"Javad","full_name":"Shabani, Javad"},{"orcid":"0000-0003-2607-2363","last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87","first_name":"Andrew P","full_name":"Higginbotham, Andrew P"}],"intvolume":"        26","has_accepted_license":"1","ddc":["530"],"status":"public","supplementarymaterial":"no","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1},{"acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF)\r\n[10.55776/COE12]. Furthermore, the candidate acknowledges the support from the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","date_created":"2026-02-09T14:59:53Z","doi":"10.15479/AT-ISTA-21198","article_processing_charge":"No","_id":"21198","citation":{"chicago":"Scott, Jonathan A. “Data Heterogeneity and Personalization in Federated Learning.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21198\">https://doi.org/10.15479/AT-ISTA-21198</a>.","short":"J.A. Scott, Data Heterogeneity and Personalization in Federated Learning, Institute of Science and Technology Austria, 2026.","ama":"Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21198\">10.15479/AT-ISTA-21198</a>","ieee":"J. A. Scott, “Data heterogeneity and personalization in federated learning,” Institute of Science and Technology Austria, 2026.","ista":"Scott JA. 2026. Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria.","mla":"Scott, Jonathan A. <i>Data Heterogeneity and Personalization in Federated Learning</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21198\">10.15479/AT-ISTA-21198</a>.","apa":"Scott, J. A. (2026). <i>Data heterogeneity and personalization in federated learning</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21198\">https://doi.org/10.15479/AT-ISTA-21198</a>"},"degree_awarded":"PhD","abstract":[{"lang":"eng","text":"In recent years there has been a massive increase in the amount of data generated in a\r\ndecentralized manner. Ever more powerful edge devices, such as smartphones, have become\r\nubiquitous in most societies on earth. Through text typed, photos taken and apps used,\r\nthese devices, which we refer to as clients, generate enormous amounts of high quality and\r\ncomplex data. Moreover, the nature of these devices means the data they generate is often\r\nsensitive and privacy concerns prevent it being gathered and stored in a central location. This\r\npresents a challenge to the modern machine learning paradigm that requires central access\r\nto large amounts of data. Federated learning (FL) has emerged as one of the answers to\r\nthis problem. Rather than bringing the data to the model, FL sends the model to the data.\r\nModel training takes place on device, with periodically synchronized updates, allowing data to\r\nremain locally stored. While this approach offers significant privacy advantages it comes with\r\nits own set of unique challenges. These include: data heterogeneity, the notion that different\r\ndevices generate data in distinct ways which can negatively impact training dynamics; systems\r\nheterogeneity, meaning that different devices may have differing hardware specifications; high\r\ncommunication costs, which are induced by the repeated transferring of models over the\r\nnetwork and low device computational power, which limits the use of larger models on device.\r\nIn this thesis we present a range of methods for federated learning. We focus primarily on\r\nthe challenge of data heterogeneity, though the methods presented are designed to be well\r\nadapted to the other challenges of a federated setting, such as the constraints of limited\r\ncompute and communication overhead. We first present a method for explicitly modeling client\r\ndata heterogeneity. The approach formulates clients as samples from a certain probability\r\ndistribution and infers the parameters of this distribution from the available training clients.\r\nThis learned distribution then represents the heterogeneity present among the clients and can\r\nbe sampled from in order to create new simulated clients that are similar to the real clients we\r\nhave observed so far. Following this we present two methods for directly dealing with data\r\nheterogeneity through personalization. Highly heterogeneous client data distributions can mean\r\nthat learning a single global model becomes suboptimal, and some form of personalization of\r\nmodels to each individual client is required. Our approaches are based around hypernetworks,\r\nwhich we use to generate personalized model parameters without the need for additional\r\ntraining or finetuning. In the first approach we focus on generating full parameterizations of\r\nclient models using learned embeddings of client data and labels, with a hypernetwork located\r\non the central server. In the second approach we address the more challenging scenario where\r\nwe want to generate a personalized model for a client without any label information. The\r\nhypernetwork is trained to generate a low dimensional representation of a client’s personalized\r\nmodel parameters, allowing it to be transferred to and run on the client devices. In our final\r\npresented method, we change our focus and rather than aim to directly address the challenge\r\nof data heterogeneity, we instead ensure we are unaffected by it. This is done in the context\r\nof k-means clustering and we present a method for federated clustering with a focus on added\r\nprivacy guarantees."}],"date_updated":"2026-07-22T06:34:27Z","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"20819"},{"relation":"part_of_dissertation","status":"public","id":"17411"},{"relation":"part_of_dissertation","status":"public","id":"18120"},{"id":"21207","relation":"part_of_dissertation","status":"public"}]},"year":"2026","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"month":"02","publication_identifier":{"issn":["2663-337X"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"type":"dissertation","day":"09","date_published":"2026-02-09T00:00:00Z","publisher":"Institute of Science and Technology Austria","file":[{"file_size":272379252,"date_updated":"2026-02-17T11:46:22Z","relation":"source_file","creator":"jscott","file_name":"2026_Scott_Jonathan_Thesis_Source.zip","access_level":"closed","checksum":"121c1d968bd86f3630aa7e81d5bbbcb0","date_created":"2026-02-17T11:46:22Z","file_id":"21298","content_type":"application/zip"},{"file_name":"2026_Jonathan_Scott_Thesis.pdf","date_updated":"2026-02-27T10:25:41Z","file_size":15220298,"relation":"main_file","creator":"jscott","file_id":"21366","date_created":"2026-02-27T10:25:41Z","content_type":"application/pdf","success":1,"checksum":"6e3e08ba474bbee8511cc8a839ab2077","access_level":"open_access"}],"alternative_title":["ISTA Thesis"],"oa":1,"OA_place":"publisher","supervisor":[{"orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"status":"public","ddc":["005"],"has_accepted_license":"1","author":[{"id":"e499926b-f6e0-11ea-865d-9c63db0031e8","last_name":"Scott","full_name":"Scott, Jonathan A","first_name":"Jonathan A"}],"oa_version":"Published Version","title":"Data heterogeneity and personalization in federated learning","corr_author":"1","language":[{"iso":"eng"}],"page":"158","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","file_date_updated":"2026-02-27T10:25:41Z"},{"supervisor":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","full_name":"Edelsbrunner, Herbert"},{"full_name":"Wagner, Uli","first_name":"Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","status":"public","ddc":["514","516"],"oa":1,"author":[{"last_name":"Fillmore","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","first_name":"Christopher D","full_name":"Fillmore, Christopher D"}],"has_accepted_license":"1","title":"Braiding geometry and topology to study shapes and data","corr_author":"1","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"page":"122","oa_version":"Published Version","file_date_updated":"2026-01-30T11:40:09Z","publication_status":"published","article_processing_charge":"No","citation":{"apa":"Fillmore, C. D. (2026). <i>Braiding geometry and topology to study shapes and data</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21021\">https://doi.org/10.15479/AT-ISTA-21021</a>","short":"C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute of Science and Technology Austria, 2026.","chicago":"Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes and Data.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21021\">https://doi.org/10.15479/AT-ISTA-21021</a>.","ama":"Fillmore CD. Braiding geometry and topology to study shapes and data. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21021\">10.15479/AT-ISTA-21021</a>","ieee":"C. D. Fillmore, “Braiding geometry and topology to study shapes and data,” Institute of Science and Technology Austria, 2026.","mla":"Fillmore, Christopher D. <i>Braiding Geometry and Topology to Study Shapes and Data</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21021\">10.15479/AT-ISTA-21021</a>.","ista":"Fillmore CD. 2026. Braiding geometry and topology to study shapes and data. Institute of Science and Technology Austria."},"degree_awarded":"PhD","_id":"21021","date_created":"2026-01-20T21:38:40Z","acknowledgement":"The research presented in this thesis was funded by the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n","doi":"10.15479/AT-ISTA-21021","date_updated":"2026-07-22T06:33:54Z","related_material":{"record":[{"id":"20260","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"21051"},{"relation":"part_of_dissertation","status":"public","id":"21050"}]},"abstract":[{"text":"This thesis examines how geometry and topology intersect in the representation, transformation, and analysis of complex shapes. It considers how continuous manifolds relate to their discrete analogues, how topological structures evolve in persistence vineyards, and how tools from topological data analysis can illuminate problems in mathematical physics. Central to this exploration is the question of how structure, both geometric and topological, persists or changes under approximation, sampling, or deformation. The work develops new approaches to skeletal and grid-based representations of surfaces, reveals the full expressive capacity of persistence vineyards, and applies topological methods to the longstanding problem of equilibria in electrostatic fields. These threads braid together into a broader understanding of how topology and geometry inform one another across theory, computation, and application.","lang":"eng"}],"type":"dissertation","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"publication_identifier":{"issn":["2663-337X"]},"month":"01","department":[{"_id":"GradSch"},{"_id":"HeEd"},{"_id":"UlWa"}],"year":"2026","date_published":"2026-01-21T00:00:00Z","publisher":"Institute of Science and Technology Austria","file":[{"file_size":55954297,"date_updated":"2026-01-30T11:40:09Z","relation":"main_file","creator":"cfillmor","file_name":"2025_Fillmore_Christopher_Thesis.pdf","checksum":"4c0889130095c31d4e5088c5b8dfd607","access_level":"open_access","file_id":"21046","date_created":"2026-01-26T19:44:46Z","content_type":"application/pdf"},{"checksum":"d69afb71d82ab98f856886126ee7303a","access_level":"closed","file_id":"21047","date_created":"2026-01-26T19:46:20Z","content_type":"application/x-zip-compressed","date_updated":"2026-01-26T19:46:20Z","file_size":166080788,"creator":"cfillmor","relation":"source_file","file_name":"Thesis.zip"}],"alternative_title":["ISTA Thesis"],"day":"21"},{"status":"public","ddc":["000"],"supplementarymaterial":"no","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa":1,"das_tickbox":"0","author":[{"full_name":"Breitkopf, Tom-Lukas","first_name":"Tom-Lukas","last_name":"Breitkopf"},{"last_name":"Dallot","first_name":"Julien","full_name":"Dallot, Julien"},{"last_name":"El-Hayek","orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine","full_name":"El-Hayek, Antoine"},{"first_name":"Stefan","full_name":"Schmid, Stefan","last_name":"Schmid"}],"has_accepted_license":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"414 - 424","language":[{"iso":"eng"}],"title":"Ranking opinions with few states in population protocols","corr_author":"1","arxiv":1,"oa_version":"Published Version","quality_controlled":"1","file_date_updated":"2026-07-16T11:18:44Z","publication_status":"published","citation":{"apa":"Breitkopf, T.-L., Dallot, J., El-Hayek, A., &#38; Schmid, S. (2026). Ranking opinions with few states in population protocols. In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i> (pp. 414–424). Egham, United Kingdom: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3796701.3815913\">https://doi.org/10.1145/3796701.3815913</a>","chicago":"Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid. “Ranking Opinions with Few States in Population Protocols.” In <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, 414–24. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3796701.3815913\">https://doi.org/10.1145/3796701.3815913</a>.","short":"T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2026, pp. 414–424.","ieee":"T.-L. Breitkopf, J. Dallot, A. El-Hayek, and S. Schmid, “Ranking opinions with few states in population protocols,” in <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Egham, United Kingdom, 2026, pp. 414–424.","ama":"Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Ranking opinions with few states in population protocols. In: <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>. Association for Computing Machinery; 2026:414-424. doi:<a href=\"https://doi.org/10.1145/3796701.3815913\">10.1145/3796701.3815913</a>","ista":"Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 2026. Ranking opinions with few states in population protocols. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing, 414–424.","mla":"Breitkopf, Tom-Lukas, et al. “Ranking Opinions with Few States in Population Protocols.” <i>Proceedings of the ACM Symposium on Principles of Distributed Computing</i>, Association for Computing Machinery, 2026, pp. 414–24, doi:<a href=\"https://doi.org/10.1145/3796701.3815913\">10.1145/3796701.3815913</a>."},"_id":"22327","article_processing_charge":"Yes","doi":"10.1145/3796701.3815913","external_id":{"arxiv":["2605.18707"]},"ec_funded":1,"acknowledgement":"Funded by the European union. Views and opinions expressed are\r\nhowever those of the author(s) only and do not necessarily reflect\r\nthose of the European Union or the European Research Council\r\nExecutive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received\r\nfunding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme\r\n(MoDynStruct, No. 101019564) and the Austrian Science\r\nFund (FWF) grant DOI 10.55776/I5982. For open access purposes,\r\nthe author has applied a CC BY public copyright license to any\r\nauthor-accepted manuscript version arising from this submission.","date_created":"2026-07-14T05:40:17Z","scopus_import":"1","conference":{"end_date":"2026-07-10","name":"PODC: Symposium on Principles of Distributed Computing","start_date":"2026-07-06","location":"Egham, United Kingdom"},"date_updated":"2026-07-22T07:49:22Z","abstract":[{"text":"Population protocols are a model of distributed computing where\r\n𝑛 agents, each a simple finite-state machine, interact in pairs to\r\nsolve a common task against a (adversarial) interaction scheduler.\r\nThis model was intensively studied in recent years; in particular,\r\nthe problem of relative majority received much attention: Each\r\nagent starts with an input opinion (or color) out of 𝑘 possibilities,\r\nand the goal is for each agent to eventually output the color with\r\nthe largest support in the population. Before our work, the state\r\ncomplexity (the minimum number of states required per agent) was\r\nonly known to be between Ω(𝑘\r\n2\r\n) and𝑂(𝑘\r\n7\r\n). Our main contribution\r\nis a population protocol that solves the relative majority problem\r\nwith 𝑘\r\n3\r\nstates. We achieve this result with a new protocol called\r\nCircles. While prior approaches in the literature relied on duels of\r\nagents to find the majority color — an approach that proved effective\r\nfor the case with two colors — Circles partitions the agents into\r\ncircular linked lists of decreasing sizes, with the property that no\r\ntwo agents with the same initial color lie in the same circle. We\r\nshow that Circles always correctly computes the desired structure\r\nagainst the most adversarial of schedulers (weakly fair). We then\r\nshow that a trivial extension of Circles solves the relative majority\r\nproblem. We extend our protocol to handle various tie-breaking\r\nmechanisms or to support the case where the agents do not share a\r\nprior ordering of the colors. Finally, we show that a modification of\r\nCircles solves the ranking problem with 2 · 𝑘^4\r\nstates, where each\r\nagent must output the rank of its initial color in the population.","lang":"eng"}],"researchdata_availability":"no","type":"conference","OA_type":"gold","publication_identifier":{"isbn":["9798400725128"]},"month":"07","department":[{"_id":"MoHe"},{"_id":"GradSch"}],"year":"2026","publisher":"Association for Computing Machinery","file":[{"date_updated":"2026-07-16T11:18:44Z","file_size":702140,"relation":"main_file","creator":"dernst","file_name":"2026_ACMPODC_Breitkopf.pdf","success":1,"checksum":"e56da70c1b2e7e663d2d8106cf07a30a","access_level":"open_access","file_id":"22353","date_created":"2026-07-16T11:18:44Z","content_type":"application/pdf"}],"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","date_published":"2026-07-01T00:00:00Z","project":[{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"day":"01"},{"oa":1,"isi":1,"supplementarymaterial":"no","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","ddc":["000"],"status":"public","has_accepted_license":"1","intvolume":"        26","author":[{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","last_name":"Ishida","orcid":"0000-0002-3121-3100","full_name":"Ishida, Sadashige","first_name":"Sadashige"},{"first_name":"Hugo","full_name":"Lavenant, Hugo","last_name":"Lavenant"}],"das_tickbox":"0","oa_version":"Published Version","PlanS_conform":"1","volume":26,"title":"Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation","corr_author":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["Optimal transport","Hamilton-Jacobi equation","convex optimization"],"page":"349-384","language":[{"iso":"eng"}],"file_date_updated":"2026-07-23T05:37:52Z","publication_status":"published","quality_controlled":"1","date_created":"2023-12-21T10:14:37Z","acknowledgement":"The authors would like to thank Chris Wojtan for his continuous support and several interesting discussions. Part of this research was performed during two visits: one of SI to the BIDSA research center at Bocconi University, and one of HL to the Institute of Science and Technology Austria. Both host institutions are warmly acknowledged for the hospitality. HL is partially supported by the MUR-Prin 2022-202244A7YL “Gradient Flows and Non-Smooth Geometric Structures with Applications to Optimization and Machine Learning”, funded by the European Union - Next Generation EU. SI is supported in part by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Open access funding provided by Institute of Science and Technology (IST Austria).","external_id":{"isi":["001352503300001"],"arxiv":["2312.12213"]},"article_type":"original","doi":"10.1007/s10208-024-09686-3","article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Ishida, S., &#38; Lavenant, H. (2026). Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. <i>Foundations of Computational Mathematics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10208-024-09686-3\">https://doi.org/10.1007/s10208-024-09686-3</a>","mla":"Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” <i>Foundations of Computational Mathematics</i>, vol. 26, Springer Nature, 2026, pp. 349–84, doi:<a href=\"https://doi.org/10.1007/s10208-024-09686-3\">10.1007/s10208-024-09686-3</a>.","ista":"Ishida S, Lavenant H. 2026. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. Foundations of Computational Mathematics. 26, 349–384.","ama":"Ishida S, Lavenant H. Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation. <i>Foundations of Computational Mathematics</i>. 2026;26:349-384. doi:<a href=\"https://doi.org/10.1007/s10208-024-09686-3\">10.1007/s10208-024-09686-3</a>","short":"S. Ishida, H. Lavenant, Foundations of Computational Mathematics 26 (2026) 349–384.","chicago":"Ishida, Sadashige, and Hugo Lavenant. “Quantitative Convergence of a Discretization of Dynamic Optimal Transport Using the Dual Formulation.” <i>Foundations of Computational Mathematics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s10208-024-09686-3\">https://doi.org/10.1007/s10208-024-09686-3</a>.","ieee":"S. Ishida and H. Lavenant, “Quantitative convergence of a discretization of dynamic optimal transport using the dual formulation,” <i>Foundations of Computational Mathematics</i>, vol. 26. Springer Nature, pp. 349–384, 2026."},"_id":"14703","abstract":[{"lang":"eng","text":"We present a discretization of the dynamic optimal transport problem for which we can obtain the convergence rate for the value of the transport cost to its continuous value when the temporal and spatial stepsize vanish. This convergence result does not require any regularity assumption on the measures, though experiments suggest that the rate is not sharp. Via an analysis of the duality gap we also obtain the convergence rates for the gradient of the optimal potentials and the velocity field under mild regularity assumptions. To obtain such rates we discretize the dual formulation of the dynamic optimal transport problem and use the mature literature related to the error due to discretizing the Hamilton-Jacobi equation."}],"researchdata_availability":"no","date_updated":"2026-07-23T05:39:38Z","scopus_import":"1","month":"02","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"year":"2026","OA_type":"hybrid","type":"journal_article","publication_identifier":{"issn":["1615-3375"],"eissn":["1615-3383"]},"day":"01","date_published":"2026-02-01T00:00:00Z","project":[{"grant_number":"101045083","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"publisher":"Springer Nature","file":[{"relation":"main_file","creator":"dernst","date_updated":"2026-07-23T05:37:52Z","file_size":1240012,"file_name":"2026_FoundCompMath_Ishida.pdf","checksum":"30671f88e792e8b75ae3e698ac4c131c","access_level":"open_access","success":1,"content_type":"application/pdf","file_id":"22384","date_created":"2026-07-23T05:37:52Z"}],"publication":"Foundations of Computational Mathematics"},{"type":"journal_article","OA_type":"hybrid","publication_identifier":{"eissn":["1432-1297"],"issn":["0020-9910"]},"month":"04","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"year":"2026","project":[{"grant_number":"885707","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","name":"Spectral rigidity and integrability for billiards and geodesic flows"}],"date_published":"2026-04-01T00:00:00Z","file":[{"file_name":"2026_InventionesMath_Koval.pdf","relation":"main_file","creator":"dernst","file_size":2256345,"date_updated":"2026-07-23T10:55:24Z","content_type":"application/pdf","file_id":"22394","date_created":"2026-07-23T10:55:24Z","checksum":"487fa9113e1bbf32a6c70e6d1e8f63bc","access_level":"open_access","success":1}],"publisher":"Springer Nature","publication":"Inventiones Mathematicae","day":"01","article_processing_charge":"Yes (via OA deal)","citation":{"ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” <i>Inventiones Mathematicae</i>, vol. 244. Springer Nature, pp. 221–298, 2026.","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” <i>Inventiones Mathematicae</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00222-025-01397-y\">https://doi.org/10.1007/s00222-025-01397-y</a>.","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. <i>Inventiones Mathematicae</i>. 2026;244:221-298. doi:<a href=\"https://doi.org/10.1007/s00222-025-01397-y\">10.1007/s00222-025-01397-y</a>","short":"I. Koval, Inventiones Mathematicae 244 (2026) 221–298.","ista":"Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 244, 221–298.","mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” <i>Inventiones Mathematicae</i>, vol. 244, Springer Nature, 2026, pp. 221–98, doi:<a href=\"https://doi.org/10.1007/s00222-025-01397-y\">10.1007/s00222-025-01397-y</a>.","apa":"Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. <i>Inventiones Mathematicae</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00222-025-01397-y\">https://doi.org/10.1007/s00222-025-01397-y</a>"},"_id":"14278","date_created":"2023-09-06T08:35:43Z","ec_funded":1,"external_id":{"arxiv":["2111.12171"]},"acknowledgement":"The author acknowledges the partial support of the European Research Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the project and greatly aiding the implementation. The author is also grateful to Hamid Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges partial support of ISTern summer program. The project started in the summer of 2021, when the author was an intern at ISTA. Open access funding provided by Institute of Science and Technology (IST Austria).","article_type":"original","doi":"10.1007/s00222-025-01397-y","date_updated":"2026-07-23T10:58:59Z","scopus_import":"1","abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral uniqueness of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish local uniqueness for almost all of them.","lang":"eng"}],"researchdata_availability":"no","title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","corr_author":"1","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"page":"221-298","oa_version":"Published Version","PlanS_conform":"1","volume":244,"quality_controlled":"1","mathsc":["37C83","35J05","37J70","74J25"],"file_date_updated":"2026-07-23T10:55:24Z","publication_status":"published","supplementarymaterial":"yes","OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["510"],"status":"public","oa":1,"author":[{"full_name":"Koval, Illya","first_name":"Illya","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e","last_name":"Koval"}],"das_tickbox":"0","has_accepted_license":"1","intvolume":"       244"},{"date_updated":"2026-07-24T12:48:29Z","related_material":{"record":[{"id":"20051","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18557"},{"status":"public","relation":"part_of_dissertation","id":"19982"},{"status":"public","relation":"part_of_dissertation","id":"21720"},{"id":"22374","status":"public","relation":"part_of_dissertation"},{"id":"22373","relation":"part_of_dissertation","status":"public"}]},"abstract":[{"lang":"eng","text":"In this thesis, we took a look at networks, and more specifically, at networks that change over time, whether those are networks in the distributed algorithms sense of the word, or the graph algorithm sense. \r\n\r\nIn distributed algorithms, we looked at two main problems. First, the broadcast problem: given n agents, each agent is tasked to forward a (unique) message to every other agent. Agents collaborate and can copy and forward all messages they have received up until that point. Broadcast is achieved when one agent has successfully broadcast its message to everyone else. We studied the case where the communication network is controlled by an adversary, under the condition that the graph is rooted in every round of communication. We show that the adversary can delay broadcast for at most  l\r\n(1 + √\r\n2)n\r\nm\r\n rounds, improving on the $O(n\\log\\log n)$ previous upper bound~\\cite{fugger2020radius}, and asymptotically matching the $\\sim 1.5n$ lower bound~\\cite{schwarz2017linear}.\r\n\r\nWe then looked at the stochastic version of the problem: here, the adversary -- parametrized by $k$ where $k=0$ signifies that the adversary has no control,  and $k=n$ that the adversary has full control -- can choose parts of the graph, and the graph is then completed stochastically. Here, we are able to look at a stronger version of broadcast: instead of having $n$ messages trying to be broadcast in parallel, we can assume that only one message needs to be broadcasted. We show the bound $\\Theta(k+\\log n)$.\r\n\r\nThen, we looked at undecided states dynamics in population protocols: given a population of $n$ agents, where each initially holds an opinion among $k$ different ones. In each round, two agents are chosen uniformly at random, and can interact. If they have different opinions, they forget their opinions and become undecided. If one of them is undecided while the other has an opinion, they undecided agent copies they opinion of the decided one. The question is then, how many interactions does it take for the whole population to share the same opinion? We show a $\\Omega(kn\\log \\frac {\\sqrt n} {k \\log n})$ lower bound  for any $k = o\\left(\\frac {\\sqrt n}{\\log n}\\right)$.\r\nThis is tight for any $ k \\le n^{\\frac 1 2 - \\epsilon}$, where $\\epsilon >0$ can be any small constant, matching the known $O(kn\\log n)$ upper bound for $k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)$~\\cite{DBLP:conf/podc/AmirABBHKL23}.\r\n\r\nFinally, in dynamic algorithms, we study the minimum cut problem: we are given a graph, whose vertex set we want to partition into two subsets such that the number of edges crossing from one subset to the other is minimized. Then, the graph can be updated via edge insertions or deletions, and we must update the solution without recomputing everything from scratch. We present an exact fully-dynamic minimum cut algorithm that runs in $n^{o(1)}$ deterministic update time when the minimum cut size is at most $2^{\\Theta(\\log^{3/4-c}n)}$ for any $c>0$, improving on the previous algorithm~\\cite{DBLP:conf/soda/JinST24} whose minimum cut size limit is $(\\log n)^{o(1)}$. Using sparsification and randomization techniques, we are able to extend this to all values of the minimum cut in weighted graphs, at the cost of a $(1+o(1))$-approximation ratio."}],"article_processing_charge":"No","_id":"22281","citation":{"ieee":"A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.","short":"A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.","chicago":"El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>.","ama":"El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>","mla":"El-Hayek, Antoine. <i>Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22281\">10.15479/AT-ISTA-22281</a>.","ista":"El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.","apa":"El-Hayek, A. (2026). <i>Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22281\">https://doi.org/10.15479/AT-ISTA-22281</a>"},"degree_awarded":"PhD","date_created":"2026-07-13T09:39:59Z","ec_funded":1,"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564)\r\n\"The Design and Evaluation of Modern Fully Dynamic Data Structures\" , from the\r\nAustrian Science Fund (FWF) grant DOI 10.55776/I5982 \"Static and Dynamic Hierarchical\r\nGraph Decompositions\", and from the Austrian Science Fund (FWF) and netIDEE SCIENCE\r\nproject P 33775-N, \"Fast Algorithms for a Reactive Network Layer\".\r\n","doi":"10.15479/AT-ISTA-22281","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"date_published":"2026-07-13T00:00:00Z","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"file":[{"date_created":"2026-07-17T11:39:47Z","file_id":"22356","content_type":"application/pdf","success":1,"access_level":"open_access","checksum":"923e4ca769c9ef2f6b0b005444faf462","file_name":"2026_El-Hayek_Antoine_Thesis.pdf","file_size":5465973,"date_updated":"2026-07-17T11:39:47Z","creator":"aelhayek","relation":"main_file"},{"file_name":"2026_El-Hayek_Antoine_Thesis.zip","file_size":9116107,"date_updated":"2026-07-20T11:29:38Z","creator":"aelhayek","relation":"source_file","date_created":"2026-07-17T11:40:34Z","file_id":"22357","content_type":"application/x-zip-compressed","access_level":"closed","checksum":"262689f9df27dd6c2c7c7861f1de7329"}],"day":"13","publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","year":"2026","month":"07","department":[{"_id":"GradSch"},{"_id":"MoHe"}],"author":[{"id":"888a098e-fcac-11ee-aff7-d347be57b725","last_name":"El-Hayek","orcid":"0000-0003-4268-7368","full_name":"El-Hayek, Antoine","first_name":"Antoine"}],"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","supervisor":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger"}],"ddc":["000"],"status":"public","oa":1,"publisher_comment":"Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved.","doi_confirm":"1","publication_status":"published","file_date_updated":"2026-07-20T11:29:38Z","corr_author":"1","title":"Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks","page":"244","language":[{"iso":"eng"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa_version":"Published Version"},{"publication_identifier":{"issn":["1071-9040"],"eisbn":["9781611978971"],"eissn":["1557-9468"]},"OA_type":"green","type":"conference","year":"2026","department":[{"_id":"MoHe"},{"_id":"GradSch"}],"month":"01","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"date_published":"2026-01-07T00:00:00Z","publication":"Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms","publisher":"Society for Industrial and Applied Mathematics","day":"07","article_processing_charge":"No","_id":"21720","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2512.13105","open_access":"1"}],"citation":{"chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. <a href=\"https://doi.org/10.1137/1.9781611978971.25\">https://doi.org/10.1137/1.9781611978971.25</a>.","ama":"El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:<a href=\"https://doi.org/10.1137/1.9781611978971.25\">10.1137/1.9781611978971.25</a>","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, Vancouver, Canada, 2026, vol. 2026, pp. 613–663.","short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.","ista":"El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026, 613–663.","mla":"El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i>, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:<a href=\"https://doi.org/10.1137/1.9781611978971.25\">10.1137/1.9781611978971.25</a>.","apa":"El-Hayek, A., Henzinger, M., &#38; Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In <i>Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms</i> (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. <a href=\"https://doi.org/10.1137/1.9781611978971.25\">https://doi.org/10.1137/1.9781611978971.25</a>"},"ec_funded":1,"acknowledgement":"Funded by the European union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","date_created":"2026-04-12T22:01:51Z","external_id":{"arxiv":["2512.13105"]},"doi":"10.1137/1.9781611978971.25","date_updated":"2026-07-24T12:48:29Z","conference":{"end_date":"2026-01-14","name":"SODA: Symposium on Discrete Algorithms","start_date":"2026-01-11","location":"Vancouver, Canada"},"scopus_import":"1","related_material":{"record":[{"id":"22281","status":"public","relation":"dissertation_contains"}]},"abstract":[{"text":"We present an exact fully-dynamic minimum cut algorithm that runs in 𝑛𝑜⁡(1) deterministic update time when the minimum cut size is at most 2Θ⁡(log3/4−𝑐⁡𝑛) for any 𝑐 >0, improving on the previous algorithm of Jin, Sun, and Thorup (SODA 2024) whose minimum cut size limit is (log⁡𝑛)𝑜⁡(1). Combined with graph sparsification, we obtain the first (1 +𝜖)-approximate fully-dynamic minimum cut algorithm on weighted graphs, for any 𝜖 ≥2−Θ⁡(log3/4−𝑐⁡𝑛), in 𝑛𝑜⁡(1) randomized update time.\r\nOur main technical contribution is a deterministic local minimum cut algorithm, which replaces the randomized LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025).","lang":"eng"}],"arxiv":1,"title":"Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time","page":"613-663","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","volume":2026,"quality_controlled":"1","publication_status":"published","OA_place":"repository","status":"public","oa":1,"author":[{"first_name":"Antoine","full_name":"El-Hayek, Antoine","last_name":"El-Hayek","orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"full_name":"Li, Jason","first_name":"Jason","last_name":"Li"}],"intvolume":"      2026"},{"has_accepted_license":"1","author":[{"last_name":"You","full_name":"You, Shengbo","first_name":"Shengbo"},{"full_name":"Varnavides, Georgios","first_name":"Georgios","last_name":"Varnavides"},{"full_name":"Khavnekar, Sagar","first_name":"Sagar","last_name":"Khavnekar"},{"full_name":"Palatkin, Nikita","first_name":"Nikita","last_name":"Palatkin"},{"first_name":"Sihan","full_name":"Shao, Sihan","last_name":"Shao"},{"last_name":"Wu","full_name":"Wu, Mingjian","first_name":"Mingjian"},{"first_name":"Daniel","full_name":"Stroppa, Daniel","last_name":"Stroppa"},{"last_name":"Chernikova","id":"7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0","first_name":"Darya","full_name":"Chernikova, Darya"},{"full_name":"Zhu, Baixu","first_name":"Baixu","last_name":"Zhu"},{"last_name":"Egoavil","first_name":"Ricardo","full_name":"Egoavil, Ricardo"},{"first_name":"Stefano","full_name":"Vespucci, Stefano","last_name":"Vespucci"},{"full_name":"Krishnan, Dileep","first_name":"Dileep","last_name":"Krishnan"},{"last_name":"Ye","first_name":"Xingchen","full_name":"Ye, Xingchen"},{"full_name":"Schur, Florian KM","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","orcid":"0000-0003-4790-8078"},{"last_name":"Spiecker","first_name":"Erdmann","full_name":"Spiecker, Erdmann"},{"first_name":"Philipp","full_name":"Pelz, Philipp","last_name":"Pelz"}],"das_tickbox":"1","oa":1,"OA_place":"publisher","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"supplementarymaterial":"yes","ddc":["570","600"],"status":"public","publication_status":"epub_ahead","quality_controlled":"1","oa_version":"Published Version","PlanS_conform":"1","DOAJ_listed":"1","arxiv":1,"title":"Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","researchdata_availability":"yes","abstract":[{"lang":"eng","text":"Linear phase‐contrast scanning transmission electron microscopy (STEM) techniques compatible with high‐throughput 4D‐STEM acquisition are widely used to enhance phase contrast in weakly scattering and beam‐sensitive materials. In these modalities, contrast transfer is often suppressed at low spatial frequencies, resulting in a characteristic contrast gap that limits contrast. Approaches that retain low‐frequency phase contrast exist but typically require substantially increased experimental complexity, restricting routine use. Dark‐field STEM imaging captures this missing low‐frequency information through electrons scattered outside the bright‐field disk, but discards a large fraction of the scattered signal and is therefore dose‐inefficient. Fused Full‐field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that overcomes these limitations by combining ptychographic phase reconstruction with tilt‐corrected dark‐field imaging within a single acquisition. Bright‐field data are used to estimate probe aberrations and reconstruct a high‐resolution phase image, while dark‐field data provide complementary low‐frequency contrast. The two channels are fused in Fourier space using Wiener‐band weighting based on the spectral signal‐to‐noise ratio, yielding transfer‐gap‐free images with high contrast. FF‐STEM preserves the upsampling and depth‐sectioning capabilities of ptychography, adds robust low‐frequency contrast characteristic of dark‐field imaging, and enables dose‐efficient, near–real‐time reconstruction."}],"date_updated":"2026-07-27T06:04:57Z","scopus_import":"1","article_type":"original","dataavailabilitystatement":"The data that support the findings of this study are openly available in Zenodo at https://doi.org/10.5281/zenodo.18008901. The reconstruction code is available as an open-source repository at the scatterem github repo.","acknowledgement":"We thank Tadahiro Yokosawa for support and discussions during the experiments. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (Project HyperScaleEM, Grant agreement No. 101164581) and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through the Research Training Group GRK 3103 CorMic: Korrelative Materialmikroskopie – Von nanostrukturierten funktionalen Filmen zu hierarchischen Funktionsmaterialien (project number 537140136). B.Z. and X.Y. were supported by the U.S. National Science Foundation under award CHE-2404338. X.Y. also thanks the Principal Investigator Development in Sustainability Grant from the American Chemical Society.","external_id":{"arxiv":["2512.19460"]},"date_created":"2026-07-26T19:01:34Z","doi":"10.1002/advs.76620","article_processing_charge":"Yes","_id":"22403","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/advs.76620"}],"citation":{"apa":"You, S., Varnavides, G., Khavnekar, S., Palatkin, N., Shao, S., Wu, M., … Pelz, P. (2026). Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. <i>Advanced Science</i>. Wiley. <a href=\"https://doi.org/10.1002/advs.76620\">https://doi.org/10.1002/advs.76620</a>","ista":"You S, Varnavides G, Khavnekar S, Palatkin N, Shao S, Wu M, Stroppa D, Chernikova D, Zhu B, Egoavil R, Vespucci S, Krishnan D, Ye X, Schur FK, Spiecker E, Pelz P. 2026. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science., e76620.","mla":"You, Shengbo, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” <i>Advanced Science</i>, e76620, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/advs.76620\">10.1002/advs.76620</a>.","short":"S. You, G. Varnavides, S. Khavnekar, N. Palatkin, S. Shao, M. Wu, D. Stroppa, D. Chernikova, B. Zhu, R. Egoavil, S. Vespucci, D. Krishnan, X. Ye, F.K. Schur, E. Spiecker, P. Pelz, Advanced Science (2026).","ama":"You S, Varnavides G, Khavnekar S, et al. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. <i>Advanced Science</i>. 2026. doi:<a href=\"https://doi.org/10.1002/advs.76620\">10.1002/advs.76620</a>","ieee":"S. You <i>et al.</i>, “Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels,” <i>Advanced Science</i>. Wiley, 2026.","chicago":"You, Shengbo, Georgios Varnavides, Sagar Khavnekar, Nikita Palatkin, Sihan Shao, Mingjian Wu, Daniel Stroppa, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” <i>Advanced Science</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/advs.76620\">https://doi.org/10.1002/advs.76620</a>."},"day":"23","date_published":"2026-07-23T00:00:00Z","article_number":"e76620","publication":"Advanced Science","publisher":"Wiley","year":"2026","month":"07","department":[{"_id":"FlSc"},{"_id":"GradSch"}],"publication_identifier":{"eissn":["2198-3844"]},"type":"journal_article","OA_type":"gold"},{"date_updated":"2026-07-27T06:47:17Z","scopus_import":"1","researchdata_availability":"no","abstract":[{"lang":"eng","text":"It is known that for a uniform morphic sequence 𝒖 =⟨𝑢𝑛⟩∞\r\n𝑛=0 and an algebraic number 𝛽 such that |𝛽| >1, the number [[𝒖]]𝛽 :=∑∞\r\n𝑛=0(𝑢𝑛/𝛽𝑛) either lies in ℚ⁡(𝛽) or is transcendental. In this paper, we show a similar rational–transcendental dichotomy for sequences defined by irreducible Pisot morphisms on binary alphabets. Subject to the Pisot conjecture (an irreducible Pisot morphism has pure discrete spectrum), we generalise the latter result to arbitrary finite alphabets. In certain cases, we are able to show transcendence of [[𝒖]]𝛽 outright. In particular, for 𝑘 ≥2, if 𝒖 is the k-Bonacci word, then [[𝒖]]𝛽 is transcendental."}],"article_processing_charge":"Yes (in subscription journal)","_id":"22406","citation":{"apa":"Kebis, P., LUCA, F., OUAKNINE, J., SCOONES, A., &#38; WORRELL, J. (2026). Transcendence for Pisot morphic words over an algebraic base. <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/etds.2026.10324\">https://doi.org/10.1017/etds.2026.10324</a>","ieee":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, and J. WORRELL, “Transcendence for Pisot morphic words over an algebraic base,” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, pp. 1–22, 2026.","chicago":"Kebis, Pavol, FLORIAN LUCA, JOEL OUAKNINE, ANDREW SCOONES, and JAMES WORRELL. “Transcendence for Pisot Morphic Words over an Algebraic Base.” <i>Ergodic Theory and Dynamical Systems</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/etds.2026.10324\">https://doi.org/10.1017/etds.2026.10324</a>.","ama":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. Transcendence for Pisot morphic words over an algebraic base. <i>Ergodic Theory and Dynamical Systems</i>. 2026:1-22. doi:<a href=\"https://doi.org/10.1017/etds.2026.10324\">10.1017/etds.2026.10324</a>","short":"P. Kebis, F. LUCA, J. OUAKNINE, A. SCOONES, J. WORRELL, Ergodic Theory and Dynamical Systems (2026) 1–22.","mla":"Kebis, Pavol, et al. “Transcendence for Pisot Morphic Words over an Algebraic Base.” <i>Ergodic Theory and Dynamical Systems</i>, Cambridge University Press, 2026, pp. 1–22, doi:<a href=\"https://doi.org/10.1017/etds.2026.10324\">10.1017/etds.2026.10324</a>.","ista":"Kebis P, LUCA F, OUAKNINE J, SCOONES A, WORRELL J. 2026. Transcendence for Pisot morphic words over an algebraic base. Ergodic Theory and Dynamical Systems., 1–22."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/etds.2026.10324"}],"article_type":"original","external_id":{"arxiv":["2405.05279"]},"date_created":"2026-07-27T05:53:25Z","acknowledgement":"We thank the anonymous referee for identifying an error in an earlier\r\nversion of the paper. We gratefully acknowledge support from UKRI Frontier Research\r\nGrant EP/X033813/1, ERC grant DynAMiCS (101167561) and DFG grant 389792660 as\r\npart of TRR 248. J.O. is also affiliated with Keble College, Oxford as an Emmy Network\r\nfellow.","doi":"10.1017/etds.2026.10324","date_published":"2026-07-10T00:00:00Z","publication":"Ergodic Theory and Dynamical Systems","publisher":"Cambridge University Press","day":"10","publication_identifier":{"issn":["0143-3857"],"eissn":["1469-4417"]},"OA_type":"hybrid","type":"journal_article","year":"2026","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"month":"07","author":[{"last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","full_name":"Kebis, Pavol"},{"first_name":"FLORIAN","full_name":"LUCA, FLORIAN","last_name":"LUCA"},{"last_name":"OUAKNINE","first_name":"JOEL","full_name":"OUAKNINE, JOEL"},{"full_name":"SCOONES, ANDREW","first_name":"ANDREW","last_name":"SCOONES"},{"first_name":"JAMES","full_name":"WORRELL, JAMES","last_name":"WORRELL"}],"das_tickbox":"0","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","supplementarymaterial":"no","status":"public","ddc":["000"],"oa":1,"quality_controlled":"1","mathsc":["11J81","37B10","11J87"],"publication_status":"epub_ahead","arxiv":1,"title":"Transcendence for Pisot morphic words over an algebraic base","page":"1-22","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","keyword":["balanced-pair algorithm","Cobham’s conjecture","k-Bonacci words","Pisot conjecture","subspace theorem"],"PlanS_conform":"1","oa_version":"Published Version"},{"author":[{"id":"1271b54b-dbcd-11ea-9d1d-d92da838fe2c","last_name":"Calderon Garcia","full_name":"Calderon Garcia, Juan Sebastian","first_name":"Juan Sebastian"},{"full_name":"Costalunga, Giacomo","first_name":"Giacomo","last_name":"Costalunga"},{"orcid":"0000-0003-3295-6181","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","full_name":"Vogels, Tim P"},{"full_name":"Vallentin, Daniela","first_name":"Daniela","last_name":"Vallentin"}],"das_tickbox":"1","has_accepted_license":"1","issue":"3","intvolume":"        36","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","supplementarymaterial":"yes","status":"public","ddc":["570","577"],"pmid":1,"oa":1,"quality_controlled":"1","publication_status":"published","file_date_updated":"2026-07-27T10:47:55Z","title":"Interplay between syllable duration and pitch during whistle matching in wild nightingales","language":[{"iso":"eng"}],"page":"791-798.e6","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","PlanS_conform":"1","volume":36,"date_updated":"2026-07-27T10:48:35Z","scopus_import":"1","researchdata_availability":"yes","abstract":[{"lang":"eng","text":"During complex vocal interactions, different features of acoustic stimuli are integrated to produce appropriate vocal responses,1 such as copying sounds during vocal matching behavior in some animals.2,3,4,5,6,7,8,9,10,11,12 However, little is known about the interplay and possible trade-offs between the different temporal and spectral acoustic features during these vocal exchanges.2,13,14 Nightingales can flexibly match the pitch of their tonal “whistle songs” in real time during counter-singing duels.15,16 Here, we show that the syllable duration of whistle playbacks could alter the song responses of wild nightingales, causing their whistle duration distribution to shift toward the presented stimulus duration. When exposed to whistle playbacks featuring unnatural combinations of pitch and duration, nightingales demonstrate a flexible trade-off between pitch matching and temporal imitation, yet they are constrained by their vocal repertoire. They selectively adapted their vocal responses to approximate these novel stimuli, aligning them with their natural whistle repertoire. We developed a computational model of nightingale whistle-matching behavior that revealed a hierarchical organization of acoustic feature production. During whistle matching, the feature integration process is constrained by the duration of syllables, and pitch matching follows within this temporal framework, forcing a trade-off between the two features. Our findings reveal a complex interplay between the spectral and temporal domains that shapes song-matching behavior."}],"article_processing_charge":"Yes (in subscription journal)","_id":"20986","citation":{"chicago":"Calderon Garcia, Juan Sebastian, Giacomo Costalunga, Tim P Vogels, and Daniela Vallentin. “Interplay between Syllable Duration and Pitch during Whistle Matching in Wild Nightingales.” <i>Current Biology</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.cub.2025.12.025\">https://doi.org/10.1016/j.cub.2025.12.025</a>.","short":"J.S. Calderon Garcia, G. Costalunga, T.P. Vogels, D. Vallentin, Current Biology 36 (2026) 791–798.e6.","ama":"Calderon Garcia JS, Costalunga G, Vogels TP, Vallentin D. Interplay between syllable duration and pitch during whistle matching in wild nightingales. <i>Current Biology</i>. 2026;36(3):791-798.e6. doi:<a href=\"https://doi.org/10.1016/j.cub.2025.12.025\">10.1016/j.cub.2025.12.025</a>","ieee":"J. S. Calderon Garcia, G. Costalunga, T. P. Vogels, and D. Vallentin, “Interplay between syllable duration and pitch during whistle matching in wild nightingales,” <i>Current Biology</i>, vol. 36, no. 3. Elsevier, p. 791–798.e6, 2026.","mla":"Calderon Garcia, Juan Sebastian, et al. “Interplay between Syllable Duration and Pitch during Whistle Matching in Wild Nightingales.” <i>Current Biology</i>, vol. 36, no. 3, Elsevier, 2026, p. 791–798.e6, doi:<a href=\"https://doi.org/10.1016/j.cub.2025.12.025\">10.1016/j.cub.2025.12.025</a>.","ista":"Calderon Garcia JS, Costalunga G, Vogels TP, Vallentin D. 2026. Interplay between syllable duration and pitch during whistle matching in wild nightingales. Current Biology. 36(3), 791–798.e6.","apa":"Calderon Garcia, J. S., Costalunga, G., Vogels, T. P., &#38; Vallentin, D. (2026). Interplay between syllable duration and pitch during whistle matching in wild nightingales. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2025.12.025\">https://doi.org/10.1016/j.cub.2025.12.025</a>"},"dataavailabilitystatement":"All data have been deposited at https://github.com/vallentinlab/NG-whistle-durations and are publicly available as of the date of publication.\r\nAll original code has been deposited at https://github.com/vallentinlab/NG-whistle-durations and is publicly available as of the date of publication.\r\nAny additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.","article_type":"original","date_created":"2026-01-14T12:00:29Z","external_id":{"pmid":["41529680"]},"acknowledgement":"We would like to thank J. Benichov and N. Hein for their help with fieldwork; M. Ramadas for helping with the segmentation analysis; T. Eliav, C. Chintaluri, G. Tkacik, and A. Navas for providing helpful comments to the project and manuscript; and A. Costalunga for the drawings of nightingales. Funding sources: The Joachim Herz Stiftung Add-on Fellowships for Interdisciplinary Life Science, awarded to G.C.; the ERC Consolidator Grant 819603 SYNAPSEEK, awarded to T.P.V.; and DFG Research Unit 5768–532521431, DFG Research Grant-547921981, DFG SFB 1315–327654276, and the ERC Starting Grant 757459 MIDNIGHT, awarded to D.V.","ec_funded":1,"doi":"10.1016/j.cub.2025.12.025","project":[{"grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning.","_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020"}],"date_published":"2026-02-02T00:00:00Z","publication":"Current Biology","publisher":"Elsevier","file":[{"content_type":"application/pdf","file_id":"22416","date_created":"2026-07-27T10:47:55Z","checksum":"e17c3537193d5ab4886596d1a04f9b0e","access_level":"open_access","success":1,"file_name":"2026_CurrentBiology_CalderonGarcia.pdf","creator":"dernst","relation":"main_file","file_size":7120959,"date_updated":"2026-07-27T10:47:55Z"}],"day":"02","publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"type":"journal_article","OA_type":"hybrid","year":"2026","department":[{"_id":"GradSch"},{"_id":"TiVo"}],"month":"02"},{"file_date_updated":"2026-07-27T10:57:57Z","publication_status":"published","quality_controlled":"1","PlanS_conform":"1","oa_version":"Published Version","volume":22,"corr_author":"1","title":"A polyhedral structure controls programmable self-assembly","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","page":"294-301","language":[{"iso":"eng"}],"has_accepted_license":"1","intvolume":"        22","author":[{"last_name":"Hübl","id":"5eb8629e-15b2-11ec-abd3-e6f3e5e01f32","first_name":"Maximilian","full_name":"Hübl, Maximilian"},{"last_name":"Videbæk","full_name":"Videbæk, Thomas E.","first_name":"Thomas E."},{"first_name":"Daichi","full_name":"Hayakawa, Daichi","last_name":"Hayakawa"},{"full_name":"Rogers, W. Benjamin","first_name":"W. Benjamin","last_name":"Rogers"},{"id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","last_name":"Goodrich","full_name":"Goodrich, Carl Peter","first_name":"Carl Peter"}],"das_tickbox":"1","oa":1,"supplementarymaterial":"yes","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","status":"public","ddc":["570","540"],"day":"01","date_published":"2026-02-01T00:00:00Z","project":[{"_id":"8dd93da8-16d5-11f0-9cad-d2c70200d9a5","name":"Dynamically reconfigurable self-assembly with triangular DNA-origami bricks","grant_number":"FTI23-G-011"}],"publisher":"Springer Nature","file":[{"access_level":"open_access","checksum":"f4e3123d5d9dfcd22324e2c2de02e9a2","success":1,"content_type":"application/pdf","date_created":"2026-07-27T10:57:57Z","file_id":"22417","relation":"main_file","creator":"dernst","file_size":2802534,"date_updated":"2026-07-27T10:57:57Z","file_name":"2026_NaturePhysics_Huebl.pdf"}],"publication":"Nature Physics","department":[{"_id":"CaGo"},{"_id":"GradSch"}],"month":"02","year":"2026","type":"journal_article","OA_type":"hybrid","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"abstract":[{"text":"Modern experimental methods in programmable self-assembly make it possible to precisely design particle concentrations, shapes and interactions. However, more physical insight is needed before we can take full advantage of this vast design space to assemble nanostructures with complex form and function. Here we show how a substantial part of this design space can be quickly and comprehensively understood by identifying a class of thermodynamic constraints that act on it. These thermodynamic constraints form a high-dimensional convex polyhedron that determines which nanostructures can be assembled at high equilibrium yield and reveals limitations that govern the coexistence of structures. We validate our predictions through detailed, quantitative assembly experiments of nanoscale particles synthesized using DNA origami. Our results uncover physical relationships underpinning many-component programmable self-assembly in equilibrium and form the basis for robust inverse design, applicable to various systems from biological protein complexes to synthetic nanomachines.","lang":"eng"}],"researchdata_availability":"yes","date_updated":"2026-07-27T10:59:15Z","scopus_import":"1","related_material":{"link":[{"description":"News on ISTA website","url":"https://ista.ac.at/en/news/behind-natures-blueprints/","relation":"press_release"}]},"acknowledgement":"We thank B. Isaac and A. Tiano for their technical support with the electron microscopy and S. Waitukaitis for helpful comments on the manuscript. The TEM images were prepared and imaged at the Brandeis Electron Microscopy facility. This work was supported by the Gesellschaft für Forschungsförderung Niederösterreich under project FTI23-G-011 (M.C.H. and C.P.G.), the Brandeis University Materials Research Science and Engineering Center (MRSEC) under grant number NSF DMR-2011846 (T.E.V., D.H. and W.B.R.) and the Smith Family Foundation (W.B.R.). Open access funding provided by Institute of Science and Technology (IST Austria).","date_created":"2026-01-20T10:02:19Z","article_type":"original","dataavailabilitystatement":"Design files and folding conditions of DNA origami used in this work are provided in the repository Nanobase68 and are accessible at https://nanobase.org/structures/247. All the TEM images and associated experimental data are available via Zenodo at https://doi.org/10.5281/zenodo.17314727 (ref. 70).\r\nStructure enumeration was performed using the Roly.jl27,71 (v.0.1.0) package developed by M.C.H. and C.P.G., which is available via GitHub at https://github.com/mxhbl/Roly.jl. Polyhedral computation and linear programming were performed using the freely available Convex.jl72 (v.0.16.4) package, Polyhedra.jl73 (v.0.7.8) package and cddlib63 (v.0.9.4) library. The example code reproducing the calculations done on the three rings and reconfigurable squares is available via GitHub at https://github.com/mxhbl/PolyhedralStructureOfSelfAssembly. An implementation of the lattice Monte Carlo sampler is available via GitHub at https://github.com/mxhbl/LatticeSampler. Fitting of the yield curves was achieved using the freely available Optim.jl74 (v.1.12.0) package.","doi":"10.1038/s41567-025-03120-3","article_processing_charge":"Yes (via OA deal)","citation":{"ista":"Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. 2026. A polyhedral structure controls programmable self-assembly. Nature Physics. 22, 294–301.","mla":"Hübl, Maximilian, et al. “A Polyhedral Structure Controls Programmable Self-Assembly.” <i>Nature Physics</i>, vol. 22, Springer Nature, 2026, pp. 294–301, doi:<a href=\"https://doi.org/10.1038/s41567-025-03120-3\">10.1038/s41567-025-03120-3</a>.","short":"M. Hübl, T.E. Videbæk, D. Hayakawa, W.B. Rogers, C.P. Goodrich, Nature Physics 22 (2026) 294–301.","ama":"Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. A polyhedral structure controls programmable self-assembly. <i>Nature Physics</i>. 2026;22:294-301. doi:<a href=\"https://doi.org/10.1038/s41567-025-03120-3\">10.1038/s41567-025-03120-3</a>","chicago":"Hübl, Maximilian, Thomas E. Videbæk, Daichi Hayakawa, W. Benjamin Rogers, and Carl Peter Goodrich. “A Polyhedral Structure Controls Programmable Self-Assembly.” <i>Nature Physics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41567-025-03120-3\">https://doi.org/10.1038/s41567-025-03120-3</a>.","ieee":"M. Hübl, T. E. Videbæk, D. Hayakawa, W. B. Rogers, and C. P. Goodrich, “A polyhedral structure controls programmable self-assembly,” <i>Nature Physics</i>, vol. 22. Springer Nature, pp. 294–301, 2026.","apa":"Hübl, M., Videbæk, T. E., Hayakawa, D., Rogers, W. B., &#38; Goodrich, C. P. (2026). A polyhedral structure controls programmable self-assembly. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-025-03120-3\">https://doi.org/10.1038/s41567-025-03120-3</a>"},"_id":"21006"}]