[{"OA_type":"gold","ec_funded":1,"title":"The recruitment of the A-type cyclin TAM to stress granules is crucial for meiotic fidelity under heat","publication_status":"published","has_accepted_license":"1","intvolume":" 11","abstract":[{"lang":"eng","text":"Stress granules (SG) are biomolecular condensates that represent an adaptive response of cells to various stresses, including heat. However, the cell type–specific function and relevance of SG formation, especially during reproductive development, are largely not understood. Here, we show that the meiotic A-type cyclin TARDY ASYNCHRONOUS MEIOSIS (TAM) is recruited to SGs in male meiocytes of Arabidopsis after exposure to heat. We find that the amino terminus of TAM is necessary and sufficient for the localization of proteins to meiotic SGs. Swapping the amino terminus of TAM with the one of its sister protein CYCA1;1 resulted in a separation-of-function allele of TAM, which prevents the partitioning of TAM to SGs while restoring a wild-type phenotype in a tam mutant background under nonheat stress conditions. Notably, plants expressing this TAM version prematurely terminate meiosis under heat resulting in unreduced gametes. Thus, the formation of TAM-containing SGs is necessary for genome stability under heat stress."}],"publication":"Science Advances","OA_place":"publisher","quality_controlled":"1","day":"08","acknowledgement":"We thank L. Strader (Duke University, Durham) and A. Holehouse (Washington University, Saint Louis) for discussion and input in LLPS. We thank T. Nakagawa (Shimane University, Matsue) for providing the pGWB604 Gateway vector containing bar gene identified by Meiji Seika Kaisha Ltd. We thank M. Heese (Hamburg University) for the critical reading and comments on this manuscript. We further thank J. Mehrmann (Hamburg University) for technical assistance. We thank the ISTA imaging facility for assistance for microscopy.\r\nThis project has received funding from JST-PRESTO (JPMJPR18H7), JST-CREST (JPMJCR18H4), European Union’s Horizon 2020 under MSCA grant 101034413, and a federal grant from the state of Hamburg (LFF-BiCon).","oa":1,"article_processing_charge":"Yes","citation":{"mla":"De Jaeger-Braet, Joke G., et al. “The Recruitment of the A-Type Cyclin TAM to Stress Granules Is Crucial for Meiotic Fidelity under Heat.” Science Advances, vol. 11, no. 32, AAAS, 2025, p. eadr5694, doi:10.1126/sciadv.adr5694.","ieee":"J. G. De Jaeger-Braet et al., “The recruitment of the A-type cyclin TAM to stress granules is crucial for meiotic fidelity under heat,” Science Advances, vol. 11, no. 32. AAAS, p. eadr5694, 2025.","ama":"De Jaeger-Braet JG, Hartmann M, Böttger L, et al. The recruitment of the A-type cyclin TAM to stress granules is crucial for meiotic fidelity under heat. Science Advances. 2025;11(32):eadr5694. doi:10.1126/sciadv.adr5694","apa":"De Jaeger-Braet, J. G., Hartmann, M., Böttger, L., Yang, C., Hamada, T., Hoth, S., … Schnittger, A. (2025). The recruitment of the A-type cyclin TAM to stress granules is crucial for meiotic fidelity under heat. Science Advances. AAAS. https://doi.org/10.1126/sciadv.adr5694","ista":"De Jaeger-Braet JG, Hartmann M, Böttger L, Yang C, Hamada T, Hoth S, Feng X, Weingartner M, Schnittger A. 2025. The recruitment of the A-type cyclin TAM to stress granules is crucial for meiotic fidelity under heat. Science Advances. 11(32), eadr5694.","chicago":"De Jaeger-Braet, Joke G, Merle Hartmann, Lev Böttger, Chao Yang, Takahiro Hamada, Stefan Hoth, Xiaoqi Feng, Magdalena Weingartner, and Arp Schnittger. “The Recruitment of the A-Type Cyclin TAM to Stress Granules Is Crucial for Meiotic Fidelity under Heat.” Science Advances. AAAS, 2025. https://doi.org/10.1126/sciadv.adr5694.","short":"J.G. De Jaeger-Braet, M. Hartmann, L. Böttger, C. Yang, T. Hamada, S. Hoth, X. Feng, M. Weingartner, A. Schnittger, Science Advances 11 (2025) eadr5694."},"isi":1,"page":"eadr5694","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"language":[{"iso":"eng"}],"author":[{"full_name":"De Jaeger-Braet, Joke G","last_name":"De Jaeger-Braet","first_name":"Joke G","id":"26bd38d3-c59a-11ee-a1af-d7a988cafcc5"},{"first_name":"Merle","last_name":"Hartmann","full_name":"Hartmann, Merle"},{"full_name":"Böttger, Lev","last_name":"Böttger","first_name":"Lev"},{"last_name":"Yang","id":"082e3e6e-8069-11ed-8390-c8cce7b1aaca","first_name":"Chao","full_name":"Yang, Chao"},{"full_name":"Hamada, Takahiro","first_name":"Takahiro","last_name":"Hamada"},{"last_name":"Hoth","first_name":"Stefan","full_name":"Hoth, Stefan"},{"full_name":"Feng, Xiaoqi","orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","first_name":"Xiaoqi","last_name":"Feng"},{"full_name":"Weingartner, Magdalena","first_name":"Magdalena","last_name":"Weingartner"},{"first_name":"Arp","last_name":"Schnittger","full_name":"Schnittger, Arp"}],"month":"08","scopus_import":"1","volume":11,"publication_identifier":{"eissn":["2375-2548"]},"doi":"10.1126/sciadv.adr5694","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"_id":"20220","file":[{"file_name":"2025_ScienceAdvance_DeJaegerBraet.pdf","file_size":10876817,"file_id":"20270","creator":"dernst","access_level":"open_access","date_updated":"2025-09-02T07:05:37Z","checksum":"0f1ae246acc9b075f01bf4afe382c8ba","date_created":"2025-09-02T07:05:37Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"oa_version":"Published Version","file_date_updated":"2025-09-02T07:05:37Z","DOAJ_listed":"1","department":[{"_id":"XiFe"}],"date_updated":"2025-09-30T14:24:10Z","external_id":{"isi":["001549102600016"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-08-24T22:01:30Z","date_published":"2025-08-08T00:00:00Z","status":"public","license":"https://creativecommons.org/licenses/by-nc/4.0/","year":"2025","acknowledged_ssus":[{"_id":"Bio"}],"issue":"32","ddc":["580"],"publisher":"AAAS","type":"journal_article","article_type":"original"},{"article_type":"original","type":"journal_article","publisher":"American Chemical Society","ddc":["540"],"pmid":1,"issue":"31","year":"2025","status":"public","date_published":"2025-07-24T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-08-24T22:01:30Z","external_id":{"pmid":["40707400"],"isi":["001537145800001"]},"date_updated":"2025-09-30T14:23:39Z","department":[{"_id":"LaVe"}],"file_date_updated":"2025-09-02T06:50:11Z","oa_version":"Published Version","file":[{"file_name":"2025_NanoLetters_Shi.pdf","file_size":3212706,"file_id":"20269","creator":"dernst","access_level":"open_access","date_updated":"2025-09-02T06:50:11Z","checksum":"bfc167d8904c0c47c3de2a8d0ec699d5","date_created":"2025-09-02T06:50:11Z","content_type":"application/pdf","success":1,"relation":"main_file"}],"_id":"20221","PlanS_conform":"1","doi":"10.1021/acs.nanolett.5c03693","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"eissn":["1530-6992"]},"volume":25,"scopus_import":"1","month":"07","author":[{"full_name":"Shi, Wanzhuo","last_name":"Shi","id":"a3010425-87c8-11f0-8106-bec32bea74da","first_name":"Wanzhuo"},{"first_name":"Mengjiao","last_name":"Wang","full_name":"Wang, Mengjiao"},{"full_name":"Venkataraman, Latha","orcid":"0000-0002-6957-6089","first_name":"Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","last_name":"Venkataraman"},{"last_name":"Tovar","first_name":"John D.","full_name":"Tovar, John D."}],"language":[{"iso":"eng"}],"page":"12101-12106","article_processing_charge":"Yes (via OA deal)","isi":1,"citation":{"short":"W. Shi, M. Wang, L. Venkataraman, J.D. Tovar, Nano Letters 25 (2025) 12101–12106.","chicago":"Shi, Wanzhuo, Mengjiao Wang, Latha Venkataraman, and John D. Tovar. “Single-Molecule Conductance through Hybrid Radially and Linearly π-Conjugated Macromolecules Reveals an Unusual Intramolecular π-Interaction.” Nano Letters. American Chemical Society, 2025. https://doi.org/10.1021/acs.nanolett.5c03693.","ista":"Shi W, Wang M, Venkataraman L, Tovar JD. 2025. Single-molecule conductance through hybrid radially and linearly π-conjugated macromolecules reveals an unusual intramolecular π-interaction. Nano Letters. 25(31), 12101–12106.","apa":"Shi, W., Wang, M., Venkataraman, L., & Tovar, J. D. (2025). Single-molecule conductance through hybrid radially and linearly π-conjugated macromolecules reveals an unusual intramolecular π-interaction. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.5c03693","ama":"Shi W, Wang M, Venkataraman L, Tovar JD. Single-molecule conductance through hybrid radially and linearly π-conjugated macromolecules reveals an unusual intramolecular π-interaction. Nano Letters. 2025;25(31):12101-12106. doi:10.1021/acs.nanolett.5c03693","mla":"Shi, Wanzhuo, et al. “Single-Molecule Conductance through Hybrid Radially and Linearly π-Conjugated Macromolecules Reveals an Unusual Intramolecular π-Interaction.” Nano Letters, vol. 25, no. 31, American Chemical Society, 2025, pp. 12101–06, doi:10.1021/acs.nanolett.5c03693.","ieee":"W. Shi, M. Wang, L. Venkataraman, and J. D. Tovar, “Single-molecule conductance through hybrid radially and linearly π-conjugated macromolecules reveals an unusual intramolecular π-interaction,” Nano Letters, vol. 25, no. 31. American Chemical Society, pp. 12101–12106, 2025."},"oa":1,"acknowledgement":"We thank Prof. Volker Blum for useful discussions. We thank the Department of Energy Office of Basic Energy Science (DE-SC0019017) and the National Science Foundation (NSF-DMR 2241180) for supporting this research. This work was supported in part by the Institute of Science and Technology Austria.","day":"24","quality_controlled":"1","OA_place":"publisher","publication":"Nano Letters","abstract":[{"lang":"eng","text":"We describe the design, synthesis, and single-molecule junction conductance of π-electron molecules bearing both radial and linear π-conjugation pathways, whereby cycloparaphenylene (CPP) radial cores are π-extended linearly with aryl alkyne substituents as models for previously reported CPP-arylene ethynylene conjugated polymers. Although radially and linearly conjugated molecules have been studied previously in isolation as junction-bridging molecular electronic units, this is the first study to examine molecules where both topologies are operative. Our results reveal that the presence of radial CPP components within the junction-spanning pathway leads to a reduction in the conductance of the backbone compared to model linear phenyl substituents. Through tight-binding and DFT-based calculations, we attribute this conductance change to intramolecular van der Waals (vdW) interactions between the CPP ring and the junction-spanning arylene-ethynylene molecular backbone. These interactions induce changes in the dihedral angles of the backbone, leading to a reduced overlap of π orbitals within the molecular junction."}],"intvolume":" 25","has_accepted_license":"1","publication_status":"published","corr_author":"1","title":"Single-molecule conductance through hybrid radially and linearly π-conjugated macromolecules reveals an unusual intramolecular π-interaction","OA_type":"hybrid"},{"date_published":"2025-08-01T00:00:00Z","status":"public","date_created":"2025-08-24T22:01:31Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Oxford University Press","type":"journal_article","article_type":"original","year":"2025","pmid":1,"issue":"8","acknowledged_ssus":[{"_id":"ScienComp"}],"ddc":["570"],"_id":"20223","article_number":"msaf177","file":[{"date_created":"2025-09-02T07:47:32Z","content_type":"application/pdf","success":1,"relation":"main_file","creator":"dernst","file_size":1239841,"file_name":"2025_MolecularBioEvolution_Mrnjavac.pdf","file_id":"20274","checksum":"f40abffa56cb1e9ff65800f2a7d7b39a","access_level":"open_access","date_updated":"2025-09-02T07:47:32Z"}],"oa_version":"Published Version","file_date_updated":"2025-09-02T07:47:32Z","DOAJ_listed":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1093/molbev/msaf177","PlanS_conform":"1","related_material":{"link":[{"url":"https://git.ista.ac.at/bvicoso/xydegenerate","relation":"software"}]},"date_updated":"2025-09-30T14:25:57Z","external_id":{"isi":["001547617100001"],"pmid":["40713898"]},"department":[{"_id":"BeVi"}],"citation":{"short":"A. Mrnjavac, B. Vicoso, T. Connallon, Molecular Biology and Evolution 42 (2025).","apa":"Mrnjavac, A., Vicoso, B., & Connallon, T. (2025). An extension of Muller’s sheltering hypothesis for the evolution of sex chromosome gene content. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msaf177","ama":"Mrnjavac A, Vicoso B, Connallon T. An extension of Muller’s sheltering hypothesis for the evolution of sex chromosome gene content. Molecular Biology and Evolution. 2025;42(8). doi:10.1093/molbev/msaf177","chicago":"Mrnjavac, Andrea, Beatriz Vicoso, and Tim Connallon. “An Extension of Muller’s Sheltering Hypothesis for the Evolution of Sex Chromosome Gene Content.” Molecular Biology and Evolution. Oxford University Press, 2025. https://doi.org/10.1093/molbev/msaf177.","ista":"Mrnjavac A, Vicoso B, Connallon T. 2025. An extension of Muller’s sheltering hypothesis for the evolution of sex chromosome gene content. Molecular Biology and Evolution. 42(8), msaf177.","ieee":"A. Mrnjavac, B. Vicoso, and T. Connallon, “An extension of Muller’s sheltering hypothesis for the evolution of sex chromosome gene content,” Molecular Biology and Evolution, vol. 42, no. 8. Oxford University Press, 2025.","mla":"Mrnjavac, Andrea, et al. “An Extension of Muller’s Sheltering Hypothesis for the Evolution of Sex Chromosome Gene Content.” Molecular Biology and Evolution, vol. 42, no. 8, msaf177, Oxford University Press, 2025, doi:10.1093/molbev/msaf177."},"isi":1,"article_processing_charge":"Yes","language":[{"iso":"eng"}],"author":[{"first_name":"Andrea","id":"353FAC84-AE61-11E9-8BFC-00D3E5697425","last_name":"Mrnjavac","full_name":"Mrnjavac, Andrea"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","last_name":"Vicoso","full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306"},{"first_name":"Tim","last_name":"Connallon","full_name":"Connallon, Tim"}],"acknowledgement":"We thank Filip Ruzicka, Colin Olito, Akane Uesugi, Melissa Toups, Daniel Jeffries, the Associate Editor, and anonymous reviewers, for comments and suggestions on earlier versions of the paper. We are particularly grateful to Deborah Charlesworth and Brian Charlesworth for extensive comments on two different drafts of the manuscript. We also thank Aneil Agrawal and Thomas Lenormand for email correspondence about the data on dominance and ways to interpret it. Technical support was provided by ISTA Scientific Computing Unit.","oa":1,"publication_identifier":{"eissn":["1537-1719"],"issn":["0737-4038"]},"scopus_import":"1","month":"08","volume":42,"title":"An extension of Muller's sheltering hypothesis for the evolution of sex chromosome gene content","publication_status":"published","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The first influential hypothesis for sex chromosome evolution was proposed in 1914 by H. J. Muller, who argued that once recombination was suppressed between the X and Y chromosomes, Y-linked genes become “sheltered” from selection, leading to accumulation of recessive loss-of-function (LOF) mutations and decay of Y-linked genes. The hypothesis fell out of favor in the 1970s because early mathematical models failed to support it and data on the dominance of lethal mutations were viewed as incompatible with the hypothesis. We reevaluate the main arguments against Muller's hypothesis and find that they do not conclusively exclude a role for sheltering in sex chromosome evolution. By relaxing restrictive assumptions of earlier models, we show that sheltering promotes fixation of LOF mutations with sexually dimorphic fitness effects, resulting in decay of X-linked genes that are exclusively expressed by males and Y-linked genes that are primarily, though not necessarily exclusively, expressed by females. We further show that drift and other processes contributing to Y degeneration (i.e. selective interference and regulatory evolution) expand conditions of Y-linked gene loss by sheltering. The actual contribution of sheltering to sex chromosome evolution hinges upon the distribution of dominance and sex-specific fitness effects of LOF mutations, which we discuss."}],"intvolume":" 42","OA_place":"publisher","publication":"Molecular Biology and Evolution","OA_type":"gold","quality_controlled":"1","day":"01"},{"date_updated":"2025-12-01T12:35:24Z","external_id":{"isi":["001556459900031"]},"department":[{"_id":"DaAl"}],"_id":"20224","file":[{"creator":"dernst","file_id":"20273","file_name":"2025_GECCO_Martynov.pdf","file_size":608996,"checksum":"7e513fa508cff7e8a0d33f50b1fe09af","date_updated":"2025-09-02T07:41:13Z","access_level":"open_access","success":1,"content_type":"application/pdf","date_created":"2025-09-02T07:41:13Z","relation":"main_file"}],"oa_version":"Published Version","file_date_updated":"2025-09-02T07:41:13Z","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1145/3712256.3726425","publisher":"Association for Computing Machinery","type":"conference","conference":{"start_date":"2025-07-14","name":"GECCO: Genetic and evolutionary computation conference","location":"Malaga, Spain","end_date":"2025-07-18"},"year":"2025","ddc":["000"],"date_published":"2025-07-13T00:00:00Z","status":"public","date_created":"2025-08-24T22:01:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","day":"13","publication_status":"published","title":"In the search of optimal tree networks: Hardness and heuristics","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Traffic in datacenters may follow some pattern: some pairs of servers communicate more frequently than others. Demand-oblivious networks may perform poorly for such workloads, and demand-aware networks optimized for traffic should be used instead. Unfortunately, not all shapes of networks are feasible in real hardware. Practical limitations are usually provided in the form of a topology. For example, a network may be required to be a binary tree, a bounded-degree graph or a Fat tree.\r\nIn this work, we consider a topology of a binary tree, one of the most fundamental network topologies. We show that already finding an optimal demand-aware binary tree network is NP-hard. Then, we explore how various optimization techniques, including simple local searches, as well as deterministic mutation and crossover operators, cope with generating efficient tree networks on real-life and synthetic workloads."}],"OA_place":"publisher","publication":"Proceedings of the 2025 Genetic and Evolutionary Computation Conference","OA_type":"hybrid","publication_identifier":{"isbn":["9798400714658"]},"month":"07","scopus_import":"1","article_processing_charge":"Yes (in subscription journal)","citation":{"ieee":"P. Martynov, M. Buzdalov, S. Pankratov, V. Aksenov, and S. Schmid, “In the search of optimal tree networks: Hardness and heuristics,” in Proceedings of the 2025 Genetic and Evolutionary Computation Conference, Malaga, Spain, 2025, pp. 249–257.","mla":"Martynov, Pavel, et al. “In the Search of Optimal Tree Networks: Hardness and Heuristics.” Proceedings of the 2025 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2025, pp. 249–57, doi:10.1145/3712256.3726425.","short":"P. Martynov, M. Buzdalov, S. Pankratov, V. Aksenov, S. Schmid, in:, Proceedings of the 2025 Genetic and Evolutionary Computation Conference, Association for Computing Machinery, 2025, pp. 249–257.","ista":"Martynov P, Buzdalov M, Pankratov S, Aksenov V, Schmid S. 2025. In the search of optimal tree networks: Hardness and heuristics. Proceedings of the 2025 Genetic and Evolutionary Computation Conference. GECCO: Genetic and evolutionary computation conference, 249–257.","chicago":"Martynov, Pavel, Maxim Buzdalov, Sergei Pankratov, Vitaliy Aksenov, and Stefan Schmid. “In the Search of Optimal Tree Networks: Hardness and Heuristics.” In Proceedings of the 2025 Genetic and Evolutionary Computation Conference, 249–57. Association for Computing Machinery, 2025. https://doi.org/10.1145/3712256.3726425.","apa":"Martynov, P., Buzdalov, M., Pankratov, S., Aksenov, V., & Schmid, S. (2025). In the search of optimal tree networks: Hardness and heuristics. In Proceedings of the 2025 Genetic and Evolutionary Computation Conference (pp. 249–257). Malaga, Spain: Association for Computing Machinery. https://doi.org/10.1145/3712256.3726425","ama":"Martynov P, Buzdalov M, Pankratov S, Aksenov V, Schmid S. In the search of optimal tree networks: Hardness and heuristics. In: Proceedings of the 2025 Genetic and Evolutionary Computation Conference. Association for Computing Machinery; 2025:249-257. doi:10.1145/3712256.3726425"},"isi":1,"page":"249-257","language":[{"iso":"eng"}],"author":[{"first_name":"Pavel","last_name":"Martynov","full_name":"Martynov, Pavel"},{"last_name":"Buzdalov","first_name":"Maxim","full_name":"Buzdalov, Maxim"},{"id":"f773bf05-72ef-11ef-b75a-a383d22f454b","first_name":"Sergei","last_name":"Pankratov","full_name":"Pankratov, Sergei"},{"last_name":"Aksenov","first_name":"Vitaliy","full_name":"Aksenov, Vitaliy"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"acknowledgement":"Research was supported by the German Research Foundation (DFG), grant 470029389 (FlexNets).","oa":1},{"volume":15932,"scopus_import":"1","month":"07","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031986789"],"issn":["0302-9743"]},"arxiv":1,"acknowledgement":"This work was supported in part by the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant (Project ID:22-SIS-SMU-100) and the ERC project ERC-2020-AdG 101020093.","oa":1,"page":"29-55","isi":1,"article_processing_charge":"Yes (in subscription journal)","citation":{"mla":"Henzinger, Thomas A., et al. “Supermartingale Certificates for Quantitative Omega-Regular Verification and Control.” 37th International Conference on Computer Aided Verification, vol. 15932, Springer Nature, 2025, pp. 29–55, doi:10.1007/978-3-031-98679-6_2.","ieee":"T. A. Henzinger, K. Mallik, P. Sadeghi, and D. Zikelic, “Supermartingale certificates for quantitative omega-regular verification and control,” in 37th International Conference on Computer Aided Verification, Zagreb, Croatia, 2025, vol. 15932, pp. 29–55.","short":"T.A. Henzinger, K. Mallik, P. Sadeghi, D. Zikelic, in:, 37th International Conference on Computer Aided Verification, Springer Nature, 2025, pp. 29–55.","ista":"Henzinger TA, Mallik K, Sadeghi P, Zikelic D. 2025. Supermartingale certificates for quantitative omega-regular verification and control. 37th International Conference on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 15932, 29–55.","chicago":"Henzinger, Thomas A, Kaushik Mallik, Pouya Sadeghi, and Dorde Zikelic. “Supermartingale Certificates for Quantitative Omega-Regular Verification and Control.” In 37th International Conference on Computer Aided Verification, 15932:29–55. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-98679-6_2.","ama":"Henzinger TA, Mallik K, Sadeghi P, Zikelic D. Supermartingale certificates for quantitative omega-regular verification and control. In: 37th International Conference on Computer Aided Verification. Vol 15932. Springer Nature; 2025:29-55. doi:10.1007/978-3-031-98679-6_2","apa":"Henzinger, T. A., Mallik, K., Sadeghi, P., & Zikelic, D. (2025). Supermartingale certificates for quantitative omega-regular verification and control. In 37th International Conference on Computer Aided Verification (Vol. 15932, pp. 29–55). Zagreb, Croatia: Springer Nature. https://doi.org/10.1007/978-3-031-98679-6_2"},"author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik","last_name":"Mallik","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"},{"first_name":"Pouya","last_name":"Sadeghi","full_name":"Sadeghi, Pouya"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"language":[{"iso":"eng"}],"quality_controlled":"1","day":"22","OA_type":"hybrid","ec_funded":1,"has_accepted_license":"1","publication_status":"published","title":"Supermartingale certificates for quantitative omega-regular verification and control","OA_place":"publisher","publication":"37th International Conference on Computer Aided Verification","abstract":[{"text":"We present the first supermartingale certificate for quantitative \r\n-regular properties of discrete-time infinite-state stochastic systems. Our certificate is defined on the product of the stochastic system and a limit-deterministic Büchi automaton that specifies the property of interest; hence we call it a limit-deterministic Büchi supermartingale (LDBSM). Previously known supermartingale certificates applied only to quantitative reachability, safety, or reach-avoid properties, and to qualitative (i.e., probability 1) \r\n-regular properties.We also present fully automated algorithms for the template-based synthesis of LDBSMs, for the case when the stochastic system dynamics and the controller can be represented in terms of polynomial inequalities. Our experiments demonstrate the ability of our method to solve verification and control tasks for stochastic systems that were beyond the reach of previous supermartingale-based approaches.","lang":"eng"}],"intvolume":" 15932","conference":{"start_date":"2025-07-23","name":"CAV: Computer Aided Verification","end_date":"2025-07-25","location":"Zagreb, Croatia"},"year":"2025","ddc":["000"],"type":"conference","publisher":"Springer Nature","date_created":"2025-08-24T22:01:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2025-07-22T00:00:00Z","department":[{"_id":"ToHe"}],"date_updated":"2025-12-01T12:34:41Z","external_id":{"isi":["001562506600002"],"arxiv":["2505.18833"]},"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1007/978-3-031-98679-6_2","alternative_title":["LNCS"],"_id":"20225","file":[{"success":1,"content_type":"application/pdf","date_created":"2025-09-02T07:34:33Z","relation":"main_file","file_id":"20272","file_size":884831,"file_name":"2025_CAV_HenzingerT.pdf","creator":"dernst","date_updated":"2025-09-02T07:34:33Z","access_level":"open_access","checksum":"beb1e2637de5b2268cc2262119439113"}],"file_date_updated":"2025-09-02T07:34:33Z","oa_version":"Published Version"},{"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"doi":"10.15479/AT-ISTA-20242","file":[{"checksum":"055044b03f835cb98c45d0504f1db96e","access_level":"open_access","date_updated":"2025-08-31T15:09:44Z","creator":"pschanda","file_name":"Abstracts.zip","file_size":42368943,"file_id":"20244","relation":"main_file","date_created":"2025-08-31T15:09:44Z","content_type":"application/zip","success":1},{"date_updated":"2025-08-31T15:11:58Z","access_level":"open_access","checksum":"1492683af736ac65088b77e12b52c3b0","file_id":"20245","file_name":"data_CO2_conferences.zip","file_size":470659,"creator":"pschanda","relation":"main_file","content_type":"application/zip","success":1,"date_created":"2025-08-31T15:11:58Z"},{"creator":"pschanda","file_id":"20246","file_name":"Figure6_predictions.zip","file_size":1138772,"checksum":"8ac69071f7508e77b5ca91fa5018339a","date_updated":"2025-08-31T15:12:03Z","access_level":"open_access","success":1,"content_type":"application/zip","date_created":"2025-08-31T15:12:03Z","relation":"main_file"},{"creator":"pschanda","file_id":"20247","file_name":"ExcelFileAnalysisCode.py","file_size":6558,"checksum":"19b77db247feecdc36fbe6f68d94a76d","date_updated":"2025-08-31T15:12:07Z","access_level":"open_access","success":1,"content_type":"text/x-python-script","date_created":"2025-08-31T15:12:07Z","relation":"main_file"},{"content_type":"application/pdf","success":1,"date_created":"2025-08-31T15:12:11Z","relation":"main_file","creator":"pschanda","file_id":"20248","file_size":1107467,"file_name":"emissions_spectrometers_and_Parisgoal.pdf","checksum":"39655e28c6df523f4f9662dc58c94623","date_updated":"2025-08-31T15:12:11Z","access_level":"open_access"},{"checksum":"2e9a9460b3f2abe7e46179561a63492b","access_level":"open_access","date_updated":"2025-09-01T11:05:27Z","creator":"pschanda","file_name":"README","file_size":3994,"file_id":"20263","relation":"main_file","date_created":"2025-09-01T11:05:27Z","content_type":"application/octet-stream","success":1}],"_id":"20242","corr_author":"1","title":"Data of: \"Quantifying the carbon footprint of conference travel: the case of NMR meetings\"","has_accepted_license":"1","abstract":[{"lang":"eng","text":"This repository contains calculations of carbon footprints of NMR conferences, as described in the article by \r\nLucky N. Kapoor, Natalia Ruzickova, Predrag Živadinović, Valentin Leitner, Maria Anna Sisak, Cecelia Mweka, Jeroen Dobbelaere, Georgios Katsaros, and Paul Schanda\r\nPublished in Magnetic Resonance, 2025."}],"oa_version":"Published Version","file_date_updated":"2025-09-01T11:05:27Z","department":[{"_id":"PaSc"}],"related_material":{"record":[{"status":"public","id":"20664","relation":"used_in_publication"}]},"date_updated":"2026-06-10T08:45:12Z","keyword":["sustainability","conference travel"],"date_created":"2025-08-31T15:14:18Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","oa":1,"date_published":"2025-09-01T00:00:00Z","citation":{"mla":"Schanda, Paul. Data of: “Quantifying the Carbon Footprint of Conference Travel: The Case of NMR Meetings.” Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20242.","ieee":"P. Schanda, “Data of: ‘Quantifying the carbon footprint of conference travel: the case of NMR meetings.’” Institute of Science and Technology Austria, 2025.","short":"P. Schanda, (2025).","apa":"Schanda, P. (2025). Data of: “Quantifying the carbon footprint of conference travel: the case of NMR meetings.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20242","ama":"Schanda P. Data of: “Quantifying the carbon footprint of conference travel: the case of NMR meetings.” 2025. doi:10.15479/AT-ISTA-20242","chicago":"Schanda, Paul. “Data of: ‘Quantifying the Carbon Footprint of Conference Travel: The Case of NMR Meetings.’” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20242.","ista":"Schanda P. 2025. Data of: ‘Quantifying the carbon footprint of conference travel: the case of NMR meetings’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-20242."},"contributor":[{"contributor_type":"researcher","last_name":"Ruzickova","first_name":"Natalia","id":"D2761128-D73D-11E9-A1BF-BA0DE6697425"},{"contributor_type":"researcher","last_name":"Kapoor","id":"84b9700b-15b2-11ec-abd3-831089e67615","first_name":"Lucky"},{"last_name":"Leitner","first_name":"Valentin","id":"4c665ce3-0016-11ec-bea0-e44de7a4fa3d","contributor_type":"researcher"},{"id":"68AA0E5A-AFDA-11E9-9994-141DE6697425","first_name":"Predrag","last_name":"Zivadinovic","contributor_type":"researcher"},{"last_name":"Sisak","first_name":"Maria A","id":"44A03D04-AEA4-11E9-B225-EA2DE6697425","contributor_type":"researcher"},{"last_name":"Mweka","id":"2a69ab4b-896a-11ed-bdf8-cb8641cf2b21","first_name":"Cecelia N","contributor_type":"researcher"},{"contributor_type":"supervisor","last_name":"Dobbelaere","id":"c15a5412-de82-11ed-b809-8dc1aa996e40","first_name":"Jeroen A"},{"orcid":"0000-0001-8342-202X","contributor_type":"supervisor","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"}],"article_processing_charge":"No","status":"public","author":[{"last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul"}],"month":"09","year":"2025","publisher":"Institute of Science and Technology Austria","type":"research_data"},{"date_updated":"2025-09-30T14:28:05Z","external_id":{"arxiv":["2501.12986"],"isi":["001553472000001"]},"department":[{"_id":"ZoHa"}],"_id":"20250","file":[{"file_name":"2025_MonthlyNoticesRAS_Sullivan.pdf","file_size":2780496,"file_id":"20279","creator":"dernst","access_level":"open_access","date_updated":"2025-09-03T05:44:47Z","checksum":"2a06796b27da0b33d479dba170ba4b3f","date_created":"2025-09-03T05:44:47Z","success":1,"content_type":"application/pdf","relation":"main_file"}],"DOAJ_listed":"1","file_date_updated":"2025-09-03T05:44:47Z","oa_version":"Published Version","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1093/mnras/staf1269","PlanS_conform":"1","article_type":"original","type":"journal_article","publisher":"Oxford University Press","year":"2025","ddc":["520"],"issue":"2","status":"public","date_published":"2025-09-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2025-08-31T22:01:31Z","quality_controlled":"1","day":"01","has_accepted_license":"1","publication_status":"published","title":"Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback?","OA_place":"publisher","publication":"Monthly Notices of the Royal Astronomical Society","abstract":[{"lang":"eng","text":"Population III stars are possible precursors to early supermassive black holes (BHs). The presence of soft UV Lyman–Werner (LW) background radiation can suppress Population III star formation in minihaloes and allow them to form in pristine atomic-cooling haloes. In the absence of molecular hydrogen (H2) cooling, atomic-cooling haloes enable rapid collapse with suppressed fragmentation. High background LW fluxes from preceding star-formation have been proposed to dissociate H2. This flux can be supplemented by LW radiation from one or more Population III star(s) in the same halo, reducing the necessary background level. Here, we consider atomic-cooling haloes in which multiple protostellar cores form close to one another nearly simultaneously. We assess whether the first star’s LW radiation can dissociate nearby \r\n, enabling rapid accretion on to a nearby protostellar core, and the prompt formation of a second, supermassive star (SMS) from warm, atomically-cooled gas. We use a set of hydrodynamical simulations with the code enzo, with identical LW backgrounds centred on a halo with two adjacent collapsing gas clumps. When an additional large local LW flux is introduced, we observe immediate reductions in both the accretion rates and the stellar masses that form within these clumps. While the LW flux reduces the H2 fraction and increases the gas temperature, the halo core’s potential well is too shallow to promptly heat the gas to >1000 K and increase the second protostar’s accretion rate. We conclude that this internal LW feedback scenario is unlikely to facilitate SMS or massive BH seed formation."}],"intvolume":" 542","OA_type":"gold","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"volume":542,"month":"09","scopus_import":"1","page":"822-838","citation":{"short":"J. Sullivan, Z. Haiman, M. Kulkarni, E. Visbal, Monthly Notices of the Royal Astronomical Society 542 (2025) 822–838.","ista":"Sullivan J, Haiman Z, Kulkarni M, Visbal E. 2025. Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. 542(2), 822–838.","chicago":"Sullivan, James, Zoltán Haiman, Mihir Kulkarni, and Eli Visbal. “Can Supermassive Stars Form in Protogalaxies Due to Internal Lyman-Werner Feedback?” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2025. https://doi.org/10.1093/mnras/staf1269.","ama":"Sullivan J, Haiman Z, Kulkarni M, Visbal E. Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. 2025;542(2):822-838. doi:10.1093/mnras/staf1269","apa":"Sullivan, J., Haiman, Z., Kulkarni, M., & Visbal, E. (2025). Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback? Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/staf1269","ieee":"J. Sullivan, Z. Haiman, M. Kulkarni, and E. Visbal, “Can supermassive stars form in protogalaxies due to internal Lyman-Werner feedback?,” Monthly Notices of the Royal Astronomical Society, vol. 542, no. 2. Oxford University Press, pp. 822–838, 2025.","mla":"Sullivan, James, et al. “Can Supermassive Stars Form in Protogalaxies Due to Internal Lyman-Werner Feedback?” Monthly Notices of the Royal Astronomical Society, vol. 542, no. 2, Oxford University Press, 2025, pp. 822–38, doi:10.1093/mnras/staf1269."},"isi":1,"article_processing_charge":"Yes","author":[{"full_name":"Sullivan, James","first_name":"James","last_name":"Sullivan"},{"orcid":"0000-0003-3633-5403","full_name":"Haiman, Zoltán","last_name":"Haiman","first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36"},{"first_name":"Mihir","last_name":"Kulkarni","full_name":"Kulkarni, Mihir"},{"full_name":"Visbal, Eli","last_name":"Visbal","first_name":"Eli"}],"language":[{"iso":"eng"}],"arxiv":1,"acknowledgement":"We thank the anonymous referee for comments that helped us improve the clarity of this manuscript. We acknowledge support from the United States National Science Foundation (NSF) grant AST-2006176 and the National Aeronautics and Space Administration (NASA) grants 80NSSC24K0440 and 80NSSC22K0822 (ZH). We also acknowledge support from NSF grant AST-2009309, NASA Astrophysics Theory Program grant 80NSSC22K0629, and Space Telescope Science Institute grant JWST-AR-05238 (EV). The simulations in this work were run on Texas Advanced Computing Center’s Stampede2 and Stampede3 systems. We used Stampede2 and Purdue University’s computing system Anvil for data analysis.","oa":1},{"department":[{"_id":"RoSe"}],"date_updated":"2025-09-30T14:27:35Z","external_id":{"arxiv":["2410.20113"],"isi":["001558641300006"]},"doi":"10.1007/s00526-025-03062-x","_id":"20251","article_number":"226","oa_version":"Preprint","year":"2025","issue":"7","publisher":"Springer Nature","type":"journal_article","article_type":"original","date_created":"2025-08-31T22:01:31Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2025-09-01T00:00:00Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.20113"}],"quality_controlled":"1","day":"01","OA_type":"green","title":"Stability estimate for the Lane–Emden inequality","publication_status":"published","intvolume":" 64","abstract":[{"text":"The Lane–Emden inequality controls (math. formular) in terms of the L^1 and L^p norms of p. We provide a remainder estimate for this inequality in terms of a suitable distance of p to the manifold of optimizers.","lang":"eng"}],"OA_place":"repository","publication":"Calculus of Variations and Partial Differential Equations","month":"09","scopus_import":"1","volume":64,"publication_identifier":{"eissn":["1432-0835"],"issn":["0944-2669"]},"acknowledgement":"We are grateful to Rupert Frank and Enno Lenzmann for helpful discussions.","arxiv":1,"oa":1,"article_processing_charge":"No","isi":1,"citation":{"ieee":"E. Carlen, M. Lewin, E. H. Lieb, and R. Seiringer, “Stability estimate for the Lane–Emden inequality,” Calculus of Variations and Partial Differential Equations, vol. 64, no. 7. Springer Nature, 2025.","mla":"Carlen, Eric, et al. “Stability Estimate for the Lane–Emden Inequality.” Calculus of Variations and Partial Differential Equations, vol. 64, no. 7, 226, Springer Nature, 2025, doi:10.1007/s00526-025-03062-x.","chicago":"Carlen, Eric, Mathieu Lewin, Elliott H. Lieb, and Robert Seiringer. “Stability Estimate for the Lane–Emden Inequality.” Calculus of Variations and Partial Differential Equations. Springer Nature, 2025. https://doi.org/10.1007/s00526-025-03062-x.","ista":"Carlen E, Lewin M, Lieb EH, Seiringer R. 2025. Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. 64(7), 226.","ama":"Carlen E, Lewin M, Lieb EH, Seiringer R. Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. 2025;64(7). doi:10.1007/s00526-025-03062-x","apa":"Carlen, E., Lewin, M., Lieb, E. H., & Seiringer, R. (2025). Stability estimate for the Lane–Emden inequality. Calculus of Variations and Partial Differential Equations. Springer Nature. https://doi.org/10.1007/s00526-025-03062-x","short":"E. Carlen, M. Lewin, E.H. Lieb, R. Seiringer, Calculus of Variations and Partial Differential Equations 64 (2025)."},"language":[{"iso":"eng"}],"author":[{"first_name":"Eric","last_name":"Carlen","full_name":"Carlen, Eric"},{"last_name":"Lewin","first_name":"Mathieu","full_name":"Lewin, Mathieu"},{"last_name":"Lieb","first_name":"Elliott H.","full_name":"Lieb, Elliott H."},{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}]},{"publisher":"American Chemical Society","article_type":"original","type":"journal_article","acknowledged_ssus":[{"_id":"EM-Fac"}],"issue":"33","year":"2025","date_published":"2025-08-26T00:00:00Z","status":"public","date_created":"2025-08-31T22:01:31Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001550173000001"]},"date_updated":"2025-09-30T14:27:03Z","department":[{"_id":"MaIb"}],"oa_version":"Preprint","_id":"20252","doi":"10.1021/acsnano.5c09137","publication_identifier":{"eissn":["1936-086X"]},"scopus_import":"1","month":"08","volume":19,"language":[{"iso":"eng"}],"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"author":[{"first_name":"Nico","last_name":"Reichholf","full_name":"Reichholf, Nico"},{"last_name":"Horta","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona"},{"full_name":"Van Der Heggen, David","last_name":"Van Der Heggen","first_name":"David"},{"first_name":"Carlotta","last_name":"Seno","full_name":"Seno, Carlotta"},{"first_name":"Jikson","last_name":"Pulparayil Mathew","full_name":"Pulparayil Mathew, Jikson"},{"orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria"},{"full_name":"Smet, Philippe F.","first_name":"Philippe F.","last_name":"Smet"},{"last_name":"De Roo","first_name":"Jonathan","full_name":"De Roo, Jonathan"}],"citation":{"short":"N. Reichholf, S. Horta, D. Van Der Heggen, C. Seno, J. Pulparayil Mathew, M. Ibáñez, P.F. Smet, J. De Roo, ACS Nano 19 (2025) 30371–30382.","ama":"Reichholf N, Horta S, Van Der Heggen D, et al. Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. 2025;19(33):30371-30382. doi:10.1021/acsnano.5c09137","apa":"Reichholf, N., Horta, S., Van Der Heggen, D., Seno, C., Pulparayil Mathew, J., Ibáñez, M., … De Roo, J. (2025). Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. American Chemical Society. https://doi.org/10.1021/acsnano.5c09137","ista":"Reichholf N, Horta S, Van Der Heggen D, Seno C, Pulparayil Mathew J, Ibáñez M, Smet PF, De Roo J. 2025. Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals. ACS Nano. 19(33), 30371–30382.","chicago":"Reichholf, Nico, Sharona Horta, David Van Der Heggen, Carlotta Seno, Jikson Pulparayil Mathew, Maria Ibáñez, Philippe F. Smet, and Jonathan De Roo. “Identification and Elimination of Surface Emission in Lanthanide (Co)Doped Zirconia Nanocrystals.” ACS Nano. American Chemical Society, 2025. https://doi.org/10.1021/acsnano.5c09137.","mla":"Reichholf, Nico, et al. “Identification and Elimination of Surface Emission in Lanthanide (Co)Doped Zirconia Nanocrystals.” ACS Nano, vol. 19, no. 33, American Chemical Society, 2025, pp. 30371–82, doi:10.1021/acsnano.5c09137.","ieee":"N. Reichholf et al., “Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals,” ACS Nano, vol. 19, no. 33. American Chemical Society, pp. 30371–30382, 2025."},"isi":1,"article_processing_charge":"No","page":"30371-30382","oa":1,"acknowledgement":"N.R. and C.S. thank the SNSF Eccellenza funding scheme (Project 194172) for funding. D.V.d.H. is supported by the Research Foundation Flanders (FWO) through a Senior Postdoctoral Research Fellowship (N° 1237825N). P.F.S. acknowledges the Special Research Fund at UGent (bof/baf/4y/2024/01/037). M.I. acknowledges financial support from ISTA and the Werner Siemens Foundation. This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by the electron microscopy facility (EMF). We thank Tommaso Costanzo for providing assistance during STEM measurements. We acknowledge DESY (Hamburg, Germany), a member of the Helmholtz Association HGF, for the provision of experimental facilities. Parts of this research were carried out using beamline P21.1 at PETRA III, and the authors thank Ann-Christin Dippel, Jiatu Liu, and Fernando Igoa for assistance in using the beamline for PDF acquisition (Proposal I-20231114 EC). The authors thank Daniel Häussinger for help with the analysis of NMR spectra.","day":"26","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.26434/chemrxiv-2025-r1gw4","open_access":"1"}],"abstract":[{"text":"Zirconia nanocrystals (ZrO2 NCs) are a stable host material for lanthanides, but their performance lags behind that of the leading NaYF4 nanomaterials. Here, we leverage surface chemistry and core/shell architectures to uncover the contribution of dopants at the nanocrystal surface and of dopants in the nanocrystal bulk. We first assess the doping efficiency by ICP and find that, while Eu is almost quantitatively incorporated, the other lanthanides (La, Ce, Tb, Tm, Er, Yb) have about 50% incorporation efficiency over the studied doping range of 1–10%. We then determine the nanocrystal surface chemistry using NMR spectroscopy, despite the additional spectral line broadening caused by the paramagnetic lanthanide dopants. By varying the surface ligands and measuring the photoluminescence, we resolve the spectroscopic signals that are sensitive to a change in surface chemistry. Time-resolved emission spectra further reinforce the notion of a bulk component with a long luminescent lifetime and a surface component with a fast lifetime. Upon shelling Eu- or Tb-doped zirconia NCs with pure zirconia, the surface component disappears, and the photoluminescence quantum yield increases. We further functionalized the surface of the core/shell particles with oleylphosphonic acid ligands to obtain excellent dispersibility. These results show that lanthanide-doped zirconia NCs can be engineered to eliminate deactivation pathways.","lang":"eng"}],"intvolume":" 19","publication":"ACS Nano","OA_place":"repository","title":"Identification and elimination of surface emission in lanthanide (Co)doped zirconia nanocrystals","publication_status":"published","OA_type":"green"},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","conference":{"name":"CONCUR: Conference on Concurrency Theory","start_date":"2025-08-26","end_date":"2025-08-29","location":"Aarhus, Denmark"},"year":"2025","ddc":["000"],"date_published":"2025-08-18T00:00:00Z","status":"public","date_created":"2025-08-31T22:01:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-12-01T12:36:52Z","external_id":{"isi":["001570540800021"],"arxiv":["2506.0515"]},"department":[{"_id":"ToHe"}],"file":[{"relation":"main_file","date_created":"2025-09-03T10:01:53Z","success":1,"content_type":"application/pdf","checksum":"9d4054058757a73477e6015b10ed6996","access_level":"open_access","date_updated":"2025-09-03T10:01:53Z","creator":"dernst","file_size":1257397,"file_name":"2025_CONCUR_HenzingerT.pdf","file_id":"20282"}],"_id":"20253","article_number":"21","alternative_title":["LIPIcs"],"oa_version":"Published Version","file_date_updated":"2025-09-03T10:01:53Z","doi":"10.4230/LIPIcs.CONCUR.2025.21","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773898"]},"month":"08","scopus_import":"1","volume":348,"article_processing_charge":"No","isi":1,"citation":{"ieee":"T. A. Henzinger, P. Kebis, N. A. Mazzocchi, and N. E. Sarac, “Quantitative language automata,” in 36th International Conference on Concurrency Theory, Aarhus, Denmark, 2025, vol. 348.","mla":"Henzinger, Thomas A., et al. “Quantitative Language Automata.” 36th International Conference on Concurrency Theory, vol. 348, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.CONCUR.2025.21.","ista":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. 2025. Quantitative language automata. 36th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 348, 21.","chicago":"Henzinger, Thomas A, Pavol Kebis, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Quantitative Language Automata.” In 36th International Conference on Concurrency Theory, Vol. 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21.","ama":"Henzinger TA, Kebis P, Mazzocchi NA, Sarac NE. Quantitative language automata. In: 36th International Conference on Concurrency Theory. Vol 348. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.CONCUR.2025.21","apa":"Henzinger, T. A., Kebis, P., Mazzocchi, N. A., & Sarac, N. E. (2025). Quantitative language automata. In 36th International Conference on Concurrency Theory (Vol. 348). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2025.21","short":"T.A. Henzinger, P. Kebis, N.A. Mazzocchi, N.E. Sarac, in:, 36th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025."},"language":[{"iso":"eng"}],"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Kebis, Pavol","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol","last_name":"Kebis"},{"full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","first_name":"Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","arxiv":1,"oa":1,"quality_controlled":"1","day":"18","publication_status":"published","corr_author":"1","title":"Quantitative language automata","has_accepted_license":"1","intvolume":" 348","abstract":[{"lang":"eng","text":"A quantitative word automaton (QWA) defines a function from infinite words to values. For example, every infinite run of a limit-average QWA 𝒜 obtains a mean payoff, and every word w ∈ Σ^ω is assigned the maximal mean payoff obtained by nondeterministic runs of 𝒜 over w. We introduce quantitative language automata (QLAs) that define functions from language generators (i.e., implementations) to values, where a language generator can be nonprobabilistic, defining a set of infinite words, or probabilistic, defining a probability measure over infinite words. A QLA consists of a QWA and an aggregator function. For example, given a QWA 𝒜, the infimum aggregator maps each language L ⊆ Σ^ω to the greatest lower bound assigned by 𝒜 to any word in L. For boolean value sets, QWAs define boolean properties of traces, and QLAs define boolean properties of sets of traces, i.e., hyperproperties. For more general value sets, QLAs serve as a specification language for a generalization of hyperproperties, called quantitative hyperproperties. A nonprobabilistic (resp. probabilistic) quantitative hyperproperty assigns a value to each set (resp. distribution) G of traces, e.g., the minimal (resp. expected) average response time exhibited by the traces in G. We give several examples of quantitative hyperproperties and investigate three paradigmatic problems for QLAs: evaluation, nonemptiness, and universality. In the evaluation problem, given a QLA 𝔸 and an implementation G, we ask for the value that 𝔸 assigns to G. In the nonemptiness (resp. universality) problem, given a QLA 𝔸 and a value k, we ask whether 𝔸 assigns at least k to some (resp. every) language. We provide a comprehensive picture of decidability for these problems for QLAs with common aggregators as well as their restrictions to ω-regular languages and trace distributions generated by finite-state Markov chains."}],"OA_place":"publisher","publication":"36th International Conference on Concurrency Theory","OA_type":"gold","ec_funded":1},{"day":"01","quality_controlled":"1","publication":"PNAS Nexus","OA_place":"publisher","intvolume":" 4","abstract":[{"text":"We examine population structures for their ability to maintain diversity in neutral evolution. We use the general framework of evolutionary graph theory and consider birth–death (bd) and death–birth (db) updating. The population is of size N. Initially all individuals represent different types. The basic question is: what is the time TN until one type takes over the population? This time is known as consensus time in computer science and as total coalescent time in evolutionary biology. For the complete graph, it is known that TN is quadratic in N for db and bd. For the cycle, we prove that TN is cubic in N for db and bd. For the star, we prove that TN is cubic for bd and quasilinear (N log N) for db. For the double star, we show that TN is quartic for bd. We derive upper and lower bounds for all undirected graphs for bd and db. We also show the Pareto front of graphs (of size N = 8) that maintain diversity the longest for bd and db. Further, we show that some graphs that quickly homogenize can maintain high levels of diversity longer than graphs that slowly homogenize. For directed graphs, we give simple contracting star-like structures that have superexponential time scales for maintaining diversity.","lang":"eng"}],"has_accepted_license":"1","publication_status":"published","title":"Maintaining diversity in structured populations","ec_funded":1,"OA_type":"gold","publication_identifier":{"eissn":["2752-6542"]},"volume":4,"month":"08","scopus_import":"1","author":[{"full_name":"Brewster, David A.","last_name":"Brewster","first_name":"David A."},{"orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"full_name":"Roscow, Dylan","last_name":"Roscow","first_name":"Dylan"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec"},{"full_name":"Nowak, Martin A.","first_name":"Martin A.","last_name":"Nowak"}],"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"language":[{"iso":"eng"}],"article_processing_charge":"Yes","citation":{"ieee":"D. A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, and M. A. Nowak, “Maintaining diversity in structured populations,” PNAS Nexus, vol. 4, no. 8. Oxford University Press, 2025.","mla":"Brewster, David A., et al. “Maintaining Diversity in Structured Populations.” PNAS Nexus, vol. 4, no. 8, pgaf252, Oxford University Press, 2025, doi:10.1093/pnasnexus/pgaf252.","short":"D.A. Brewster, J. Svoboda, D. Roscow, K. Chatterjee, J. Tkadlec, M.A. Nowak, PNAS Nexus 4 (2025).","chicago":"Brewster, David A., Jakub Svoboda, Dylan Roscow, Krishnendu Chatterjee, Josef Tkadlec, and Martin A. Nowak. “Maintaining Diversity in Structured Populations.” PNAS Nexus. Oxford University Press, 2025. https://doi.org/10.1093/pnasnexus/pgaf252.","ista":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. 2025. Maintaining diversity in structured populations. PNAS Nexus. 4(8), pgaf252.","ama":"Brewster DA, Svoboda J, Roscow D, Chatterjee K, Tkadlec J, Nowak MA. Maintaining diversity in structured populations. PNAS Nexus. 2025;4(8). doi:10.1093/pnasnexus/pgaf252","apa":"Brewster, D. A., Svoboda, J., Roscow, D., Chatterjee, K., Tkadlec, J., & Nowak, M. A. (2025). Maintaining diversity in structured populations. PNAS Nexus. Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf252"},"oa":1,"arxiv":1,"acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12. J.T. was supported by GAČR grant 25-17377S and by Charles Univ. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","external_id":{"arxiv":["2503.09841"]},"date_updated":"2026-06-11T09:11:17Z","APC_amount":"4493,27 EUR","department":[{"_id":"KrCh"}],"DOAJ_listed":"1","file_date_updated":"2025-09-03T06:20:08Z","oa_version":"Published Version","_id":"20254","article_number":"pgaf252","file":[{"file_id":"20280","file_name":"2025_PNASNexus_Brewster.pdf","file_size":1086419,"creator":"dernst","date_updated":"2025-09-03T06:20:08Z","access_level":"open_access","checksum":"8a5e82c6f842e3220ec96028c9374b69","success":1,"content_type":"application/pdf","date_created":"2025-09-03T06:20:08Z","relation":"main_file"}],"PlanS_conform":"1","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.1093/pnasnexus/pgaf252","article_type":"original","type":"journal_article","publisher":"Oxford University Press","ddc":["000"],"issue":"8","year":"2025","status":"public","date_published":"2025-08-01T00:00:00Z","date_created":"2025-08-31T22:01:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","day":"01","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.21054","open_access":"1"}],"publication_status":"published","title":"The first billion years according to JWST","publication":"Nature Astronomy","OA_place":"repository","abstract":[{"lang":"eng","text":"With stunning clarity, the JWST has revealed the Universe’s first billion years. The scientific community is analysing a wealth of JWST imaging and spectroscopic data from that era, and is in the process of rewriting the astronomy textbooks. Here, as a result of the 2024 ISSI Breakthrough Workshop, we provide a snapshot of the great progress made towards understanding the initial chapters of our cosmic history 1.5 years into the JWST science mission. We present the current census of early galaxies, their luminosities, appearance, chemical composition, masses and formation histories as revealed by JWST. We relate the discovery of massive black holes in early galaxies and discuss their demographics and implications for their formations and growth. We conclude by describing the potential sources of reionization and our current understanding of how the Universe became fully ionized. Throughout the Perspective, we highlight discoveries and breakthroughs, topics and issues that are not yet understood, and questions that will be addressed in the coming years, as JWST continues its revolutionary observations of the early Universe."}],"intvolume":" 9","OA_type":"green","publication_identifier":{"eissn":["2397-3366"]},"volume":9,"month":"08","scopus_import":"1","page":"1134-1147","isi":1,"citation":{"mla":"Adamo, Angela, et al. “The First Billion Years According to JWST.” Nature Astronomy, vol. 9, no. 8, Springer Nature, 2025, pp. 1134–47, doi:10.1038/s41550-025-02624-5.","ieee":"A. Adamo et al., “The first billion years according to JWST,” Nature Astronomy, vol. 9, no. 8. Springer Nature, pp. 1134–1147, 2025.","apa":"Adamo, A., Atek, H., Bagley, M. B., Bañados, E., Barrow, K. S. S., Berg, D. A., … Nota, A. (2025). The first billion years according to JWST. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-025-02624-5","ama":"Adamo A, Atek H, Bagley MB, et al. The first billion years according to JWST. Nature Astronomy. 2025;9(8):1134-1147. doi:10.1038/s41550-025-02624-5","chicago":"Adamo, Angela, Hakim Atek, Micaela B. Bagley, Eduardo Bañados, Kirk S.S. Barrow, Danielle A. Berg, Rachel Bezanson, et al. “The First Billion Years According to JWST.” Nature Astronomy. Springer Nature, 2025. https://doi.org/10.1038/s41550-025-02624-5.","ista":"Adamo A, Atek H, Bagley MB, Bañados E, Barrow KSS, Berg DA, Bezanson R, Bradač M, Brammer G, Carnall AC, Chisholm J, Coe D, Dayal P, Eisenstein DJ, Eldridge JJ, Ferrara A, Fujimoto S, Graaff AD, Habouzit M, Hutchison TA, Kartaltepe JS, Kassin SA, Kriek M, Labbé I, Maiolino R, Marques-Chaves R, Maseda MV, Mason C, Matthee JJ, Mcquinn KBW, Meynet G, Naidu RP, Oesch PA, Pentericci L, Pérez-González PG, Rigby JR, Roberts-Borsani G, Schaerer D, Shapley AE, Stark DP, Stiavelli M, Strom AL, Vanzella E, Wang F, Wilkins SM, Williams CC, Willott CJ, Wylezalek D, Nota A. 2025. The first billion years according to JWST. Nature Astronomy. 9(8), 1134–1147.","short":"A. Adamo, H. Atek, M.B. Bagley, E. Bañados, K.S.S. Barrow, D.A. Berg, R. Bezanson, M. Bradač, G. Brammer, A.C. Carnall, J. Chisholm, D. Coe, P. Dayal, D.J. Eisenstein, J.J. Eldridge, A. Ferrara, S. Fujimoto, A.D. Graaff, M. Habouzit, T.A. Hutchison, J.S. Kartaltepe, S.A. Kassin, M. Kriek, I. Labbé, R. Maiolino, R. Marques-Chaves, M.V. Maseda, C. Mason, J.J. Matthee, K.B.W. Mcquinn, G. Meynet, R.P. Naidu, P.A. Oesch, L. Pentericci, P.G. Pérez-González, J.R. Rigby, G. Roberts-Borsani, D. Schaerer, A.E. Shapley, D.P. Stark, M. Stiavelli, A.L. Strom, E. Vanzella, F. Wang, S.M. Wilkins, C.C. Williams, C.J. Willott, D. Wylezalek, A. Nota, Nature Astronomy 9 (2025) 1134–1147."},"article_processing_charge":"No","author":[{"last_name":"Adamo","first_name":"Angela","full_name":"Adamo, Angela"},{"full_name":"Atek, Hakim","first_name":"Hakim","last_name":"Atek"},{"full_name":"Bagley, Micaela B.","last_name":"Bagley","first_name":"Micaela B."},{"last_name":"Bañados","first_name":"Eduardo","full_name":"Bañados, Eduardo"},{"full_name":"Barrow, Kirk S.S.","first_name":"Kirk S.S.","last_name":"Barrow"},{"first_name":"Danielle A.","last_name":"Berg","full_name":"Berg, Danielle A."},{"last_name":"Bezanson","first_name":"Rachel","full_name":"Bezanson, Rachel"},{"full_name":"Bradač, Maruša","first_name":"Maruša","last_name":"Bradač"},{"full_name":"Brammer, Gabriel","last_name":"Brammer","first_name":"Gabriel"},{"full_name":"Carnall, Adam C.","first_name":"Adam C.","last_name":"Carnall"},{"last_name":"Chisholm","first_name":"John","full_name":"Chisholm, John"},{"full_name":"Coe, Dan","first_name":"Dan","last_name":"Coe"},{"first_name":"Pratika","last_name":"Dayal","full_name":"Dayal, Pratika"},{"full_name":"Eisenstein, Daniel J.","last_name":"Eisenstein","first_name":"Daniel J."},{"last_name":"Eldridge","first_name":"Jan J.","full_name":"Eldridge, Jan J."},{"full_name":"Ferrara, Andrea","last_name":"Ferrara","first_name":"Andrea"},{"first_name":"Seiji","last_name":"Fujimoto","full_name":"Fujimoto, Seiji"},{"first_name":"Anna De","last_name":"Graaff","full_name":"Graaff, Anna De"},{"full_name":"Habouzit, Melanie","last_name":"Habouzit","first_name":"Melanie"},{"last_name":"Hutchison","first_name":"Taylor A.","full_name":"Hutchison, Taylor A."},{"full_name":"Kartaltepe, Jeyhan S.","first_name":"Jeyhan S.","last_name":"Kartaltepe"},{"first_name":"Susan A.","last_name":"Kassin","full_name":"Kassin, Susan A."},{"full_name":"Kriek, Mariska","last_name":"Kriek","first_name":"Mariska"},{"last_name":"Labbé","first_name":"Ivo","full_name":"Labbé, Ivo"},{"last_name":"Maiolino","first_name":"Roberto","full_name":"Maiolino, Roberto"},{"first_name":"Rui","last_name":"Marques-Chaves","full_name":"Marques-Chaves, Rui"},{"last_name":"Maseda","first_name":"Michael V.","full_name":"Maseda, Michael V."},{"last_name":"Mason","first_name":"Charlotte","full_name":"Mason, Charlotte"},{"orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","first_name":"Jorryt J"},{"first_name":"Kristen B.W.","last_name":"Mcquinn","full_name":"Mcquinn, Kristen B.W."},{"full_name":"Meynet, Georges","last_name":"Meynet","first_name":"Georges"},{"full_name":"Naidu, Rohan P.","last_name":"Naidu","first_name":"Rohan P."},{"full_name":"Oesch, Pascal A.","last_name":"Oesch","first_name":"Pascal A."},{"full_name":"Pentericci, Laura","first_name":"Laura","last_name":"Pentericci"},{"full_name":"Pérez-González, Pablo G.","last_name":"Pérez-González","first_name":"Pablo G."},{"last_name":"Rigby","first_name":"Jane R.","full_name":"Rigby, Jane R."},{"last_name":"Roberts-Borsani","first_name":"Guido","full_name":"Roberts-Borsani, Guido"},{"last_name":"Schaerer","first_name":"Daniel","full_name":"Schaerer, Daniel"},{"full_name":"Shapley, Alice E.","last_name":"Shapley","first_name":"Alice E."},{"full_name":"Stark, Daniel P.","first_name":"Daniel P.","last_name":"Stark"},{"full_name":"Stiavelli, Massimo","last_name":"Stiavelli","first_name":"Massimo"},{"last_name":"Strom","first_name":"Allison L.","full_name":"Strom, Allison L."},{"last_name":"Vanzella","first_name":"Eros","full_name":"Vanzella, Eros"},{"last_name":"Wang","first_name":"Feige","full_name":"Wang, Feige"},{"full_name":"Wilkins, Stephen M.","first_name":"Stephen M.","last_name":"Wilkins"},{"full_name":"Williams, Christina C.","first_name":"Christina C.","last_name":"Williams"},{"last_name":"Willott","first_name":"Chris J.","full_name":"Willott, Chris J."},{"first_name":"Dominika","last_name":"Wylezalek","full_name":"Wylezalek, Dominika"},{"full_name":"Nota, Antonella","last_name":"Nota","first_name":"Antonella"}],"language":[{"iso":"eng"}],"arxiv":1,"acknowledgement":"While this Perspective is written by a small number of authors, invited to ISSI Bern in March 2024 as part of the 2024 ISSI Breakthrough Workshop, we acknowledge the work of a large community that is advancing our collective understanding of the evolution of the early Universe. We thank ISSI for sponsoring the 2024 Breakthrough Workshop, and the ISSI staff for their wonderful welcome and support. We are grateful to the author collaborators, who made this paper possible. Collectively, we are grateful to the large group of committed scientists and engineers, worldwide, who designed, built and commissioned the JWST and made a decades-long astronomer dream a reality. R.P.N. is a NASA Hubble Fellow. We are grateful to M. Dickinson for a careful read of the final paper and to F. Crameri (ISSI) for his expert help designing the very best figures. We dedicate this paper to the 20,000 people who spent decades to make JWST an incredible discovery machine.","oa":1,"date_updated":"2025-09-30T14:28:42Z","external_id":{"arxiv":["2405.21054"],"isi":["001547681400001"]},"department":[{"_id":"JoMa"}],"_id":"20255","oa_version":"Preprint","doi":"10.1038/s41550-025-02624-5","article_type":"original","type":"journal_article","publisher":"Springer Nature","year":"2025","issue":"8","status":"public","date_published":"2025-08-01T00:00:00Z","date_created":"2025-08-31T22:01:32Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"type":"conference","publisher":"ML Research Press","ddc":["000"],"conference":{"end_date":"2025-06-06","location":"Ann Arbor, MI, United States","name":"L4DC: Learning for Dynamics & Control","start_date":"2025-06-04"},"year":"2025","status":"public","date_published":"2025-06-01T00:00:00Z","date_created":"2025-08-31T22:01:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2412.16564"]},"date_updated":"2025-09-03T10:37:59Z","department":[{"_id":"ToHe"},{"_id":"ChLa"}],"file_date_updated":"2025-09-03T10:32:12Z","oa_version":"Published Version","alternative_title":["PMLR"],"file":[{"content_type":"application/pdf","success":1,"date_created":"2025-09-03T10:32:12Z","relation":"main_file","file_id":"20283","file_size":489639,"file_name":"2025_L4DC_HenzingerT.pdf","creator":"dernst","date_updated":"2025-09-03T10:32:12Z","access_level":"open_access","checksum":"d5236e561560635f5ae1d17de4903033"}],"_id":"20256","publication_identifier":{"eissn":["2640-3498"]},"volume":283,"month":"06","scopus_import":"1","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"},{"full_name":"Kresse, Fabian","first_name":"Fabian","id":"faff3c84-23f6-11ef-9085-e5187b51c604","last_name":"Kresse"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","first_name":"Kaushik","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"},{"full_name":"Yu, Zhengqi","last_name":"Yu","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","first_name":"Zhengqi"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"page":"804-816","citation":{"ieee":"T. A. Henzinger, F. Kresse, K. Mallik, E. Yu, and D. Zikelic, “Predictive monitoring of black-box dynamical systems,” in 7th Annual Learning for Dynamics & Control Conference, Ann Arbor, MI, United States, 2025, vol. 283, pp. 804–816.","mla":"Henzinger, Thomas A., et al. “Predictive Monitoring of Black-Box Dynamical Systems.” 7th Annual Learning for Dynamics & Control Conference, vol. 283, ML Research Press, 2025, pp. 804–16.","short":"T.A. Henzinger, F. Kresse, K. Mallik, E. Yu, D. Zikelic, in:, 7th Annual Learning for Dynamics & Control Conference, ML Research Press, 2025, pp. 804–816.","ama":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. Predictive monitoring of black-box dynamical systems. In: 7th Annual Learning for Dynamics & Control Conference. Vol 283. ML Research Press; 2025:804-816.","apa":"Henzinger, T. A., Kresse, F., Mallik, K., Yu, E., & Zikelic, D. (2025). Predictive monitoring of black-box dynamical systems. In 7th Annual Learning for Dynamics & Control Conference (Vol. 283, pp. 804–816). Ann Arbor, MI, United States: ML Research Press.","ista":"Henzinger TA, Kresse F, Mallik K, Yu E, Zikelic D. 2025. Predictive monitoring of black-box dynamical systems. 7th Annual Learning for Dynamics & Control Conference. L4DC: Learning for Dynamics & Control, PMLR, vol. 283, 804–816.","chicago":"Henzinger, Thomas A, Fabian Kresse, Kaushik Mallik, Emily Yu, and Dorde Zikelic. “Predictive Monitoring of Black-Box Dynamical Systems.” In 7th Annual Learning for Dynamics & Control Conference, 283:804–16. ML Research Press, 2025."},"article_processing_charge":"No","oa":1,"arxiv":1,"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093.\r\n","day":"01","quality_controlled":"1","publication":"7th Annual Learning for Dynamics & Control Conference","OA_place":"publisher","abstract":[{"text":"We study the problem of predictive runtime monitoring of black-box dynamical systems with quantitative safety properties. The black-box setting stipulates that the exact semantics of the dynamical system and the controller are unknown, and that we are only able to observe the state of the controlled (aka, closed-loop) system at finitely many time points. We present a novel framework for predicting future states of the system based on the states observed in the past. The numbers of past states and of predicted future states are parameters provided by the user. Our method is based on a combination of Taylor’s expansion and the backward difference operator for numerical differentiation. We also derive an upper bound on the prediction error under the assumption that the system dynamics and the controller are smooth. The predicted states are then used to predict safety violations ahead in time. Our experiments demonstrate practical applicability of our method for complex black-box systems, showing that it is computationally lightweight and yet significantly more accurate than the state-of-the-art predictive safety monitoring techniques.","lang":"eng"}],"intvolume":" 283","has_accepted_license":"1","publication_status":"published","title":"Predictive monitoring of black-box dynamical systems","corr_author":"1","ec_funded":1,"OA_type":"gold"},{"oa_version":"Published Version","file_date_updated":"2025-12-29T14:51:40Z","file":[{"success":1,"content_type":"application/pdf","date_created":"2025-12-29T14:51:40Z","relation":"main_file","file_id":"20876","file_name":"2025_JourMolecularBiology_Rohden.pdf","file_size":2270555,"creator":"dernst","date_updated":"2025-12-29T14:51:40Z","access_level":"open_access","checksum":"90d50594d8ea9860ac5da41297992847"}],"_id":"20258","article_number":"169379","PlanS_conform":"1","doi":"10.1016/j.jmb.2025.169379","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"external_id":{"isi":["001618289100020"]},"date_updated":"2026-06-10T08:20:37Z","related_material":{"record":[{"relation":"research_data","id":"19956","status":"public"}]},"department":[{"_id":"PaSc"}],"date_published":"2025-12-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-08-31T22:01:33Z","publisher":"Elsevier","type":"journal_article","article_type":"original","issue":"23","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"ddc":["540"],"year":"2025","intvolume":" 437","abstract":[{"lang":"eng","text":"The specific introduction of ^1H-^13C or ^1H-^15N moieties into otherwise deuterated proteins holds great potential for high-resolution solution and magic-angle spinning (MAS) NMR studies of protein structure and dynamics. Arginine residues play key roles for example at active sites of enzymes. Taking advantage of a chemically synthesized Arg with a ^13C-^1H2 group in an otherwise deuterated backbone, we demonstrate here the usefulness of proton-detected MAS NMR approaches to probe arginine dynamics. In experiments with crystalline ubiquitin and the 134 kDa tetrameric enzyme malate dehydrogenase we detected a wide range of motions, from sites that are rigid on time scales of at least tens of milliseconds to residues undergoing predominantly nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled quantitative determination of these dynamics. We observed microsecond dynamics of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different β-turn conformations on this time scale. The labeling scheme and experiments presented here expand the toolkit for high-resolution proton-detected MAS NMR."}],"publication":"Journal of Molecular Biology","OA_place":"publisher","title":"Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme","corr_author":"1","publication_status":"published","has_accepted_license":"1","OA_type":"hybrid","day":"01","quality_controlled":"1","language":[{"iso":"eng"}],"project":[{"name":"AlloSpace. The emergence and mechanisms of allostery","_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf","grant_number":"I05812"}],"author":[{"full_name":"Rohden, Darja","first_name":"Darja","id":"81dc668a-19fa-11f0-bf31-d56534059ef3","last_name":"Rohden"},{"orcid":"0000-0002-9043-136X","full_name":"Napoli, Federico","last_name":"Napoli","first_name":"Federico","id":"d42e08e7-f4fc-11eb-af0a-d71e26138f1b"},{"first_name":"Anna","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","last_name":"Kapitonova","full_name":"Kapitonova, Anna"},{"id":"71cda2f3-e604-11ee-a1df-da10587eda3f","first_name":"Benjamin","last_name":"Tatman","full_name":"Tatman, Benjamin"},{"full_name":"Lichtenecker, Roman J.","first_name":"Roman J.","last_name":"Lichtenecker"},{"orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul"}],"citation":{"mla":"Rohden, Darja, et al. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology, vol. 437, no. 23, 169379, Elsevier, 2025, doi:10.1016/j.jmb.2025.169379.","ieee":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R. J. Lichtenecker, and P. Schanda, “Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme,” Journal of Molecular Biology, vol. 437, no. 23. Elsevier, 2025.","ama":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 2025;437(23). doi:10.1016/j.jmb.2025.169379","apa":"Rohden, D., Napoli, F., Kapitonova, A., Tatman, B., Lichtenecker, R. J., & Schanda, P. (2025). Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. Elsevier. https://doi.org/10.1016/j.jmb.2025.169379","ista":"Rohden D, Napoli F, Kapitonova A, Tatman B, Lichtenecker RJ, Schanda P. 2025. Arginine dynamics probed by magic-angle spinning NMR with a specific isotope-labeling scheme. Journal of Molecular Biology. 437(23), 169379.","chicago":"Rohden, Darja, Federico Napoli, Anna Kapitonova, Benjamin Tatman, Roman J. Lichtenecker, and Paul Schanda. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling Scheme.” Journal of Molecular Biology. Elsevier, 2025. https://doi.org/10.1016/j.jmb.2025.169379.","short":"D. Rohden, F. Napoli, A. Kapitonova, B. Tatman, R.J. Lichtenecker, P. Schanda, Journal of Molecular Biology 437 (2025)."},"article_processing_charge":"Yes (via OA deal)","isi":1,"oa":1,"acknowledgement":"This work was supported financially by the Austrian Science Fund (FWF, Grant No. I5812-B, “AlloSpace”). This research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance Facility and the Lab Support Facility (LSF). We thank Petra Rovò and Margarita Valhondo Falcón for excellent support of the NMR facility.","publication_identifier":{"eissn":["1089-8638"],"issn":["0022-2836"]},"month":"12","scopus_import":"1","volume":437},{"external_id":{"isi":["001556019400001"]},"date_updated":"2025-12-30T09:34:11Z","department":[{"_id":"EdHa"}],"oa_version":"None","_id":"20259","doi":"10.1038/s41567-025-02980-z","publisher":"Springer Nature","article_type":"original","type":"journal_article","year":"2025","date_published":"2025-09-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-08-31T22:01:33Z","day":"01","quality_controlled":"1","abstract":[{"text":"Cell migration in narrow microenvironments occurs in numerous physiological processes. It involves successive cycles of confinement and release that drive important morphological changes. However, it remains unclear whether migrating cells can retain a memory of their past morphological states that could potentially facilitate their navigation through confined spaces. We demonstrate that local geometry governs a switch between two cell morphologies, thereby facilitating cell passage through long and narrow gaps. We combined cell migration assays on standardized microsystems with biophysical modelling and biochemical perturbations to show that migrating cells have a long-term memory of past confinement events. The morphological cell states correlate across transitions through actin cortex remodelling. These findings indicate that mechanical memory in migrating cells plays an active role in their migratory potential in confined environments.","lang":"eng"}],"intvolume":" 21","publication":"Nature Physics","publication_status":"published","corr_author":"1","title":"The actin cortex acts as a mechanical memory of morphology in confined migrating cells","OA_type":"closed access","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"]},"month":"09","scopus_import":"1","volume":21,"language":[{"iso":"eng"}],"project":[{"name":"A mechano-chemical theory for stem cell fate decisions in organoid development","_id":"34e2a5b5-11ca-11ed-8bc3-b2265616ef0b","grant_number":"ALTF 343-2022"}],"author":[{"full_name":"Kalukula, Yohalie","last_name":"Kalukula","first_name":"Yohalie"},{"full_name":"Luciano, Marine","first_name":"Marine","last_name":"Luciano"},{"first_name":"Gleb","last_name":"Simanov","full_name":"Simanov, Gleb"},{"last_name":"Charras","first_name":"Guillaume","full_name":"Charras, Guillaume"},{"full_name":"Brückner, David","orcid":"0000-0001-7205-2975","id":"e1e86031-6537-11eb-953a-f7ab92be508d","first_name":"David","last_name":"Brückner"},{"full_name":"Gabriele, Sylvain","first_name":"Sylvain","last_name":"Gabriele"}],"article_processing_charge":"No","citation":{"short":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. Brückner, S. Gabriele, Nature Physics 21 (2025) 1451–1461.","chicago":"Kalukula, Yohalie, Marine Luciano, Gleb Simanov, Guillaume Charras, David Brückner, and Sylvain Gabriele. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics. Springer Nature, 2025. https://doi.org/10.1038/s41567-025-02980-z.","ista":"Kalukula Y, Luciano M, Simanov G, Charras G, Brückner D, Gabriele S. 2025. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 21, 1451–1461.","apa":"Kalukula, Y., Luciano, M., Simanov, G., Charras, G., Brückner, D., & Gabriele, S. (2025). The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. Springer Nature. https://doi.org/10.1038/s41567-025-02980-z","ama":"Kalukula Y, Luciano M, Simanov G, Charras G, Brückner D, Gabriele S. The actin cortex acts as a mechanical memory of morphology in confined migrating cells. Nature Physics. 2025;21:1451-1461. doi:10.1038/s41567-025-02980-z","ieee":"Y. Kalukula, M. Luciano, G. Simanov, G. Charras, D. Brückner, and S. Gabriele, “The actin cortex acts as a mechanical memory of morphology in confined migrating cells,” Nature Physics, vol. 21. Springer Nature, pp. 1451–1461, 2025.","mla":"Kalukula, Yohalie, et al. “The Actin Cortex Acts as a Mechanical Memory of Morphology in Confined Migrating Cells.” Nature Physics, vol. 21, Springer Nature, 2025, pp. 1451–61, doi:10.1038/s41567-025-02980-z."},"isi":1,"page":"1451-1461","acknowledgement":"We are grateful to members of S.G.’s laboratory for feedback and suggestions. We thank E. Hannezo, J. O. Rädler, M. Piel, O. du Roure and J. Heuvingh for inspiring discussions. Y.K. and S.G. acknowledge J. B. Braquenier from Nikon Instruments Belux and the Nikon BioImaging Lab in Leiden (the Netherlands) for their support with the Nikon Spatial Array Confocal enhanced-resolution confocal microscopy. We thank D. S. Herrador and M. Balland for their help in improving the microprinting method. D.B.B. was supported by the NOMIS Foundation as a NOMIS Fellow and by an EMBO Postdoctoral Fellowship (ALTF 343-2022). Y.K., M.L. and S.G. acknowledge funding from the University of Mons (FEDER Prostem Research Project no. 1510614, Wallonia DG06), the F.R.S.-FNRS (Epiforce Project no. T.0092.21, Cellsqueezer Project no. J.0061.23 and Optopattern Project no. U.NO26.22) and the Interreg projects ANTIRESI and MICROPLAITE, which are financially supported by Interreg France-Wallonie-Vlaanderen (Fonds Européen de Développement Régional). Y.K. and M.L. are financially supported by F.R.S.-FNRS as FRIA Grantee FNRS and Postdoctoral Fellow (Chargé de Recherches), respectively. Y.K. and S.G. acknowledge le Fonds pour la Recherche Médicale dans le Hainaut (FRMH). G.C. was supported by a grant from the Biotechnology and Biological Sciences Research Council (grant no. BB/V007483/1)."},{"quality_controlled":"1","day":"01","OA_type":"hybrid","ec_funded":1,"publication_status":"published","title":"Burning or collapsing the medial axis is unstable","corr_author":"1","has_accepted_license":"1","abstract":[{"lang":"eng","text":"The medial axis of a set consists of the points in the ambient space without a unique closest point in the original set. Since its introduction, the medial axis has been used extensively in many applications as a method of computing a skeleton topologically equivalent to the original set. Unfortunately, one limiting factor in the use of the medial axis of a smooth manifold is that it is not necessarily topologically stable under small perturbations of the manifold. To counter these instabilities, various prunings of the medial axis have been proposed in the computational geometry community. Here, we examine one type of pruning, called burning. Because of the good experimental results it was hoped that the burning method of simplifying the medial axis would be stable. In this work, we show a simple example that dashes such hopes. Based on Bing’s house with two rooms, we demonstrate an isotopy of a shape where the medial axis goes from collapsible to non-collapsible. More precisely, we consider the standard deformation retract from the closed ball to Bing’s house with two rooms, but stop just short of the point where Bing’s house becomes two dimensional. This way we obtain an isotopy from the 3-ball to a thickened version of Bing’s house. Under this isotopy, the medial axis goes from collapsible to non-collapsible. We stress that this isotopy can be made generic, in the sense of singularity theory, as developed by Arnol’d and Thom."}],"intvolume":" 4","OA_place":"publisher","publication":"La Matematica","scopus_import":"1","month":"12","volume":4,"publication_identifier":{"eissn":["2730-9657"]},"acknowledgement":"We thank André Lieutier, David Letscher, Ellen Gasparovic, Kathryn Leonard, and Tao Ju for early discussions on this work. We also thank Lu Liu, Yajie Yan, and Tao Ju for sharing code to generate the examples. We further thank Abigail Thompson for discussion on the conjecture and James Damon for sharing his insight in singularity theory. We thank the reviewers for their detailed reviews, which helped to improve the exposition.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). Partially supported by the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’ and the European Research Council (ERC), grant no. 788183, ‘Alpha Shape Theory Extended’. The first author was supported in part by the National Science Foundation through grants DBI-1759807, CCF-1907612, and CCF-2444309. The fourth author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) M-3073, ANR grant StratMesh, ANR-24-CE48-1899, and the welcome package from IDEX of the Université Côte d’Azur, ANR-15-IDEX-01.","oa":1,"article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Chambers, Erin Wolf, et al. “Burning or Collapsing the Medial Axis Is Unstable.” La Matematica, vol. 4, Springer Nature, 2025, pp. 811–28, doi:10.1007/s44007-025-00170-0.","ieee":"E. W. Chambers, C. D. Fillmore, E. R. Stephenson, and M. Wintraecken, “Burning or collapsing the medial axis is unstable,” La Matematica, vol. 4. Springer Nature, pp. 811–828, 2025.","ista":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. 2025. Burning or collapsing the medial axis is unstable. La Matematica. 4, 811–828.","chicago":"Chambers, Erin Wolf, Christopher D Fillmore, Elizabeth R Stephenson, and Mathijs Wintraecken. “Burning or Collapsing the Medial Axis Is Unstable.” La Matematica. Springer Nature, 2025. https://doi.org/10.1007/s44007-025-00170-0.","ama":"Chambers EW, Fillmore CD, Stephenson ER, Wintraecken M. Burning or collapsing the medial axis is unstable. La Matematica. 2025;4:811-828. doi:10.1007/s44007-025-00170-0","apa":"Chambers, E. W., Fillmore, C. D., Stephenson, E. R., & Wintraecken, M. (2025). Burning or collapsing the medial axis is unstable. La Matematica. Springer Nature. https://doi.org/10.1007/s44007-025-00170-0","short":"E.W. Chambers, C.D. Fillmore, E.R. Stephenson, M. Wintraecken, La Matematica 4 (2025) 811–828."},"page":"811-828","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020","grant_number":"788183"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"grant_number":"M03073","name":"Learning and triangulating manifolds via collapses","_id":"fc390959-9c52-11eb-aca3-afa58bd282b2"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Erin Wolf","last_name":"Chambers","full_name":"Chambers, Erin Wolf"},{"last_name":"Fillmore","first_name":"Christopher D","id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D"},{"orcid":"0000-0002-6862-208X","full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","first_name":"Elizabeth R","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mathijs","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","last_name":"Wintraecken","full_name":"Wintraecken, Mathijs","orcid":"0000-0002-7472-2220"}],"department":[{"_id":"HeEd"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"21021"}]},"date_updated":"2026-04-07T11:42:48Z","doi":"10.1007/s44007-025-00170-0","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"PlanS_conform":"1","_id":"20260","file":[{"creator":"dernst","file_id":"20885","file_name":"2025_LaMatematica_Chambers.pdf","file_size":2678640,"checksum":"e2043259194bfcdf3d74c4da8a5a853f","date_updated":"2025-12-30T07:52:58Z","access_level":"open_access","success":1,"content_type":"application/pdf","date_created":"2025-12-30T07:52:58Z","relation":"main_file"}],"oa_version":"Published Version","file_date_updated":"2025-12-30T07:52:58Z","year":"2025","ddc":["510"],"publisher":"Springer Nature","article_type":"original","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-08-31T22:01:33Z","date_published":"2025-12-01T00:00:00Z","status":"public"},{"quality_controlled":"1","day":"26","corr_author":"1","publication_status":"published","title":"Self-generated chemotaxis of mixed cell populations","has_accepted_license":"1","intvolume":" 122","abstract":[{"lang":"eng","text":"Cell and tissue movement in development, cancer invasion, and immune response relies on chemical or mechanical guidance cues. In many systems, this behavior is locally directed by self-generated signaling gradients rather than long-range, prepatterned cues. However, how heterogeneous mixtures of cells interact nonreciprocally and navigate through self-generated gradients remains largely unexplored. Here, we introduce a theoretical framework for the self-organized chemotaxis of heterogeneous cell populations. We find that the relative chemotactic sensitivities of different cell populations control their long-time coupling and comigration dynamics, with boundary conditions such as external cell and attractant reservoirs substantially influencing the migration patterns. Our model predicts an optimal parameter regime that enables robust and colocalized migration. We test our theoretical predictions with in vitro experiments demonstrating the comigration of distinct immune cell populations, and quantitatively reproduce observed migration patterns under wild-type and perturbed conditions. Interestingly, immune cell comigration occurs close to the predicted optimal regime. Finally, we incorporate mechanical interactions into our framework, revealing a nontrivial interplay between chemotactic and mechanical nonreciprocity in driving collective migration. Together, our findings suggest that self-generated chemotaxis is a robust strategy for the navigation of mixed cell populations."}],"publication":"Proceedings of the National Academy of Sciences","OA_place":"publisher","OA_type":"hybrid","ec_funded":1,"publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"month":"08","scopus_import":"1","volume":122,"isi":1,"citation":{"ista":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. 2025. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 122(34), e2504064122.","chicago":"Ucar, Mehmet C, Alsberga Zane, Jonna H Alanko, Michael K Sixt, and Edouard B Hannezo. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences. National Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2504064122.","ama":"Ucar MC, Zane A, Alanko JH, Sixt MK, Hannezo EB. Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. 2025;122(34). doi:10.1073/pnas.2504064122","apa":"Ucar, M. C., Zane, A., Alanko, J. H., Sixt, M. K., & Hannezo, E. B. (2025). Self-generated chemotaxis of mixed cell populations. Proceedings of the National Academy of Sciences. National Academy of Sciences. https://doi.org/10.1073/pnas.2504064122","short":"M.C. Ucar, A. Zane, J.H. Alanko, M.K. Sixt, E.B. Hannezo, Proceedings of the National Academy of Sciences 122 (2025).","ieee":"M. C. Ucar, A. Zane, J. H. Alanko, M. K. Sixt, and E. B. Hannezo, “Self-generated chemotaxis of mixed cell populations,” Proceedings of the National Academy of Sciences, vol. 122, no. 34. National Academy of Sciences, 2025.","mla":"Ucar, Mehmet C., et al. “Self-Generated Chemotaxis of Mixed Cell Populations.” Proceedings of the National Academy of Sciences, vol. 122, no. 34, e2504064122, National Academy of Sciences, 2025, doi:10.1073/pnas.2504064122."},"article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"project":[{"name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020","_id":"05943252-7A3F-11EA-A408-12923DDC885E","grant_number":"851288"}],"author":[{"first_name":"Mehmet C","id":"50B2A802-6007-11E9-A42B-EB23E6697425","last_name":"Ucar","full_name":"Ucar, Mehmet C","orcid":"0000-0003-0506-4217"},{"orcid":"0009-0003-0415-7603","full_name":"Zane, Alsberga","last_name":"Zane","first_name":"Alsberga","id":"60f7509a-f652-11ea-9d86-b963d6490d7c"},{"full_name":"Alanko, Jonna H","orcid":"0000-0002-7698-3061","first_name":"Jonna H","id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","last_name":"Alanko"},{"last_name":"Sixt","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K"},{"first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","last_name":"Hannezo","full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561"}],"acknowledgement":"We thank all members of the M.S. and E.H. groups for stimulating discussions.We thank the Imaging and Optics facility, the Pre-clinical and Lab Support facility of the Institute of Science and Technology Austria for their excellent support and provided resources for the experimental research. In particular, we thank Jack Merrin from the Nanofabrication facility who generated the microfabricated channel used in this study. This work received funding fromt he European Research Council under the European Union’s Horizon 2020 research and innovation program (grant agreement No. 851288 to E.H.). M.C.U.is funded by a University of Sheffield Strategic Research Fellowship in the Physics of Life and Quantitative Biology.","oa":1,"date_updated":"2026-05-20T08:59:54Z","related_material":{"link":[{"url":"https://github.com/mehmetcanucar/Self-generated-chemotaxis","relation":"software"}]},"external_id":{"pmid":["40838890"],"isi":["001562181600001"]},"department":[{"_id":"EdHa"},{"_id":"MiSi"}],"APC_amount":"5766,07 EUR","_id":"20289","file":[{"checksum":"b36abd92673b6d76376fc9434bad52cc","access_level":"open_access","date_updated":"2025-09-08T07:23:29Z","creator":"dernst","file_name":"2025_PNAS_Ucar.pdf","file_size":16069140,"file_id":"20307","relation":"main_file","date_created":"2025-09-08T07:23:29Z","success":1,"content_type":"application/pdf"}],"article_number":"e2504064122","oa_version":"Published Version","file_date_updated":"2025-09-08T07:23:29Z","doi":"10.1073/pnas.2504064122","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"PlanS_conform":"1","publisher":"National Academy of Sciences","article_type":"original","type":"journal_article","year":"2025","pmid":1,"issue":"34","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"ddc":["570"],"date_published":"2025-08-26T00:00:00Z","status":"public","date_created":"2025-09-07T22:01:32Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:32Z","date_published":"2025-08-20T00:00:00Z","status":"public","ddc":["000"],"year":"2025","conference":{"end_date":"2025-08-29","location":"Warsaw, Poland","name":"MFCS: Mathematical Foundations of Computer Science","start_date":"2025-08-25"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.MFCS.2025.30","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","file_date_updated":"2025-09-08T07:11:12Z","file":[{"file_id":"20306","file_name":"2025_MFCS_Brice.pdf","file_size":1149694,"creator":"dernst","date_updated":"2025-09-08T07:11:12Z","access_level":"open_access","checksum":"9bc6b8e537662d371d2a27444cbc0b75","content_type":"application/pdf","success":1,"date_created":"2025-09-08T07:11:12Z","relation":"main_file"}],"_id":"20290","article_number":"30","alternative_title":["LIPIcs"],"department":[{"_id":"ToHe"}],"external_id":{"arxiv":["2502.0531"]},"date_updated":"2025-09-08T07:15:40Z","oa":1,"acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093. We thank anonymous reviewers for pointing us to the Hurwicz criterion and to the work of Gallego-Hernández and Mansutti [13]. We thank Marie van den Bogaard for her valuable feedback on the first author’s PhD dissertation, which helped improve the quality of this work. ","arxiv":1,"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093"}],"language":[{"iso":"eng"}],"author":[{"full_name":"Brice, Léonard","first_name":"Léonard","last_name":"Brice"},{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A"},{"full_name":"Thejaswini, K. S.","last_name":"Thejaswini","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S."}],"article_processing_charge":"Yes","citation":{"ieee":"L. Brice, T. A. Henzinger, and K. S. Thejaswini, “Finding equilibria: Simpler for pessimists, simplest for optimists,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.","mla":"Brice, Léonard, et al. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 30, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.30.","short":"L. Brice, T.A. Henzinger, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Brice, Léonard, Thomas A Henzinger, and K. S. Thejaswini. “Finding Equilibria: Simpler for Pessimists, Simplest for Optimists.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.30.","ista":"Brice L, Henzinger TA, Thejaswini KS. 2025. Finding equilibria: Simpler for pessimists, simplest for optimists. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 30.","ama":"Brice L, Henzinger TA, Thejaswini KS. Finding equilibria: Simpler for pessimists, simplest for optimists. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.30","apa":"Brice, L., Henzinger, T. A., & Thejaswini, K. S. (2025). Finding equilibria: Simpler for pessimists, simplest for optimists. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.30"},"month":"08","scopus_import":"1","volume":345,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"ec_funded":1,"OA_type":"gold","abstract":[{"text":"We consider equilibria in multiplayer stochastic graph games with terminal-node rewards. In such games, Nash equilibria are defined assuming that each player seeks to maximise their expected payoff, ignoring their aversion or tolerance to risk. We therefore study risk-sensitive equilibria (RSEs), where the expected payoff is replaced by a risk measure. A classical risk measure in the literature is the entropic risk measure, where each player has a real valued parameter capturing their risk-averseness. We introduce the extreme risk measure, which corresponds to extreme cases of entropic risk measure, where players are either extreme optimists or extreme pessimists. Under extreme risk measure, every player is an extremist: an extreme optimist perceives their reward as the maximum payoff that can be achieved with positive probability, while an extreme pessimist expects the minimum payoff achievable with positive probability. We argue that the extreme risk measure, especially in multi-player graph based settings, is particularly relevant as they can model several real life instances such as interactions between secure systems and potential security threats, or distributed controls for safety critical systems. We prove that RSEs defined with the extreme risk measure are guaranteed to exist when all rewards are non-negative. Furthermore, we prove that the problem of deciding whether a given game contains an RSE that generates risk measures within specified intervals is decidable and NP-complete for our extreme risk measure, and even PTIME-complete when all players are extreme optimists, while that same problem is undecidable using the entropic risk measure or even the classical expected payoff. This establishes, to our knowledge, the first decidable fragment for equilibria in simple stochastic games without restrictions on strategy types or number of players.","lang":"eng"}],"intvolume":" 345","OA_place":"publisher","publication":"50th International Symposium on Mathematical Foundations of Computer Science","corr_author":"1","title":"Finding equilibria: Simpler for pessimists, simplest for optimists","publication_status":"published","has_accepted_license":"1","day":"20","quality_controlled":"1"},{"oa_version":"Published Version","file_date_updated":"2025-09-08T06:56:56Z","article_number":"57","_id":"20291","file":[{"file_id":"20305","file_name":"2025_MFCS_HenzingerT.pdf","file_size":1009644,"creator":"dernst","date_updated":"2025-09-08T06:56:56Z","access_level":"open_access","checksum":"6068b772aba6cb0d01f3e5a90abed973","content_type":"application/pdf","success":1,"date_created":"2025-09-08T06:56:56Z","relation":"main_file"}],"alternative_title":["LIPIcs"],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"doi":"10.4230/LIPIcs.MFCS.2025.57","external_id":{"arxiv":["2502.12872"]},"date_updated":"2025-09-08T07:06:11Z","department":[{"_id":"ToHe"}],"date_published":"2025-08-20T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-07T22:01:32Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","ddc":["000"],"conference":{"start_date":"2025-08-25","name":"MFCS: Mathematical Foundations of Computer Science","end_date":"2025-08-29","location":"Warsaw, Poland"},"year":"2025","intvolume":" 345","abstract":[{"text":"We define and study classes of ω-regular automata for which the nondeterminism can be resolved by a policy that uses a combination of memory and randomness on any input word, based solely on the prefix read so far. We examine two settings for providing the input word to an automaton. In the first setting, called adversarial resolvability, the input word is constructed letter-by-letter by an adversary, dependent on the resolver’s previous decisions. In the second setting, called stochastic resolvability, the adversary pre-commits to an infinite word and reveals it letter-by-letter. In each setting, we require the existence of an almost-sure resolver, i.e., a policy that ensures that as long as the adversary provides a word in the language of the underlying nondeterministic automaton, the run constructed by the policy is accepting with probability 1.\r\nThe class of automata that are adversarially resolvable is the well-studied class of history-deterministic automata. The case of stochastically resolvable automata, on the other hand, defines a novel class. Restricting the class of resolvers in both settings to stochastic policies without memory introduces two additional new classes of automata. We show that the new automata classes offer interesting trade-offs between succinctness, expressivity, and computational complexity, providing a fine gradation between deterministic automata and nondeterministic automata.","lang":"eng"}],"publication":"50th International Symposium on Mathematical Foundations of Computer Science","OA_place":"publisher","publication_status":"published","corr_author":"1","title":"Resolving nondeterminism with randomness","has_accepted_license":"1","ec_funded":1,"OA_type":"gold","day":"20","quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"full_name":"Prakash, Aditya","first_name":"Aditya","last_name":"Prakash"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S.","last_name":"Thejaswini","full_name":"Thejaswini, K. S."}],"citation":{"ama":"Henzinger TA, Prakash A, Thejaswini KS. Resolving nondeterminism with randomness. In: 50th International Symposium on Mathematical Foundations of Computer Science. Vol 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.MFCS.2025.57","apa":"Henzinger, T. A., Prakash, A., & Thejaswini, K. S. (2025). Resolving nondeterminism with randomness. In 50th International Symposium on Mathematical Foundations of Computer Science (Vol. 345). Warsaw, Poland: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.MFCS.2025.57","ista":"Henzinger TA, Prakash A, Thejaswini KS. 2025. Resolving nondeterminism with randomness. 50th International Symposium on Mathematical Foundations of Computer Science. MFCS: Mathematical Foundations of Computer Science, LIPIcs, vol. 345, 57.","chicago":"Henzinger, Thomas A, Aditya Prakash, and K. S. Thejaswini. “Resolving Nondeterminism with Randomness.” In 50th International Symposium on Mathematical Foundations of Computer Science, Vol. 345. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.MFCS.2025.57.","short":"T.A. Henzinger, A. Prakash, K.S. Thejaswini, in:, 50th International Symposium on Mathematical Foundations of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ieee":"T. A. Henzinger, A. Prakash, and K. S. Thejaswini, “Resolving nondeterminism with randomness,” in 50th International Symposium on Mathematical Foundations of Computer Science, Warsaw, Poland, 2025, vol. 345.","mla":"Henzinger, Thomas A., et al. “Resolving Nondeterminism with Randomness.” 50th International Symposium on Mathematical Foundations of Computer Science, vol. 345, 57, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.MFCS.2025.57."},"article_processing_charge":"No","oa":1,"acknowledgement":"This work is a part of project VAMOS that has received funding from the European Research Council (ERC), grant agreement No 101020093.","arxiv":1,"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773881"]},"month":"08","scopus_import":"1","volume":345},{"arxiv":1,"acknowledgement":"This work was supported in part by the ERC project ERC-2020-AdG 101020093 and the SBI Foundation Hub for Data Science &Analytics, IIT Bombay.","oa":1,"page":"790-801","citation":{"chicago":"Gupta, Ashutosh, Thomas A Henzinger, Konstantin Kueffner, Kaushik Mallik, and David Pape. “Monitoring Robustness and Individual Fairness.” In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2:790–801. Association for Computing Machinery, 2025. https://doi.org/10.1145/3711896.3737054.","ista":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. 2025. Monitoring robustness and individual fairness. Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Conference on Knowledge Discovery and Data Mining vol. 2, 790–801.","ama":"Gupta A, Henzinger TA, Kueffner K, Mallik K, Pape D. Monitoring robustness and individual fairness. In: Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining. Vol 2. Association for Computing Machinery; 2025:790-801. doi:10.1145/3711896.3737054","apa":"Gupta, A., Henzinger, T. A., Kueffner, K., Mallik, K., & Pape, D. (2025). Monitoring robustness and individual fairness. In Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining (Vol. 2, pp. 790–801). Toronto, Canada: Association for Computing Machinery. https://doi.org/10.1145/3711896.3737054","short":"A. Gupta, T.A. Henzinger, K. Kueffner, K. Mallik, D. Pape, in:, Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Association for Computing Machinery, 2025, pp. 790–801.","ieee":"A. Gupta, T. A. Henzinger, K. Kueffner, K. Mallik, and D. Pape, “Monitoring robustness and individual fairness,” in Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, Toronto, Canada, 2025, vol. 2, pp. 790–801.","mla":"Gupta, Ashutosh, et al. “Monitoring Robustness and Individual Fairness.” Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining, vol. 2, Association for Computing Machinery, 2025, pp. 790–801, doi:10.1145/3711896.3737054."},"article_processing_charge":"No","author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","last_name":"Kueffner","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","first_name":"Konstantin"},{"first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","full_name":"Mallik, Kaushik","orcid":"0000-0001-9864-7475"},{"full_name":"Pape, David","last_name":"Pape","first_name":"David"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"volume":2,"month":"08","scopus_import":"1","publication_identifier":{"isbn":["9798400714542"],"issn":["2154-817X"]},"ec_funded":1,"has_accepted_license":"1","corr_author":"1","publication_status":"published","title":"Monitoring robustness and individual fairness","OA_place":"publisher","publication":"Proceedings of the 31st ACM SIGKDD Conference on Knowledge Discovery and Data Mining","abstract":[{"text":"In automated decision-making, it is desirable that outputs of decision-makers be robust to slight perturbations in their inputs, a property that may be called input-output robustness. Input-output robustness appears in various different forms in the literature, such as robustness of AI models to adversarial or semantic perturbations and individual fairness of AI models that make decisions about humans. We propose runtime monitoring of input-output robustness of deployed, black-box AI models, where the goal is to design monitors that would observe one long execution sequence of the model, and would raise an alarm whenever it is detected that two similar inputs from the past led to dissimilar outputs. This way, monitoring will complement existing offline ''robustification'' approaches to increase the trustworthiness of AI decision-makers. We show that the monitoring problem can be cast as the fixed-radius nearest neighbor (FRNN) search problem, which, despite being well-studied, lacks suitable online solutions. We present our tool Clemont, which offers a number of lightweight monitors, some of which use upgraded online variants of existing FRNN algorithms, and one uses a novel algorithm based on binary decision diagrams--a data-structure commonly used in software and hardware verification. We have also developed an efficient parallelization technique that can substantially cut down the computation time of monitors for which the distance between input-output pairs is measured using the L∞norm. Using standard benchmarks from the literature of adversarial and semantic robustness and individual fairness, we perform a comparative study of different monitors in Clemont, and demonstrate their effectiveness in correctly detecting robustness violations at runtime.","lang":"eng"}],"intvolume":" 2","quality_controlled":"1","day":"03","date_created":"2025-09-07T22:01:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2025-08-03T00:00:00Z","year":"2025","conference":{"start_date":"2025-08-03","name":"KDD: Conference on Knowledge Discovery and Data Mining","location":"Toronto, Canada","end_date":"2025-08-07"},"ddc":["000"],"type":"conference","publisher":"Association for Computing Machinery","doi":"10.1145/3711896.3737054","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"20292","file":[{"success":1,"content_type":"application/pdf","date_created":"2025-09-08T08:46:31Z","relation":"main_file","creator":"dernst","file_id":"20310","file_size":7745940,"file_name":"2025_KDD_Gupta.pdf","checksum":"81e18cdf9ca5f6dfa79425b326ea9725","date_updated":"2025-09-08T08:46:31Z","access_level":"open_access"}],"file_date_updated":"2025-09-08T08:46:31Z","oa_version":"Published Version","department":[{"_id":"ToHe"}],"date_updated":"2025-09-08T08:54:24Z","related_material":{"link":[{"relation":"software","url":"https://github.com/ariez-xyz/clemont"}]},"external_id":{"arxiv":["2506.00496"]}}]