[{"article_number":"e13859","project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"department":[{"_id":"MaIb"}],"author":[{"first_name":"Ren","full_name":"He, Ren","last_name":"He"},{"first_name":"Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","orcid":"0000-0002-6962-8598","last_name":"Lee","full_name":"Lee, Seungho"},{"first_name":"Yang","last_name":"Ding","full_name":"Ding, Yang"},{"first_name":"Chen","last_name":"Huang","full_name":"Huang, Chen"},{"full_name":"Lu, Xuan","last_name":"Lu","first_name":"Xuan"},{"last_name":"Zheng","full_name":"Zheng, Lirong","first_name":"Lirong"},{"last_name":"Yu","full_name":"Yu, Ao","first_name":"Ao"},{"first_name":"Chaoyue","last_name":"Zhang","full_name":"Zhang, Chaoyue"},{"first_name":"Canhuang","full_name":"Li, Canhuang","last_name":"Li"},{"last_name":"Bi","full_name":"Bi, Xiaoyu","first_name":"Xiaoyu"},{"first_name":"Yaqiang","last_name":"Li","full_name":"Li, Yaqiang"},{"first_name":"Yaqi","last_name":"Liao","full_name":"Liao, Yaqi"},{"last_name":"Li","full_name":"Li, Junshan","first_name":"Junshan"},{"last_name":"Ostovari Moghaddam","full_name":"Ostovari Moghaddam, Ahmad","first_name":"Ahmad"},{"first_name":"Salimov","full_name":"Yernar, Salimov","last_name":"Yernar"},{"full_name":"Xu, Ying","last_name":"Xu","first_name":"Ying"},{"last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Chaoqi","last_name":"Zhang","full_name":"Zhang, Chaoqi"},{"first_name":"Linlin","full_name":"Yang, Linlin","last_name":"Yang"},{"full_name":"Zhou, Yingtang","last_name":"Zhou","first_name":"Yingtang"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"date_created":"2025-08-17T22:01:37Z","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"_id":"20191","das_tickbox":"1","publisher":"Wiley","OA_type":"hybrid","has_accepted_license":"1","oa":1,"publication_status":"published","year":"2026","file_date_updated":"2026-07-23T11:40:34Z","volume":36,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"no","publication":"Advanced Functional Materials","issue":"5","keyword":["amorphous","high entropy alloy","in situ electrochemical impedance spec-troscopy","in situ Raman","Li–S batteries"],"intvolume":"        36","doi":"10.1002/adfm.202513859","type":"journal_article","citation":{"ista":"He R, Lee S, Ding Y, Huang C, Lu X, Zheng L, Yu A, Zhang C, Li C, Bi X, Li Y, Liao Y, Li J, Ostovari Moghaddam A, Yernar S, Xu Y, Ibáñez M, Zhang C, Yang L, Zhou Y, Cabot A. 2026. Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. Advanced Functional Materials. 36(5), e13859.","short":"R. He, S. Lee, Y. Ding, C. Huang, X. Lu, L. Zheng, A. Yu, C. Zhang, C. Li, X. Bi, Y. Li, Y. Liao, J. Li, A. Ostovari Moghaddam, S. Yernar, Y. Xu, M. Ibáñez, C. Zhang, L. Yang, Y. Zhou, A. Cabot, Advanced Functional Materials 36 (2026).","ama":"He R, Lee S, Ding Y, et al. Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. <i>Advanced Functional Materials</i>. 2026;36(5). doi:<a href=\"https://doi.org/10.1002/adfm.202513859\">10.1002/adfm.202513859</a>","chicago":"He, Ren, Seungho Lee, Yang Ding, Chen Huang, Xuan Lu, Lirong Zheng, Ao Yu, et al. “Amorphous High Entropy Alloy Nanosheets Enabling Robust Li–S Batteries.” <i>Advanced Functional Materials</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/adfm.202513859\">https://doi.org/10.1002/adfm.202513859</a>.","apa":"He, R., Lee, S., Ding, Y., Huang, C., Lu, X., Zheng, L., … Cabot, A. (2026). Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. <i>Advanced Functional Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adfm.202513859\">https://doi.org/10.1002/adfm.202513859</a>","ieee":"R. He <i>et al.</i>, “Amorphous high entropy alloy nanosheets enabling robust Li–S batteries,” <i>Advanced Functional Materials</i>, vol. 36, no. 5. Wiley, 2026.","mla":"He, Ren, et al. “Amorphous High Entropy Alloy Nanosheets Enabling Robust Li–S Batteries.” <i>Advanced Functional Materials</i>, vol. 36, no. 5, e13859, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/adfm.202513859\">10.1002/adfm.202513859</a>."},"publication_identifier":{"eissn":["1616-3028"],"issn":["1616-301X"]},"month":"01","file":[{"access_level":"open_access","relation":"main_file","checksum":"b102207b2343e6e7dba00870bfe362ea","creator":"dernst","file_name":"2026_AdvancedFunctionalMat_He.pdf","success":1,"date_updated":"2026-07-23T11:40:34Z","file_size":5734587,"date_created":"2026-07-23T11:40:34Z","content_type":"application/pdf","file_id":"22397"}],"dataavailabilitystatement":"The data that support the findings of this study are available from the cor-responding authors upon reasonable request.","date_published":"2026-01-15T00:00:00Z","researchdata_availability":"upon request","isi":1,"day":"15","abstract":[{"text":"High-entropy alloys (HEAs) show great potential for catalyzing complex multi-step reactions, but optimizing their parameters, i.e., composition, but also their crystallinity and morphology, remains a significant challenge. In this study, FeCoNiMoW HEAs are synthesized into either amorphous nanosheets (HEANS) or crystalline nanoparticles (HEANP), which are then used to catalyze the lithium–sulfur (Li–S) reaction of Li–S batteries (LSBs). Evaluations in symmetric cells, coin cells, and pouch cells reveal that HEANS significantly enhance LSB performance, achieving initial discharge capacities up to 1632 mAh g−1. The batteries also exhibit excellent cycling stability over 1000 cycles at 3Cand maintain high-rate performance up to 10C with a capacity of 614 mAh g−1. Comprehensive in situ analyses and density functional theory calculations demonstrate that amorphous HEANS provide more active sites, better ionic conductivity and stronger chemical interactions with lithium polysulfides (LiPS). These properties effectively suppress the shuttle effect, promote the complete S8 → Li2S conversion by reducing the impedance of the solid-electrolyte interphase, and accelerate the Li2S4 → Li2S2 step by lowering the nucleation energy barrier. Overall, this study highlights the superior catalytic properties of amorphous 2D HEAs in LSBs and offers new insights into the mechanisms of LiPS conversion.","lang":"eng"}],"acknowledged_ssus":[{"_id":"EM-Fac"}],"oa_version":"Published Version","article_type":"original","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"ddc":["540"],"date_updated":"2026-07-23T11:42:17Z","acknowledgement":"The authors acknowledge support from the 2BoSS project of the ERA-MIN3 program with the Spanish grant number PCI2022-132985/AEI/10.13039/50110001103, and funding from Generalitat de Catalunya 2021SGR01581 and European Union NextGenerationEU/PRTR. L.Yang, C.Huang, X.Lu, A.Yu, C.Li, J.Yu, and X.Bi thank the China Scholarship Council (CSC) for the scholarship support. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Electron Microscopy Facility (EMF), and by the Werner Siemens Foundation (WSS) for financial support.","status":"public","quality_controlled":"1","OA_place":"publisher","title":"Amorphous high entropy alloy nanosheets enabling robust Li–S batteries","external_id":{"isi":["001544757200001"]}},{"date_updated":"2026-07-23T12:11:25Z","acknowledgement":"The authors gratefully acknowledge discussions with Professor Robert Plant (University of Reading, UK), Professor Steve Sherwood (University of New South Wales, Australia), Professor Steve Tobias, Professor Douglas Parker, and Gregory Dritschel (University of Leeds, UK). Discussions with colleagues at the Institute of Science and Technology Austria played a large role in shaping this study. The authors are particularly grateful for inputs and discussions from Dr. Jiawei Bao, Dr. Alejandro Casallas, and Alzbeta Pechacova.\r\nThis project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska–Curie grant agreement No. 101034413. C. Muller gratefully acknowledges funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","article_type":"original","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":["550"],"title":"Moist convection and radiative cooling: Dynamical response and scaling","external_id":{"isi":["001595821400001"]},"status":"public","quality_controlled":"1","OA_place":"publisher","publication_identifier":{"issn":["0035-9009"],"eissn":["1477-870X"]},"citation":{"short":"L.N. Agasthya, C.J. Muller, Quarterly Journal of the Royal Meteorological Society 152 (2026).","ama":"Agasthya LN, Muller CJ. Moist convection and radiative cooling: Dynamical response and scaling. <i>Quarterly Journal of the Royal Meteorological Society</i>. 2026;152(775). doi:<a href=\"https://doi.org/10.1002/qj.70044\">10.1002/qj.70044</a>","ista":"Agasthya LN, Muller CJ. 2026. Moist convection and radiative cooling: Dynamical response and scaling. Quarterly Journal of the Royal Meteorological Society. 152(775), e70044.","apa":"Agasthya, L. N., &#38; Muller, C. J. (2026). Moist convection and radiative cooling: Dynamical response and scaling. <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley. <a href=\"https://doi.org/10.1002/qj.70044\">https://doi.org/10.1002/qj.70044</a>","chicago":"Agasthya, Lokahith N, and Caroline J Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/qj.70044\">https://doi.org/10.1002/qj.70044</a>.","ieee":"L. N. Agasthya and C. J. Muller, “Moist convection and radiative cooling: Dynamical response and scaling,” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 775. Wiley, 2026.","mla":"Agasthya, Lokahith N., and Caroline J. Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 775, e70044, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/qj.70044\">10.1002/qj.70044</a>."},"month":"01","doi":"10.1002/qj.70044","type":"journal_article","day":"01","acknowledged_ssus":[{"_id":"ScienComp"}],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Moist convection is a fundamental process occurring in the Earth's atmosphere. It plays a central role in the weather and climate of the Tropics, where, to first order, the heating of the atmosphere by convection is in balance with the cooling of the atmosphere by the emission of radiation to outer space. In this study, we use a cloud-resolving model in radiative–convective equilibrium with an imposed constant rate of radiative cooling and study the response of moist convection to varying this rate of radiative cooling. In particular, we study two types of simulation: varying air temperature (VAT) simulations, where the air temperature is allowed to adjust to the imposed radiative cooling, and constant air temperature (CAT) simulations, where the surface temperature is tuned to ensure that the atmospheric temperature profile in the domain is constant. We recover the previously known result that, in response to increasing radiative cooling, the area of convection expands rapidly, while the intensity of convection does not change. We find that this response is explained by the increased boundary-layer variability in simulations with greater radiative cooling, which compensates for the decreasing temperature by adding a larger initial velocity close to the cloud base. We also propose a fundamental scaling of the non-dimensional cumulus mass flux in moist convection, which is robust across models of different complexity. We aim to bridge the gap between highly idealised prototypes of moist convection, such as the “Rainy–Bénard convection” introduced by Vallis et al., and comprehensive cloud-resolving models."}],"file":[{"file_name":"2026_QuartJourRoyalMeteorobiolSoc_Agasthya.pdf","success":1,"date_updated":"2026-07-23T12:10:28Z","access_level":"open_access","relation":"main_file","checksum":"8dd4d4d3ad027a4d26cbe5b1d66371e9","creator":"dernst","content_type":"application/pdf","file_id":"22398","date_created":"2026-07-23T12:10:28Z","file_size":2665988}],"researchdata_availability":"no","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author, L. Agasthya, upon reasonable request.","date_published":"2026-01-01T00:00:00Z","isi":1,"year":"2026","file_date_updated":"2026-07-23T12:10:28Z","volume":152,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"hybrid","has_accepted_license":"1","oa":1,"ec_funded":1,"publication_status":"published","PlanS_conform":"1","corr_author":"1","intvolume":"       152","supplementarymaterial":"yes","publication":"Quarterly Journal of the Royal Meteorological Society","issue":"775","author":[{"first_name":"Lokahith N","id":"cd100965-0804-11ed-9c55-f4878ff4e877","last_name":"Agasthya","full_name":"Agasthya, Lokahith N"},{"id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","first_name":"Caroline J","orcid":"0000-0001-5836-5350","last_name":"Muller","full_name":"Muller, Caroline J"}],"article_number":"e70044","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"},{"name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020","_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041"}],"department":[{"_id":"CaMu"}],"language":[{"iso":"eng"}],"_id":"20590","das_tickbox":"1","publisher":"Wiley","date_created":"2025-11-02T23:01:34Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)"},{"volume":8,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","ec_funded":1,"publication_status":"published","has_accepted_license":"1","OA_type":"green","oa":1,"keyword":["Topological data analysis","Delaunay mosaic","alpha complex","chromatic sets","persistent homology","kernel/image/cokernel persistent homology","radius function","discrete Morse theory","exact sequences"],"corr_author":"1","intvolume":"         8","publication":"Foundations of Data Science","author":[{"id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-0832","first_name":"Sebastiano","full_name":"Cultrera di Montesano, Sebastiano","last_name":"Cultrera di Montesano"},{"first_name":"Ondrej","orcid":"0000-0003-0464-3823","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","last_name":"Draganov","full_name":"Draganov, Ondrej"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","last_name":"Saghafian","full_name":"Saghafian, Morteza"}],"project":[{"call_identifier":"H2020","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"department":[{"_id":"HeEd"}],"publisher":"American Institute of Mathematical Sciences","language":[{"iso":"eng"}],"_id":"20585","scopus_import":"1","article_processing_charge":"No","date_created":"2025-11-02T23:01:33Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15091"}]},"acknowledgement":"This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund\r\n(FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.","date_updated":"2026-07-23T12:03:56Z","ddc":["510"],"article_type":"original","external_id":{"arxiv":["2212.03128"]},"page":"30-62","title":"Chromatic alpha complexes","quality_controlled":"1","OA_place":"repository","status":"public","citation":{"short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Foundations of Data Science 8 (2026) 30–62.","ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. Chromatic alpha complexes. Foundations of Data Science. 8, 30–62.","ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. <i>Foundations of Data Science</i>. 2026;8:30-62. doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2026). Chromatic alpha complexes. <i>Foundations of Data Science</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>","chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>. American Institute of Mathematical Sciences, 2026. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>.","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic alpha complexes,” <i>Foundations of Data Science</i>, vol. 8. American Institute of Mathematical Sciences, pp. 30–62, 2026.","mla":"Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>, vol. 8, American Institute of Mathematical Sciences, 2026, pp. 30–62, doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>."},"publication_identifier":{"eissn":["2639-8001"]},"month":"03","type":"journal_article","doi":"10.3934/fods.2025003","abstract":[{"text":"Motivated by applications in medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided.","lang":"eng"}],"arxiv":1,"oa_version":"Preprint","mathsc":["62R40","55N31","68T09","57Q70"],"day":"01","date_published":"2026-03-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.03128","open_access":"1"}]},{"corr_author":"1","intvolume":"       132","publication":"European Journal of Combinatorics","year":"2026","volume":132,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"green","oa":1,"ec_funded":1,"publication_status":"published","language":[{"iso":"eng"}],"_id":"20490","das_tickbox":"0","publisher":"Elsevier","date_created":"2025-10-19T22:01:31Z","scopus_import":"1","article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"Alexey","full_name":"Garber, Alexey","last_name":"Garber"},{"first_name":"Mohadese","last_name":"Ghafari","full_name":"Ghafari, Mohadese"},{"full_name":"Heiss, Teresa","last_name":"Heiss","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1780-2689","first_name":"Teresa"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"article_number":"104248","project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"}],"department":[{"_id":"HeEd"}],"title":"Flips in two-dimensional hypertriangulations","external_id":{"isi":["001599061500002"],"arxiv":["2212.11380"]},"status":"public","quality_controlled":"1","OA_place":"repository","date_updated":"2026-07-23T11:58:37Z","acknowledgement":"Work by all authors but the second is supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. Work by the second author is partially supported by the Alexander von Humboldt Foundation and by the Simons Foundation . The second author thanks Jesús A. De Loera for useful discussions on flips and non-flips and Pavel Galashin and Alexey Balitskiy for useful discussions on plabic graphs.","article_type":"original","day":"01","oa_version":"Preprint","abstract":[{"text":"We study flips in hypertriangulations of planar points sets. Here a level-k hypertriangulation of n\r\n points in the plane is a subdivision induced by the projection of a k-hypersimplex, which is the convex hull of the barycenters of the (k-1)-dimensional faces of the standard (n-1)-simplex. In particular, we introduce four types of flips and prove that the level-2 hypertriangulations are connected by these flips.\r\n","lang":"eng"}],"arxiv":1,"date_published":"2026-02-01T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.11380","open_access":"1"}],"isi":1,"publication_identifier":{"issn":["0195-6698"]},"citation":{"apa":"Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., &#38; Saghafian, M. (2026). Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>.","short":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2026).","ama":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. 2026;132. doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>","ista":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2026. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 132, 104248.","mla":"Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>, vol. 132, 104248, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” <i>European Journal of Combinatorics</i>, vol. 132. Elsevier, 2026."},"month":"02","doi":"10.1016/j.ejc.2025.104248","type":"journal_article"},{"issue":"7","publication":"IEEE Transactions on Information Theory","supplementarymaterial":"no","intvolume":"        72","publication_status":"published","oa":1,"OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":72,"year":"2026","article_processing_charge":"No","scopus_import":"1","date_created":"2025-07-27T22:01:26Z","publisher":"IEEE","das_tickbox":"0","_id":"20081","language":[{"iso":"eng"}],"department":[{"_id":"MaMo"}],"author":[{"full_name":"Esposito, Amedeo Roberto","last_name":"Esposito","id":"9583e921-e1ad-11ec-9862-cef099626dc9","first_name":"Amedeo Roberto"},{"first_name":"Michael","last_name":"Gastpar","full_name":"Gastpar, Michael"},{"full_name":"Issa, Ibrahim","last_name":"Issa","first_name":"Ibrahim"}],"OA_place":"repository","quality_controlled":"1","status":"public","page":"4434-4467","external_id":{"arxiv":["2405.08352"]},"title":"Sibson α-mutual information and its variational representations","article_type":"original","acknowledgement":"This work was supported by the Swiss National Science Foundation under\r\nGrant 200364. An earlier version of this paper was presented in part at\r\nthe 2024 IEEE International Symposium on Information Theory, Athens,\r\nGreece [DOI: 10.1109/ISIT57864.2024.10619378]. (Corresponding author:\r\nAmedeo Roberto Esposito.)","date_updated":"2026-07-23T11:38:30Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.08352"}],"date_published":"2026-07-01T00:00:00Z","researchdata_availability":"no","arxiv":1,"abstract":[{"lang":"eng","text":"Information measures can be constructed from Rényi divergences much like mutual information from Kullback-Leibler divergence. One such information measure is known as Sibson α-mutual information and has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this paper, we survey and extend the state of the art. In particular, we introduce variational representations for Sibson α-mutual information and employ them in each described context to derive novel results. Namely, we produce generalized Transportation-Cost inequalities and Fano-type inequalities. We also present an overview of known applications, spanning from learning theory and Bayesian risk to universal prediction."}],"oa_version":"Preprint","day":"01","type":"journal_article","doi":"10.1109/TIT.2025.3587340","month":"07","publication_identifier":{"eissn":["1557-9654"],"issn":["0018-9448"]},"citation":{"mla":"Esposito, Amedeo Roberto, et al. “Sibson α-Mutual Information and Its Variational Representations.” <i>IEEE Transactions on Information Theory</i>, vol. 72, no. 7, IEEE, 2026, pp. 4434–67, doi:<a href=\"https://doi.org/10.1109/TIT.2025.3587340\">10.1109/TIT.2025.3587340</a>.","ieee":"A. R. Esposito, M. Gastpar, and I. Issa, “Sibson α-mutual information and its variational representations,” <i>IEEE Transactions on Information Theory</i>, vol. 72, no. 7. IEEE, pp. 4434–4467, 2026.","apa":"Esposito, A. R., Gastpar, M., &#38; Issa, I. (2026). Sibson α-mutual information and its variational representations. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2025.3587340\">https://doi.org/10.1109/TIT.2025.3587340</a>","chicago":"Esposito, Amedeo Roberto, Michael Gastpar, and Ibrahim Issa. “Sibson α-Mutual Information and Its Variational Representations.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2026. <a href=\"https://doi.org/10.1109/TIT.2025.3587340\">https://doi.org/10.1109/TIT.2025.3587340</a>.","ama":"Esposito AR, Gastpar M, Issa I. Sibson α-mutual information and its variational representations. <i>IEEE Transactions on Information Theory</i>. 2026;72(7):4434-4467. doi:<a href=\"https://doi.org/10.1109/TIT.2025.3587340\">10.1109/TIT.2025.3587340</a>","ista":"Esposito AR, Gastpar M, Issa I. 2026. Sibson α-mutual information and its variational representations. IEEE Transactions on Information Theory. 72(7), 4434–4467.","short":"A.R. Esposito, M. Gastpar, I. Issa, IEEE Transactions on Information Theory 72 (2026) 4434–4467."}},{"ddc":["000"],"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"},"alternative_title":["ISTA Thesis"],"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","date_updated":"2026-07-24T12:48:29Z","OA_place":"publisher","status":"public","page":"244","title":"Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks","type":"dissertation","doi":"10.15479/AT-ISTA-22281","doi_confirm":"1","month":"07","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.","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>.","short":"A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.","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>","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>","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>."},"publication_identifier":{"issn":["2663-337X"]},"date_published":"2026-07-13T00:00:00Z","file":[{"file_name":"2026_El-Hayek_Antoine_Thesis.pdf","success":1,"date_updated":"2026-07-17T11:39:47Z","access_level":"open_access","relation":"main_file","checksum":"923e4ca769c9ef2f6b0b005444faf462","creator":"aelhayek","content_type":"application/pdf","file_id":"22356","date_created":"2026-07-17T11:39:47Z","file_size":5465973},{"access_level":"closed","relation":"source_file","checksum":"262689f9df27dd6c2c7c7861f1de7329","creator":"aelhayek","file_name":"2026_El-Hayek_Antoine_Thesis.zip","date_updated":"2026-07-20T11:29:38Z","date_created":"2026-07-17T11:40:34Z","file_size":9116107,"content_type":"application/x-zip-compressed","file_id":"22357"}],"degree_awarded":"PhD","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"day":"13","publication_status":"published","publisher_comment":"Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved.","ec_funded":1,"oa":1,"has_accepted_license":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file_date_updated":"2026-07-20T11:29:38Z","year":"2026","supervisor":[{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"}],"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"MoHe"}],"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"author":[{"first_name":"Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","last_name":"El-Hayek","full_name":"El-Hayek, Antoine"}],"article_processing_charge":"No","related_material":{"record":[{"id":"20051","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"18557"},{"id":"19982","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"21720"},{"id":"22374","relation":"part_of_dissertation","status":"public"},{"id":"22373","status":"public","relation":"part_of_dissertation"}]},"date_created":"2026-07-13T09:39:59Z","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"_id":"22281"},{"date_published":"2026-01-07T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.13105"}],"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"}],"oa_version":"Preprint","arxiv":1,"day":"07","type":"conference","doi":"10.1137/1.9781611978971.25","publication_identifier":{"issn":["1071-9040"],"eissn":["1557-9468"],"eisbn":["9781611978971"]},"citation":{"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>.","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.","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>.","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>","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.","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>","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."},"month":"01","quality_controlled":"1","OA_place":"repository","status":"public","external_id":{"arxiv":["2512.13105"]},"page":"613-663","title":"Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time","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_updated":"2026-07-24T12:48:29Z","scopus_import":"1","article_processing_charge":"No","date_created":"2026-04-12T22:01:51Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"22281"}]},"publisher":"Society for Industrial and Applied Mathematics","language":[{"iso":"eng"}],"_id":"21720","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"department":[{"_id":"MoHe"},{"_id":"GradSch"}],"author":[{"orcid":"0000-0003-4268-7368","id":"888a098e-fcac-11ee-aff7-d347be57b725","first_name":"Antoine","full_name":"El-Hayek, Antoine","last_name":"El-Hayek"},{"last_name":"Henzinger","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","orcid":"0000-0002-5008-6530"},{"full_name":"Li, Jason","last_name":"Li","first_name":"Jason"}],"publication":"Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms","conference":{"name":"SODA: Symposium on Discrete Algorithms","location":"Vancouver, Canada","start_date":"2026-01-11","end_date":"2026-01-14"},"intvolume":"      2026","ec_funded":1,"publication_status":"published","OA_type":"green","oa":1,"volume":2026,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026"},{"month":"07","citation":{"ieee":"T. M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, and D. W. Zheng, “Charting the landscape of diameter computation on geometric intersection graphs in the plane,” in <i>53rd International Colloquium on Automata, Languages, and Programming</i>, Egham, United Kingdom, 2026, vol. 374.","mla":"Chan, Timothy M., et al. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” <i>53rd International Colloquium on Automata, Languages, and Programming</i>, vol. 374, 54:1-54:22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2026.54\">10.4230/LIPICS.ICALP.2026.54</a>.","short":"T.M. Chan, H.-C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng, in:, 53rd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026.","ama":"Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. Charting the landscape of diameter computation on geometric intersection graphs in the plane. In: <i>53rd International Colloquium on Automata, Languages, and Programming</i>. Vol 374. Schloss Dagstuhl – Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPICS.ICALP.2026.54\">10.4230/LIPICS.ICALP.2026.54</a>","ista":"Chan TM, Chang H-C, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. 2026. Charting the landscape of diameter computation on geometric intersection graphs in the plane. 53rd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming vol. 374, 54:1-54:22.","chicago":"Chan, Timothy M., Hsien-Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Landscape of Diameter Computation on Geometric Intersection Graphs in the Plane.” In <i>53rd International Colloquium on Automata, Languages, and Programming</i>, Vol. 374. Schloss Dagstuhl – Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2026.54\">https://doi.org/10.4230/LIPICS.ICALP.2026.54</a>.","apa":"Chan, T. M., Chang, H.-C., Gao, J., Kisfaludi-Bak, S., Le, H., &#38; Zheng, D. W. (2026). Charting the landscape of diameter computation on geometric intersection graphs in the plane. In <i>53rd International Colloquium on Automata, Languages, and Programming</i> (Vol. 374). Egham, United Kingdom: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPICS.ICALP.2026.54\">https://doi.org/10.4230/LIPICS.ICALP.2026.54</a>"},"publication_identifier":{"eissn":["1868-8969","9783959774284"]},"doi":"10.4230/LIPICS.ICALP.2026.54","type":"conference","abstract":[{"text":"Computing the diameter of the intersection graphs of objects is a basic problem in computational geometry. Previous works showed that the complexity of computing the diameter mainly depends on the object types: for unit disks and squares in 2D, the problem is solvable in truly subquadratic time [Chan et al., 2025], while for other objects, including unit segments and equilateral triangles in 2D or unit balls and axis-parallel unit cubes in 3D, there is no truly subquadratic time algorithm under the Orthogonal Vector (OV) hypothesis [Bringmann et al., 2022]. \r\nWe undertake a comprehensive study of computing the diameter of geometric intersection graphs for various types of objects. We discover many new irregularities, showing that the landscape is extremely nuanced: the source of hardness is a combination of the object type, the true diameter value, and how the objects intersect with each other. Our highlighted results for the 2D case include:  \r\n1) The diameter of non-degenerate, axis-aligned line segments can be computed in truly subquadratic time. Previous hardness result [Bringmann et al., 2022] for line segments applies only to degenerate instances. On the other hand, for the degenerate case, we show that a truly subquadratic time algorithm exists when the true diameter is constant. \r\n2) An almost-linear-time algorithm for unit-square graphs of constant diameter. Previous algorithms [Duraj et al., 2024; Chan et al., 2025] rely on succinct representation assuming bounded VC-dimension; for such a strategy Ω(n^{7/4}) time is an inherent barrier. \r\n3) An Õ(n^{4/3})-time algorithm to decide if the diameter of a unit-disk graph is at most 2. This improves upon the recent algorithm with running time Õ(n^{2-1/9}) [Chan et al., 2025]. \r\n4) Deciding if the diameter of intersection graphs of fat triangles or line segments is at most 2 is truly subquadratic-hard under fine-grained complexity assumptions. Previous lower bounds [Bringmann et al., 2022] only hold when deciding if diameter is at most 3.  Our findings are presented in a pair of papers. This paper focuses solely on the 2D case, while the companion paper is devoted to higher-dimensional cases.","lang":"eng"}],"arxiv":1,"oa_version":"Published Version","day":"01","date_published":"2026-07-01T00:00:00Z","researchdata_availability":"no","file":[{"date_updated":"2026-07-27T06:20:41Z","file_name":"2026_LIPIcSICALP_Chan.pdf","success":1,"creator":"dernst","checksum":"1e66eba4cfe4e74ab28108b1ca0bb956","relation":"main_file","access_level":"open_access","file_id":"22407","content_type":"application/pdf","file_size":1440497,"date_created":"2026-07-27T06:20:41Z"}],"acknowledgement":"Timothy M. Chan: Supported by NSF grant CCF-2224271.\r\nHsien-Chih Chang: Supported by NSF CAREER award CCF-2443017.\r\nJie Gao: Supported by NSF DMS-2220271, DMS-2311064, IIS-2229876, CCF-2118953, CNS-2515159.\r\nSándor Kisfaludi-Bak: Supported by the Research Council of Finland, Grant 363444.\r\nHung Le: Supported by an NSF grant CCF-2517033 and an NSF CAREER Award CCF-2237288.\r\nDa Wei Zheng: This project has received funding from the Austrian Science Fund (FWF) grant\r\nDOI 10.55776/I5982. 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.\r\n","date_updated":"2026-07-27T06:22:03Z","ddc":["000"],"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"},"external_id":{"arxiv":["2605.10692"]},"title":"Charting the landscape of diameter computation on geometric intersection graphs in the plane","OA_place":"publisher","quality_controlled":"1","status":"public","author":[{"last_name":"Chan","full_name":"Chan, Timothy M.","first_name":"Timothy M.","orcid":"0000-0002-8093-0675"},{"orcid":"0000-0001-6714-7988","first_name":"Hsien-Chih","full_name":"Chang, Hsien-Chih","last_name":"Chang"},{"full_name":"Gao, Jie","last_name":"Gao","first_name":"Jie","orcid":"0000-0001-5083-6082"},{"full_name":"Kisfaludi-Bak, Sándor","last_name":"Kisfaludi-Bak","orcid":"0000-0002-6856-2902","first_name":"Sándor"},{"last_name":"Le","full_name":"Le, Hung","orcid":"0000-0001-8223-9944","first_name":"Hung"},{"first_name":"Da Wei","id":"af77956b-e859-11ef-8dc9-d301b898e32f","full_name":"Zheng, Da Wei","last_name":"Zheng"}],"department":[{"_id":"MoHe"}],"project":[{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"}],"article_number":"54:1-54:22","publisher":"Schloss Dagstuhl – Leibniz-Zentrum für Informatik","das_tickbox":"0","_id":"22405","language":[{"iso":"eng"}],"article_processing_charge":"No","scopus_import":"1","date_created":"2026-07-27T05:53:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":374,"file_date_updated":"2026-07-27T06:20:41Z","year":"2026","publication_status":"published","oa":1,"OA_type":"gold","has_accepted_license":"1","conference":{"name":"ICALP: Automata, Languages and Programming","location":"Egham, United Kingdom","start_date":"2026-07-07","end_date":"2026-07-10"},"intvolume":"       374","corr_author":"1","keyword":["String graphs","Fine-grained complexity","Theory of computation → Computational geometry"],"publication":"53rd International Colloquium on Automata, Languages, and Programming","supplementarymaterial":"no"},{"OA_type":"gold","has_accepted_license":"1","oa":1,"PlanS_conform":"1","publication_status":"epub_ahead","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","publication":"Advanced Science","article_number":"e76620","department":[{"_id":"FlSc"},{"_id":"GradSch"}],"author":[{"first_name":"Shengbo","full_name":"You, Shengbo","last_name":"You"},{"first_name":"Georgios","last_name":"Varnavides","full_name":"Varnavides, Georgios"},{"last_name":"Khavnekar","full_name":"Khavnekar, Sagar","first_name":"Sagar"},{"full_name":"Palatkin, Nikita","last_name":"Palatkin","first_name":"Nikita"},{"last_name":"Shao","full_name":"Shao, Sihan","first_name":"Sihan"},{"first_name":"Mingjian","last_name":"Wu","full_name":"Wu, Mingjian"},{"last_name":"Stroppa","full_name":"Stroppa, Daniel","first_name":"Daniel"},{"last_name":"Chernikova","full_name":"Chernikova, Darya","id":"7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0","first_name":"Darya"},{"full_name":"Zhu, Baixu","last_name":"Zhu","first_name":"Baixu"},{"last_name":"Egoavil","full_name":"Egoavil, Ricardo","first_name":"Ricardo"},{"full_name":"Vespucci, Stefano","last_name":"Vespucci","first_name":"Stefano"},{"first_name":"Dileep","last_name":"Krishnan","full_name":"Krishnan, Dileep"},{"first_name":"Xingchen","full_name":"Ye, Xingchen","last_name":"Ye"},{"last_name":"Schur","full_name":"Schur, Florian KM","first_name":"Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Erdmann","full_name":"Spiecker, Erdmann","last_name":"Spiecker"},{"full_name":"Pelz, Philipp","last_name":"Pelz","first_name":"Philipp"}],"date_created":"2026-07-26T19:01:34Z","scopus_import":"1","article_processing_charge":"Yes","_id":"22403","language":[{"iso":"eng"}],"das_tickbox":"1","publisher":"Wiley","article_type":"original","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":["570","600"],"date_updated":"2026-07-27T06:04:57Z","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.","status":"public","quality_controlled":"1","OA_place":"publisher","title":"Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels","external_id":{"arxiv":["2512.19460"]},"type":"journal_article","doi":"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>","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>.","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>","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).","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>.","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."},"publication_identifier":{"eissn":["2198-3844"]},"month":"07","researchdata_availability":"yes","date_published":"2026-07-23T00:00:00Z","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.","main_file_link":[{"url":"https://doi.org/10.1002/advs.76620","open_access":"1"}],"day":"23","DOAJ_listed":"1","abstract":[{"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.","lang":"eng"}],"arxiv":1,"oa_version":"Published Version"},{"corr_author":"1","intvolume":"       101","keyword":["evolutionary theory","population genetics","balancing selection","heterozygote advantage","trade-offs","negative frequency-dependent selection","fitness variation","mathematical modelling"],"publication":"Biological Reviews","supplementarymaterial":"yes","issue":"2","file_date_updated":"2026-07-27T08:07:35Z","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":101,"oa":1,"has_accepted_license":"1","OA_type":"hybrid","publication_status":"published","ec_funded":1,"language":[{"iso":"eng"}],"_id":"20655","publisher":"Wiley","das_tickbox":"0","date_created":"2025-11-19T09:43:50Z","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","author":[{"last_name":"Ruzicka","full_name":"Ruzicka, Filip","id":"347955dd-57b0-11ee-9095-c28bdd368f4b","first_name":"Filip"},{"full_name":"Zwoinska, Martyna K.","last_name":"Zwoinska","first_name":"Martyna K."},{"last_name":"Goedert","full_name":"Goedert, Debora","first_name":"Debora"},{"last_name":"Kokko","full_name":"Kokko, Hanna","first_name":"Hanna"},{"first_name":"Xiang‐Yi","full_name":"Li Richter, Xiang‐Yi","last_name":"Li Richter"},{"last_name":"Moodie","full_name":"Moodie, Iain R.","first_name":"Iain R."},{"first_name":"Sofie","last_name":"Nilén","full_name":"Nilén, Sofie"},{"first_name":"Colin","full_name":"Olito, Colin","last_name":"Olito"},{"first_name":"Erik I.","last_name":"Svensson","full_name":"Svensson, Erik I."},{"full_name":"Czuppon, Peter","last_name":"Czuppon","first_name":"Peter"},{"first_name":"Tim","full_name":"Connallon, Tim","last_name":"Connallon"}],"article_number":"804-825","department":[{"_id":"BeVi"}],"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"title":"A century of theories of balancing selection","external_id":{"isi":["001614285900001"],"pmid":["41235821 "]},"status":"public","OA_place":"publisher","quality_controlled":"1","date_updated":"2026-07-27T08:08:09Z","acknowledgement":"We thank Brian Charlesworth, Deborah Charlesworth, and Sally Otto for extensive comments and suggestions. We also thank Göran Arnqvist, Adam Eyre-Walker, Philip Hedrick, Jitka Polechová, and Henrique Teotónio for further helpful comments on the manuscript. This work was supported by a H2020 Marie Skłodowska-Curie COFUND Action fellowship (#101034413, to F. R.), the Birgitta Sintring Foundation (#S2024-0007, to M. K. Z.), the Research Council of Norway (302619, to D. G.), the Alexander von Humboldt Foundation (to H. K.), the Swiss National Science Foundation (#211549, to X. L. R.), the Swedish Research Council (#2022-03603, to CO; #2020-03123, to E. I. S.) and the European Research Council (ERC-2023-STG-#101117517, to C. O.). We are particularly grateful to the European Society for Evolutionary Biology for funding a Special Topics Network workshop (to T. C., H. K., E. I. S.), from which this review began. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","article_type":"original","ddc":["570"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"day":"01","abstract":[{"lang":"eng","text":"Traits that affect organismal fitness are often highly genetically variable. This genetic variation is vital for populations to adapt to their environments, but it is also surprising given that nature – after all – ‘selects’ the best genotypes at the expense of those that fall short. Explaining the extensive genetic variation of fitness‐related traits is thus a longstanding puzzle in evolutionary biology, with cascading implications for ecology, conservation, and human health. Balancing selection – an umbrella term for scenarios in which natural selection maintains genetic variation – is a century‐old explanation to resolve this puzzle that has gained recent momentum from genome‐scale methods for detecting it. Yet evaluating whether balancing selection can, in fact, resolve the puzzle is challenging, given the logistical constraints of distinguishing balancing selection from alternative hypotheses and the daunting collection of theoretical models that formally underpin this debate. Here, we track the development of balancing selection theory over the last century and provide an accessible review of this rich collection of models. We first outline the range of biological scenarios that can generate balancing selection. We then examine how fundamental features of genetic systems – non‐random mating between individuals, ploidy levels, genetic drift, linkage, and genetic architectures of traits – have been progressively incorporated into the theory. We end by linking these theoretical predictions to ongoing empirical efforts to understand the evolutionary processes that explain genetic variation."}],"oa_version":"Published Version","file":[{"checksum":"167d95cf0570d6e3653ab349b2a4355c","creator":"dernst","access_level":"open_access","relation":"main_file","date_updated":"2026-07-27T08:07:35Z","success":1,"file_name":"2026_BiologicalReviews_Ruzicka.pdf","date_created":"2026-07-27T08:07:35Z","file_size":1757556,"file_id":"22409","content_type":"application/pdf"}],"isi":1,"pmid":1,"date_published":"2026-04-01T00:00:00Z","researchdata_availability":"no","month":"04","citation":{"short":"F. Ruzicka, M.K. Zwoinska, D. Goedert, H. Kokko, X. Li Richter, I.R. Moodie, S. Nilén, C. Olito, E.I. Svensson, P. Czuppon, T. Connallon, Biological Reviews 101 (2026).","ista":"Ruzicka F, Zwoinska MK, Goedert D, Kokko H, Li Richter X, Moodie IR, Nilén S, Olito C, Svensson EI, Czuppon P, Connallon T. 2026. A century of theories of balancing selection. Biological Reviews. 101(2), 804–825.","ama":"Ruzicka F, Zwoinska MK, Goedert D, et al. A century of theories of balancing selection. <i>Biological Reviews</i>. 2026;101(2). doi:<a href=\"https://doi.org/10.1111/brv.70103\">10.1111/brv.70103</a>","apa":"Ruzicka, F., Zwoinska, M. K., Goedert, D., Kokko, H., Li Richter, X., Moodie, I. R., … Connallon, T. (2026). A century of theories of balancing selection. <i>Biological Reviews</i>. Wiley. <a href=\"https://doi.org/10.1111/brv.70103\">https://doi.org/10.1111/brv.70103</a>","chicago":"Ruzicka, Filip, Martyna K. Zwoinska, Debora Goedert, Hanna Kokko, Xiang‐Yi Li Richter, Iain R. Moodie, Sofie Nilén, et al. “A Century of Theories of Balancing Selection.” <i>Biological Reviews</i>. Wiley, 2026. <a href=\"https://doi.org/10.1111/brv.70103\">https://doi.org/10.1111/brv.70103</a>.","ieee":"F. Ruzicka <i>et al.</i>, “A century of theories of balancing selection,” <i>Biological Reviews</i>, vol. 101, no. 2. Wiley, 2026.","mla":"Ruzicka, Filip, et al. “A Century of Theories of Balancing Selection.” <i>Biological Reviews</i>, vol. 101, no. 2, 804–825, Wiley, 2026, doi:<a href=\"https://doi.org/10.1111/brv.70103\">10.1111/brv.70103</a>."},"publication_identifier":{"issn":["1464-7931"],"eissn":["1469-185X"]},"type":"journal_article","doi":"10.1111/brv.70103"},{"OA_place":"publisher","quality_controlled":"1","status":"public","page":"116-124","external_id":{"isi":["001611698900001"],"pmid":["41219410"]},"title":"Lumen charge governs gated ion transport in β-barrel nanopores","ddc":["570"],"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"},"article_type":"original","acknowledgement":"We are grateful to M. Mayer and G. van der Goot for their insightful discussions and thoughtful feedback. We acknowledge funding from the European Research Council (grants 101020445—2D-LIQUID N.R. and A.R., MSCA number 101034413 P.R.), the Swiss National Science Foundation (grants 205321_192371 and 200021L_212128 to M.D.P., TMPFP2-217134 to T.E., and IZSEZ0_183779 to J.H.G. and A.R.) and the Swiss National Supercomputing Centre (CSCS) for access to the HPC resources used to run MD simulations. We thank the staff members of the Dubochet Center for Imaging in Lausanne, in particular E. Uchikawa and S. Nazarov, for their assistance with cryo-EM sample preparation and data collection. We thank A. Antanasijevic and Y. Duhoo from EPFL Protein Production and Structure Core Facility for their support in cryo-EM data processing.","date_updated":"2026-07-27T08:24:20Z","isi":1,"date_published":"2026-01-01T00:00:00Z","pmid":1,"dataavailabilitystatement":"All data that support the findings of this study are available within the article and its Supplementary Information. Source data are available via Zenodo at https://doi.org/10.5281/zenodo.17200775 (ref. 64). Cryo-EM data for aerolysin can be accessed through the EMDB with the code EMD-51664 for E254A–E258A and EMD-52853 for post-prepore and quasipore. All data processing codes, simulation and modelling codes are available at https://github.com/lukasvandenheuvel/Biomemristors.","researchdata_availability":"yes","file":[{"file_id":"22412","content_type":"application/pdf","file_size":10091503,"date_created":"2026-07-27T08:22:57Z","date_updated":"2026-07-27T08:22:57Z","success":1,"file_name":"2026_NatureNanotech_Mayer.pdf","checksum":"ff9a5eafe60af1d97da545453bd53eca","creator":"dernst","access_level":"open_access","relation":"main_file"}],"abstract":[{"lang":"eng","text":"β-Barrel nanopores are involved in crucial biological processes, from ATP export in mitochondria to bacterial resistance, and represent a promising platform for emerging sequencing technologies. However, in contrast to ion channels, the understanding of the fundamental principles governing ion transport through these nanopores remains largely unexplored. Here we integrate experimental, numerical and theoretical approaches to elucidate ion transport mechanisms in β-barrel nanopores. We identify and characterize two distinct nonlinear phenomena: open-pore rectification and gating. Through extensive mutation analysis of aerolysin nanopores, we demonstrate that open-pore rectification is caused by ionic accumulation driven by the distribution of lumen charges. In addition, we provide converging evidence suggesting that gating is controlled by electric fields dissociating counterions from lumen charges, promoting local structural deformations. Our findings establish a rigorous framework for characterizing and understanding ion transport processes in protein-based nanopores, enabling the design of adaptable nanofluidic biotechnologies. We illustrate this by optimizing an aerolysin mutant for computing applications."}],"oa_version":"Published Version","day":"01","type":"journal_article","doi":"10.1038/s41565-025-02052-6","month":"01","publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"citation":{"mla":"Mayer, Simon, et al. “Lumen Charge Governs Gated Ion Transport in β-Barrel Nanopores.” <i>Nature Nanotechnology</i>, vol. 21, Springer Nature, 2026, pp. 116–24, doi:<a href=\"https://doi.org/10.1038/s41565-025-02052-6\">10.1038/s41565-025-02052-6</a>.","ieee":"S. Mayer <i>et al.</i>, “Lumen charge governs gated ion transport in β-barrel nanopores,” <i>Nature Nanotechnology</i>, vol. 21. Springer Nature, pp. 116–124, 2026.","apa":"Mayer, S., Mitsioni, M. F., Robin, P., Van Den Heuvel, L., Ronceray, N., Marcaida, M. J., … Radenovic, A. (2026). Lumen charge governs gated ion transport in β-barrel nanopores. <i>Nature Nanotechnology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41565-025-02052-6\">https://doi.org/10.1038/s41565-025-02052-6</a>","chicago":"Mayer, Simon, Marianna Fanouria Mitsioni, Paul Robin, Lukas Van Den Heuvel, Nathan Ronceray, Maria Jose Marcaida, Luciano A. Abriata, et al. “Lumen Charge Governs Gated Ion Transport in β-Barrel Nanopores.” <i>Nature Nanotechnology</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41565-025-02052-6\">https://doi.org/10.1038/s41565-025-02052-6</a>.","ama":"Mayer S, Mitsioni MF, Robin P, et al. Lumen charge governs gated ion transport in β-barrel nanopores. <i>Nature Nanotechnology</i>. 2026;21:116-124. doi:<a href=\"https://doi.org/10.1038/s41565-025-02052-6\">10.1038/s41565-025-02052-6</a>","ista":"Mayer S, Mitsioni MF, Robin P, Van Den Heuvel L, Ronceray N, Marcaida MJ, Abriata LA, Krapp LF, Anton JS, Soussou S, Jeanneret-Grosjean J, Fulciniti A, Möller A, Vacle S, Feletti L, Brinkerhoff H, Laszlo AH, Gundlach JH, Emmerich T, Dal Peraro M, Radenovic A. 2026. Lumen charge governs gated ion transport in β-barrel nanopores. Nature Nanotechnology. 21, 116–124.","short":"S. Mayer, M.F. Mitsioni, P. Robin, L. Van Den Heuvel, N. Ronceray, M.J. Marcaida, L.A. Abriata, L.F. Krapp, J.S. Anton, S. Soussou, J. Jeanneret-Grosjean, A. Fulciniti, A. Möller, S. Vacle, L. Feletti, H. Brinkerhoff, A.H. Laszlo, J.H. Gundlach, T. Emmerich, M. Dal Peraro, A. Radenovic, Nature Nanotechnology 21 (2026) 116–124."},"publication":"Nature Nanotechnology","supplementarymaterial":"yes","intvolume":"        21","publication_status":"published","PlanS_conform":"1","oa":1,"OA_type":"hybrid","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":21,"file_date_updated":"2026-07-27T08:22:57Z","year":"2026","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/lukasvandenheuvel/Biomemristors"}]},"date_created":"2025-11-23T23:01:40Z","publisher":"Springer Nature","das_tickbox":"1","_id":"20670","language":[{"iso":"eng"}],"department":[{"_id":"EdHa"}],"author":[{"full_name":"Mayer, Simon","last_name":"Mayer","first_name":"Simon"},{"last_name":"Mitsioni","full_name":"Mitsioni, Marianna Fanouria","first_name":"Marianna Fanouria"},{"orcid":"0000-0002-5728-9189","first_name":"Paul","id":"48c58128-57b0-11ee-9095-dc28fd97fc1d","full_name":"Robin, Paul","last_name":"Robin"},{"last_name":"Van Den Heuvel","full_name":"Van Den Heuvel, Lukas","first_name":"Lukas"},{"last_name":"Ronceray","full_name":"Ronceray, Nathan","first_name":"Nathan"},{"first_name":"Maria Jose","last_name":"Marcaida","full_name":"Marcaida, Maria Jose"},{"full_name":"Abriata, Luciano A.","last_name":"Abriata","first_name":"Luciano A."},{"first_name":"Lucien F.","full_name":"Krapp, Lucien F.","last_name":"Krapp"},{"first_name":"Jana S.","last_name":"Anton","full_name":"Anton, Jana S."},{"last_name":"Soussou","full_name":"Soussou, Sarah","first_name":"Sarah"},{"first_name":"Justin","full_name":"Jeanneret-Grosjean, Justin","last_name":"Jeanneret-Grosjean"},{"first_name":"Alessandro","full_name":"Fulciniti, Alessandro","last_name":"Fulciniti"},{"first_name":"Alexia","last_name":"Möller","full_name":"Möller, Alexia"},{"full_name":"Vacle, Sarah","last_name":"Vacle","first_name":"Sarah"},{"first_name":"Lely","last_name":"Feletti","full_name":"Feletti, Lely"},{"full_name":"Brinkerhoff, Henry","last_name":"Brinkerhoff","first_name":"Henry"},{"full_name":"Laszlo, Andrew H.","last_name":"Laszlo","first_name":"Andrew H."},{"full_name":"Gundlach, Jens H.","last_name":"Gundlach","first_name":"Jens H."},{"full_name":"Emmerich, Theo","last_name":"Emmerich","first_name":"Theo"},{"full_name":"Dal Peraro, Matteo","last_name":"Dal Peraro","first_name":"Matteo"},{"first_name":"Aleksandra","full_name":"Radenovic, Aleksandra","last_name":"Radenovic"}]},{"_id":"20814","language":[{"iso":"eng"}],"publisher":"Springer Nature","das_tickbox":"1","date_created":"2025-12-14T23:02:03Z","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","author":[{"first_name":"Matthias","full_name":"Keller, Matthias","last_name":"Keller"},{"first_name":"Daniel","last_name":"Lenz","full_name":"Lenz, Daniel"},{"first_name":"Marcel","last_name":"Schmidt","full_name":"Schmidt, Marcel"},{"first_name":"Michael","full_name":"Schwarz, Michael","last_name":"Schwarz"},{"id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","first_name":"Melchior","orcid":"0000-0002-0519-4241","full_name":"Wirth, Melchior","last_name":"Wirth"}],"article_number":"6","department":[{"_id":"JaMa"}],"project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"call_identifier":"H2020","grant_number":"716117","_id":"256E75B8-B435-11E9-9278-68D0E5697425","name":"Optimal Transport and Stochastic Dynamics"},{"grant_number":"ESP156_N","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","name":"Gradient flow techniques for quantum Markov semigroups"}],"intvolume":"        64","keyword":["Dirichlet forms","Domination of semigroups","Dirichlet","Neumann and Robin boundary conditions"],"publication":"Potential Analysis","supplementarymaterial":"no","issue":"1","file_date_updated":"2026-07-27T10:25:21Z","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":64,"oa":1,"OA_type":"hybrid","has_accepted_license":"1","PlanS_conform":"1","publication_status":"published","ec_funded":1,"day":"01","mathsc":["31C15","31C25","35A15","35J10","47D07"],"abstract":[{"lang":"eng","text":"We characterize all semigroups sandwiched between the semigroup of a Dirichlet form and the semigroup of its active main part. In case the Dirichlet form is regular, we give a more explicit description of the quadratic forms of the sandwiched semigroups in terms of pairs consisting of an open set and a measure on an abstract boundary."}],"oa_version":"Published Version","arxiv":1,"file":[{"file_id":"22414","content_type":"application/pdf","file_size":445935,"date_created":"2026-07-27T10:25:21Z","date_updated":"2026-07-27T10:25:21Z","file_name":"2026_PotentialAnalysis_Keller.pdf","success":1,"checksum":"9f5a4e900b8d4c74c6b5bf7c3bad54e1","creator":"dernst","access_level":"open_access","relation":"main_file"}],"date_published":"2026-01-01T00:00:00Z","dataavailabilitystatement":"No datasets were generated or analysed during the current study.","researchdata_availability":"no","month":"01","publication_identifier":{"issn":["0926-2601"],"eissn":["1572-929X"]},"citation":{"short":"M. Keller, D. Lenz, M. Schmidt, M. Schwarz, M. Wirth, Potential Analysis 64 (2026).","ista":"Keller M, Lenz D, Schmidt M, Schwarz M, Wirth M. 2026. Boundary representations of intermediate forms between a regular Dirichlet form and its active main part. Potential Analysis. 64(1), 6.","ama":"Keller M, Lenz D, Schmidt M, Schwarz M, Wirth M. Boundary representations of intermediate forms between a regular Dirichlet form and its active main part. <i>Potential Analysis</i>. 2026;64(1). doi:<a href=\"https://doi.org/10.1007/s11118-025-10251-y\">10.1007/s11118-025-10251-y</a>","apa":"Keller, M., Lenz, D., Schmidt, M., Schwarz, M., &#38; Wirth, M. (2026). Boundary representations of intermediate forms between a regular Dirichlet form and its active main part. <i>Potential Analysis</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11118-025-10251-y\">https://doi.org/10.1007/s11118-025-10251-y</a>","chicago":"Keller, Matthias, Daniel Lenz, Marcel Schmidt, Michael Schwarz, and Melchior Wirth. “Boundary Representations of Intermediate Forms between a Regular Dirichlet Form and Its Active Main Part.” <i>Potential Analysis</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s11118-025-10251-y\">https://doi.org/10.1007/s11118-025-10251-y</a>.","ieee":"M. Keller, D. Lenz, M. Schmidt, M. Schwarz, and M. Wirth, “Boundary representations of intermediate forms between a regular Dirichlet form and its active main part,” <i>Potential Analysis</i>, vol. 64, no. 1. Springer Nature, 2026.","mla":"Keller, Matthias, et al. “Boundary Representations of Intermediate Forms between a Regular Dirichlet Form and Its Active Main Part.” <i>Potential Analysis</i>, vol. 64, no. 1, 6, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s11118-025-10251-y\">10.1007/s11118-025-10251-y</a>."},"doi":"10.1007/s11118-025-10251-y","type":"journal_article","title":"Boundary representations of intermediate forms between a regular Dirichlet form and its active main part","external_id":{"arxiv":["2301.01035"]},"status":"public","OA_place":"publisher","quality_controlled":"1","date_updated":"2026-07-27T10:25:46Z","acknowledgement":"Open Access funding enabled and organized by Projekt DEAL. The first three authors acknowledge financial support of the DFG within the priority programme Geometry at Infinity.\r\nM.W. acknowledges financial support by the German Academic Scholarship Foundation, by the Austrian Science Fund (FWF) through grant number F65 and the Esprit Programme [ESP 156], and by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 716117).","article_type":"original","ddc":["510"],"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"}},{"publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"citation":{"ista":"Edelsbrunner H, Pach J. 2026. Maximum Betti numbers of Čech complexes. Discrete &#38; Computational Geometry. 75, 597–624.","short":"H. Edelsbrunner, J. Pach, Discrete &#38; Computational Geometry 75 (2026) 597–624.","ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. <i>Discrete &#38; Computational Geometry</i>. 2026;75:597-624. doi:<a href=\"https://doi.org/10.1007/s00454-025-00796-5\">10.1007/s00454-025-00796-5</a>","apa":"Edelsbrunner, H., &#38; Pach, J. (2026). Maximum Betti numbers of Čech complexes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-025-00796-5\">https://doi.org/10.1007/s00454-025-00796-5</a>","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00454-025-00796-5\">https://doi.org/10.1007/s00454-025-00796-5</a>.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” <i>Discrete &#38; Computational Geometry</i>, vol. 75. Springer Nature, pp. 597–624, 2026.","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>Discrete &#38; Computational Geometry</i>, vol. 75, Springer Nature, 2026, pp. 597–624, doi:<a href=\"https://doi.org/10.1007/s00454-025-00796-5\">10.1007/s00454-025-00796-5</a>."},"month":"03","type":"journal_article","doi":"10.1007/s00454-025-00796-5","day":"01","arxiv":1,"abstract":[{"lang":"eng","text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². "}],"oa_version":"Published Version","file":[{"file_size":546483,"date_created":"2026-07-27T08:11:05Z","file_id":"22410","content_type":"application/pdf","checksum":"c17c014dbbf5be702195c737890251c8","creator":"dernst","access_level":"open_access","relation":"main_file","date_updated":"2026-07-27T08:11:05Z","file_name":"2026_DiscreteCompGeom_Edelsbrunner.pdf","success":1}],"researchdata_availability":"no","date_published":"2026-03-01T00:00:00Z","isi":1,"date_updated":"2026-07-27T08:15:58Z","acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. The second author is supported by the European Research Council (ERC), grant “GeoScape” and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. Open access funding provided by Institute of Science and Technology (IST Austria).","article_type":"original","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"],"title":"Maximum Betti numbers of Čech complexes","external_id":{"isi":["001610592600001"],"arxiv":["2310.14801"]},"page":"597-624","status":"public","quality_controlled":"1","OA_place":"publisher","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","full_name":"Pach, János","last_name":"Pach"}],"project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"}],"department":[{"_id":"HeEd"}],"_id":"20657","language":[{"iso":"eng"}],"das_tickbox":"0","publisher":"Springer Nature","date_created":"2025-11-19T09:44:58Z","related_material":{"record":[{"id":"17146","relation":"earlier_version","status":"public"}]},"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","year":"2026","file_date_updated":"2026-07-27T08:11:05Z","volume":75,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"hybrid","has_accepted_license":"1","oa":1,"ec_funded":1,"publication_status":"published","PlanS_conform":"1","intvolume":"        75","corr_author":"1","supplementarymaterial":"no","publication":"Discrete & Computational Geometry"},{"article_type":"review","ddc":["580"],"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"},"date_updated":"2026-07-27T08:27:07Z","acknowledgement":"I apologize to colleagues whose relevant work I was unable to cite due to space limitations. This work was funded by the European Union (ERC, CYNIPS, 101142681) and Austrian Science Fund (FWF; 37051-B). I thank Drs Huihuang Chen, Yuanrong Pei, Jason Reed, Linlin Qi, and Dolf Weijers for inspiration and critical input.","status":"public","OA_place":"publisher","quality_controlled":"1","title":"Role of cAMP in TIR1/AFB auxin signaling: Open issues","page":"136-138","external_id":{"pmid":["41249070"]},"doi":"10.1016/j.tplants.2025.10.018","type":"journal_article","month":"02","citation":{"mla":"Friml, Jiří. “Role of CAMP in TIR1/AFB Auxin Signaling: Open Issues.” <i>Trends in Plant Science</i>, vol. 31, no. 2, Elsevier, 2026, pp. 136–38, doi:<a href=\"https://doi.org/10.1016/j.tplants.2025.10.018\">10.1016/j.tplants.2025.10.018</a>.","ieee":"J. Friml, “Role of cAMP in TIR1/AFB auxin signaling: Open issues,” <i>Trends in Plant Science</i>, vol. 31, no. 2. Elsevier, pp. 136–138, 2026.","apa":"Friml, J. (2026). Role of cAMP in TIR1/AFB auxin signaling: Open issues. <i>Trends in Plant Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tplants.2025.10.018\">https://doi.org/10.1016/j.tplants.2025.10.018</a>","chicago":"Friml, Jiří. “Role of CAMP in TIR1/AFB Auxin Signaling: Open Issues.” <i>Trends in Plant Science</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.tplants.2025.10.018\">https://doi.org/10.1016/j.tplants.2025.10.018</a>.","ama":"Friml J. Role of cAMP in TIR1/AFB auxin signaling: Open issues. <i>Trends in Plant Science</i>. 2026;31(2):136-138. doi:<a href=\"https://doi.org/10.1016/j.tplants.2025.10.018\">10.1016/j.tplants.2025.10.018</a>","short":"J. Friml, Trends in Plant Science 31 (2026) 136–138.","ista":"Friml J. 2026. Role of cAMP in TIR1/AFB auxin signaling: Open issues. Trends in Plant Science. 31(2), 136–138."},"publication_identifier":{"issn":["1360-1385"],"eissn":["1878-4372"]},"file":[{"date_created":"2026-07-27T08:26:40Z","file_size":432792,"file_id":"22413","content_type":"application/pdf","checksum":"e60e903fb4b3e917dba763976ec652cd","creator":"dernst","access_level":"open_access","relation":"main_file","date_updated":"2026-07-27T08:26:40Z","success":1,"file_name":"2026_TrendsPlantScience_Friml.pdf"}],"researchdata_availability":"no","pmid":1,"date_published":"2026-02-01T00:00:00Z","day":"01","oa_version":"Published Version","abstract":[{"text":"The canonical mechanism by which the phytohormone auxin regulates transcription has been one of the cornerstones of plant signaling. The recent unexpected discovery of cyclic AMP (cAMP) as a second messenger in this pathway has revised its foundations while leaving many open questions and gaps in our understanding; these will be discussed in this forum article.","lang":"eng"}],"oa":1,"OA_type":"hybrid","has_accepted_license":"1","PlanS_conform":"1","publication_status":"published","file_date_updated":"2026-07-27T08:26:40Z","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":31,"publication":"Trends in Plant Science","supplementarymaterial":"no","issue":"2","intvolume":"        31","corr_author":"1","department":[{"_id":"JiFr"}],"project":[{"name":"Cyclic nucleotides as second messengers in plants","grant_number":"101142681","_id":"8f347782-16d5-11f0-9cad-8c19706ee739"},{"name":"Guanylate cyclase activity of TIR1/AFBs auxin receptors","_id":"7bcece63-9f16-11ee-852c-ae94e099eeb6","grant_number":"P37051"}],"author":[{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jiří"}],"date_created":"2025-12-02T16:29:22Z","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","_id":"20725","language":[{"iso":"eng"}],"publisher":"Elsevier","das_tickbox":"0"},{"scopus_import":"1","article_processing_charge":"No","date_created":"2025-11-12T10:03:39Z","das_tickbox":"1","publisher":"Elsevier","_id":"20636","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"author":[{"first_name":"R","full_name":"Huang, R","last_name":"Huang"},{"last_name":"Wang","full_name":"Wang, J","first_name":"J"},{"full_name":"Chang, M","last_name":"Chang","first_name":"M"},{"first_name":"W","last_name":"Tang","full_name":"Tang, W"},{"last_name":"Yu","full_name":"Yu, Y","first_name":"Y"},{"first_name":"Y","last_name":"Zhang","full_name":"Zhang, Y"},{"first_name":"Y","full_name":"Peng, Y","last_name":"Peng"},{"first_name":"Y","full_name":"Wang, Y","last_name":"Wang"},{"last_name":"Guo","full_name":"Guo, Y","first_name":"Y"},{"first_name":"T","full_name":"Lu, T","last_name":"Lu"},{"last_name":"Cao","full_name":"Cao, Y","first_name":"Y"},{"first_name":"Y","last_name":"Zhou","full_name":"Zhou, Y"},{"first_name":"Q","full_name":"Zhang, Q","last_name":"Zhang"},{"full_name":"Huang, Y","last_name":"Huang","first_name":"Y"},{"first_name":"A","last_name":"Wu","full_name":"Wu, A"},{"last_name":"Ren","full_name":"Ren, L","first_name":"L"},{"full_name":"Gallei, Michelle C","last_name":"Gallei","first_name":"Michelle C","id":"35A03822-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1286-7368"},{"first_name":"J","last_name":"Dong","full_name":"Dong, J"},{"full_name":"Chen, H","last_name":"Chen","first_name":"H"},{"first_name":"J","full_name":"He, J","last_name":"He"},{"first_name":"M","full_name":"Wen, M","last_name":"Wen"},{"last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"},{"full_name":"Sun, L","last_name":"Sun","first_name":"L"},{"last_name":"Xiong","full_name":"Xiong, Y","first_name":"Y"},{"first_name":"Z","full_name":"Yang, Z","last_name":"Yang"},{"first_name":"T","last_name":"Xu","full_name":"Xu, T"}],"issue":"1","supplementarymaterial":"yes","publication":"Developmental Cell","intvolume":"        61","publication_status":"published","OA_type":"closed access","volume":61,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","dataavailabilitystatement":"Plasmids and genetic materials generated in this study will be made available upon request from the lead contact.The mass spectrometry data reported in this work have been deposited at the iProX database. Original western blot gel images have been deposited to Mendeley Data. The accession code and the DOI are listed in the key resources table.\r\nThis paper does not report original code. Any additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.","researchdata_availability":"upon request","date_published":"2026-01-14T00:00:00Z","pmid":1,"oa_version":"None","abstract":[{"text":"The versatile and pivotal roles of the phytohormone auxin in regulating plant growth and development are typically linked to its directional transport, relying on the polarized PIN-FORMED (PIN) auxin exporters at the plasma membrane (PM). For decades, auxin has been proposed to promote PIN polarization, generating self-regulatory feedback mediating much of plant development, but mechanistic insight into this regulation is lacking. Here, we uncover an auxin-induced protein complex at the PM, containing auxin co-receptors transmembrane kinases (TMKs) and PIN1 auxin exporter, as the core machinery that underlies this feedback regulation. Auxin promotes PIN1 phosphorylation by TMKs, modulating PIN1 polarization and transport activity. We also provide evidence that PIN1-exported extracellular auxin is crucial for TMK activation and cell elongation, thus forming the simplest two-element self-regulatory feedback circuit. Thus, these findings offer direct mechanistic insights into a potential self-organizing circuit for auxin signaling and transport to ensure proper plant development in Arabidopsis.","lang":"eng"}],"day":"14","doi":"10.1016/j.devcel.2025.09.009","type":"journal_article","citation":{"short":"R. Huang, J. Wang, M. Chang, W. Tang, Y. Yu, Y. Zhang, Y. Peng, Y. Wang, Y. Guo, T. Lu, Y. Cao, Y. Zhou, Q. Zhang, Y. Huang, A. Wu, L. Ren, M.C. Gallei, J. Dong, H. Chen, J. He, M. Wen, J. Friml, L. Sun, Y. Xiong, Z. Yang, T. Xu, Developmental Cell 61 (2026) 73–84.","ama":"Huang R, Wang J, Chang M, et al. TMK-PIN1 drives a short self-organizing circuit for auxin export and signaling in Arabidopsis. <i>Developmental Cell</i>. 2026;61(1):73-84. doi:<a href=\"https://doi.org/10.1016/j.devcel.2025.09.009\">10.1016/j.devcel.2025.09.009</a>","ista":"Huang R, Wang J, Chang M, Tang W, Yu Y, Zhang Y, Peng Y, Wang Y, Guo Y, Lu T, Cao Y, Zhou Y, Zhang Q, Huang Y, Wu A, Ren L, Gallei MC, Dong J, Chen H, He J, Wen M, Friml J, Sun L, Xiong Y, Yang Z, Xu T. 2026. TMK-PIN1 drives a short self-organizing circuit for auxin export and signaling in Arabidopsis. Developmental Cell. 61(1), 73–84.","chicago":"Huang, R, J Wang, M Chang, W Tang, Y Yu, Y Zhang, Y Peng, et al. “TMK-PIN1 Drives a Short Self-Organizing Circuit for Auxin Export and Signaling in Arabidopsis.” <i>Developmental Cell</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.devcel.2025.09.009\">https://doi.org/10.1016/j.devcel.2025.09.009</a>.","apa":"Huang, R., Wang, J., Chang, M., Tang, W., Yu, Y., Zhang, Y., … Xu, T. (2026). TMK-PIN1 drives a short self-organizing circuit for auxin export and signaling in Arabidopsis. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2025.09.009\">https://doi.org/10.1016/j.devcel.2025.09.009</a>","ieee":"R. Huang <i>et al.</i>, “TMK-PIN1 drives a short self-organizing circuit for auxin export and signaling in Arabidopsis,” <i>Developmental Cell</i>, vol. 61, no. 1. Elsevier, pp. 73–84, 2026.","mla":"Huang, R., et al. “TMK-PIN1 Drives a Short Self-Organizing Circuit for Auxin Export and Signaling in Arabidopsis.” <i>Developmental Cell</i>, vol. 61, no. 1, Elsevier, 2026, pp. 73–84, doi:<a href=\"https://doi.org/10.1016/j.devcel.2025.09.009\">10.1016/j.devcel.2025.09.009</a>."},"publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"month":"01","quality_controlled":"1","status":"public","external_id":{"pmid":["41043435"]},"page":"73-84","title":"TMK-PIN1 drives a short self-organizing circuit for auxin export and signaling in Arabidopsis","article_type":"original","acknowledgement":"We thank Lukáš Fiedler‬ for helping with the writing. This work was supported by the National Key Research and Development Program of China (2023YFA0913500) to T.X., R.H., Y.Y., Y.X., and M.W. and by the National Natural Science Foundation of China grants to T.X. (32130010), Z.Y. (3241101698), and R.H. (32070309 and 32470276) and startup funds from the Fujian Agriculture and Forestry University and the Shanghai Plant Stress Biology Center, Chinese Academy of Sciences to T.X.","date_updated":"2026-07-27T08:02:04Z"},{"article_type":"original","ddc":["570"],"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"},"date_updated":"2026-07-27T10:36:28Z","acknowledgement":"We thank Ł. Koziej for processing of the initial cryo-EM datasets, S. Schmelz for support in cryo-EM, A. Gatzemeier for assistance in the purification of dBa1Cas12a3, R. Rarose for support with the in vitro RNA experiments, M. Kaminski for providing purified PsmCas13b protein, L. Schönemann for protein purification, and C. Krempl and S. Backesfor providing the RSV and influenza A transcript-encoding plasmids. This work was supported through funding by the European Research Council (101001394 to S.G.; 865973 and 101158249 to C.L.B.), the R. Gaurth Hansen Family (to R.N.J.), the National Institutes of Health (R35GM138080 to R.N.J.), the PostDoc Plus Program from the Graduate School of Life Sciences at Julius-Maximilians-Universität Würzburg (to O.D.), and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy–The Berlin Mathematics Research Center MATH+ (EXC−2046/1, project ID: 390685689 to M.v.K.). Open access funding provided by Helmholtz-Zentrum für Infektionsforschung GmbH (HZI).","status":"public","OA_place":"publisher","quality_controlled":"1","title":"RNA-triggered Cas12a3 cleaves tRNA tails to execute bacterial immunity","page":"1312-1321","external_id":{"pmid":["41501459"]},"type":"journal_article","doi":"10.1038/s41586-025-09852-9","month":"01","citation":{"ieee":"O. Dmytrenko <i>et al.</i>, “RNA-triggered Cas12a3 cleaves tRNA tails to execute bacterial immunity,” <i>Nature</i>, vol. 649. Springer Nature, pp. 1312–1321, 2026.","mla":"Dmytrenko, Oleg, et al. “RNA-Triggered Cas12a3 Cleaves TRNA Tails to Execute Bacterial Immunity.” <i>Nature</i>, vol. 649, Springer Nature, 2026, pp. 1312–21, doi:<a href=\"https://doi.org/10.1038/s41586-025-09852-9\">10.1038/s41586-025-09852-9</a>.","ista":"Dmytrenko O, Yuan B, Crosby KT, Krebel M, Chen X, Nowak JS, Chramiec-Głąbik A, Filani B, Gribling-Burrer A-S, van der Toorn W, von Kleist M, Achmedov T, Smyth RP, Glatt S, Bravo JPK, Heinz DW, Jackson RN, Beisel CL. 2026. RNA-triggered Cas12a3 cleaves tRNA tails to execute bacterial immunity. Nature. 649, 1312–1321.","ama":"Dmytrenko O, Yuan B, Crosby KT, et al. RNA-triggered Cas12a3 cleaves tRNA tails to execute bacterial immunity. <i>Nature</i>. 2026;649:1312-1321. doi:<a href=\"https://doi.org/10.1038/s41586-025-09852-9\">10.1038/s41586-025-09852-9</a>","short":"O. Dmytrenko, B. Yuan, K.T. Crosby, M. Krebel, X. Chen, J.S. Nowak, A. Chramiec-Głąbik, B. Filani, A.-S. Gribling-Burrer, W. van der Toorn, M. von Kleist, T. Achmedov, R.P. Smyth, S. Glatt, J.P.K. Bravo, D.W. Heinz, R.N. Jackson, C.L. Beisel, Nature 649 (2026) 1312–1321.","apa":"Dmytrenko, O., Yuan, B., Crosby, K. T., Krebel, M., Chen, X., Nowak, J. S., … Beisel, C. L. (2026). RNA-triggered Cas12a3 cleaves tRNA tails to execute bacterial immunity. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-025-09852-9\">https://doi.org/10.1038/s41586-025-09852-9</a>","chicago":"Dmytrenko, Oleg, Biao Yuan, Kadin T. Crosby, Max Krebel, Xiye Chen, Jakub S. Nowak, Andrzej Chramiec-Głąbik, et al. “RNA-Triggered Cas12a3 Cleaves TRNA Tails to Execute Bacterial Immunity.” <i>Nature</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41586-025-09852-9\">https://doi.org/10.1038/s41586-025-09852-9</a>."},"publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"file":[{"success":1,"file_name":"2026_Nature_Dmytrenko.pdf","date_updated":"2026-07-27T10:35:26Z","access_level":"open_access","relation":"main_file","checksum":"f6b40af573fc7c0c0195e1428b1d0143","creator":"dernst","content_type":"application/pdf","file_id":"22415","date_created":"2026-07-27T10:35:26Z","file_size":28253320}],"date_published":"2026-01-29T00:00:00Z","dataavailabilitystatement":"The Illumina-based PFS screen data and the direct RNA Nanopore sequencing reads have been deposited into the European Nucleotide Archive under accession code PRJEB88250 (https://www.ebi.ac.uk/ena/browser/view/PRJEB88250). Models and associated cryo-EM maps have been deposited into the Electron Microscopy Data Bank (EMD) and PDB databases with the following accession codes: Ba1Cas12a3 binary complex (EMD-52275; PDB: 9HLX); Ba1Cas12a3 ternary complex (EMD-52287; PDB: 9HM6); Ba1Cas12a3 quaternary complex at pre-cleavage state (EMD-52285; PDB: 9HM4); and Ba1Cas12a3 quaternary complex at post-cleavage state (EMD-52286; PDB: 9HM5). Raw gel images are included as Supplementary Fig. 1. Source data are provided with this paper.","pmid":1,"researchdata_availability":"yes","day":"29","abstract":[{"text":"In all domains of life, tRNAs mediate the transfer of genetic information from mRNAs to proteins. As their depletion suppresses translation and, consequently, viral replication, tRNAs represent long-standing and increasingly recognized targets of innate immunity1,2,3,4,5. Here we report Cas12a3 effector nucleases from type V CRISPR–Cas adaptive immune systems in bacteria that preferentially cleave tRNAs after recognition of target RNA. Cas12a3 orthologues belong to one of two previously unreported nuclease clades that exhibit RNA-mediated cleavage of non-target RNA, and are distinct from all other known type V systems. Through cell-based and biochemical assays and direct RNA sequencing, we demonstrate that recognition of a complementary target RNA by the CRISPR RNA triggers Cas12a3 to cleave the conserved 5′-CCA-3′ tail of diverse tRNAs to drive growth arrest and anti-phage defence. Cryogenic electron microscopy structures further revealed a distinct tRNA-loading domain that positions the tRNA tail in the RuvC active site of the nuclease. By designing synthetic reporters that mimic the tRNA acceptor stem and tail, we expanded the capacity of current CRISPR-based diagnostics for multiplexed RNA detection. Overall, these findings reveal widespread tRNA inactivation as a previously unrecognized CRISPR-based immune strategy that broadens the application space of the existing CRISPR toolbox.","lang":"eng"}],"oa_version":"Published Version","oa":1,"has_accepted_license":"1","OA_type":"hybrid","PlanS_conform":"1","publication_status":"published","file_date_updated":"2026-07-27T10:35:26Z","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":649,"publication":"Nature","supplementarymaterial":"yes","intvolume":"       649","department":[{"_id":"JaBr"}],"author":[{"first_name":"Oleg","full_name":"Dmytrenko, Oleg","last_name":"Dmytrenko"},{"last_name":"Yuan","full_name":"Yuan, Biao","first_name":"Biao"},{"last_name":"Crosby","full_name":"Crosby, Kadin T.","first_name":"Kadin T."},{"first_name":"Max","last_name":"Krebel","full_name":"Krebel, Max"},{"first_name":"Xiye","last_name":"Chen","full_name":"Chen, Xiye"},{"full_name":"Nowak, Jakub S.","last_name":"Nowak","first_name":"Jakub S."},{"first_name":"Andrzej","full_name":"Chramiec-Głąbik, Andrzej","last_name":"Chramiec-Głąbik"},{"full_name":"Filani, Bamidele","last_name":"Filani","first_name":"Bamidele"},{"full_name":"Gribling-Burrer, Anne-Sophie","last_name":"Gribling-Burrer","first_name":"Anne-Sophie"},{"full_name":"van der Toorn, Wiep","last_name":"van der Toorn","first_name":"Wiep"},{"first_name":"Max","full_name":"von Kleist, Max","last_name":"von Kleist"},{"full_name":"Achmedov, Tatjana","last_name":"Achmedov","first_name":"Tatjana"},{"first_name":"Redmond P.","full_name":"Smyth, Redmond P.","last_name":"Smyth"},{"first_name":"Sebastian","full_name":"Glatt, Sebastian","last_name":"Glatt"},{"id":"96aecfa5-8931-11ee-af30-aa6a5d6eee0e","orcid":"0000-0003-0456-0753","first_name":"Jack Peter Kelly","last_name":"Bravo","full_name":"Bravo, Jack Peter Kelly"},{"first_name":"Dirk W.","last_name":"Heinz","full_name":"Heinz, Dirk W."},{"last_name":"Jackson","full_name":"Jackson, Ryan N.","first_name":"Ryan N."},{"full_name":"Beisel, Chase L.","last_name":"Beisel","first_name":"Chase L."}],"date_created":"2026-01-08T07:57:17Z","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","language":[{"iso":"eng"}],"_id":"20963","publisher":"Springer Nature","das_tickbox":"1"},{"article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"ddc":["550"],"date_updated":"2026-07-27T11:10:50Z","acknowledgement":"This article is based on chapter 5 of the PhD thesis of A. Casallas. The authors thank Graziano Giuliani for discussions on the boundary-condition experiments. A. Casallas was supported by a PhD fellowship awarded by the Abdus Salam International Centre for Theoretical Physics. A. Casallas also acknowledges support by the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No 101034413. C. Muller acknowledges funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). The authors gratefully acknowledge Daniel Hernández-Deckers, Lokahith Agasthya, Chris Holloway, and Paolina Cerlini for their valuable feedback and insightful discussions. They are especially thankful to Bety Pechacova for suggesting the use of SHAP to complement their analysis. They also thank the two anonymous reviewers for their constructive comments, which improved the quality and clarity of the article significantly. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","status":"public","quality_controlled":"1","OA_place":"publisher","title":"Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events","doi":"10.1002/qj.70131","type":"journal_article","citation":{"mla":"Casallas Garcia, Alejandro, et al. “Moisture and Wind Effects of Rossby Waves on Western Pacific Intertropical Convergence Zone Breakdown Events.” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 777, e70131, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/qj.70131\">10.1002/qj.70131</a>.","ieee":"A. Casallas Garcia, A. Mark Tompkins, and C. J. Muller, “Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events,” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 777. Wiley, 2026.","apa":"Casallas Garcia, A., Mark Tompkins, A., &#38; Muller, C. J. (2026). Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events. <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley. <a href=\"https://doi.org/10.1002/qj.70131\">https://doi.org/10.1002/qj.70131</a>","chicago":"Casallas Garcia, Alejandro, Adrian Mark Tompkins, and Caroline J Muller. “Moisture and Wind Effects of Rossby Waves on Western Pacific Intertropical Convergence Zone Breakdown Events.” <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/qj.70131\">https://doi.org/10.1002/qj.70131</a>.","ista":"Casallas Garcia A, Mark Tompkins A, Muller CJ. 2026. Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events. Quarterly Journal of the Royal Meteorological Society. 152(777), e70131.","ama":"Casallas Garcia A, Mark Tompkins A, Muller CJ. Moisture and wind effects of Rossby waves on Western Pacific Intertropical Convergence Zone breakdown events. <i>Quarterly Journal of the Royal Meteorological Society</i>. 2026;152(777). doi:<a href=\"https://doi.org/10.1002/qj.70131\">10.1002/qj.70131</a>","short":"A. Casallas Garcia, A. Mark Tompkins, C.J. Muller, Quarterly Journal of the Royal Meteorological Society 152 (2026)."},"publication_identifier":{"eissn":["1477-870X"],"issn":["0035-9009"]},"month":"04","file":[{"date_updated":"2026-07-27T11:09:24Z","file_name":"2026_QuarterlyJourRoyalMeteorolSoc_Casallas.pdf","success":1,"creator":"dernst","checksum":"3edd5dee1459dcf62973ae501270be8c","relation":"main_file","access_level":"open_access","file_id":"22419","content_type":"application/pdf","date_created":"2026-07-27T11:09:24Z","file_size":11133215}],"date_published":"2026-04-01T00:00:00Z","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author, Alejandro Casallas, upon reasonable request.","researchdata_availability":"upon request","day":"01","oa_version":"Published Version","abstract":[{"lang":"eng","text":"This study investigates the mechanisms driving clustered convection and the breakdown of the Intertropical Convergence Zone (ITCZ) over the Western Pacific Warm Pool using high‐resolution cloud‐resolving simulations and machine‐learning sensitivity experiments. Results show that ITCZ breakdown episodes, marked by spatially homogeneous convection and weakened meridional moisture gradients, are triggered primarily by anomalous moisture advection linked to the equatorial Rossby‐wave activity. While large‐scale moisture advection regulates the background convective state strongly, it is the surface and low‐level meridional winds that dominate transitions between clustered and random convection. Simulations demonstrate that moisture alone can sustain convective clustering, but breakdown episodes are more persistent and widespread when coupled with southerly meridional advection. These findings confirm that wave‐driven advection acts as a regulatory mechanism, periodically disrupting convective clustering and reshaping the meridional moisture gradient. This modulation of organization by wave‐induced breakdown events is critical for understanding tropical convection variability and its implications for the climate system."}],"has_accepted_license":"1","OA_type":"hybrid","oa":1,"ec_funded":1,"publication_status":"published","year":"2026","file_date_updated":"2026-07-27T11:09:24Z","volume":152,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","publication":"Quarterly Journal of the Royal Meteorological Society","issue":"777","intvolume":"       152","corr_author":"1","article_number":"e70131","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041","call_identifier":"H2020","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate"}],"department":[{"_id":"CaMu"}],"author":[{"orcid":"0000-0002-1988-5035","first_name":"Alejandro","id":"92081129-2d75-11ef-a48d-b04dd7a2385a","full_name":"Casallas Garcia, Alejandro","last_name":"Casallas Garcia"},{"first_name":"Adrian","last_name":"Mark Tompkins","full_name":"Mark Tompkins, Adrian"},{"full_name":"Muller, Caroline J","last_name":"Muller","first_name":"Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"date_created":"2026-02-12T10:13:02Z","scopus_import":"1","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"_id":"21217","das_tickbox":"1","publisher":"Wiley"},{"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":["570","577"],"article_type":"original","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.","date_updated":"2026-07-27T10:48:35Z","quality_controlled":"1","OA_place":"publisher","status":"public","external_id":{"pmid":["41529680"]},"page":"791-798.e6","title":"Interplay between syllable duration and pitch during whistle matching in wild nightingales","doi":"10.1016/j.cub.2025.12.025","type":"journal_article","citation":{"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>","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.","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>.","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>","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>."},"publication_identifier":{"issn":["0960-9822"],"eissn":["1879-0445"]},"month":"02","researchdata_availability":"yes","date_published":"2026-02-02T00:00:00Z","pmid":1,"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.","file":[{"date_updated":"2026-07-27T10:47:55Z","success":1,"file_name":"2026_CurrentBiology_CalderonGarcia.pdf","checksum":"e17c3537193d5ab4886596d1a04f9b0e","creator":"dernst","access_level":"open_access","relation":"main_file","file_id":"22416","content_type":"application/pdf","date_created":"2026-07-27T10:47:55Z","file_size":7120959}],"abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","day":"02","ec_funded":1,"PlanS_conform":"1","publication_status":"published","has_accepted_license":"1","OA_type":"hybrid","oa":1,"volume":36,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","file_date_updated":"2026-07-27T10:47:55Z","issue":"3","supplementarymaterial":"yes","publication":"Current Biology","intvolume":"        36","project":[{"_id":"0aacfa84-070f-11eb-9043-d7eb2c709234","call_identifier":"H2020","grant_number":"819603","name":"Learning the shape of synaptic plasticity rules for neuronal architectures and function through machine learning."}],"department":[{"_id":"GradSch"},{"_id":"TiVo"}],"author":[{"first_name":"Juan Sebastian","id":"1271b54b-dbcd-11ea-9d1d-d92da838fe2c","full_name":"Calderon Garcia, Juan Sebastian","last_name":"Calderon Garcia"},{"full_name":"Costalunga, Giacomo","last_name":"Costalunga","first_name":"Giacomo"},{"id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","first_name":"Tim P","orcid":"0000-0003-3295-6181","last_name":"Vogels","full_name":"Vogels, Tim P"},{"first_name":"Daniela","last_name":"Vallentin","full_name":"Vallentin, Daniela"}],"scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","date_created":"2026-01-14T12:00:29Z","das_tickbox":"1","publisher":"Elsevier","_id":"20986","language":[{"iso":"eng"}]},{"file_date_updated":"2026-07-27T11:03:37Z","year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":324,"oa":1,"OA_type":"hybrid","has_accepted_license":"1","PlanS_conform":"1","publication_status":"published","intvolume":"       324","publication":"Chemical Engineering Science","supplementarymaterial":"yes","author":[{"first_name":"Changwei","full_name":"Shi, Changwei","last_name":"Shi"},{"full_name":"Horta, Sharona","last_name":"Horta","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria","last_name":"Ibáñez"},{"first_name":"Tanja","full_name":"Kallio, Tanja","last_name":"Kallio"},{"first_name":"Paulina R.","last_name":"Martínez-Alanis","full_name":"Martínez-Alanis, Paulina R."},{"first_name":"Xiang","last_name":"Wang","full_name":"Wang, Xiang"},{"first_name":"Andreu","full_name":"Cabot, Andreu","last_name":"Cabot"}],"article_number":"123348","department":[{"_id":"MaIb"}],"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"_id":"21037","language":[{"iso":"eng"}],"publisher":"Elsevier","das_tickbox":"1","date_created":"2026-01-25T23:01:39Z","article_processing_charge":"Yes (in subscription journal)","scopus_import":"1","date_updated":"2026-07-27T11:03:48Z","acknowledgement":"The authors thank the support from the National Natural Science Foundation of China (NSFC) (Grants No. 22302151) and Natural Science Foundation of Hubei Province (Grants No. 2024AFB755, 2024AFB267), Key Project of Hubei Provincial Department of Education Scientific Research Plan (F2023007). This work is supported by funding from Shandong Provincial Key Laboratory of MonocrystallineSilicon Semiconductor Materials and Technology (2025KFKT021). This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by the Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF). “M.I. and S.H. acknowledge financial support from ISTA and the Werner Siemens Foundation.”","article_type":"original","ddc":["540"],"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"},"title":"Hydrogen induced palladium-based heterojunction electrocatalysts to enhance the oxygen reduction reaction performance","status":"public","OA_place":"publisher","quality_controlled":"1","month":"04","citation":{"short":"C. Shi, S. Horta, M. Ibáñez, T. Kallio, P.R. Martínez-Alanis, X. Wang, A. Cabot, Chemical Engineering Science 324 (2026).","ama":"Shi C, Horta S, Ibáñez M, et al. Hydrogen induced palladium-based heterojunction electrocatalysts to enhance the oxygen reduction reaction performance. <i>Chemical Engineering Science</i>. 2026;324. doi:<a href=\"https://doi.org/10.1016/j.ces.2026.123348\">10.1016/j.ces.2026.123348</a>","ista":"Shi C, Horta S, Ibáñez M, Kallio T, Martínez-Alanis PR, Wang X, Cabot A. 2026. Hydrogen induced palladium-based heterojunction electrocatalysts to enhance the oxygen reduction reaction performance. Chemical Engineering Science. 324, 123348.","apa":"Shi, C., Horta, S., Ibáñez, M., Kallio, T., Martínez-Alanis, P. R., Wang, X., &#38; Cabot, A. (2026). Hydrogen induced palladium-based heterojunction electrocatalysts to enhance the oxygen reduction reaction performance. <i>Chemical Engineering Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ces.2026.123348\">https://doi.org/10.1016/j.ces.2026.123348</a>","chicago":"Shi, Changwei, Sharona Horta, Maria Ibáñez, Tanja Kallio, Paulina R. Martínez-Alanis, Xiang Wang, and Andreu Cabot. “Hydrogen Induced Palladium-Based Heterojunction Electrocatalysts to Enhance the Oxygen Reduction Reaction Performance.” <i>Chemical Engineering Science</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.ces.2026.123348\">https://doi.org/10.1016/j.ces.2026.123348</a>.","ieee":"C. Shi <i>et al.</i>, “Hydrogen induced palladium-based heterojunction electrocatalysts to enhance the oxygen reduction reaction performance,” <i>Chemical Engineering Science</i>, vol. 324. Elsevier, 2026.","mla":"Shi, Changwei, et al. “Hydrogen Induced Palladium-Based Heterojunction Electrocatalysts to Enhance the Oxygen Reduction Reaction Performance.” <i>Chemical Engineering Science</i>, vol. 324, 123348, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.ces.2026.123348\">10.1016/j.ces.2026.123348</a>."},"publication_identifier":{"issn":["1873-4405"],"eissn":["0009-2509"]},"doi":"10.1016/j.ces.2026.123348","type":"journal_article","day":"01","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"abstract":[{"lang":"eng","text":"The oxygen reduction reaction (ORR) remains a critical bottleneck in fuel cells and metal-air batteries due to the lack of highly efficient electrocatalysts. Here, we report a simple strategy for synthesizing a palladium-based heterostructured electrocatalyst supported on a carbon nitride matrix (PdH-Pd@CN), which exhibits remarkable ORR activity with a half-wave potential of 0.91 V and excellent durability in 0.1 M KOH. Within the heterostructure, hydrogen intercalation expands the Pd lattice, while interstitial hydrogen doping facilitates charge transfer from Pd to H owing to their electronegativity difference. These synergistic effects modulate the electronic structure, thereby enhancing both activity and stability. When employed in Zn-air batteries, PdH-Pd@CN delivers a maximum power density of 176 mW cm− (Liu et al., 2025) and capacity of 805 mAh g− (Sun et al., 2021) Zn. These findings demonstrate the strong potential of PdH-Pd@CN as an efficient ORR electrocatalyst for next-generation metal-air batteries and related energy technologies."}],"oa_version":"Published Version","file":[{"success":1,"file_name":"2026_ChemicalEngineeringScience_Shi.pdf","date_updated":"2026-07-27T11:03:37Z","relation":"main_file","access_level":"open_access","creator":"dernst","checksum":"c47f1704be452cdefb2b930884693578","content_type":"application/pdf","file_id":"22418","date_created":"2026-07-27T11:03:37Z","file_size":8345535}],"dataavailabilitystatement":"Data will be made available on request.","date_published":"2026-04-01T00:00:00Z","researchdata_availability":"upon request"},{"corr_author":"1","intvolume":"        22","publication":"Nature Physics","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":22,"file_date_updated":"2026-07-27T10:57:57Z","year":"2026","publication_status":"published","PlanS_conform":"1","oa":1,"OA_type":"hybrid","has_accepted_license":"1","publisher":"Springer Nature","das_tickbox":"1","language":[{"iso":"eng"}],"_id":"21006","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","related_material":{"link":[{"url":"https://ista.ac.at/en/news/behind-natures-blueprints/","relation":"press_release","description":"News on ISTA website"}]},"date_created":"2026-01-20T10:02:19Z","author":[{"last_name":"Hübl","full_name":"Hübl, Maximilian","first_name":"Maximilian","id":"5eb8629e-15b2-11ec-abd3-e6f3e5e01f32"},{"last_name":"Videbæk","full_name":"Videbæk, Thomas E.","first_name":"Thomas E."},{"full_name":"Hayakawa, Daichi","last_name":"Hayakawa","first_name":"Daichi"},{"full_name":"Rogers, W. Benjamin","last_name":"Rogers","first_name":"W. Benjamin"},{"full_name":"Goodrich, Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","first_name":"Carl Peter","orcid":"0000-0002-1307-5074"}],"department":[{"_id":"CaGo"},{"_id":"GradSch"}],"project":[{"name":"Dynamically reconfigurable self-assembly with triangular DNA-origami bricks","_id":"8dd93da8-16d5-11f0-9cad-d2c70200d9a5","grant_number":"FTI23-G-011"}],"page":"294-301","title":"A polyhedral structure controls programmable self-assembly","OA_place":"publisher","quality_controlled":"1","status":"public","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_updated":"2026-07-27T10:59:15Z","ddc":["570","540"],"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"},"article_type":"original","oa_version":"Published Version","abstract":[{"lang":"eng","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."}],"day":"01","researchdata_availability":"yes","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.","date_published":"2026-02-01T00:00:00Z","file":[{"file_name":"2026_NaturePhysics_Huebl.pdf","success":1,"date_updated":"2026-07-27T10:57:57Z","access_level":"open_access","relation":"main_file","checksum":"f4e3123d5d9dfcd22324e2c2de02e9a2","creator":"dernst","content_type":"application/pdf","file_id":"22417","date_created":"2026-07-27T10:57:57Z","file_size":2802534}],"month":"02","citation":{"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>.","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>","short":"M. Hübl, T.E. Videbæk, D. Hayakawa, W.B. Rogers, C.P. Goodrich, Nature Physics 22 (2026) 294–301.","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.","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>","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>.","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."},"publication_identifier":{"issn":["1745-2473"],"eissn":["1745-2481"]},"type":"journal_article","doi":"10.1038/s41567-025-03120-3"}]