[{"PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Letters in Mathematical Physics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["510"],"language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"acknowledgement":"L.E. and J.H. are supported by the ERC Advanced Grant “RMTBeyond” No. 101020331. Moreover, J.H. acknowledges (partial) financial support by the ERC Consolidator Grant “ProbQuant” (jointly with the Swiss State Secretariat for Education, Research and Innovation). C.V. was (partially) supported by the German Academic Scholarship Foundation and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – TRR 352 – Project-ID 470903074. Moreover, C.V. acknowledges (partial) financial support by the ERC Starting Grant “FermiMath\" No. 101040991 and the ERC Consolidator Grant “RAMBAS” No. 10104424, funded by the European Union. Open access funding provided by Institute of Science and Technology (IST Austria).","OA_place":"publisher","ec_funded":1,"author":[{"last_name":"Erdös","first_name":"László","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Henheik","first_name":"Sven Joscha","full_name":"Henheik, Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb"},{"id":"1cd0554a-ea28-11f0-9f40-ff76440883cd","full_name":"Vogel, Cornelia","first_name":"Cornelia","last_name":"Vogel"}],"dataavailabilitystatement":"The Matlab code used to generate the datasets of the provided examples is available from the corresponding author on request.","article_processing_charge":"Yes (via OA deal)","date_published":"2026-02-01T00:00:00Z","day":"01","article_number":"5","file_date_updated":"2026-07-23T06:42:01Z","intvolume":" 116","supplementarymaterial":"yes","citation":{"ista":"Erdös L, Henheik SJ, Vogel C. 2026. Normal typicality and dynamical typicality for a random block-band matrix model. Letters in Mathematical Physics. 116, 5.","ieee":"L. Erdös, S. J. Henheik, and C. Vogel, “Normal typicality and dynamical typicality for a random block-band matrix model,” Letters in Mathematical Physics, vol. 116. Springer Nature, 2026.","chicago":"Erdös, László, Sven Joscha Henheik, and Cornelia Vogel. “Normal Typicality and Dynamical Typicality for a Random Block-Band Matrix Model.” Letters in Mathematical Physics. Springer Nature, 2026. https://doi.org/10.1007/s11005-025-02037-5.","ama":"Erdös L, Henheik SJ, Vogel C. Normal typicality and dynamical typicality for a random block-band matrix model. Letters in Mathematical Physics. 2026;116. doi:10.1007/s11005-025-02037-5","short":"L. Erdös, S.J. Henheik, C. Vogel, Letters in Mathematical Physics 116 (2026).","apa":"Erdös, L., Henheik, S. J., & Vogel, C. (2026). Normal typicality and dynamical typicality for a random block-band matrix model. Letters in Mathematical Physics. Springer Nature. https://doi.org/10.1007/s11005-025-02037-5","mla":"Erdös, László, et al. “Normal Typicality and Dynamical Typicality for a Random Block-Band Matrix Model.” Letters in Mathematical Physics, vol. 116, 5, Springer Nature, 2026, doi:10.1007/s11005-025-02037-5."},"researchdata_availability":"upon request","file":[{"date_created":"2026-07-23T06:42:01Z","file_id":"22390","creator":"dernst","file_name":"2026_LettersMathPhysics_Erdoes.pdf","access_level":"open_access","file_size":602526,"content_type":"application/pdf","date_updated":"2026-07-23T06:42:01Z","success":1,"relation":"main_file","checksum":"f2021f8f6d38491948b94a7765a64d0b"}],"publisher":"Springer Nature","has_accepted_license":"1","volume":116,"doi":"10.1007/s11005-025-02037-5","external_id":{"pmid":["41459414"]},"type":"journal_article","article_type":"original","month":"02","quality_controlled":"1","publication_identifier":{"issn":["0377-9017"],"eissn":["1573-0530"]},"mathsc":["60B20","82C10"],"date_updated":"2026-07-23T06:42:28Z","oa_version":"Published Version","scopus_import":"1","license":"https://creativecommons.org/licenses/by/4.0/","OA_type":"hybrid","publication_status":"published","year":"2026","project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020"}],"pmid":1,"das_tickbox":"1","corr_author":"1","oa":1,"date_created":"2026-01-04T23:01:33Z","abstract":[{"text":"We prove normal typicality and dynamical typicality for a (centered) random block-band matrix model with block-dependent variances. A key feature of our model is that we achieve intermediate equilibration times, an aspect that has not been proven rigorously in any model before. Our proof builds on recently established concentration estimates for products of resolvents of Wigner type random matrices (Erdős and Riabov in Commun Math Phys 405(12): 282, 2024) and an intricate analysis of the deterministic approximation.","lang":"eng"}],"status":"public","_id":"20925","title":"Normal typicality and dynamical typicality for a random block-band matrix model"},{"corr_author":"1","das_tickbox":"1","title":"Protocol for integrative analysis of transcription factor-nucleosome interactions using SeEN-seq and cryo-EM structure determination","_id":"20924","status":"public","abstract":[{"text":"Pioneer transcription factors (TFs) possess the ability to read out DNA motifs embedded within nucleosomes, driving changes in gene expression during cellular differentiation and reprogramming. Here, we present selected engagement on nucleosome sequencing (SeEN-seq), a protocol designed to systematically identify potential TF-binding sites on the nucleosome. We describe steps for nucleosome library assembly, SeEN-seq assay, and cryoelectron microscopy (cryo-EM) sample preparation. This protocol facilitates the preparation of homogeneous pioneer TF-nucleosome complexes for cryo-EM structure determination using single-particle analysis.\r\nFor complete details on the use and execution of this protocol, please refer to Michael et al.1","lang":"eng"}],"date_created":"2026-01-04T23:01:33Z","oa":1,"oa_version":"Published Version","scopus_import":"1","date_updated":"2026-07-23T06:34:37Z","project":[{"_id":"9136c684-16d5-11f0-9cad-91c0177b365f","name":"Circadian structural transitions of chromatin","grant_number":"101162145"}],"pmid":1,"year":"2026","publication_status":"published","OA_type":"gold","DOAJ_listed":"1","type":"journal_article","external_id":{"pmid":["41455105"]},"doi":"10.1016/j.xpro.2025.104295","volume":7,"has_accepted_license":"1","publication_identifier":{"eissn":["2666-1667"]},"quality_controlled":"1","month":"03","article_type":"original","author":[{"full_name":"Kobayashi, Wataru","first_name":"Wataru","last_name":"Kobayashi"},{"orcid":"0000-0002-6080-839X","id":"6437c950-2a03-11ee-914d-d6476dd7b75c","first_name":"Alicia","last_name":"Michael","full_name":"Michael, Alicia"},{"first_name":"Siwat","last_name":"Ruangroengkulrith","full_name":"Ruangroengkulrith, Siwat"},{"full_name":"Kümmecke, Maximilian","last_name":"Kümmecke","first_name":"Maximilian"},{"full_name":"Tachibana, Kikuë","first_name":"Kikuë","last_name":"Tachibana"}],"OA_place":"publisher","acknowledgement":"We thank R.H. Kim, A. Casper, and R. Gautsch for sequencing at the NGS facility (RRID:SCR_025746). K.T. is an Honorary Professor at the Department of Biology, Ludwig-Maximilians-University, Munich, Germany. This study was funded by European Research Council grant ERC-CoG-818556 TotipotentZygotChrom (K.T.), Max Planck Society (K.T.), and ERC Starting Grant “ChromaChrono” 101162145 (A.K.M.).","department":[{"_id":"AlMi"}],"ddc":["570"],"publication":"STAR Protocols","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"PlanS_conform":"1","file":[{"date_created":"2026-07-23T06:33:24Z","file_id":"22389","creator":"dernst","file_name":"2026_StarProtocols_Kobayashi.pdf","content_type":"application/pdf","success":1,"date_updated":"2026-07-23T06:33:24Z","file_size":5531906,"access_level":"open_access","checksum":"cf04b061a48548a649e6a2435bf120db","relation":"main_file"}],"researchdata_availability":"yes","publisher":"Elsevier","citation":{"mla":"Kobayashi, Wataru, et al. “Protocol for Integrative Analysis of Transcription Factor-Nucleosome Interactions Using SeEN-Seq and Cryo-EM Structure Determination.” STAR Protocols, vol. 7, no. 1, 104295, Elsevier, 2026, doi:10.1016/j.xpro.2025.104295.","apa":"Kobayashi, W., Michael, A. K., Ruangroengkulrith, S., Kümmecke, M., & Tachibana, K. (2026). Protocol for integrative analysis of transcription factor-nucleosome interactions using SeEN-seq and cryo-EM structure determination. STAR Protocols. Elsevier. https://doi.org/10.1016/j.xpro.2025.104295","short":"W. Kobayashi, A.K. Michael, S. Ruangroengkulrith, M. Kümmecke, K. Tachibana, STAR Protocols 7 (2026).","ama":"Kobayashi W, Michael AK, Ruangroengkulrith S, Kümmecke M, Tachibana K. Protocol for integrative analysis of transcription factor-nucleosome interactions using SeEN-seq and cryo-EM structure determination. STAR Protocols. 2026;7(1). doi:10.1016/j.xpro.2025.104295","ista":"Kobayashi W, Michael AK, Ruangroengkulrith S, Kümmecke M, Tachibana K. 2026. Protocol for integrative analysis of transcription factor-nucleosome interactions using SeEN-seq and cryo-EM structure determination. STAR Protocols. 7(1), 104295.","chicago":"Kobayashi, Wataru, Alicia K. Michael, Siwat Ruangroengkulrith, Maximilian Kümmecke, and Kikuë Tachibana. “Protocol for Integrative Analysis of Transcription Factor-Nucleosome Interactions Using SeEN-Seq and Cryo-EM Structure Determination.” STAR Protocols. Elsevier, 2026. https://doi.org/10.1016/j.xpro.2025.104295.","ieee":"W. Kobayashi, A. K. Michael, S. Ruangroengkulrith, M. Kümmecke, and K. Tachibana, “Protocol for integrative analysis of transcription factor-nucleosome interactions using SeEN-seq and cryo-EM structure determination,” STAR Protocols, vol. 7, no. 1. Elsevier, 2026."},"issue":"1","supplementarymaterial":"yes","intvolume":" 7","file_date_updated":"2026-07-23T06:33:24Z","article_number":"104295","date_published":"2026-03-20T00:00:00Z","day":"20","article_processing_charge":"Yes","dataavailabilitystatement":"Raw SeEN-seq data of ESRRB nucleosome binding have been deposited on the Sequence Read Achieve database under the accession PRJNA1305216. Example analysis scripts and input files for SeEN-seq analysis can be found at https://doi.org/10.5281/zenodo.17665082."},{"OA_type":"hybrid","page":"1047-1083","publication_status":"published","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"year":"2026","date_updated":"2026-07-23T05:51:07Z","mathsc":["14B05","14D23","14G20","16G20"],"oa_version":"Published Version","scopus_import":"1","oa":1,"date_created":"2024-08-18T22:01:04Z","abstract":[{"text":"We prove that the zero-fiber of the moment map of a totally negative quiver has rational singularities. Our proof consists in generalizing dimension bounds on jet spaces of this fiber, which were introduced by Budur. We also transfer the rational singularities property to other moduli spaces of objects in 2-Calabi-Yau categories, based on recent work of Davison. This has interesting arithmetic applications on quiver moment maps and moduli spaces of objects in 2-Calabi-Yau categories. First, we generalize results of Wyss on the asymptotic behaviour of counts of jets of quiver moment maps over finite fields. Moreover, we interpret the limit of counts of jets on a given moduli space as its p-adic volume under a canonical measure analogous to the measure built by Carocci, Orecchia and Wyss on certain moduli spaces of coherent sheaves.","lang":"eng"}],"title":"Rational singularities for moment maps of totally negative quivers","_id":"17437","status":"public","isi":1,"corr_author":"1","das_tickbox":"1","file_date_updated":"2026-07-23T05:50:09Z","article_processing_charge":"Yes (via OA deal)","dataavailabilitystatement":"Not applicable.","day":"01","date_published":"2026-03-01T00:00:00Z","citation":{"apa":"Vernet, T. (2026). Rational singularities for moment maps of totally negative quivers. Transformation Groups. Springer Nature. https://doi.org/10.1007/s00031-024-09873-0","mla":"Vernet, Tanguy. “Rational Singularities for Moment Maps of Totally Negative Quivers.” Transformation Groups, vol. 31, Springer Nature, 2026, pp. 1047–83, doi:10.1007/s00031-024-09873-0.","short":"T. Vernet, Transformation Groups 31 (2026) 1047–1083.","ista":"Vernet T. 2026. Rational singularities for moment maps of totally negative quivers. Transformation Groups. 31, 1047–1083.","ieee":"T. Vernet, “Rational singularities for moment maps of totally negative quivers,” Transformation Groups, vol. 31. Springer Nature, pp. 1047–1083, 2026.","chicago":"Vernet, Tanguy. “Rational Singularities for Moment Maps of Totally Negative Quivers.” Transformation Groups. Springer Nature, 2026. https://doi.org/10.1007/s00031-024-09873-0.","ama":"Vernet T. Rational singularities for moment maps of totally negative quivers. Transformation Groups. 2026;31:1047-1083. doi:10.1007/s00031-024-09873-0"},"file":[{"date_created":"2026-07-23T05:50:09Z","file_id":"22385","file_name":"2026_TransformationGroups_Vernet.pdf","creator":"dernst","content_type":"application/pdf","date_updated":"2026-07-23T05:50:09Z","success":1,"access_level":"open_access","file_size":912029,"relation":"main_file","checksum":"8985b4154b730284d3412ddc9e55d965"}],"researchdata_availability":"not applicable","publisher":"Springer Nature","intvolume":" 31","supplementarymaterial":"no","ddc":["510"],"publication":"Transformation Groups","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","author":[{"full_name":"Vernet, Tanguy","first_name":"Tanguy","last_name":"Vernet","id":"19f1e3bf-c59a-11ee-a1af-ed269948817b"}],"ec_funded":1,"department":[{"_id":"TaHa"}],"acknowledgement":"I would like to warmly thank Dimitri Wyss for his guidance and supervision and Nero Budur for helpful discussions and answering all my questions on his previous works. I would also like to thank Francesca Carocci, Ben Davison, Lucien Hennecart and Olivier Schiffmann for helpful remarks and discussions during the writing of this paper. Finally, I would like to thank the anonymous referees for their careful reading and suggesting improvements in the exposition.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). This work was supported by the Swiss National Science Foundation [No. 196960]. This project has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","month":"03","quality_controlled":"1","article_type":"original","publication_identifier":{"eissn":["1531-586X"],"issn":["1083-4362"]},"has_accepted_license":"1","volume":31,"doi":"10.1007/s00031-024-09873-0","external_id":{"isi":["001287455300001"]},"type":"journal_article"},{"intvolume":" 22","supplementarymaterial":"yes","issue":"25","citation":{"mla":"Meng, Weite, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” Small, vol. 22, no. 25, e13035, Wiley, 2026, doi:10.1002/smll.202513035.","apa":"Meng, W., Li, M., Wang, Q., Song, P., Yang, X., Wang, W. J., … Lim, K. H. (2026). Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. Small. Wiley. https://doi.org/10.1002/smll.202513035","ama":"Meng W, Li M, Wang Q, et al. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. Small. 2026;22(25). doi:10.1002/smll.202513035","chicago":"Meng, Weite, Mingquan Li, Qingyue Wang, Pingan Song, Xuan Yang, Wen Jun Wang, Min Hong, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” Small. Wiley, 2026. https://doi.org/10.1002/smll.202513035.","ieee":"W. Meng et al., “Efficient near room temperature thermoelectric cooling and power generation with CuAgSe,” Small, vol. 22, no. 25. Wiley, 2026.","ista":"Meng W, Li M, Wang Q, Song P, Yang X, Wang WJ, Hong M, Ibáñez M, Cabot A, Zhang Y, Liu Y, Lim KH. 2026. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. Small. 22(25), e13035.","short":"W. Meng, M. Li, Q. Wang, P. Song, X. Yang, W.J. Wang, M. Hong, M. Ibáñez, A. Cabot, Y. Zhang, Y. Liu, K.H. Lim, Small 22 (2026)."},"researchdata_availability":"upon request","publisher":"Wiley","article_processing_charge":"No","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","day":"04","date_published":"2026-05-04T00:00:00Z","article_number":"e13035","department":[{"_id":"MaIb"}],"acknowledgement":"K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant Number 22208293) and the National Foreign Expert Project (Y20240175). Y.L. acknowledges funding from the NSFC (Grant Number 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grant Number 2022LCX002), and the Fundamental Research Funds for the Central Universities (JZ2024HGTB0239). Y.Z. acknowledges funding from the NSFC (Grant Number 52502313) and Wenzhou Basic Scientific Research Project (Grant Number G20240034). Q. W. acknowledges financial support from the NSFC (Grant Number 22208292), the High-Level Overseas-Educated Talents Return Program, and the “Pioneer” and “Leading Goose” R&D Program of Zhejiang [2025C04021]. K.H.L., Q. W., and X. Y. also acknowledge the Research Funds of the Institute of Zhejiang University-Quzhou (Grants No. IZQ2022RCZX101, IZQ2021RCZX003, IZQ2021RCZX002, and IZQ2024KJ0004). M.H. acknowledges the funding from the Australian Research Council and the iLAuNCH Trailblazer, Department of Education, Australia. M.H. acknowledges the computational support from the National Computational Infrastructure (NCI), Australia, and Pawsey Supercomputing Centre, Australia.","author":[{"full_name":"Meng, Weite","first_name":"Weite","last_name":"Meng"},{"full_name":"Li, Mingquan","last_name":"Li","first_name":"Mingquan"},{"first_name":"Qingyue","last_name":"Wang","full_name":"Wang, Qingyue"},{"last_name":"Song","first_name":"Pingan","full_name":"Song, Pingan"},{"full_name":"Yang, Xuan","first_name":"Xuan","last_name":"Yang"},{"last_name":"Wang","first_name":"Wen Jun","full_name":"Wang, Wen Jun"},{"first_name":"Min","last_name":"Hong","full_name":"Hong, Min"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","first_name":"Maria","last_name":"Ibáñez"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"},{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Small","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1613-6829"],"issn":["1613-6810"]},"article_type":"original","month":"05","quality_controlled":"1","external_id":{"pmid":["41470065"]},"type":"journal_article","volume":22,"doi":"10.1002/smll.202513035","year":"2026","pmid":1,"OA_type":"closed access","publication_status":"published","oa_version":"None","scopus_import":"1","date_updated":"2026-07-23T09:42:39Z","status":"public","_id":"20973","title":"Efficient near room temperature thermoelectric cooling and power generation with CuAgSe","date_created":"2026-01-11T23:01:34Z","abstract":[{"text":"CuAgSe-based materials are attractive for low-temperature thermoelectric (TE) applications but are limited by bipolar conduction and relatively high thermal conductivity. Herein, we report a ligand-free aqueous synthesis of Te-doped CuAgSe (CuAgSe1-xTex), where structural and electronic modulation improve carrier transport and suppress phonon propagation. Ex-situ time-resolved X-ray diffraction reveals a spontaneous growth mechanism, while density functional theory calculations show that Te-5s and 5p orbitals hybridization generates localized states and an asymmetric density of states, thereby enhancing the Seebeck coefficient. Electron microscopy and strain analyses confirm that Te-doping introduces a high density of lattice dislocations and grain boundaries, leading to a reduced lattice thermal conductivity of 0.11 W m−1K−1 at 443 K. These synergistic effects translate into device-level performance—the first integrated CuAgSe thermoelectric modules, exhibit a maximum cooling temperature difference of 27.3 K, and power density of 0.34 W cm−2 with a conversion efficiency of 3.6% at a modest temperature gradient of 136 K. These results demonstrate that CuAgSe1-xTex enables efficient energy harvesting and localized cooling under small temperature gradient, underscoring the importance of structural and electronic design beyond conventional zT benchmarks.","lang":"eng"}],"das_tickbox":"1"},{"oa":1,"date_created":"2026-01-20T10:14:23Z","abstract":[{"lang":"eng","text":"With the growing interest in blockchains, permissioned approaches to consensus have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. In fact, many state-of-the-art BFT consensus algorithms require a single leader process to receive and validate votes from a quorum of processes and then broadcast the result, which is inherently non-scalable. Recent approaches avoid this bottleneck by using dissemination/aggregation trees to propagate values and collect and validate votes. However, the use of trees increases the round latency, which limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that sustains high throughput as the system size grows by leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Furthermore, when the number of faults is moderate (arguably the most common case in practice), our construction is able to recover from faults in an optimal number of reconfiguration steps. We implemented and experimentally evaluated Kauri with up to 800 processes. Our results show that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, by up to 58x without compromising latency. Interestingly, in some cases, the parallelization provided by Kauri can also decrease the latency."}],"title":"Kauri: BFT consensus with pipelined tree-based dissemination and aggregation","_id":"21017","status":"public","corr_author":"1","das_tickbox":"0","OA_type":"hybrid","publication_status":"published","project":[{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"},{"name":"SeCure, privAte, and interoperabLe layEr 2","grant_number":"ICT22-045","_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277"}],"year":"2026","date_updated":"2026-07-23T10:07:17Z","oa_version":"Published Version","scopus_import":"1","month":"05","quality_controlled":"1","article_type":"original","publication_identifier":{"eissn":["1557-7333"],"issn":["0734-2071"]},"volume":44,"has_accepted_license":"1","doi":"10.1145/3769423","type":"journal_article","file_date_updated":"2026-07-23T10:04:06Z","article_number":"12","article_processing_charge":"Yes (via OA deal)","date_published":"2026-05-01T00:00:00Z","day":"01","citation":{"ama":"Neiheiser R, Matos M, Rodrigues L. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems. 2026;44(2). doi:10.1145/3769423","ieee":"R. Neiheiser, M. Matos, and L. Rodrigues, “Kauri: BFT consensus with pipelined tree-based dissemination and aggregation,” ACM Transactions on Computer Systems, vol. 44, no. 2. Association for Computing Machinery, 2026.","chicago":"Neiheiser, Ray, Miguel Matos, and Luis Rodrigues. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” ACM Transactions on Computer Systems. Association for Computing Machinery, 2026. https://doi.org/10.1145/3769423.","ista":"Neiheiser R, Matos M, Rodrigues L. 2026. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems. 44(2), 12.","short":"R. Neiheiser, M. Matos, L. Rodrigues, ACM Transactions on Computer Systems 44 (2026).","mla":"Neiheiser, Ray, et al. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” ACM Transactions on Computer Systems, vol. 44, no. 2, 12, Association for Computing Machinery, 2026, doi:10.1145/3769423.","apa":"Neiheiser, R., Matos, M., & Rodrigues, L. (2026). Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems. Association for Computing Machinery. https://doi.org/10.1145/3769423"},"researchdata_availability":"no","file":[{"date_created":"2026-07-23T10:04:06Z","file_name":"2026_TransCompSyst_Neiheiser.pdf","creator":"dernst","file_id":"22392","success":1,"date_updated":"2026-07-23T10:04:06Z","content_type":"application/pdf","access_level":"open_access","file_size":676867,"checksum":"b64822f3d2bcac3c68c887ced45a6008","relation":"main_file"}],"publisher":"Association for Computing Machinery","intvolume":" 44","issue":"2","supplementarymaterial":"no","ddc":["000"],"publication":"ACM Transactions on Computer Systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"PlanS_conform":"1","keyword":["Distributed systems","byzantine fault tolerance","blockchain","vote aggregation","pipelining"],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","author":[{"orcid":"0000-0001-7227-8309","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4","first_name":"Ray","last_name":"Neiheiser","full_name":"Neiheiser, Ray"},{"first_name":"Miguel","last_name":"Matos","full_name":"Matos, Miguel"},{"last_name":"Rodrigues","first_name":"Luis","full_name":"Rodrigues, Luis"}],"department":[{"_id":"KrPi"}],"acknowledgement":"We thank the ACM TOCS Editors and the reviewers for their help in improving the manuscript. This work was partially supported by CAPES - Brazil (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior) and byFundação para a Ciência e Tecnologia (FCT) under project UIDB/50021/2020 and grant 2020.05270.BD, and via project COSMOS (via the OE with ref. PTDC/EEI-COM/29271/2017, via the łPrograma Operacional Regional de Lisboa na sua componente FEDER” with ref. Lisboa-01-0145-FEDER-029271) and project Angainor with reference LISBOA-01-0145-FEDER-031456, grant agreement number 952226, and project GLOG, with reference LISBOA2030-FEDER-00771200, and project BIG (Enhancing the research and innovation potential of Tecnico through blockchain technologies and design Innovation for social Good), and project ScalableCosmosConsensus, and the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045"},{"_id":"14278","status":"public","title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","abstract":[{"lang":"eng","text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral uniqueness of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish local uniqueness for almost all of them."}],"oa":1,"date_created":"2023-09-06T08:35:43Z","das_tickbox":"0","corr_author":"1","year":"2026","project":[{"grant_number":"885707","name":"Spectral rigidity and integrability for billiards and geodesic flows","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A"}],"page":"221-298","publication_status":"published","OA_type":"hybrid","oa_version":"Published Version","scopus_import":"1","mathsc":["37C83","35J05","37J70","74J25"],"date_updated":"2026-07-23T10:58:59Z","publication_identifier":{"eissn":["1432-1297"],"issn":["0020-9910"]},"article_type":"original","quality_controlled":"1","month":"04","type":"journal_article","external_id":{"arxiv":["2111.12171"]},"doi":"10.1007/s00222-025-01397-y","volume":244,"has_accepted_license":"1","supplementarymaterial":"yes","intvolume":" 244","researchdata_availability":"no","file":[{"checksum":"487fa9113e1bbf32a6c70e6d1e8f63bc","relation":"main_file","file_size":2256345,"access_level":"open_access","date_updated":"2026-07-23T10:55:24Z","content_type":"application/pdf","success":1,"creator":"dernst","file_name":"2026_InventionesMath_Koval.pdf","file_id":"22394","date_created":"2026-07-23T10:55:24Z"}],"publisher":"Springer Nature","citation":{"short":"I. Koval, Inventiones Mathematicae 244 (2026) 221–298.","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 2026;244:221-298. doi:10.1007/s00222-025-01397-y","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae. Springer Nature, 2026. https://doi.org/10.1007/s00222-025-01397-y.","ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” Inventiones Mathematicae, vol. 244. Springer Nature, pp. 221–298, 2026.","ista":"Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 244, 221–298.","mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” Inventiones Mathematicae, vol. 244, Springer Nature, 2026, pp. 221–98, doi:10.1007/s00222-025-01397-y.","apa":"Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-025-01397-y"},"day":"01","date_published":"2026-04-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2026-07-23T10:55:24Z","acknowledgement":"The author acknowledges the partial support of the European Research Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the project and greatly aiding the implementation. The author is also grateful to Hamid Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges partial support of ISTern summer program. The project started in the summer of 2021, when the author was an intern at ISTA. Open access funding provided by Institute of Science and Technology (IST Austria).","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"ec_funded":1,"author":[{"full_name":"Koval, Illya","last_name":"Koval","first_name":"Illya","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e"}],"OA_place":"publisher","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"PlanS_conform":"1","language":[{"iso":"eng"}],"publication":"Inventiones Mathematicae","ddc":["510"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1},{"_id":"21264","status":"public","title":"An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice","abstract":[{"lang":"eng","text":"Rodents' ability to encode the whisking phase has been extensively documented through neuronal recordings from ascending sensory pathways. Yet, while indicating that reafference originates from the mechanoreceptors, the mechanistic underpinnings of the whisking phase encoding within the follicle remain unclear. Here we present anatomical, histological, and biomechanical evidence for the presence of a distinctive elastic segment (ES) within the basal part of the whisker shaft inside the follicle. This ES, composed of immature keratin, is capable of both bending and twisting. Forces generated by whisker movement deform this segment, causing whisker shaft deflections that can stimulate specific mechanoreceptor subsets within the follicle at different phases of the whisking cycle. This mechanism appears to operate during both free‐air whisking and object contact. We propose that the ES enables torsion‐based mechanoreceptor activation, allowing encoding of the whisking phase."}],"oa":1,"date_created":"2026-02-17T07:44:23Z","das_tickbox":"0","year":"2026","pmid":1,"page":"1910-1924","publication_status":"published","OA_type":"hybrid","oa_version":"Published Version","scopus_import":"1","date_updated":"2026-07-23T10:20:17Z","publication_identifier":{"eissn":["1932-8494"],"issn":["1932-8486"]},"article_type":"original","quality_controlled":"1","month":"07","type":"journal_article","external_id":{"pmid":["40923214"]},"doi":"10.1002/ar.70051","has_accepted_license":"1","volume":309,"supplementarymaterial":"no","issue":"7","intvolume":" 309","publisher":"Wiley","file":[{"file_size":11315428,"access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-07-23T10:19:09Z","relation":"main_file","checksum":"78847eea7d9d8adc905d03e6f2571287","date_created":"2026-07-23T10:19:09Z","file_id":"22393","creator":"dernst","file_name":"2026_AnatomicalRecord_Haidarliu.pdf"}],"researchdata_availability":"no","citation":{"ieee":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, and I. Saraf‐Sinik, “An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice,” The Anatomical Record, vol. 309, no. 7. Wiley, pp. 1910–1924, 2026.","chicago":"Haidarliu, Sebastian, Guy Nelinger, Luka Gantar, Ehud Ahissar, and Inbar Saraf‐Sinik. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” The Anatomical Record. Wiley, 2026. https://doi.org/10.1002/ar.70051.","ista":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. 2026. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. The Anatomical Record. 309(7), 1910–1924.","ama":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. The Anatomical Record. 2026;309(7):1910-1924. doi:10.1002/ar.70051","short":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, I. Saraf‐Sinik, The Anatomical Record 309 (2026) 1910–1924.","apa":"Haidarliu, S., Nelinger, G., Gantar, L., Ahissar, E., & Saraf‐Sinik, I. (2026). An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. The Anatomical Record. Wiley. https://doi.org/10.1002/ar.70051","mla":"Haidarliu, Sebastian, et al. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” The Anatomical Record, vol. 309, no. 7, Wiley, 2026, pp. 1910–24, doi:10.1002/ar.70051."},"date_published":"2026-07-01T00:00:00Z","day":"01","article_processing_charge":"No","file_date_updated":"2026-07-23T10:19:09Z","acknowledgement":"The authors wish to express their gratitude to Prof. Menahem Segal and Dr. Yonatan Katz for their helpful comments and discussions. The United States-Israel Binational Science Foundation (BSF, grant no. 2021327); The European Research Council (ERC) under the EU Horizon 2020 Research and Innovation Programme (grant no. 786949); the Israel Science Foundation (ISF, grant no. 2237/20); The Weizmann-UK Collaboration and a research grant from the Estate of Thomas Gruen.","department":[{"_id":"MaJö"}],"author":[{"first_name":"Sebastian","last_name":"Haidarliu","full_name":"Haidarliu, Sebastian"},{"last_name":"Nelinger","first_name":"Guy","full_name":"Nelinger, Guy"},{"id":"ed7c4564-13aa-11f0-9846-960f9afb2ddb","full_name":"Gantar, Luka","last_name":"Gantar","first_name":"Luka"},{"last_name":"Ahissar","first_name":"Ehud","full_name":"Ahissar, Ehud"},{"last_name":"Saraf‐Sinik","first_name":"Inbar","full_name":"Saraf‐Sinik, Inbar"}],"OA_place":"publisher","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"publication":"The Anatomical Record","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"intvolume":" 279","supplementarymaterial":"no","citation":{"short":"S. Barańczuk, B. Naskręcki, M. Verzobio, Journal of Number Theory 279 (2026) 170–183.","ieee":"S. Barańczuk, B. Naskręcki, and M. Verzobio, “Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve,” Journal of Number Theory, vol. 279. Elsevier, pp. 170–183, 2026.","ista":"Barańczuk S, Naskręcki B, Verzobio M. 2026. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. 279, 170–183.","chicago":"Barańczuk, Stefan, Bartosz Naskręcki, and Matteo Verzobio. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” Journal of Number Theory. Elsevier, 2026. https://doi.org/10.1016/j.jnt.2025.06.001.","ama":"Barańczuk S, Naskręcki B, Verzobio M. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. 2026;279:170-183. doi:10.1016/j.jnt.2025.06.001","apa":"Barańczuk, S., Naskręcki, B., & Verzobio, M. (2026). Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. Elsevier. https://doi.org/10.1016/j.jnt.2025.06.001","mla":"Barańczuk, Stefan, et al. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” Journal of Number Theory, vol. 279, Elsevier, 2026, pp. 170–83, doi:10.1016/j.jnt.2025.06.001."},"publisher":"Elsevier","researchdata_availability":"no","file":[{"checksum":"34e6e965a2b30a258e0d4103350a68fd","relation":"main_file","date_updated":"2026-07-23T11:32:51Z","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":754810,"creator":"dernst","file_name":"2026_JourNumberTheory_Baranczuk.pdf","file_id":"22396","date_created":"2026-07-23T11:32:51Z"}],"dataavailabilitystatement":"No data was used for the research described in the article.","article_processing_charge":"Yes (via OA deal)","day":"01","date_published":"2026-02-01T00:00:00Z","file_date_updated":"2026-07-23T11:32:51Z","department":[{"_id":"TiBr"}],"OA_place":"publisher","author":[{"first_name":"Stefan","last_name":"Barańczuk","full_name":"Barańczuk, Stefan"},{"last_name":"Naskręcki","first_name":"Bartosz","full_name":"Naskręcki, Bartosz"},{"full_name":"Verzobio, Matteo","last_name":"Verzobio","first_name":"Matteo","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306"}],"PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Divisibility sequences","Abelian varieties","Elliptic divisibility sequences","Isogenies","Primitive divisors"],"arxiv":1,"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Number Theory","ddc":["500"],"publication_identifier":{"issn":["0022-314X"]},"article_type":"original","month":"02","quality_controlled":"1","external_id":{"arxiv":["2309.09699"],"isi":["001541172400002"]},"type":"journal_article","volume":279,"has_accepted_license":"1","doi":"10.1016/j.jnt.2025.06.001","year":"2026","OA_type":"hybrid","publication_status":"published","page":"170-183","oa_version":"Published Version","scopus_import":"1","date_updated":"2026-07-23T11:33:57Z","_id":"20078","status":"public","title":"Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve","date_created":"2025-07-27T22:01:25Z","oa":1,"abstract":[{"lang":"eng","text":"Let A be an abelian variety defined over a number field K, E/K be an elliptic curve, and ϕ : A → Em be an isogeny defined over K. Let P ∈ A(K) be such that ϕ(P)=(Q1,..., Qm) with RankZ(⟨Q1,...,Qm⟩)=1. We will study a divisibility sequence related to the point P and show its relation with elliptic divisibility sequences."}],"das_tickbox":"1","isi":1,"corr_author":"1"},{"external_id":{"isi":["001544757200001"]},"type":"journal_article","volume":36,"has_accepted_license":"1","doi":"10.1002/adfm.202513859","publication_identifier":{"eissn":["1616-3028"],"issn":["1616-301X"]},"month":"01","quality_controlled":"1","article_type":"original","acknowledged_ssus":[{"_id":"EM-Fac"}],"OA_place":"publisher","author":[{"last_name":"He","first_name":"Ren","full_name":"He, Ren"},{"full_name":"Lee, Seungho","last_name":"Lee","first_name":"Seungho","id":"BB243B88-D767-11E9-B658-BC13E6697425","orcid":"0000-0002-6962-8598"},{"last_name":"Ding","first_name":"Yang","full_name":"Ding, Yang"},{"first_name":"Chen","last_name":"Huang","full_name":"Huang, Chen"},{"first_name":"Xuan","last_name":"Lu","full_name":"Lu, Xuan"},{"last_name":"Zheng","first_name":"Lirong","full_name":"Zheng, Lirong"},{"full_name":"Yu, Ao","last_name":"Yu","first_name":"Ao"},{"full_name":"Zhang, Chaoyue","first_name":"Chaoyue","last_name":"Zhang"},{"last_name":"Li","first_name":"Canhuang","full_name":"Li, Canhuang"},{"last_name":"Bi","first_name":"Xiaoyu","full_name":"Bi, Xiaoyu"},{"full_name":"Li, Yaqiang","first_name":"Yaqiang","last_name":"Li"},{"full_name":"Liao, Yaqi","last_name":"Liao","first_name":"Yaqi"},{"full_name":"Li, Junshan","last_name":"Li","first_name":"Junshan"},{"full_name":"Ostovari Moghaddam, Ahmad","first_name":"Ahmad","last_name":"Ostovari Moghaddam"},{"full_name":"Yernar, Salimov","first_name":"Salimov","last_name":"Yernar"},{"last_name":"Xu","first_name":"Ying","full_name":"Xu, Ying"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","first_name":"Maria"},{"last_name":"Zhang","first_name":"Chaoqi","full_name":"Zhang, Chaoqi"},{"full_name":"Yang, Linlin","last_name":"Yang","first_name":"Linlin"},{"last_name":"Zhou","first_name":"Yingtang","full_name":"Zhou, Yingtang"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"department":[{"_id":"MaIb"}],"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication":"Advanced Functional Materials","ddc":["540"],"keyword":["amorphous","high entropy alloy","in situ electrochemical impedance spec-troscopy","in situ Raman","Li–S batteries"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"citation":{"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. Advanced Functional Materials. Wiley. https://doi.org/10.1002/adfm.202513859","mla":"He, Ren, et al. “Amorphous High Entropy Alloy Nanosheets Enabling Robust Li–S Batteries.” Advanced Functional Materials, vol. 36, no. 5, e13859, Wiley, 2026, doi:10.1002/adfm.202513859.","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).","ieee":"R. He et al., “Amorphous high entropy alloy nanosheets enabling robust Li–S batteries,” Advanced Functional Materials, vol. 36, no. 5. Wiley, 2026.","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.","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.” Advanced Functional Materials. Wiley, 2026. https://doi.org/10.1002/adfm.202513859.","ama":"He R, Lee S, Ding Y, et al. Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. Advanced Functional Materials. 2026;36(5). doi:10.1002/adfm.202513859"},"researchdata_availability":"upon request","file":[{"file_id":"22397","creator":"dernst","file_name":"2026_AdvancedFunctionalMat_He.pdf","date_created":"2026-07-23T11:40:34Z","checksum":"b102207b2343e6e7dba00870bfe362ea","relation":"main_file","file_size":5734587,"access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-07-23T11:40:34Z"}],"publisher":"Wiley","intvolume":" 36","supplementarymaterial":"no","issue":"5","file_date_updated":"2026-07-23T11:40:34Z","article_number":"e13859","article_processing_charge":"Yes (in subscription journal)","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","day":"15","isi":1,"das_tickbox":"1","title":"Amorphous high entropy alloy nanosheets enabling robust Li–S batteries","status":"public","_id":"20191","date_created":"2025-08-17T22:01:37Z","oa":1,"abstract":[{"lang":"eng","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."}],"oa_version":"Published Version","scopus_import":"1","date_updated":"2026-07-23T11:42:17Z","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"year":"2026","OA_type":"hybrid","publication_status":"published","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/"},{"publication_identifier":{"eissn":["1477-870X"],"issn":["0035-9009"]},"article_type":"original","month":"01","quality_controlled":"1","external_id":{"isi":["001595821400001"]},"type":"journal_article","has_accepted_license":"1","volume":152,"doi":"10.1002/qj.70044","intvolume":" 152","supplementarymaterial":"yes","issue":"775","citation":{"mla":"Agasthya, Lokahith N., and Caroline J. Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” Quarterly Journal of the Royal Meteorological Society, vol. 152, no. 775, e70044, Wiley, 2026, doi:10.1002/qj.70044.","apa":"Agasthya, L. N., & Muller, C. J. (2026). Moist convection and radiative cooling: Dynamical response and scaling. Quarterly Journal of the Royal Meteorological Society. Wiley. https://doi.org/10.1002/qj.70044","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. Quarterly Journal of the Royal Meteorological Society. 2026;152(775). doi:10.1002/qj.70044","chicago":"Agasthya, Lokahith N, and Caroline J Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” Quarterly Journal of the Royal Meteorological Society. Wiley, 2026. https://doi.org/10.1002/qj.70044.","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.","ieee":"L. N. Agasthya and C. J. Muller, “Moist convection and radiative cooling: Dynamical response and scaling,” Quarterly Journal of the Royal Meteorological Society, vol. 152, no. 775. Wiley, 2026."},"researchdata_availability":"no","file":[{"date_created":"2026-07-23T12:10:28Z","file_name":"2026_QuartJourRoyalMeteorobiolSoc_Agasthya.pdf","creator":"dernst","file_id":"22398","file_size":2665988,"access_level":"open_access","content_type":"application/pdf","date_updated":"2026-07-23T12:10:28Z","success":1,"relation":"main_file","checksum":"8dd4d4d3ad027a4d26cbe5b1d66371e9"}],"publisher":"Wiley","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author, L. Agasthya, upon reasonable request.","article_processing_charge":"Yes (via OA deal)","date_published":"2026-01-01T00:00:00Z","day":"01","file_date_updated":"2026-07-23T12:10:28Z","article_number":"e70044","department":[{"_id":"CaMu"}],"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Ö.","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"ec_funded":1,"author":[{"first_name":"Lokahith N","last_name":"Agasthya","full_name":"Agasthya, Lokahith N","id":"cd100965-0804-11ed-9c55-f4878ff4e877"},{"last_name":"Muller","first_name":"Caroline J","full_name":"Muller, Caroline J","orcid":"0000-0001-5836-5350","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Quarterly Journal of the Royal Meteorological Society","ddc":["550"],"language":[{"iso":"eng"}],"status":"public","_id":"20590","title":"Moist convection and radiative cooling: Dynamical response and scaling","oa":1,"date_created":"2025-11-02T23:01:34Z","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."}],"das_tickbox":"1","isi":1,"corr_author":"1","year":"2026","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"call_identifier":"H2020","_id":"629205d8-2b32-11ec-9570-e1356ff73576","name":"Organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate","grant_number":"805041"}],"OA_type":"hybrid","publication_status":"published","oa_version":"Published Version","scopus_import":"1","date_updated":"2026-07-23T12:11:25Z"},{"scopus_import":"1","oa_version":"Preprint","date_updated":"2026-07-23T11:58:37Z","year":"2026","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","grant_number":"Z00342"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"publication_status":"published","OA_type":"green","das_tickbox":"0","corr_author":"1","isi":1,"_id":"20490","status":"public","title":"Flips in two-dimensional hypertriangulations","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"}],"oa":1,"date_created":"2025-10-19T22:01:31Z","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.","department":[{"_id":"HeEd"}],"ec_funded":1,"author":[{"orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert"},{"first_name":"Alexey","last_name":"Garber","full_name":"Garber, Alexey"},{"full_name":"Ghafari, Mohadese","first_name":"Mohadese","last_name":"Ghafari"},{"id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa","first_name":"Teresa","last_name":"Heiss"},{"last_name":"Saghafian","first_name":"Morteza","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"OA_place":"repository","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"European Journal of Combinatorics","arxiv":1,"intvolume":" 132","publisher":"Elsevier","citation":{"short":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2026).","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “Flips in Two-Dimensional Hypertriangulations.” European Journal of Combinatorics. Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104248.","ista":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2026. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 132, 104248.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” European Journal of Combinatorics, vol. 132. Elsevier, 2026.","ama":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 2026;132. doi:10.1016/j.ejc.2025.104248","apa":"Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., & Saghafian, M. (2026). Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104248","mla":"Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” European Journal of Combinatorics, vol. 132, 104248, Elsevier, 2026, doi:10.1016/j.ejc.2025.104248."},"date_published":"2026-02-01T00:00:00Z","day":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.11380","open_access":"1"}],"article_processing_charge":"No","article_number":"104248","type":"journal_article","external_id":{"arxiv":["2212.11380"],"isi":["001599061500002"]},"doi":"10.1016/j.ejc.2025.104248","volume":132,"publication_identifier":{"issn":["0195-6698"]},"article_type":"original","quality_controlled":"1","month":"02"},{"department":[{"_id":"MaMo"}],"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.)","OA_place":"repository","author":[{"first_name":"Amedeo Roberto","last_name":"Esposito","full_name":"Esposito, Amedeo Roberto","id":"9583e921-e1ad-11ec-9862-cef099626dc9"},{"last_name":"Gastpar","first_name":"Michael","full_name":"Gastpar, Michael"},{"first_name":"Ibrahim","last_name":"Issa","full_name":"Issa, Ibrahim"}],"arxiv":1,"publication":"IEEE Transactions on Information Theory","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"intvolume":" 72","supplementarymaterial":"no","issue":"7","citation":{"short":"A.R. Esposito, M. Gastpar, I. Issa, IEEE Transactions on Information Theory 72 (2026) 4434–4467.","chicago":"Esposito, Amedeo Roberto, Michael Gastpar, and Ibrahim Issa. “Sibson α-Mutual Information and Its Variational Representations.” IEEE Transactions on Information Theory. IEEE, 2026. https://doi.org/10.1109/TIT.2025.3587340.","ista":"Esposito AR, Gastpar M, Issa I. 2026. Sibson α-mutual information and its variational representations. IEEE Transactions on Information Theory. 72(7), 4434–4467.","ieee":"A. R. Esposito, M. Gastpar, and I. Issa, “Sibson α-mutual information and its variational representations,” IEEE Transactions on Information Theory, vol. 72, no. 7. IEEE, pp. 4434–4467, 2026.","ama":"Esposito AR, Gastpar M, Issa I. Sibson α-mutual information and its variational representations. IEEE Transactions on Information Theory. 2026;72(7):4434-4467. doi:10.1109/TIT.2025.3587340","apa":"Esposito, A. R., Gastpar, M., & Issa, I. (2026). Sibson α-mutual information and its variational representations. IEEE Transactions on Information Theory. IEEE. https://doi.org/10.1109/TIT.2025.3587340","mla":"Esposito, Amedeo Roberto, et al. “Sibson α-Mutual Information and Its Variational Representations.” IEEE Transactions on Information Theory, vol. 72, no. 7, IEEE, 2026, pp. 4434–67, doi:10.1109/TIT.2025.3587340."},"publisher":"IEEE","researchdata_availability":"no","article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.08352","open_access":"1"}],"day":"01","date_published":"2026-07-01T00:00:00Z","external_id":{"arxiv":["2405.08352"]},"type":"journal_article","volume":72,"doi":"10.1109/TIT.2025.3587340","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"article_type":"original","month":"07","quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","date_updated":"2026-07-23T11:38:30Z","year":"2026","OA_type":"green","publication_status":"published","page":"4434-4467","das_tickbox":"0","_id":"20081","status":"public","title":"Sibson α-mutual information and its variational representations","date_created":"2025-07-27T22:01:26Z","oa":1,"abstract":[{"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.","lang":"eng"}]},{"date_updated":"2026-07-24T12:48:29Z","oa_version":"Published Version","publication_status":"published","page":"244","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"year":"2026","supervisor":[{"last_name":"Henzinger","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"}],"corr_author":"1","publisher_comment":"Sections 2.4 and 7.1 and chapter 6 are not CC-BY 4.0, they are All Rights Reserved.","degree_awarded":"PhD","oa":1,"date_created":"2026-07-13T09:39:59Z","abstract":[{"lang":"eng","text":"In this thesis, we took a look at networks, and more specifically, at networks that change over time, whether those are networks in the distributed algorithms sense of the word, or the graph algorithm sense. \r\n\r\nIn distributed algorithms, we looked at two main problems. First, the broadcast problem: given n agents, each agent is tasked to forward a (unique) message to every other agent. Agents collaborate and can copy and forward all messages they have received up until that point. Broadcast is achieved when one agent has successfully broadcast its message to everyone else. We studied the case where the communication network is controlled by an adversary, under the condition that the graph is rooted in every round of communication. We show that the adversary can delay broadcast for at most l\r\n(1 + √\r\n2)n\r\nm\r\n rounds, improving on the $O(n\\log\\log n)$ previous upper bound~\\cite{fugger2020radius}, and asymptotically matching the $\\sim 1.5n$ lower bound~\\cite{schwarz2017linear}.\r\n\r\nWe then looked at the stochastic version of the problem: here, the adversary -- parametrized by $k$ where $k=0$ signifies that the adversary has no control, and $k=n$ that the adversary has full control -- can choose parts of the graph, and the graph is then completed stochastically. Here, we are able to look at a stronger version of broadcast: instead of having $n$ messages trying to be broadcast in parallel, we can assume that only one message needs to be broadcasted. We show the bound $\\Theta(k+\\log n)$.\r\n\r\nThen, we looked at undecided states dynamics in population protocols: given a population of $n$ agents, where each initially holds an opinion among $k$ different ones. In each round, two agents are chosen uniformly at random, and can interact. If they have different opinions, they forget their opinions and become undecided. If one of them is undecided while the other has an opinion, they undecided agent copies they opinion of the decided one. The question is then, how many interactions does it take for the whole population to share the same opinion? We show a $\\Omega(kn\\log \\frac {\\sqrt n} {k \\log n})$ lower bound for any $k = o\\left(\\frac {\\sqrt n}{\\log n}\\right)$.\r\nThis is tight for any $ k \\le n^{\\frac 1 2 - \\epsilon}$, where $\\epsilon >0$ can be any small constant, matching the known $O(kn\\log n)$ upper bound for $k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right)$~\\cite{DBLP:conf/podc/AmirABBHKL23}.\r\n\r\nFinally, in dynamic algorithms, we study the minimum cut problem: we are given a graph, whose vertex set we want to partition into two subsets such that the number of edges crossing from one subset to the other is minimized. Then, the graph can be updated via edge insertions or deletions, and we must update the solution without recomputing everything from scratch. We present an exact fully-dynamic minimum cut algorithm that runs in $n^{o(1)}$ deterministic update time when the minimum cut size is at most $2^{\\Theta(\\log^{3/4-c}n)}$ for any $c>0$, improving on the previous algorithm~\\cite{DBLP:conf/soda/JinST24} whose minimum cut size limit is $(\\log n)^{o(1)}$. Using sparsification and randomization techniques, we are able to extend this to all values of the minimum cut in weighted graphs, at the cost of a $(1+o(1))$-approximation ratio."}],"title":"Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks","status":"public","_id":"22281","ddc":["000"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","ec_funded":1,"author":[{"id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","full_name":"El-Hayek, Antoine","first_name":"Antoine","last_name":"El-Hayek"}],"department":[{"_id":"GradSch"},{"_id":"MoHe"}],"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","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"20051"},{"status":"public","relation":"part_of_dissertation","id":"18557"},{"relation":"part_of_dissertation","status":"public","id":"19982"},{"id":"21720","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"22374"},{"relation":"part_of_dissertation","status":"public","id":"22373"}]},"file_date_updated":"2026-07-20T11:29:38Z","article_processing_charge":"No","date_published":"2026-07-13T00:00:00Z","day":"13","citation":{"apa":"El-Hayek, A. (2026). Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22281","mla":"El-Hayek, Antoine. Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22281.","short":"A. El-Hayek, Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks, Institute of Science and Technology Austria, 2026.","ieee":"A. El-Hayek, “Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks,” Institute of Science and Technology Austria, 2026.","chicago":"El-Hayek, Antoine. “Handling Updates and Failures: Dynamic Graph Algorithms and Distributed Computing on Dynamic Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22281.","ista":"El-Hayek A. 2026. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. Institute of Science and Technology Austria.","ama":"El-Hayek A. Handling updates and failures: Dynamic graph algorithms and distributed computing on dynamic networks. 2026. doi:10.15479/AT-ISTA-22281"},"file":[{"date_created":"2026-07-17T11:39:47Z","file_id":"22356","file_name":"2026_El-Hayek_Antoine_Thesis.pdf","creator":"aelhayek","access_level":"open_access","file_size":5465973,"date_updated":"2026-07-17T11:39:47Z","content_type":"application/pdf","success":1,"relation":"main_file","checksum":"923e4ca769c9ef2f6b0b005444faf462"},{"date_created":"2026-07-17T11:40:34Z","file_name":"2026_El-Hayek_Antoine_Thesis.zip","creator":"aelhayek","file_id":"22357","content_type":"application/x-zip-compressed","date_updated":"2026-07-20T11:29:38Z","file_size":9116107,"access_level":"closed","relation":"source_file","checksum":"262689f9df27dd6c2c7c7861f1de7329"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","doi":"10.15479/AT-ISTA-22281","type":"dissertation","month":"07","publication_identifier":{"issn":["2663-337X"]},"alternative_title":["ISTA Thesis"],"doi_confirm":"1"},{"citation":{"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: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25","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.","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, vol. 2026, pp. 613–663.","mla":"El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25.","apa":"El-Hayek, A., Henzinger, M., & Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.25"},"publisher":"Society for Industrial and Applied Mathematics","intvolume":" 2026","article_processing_charge":"No","day":"07","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.13105"}],"date_published":"2026-01-07T00:00:00Z","OA_place":"repository","author":[{"id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","full_name":"El-Hayek, Antoine","first_name":"Antoine","last_name":"El-Hayek"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"full_name":"Li, Jason","first_name":"Jason","last_name":"Li"}],"ec_funded":1,"department":[{"_id":"MoHe"},{"_id":"GradSch"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"22281"}]},"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.","arxiv":1,"publication":"Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"publication_identifier":{"eisbn":["9781611978971"],"eissn":["1557-9468"],"issn":["1071-9040"]},"month":"01","quality_controlled":"1","external_id":{"arxiv":["2512.13105"]},"type":"conference","volume":2026,"doi":"10.1137/1.9781611978971.25","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"}],"year":"2026","OA_type":"green","publication_status":"published","page":"613-663","oa_version":"Preprint","scopus_import":"1","date_updated":"2026-07-24T12:48:29Z","conference":{"end_date":"2026-01-14","name":"SODA: Symposium on Discrete Algorithms","location":"Vancouver, Canada","start_date":"2026-01-11"},"title":"Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time","status":"public","_id":"21720","oa":1,"date_created":"2026-04-12T22:01:51Z","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_type":"gold","publication_status":"epub_ahead","year":"2026","date_updated":"2026-07-27T06:04:57Z","oa_version":"Published Version","scopus_import":"1","date_created":"2026-07-26T19:01:34Z","oa":1,"abstract":[{"lang":"eng","text":"Linear phase‐contrast scanning transmission electron microscopy (STEM) techniques compatible with high‐throughput 4D‐STEM acquisition are widely used to enhance phase contrast in weakly scattering and beam‐sensitive materials. In these modalities, contrast transfer is often suppressed at low spatial frequencies, resulting in a characteristic contrast gap that limits contrast. Approaches that retain low‐frequency phase contrast exist but typically require substantially increased experimental complexity, restricting routine use. Dark‐field STEM imaging captures this missing low‐frequency information through electrons scattered outside the bright‐field disk, but discards a large fraction of the scattered signal and is therefore dose‐inefficient. Fused Full‐field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that overcomes these limitations by combining ptychographic phase reconstruction with tilt‐corrected dark‐field imaging within a single acquisition. Bright‐field data are used to estimate probe aberrations and reconstruct a high‐resolution phase image, while dark‐field data provide complementary low‐frequency contrast. The two channels are fused in Fourier space using Wiener‐band weighting based on the spectral signal‐to‐noise ratio, yielding transfer‐gap‐free images with high contrast. FF‐STEM preserves the upsampling and depth‐sectioning capabilities of ptychography, adds robust low‐frequency contrast characteristic of dark‐field imaging, and enables dose‐efficient, near–real‐time reconstruction."}],"title":"Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels","_id":"22403","status":"public","das_tickbox":"1","article_number":"e76620","article_processing_charge":"Yes","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.","date_published":"2026-07-23T00:00:00Z","main_file_link":[{"url":"https://doi.org/10.1002/advs.76620","open_access":"1"}],"day":"23","citation":{"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.","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.” Advanced Science. Wiley, 2026. https://doi.org/10.1002/advs.76620.","ieee":"S. You et al., “Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels,” Advanced Science. Wiley, 2026.","ama":"You S, Varnavides G, Khavnekar S, et al. Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering channels. Advanced Science. 2026. doi:10.1002/advs.76620","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. Advanced Science. Wiley. https://doi.org/10.1002/advs.76620","mla":"You, Shengbo, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of Complementary Scattering Channels.” Advanced Science, e76620, Wiley, 2026, doi:10.1002/advs.76620."},"researchdata_availability":"yes","publisher":"Wiley","supplementarymaterial":"yes","arxiv":1,"publication":"Advanced Science","ddc":["570","600"],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","author":[{"full_name":"You, Shengbo","first_name":"Shengbo","last_name":"You"},{"first_name":"Georgios","last_name":"Varnavides","full_name":"Varnavides, Georgios"},{"first_name":"Sagar","last_name":"Khavnekar","full_name":"Khavnekar, Sagar"},{"first_name":"Nikita","last_name":"Palatkin","full_name":"Palatkin, Nikita"},{"full_name":"Shao, Sihan","last_name":"Shao","first_name":"Sihan"},{"first_name":"Mingjian","last_name":"Wu","full_name":"Wu, Mingjian"},{"full_name":"Stroppa, Daniel","last_name":"Stroppa","first_name":"Daniel"},{"last_name":"Chernikova","first_name":"Darya","full_name":"Chernikova, Darya","id":"7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0"},{"last_name":"Zhu","first_name":"Baixu","full_name":"Zhu, Baixu"},{"full_name":"Egoavil, Ricardo","last_name":"Egoavil","first_name":"Ricardo"},{"full_name":"Vespucci, Stefano","first_name":"Stefano","last_name":"Vespucci"},{"first_name":"Dileep","last_name":"Krishnan","full_name":"Krishnan, Dileep"},{"last_name":"Ye","first_name":"Xingchen","full_name":"Ye, Xingchen"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM","last_name":"Schur","first_name":"Florian KM"},{"full_name":"Spiecker, Erdmann","first_name":"Erdmann","last_name":"Spiecker"},{"full_name":"Pelz, Philipp","first_name":"Philipp","last_name":"Pelz"}],"department":[{"_id":"FlSc"},{"_id":"GradSch"}],"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.","month":"07","quality_controlled":"1","article_type":"original","publication_identifier":{"eissn":["2198-3844"]},"has_accepted_license":"1","doi":"10.1002/advs.76620","DOAJ_listed":"1","external_id":{"arxiv":["2512.19460"]},"type":"journal_article"},{"quality_controlled":"1","month":"04","article_type":"original","publication_identifier":{"eissn":["1469-185X"],"issn":["1464-7931"]},"doi":"10.1111/brv.70103","volume":101,"has_accepted_license":"1","type":"journal_article","external_id":{"pmid":["41235821 "],"isi":["001614285900001"]},"article_number":"804-825","file_date_updated":"2026-07-27T08:07:35Z","day":"01","date_published":"2026-04-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","publisher":"Wiley","researchdata_availability":"no","file":[{"success":1,"date_updated":"2026-07-27T08:07:35Z","content_type":"application/pdf","file_size":1757556,"access_level":"open_access","checksum":"167d95cf0570d6e3653ab349b2a4355c","relation":"main_file","date_created":"2026-07-27T08:07:35Z","file_id":"22409","creator":"dernst","file_name":"2026_BiologicalReviews_Ruzicka.pdf"}],"citation":{"mla":"Ruzicka, Filip, et al. “A Century of Theories of Balancing Selection.” Biological Reviews, vol. 101, no. 2, 804–825, Wiley, 2026, doi:10.1111/brv.70103.","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. Biological Reviews. Wiley. https://doi.org/10.1111/brv.70103","ama":"Ruzicka F, Zwoinska MK, Goedert D, et al. A century of theories of balancing selection. Biological Reviews. 2026;101(2). doi:10.1111/brv.70103","ieee":"F. Ruzicka et al., “A century of theories of balancing selection,” Biological Reviews, vol. 101, no. 2. Wiley, 2026.","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.” Biological Reviews. Wiley, 2026. https://doi.org/10.1111/brv.70103.","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.","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)."},"supplementarymaterial":"yes","issue":"2","intvolume":" 101","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Biological Reviews","language":[{"iso":"eng"}],"ddc":["570"],"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png"},"keyword":["evolutionary theory","population genetics","balancing selection","heterozygote advantage","trade-offs","negative frequency-dependent selection","fitness variation","mathematical modelling"],"author":[{"id":"347955dd-57b0-11ee-9095-c28bdd368f4b","full_name":"Ruzicka, Filip","last_name":"Ruzicka","first_name":"Filip"},{"first_name":"Martyna K.","last_name":"Zwoinska","full_name":"Zwoinska, Martyna K."},{"full_name":"Goedert, Debora","last_name":"Goedert","first_name":"Debora"},{"last_name":"Kokko","first_name":"Hanna","full_name":"Kokko, Hanna"},{"first_name":"Xiang‐Yi","last_name":"Li Richter","full_name":"Li Richter, Xiang‐Yi"},{"full_name":"Moodie, Iain R.","first_name":"Iain R.","last_name":"Moodie"},{"last_name":"Nilén","first_name":"Sofie","full_name":"Nilén, Sofie"},{"last_name":"Olito","first_name":"Colin","full_name":"Olito, Colin"},{"full_name":"Svensson, Erik I.","last_name":"Svensson","first_name":"Erik I."},{"full_name":"Czuppon, Peter","last_name":"Czuppon","first_name":"Peter"},{"full_name":"Connallon, Tim","last_name":"Connallon","first_name":"Tim"}],"ec_funded":1,"OA_place":"publisher","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Ö.","department":[{"_id":"BeVi"}],"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":1,"date_created":"2025-11-19T09:43:50Z","title":"A century of theories of balancing selection","status":"public","_id":"20655","corr_author":"1","isi":1,"das_tickbox":"0","publication_status":"published","OA_type":"hybrid","license":"https://creativecommons.org/licenses/by-nc/4.0/","pmid":1,"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"year":"2026","date_updated":"2026-07-27T08:08:09Z","oa_version":"Published Version","scopus_import":"1"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"PlanS_conform":"1","language":[{"iso":"eng"}],"publication":"Nature Nanotechnology","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"link":[{"relation":"software","url":"https://github.com/lukasvandenheuvel/Biomemristors"}]},"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.","department":[{"_id":"EdHa"}],"author":[{"full_name":"Mayer, Simon","first_name":"Simon","last_name":"Mayer"},{"full_name":"Mitsioni, Marianna Fanouria","last_name":"Mitsioni","first_name":"Marianna Fanouria"},{"full_name":"Robin, Paul","last_name":"Robin","first_name":"Paul","id":"48c58128-57b0-11ee-9095-dc28fd97fc1d","orcid":"0000-0002-5728-9189"},{"full_name":"Van Den Heuvel, Lukas","first_name":"Lukas","last_name":"Van Den Heuvel"},{"full_name":"Ronceray, Nathan","last_name":"Ronceray","first_name":"Nathan"},{"last_name":"Marcaida","first_name":"Maria Jose","full_name":"Marcaida, Maria Jose"},{"full_name":"Abriata, Luciano A.","first_name":"Luciano A.","last_name":"Abriata"},{"first_name":"Lucien F.","last_name":"Krapp","full_name":"Krapp, Lucien F."},{"full_name":"Anton, Jana S.","first_name":"Jana S.","last_name":"Anton"},{"first_name":"Sarah","last_name":"Soussou","full_name":"Soussou, Sarah"},{"full_name":"Jeanneret-Grosjean, Justin","last_name":"Jeanneret-Grosjean","first_name":"Justin"},{"last_name":"Fulciniti","first_name":"Alessandro","full_name":"Fulciniti, Alessandro"},{"full_name":"Möller, Alexia","last_name":"Möller","first_name":"Alexia"},{"last_name":"Vacle","first_name":"Sarah","full_name":"Vacle, Sarah"},{"last_name":"Feletti","first_name":"Lely","full_name":"Feletti, Lely"},{"full_name":"Brinkerhoff, Henry","last_name":"Brinkerhoff","first_name":"Henry"},{"last_name":"Laszlo","first_name":"Andrew H.","full_name":"Laszlo, Andrew H."},{"last_name":"Gundlach","first_name":"Jens H.","full_name":"Gundlach, Jens H."},{"full_name":"Emmerich, Theo","last_name":"Emmerich","first_name":"Theo"},{"full_name":"Dal Peraro, Matteo","last_name":"Dal Peraro","first_name":"Matteo"},{"full_name":"Radenovic, Aleksandra","last_name":"Radenovic","first_name":"Aleksandra"}],"OA_place":"publisher","day":"01","date_published":"2026-01-01T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","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.","file_date_updated":"2026-07-27T08:22:57Z","supplementarymaterial":"yes","intvolume":" 21","publisher":"Springer Nature","file":[{"date_created":"2026-07-27T08:22:57Z","file_id":"22412","file_name":"2026_NatureNanotech_Mayer.pdf","creator":"dernst","success":1,"content_type":"application/pdf","date_updated":"2026-07-27T08:22:57Z","file_size":10091503,"access_level":"open_access","relation":"main_file","checksum":"ff9a5eafe60af1d97da545453bd53eca"}],"researchdata_availability":"yes","citation":{"ama":"Mayer S, Mitsioni MF, Robin P, et al. Lumen charge governs gated ion transport in β-barrel nanopores. Nature Nanotechnology. 2026;21:116-124. doi:10.1038/s41565-025-02052-6","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.","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.” Nature Nanotechnology. Springer Nature, 2026. https://doi.org/10.1038/s41565-025-02052-6.","ieee":"S. Mayer et al., “Lumen charge governs gated ion transport in β-barrel nanopores,” Nature Nanotechnology, vol. 21. Springer Nature, pp. 116–124, 2026.","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.","mla":"Mayer, Simon, et al. “Lumen Charge Governs Gated Ion Transport in β-Barrel Nanopores.” Nature Nanotechnology, vol. 21, Springer Nature, 2026, pp. 116–24, doi:10.1038/s41565-025-02052-6.","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. Nature Nanotechnology. Springer Nature. https://doi.org/10.1038/s41565-025-02052-6"},"doi":"10.1038/s41565-025-02052-6","volume":21,"has_accepted_license":"1","type":"journal_article","external_id":{"pmid":["41219410"],"isi":["001611698900001"]},"article_type":"original","quality_controlled":"1","month":"01","publication_identifier":{"issn":["1748-3387"],"eissn":["1748-3395"]},"date_updated":"2026-07-27T08:24:20Z","oa_version":"Published Version","scopus_import":"1","publication_status":"published","page":"116-124","OA_type":"hybrid","year":"2026","pmid":1,"das_tickbox":"1","isi":1,"abstract":[{"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.","lang":"eng"}],"date_created":"2025-11-23T23:01:40Z","oa":1,"status":"public","_id":"20670","title":"Lumen charge governs gated ion transport in β-barrel nanopores"},{"date_updated":"2026-07-27T10:25:46Z","mathsc":["31C15","31C25","35A15","35J10","47D07"],"oa_version":"Published Version","scopus_import":"1","publication_status":"published","OA_type":"hybrid","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"grant_number":"716117","name":"Optimal Transport and Stochastic Dynamics","call_identifier":"H2020","_id":"256E75B8-B435-11E9-9278-68D0E5697425"},{"name":"Gradient flow techniques for quantum Markov semigroups","grant_number":"ESP156_N","_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833"}],"year":"2026","das_tickbox":"1","abstract":[{"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.","lang":"eng"}],"date_created":"2025-12-14T23:02:03Z","oa":1,"title":"Boundary representations of intermediate forms between a regular Dirichlet form and its active main part","status":"public","_id":"20814","ddc":["510"],"publication":"Potential Analysis","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"keyword":["Dirichlet forms","Domination of semigroups","Dirichlet","Neumann and Robin boundary conditions"],"PlanS_conform":"1","author":[{"last_name":"Keller","first_name":"Matthias","full_name":"Keller, Matthias"},{"last_name":"Lenz","first_name":"Daniel","full_name":"Lenz, Daniel"},{"last_name":"Schmidt","first_name":"Marcel","full_name":"Schmidt, Marcel"},{"full_name":"Schwarz, Michael","first_name":"Michael","last_name":"Schwarz"},{"full_name":"Wirth, Melchior","first_name":"Melchior","last_name":"Wirth","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E","orcid":"0000-0002-0519-4241"}],"ec_funded":1,"OA_place":"publisher","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).","department":[{"_id":"JaMa"}],"file_date_updated":"2026-07-27T10:25:21Z","article_number":"6","date_published":"2026-01-01T00:00:00Z","day":"01","article_processing_charge":"Yes (via OA deal)","dataavailabilitystatement":"No datasets were generated or analysed during the current study.","file":[{"date_created":"2026-07-27T10:25:21Z","file_name":"2026_PotentialAnalysis_Keller.pdf","creator":"dernst","file_id":"22414","date_updated":"2026-07-27T10:25:21Z","success":1,"content_type":"application/pdf","file_size":445935,"access_level":"open_access","checksum":"9f5a4e900b8d4c74c6b5bf7c3bad54e1","relation":"main_file"}],"publisher":"Springer Nature","researchdata_availability":"no","citation":{"mla":"Keller, Matthias, et al. “Boundary Representations of Intermediate Forms between a Regular Dirichlet Form and Its Active Main Part.” Potential Analysis, vol. 64, no. 1, 6, Springer Nature, 2026, doi:10.1007/s11118-025-10251-y.","apa":"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. Springer Nature. https://doi.org/10.1007/s11118-025-10251-y","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. Potential Analysis. 2026;64(1). doi:10.1007/s11118-025-10251-y","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.” Potential Analysis. Springer Nature, 2026. https://doi.org/10.1007/s11118-025-10251-y.","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.","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,” Potential Analysis, vol. 64, no. 1. Springer Nature, 2026.","short":"M. Keller, D. Lenz, M. Schmidt, M. Schwarz, M. Wirth, Potential Analysis 64 (2026)."},"issue":"1","supplementarymaterial":"no","intvolume":" 64","doi":"10.1007/s11118-025-10251-y","volume":64,"has_accepted_license":"1","type":"journal_article","external_id":{"arxiv":["2301.01035"]},"quality_controlled":"1","month":"01","article_type":"original","publication_identifier":{"issn":["0926-2601"],"eissn":["1572-929X"]}},{"volume":75,"has_accepted_license":"1","doi":"10.1007/s00454-025-00796-5","external_id":{"isi":["001610592600001"],"arxiv":["2310.14801"]},"type":"journal_article","month":"03","quality_controlled":"1","article_type":"original","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Discrete & Computational Geometry","ddc":["510"],"language":[{"iso":"eng"}],"PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","ec_funded":1,"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner"},{"id":"E62E3130-B088-11EA-B919-BF823C25FEA4","first_name":"János","last_name":"Pach","full_name":"Pach, János"}],"department":[{"_id":"HeEd"}],"related_material":{"record":[{"status":"public","relation":"earlier_version","id":"17146"}]},"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).","file_date_updated":"2026-07-27T08:11:05Z","article_processing_charge":"Yes (via OA deal)","date_published":"2026-03-01T00:00:00Z","day":"01","citation":{"ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. Discrete & Computational Geometry. 2026;75:597-624. doi:10.1007/s00454-025-00796-5","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” Discrete & Computational Geometry. Springer Nature, 2026. https://doi.org/10.1007/s00454-025-00796-5.","ista":"Edelsbrunner H, Pach J. 2026. Maximum Betti numbers of Čech complexes. Discrete & Computational Geometry. 75, 597–624.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” Discrete & Computational Geometry, vol. 75. Springer Nature, pp. 597–624, 2026.","short":"H. Edelsbrunner, J. Pach, Discrete & Computational Geometry 75 (2026) 597–624.","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” Discrete & Computational Geometry, vol. 75, Springer Nature, 2026, pp. 597–624, doi:10.1007/s00454-025-00796-5.","apa":"Edelsbrunner, H., & Pach, J. (2026). Maximum Betti numbers of Čech complexes. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-025-00796-5"},"researchdata_availability":"no","publisher":"Springer Nature","file":[{"file_size":546483,"access_level":"open_access","content_type":"application/pdf","date_updated":"2026-07-27T08:11:05Z","success":1,"relation":"main_file","checksum":"c17c014dbbf5be702195c737890251c8","date_created":"2026-07-27T08:11:05Z","creator":"dernst","file_name":"2026_DiscreteCompGeom_Edelsbrunner.pdf","file_id":"22410"}],"intvolume":" 75","supplementarymaterial":"no","isi":1,"corr_author":"1","das_tickbox":"0","date_created":"2025-11-19T09:44:58Z","oa":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². "}],"title":"Maximum Betti numbers of Čech complexes","_id":"20657","status":"public","date_updated":"2026-07-27T08:15:58Z","oa_version":"Published Version","scopus_import":"1","OA_type":"hybrid","publication_status":"published","page":"597-624","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"}],"year":"2026"},{"volume":31,"has_accepted_license":"1","doi":"10.1016/j.tplants.2025.10.018","external_id":{"pmid":["41249070"]},"type":"journal_article","month":"02","quality_controlled":"1","article_type":"review","publication_identifier":{"eissn":["1878-4372"],"issn":["1360-1385"]},"ddc":["580"],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Trends in Plant Science","PlanS_conform":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"OA_place":"publisher","author":[{"last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"JiFr"}],"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.","file_date_updated":"2026-07-27T08:26:40Z","article_processing_charge":"Yes (via OA deal)","day":"01","date_published":"2026-02-01T00:00:00Z","citation":{"mla":"Friml, Jiří. “Role of CAMP in TIR1/AFB Auxin Signaling: Open Issues.” Trends in Plant Science, vol. 31, no. 2, Elsevier, 2026, pp. 136–38, doi:10.1016/j.tplants.2025.10.018.","apa":"Friml, J. (2026). Role of cAMP in TIR1/AFB auxin signaling: Open issues. Trends in Plant Science. Elsevier. https://doi.org/10.1016/j.tplants.2025.10.018","ama":"Friml J. Role of cAMP in TIR1/AFB auxin signaling: Open issues. Trends in Plant Science. 2026;31(2):136-138. doi:10.1016/j.tplants.2025.10.018","chicago":"Friml, Jiří. “Role of CAMP in TIR1/AFB Auxin Signaling: Open Issues.” Trends in Plant Science. Elsevier, 2026. https://doi.org/10.1016/j.tplants.2025.10.018.","ieee":"J. Friml, “Role of cAMP in TIR1/AFB auxin signaling: Open issues,” Trends in Plant Science, vol. 31, no. 2. Elsevier, pp. 136–138, 2026.","ista":"Friml J. 2026. Role of cAMP in TIR1/AFB auxin signaling: Open issues. Trends in Plant Science. 31(2), 136–138.","short":"J. Friml, Trends in Plant Science 31 (2026) 136–138."},"researchdata_availability":"no","file":[{"date_created":"2026-07-27T08:26:40Z","file_id":"22413","creator":"dernst","file_name":"2026_TrendsPlantScience_Friml.pdf","success":1,"date_updated":"2026-07-27T08:26:40Z","content_type":"application/pdf","file_size":432792,"access_level":"open_access","relation":"main_file","checksum":"e60e903fb4b3e917dba763976ec652cd"}],"publisher":"Elsevier","intvolume":" 31","issue":"2","supplementarymaterial":"no","corr_author":"1","das_tickbox":"0","date_created":"2025-12-02T16:29:22Z","oa":1,"abstract":[{"lang":"eng","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."}],"title":"Role of cAMP in TIR1/AFB auxin signaling: Open issues","status":"public","_id":"20725","date_updated":"2026-07-27T08:27:07Z","scopus_import":"1","oa_version":"Published Version","OA_type":"hybrid","page":"136-138","publication_status":"published","pmid":1,"project":[{"name":"Cyclic nucleotides as second messengers in plants","grant_number":"101142681","_id":"8f347782-16d5-11f0-9cad-8c19706ee739"},{"_id":"7bcece63-9f16-11ee-852c-ae94e099eeb6","name":"Guanylate cyclase activity of TIR1/AFBs auxin receptors","grant_number":"P37051"}],"year":"2026"}]