[{"corr_author":"1","quality_controlled":"1","year":"2025","date_created":"2025-05-25T22:16:57Z","article_number":"e113018","publication_identifier":{"issn":["1471-0072"],"eissn":["1471-0080"]},"doi":"10.1038/s41580-025-00851-2","publication":"Nature Reviews Molecular Cell Biology","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The phytohormone auxin is a major signal coordinating growth and development in plants. The variety of its effects arises from its ability to form local auxin maxima and gradients within tissues, generated through directional cell-to-cell transport and elaborate metabolic control. These auxin distribution patterns instruct cells in a context-dependent manner to undergo predefined developmental transitions. In this Review, we discuss advances in auxin action at the level of homeostasis and signalling. We highlight key insights into the structural basis of PIN-mediated intercellular auxin transport and explore two novel non-transcriptional auxin signalling mechanisms: one involving intracellular Ca2+ transients and another involving cell-surface auxin perception that mediates global, ultrafast phosphorylation. Furthermore, we examine emerging evidence indicating the involvement of cyclic adenosine monophosphate as a second messenger in the transcriptional auxin response. Together, these recent developments in auxin research have profoundly deepened our understanding of the complex and diverse activities of auxin in plant growth and development."}],"publication_status":"published","external_id":{"isi":["001490500500001"],"pmid":["40389696"]},"title":"Mechanisms of auxin action in plant growth and development","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"full_name":"Pei, Yuanrong","id":"98605edc-6ce7-11ee-95f3-cc16b866efcd","last_name":"Pei","first_name":"Yuanrong"},{"orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jiří","last_name":"Friml","first_name":"Jiří"}],"pmid":1,"citation":{"mla":"Vanneste, Steffen, et al. “Mechanisms of Auxin Action in Plant Growth and Development.” <i>Nature Reviews Molecular Cell Biology</i>, e113018, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41580-025-00851-2\">10.1038/s41580-025-00851-2</a>.","chicago":"Vanneste, Steffen, Yuanrong Pei, and Jiří Friml. “Mechanisms of Auxin Action in Plant Growth and Development.” <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41580-025-00851-2\">https://doi.org/10.1038/s41580-025-00851-2</a>.","apa":"Vanneste, S., Pei, Y., &#38; Friml, J. (2025). Mechanisms of auxin action in plant growth and development. <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41580-025-00851-2\">https://doi.org/10.1038/s41580-025-00851-2</a>","ista":"Vanneste S, Pei Y, Friml J. 2025. Mechanisms of auxin action in plant growth and development. Nature Reviews Molecular Cell Biology., e113018.","ama":"Vanneste S, Pei Y, Friml J. Mechanisms of auxin action in plant growth and development. <i>Nature Reviews Molecular Cell Biology</i>. 2025. doi:<a href=\"https://doi.org/10.1038/s41580-025-00851-2\">10.1038/s41580-025-00851-2</a>","short":"S. Vanneste, Y. Pei, J. Friml, Nature Reviews Molecular Cell Biology (2025).","ieee":"S. Vanneste, Y. Pei, and J. Friml, “Mechanisms of auxin action in plant growth and development,” <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature, 2025."},"OA_type":"closed access","status":"public","day":"19","isi":1,"month":"05","language":[{"iso":"eng"}],"date_published":"2025-05-19T00:00:00Z","department":[{"_id":"JiFr"}],"publisher":"Springer Nature","date_updated":"2025-09-30T12:41:30Z","article_type":"review","oa_version":"None","type":"journal_article","_id":"19736","scopus_import":"1"},{"day":"01","status":"public","OA_type":"hybrid","ec_funded":1,"project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"citation":{"chicago":"Cipolloni, Giorgio, László Erdös, and Hong Chang Ji. “Non–Hermitian Spectral Universality at Critical Points.” <i>Probability Theory and Related Fields</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00440-025-01384-7\">https://doi.org/10.1007/s00440-025-01384-7</a>.","apa":"Cipolloni, G., Erdös, L., &#38; Ji, H. C. (2025). Non–Hermitian spectral universality at critical points. <i>Probability Theory and Related Fields</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00440-025-01384-7\">https://doi.org/10.1007/s00440-025-01384-7</a>","mla":"Cipolloni, Giorgio, et al. “Non–Hermitian Spectral Universality at Critical Points.” <i>Probability Theory and Related Fields</i>, 050603, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00440-025-01384-7\">10.1007/s00440-025-01384-7</a>.","ieee":"G. Cipolloni, L. Erdös, and H. C. Ji, “Non–Hermitian spectral universality at critical points,” <i>Probability Theory and Related Fields</i>. Springer Nature, 2025.","short":"G. Cipolloni, L. Erdös, H.C. Ji, Probability Theory and Related Fields (2025).","ista":"Cipolloni G, Erdös L, Ji HC. 2025. Non–Hermitian spectral universality at critical points. Probability Theory and Related Fields., 050603.","ama":"Cipolloni G, Erdös L, Ji HC. Non–Hermitian spectral universality at critical points. <i>Probability Theory and Related Fields</i>. 2025. doi:<a href=\"https://doi.org/10.1007/s00440-025-01384-7\">10.1007/s00440-025-01384-7</a>"},"_id":"19737","scopus_import":"1","type":"journal_article","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). Supported by ERC Advanced Grant “RMTBeyond” No. 101020331.","article_type":"original","oa_version":"Published Version","department":[{"_id":"LaEr"}],"publisher":"Springer Nature","date_updated":"2026-06-18T18:17:57Z","language":[{"iso":"eng"}],"month":"01","date_published":"2025-01-01T00:00:00Z","oa":1,"isi":1,"publication":"Probability Theory and Related Fields","doi":"10.1007/s00440-025-01384-7","publication_identifier":{"eissn":["1432-2064"],"issn":["0178-8051"]},"article_number":"050603","year":"2025","date_created":"2025-05-25T22:16:59Z","ddc":["500"],"main_file_link":[{"url":"https://doi.org/10.1007/s00440-025-01384-7","open_access":"1"}],"quality_controlled":"1","corr_author":"1","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Cipolloni","first_name":"Giorgio","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László","last_name":"Erdös"},{"full_name":"Ji, Hong Chang","first_name":"Hong Chang","last_name":"Ji"}],"title":"Non–Hermitian spectral universality at critical points","abstract":[{"lang":"eng","text":"For general large non–Hermitian random matrices X and deterministic normal deformations A, we prove that the local eigenvalue statistics of A + X close to the critical edge points of its spectrum are universal. This concludes the proof of the third and last remaining typical universality class for non–Hermitian random matrices (for normal deformations), after bulk and sharp edge universalities have been established in recent years."}],"external_id":{"isi":["001493091900001"]},"publication_status":"epub_ahead","article_processing_charge":"Yes (via OA deal)"},{"oa":1,"date_updated":"2025-06-02T07:01:45Z","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"publisher":"Springer Nature","date_published":"2025-05-05T00:00:00Z","language":[{"iso":"eng"}],"month":"05","type":"conference","intvolume":"     15677","oa_version":"Preprint","scopus_import":"1","_id":"19738","citation":{"ama":"Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. Securely instantiating ‘Half Gates’ garbling in the standard model. In: <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>. Vol 15677. Springer Nature; 2025:37-75. doi:<a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">10.1007/978-3-031-91829-2_2</a>","ista":"Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. 2025. Securely instantiating ‘Half Gates’ garbling in the standard model. 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 15677, 37–75.","ieee":"A. Acharya, K. Azari, M. A. Baig, D. Hofheinz, and C. Kamath, “Securely instantiating ‘Half Gates’ garbling in the standard model,” in <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, Roros, Norway, 2025, vol. 15677, pp. 37–75.","short":"A. Acharya, K. Azari, M.A. Baig, D. Hofheinz, C. Kamath, in:, 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Springer Nature, 2025, pp. 37–75.","mla":"Acharya, Anasuya, et al. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, vol. 15677, Springer Nature, 2025, pp. 37–75, doi:<a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">10.1007/978-3-031-91829-2_2</a>.","chicago":"Acharya, Anasuya, Karen Azari, Mirza Ahad Baig, Dennis Hofheinz, and Chethan Kamath. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, 15677:37–75. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">https://doi.org/10.1007/978-3-031-91829-2_2</a>.","apa":"Acharya, A., Azari, K., Baig, M. A., Hofheinz, D., &#38; Kamath, C. (2025). Securely instantiating ‘Half Gates’ garbling in the standard model. In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i> (Vol. 15677, pp. 37–75). Roros, Norway: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">https://doi.org/10.1007/978-3-031-91829-2_2</a>"},"OA_type":"green","status":"public","day":"05","alternative_title":["LNCS"],"abstract":[{"text":"Garbling is a fundamental cryptographic primitive, with numerous theoretical and practical applications. Since the first construction by Yao (FOCS’82, ’86), a line of work has concerned itself with reducing the communication and computational complexity of that construction. One of the most efficient garbling schemes presently is the ‘Half Gates’ scheme by Zahur, Rosulek, and Evans (Eurocrypt’15). Despite its widespread adoption, the provable security of this scheme has been based on assumptions whose only instantiations are in idealized models. For example, in their original paper, Zahur, Rosulek, and Evans showed that hash functions satisfying a notion called circular correlation robustness (CCR) suffice for this task, and then proved that CCR secure hash functions can be instantiated in the random permutation model.\r\nIn this work, we show how to securely instantiate the Half Gates scheme in the standard model. To this end, we first show how this scheme can be securely instantiated given a (family of) weak CCR hash function, a notion that we introduce. Furthermore, we show how a weak CCR hash function can be used to securely instantiate other efficient garbling schemes, namely the ones by Rosulek and Roy (Crypto’21) and Heath (Eurocrypt’24). Thus we believe this notion to be of independent interest.\r\nFinally, we construct such weak CCR hash functions using indistinguishability obfuscation and one-way functions. The security proof of this construction constitutes our main technical contribution. While our construction is not practical, it serves as a proof of concept supporting the soundness of these garbling schemes, which we regard to be particularly important given the recent initiative by NIST to standardize garbling, and the optimizations in Half Gates being potentially adopted.","lang":"eng"}],"article_processing_charge":"No","page":"37-75","title":"Securely instantiating ‘Half Gates’ garbling in the standard model","volume":15677,"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Anasuya","last_name":"Acharya","full_name":"Acharya, Anasuya"},{"full_name":"Azari, Karen","first_name":"Karen","last_name":"Azari"},{"full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","first_name":"Mirza Ahad","last_name":"Baig"},{"full_name":"Hofheinz, Dennis","last_name":"Hofheinz","first_name":"Dennis"},{"full_name":"Kamath, Chethan","first_name":"Chethan","last_name":"Kamath"}],"quality_controlled":"1","conference":{"name":"PKC: Public-Key Cryptography","start_date":"2025-05-12","location":"Roros, Norway","end_date":"2025-05-15"},"main_file_link":[{"url":"https://eprint.iacr.org/2025/281","open_access":"1"}],"date_created":"2025-05-25T22:17:02Z","year":"2025","publication":"28th IACR International Conference on Practice and Theory of Public-Key Cryptography","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031918285"],"issn":["0302-9743"]},"doi":"10.1007/978-3-031-91829-2_2"},{"publisher":"Springer Nature","department":[{"_id":"ToHe"}],"date_updated":"2025-06-02T07:21:41Z","language":[{"iso":"eng"}],"month":"05","date_published":"2025-05-01T00:00:00Z","oa":1,"file_date_updated":"2025-06-02T07:10:35Z","_id":"19739","scopus_import":"1","type":"conference","acknowledgement":"This work was in part supported by the ERC-2020-AdG 10102009 grant, and in part by the German Research Foundation (DFG) - WE2290/13-2 (Coop2).","oa_version":"Published Version","intvolume":"     15698","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"citation":{"chicago":"Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15698:212–16. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">https://doi.org/10.1007/978-3-031-90660-2_14</a>.","apa":"Chalupa, M., &#38; Richter, C. (2025). BUBAAK: Dynamic cooperative verification. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15698, pp. 212–216). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">https://doi.org/10.1007/978-3-031-90660-2_14</a>","mla":"Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15698, Springer Nature, 2025, pp. 212–16, doi:<a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">10.1007/978-3-031-90660-2_14</a>.","ieee":"M. Chalupa and C. Richter, “BUBAAK: Dynamic cooperative verification,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15698, pp. 212–216.","short":"M. Chalupa, C. Richter, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 212–216.","ama":"Chalupa M, Richter C. BUBAAK: Dynamic cooperative verification. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15698. Springer Nature; 2025:212-216. doi:<a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">10.1007/978-3-031-90660-2_14</a>","ista":"Chalupa M, Richter C. 2025. BUBAAK: Dynamic cooperative verification. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15698, 212–216."},"day":"01","status":"public","alternative_title":["LNCS"],"OA_type":"hybrid","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"title":"BUBAAK: Dynamic cooperative verification","abstract":[{"lang":"eng","text":"Cooperative verification is gaining momentum in recent years. The usual setup in cooperative verification is that a verifier A is run with some pre-defined resources, and if it is not able to verify the program, the verification task is passed to a verifier B together with information learned about the program by verifier A, then the chain can continue to a verifier C, and so on. This scheme is static: tools run one after another in a fixed pre-defined order and fixed parameters and resource limits (the scheme may differ for properties to be analyzed, though).\r\n\r\nBubaak is a program analysis tool that allows to run multiple program verifiers in a dynamically changing combination of parallel and sequential portfolios. Bubaak starts the verification process by invoking an initial set of tasks; every task, when it is done (e.g., because of hitting a time limit or finishing its job), rewrites itself into one or more successor tasks. New tasks can be also spawned upon events generated by other tasks. This all happens dynamically based on the information gathered by finished and running tasks. During their execution, tasks that run in parallel can exchange (partial) verification artifacts, either directly or with Bubaak as an intermediary."}],"publication_status":"published","page":"212-216","article_processing_charge":"No","OA_place":"publisher","volume":15698,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","last_name":"Chalupa","first_name":"Marek"},{"full_name":"Richter, Cedric","last_name":"Richter","first_name":"Cedric"}],"conference":{"location":"Hamilton, ON, Canada","end_date":"2025-05-08","start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"ddc":["000"],"has_accepted_license":"1","file":[{"file_id":"19766","file_size":259050,"date_updated":"2025-06-02T07:10:35Z","access_level":"open_access","relation":"main_file","checksum":"3f604f25dbe37383acb7f8308aad3ca6","file_name":"2025_TACAS_Chalupa.pdf","content_type":"application/pdf","date_created":"2025-06-02T07:10:35Z","success":1,"creator":"dernst"}],"quality_controlled":"1","corr_author":"1","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":"10.1007/978-3-031-90660-2_14","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031906596"],"eissn":["1611-3349"]},"year":"2025","date_created":"2025-05-25T22:17:04Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"full_name":"Jafariraviz, Mahdi","first_name":"Mahdi","last_name":"Jafariraviz"},{"full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","orcid":"0000-0001-5103-038X","first_name":"Raimundo J","last_name":"Saona Urmeneta"},{"full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda"}],"OA_place":"publisher","volume":15697,"page":"217-236","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Two standard models for probabilistic systems are Markov chains (MCs) and Markov decision processes (MDPs). Classic objectives for such probabilistic models for control and planning problems are reachability and stochastic shortest path. The widely studied algorithmic approach for these problems is the Value Iteration (VI) algorithm which iteratively applies local updates called Bellman updates. There are many practical approaches for VI in the literature but they all require exponentially many Bellman updates for MCs in the worst case. A preprocessing step is an algorithm that is discrete, graph-theoretical, and requires linear space. An important open question is whether, after a polynomial-time preprocessing, VI can be achieved with sub-exponentially many Bellman updates. In this work, we present a new approach for VI based on guessing values. Our theoretical contributions are twofold. First, for MCs, we present an almost-linear-time preprocessing algorithm after which, along with guessing values, VI requires only subexponentially many Bellman updates. Second, we present an improved analysis of the speed of convergence of VI for MDPs. Finally, we present a practical algorithm for MDPs based on our new approach. Experimental results show that our approach provides a considerable improvement over existing VI-based approaches on several benchmark examples from the literature."}],"publication_status":"published","external_id":{"arxiv":["2505.06769"]},"title":"Value iteration with guessing for Markov chains and Markov decision processes","year":"2025","date_created":"2025-05-25T22:17:06Z","publication_identifier":{"isbn":["9783031906527"],"issn":["0302-9743"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-031-90653-4_11","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","corr_author":"1","quality_controlled":"1","file":[{"file_size":557481,"date_updated":"2025-06-02T07:31:12Z","checksum":"45da6efbcbed20aada16c48c8e55e2d6","relation":"main_file","access_level":"open_access","file_id":"19767","creator":"dernst","success":1,"file_name":"2025_TACAS_Chatterjee.pdf","content_type":"application/pdf","date_created":"2025-06-02T07:31:12Z"}],"has_accepted_license":"1","ddc":["000"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2025-05-03","location":"Hamilton, ON, Canada","end_date":"2025-05-08"},"oa_version":"Published Version","intvolume":"     15697","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12 grant.","type":"conference","_id":"19740","scopus_import":"1","oa":1,"file_date_updated":"2025-06-02T07:31:12Z","language":[{"iso":"eng"}],"month":"05","date_published":"2025-05-01T00:00:00Z","department":[{"_id":"KrCh"}],"arxiv":1,"publisher":"Springer Nature","date_updated":"2025-06-02T07:35:06Z","ec_funded":1,"OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"alternative_title":["LNCS"],"status":"public","day":"01","citation":{"ieee":"K. Chatterjee, M. Jafariraviz, R. J. Saona Urmeneta, and J. Svoboda, “Value iteration with guessing for Markov chains and Markov decision processes,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 217–236.","short":"K. Chatterjee, M. Jafariraviz, R.J. Saona Urmeneta, J. Svoboda, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 217–236.","ista":"Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. 2025. Value iteration with guessing for Markov chains and Markov decision processes. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 217–236.","ama":"Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. Value iteration with guessing for Markov chains and Markov decision processes. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:217-236. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">10.1007/978-3-031-90653-4_11</a>","apa":"Chatterjee, K., Jafariraviz, M., Saona Urmeneta, R. J., &#38; Svoboda, J. (2025). Value iteration with guessing for Markov chains and Markov decision processes. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 217–236). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">https://doi.org/10.1007/978-3-031-90653-4_11</a>","chicago":"Chatterjee, Krishnendu, Mahdi Jafariraviz, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:217–36. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">https://doi.org/10.1007/978-3-031-90653-4_11</a>.","mla":"Chatterjee, Krishnendu, et al. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 217–36, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">10.1007/978-3-031-90653-4_11</a>."},"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}]},{"related_material":{"record":[{"relation":"research_data","id":"19769","status":"public"}]},"volume":15696,"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Budde, Carlos E.","last_name":"Budde","first_name":"Carlos E."},{"full_name":"Hartmanns, Arnd","last_name":"Hartmanns","first_name":"Arnd"},{"last_name":"Meggendorfer","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias"},{"last_name":"Weininger","first_name":"Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian"},{"full_name":"Wienhöft, Patrick","last_name":"Wienhöft","first_name":"Patrick"}],"title":"Sound statistical model checking for probabilities and expected rewards","external_id":{"arxiv":["2411.00559"]},"publication_status":"published","abstract":[{"text":"Statistical model checking estimates probabilities and expectations of interest in probabilistic system models by using random simulations. Its results come with statistical guarantees. However, many tools use unsound statistical methods that produce incorrect results more often than they claim. In this paper, we provide a comprehensive overview of tools and their correctness, as well as of sound methods available for estimating probabilities from the literature. For expected rewards, we investigate how to bound the path reward distribution to apply sound statistical methods for bounded distributions, of which we recommend the Dvoretzky-Kiefer-Wolfowitz inequality that has not been used in SMC so far. We prove that even reachability rewards can be bounded in theory, and formalise the concept of limit-PAC procedures for a practical solution. The modes SMC tool implements our methods and recommendations, which we use to experimentally confirm our results.","lang":"eng"}],"article_processing_charge":"No","page":"167-190","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031906428"],"issn":["0302-9743"]},"doi":"10.1007/978-3-031-90643-5_9","date_created":"2025-05-25T22:17:08Z","year":"2025","conference":{"end_date":"2025-05-08","location":"Hamilton, ON, Canada","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2025-05-03"},"ddc":["000"],"has_accepted_license":"1","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2025_TACAS_Budde.pdf","date_created":"2025-06-02T09:35:42Z","file_size":711271,"date_updated":"2025-06-02T09:35:42Z","access_level":"open_access","relation":"main_file","checksum":"d45856b503b1dd4f8f14c3566327225b","file_id":"19770"}],"quality_controlled":"1","scopus_import":"1","_id":"19742","type":"conference","acknowledgement":"This work was supported by the DFG through the Cluster of Excellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy) and the TRR 248 (see perspicuous-computing.science, project ID 389792660), by the European Union’s Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreements 101008233 (MISSION), 101034413 (IST-BRIDGE), and 101067199 (ProSVED), by the EU under NextGenerationEU projects D53D23008400006 (Smartitude) under MUR PRIN 2022 and PE00000014 (SERICS) under MUR PNRR, by the Interreg North Sea project STORM_SAFE, and by NWO VIDI grant VI.Vidi.223.110 (TruSTy).","intvolume":"     15696","oa_version":"Published Version","date_updated":"2025-06-02T09:45:41Z","arxiv":1,"department":[{"_id":"KrCh"}],"publisher":"Springer Nature","date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05","file_date_updated":"2025-06-02T09:35:42Z","oa":1,"status":"public","day":"01","alternative_title":["LNCS"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"OA_type":"hybrid","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"citation":{"mla":"Budde, Carlos E., et al. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15696, Springer Nature, 2025, pp. 167–90, doi:<a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">10.1007/978-3-031-90643-5_9</a>.","chicago":"Budde, Carlos E., Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15696:167–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">https://doi.org/10.1007/978-3-031-90643-5_9</a>.","apa":"Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., &#38; Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">https://doi.org/10.1007/978-3-031-90643-5_9</a>","ista":"Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. 2025. Sound statistical model checking for probabilities and expected rewards. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15696, 167–190.","ama":"Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical model checking for probabilities and expected rewards. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15696. Springer Nature; 2025:167-190. doi:<a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">10.1007/978-3-031-90643-5_9</a>","ieee":"C. E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15696, pp. 167–190.","short":"C.E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 167–190."}},{"external_id":{"arxiv":["2501.11467"]},"publication_status":"published","abstract":[{"lang":"eng","text":"The possibility of errors in human-engineered formal verification software, such as model checkers, poses a serious threat to the purpose of these tools. An established approach to mitigate this problem are certificates—lightweight, easy-to-check proofs of the verification results. In this paper, we develop novel certificates for model checking of Markov decision processes (MDPs) with quantitative reachability and expected reward properties. Our approach is conceptually simple and relies almost exclusively on elementary fixed point theory. Our certificates work for arbitrary finite MDPs and can be readily computed with little overhead using standard algorithms. We formalize the soundness of our certificates in Isabelle/HOL and provide a formally verified certificate checker. Moreover, we augment existing algorithms in the probabilistic model checker Storm with the ability to produce certificates and demonstrate practical applicability by conducting the first formal certification of the reference results in the Quantitative Verification Benchmark Set."}],"article_processing_charge":"No","page":"130-151","title":"Fixed point certificates for reachability and expected rewards in MDPs","OA_place":"publisher","volume":15697,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Quatmann","first_name":"Tim","full_name":"Quatmann, Tim"},{"last_name":"Schäffeler","first_name":"Maximilian","full_name":"Schäffeler, Maximilian"},{"last_name":"Weininger","first_name":"Maximilian","full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"},{"full_name":"Zilken, Daniel","id":"d8ebc24a-3f98-11f0-9044-8296d4f39ab3","last_name":"Zilken","first_name":"Daniel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"relation":"research_data","id":"19771","status":"public"}]},"quality_controlled":"1","file":[{"content_type":"application/pdf","file_name":"2025_TACAS_ChatterjeeKrish.pdf","date_created":"2025-06-02T10:49:52Z","creator":"dernst","success":1,"file_id":"19772","date_updated":"2025-06-02T10:49:52Z","file_size":732136,"checksum":"64b7f46ef05649b87b827248045c7645","relation":"main_file","access_level":"open_access"}],"corr_author":"1","ddc":["000"],"conference":{"start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2025-05-08","location":"Hamilton, ON, Canada"},"has_accepted_license":"1","date_created":"2025-05-25T22:17:09Z","year":"2025","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031906527"]},"doi":"10.1007/978-3-031-90653-4_7","file_date_updated":"2025-06-02T10:49:52Z","oa":1,"date_updated":"2025-06-02T10:55:34Z","department":[{"_id":"KrCh"}],"arxiv":1,"publisher":"Springer Nature","date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05","acknowledgement":"This project has received funding from the ERC CoG 863818 (ForM-SMArt), the Austrian Science Fund (FWF) 10.55776/COE12, a KI-Starter grant from the Ministerium für Kultur und Wissenschaft NRW, the DFG RTG 378803395 (ConVeY), the EU’s Horizon 2020 research and innovation programmes under the Marie Sklodowska-Curie grant agreement Nos. 101034413 (IST-BRIDGE) and 101008233 (MISSION), and the DFG RTG 2236 (UnRAVeL). Experiments were performed with computing resources granted by RWTH Aachen University under project rwth1632.","type":"conference","intvolume":"     15697","oa_version":"Published Version","scopus_import":"1","_id":"19743","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"citation":{"short":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 130–151.","ieee":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Fixed point certificates for reachability and expected rewards in MDPs,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 130–151.","ama":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Fixed point certificates for reachability and expected rewards in MDPs. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:130-151. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">10.1007/978-3-031-90653-4_7</a>","ista":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Fixed point certificates for reachability and expected rewards in MDPs. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 130–151.","apa":"Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., &#38; Zilken, D. (2025). Fixed point certificates for reachability and expected rewards in MDPs. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 130–151). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">https://doi.org/10.1007/978-3-031-90653-4_7</a>","chicago":"Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:130–51. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">https://doi.org/10.1007/978-3-031-90653-4_7</a>.","mla":"Chatterjee, Krishnendu, et al. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 130–51, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">10.1007/978-3-031-90653-4_7</a>."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"OA_type":"hybrid","day":"01","status":"public","alternative_title":["LNCS"]},{"day":"01","status":"public","alternative_title":["LNCS"],"ec_funded":1,"OA_type":"hybrid","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"citation":{"chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Refuting Equivalence in Probabilistic Programs with Conditioning.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:279–300. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">https://doi.org/10.1007/978-3-031-90653-4_14</a>.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., &#38; Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">https://doi.org/10.1007/978-3-031-90653-4_14</a>","mla":"Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">10.1007/978-3-031-90653-4_14</a>.","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300.","ieee":"K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.","ama":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. Refuting equivalence in probabilistic programs with conditioning. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:279-300. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">10.1007/978-3-031-90653-4_14</a>","ista":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300."},"_id":"19744","scopus_import":"1","acknowledgement":"This work was partially supported by ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12. Petr Novotný is supported by the Czech Science Foundation grant no. GA23-06963S.","type":"conference","oa_version":"Published Version","intvolume":"     15697","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"arxiv":1,"date_updated":"2025-06-02T11:16:13Z","month":"05","language":[{"iso":"eng"}],"date_published":"2025-05-01T00:00:00Z","oa":1,"file_date_updated":"2025-06-02T11:13:49Z","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","doi":"10.1007/978-3-031-90653-4_14","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031906527"],"issn":["0302-9743"]},"year":"2025","date_created":"2025-05-25T22:17:10Z","ddc":["000"],"conference":{"start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada","end_date":"2025-05-08"},"has_accepted_license":"1","quality_controlled":"1","file":[{"access_level":"open_access","checksum":"7dcd85e7e753bfa994c10b3cf9ebc185","relation":"main_file","date_updated":"2025-06-02T11:13:49Z","file_size":532181,"file_id":"19773","success":1,"creator":"dernst","date_created":"2025-06-02T11:13:49Z","file_name":"2025_TACAS_Chatterjee_Goharshadi.pdf","content_type":"application/pdf"}],"corr_author":"1","OA_place":"publisher","volume":15697,"author":[{"last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Kafshdar Goharshadi","first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587"},{"id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr","last_name":"Novotný","first_name":"Petr"},{"first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Refuting equivalence in probabilistic programs with conditioning","abstract":[{"lang":"eng","text":"We consider the problem of refuting equivalence of probabilistic programs, i.e., the problem of proving that two probabilistic programs induce different output distributions. We study this problem in the context of programs with conditioning (i.e., with observe and score statements), where the output distribution is conditioned by the event that all the observe statements along a run evaluate to true, and where the probability densities of different runs may be updated via the score statements. Building on a recent work on programs without conditioning, we present a new equivalence refutation method for programs with conditioning. Our method is based on weighted restarting, a novel transformation of probabilistic programs with conditioning to the output equivalent probabilistic programs without conditioning that we introduce in this work. Our method is the first to be both a) fully automated, and b) providing provably correct answers. We demonstrate the applicability of our method on a set of programs from the probabilistic inference literature."}],"publication_status":"published","external_id":{"arxiv":["2501.06579"]},"page":"279-300","article_processing_charge":"No"},{"citation":{"ama":"Budde C, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>","ista":"Budde C, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. 2025. Sound statistical model checking for probabilities and expected rewards (experimental reproduction package), Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>.","short":"C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, (2025).","ieee":"C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards (experimental reproduction package).” Zenodo, 2025.","mla":"Budde, Carlos, et al. <i>Sound Statistical Model Checking for Probabilities and Expected Rewards (Experimental Reproduction Package)</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>.","apa":"Budde, C., Hartmanns, A., Meggendorfer, T., Weininger, M., &#38; Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14602066\">https://doi.org/10.5281/ZENODO.14602066</a>","chicago":"Budde, Carlos, Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and Expected Rewards (Experimental Reproduction Package).” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14602066\">https://doi.org/10.5281/ZENODO.14602066</a>."},"main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.14602066","open_access":"1"}],"ddc":["000"],"year":"2025","date_created":"2025-06-02T09:37:14Z","OA_type":"green","doi":"10.5281/ZENODO.14602066","status":"public","day":"07","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Artifact to reproduce the experimental results presented in the article \"Sound Statistical Model Checking for Probabilities and Expected Rewards\" by Carlos E. Budde, Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft (TACAS 2025).\r\n\r\nThe contents include all data and software (formal models, software tools, Python & bash scripts) used in the experimental evaluation presented in sections 3, 4, and 6 of the article. Detailed instructions on how to reproduce the results are bundled in the artifact."}],"oa":1,"month":"01","title":"Sound statistical model checking for probabilities and expected rewards (experimental reproduction package)","date_published":"2025-01-07T00:00:00Z","publisher":"Zenodo","department":[{"_id":"KrCh"}],"date_updated":"2025-06-02T09:45:41Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","author":[{"full_name":"Budde, Carlos","first_name":"Carlos","last_name":"Budde"},{"full_name":"Hartmanns, Arnd","last_name":"Hartmanns","first_name":"Arnd"},{"id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","first_name":"Tobias"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"},{"full_name":"Wienhöft, Patrick","first_name":"Patrick","last_name":"Wienhöft"}],"OA_place":"repository","type":"research_data_reference","_id":"19769","related_material":{"record":[{"relation":"used_in_publication","id":"19742","status":"public"}]}},{"OA_place":"repository","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"last_name":"Quatmann","first_name":"Tim","full_name":"Quatmann, Tim"},{"full_name":"Schäffeler, Maximilian","first_name":"Maximilian","last_name":"Schäffeler"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"},{"full_name":"Winkler, Tobias","last_name":"Winkler","first_name":"Tobias"},{"id":"d8ebc24a-3f98-11f0-9044-8296d4f39ab3","full_name":"Zilken, Daniel","last_name":"Zilken","first_name":"Daniel"}],"oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"19743","relation":"used_in_publication"}]},"_id":"19771","abstract":[{"lang":"eng","text":"This artifact allows to review and reproduce the Isabelle proofs and practical experiments from the paper *Fixed Point Certificates for Reachability and Expected Rewards in MDPs*.\r\nThe contents are two-fold:\r\nFirst, the artifact contains a formally verified certificate checker for the certificates presented in the paper.\r\nThe formal Isabelle/HOL proofs of the background theory can be inspected, checked by Isabelle and the code extraction can be retraced.\r\n\r\nSecond, the artifact contains a modified version of the model checking tool `Storm` with support for certificate generation. Together with the provided scripts and benchmark files, this allows to reproduce the experiments from the paper.\r\nAn appropriate subset of the experiments is given to allow a review in a timely manner. In addition, original logfiles from our experiments are provided, allowing a detailed inspection.\r\n\r\nThe package includes convenient installation scripts for [the TACAS 2023 VM](https://doi.org/10.5281/zenodo.7113223) (based on Ubuntu 22.04).\r\nA native installation on Linux or macOS systems (including the newer ARM-based machines) is also possible."}],"oa":1,"article_processing_charge":"No","date_updated":"2025-06-02T10:55:35Z","department":[{"_id":"KrCh"}],"publisher":"Zenodo","date_published":"2025-01-09T00:00:00Z","month":"01","title":"Artifact: Fixed point certificates for reachability and expected rewards in MDPs","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"green","date_created":"2025-06-02T10:13:24Z","year":"2025","status":"public","day":"09","doi":"10.5281/ZENODO.14626585","citation":{"ieee":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Artifact: Fixed point certificates for reachability and expected rewards in MDPs.” Zenodo, 2025.","short":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, (2025).","ama":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Artifact: Fixed point certificates for reachability and expected rewards in MDPs. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>","ista":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Artifact: Fixed point certificates for reachability and expected rewards in MDPs, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>.","apa":"Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., &#38; Zilken, D. (2025). Artifact: Fixed point certificates for reachability and expected rewards in MDPs. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14626585\">https://doi.org/10.5281/ZENODO.14626585</a>","chicago":"Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14626585\">https://doi.org/10.5281/ZENODO.14626585</a>.","mla":"Chatterjee, Krishnendu, et al. <i>Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>."},"ddc":["000"],"main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.14626585","open_access":"1"}]},{"volume":20,"OA_place":"publisher","author":[{"full_name":"Bernat, M.","last_name":"Bernat","first_name":"M."},{"full_name":"Miles, E. S.","first_name":"E. S.","last_name":"Miles"},{"last_name":"Kneib","first_name":"M.","full_name":"Kneib, M."},{"full_name":"Fujita, K.","last_name":"Fujita","first_name":"K."},{"full_name":"Sasaki, O.","last_name":"Sasaki","first_name":"O."},{"id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","orcid":"0000-0001-7640-6152","full_name":"Shaw, Thomas","first_name":"Thomas","last_name":"Shaw"},{"last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","orcid":"0000-0002-5554-8087"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"relation":"research_data","id":"19780","status":"public"}]},"abstract":[{"text":"Snow cover is of key importance for water resources in high mountain Asia (HMA) and is expected to undergo extensive changes in a warming climate. Past studies have quantified snow cover changes with satellite products of relatively low spatial resolution (∼500 m) which are hindered by the steep topography of this mountain region. We derive snowlines from Sentinel-2 and Landsat 5, 7 and 8 images, which, thanks to their higher spatial resolution, are less sensitive to the local topography. We calculate the snow line altitude (SLA) and its seasonality for all glacierized catchments of HMA and link these patterns to climate variables corrected for topographic biases. As such, the snowline changes provide a clear proxy for climatic changes. Our results highlight a strong spatial variability in mean SLA and in its seasonal changes, including across mountain chains and between the monsoon-dominated and the westerlies-dominated catchments. Over the period 1999–2019, the western regions of HMA (Pamir, Karakoram, Western Himalaya) have undergone increased snow coverage, expressed as seasonal SLA decrease, in spring and summer. This change is opposed to a widespread increase in SLA in autumn across the region, and especially the southeastern regions of HMA (Nyainqentanglha, Hengduan Shan, South–East Himalaya). Our results indicate that the diversity of seasonal snow dynamics across the region is controlled not by temperature or precipitation directly but by the timing and partitioning of solid precipitation. Decadal snowline changes (1999–2009 vs 2009–2019) seasonally precede temperature changes, suggesting that seasonal temperature changes in the Karakoram–Pamir and Eastern Nyainqentanglha regions may have responded to snow cover changes, rather than driving them.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001493525600001"]},"article_processing_charge":"Yes","title":"Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia","article_number":"064039","year":"2025","date_created":"2025-06-03T07:30:21Z","publication":"Environmental Research Letters","issue":"6","doi":"10.1088/1748-9326/adcf39","publication_identifier":{"eissn":["1748-9326"]},"quality_controlled":"1","file":[{"access_level":"open_access","checksum":"84a8d895762f0ab4b30b34e7387b33c7","relation":"main_file","file_size":3604497,"date_updated":"2025-06-03T08:10:45Z","file_id":"19781","success":1,"creator":"dernst","date_created":"2025-06-03T08:10:45Z","file_name":"2025_EnvironmResearchLetters_Bernat.pdf","content_type":"application/pdf"}],"ddc":["550"],"has_accepted_license":"1","type":"journal_article","acknowledgement":"This work was supported by the SNSF (Science and Swiss National Science Foundation)-SSSTC (Sino-Swiss Science and Technology Cooperation) Project (IZLCZ0_189890) 'Understanding snow, glacier and rivers response to climate in High Mountain Asia (ASCENT)', by the JSPS (Japan Society for the Promotion)-SNSF Bilateral Programmes project (HOPE, High-elevation precipitation in High Mountain Asia; Grant 183633), and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers in High Mountain Asia; Grant 772751). Marin Kneib acknowledges funding from the SNSF Postdoc.Mobility program (Grant No. P500PN_210739).","article_type":"original","oa_version":"Published Version","intvolume":"        20","_id":"19777","scopus_import":"1","oa":1,"file_date_updated":"2025-06-03T08:10:45Z","DOAJ_listed":"1","isi":1,"department":[{"_id":"FrPe"}],"publisher":"IOP Publishing","date_updated":"2025-09-30T12:43:11Z","language":[{"iso":"eng"}],"month":"06","date_published":"2025-06-01T00:00:00Z","OA_type":"gold","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"01","citation":{"mla":"Bernat, M., et al. “Precipitation Phase Drives Seasonal and Decadal Snowline Changes in High Mountain Asia.” <i>Environmental Research Letters</i>, vol. 20, no. 6, 064039, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.1088/1748-9326/adcf39\">10.1088/1748-9326/adcf39</a>.","chicago":"Bernat, M., E. S. Miles, M. Kneib, K. Fujita, O. Sasaki, Thomas Shaw, and Francesca Pellicciotti. “Precipitation Phase Drives Seasonal and Decadal Snowline Changes in High Mountain Asia.” <i>Environmental Research Letters</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.1088/1748-9326/adcf39\">https://doi.org/10.1088/1748-9326/adcf39</a>.","apa":"Bernat, M., Miles, E. S., Kneib, M., Fujita, K., Sasaki, O., Shaw, T., &#38; Pellicciotti, F. (2025). Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia. <i>Environmental Research Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1748-9326/adcf39\">https://doi.org/10.1088/1748-9326/adcf39</a>","ama":"Bernat M, Miles ES, Kneib M, et al. Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia. <i>Environmental Research Letters</i>. 2025;20(6). doi:<a href=\"https://doi.org/10.1088/1748-9326/adcf39\">10.1088/1748-9326/adcf39</a>","ista":"Bernat M, Miles ES, Kneib M, Fujita K, Sasaki O, Shaw T, Pellicciotti F. 2025. Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia. Environmental Research Letters. 20(6), 064039.","ieee":"M. Bernat <i>et al.</i>, “Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia,” <i>Environmental Research Letters</i>, vol. 20, no. 6. IOP Publishing, 2025.","short":"M. Bernat, E.S. Miles, M. Kneib, K. Fujita, O. Sasaki, T. Shaw, F. Pellicciotti, Environmental Research Letters 20 (2025)."}},{"publication":"28th IACR International Conference on Practice and Theory of Public-Key Cryptography","doi":"10.1007/978-3-031-91820-9_2","publication_identifier":{"isbn":["9783031918193"],"eisbn":["9783031918209"],"issn":["0302-9743"],"eissn":["1611-3349"]},"date_created":"2025-06-03T07:30:21Z","year":"2025","conference":{"name":"PKC: Public-Key Cryptography","start_date":"2025-05-12","location":"Roros, Norway","end_date":"2025-05-15"},"main_file_link":[{"open_access":"1","url":"https://ia.cr/2024/481"}],"quality_controlled":"1","corr_author":"1","related_material":{"record":[{"status":"public","id":"20920","relation":"dissertation_contains"},{"status":"public","relation":"dissertation_contains","id":"20556"}]},"OA_place":"repository","volume":15674,"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"full_name":"Hoffmann, Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","orcid":"0000-0003-2027-5549","first_name":"Charlotte","last_name":"Hoffmann"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","first_name":"Krzysztof Z"}],"title":"Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation","publication_status":"published","abstract":[{"text":"A verifiable delay function VDF(x, T)->(y, π) maps an input x and time parameter T to an output y together with an efficiently verifiable proof π certifying that y was correctly computed. The function runs in T sequential steps, and it should not be possible to compute y much faster than that. The only known practical VDFs use sequential squaring in groups of unknown order as the sequential function, i.e., y = x^2^T. There are two constructions for the proof of exponentiation (PoE) certifying that y = x^2^T, with Wesolowski (Eurocrypt’19) having very short proofs, but they are more expensive to compute and the soundness relies on stronger assumptions than the PoE proposed by Pietrzak (ITCS’19).\r\nA recent application of VDFs by Arun, Bonneau and Clark (Asiacrypt’22) are short-lived proofs and signatures, which are proofs and signatures that are only sound for some time t, but after that can be forged by anyone. For this they rely on “watermarkable VDFs”, where the proof embeds a prover chosen watermark. To achieve stronger notions of proofs/signatures with reusable forgeability, they rely on “zero-knowledge VDFs”, where instead of the output y, one just proves knowledge of this output. The existing proposals for watermarkable and zero-knowledge VDFs all build on Wesolowski’s PoE, for the watermarkable VDFs there’s currently no security proof.\r\n\r\nIn this work we give the first constructions that transform any PoEs in hidden order groups into watermarkable VDFs and into zkVDFs, solving an open question by Arun et al. Unlike our watermarkable VDF, the zkVDF (required for reusable forgeability) is not very practical as the number of group elements in the proof is a security parameter. To address this, we introduce the notion of zero-knowledge proofs of sequential work (zkPoSW), a notion that relaxes zkVDFs by not requiring that the output is unique. We show that zkPoSW are sufficient to construct proofs or signatures with reusable forgeability, and construct efficient zkPoSW from any PoE, ultimately achieving short lived proofs and signatures that improve upon Arun et al.’s construction in several dimensions (faster forging times, arguably weaker assumptions).\r\nA key idea underlying our constructions is to not directly construct a (watermarked or zk) proof for y = x^2^T, but instead give a (watermarked or zk) proof for the more basic statement that \r\nx^l, y^l satisfy x^l = x ^r, y^l = y^r for some r, together with a normal PoE for y^l = (x^l)^2^T.","lang":"eng"}],"article_processing_charge":"No","page":"36-66","day":"01","status":"public","alternative_title":["LNCS"],"OA_type":"green","citation":{"apa":"Hoffmann, C., &#38; Pietrzak, K. Z. (2025). Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i> (Vol. 15674, pp. 36–66). Roros, Norway: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">https://doi.org/10.1007/978-3-031-91820-9_2</a>","chicago":"Hoffmann, Charlotte, and Krzysztof Z Pietrzak. “Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation.” In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, 15674:36–66. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">https://doi.org/10.1007/978-3-031-91820-9_2</a>.","mla":"Hoffmann, Charlotte, and Krzysztof Z. Pietrzak. “Watermarkable and Zero-Knowledge Verifiable Delay Functions from Any Proof of Exponentiation.” <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, vol. 15674, Springer Nature, 2025, pp. 36–66, doi:<a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">10.1007/978-3-031-91820-9_2</a>.","ieee":"C. Hoffmann and K. Z. Pietrzak, “Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation,” in <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, Roros, Norway, 2025, vol. 15674, pp. 36–66.","short":"C. Hoffmann, K.Z. Pietrzak, in:, 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Springer Nature, 2025, pp. 36–66.","ama":"Hoffmann C, Pietrzak KZ. Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. In: <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>. Vol 15674. Springer Nature; 2025:36-66. doi:<a href=\"https://doi.org/10.1007/978-3-031-91820-9_2\">10.1007/978-3-031-91820-9_2</a>","ista":"Hoffmann C, Pietrzak KZ. 2025. Watermarkable and zero-knowledge Verifiable Delay Functions from any proof of exponentiation. 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 15674, 36–66."},"scopus_import":"1","_id":"19778","type":"conference","oa_version":"Preprint","intvolume":"     15674","date_updated":"2026-04-16T09:11:09Z","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"publisher":"Springer Nature","date_published":"2025-01-01T00:00:00Z","month":"01","language":[{"iso":"eng"}],"oa":1},{"citation":{"ama":"Negi P, He B, Ukolov D, et al. Evidence of ferroelectric distortions in topological crystalline insulators via transverse thermoelectric measurements. <i>Journal of the American Chemical Society</i>. 2025;147(22):18704-18711. doi:<a href=\"https://doi.org/10.1021/jacs.5c01700\">10.1021/jacs.5c01700</a>","ista":"Negi P, He B, Ukolov D, Horta S, Maji K, Mao N, Peshcherenko N, Yanda P, Yao M, Dutta M, Robredo I, Iraola M, Vergniory MG, Lemmens P, Zhang Y, Shekhar C, Ibáñez M, Felser C, Roychowdhury S. 2025. Evidence of ferroelectric distortions in topological crystalline insulators via transverse thermoelectric measurements. Journal of the American Chemical Society. 147(22), 18704–18711.","ieee":"P. Negi <i>et al.</i>, “Evidence of ferroelectric distortions in topological crystalline insulators via transverse thermoelectric measurements,” <i>Journal of the American Chemical Society</i>, vol. 147, no. 22. American Chemical Society, pp. 18704–18711, 2025.","short":"P. Negi, B. He, D. Ukolov, S. Horta, K. Maji, N. Mao, N. Peshcherenko, P. Yanda, M. Yao, M. Dutta, I. Robredo, M. Iraola, M.G. Vergniory, P. Lemmens, Y. Zhang, C. Shekhar, M. Ibáñez, C. Felser, S. Roychowdhury, Journal of the American Chemical Society 147 (2025) 18704–18711.","mla":"Negi, Pranav, et al. “Evidence of Ferroelectric Distortions in Topological Crystalline Insulators via Transverse Thermoelectric Measurements.” <i>Journal of the American Chemical Society</i>, vol. 147, no. 22, American Chemical Society, 2025, pp. 18704–11, doi:<a href=\"https://doi.org/10.1021/jacs.5c01700\">10.1021/jacs.5c01700</a>.","chicago":"Negi, Pranav, Bin He, Denis Ukolov, Sharona Horta, Krishnendu Maji, Ning Mao, Nikolai Peshcherenko, et al. “Evidence of Ferroelectric Distortions in Topological Crystalline Insulators via Transverse Thermoelectric Measurements.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/jacs.5c01700\">https://doi.org/10.1021/jacs.5c01700</a>.","apa":"Negi, P., He, B., Ukolov, D., Horta, S., Maji, K., Mao, N., … Roychowdhury, S. (2025). Evidence of ferroelectric distortions in topological crystalline insulators via transverse thermoelectric measurements. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.5c01700\">https://doi.org/10.1021/jacs.5c01700</a>"},"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"OA_type":"closed access","status":"public","day":"22","isi":1,"month":"05","language":[{"iso":"eng"}],"date_published":"2025-05-22T00:00:00Z","publisher":"American Chemical Society","department":[{"_id":"MaIb"}],"date_updated":"2025-12-30T08:32:19Z","article_type":"original","intvolume":"       147","oa_version":"None","acknowledgement":"P.N. thanks the IISER Bhopal for a fellowship. S.R.C. acknowledges generous funding support and CIF facility (PXRD) from IISER Bhopal. C.F. acknowledges the Deutsche Forschungsgemeinschaft (DFG) under SFB1143 (project no. 247310070), the Würzburg-Dresden Cluster of Excellence on Complexity and Topology in Quantum Matter─ct.qmat (EXC 2147, project no. 390858490) and the QUAST-FOR5249-449872909. P.L. and D.U. acknowledge support by DFG EXC-2123 QuantumFrontiers–390837967. The work of M.I. was funded by the European Union NextGenerationEU/PRTR-C17.I1, as well as by the IKUR Strategy under the collaboration agreement between Ikerbasque Foundation and DIPC on behalf of the Department of Education of the Basque Government. M.G.V. and M.I. thank support to the Spanish Ministerio de Ciencia e Innovacion (grant PID2022-142008NBI00). Y.Z. is supported by the Max Planck Partner lab from Max Planck Institute Chemical Physics of Solids. We acknowledge Petra III-DESY for the XPDF measurements and PXRD measurements. This research was supported by the Scientific Service Units (SSU) of ISTA Austria through resources provided by Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NNF). ISTA acknowledges the Werner Siemens Foundation (WSS) for financial support.","type":"journal_article","_id":"19779","scopus_import":"1","quality_controlled":"1","year":"2025","date_created":"2025-06-03T07:30:22Z","issue":"22","doi":"10.1021/jacs.5c01700","publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"publication":"Journal of the American Chemical Society","page":"18704-18711","article_processing_charge":"No","abstract":[{"text":"The transverse thermoelectric (Nernst) effect is a powerful probe for studying the electronic and structural properties of materials. In this study, we employ transverse thermoelectric measurements to investigate the ferroelectric distortion in the topological crystalline insulator (TCI) Pb0.60Sn0.40Te, a compound derived from PbTe and SnTe, known for their exceptional thermoelectric performance and distinct ferroelectric properties. By leveraging Nernst measurements, we provide direct evidence of ferroelectric distortion in this TCI, corroborated by Shubnikov–de Haas quantum oscillations that confirm the presence of two topologically nontrivial Fermi pockets. Density functional theory calculations show that these pockets originate from the L and T points in the Brillouin zone of the distorted structure within the TCI phase. Raman spectroscopy further identifies a structural phase transition below 50 K, consistent with the quantum oscillation observations. This observation is further substantiated by temperature-dependent synchrotron X-ray pair distribution function analysis and transmission electron microscopy, which confirm the local off-centering of cations at low temperature. These findings underscore the potential of transverse thermoelectric measurements in unveiling ferroelectric distortions and their role in modulating topological quantum states, opening new directions for research into the synergy between ferroelectricity and topological phases.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["001493301300001"],"pmid":["40402919"]},"title":"Evidence of ferroelectric distortions in topological crystalline insulators via transverse thermoelectric measurements","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Negi, Pranav","last_name":"Negi","first_name":"Pranav"},{"first_name":"Bin","last_name":"He","full_name":"He, Bin"},{"full_name":"Ukolov, Denis","last_name":"Ukolov","first_name":"Denis"},{"first_name":"Sharona","last_name":"Horta","full_name":"Horta, Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc"},{"full_name":"Maji, Krishnendu","id":"76bc9e9f-ba0b-11ee-8184-90edabd17a58","last_name":"Maji","first_name":"Krishnendu"},{"full_name":"Mao, Ning","first_name":"Ning","last_name":"Mao"},{"full_name":"Peshcherenko, Nikolai","last_name":"Peshcherenko","first_name":"Nikolai"},{"full_name":"Yanda, Premakumar","first_name":"Premakumar","last_name":"Yanda"},{"first_name":"Mengyu","last_name":"Yao","full_name":"Yao, Mengyu"},{"full_name":"Dutta, Moinak","first_name":"Moinak","last_name":"Dutta"},{"first_name":"Iñigo","last_name":"Robredo","full_name":"Robredo, Iñigo"},{"full_name":"Iraola, Mikel","first_name":"Mikel","last_name":"Iraola"},{"full_name":"Vergniory, Maia G.","first_name":"Maia G.","last_name":"Vergniory"},{"first_name":"Peter","last_name":"Lemmens","full_name":"Lemmens, Peter"},{"last_name":"Zhang","first_name":"Yang","full_name":"Zhang, Yang"},{"full_name":"Shekhar, Chandra","last_name":"Shekhar","first_name":"Chandra"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","last_name":"Ibáñez"},{"last_name":"Felser","first_name":"Claudia","full_name":"Felser, Claudia"},{"last_name":"Roychowdhury","first_name":"Subhajit","full_name":"Roychowdhury, Subhajit"}],"volume":147,"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"pmid":1},{"status":"public","day":"15","doi":"10.5281/ZENODO.15223343","OA_type":"green","contributor":[{"first_name":"Evan Stuart","contributor_type":"project_member","last_name":"Miles"},{"contributor_type":"project_member","last_name":"Kneib","first_name":"Marin"},{"last_name":"Fujita","contributor_type":"project_member","first_name":"Koji"},{"last_name":"Sasaki","contributor_type":"project_member","first_name":"Orie"},{"orcid":"0000-0001-7640-6152","id":"3caa3f91-1f03-11ee-96ce-e0e553054d6e","first_name":"Thomas","contributor_type":"project_member","last_name":"Shaw"},{"orcid":"0000-0002-5554-8087","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","contributor_type":"project_member","first_name":"Francesca"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"year":"2025","date_created":"2025-06-03T08:05:29Z","ddc":["550"],"main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.15223343","open_access":"1"}],"has_accepted_license":"1","citation":{"chicago":"Bernat, M. “Snow Line Altitude in High Mountain Asia Derived from Satellite Imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.15223343\">https://doi.org/10.5281/ZENODO.15223343</a>.","apa":"Bernat, M. (2025). Snow line altitude in high mountain Asia derived from satellite imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.15223343\">https://doi.org/10.5281/ZENODO.15223343</a>","mla":"Bernat, M. <i>Snow Line Altitude in High Mountain Asia Derived from Satellite Imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.15223343\">10.5281/ZENODO.15223343</a>.","short":"M. Bernat, (2025).","ieee":"M. Bernat, “Snow line altitude in high mountain Asia derived from satellite imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019.” Zenodo, 2025.","ama":"Bernat M. Snow line altitude in high mountain Asia derived from satellite imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.15223343\">10.5281/ZENODO.15223343</a>","ista":"Bernat M. 2025. Snow line altitude in high mountain Asia derived from satellite imagery (LS5, LS7, LS8 &#38; S2) between 1999 and 2019, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.15223343\">10.5281/ZENODO.15223343</a>."},"related_material":{"record":[{"id":"19777","relation":"used_in_publication","status":"public"}]},"_id":"19780","acknowledgement":"This work was supported by the SNSF (Science and Swiss National Science Foundation)-SSSTC (Sino-Swiss Science and Technology Cooperation) Project (IZLCZ0_189890) 'Understanding snow, glacier and rivers response to climate in High Mountain Asia (ASCENT)', by the JSPS (Japan Society for the Promotion)-SNSF Bilateral Programmes project (HOPE, High-elevation precipitation in High Mountain Asia; Grant 183633), and the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers in High Mountain Asia; Grant 772751). Marin Kneib acknowledges funding from the SNSF Postdoc.Mobility program (Grant No. P500PN_210739).","OA_place":"repository","type":"research_data_reference","author":[{"last_name":"Bernat","first_name":"M","full_name":"Bernat, M"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Zenodo","department":[{"_id":"FrPe"}],"date_updated":"2025-09-30T12:43:10Z","month":"04","title":"Snow line altitude in high mountain Asia derived from satellite imagery (LS5, LS7, LS8 & S2) between 1999 and 2019","date_published":"2025-04-15T00:00:00Z","oa":1,"abstract":[{"lang":"eng","text":"This repository contains the data used for the study Precipitation phase drives seasonal and decadal snowline changes in high mountain Asia.\r\n\r\nThis study focuses on 4776 glacierized catchments across high mountain Asia (HMA). They are numbered from 0 to 4775. This code number is then used in all the products as their unique ID. "}],"article_processing_charge":"No"},{"OA_type":"hybrid","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"day":"01","status":"public","project":[{"call_identifier":"H2020","name":"Bridging Scales in Random Materials","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819"}],"citation":{"ieee":"C. Hurm and M. Moser, “Nonlocal‐to‐local convergence for a Cahn–Hilliard tumor growth model,” <i>GAMM-Mitteilungen</i>, vol. 48, no. 2. Wiley, 2025.","short":"C. Hurm, M. Moser, GAMM-Mitteilungen 48 (2025).","ama":"Hurm C, Moser M. Nonlocal‐to‐local convergence for a Cahn–Hilliard tumor growth model. <i>GAMM-Mitteilungen</i>. 2025;48(2). doi:<a href=\"https://doi.org/10.1002/gamm.70003\">10.1002/gamm.70003</a>","ista":"Hurm C, Moser M. 2025. Nonlocal‐to‐local convergence for a Cahn–Hilliard tumor growth model. GAMM-Mitteilungen. 48(2), e70003.","chicago":"Hurm, Christoph, and Maximilian Moser. “Nonlocal‐to‐local Convergence for a Cahn–Hilliard Tumor Growth Model.” <i>GAMM-Mitteilungen</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/gamm.70003\">https://doi.org/10.1002/gamm.70003</a>.","apa":"Hurm, C., &#38; Moser, M. (2025). Nonlocal‐to‐local convergence for a Cahn–Hilliard tumor growth model. <i>GAMM-Mitteilungen</i>. Wiley. <a href=\"https://doi.org/10.1002/gamm.70003\">https://doi.org/10.1002/gamm.70003</a>","mla":"Hurm, Christoph, and Maximilian Moser. “Nonlocal‐to‐local Convergence for a Cahn–Hilliard Tumor Growth Model.” <i>GAMM-Mitteilungen</i>, vol. 48, no. 2, e70003, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/gamm.70003\">10.1002/gamm.70003</a>."},"type":"journal_article","acknowledgement":"C. Hurm was partially supported by the Graduiertenkolleg 2339 IntComSin of the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation)–Project-ID 321821685. M. Moser has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreement No 948819). The support is gratefully acknowledged. Finally, we thank Daniel Böhme and Jonas Stange for careful proofreading. Open Access funding enabled and organized by Projekt DEAL.","article_type":"original","oa_version":"Published Version","intvolume":"        48","_id":"19783","scopus_import":"1","oa":1,"file_date_updated":"2025-06-03T09:12:22Z","arxiv":1,"department":[{"_id":"JuFi"}],"publisher":"Wiley","date_updated":"2025-06-03T09:14:17Z","language":[{"iso":"eng"}],"month":"06","date_published":"2025-06-01T00:00:00Z","article_number":"e70003","year":"2025","date_created":"2025-06-03T08:58:01Z","publication":"GAMM-Mitteilungen","issue":"2","publication_identifier":{"eissn":["1522-2608"],"issn":["0936-7195"]},"doi":"10.1002/gamm.70003","quality_controlled":"1","file":[{"file_id":"19786","access_level":"open_access","relation":"main_file","checksum":"6bac9d3e566b68519ae80ac8b0f41f20","date_updated":"2025-06-03T09:12:22Z","file_size":513741,"date_created":"2025-06-03T09:12:22Z","content_type":"application/pdf","file_name":"2025_GAMM_Hurm.pdf","success":1,"creator":"dernst"}],"ddc":["510"],"has_accepted_license":"1","OA_place":"publisher","volume":48,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hurm, Christoph","first_name":"Christoph","last_name":"Hurm"},{"full_name":"Moser, Maximilian","id":"a60047a9-da77-11eb-85b4-c4dc385ebb8c","last_name":"Moser","first_name":"Maximilian"}],"abstract":[{"lang":"eng","text":"We consider a local Cahn–Hilliard‐type model for tumor growth as well as a nonlocal model where, compared to the local system, the Laplacian in the equation for the chemical potential is replaced by a nonlocal operator. The latter is defined as a convolution integral with suitable kernels parametrized by a small parameter. For sufficiently smooth bounded domains in three dimensions, we prove convergence of weak solutions of the nonlocal model toward strong solutions of the local model together with convergence rates with respect to the small parameter. The proof is done via a Gronwall‐type argument and a convergence result with rates for the nonlocal integral operator toward the Laplacian due to Abels and Hurm."}],"external_id":{"arxiv":["2402.13790"]},"publication_status":"published","article_processing_charge":"Yes (via OA deal)","title":"Nonlocal‐to‐local convergence for a Cahn–Hilliard tumor growth model"},{"citation":{"short":"A. de Graaff, G. Brammer, A. Weibel, Z. Lewis, M.V. Maseda, P.A. Oesch, R. Bezanson, L.A. Boogaard, N.J. Cleri, O.R. Cooper, R. Gottumukkala, J.E. Greene, M. Hirschmann, R.E. Hviding, H. Katz, I. Labbé, J. Leja, J.J. Matthee, I. McConachie, T.B. Miller, R.P. Naidu, S.H. Price, H.-W. Rix, D.J. Setton, K.A. Suess, B. Wang, K.E. Whitaker, C.C. Williams, Astronomy &#38; Astrophysics 697 (2025).","ieee":"A. de Graaff <i>et al.</i>, “RUBIES: A complete census of the bright and red distant universe with JWST/NIRSpec,” <i>Astronomy &#38; Astrophysics</i>, vol. 697. EDP Sciences, 2025.","ista":"de Graaff A, Brammer G, Weibel A, Lewis Z, Maseda MV, Oesch PA, Bezanson R, Boogaard LA, Cleri NJ, Cooper OR, Gottumukkala R, Greene JE, Hirschmann M, Hviding RE, Katz H, Labbé I, Leja J, Matthee JJ, McConachie I, Miller TB, Naidu RP, Price SH, Rix H-W, Setton DJ, Suess KA, Wang B, Whitaker KE, Williams CC. 2025. RUBIES: A complete census of the bright and red distant universe with JWST/NIRSpec. Astronomy &#38; Astrophysics. 697, A189.","ama":"de Graaff A, Brammer G, Weibel A, et al. RUBIES: A complete census of the bright and red distant universe with JWST/NIRSpec. <i>Astronomy &#38; Astrophysics</i>. 2025;697. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452186\">10.1051/0004-6361/202452186</a>","chicago":"Graaff, Anna de, Gabriel Brammer, Andrea Weibel, Zach Lewis, Michael V. Maseda, Pascal A. Oesch, Rachel Bezanson, et al. “RUBIES: A Complete Census of the Bright and Red Distant Universe with JWST/NIRSpec.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452186\">https://doi.org/10.1051/0004-6361/202452186</a>.","apa":"de Graaff, A., Brammer, G., Weibel, A., Lewis, Z., Maseda, M. V., Oesch, P. A., … Williams, C. C. (2025). RUBIES: A complete census of the bright and red distant universe with JWST/NIRSpec. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452186\">https://doi.org/10.1051/0004-6361/202452186</a>","mla":"de Graaff, Anna, et al. “RUBIES: A Complete Census of the Bright and Red Distant Universe with JWST/NIRSpec.” <i>Astronomy &#38; Astrophysics</i>, vol. 697, A189, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452186\">10.1051/0004-6361/202452186</a>."},"status":"public","day":"19","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"diamond","date_updated":"2025-09-30T12:45:25Z","publisher":"EDP Sciences","department":[{"_id":"JoMa"}],"date_published":"2025-05-19T00:00:00Z","month":"05","language":[{"iso":"eng"}],"file_date_updated":"2025-06-03T09:25:49Z","oa":1,"isi":1,"scopus_import":"1","_id":"19784","acknowledgement":"We thank the CEERS and PRIMER teams for making their imaging data publicly available immediately. This work is based on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with programs #1345, #1837 #2234, #2279, #2514, #2750, #3990 and #4233. Support for program #4233 was provided by NASA through a grant from the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127. REH acknowledges support by the German Aerospace Center (DLR) and the Federal Ministry for Economic Affairs and Energy (BMWi) through program 50OR2403 ‘RUBIES’. This research was supported by the International Space Science Institute (ISSI) in Bern, through ISSI International Team project #562. The Cosmic Dawn Center is funded by the Danish National Research Foundation (DNRF) under grant #140. This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract number MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. Support for this work for RPN was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS5-26555. Open Access funding provided by Max Planck Society.","type":"journal_article","oa_version":"Published Version","intvolume":"       697","article_type":"original","ddc":["520"],"has_accepted_license":"1","file":[{"date_created":"2025-06-03T09:25:49Z","file_name":"2025_AstronomyAstrophysics_deGraaff.pdf","content_type":"application/pdf","creator":"dernst","success":1,"file_id":"19788","relation":"main_file","checksum":"cccf44629f28535dde91f2ebdf38c054","access_level":"open_access","file_size":6874721,"date_updated":"2025-06-03T09:25:49Z"}],"quality_controlled":"1","publication":"Astronomy & Astrophysics","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"doi":"10.1051/0004-6361/202452186","article_number":"A189","date_created":"2025-06-03T08:59:52Z","year":"2025","title":"RUBIES: A complete census of the bright and red distant universe with JWST/NIRSpec","external_id":{"isi":["001490583400004"]},"publication_status":"published","abstract":[{"lang":"eng","text":"We present the Red Unknowns: Bright Infrared Extragalactic Survey (RUBIES) providing JWST/NIRSpec spectroscopy of red sources selected across ∼150 arcmin2 from public JWST/NIRCam imaging in the UDS and EGS fields. The novel observing strategy of RUBIES offers a well-quantified selection function. The survey has been optimised to reach high (>70%) spectroscopic completeness for bright and red (F150W−F444W>2) sources that are very rare. To place these rare sources in context, we simultaneously observed a reference sample of the 2<z<7 galaxy population, sampling sources at a rate that is inversely proportional to their number density in the 3D parameter space of F444W magnitude, F150W−F444W colour, and photometric redshift. In total, RUBIES observed ∼3000 targets across 1<zphot<10 with both the PRISM and G395M dispersers and ∼1500 targets at zphot>3 using only the G395M disperser. The RUBIES data reveal a highly diverse population of red sources that span a broad redshift range (zspec∼1−9), with photometric redshift scatter and an outlier fraction that are three times higher than for similarly bright sources that are less red. This diversity is not apparent from the photometric spectral energy distributions (SEDs). Only spectroscopy reveals that the SEDs encompass a mixture of galaxies with dust-obscured star formation, extreme line emission, a lack of star formation indicating early quenching, and luminous active galactic nuclei. As a first demonstration of our broader selection function we compared the stellar masses and rest-frame U−V colours of the red sources and our reference sample. We find that the red sources are typically more massive (M*∼1010−11.5 M⊙) across all redshifts. However, we also find that the most massive systems span a wide range in U−V colour. We describe our data reduction procedure and data quality, and we publicly release the reduced RUBIES data and vetted spectroscopic redshifts of the first half of the survey through the DAWN JWST Archive."}],"article_processing_charge":"Yes","OA_place":"publisher","volume":697,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"full_name":"de Graaff, Anna","first_name":"Anna","last_name":"de Graaff"},{"first_name":"Gabriel","last_name":"Brammer","full_name":"Brammer, Gabriel"},{"last_name":"Weibel","first_name":"Andrea","full_name":"Weibel, Andrea"},{"full_name":"Lewis, Zach","last_name":"Lewis","first_name":"Zach"},{"full_name":"Maseda, Michael V.","first_name":"Michael V.","last_name":"Maseda"},{"full_name":"Oesch, Pascal A.","last_name":"Oesch","first_name":"Pascal A."},{"full_name":"Bezanson, Rachel","first_name":"Rachel","last_name":"Bezanson"},{"full_name":"Boogaard, Leindert A.","last_name":"Boogaard","first_name":"Leindert A."},{"full_name":"Cleri, Nikko J.","last_name":"Cleri","first_name":"Nikko J."},{"first_name":"Olivia R.","last_name":"Cooper","full_name":"Cooper, Olivia R."},{"full_name":"Gottumukkala, Rashmi","first_name":"Rashmi","last_name":"Gottumukkala"},{"full_name":"Greene, Jenny E.","first_name":"Jenny E.","last_name":"Greene"},{"full_name":"Hirschmann, Michaela","first_name":"Michaela","last_name":"Hirschmann"},{"first_name":"Raphael E.","last_name":"Hviding","full_name":"Hviding, Raphael E."},{"full_name":"Katz, Harley","first_name":"Harley","last_name":"Katz"},{"full_name":"Labbé, Ivo","last_name":"Labbé","first_name":"Ivo"},{"first_name":"Joel","last_name":"Leja","full_name":"Leja, Joel"},{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"last_name":"McConachie","first_name":"Ian","full_name":"McConachie, Ian"},{"full_name":"Miller, Tim B.","first_name":"Tim B.","last_name":"Miller"},{"full_name":"Naidu, Rohan P.","last_name":"Naidu","first_name":"Rohan P."},{"first_name":"Sedona H.","last_name":"Price","full_name":"Price, Sedona H."},{"full_name":"Rix, Hans-Walter","first_name":"Hans-Walter","last_name":"Rix"},{"full_name":"Setton, David J.","first_name":"David J.","last_name":"Setton"},{"last_name":"Suess","first_name":"Katherine A.","full_name":"Suess, Katherine A."},{"full_name":"Wang, Bingjie","first_name":"Bingjie","last_name":"Wang"},{"full_name":"Whitaker, Katherine E.","last_name":"Whitaker","first_name":"Katherine E."},{"first_name":"Christina C.","last_name":"Williams","full_name":"Williams, Christina C."}]},{"file_date_updated":"2025-06-04T14:26:29Z","oa":1,"date_published":"2025-06-04T00:00:00Z","month":"06","date_updated":"2025-09-30T14:34:42Z","publisher":"Institute of Science and Technology Austria","department":[{"_id":"MaSe"}],"oa_version":"Preprint","type":"research_data","acknowledgement":"The authors are grateful to Fiona Burnell, Gaurav Gyawali, Zlatko Papi´c, Elliot Rosenberg, Pedram Roushan, and Michael Schecter for insightful discussions. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 101034413. T.I. Acknowledges support from the National Science Foundation under Grant No. DMR-2143635. J.C.H. acknowledges support from the Emmy Noether Programme of the German Research Foundation (DFG) under grant no. HA 8206/1-1.","_id":"19791","citation":{"ista":"Desaules J-YM. 2025. Research Data for ‘Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:19791\">10.15479/AT:ISTA:19791</a>.","ama":"Desaules J-YM. Research Data for “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” 2025. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:19791\">10.15479/AT:ISTA:19791</a>","ieee":"J.-Y. M. Desaules, “Research Data for ‘Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.’” Institute of Science and Technology Austria, 2025.","short":"J.-Y.M. Desaules, (2025).","mla":"Desaules, Jean-Yves Marc. <i>Research Data for “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.”</i> Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:19791\">10.15479/AT:ISTA:19791</a>.","chicago":"Desaules, Jean-Yves Marc. “Research Data for ‘Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.’” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT:ISTA:19791\">https://doi.org/10.15479/AT:ISTA:19791</a>.","apa":"Desaules, J.-Y. M. (2025). Research Data for “Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:19791\">https://doi.org/10.15479/AT:ISTA:19791</a>"},"project":[{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"OA_type":"green","ec_funded":1,"status":"public","day":"04","article_processing_charge":"No","abstract":[{"text":"Confinement is a prominent phenomenon in condensed matter and high-energy physics that has recently become the focus of quantum-simulation experiments of lattice gauge theories (LGTs). As such, a theoretical understanding of the effect of confinement on LGT dynamics is not only of fundamental importance, but can lend itself to upcoming experiments. Here, we show how confinement in a Z2 LGT can be locally avoided by proximity to a resonance between the fermion mass and the electric field strength. Furthermore, we show that this local deconfinement can become global for certain initial conditions, where information transport occurs over the entire chain. In addition, we show how this can lead to strong quantum many-body scarring starting in different initial states. Our findings provide deeper insights into the nature of confinement in Z2 LGTs and can be tested on current and near-term quantum devices.","lang":"eng"}],"keyword":["lattice gauge theories","quantum many-body scars","deconfinement"],"title":"Research Data for \"Mass-Assisted Local Deconfinement in a Confined Z2 Lattice Gauge Theory\"","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375","full_name":"Desaules, Jean-Yves Marc","first_name":"Jean-Yves Marc","last_name":"Desaules"}],"OA_place":"repository","related_material":{"record":[{"relation":"used_in_publication","id":"20327","status":"public"}],"link":[{"url":"https://arxiv.org/abs/2404.11645","relation":"preprint"}]},"corr_author":"1","file":[{"date_created":"2025-06-04T14:26:29Z","file_name":"Data+Code.zip","content_type":"application/zip","creator":"jdesaule","success":1,"file_id":"19792","checksum":"a613d73ee05f72a48ae9c97693bdd690","relation":"main_file","access_level":"open_access","date_updated":"2025-06-04T14:26:29Z","file_size":31946898},{"file_id":"19793","access_level":"open_access","checksum":"7df1549ce5e2f293d142ecf5e5b89489","relation":"other","file_size":13071,"date_updated":"2025-06-04T14:26:29Z","date_created":"2025-06-04T14:26:29Z","content_type":"text/plain","file_name":"readme.txt","creator":"jdesaule"}],"has_accepted_license":"1","ddc":["530"],"date_created":"2025-06-04T14:30:22Z","year":"2025","contributor":[{"contributor_type":"researcher","last_name":"Desaules","first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375"},{"first_name":"Thomas","contributor_type":"researcher","last_name":"Iadecola"},{"last_name":"Halimeh","contributor_type":"researcher","first_name":"Jad"}],"doi":"10.15479/AT:ISTA:19791"},{"ddc":["570"],"has_accepted_license":"1","file":[{"success":1,"creator":"dernst","content_type":"application/pdf","file_name":"2025_NeurobioDisease_Currin.pdf","date_created":"2025-12-30T08:35:41Z","date_updated":"2025-12-30T08:35:41Z","file_size":7063352,"access_level":"open_access","relation":"main_file","checksum":"abe215be676ed14e9a37fb78b6a5a610","file_id":"20896"}],"quality_controlled":"1","corr_author":"1","publication":"Neurobiology of Disease","publication_identifier":{"eissn":["1095-953X"],"issn":["0969-9961"]},"doi":"10.1016/j.nbd.2025.106966","article_number":"106966","year":"2025","date_created":"2025-06-08T22:01:22Z","title":"Network models incorporating chloride dynamics predict optimal strategies for terminating status epilepticus","abstract":[{"lang":"eng","text":"Status epilepticus (SE), seizures lasting beyond five minutes, is a medical emergency commonly treated with benzodiazepines which enhance GABAA receptor (GABAAR) conductance. Despite widespread use, benzodiazepines fail in over one-third of patients, potentially due to seizure-induced disruption of neuronal chloride (Cl−) homeostasis. Understanding these changes at a network level is crucial for improving clinical translation. Here, we address this using a large-scale spiking neural network model incorporating Cl− dynamics, informed by clinical EEG and experimental slice recordings. Our simulations confirm that the GABAAR reversal potential (EGABA) dictates the pro- or anti-seizure effect of GABAAR conductance modulation, with high EGABA rendering benzodiazepines ineffective or excitatory. We show SE-like activity and EGABA depend non-linearly on Cl− extrusion efficacy and GABAAR conductance. Critically, cell-type specific manipulations reveal that pyramidal cell, not interneuron, Cl− extrusion predominantly determines the severity of SE activity and the response to simulated benzodiazepines. Leveraging these mechanistic insights, we develop a predictive framework mapping network states to Cl− extrusion capacity and GABAergic load, yielding a proposed decision-making strategy to guide therapeutic interventions based on initial treatment response. This work identifies pyramidal cell Cl− handling as a key therapeutic target and demonstrates the utility of biophysically detailed network models for optimising SE treatment protocols."}],"external_id":{"isi":["001501576500001"]},"publication_status":"published","article_processing_charge":"Yes","OA_place":"publisher","volume":212,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"e8321fc5-3091-11eb-8a53-83f309a11ac9","orcid":"0000-0002-4809-5059","full_name":"Currin, Christopher","first_name":"Christopher","last_name":"Currin"},{"full_name":"Burman, Richard J.","first_name":"Richard J.","last_name":"Burman"},{"last_name":"Fedele","first_name":"Tommaso","full_name":"Fedele, Tommaso"},{"last_name":"Ramantani","first_name":"Georgia","full_name":"Ramantani, Georgia"},{"full_name":"Rosch, Richard E.","last_name":"Rosch","first_name":"Richard E."},{"first_name":"Henning","last_name":"Sprekeler","full_name":"Sprekeler, Henning"},{"first_name":"Joseph V.","last_name":"Raimondo","full_name":"Raimondo, Joseph V."}],"citation":{"ama":"Currin C, Burman RJ, Fedele T, et al. Network models incorporating chloride dynamics predict optimal strategies for terminating status epilepticus. <i>Neurobiology of Disease</i>. 2025;212. doi:<a href=\"https://doi.org/10.1016/j.nbd.2025.106966\">10.1016/j.nbd.2025.106966</a>","ista":"Currin C, Burman RJ, Fedele T, Ramantani G, Rosch RE, Sprekeler H, Raimondo JV. 2025. Network models incorporating chloride dynamics predict optimal strategies for terminating status epilepticus. Neurobiology of Disease. 212, 106966.","ieee":"C. Currin <i>et al.</i>, “Network models incorporating chloride dynamics predict optimal strategies for terminating status epilepticus,” <i>Neurobiology of Disease</i>, vol. 212. Elsevier, 2025.","short":"C. Currin, R.J. Burman, T. Fedele, G. Ramantani, R.E. Rosch, H. Sprekeler, J.V. Raimondo, Neurobiology of Disease 212 (2025).","mla":"Currin, Christopher, et al. “Network Models Incorporating Chloride Dynamics Predict Optimal Strategies for Terminating Status Epilepticus.” <i>Neurobiology of Disease</i>, vol. 212, 106966, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.nbd.2025.106966\">10.1016/j.nbd.2025.106966</a>.","apa":"Currin, C., Burman, R. J., Fedele, T., Ramantani, G., Rosch, R. E., Sprekeler, H., &#38; Raimondo, J. V. (2025). Network models incorporating chloride dynamics predict optimal strategies for terminating status epilepticus. <i>Neurobiology of Disease</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.nbd.2025.106966\">https://doi.org/10.1016/j.nbd.2025.106966</a>","chicago":"Currin, Christopher, Richard J. Burman, Tommaso Fedele, Georgia Ramantani, Richard E. Rosch, Henning Sprekeler, and Joseph V. Raimondo. “Network Models Incorporating Chloride Dynamics Predict Optimal Strategies for Terminating Status Epilepticus.” <i>Neurobiology of Disease</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.nbd.2025.106966\">https://doi.org/10.1016/j.nbd.2025.106966</a>."},"day":"01","status":"public","OA_type":"gold","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"department":[{"_id":"TiVo"}],"publisher":"Elsevier","date_updated":"2025-12-30T08:36:36Z","language":[{"iso":"eng"}],"month":"08","date_published":"2025-08-01T00:00:00Z","oa":1,"file_date_updated":"2025-12-30T08:35:41Z","DOAJ_listed":"1","isi":1,"_id":"19794","scopus_import":"1","type":"journal_article","acknowledgement":"The research leading to these results has received support from the National Research Foundation of South Africa, the Deutscher Akademischer Austauschdienst, NOMIS Foundation, NVIDIA Academic Program, the University of Cape Town, the Anna Mueller Grocholski Foundation, the Swiss National Science Foundation (SNSF: 208184), the Gabriel Foundation, a Wellcome Trust Seed Award (214042/Z/18/Z), the South African Medical Research Council and the FLAIR Fellowship Programme (FLR\\R1\\190829): a partnership between the African Academy of Sciences and the Royal Society funded by the UK Government's Global Challenges Research Fund and a Wellcome Trust International Intermediate Fellowship (222968/Z/21/Z).","article_type":"original","oa_version":"Published Version","intvolume":"       212"},{"OA_type":"gold","ec_funded":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"status":"public","day":"01","citation":{"ieee":"V. G. Trinh, K. H. Park, S. Pastva, and J. C. Rozum, “Mapping the attractor landscape of Boolean networks with biobalm,” <i>Bioinformatics</i>, vol. 41, no. 5. Oxford University Press, 2025.","short":"V.G. Trinh, K.H. Park, S. Pastva, J.C. Rozum, Bioinformatics 41 (2025).","ama":"Trinh VG, Park KH, Pastva S, Rozum JC. Mapping the attractor landscape of Boolean networks with biobalm. <i>Bioinformatics</i>. 2025;41(5). doi:<a href=\"https://doi.org/10.1093/bioinformatics/btaf280\">10.1093/bioinformatics/btaf280</a>","ista":"Trinh VG, Park KH, Pastva S, Rozum JC. 2025. Mapping the attractor landscape of Boolean networks with biobalm. Bioinformatics. 41(5), btaf280.","apa":"Trinh, V. G., Park, K. H., Pastva, S., &#38; Rozum, J. C. (2025). Mapping the attractor landscape of Boolean networks with biobalm. <i>Bioinformatics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bioinformatics/btaf280\">https://doi.org/10.1093/bioinformatics/btaf280</a>","chicago":"Trinh, Van Giang, Kyu Hyong Park, Samuel Pastva, and Jordan C. Rozum. “Mapping the Attractor Landscape of Boolean Networks with Biobalm.” <i>Bioinformatics</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/bioinformatics/btaf280\">https://doi.org/10.1093/bioinformatics/btaf280</a>.","mla":"Trinh, Van Giang, et al. “Mapping the Attractor Landscape of Boolean Networks with Biobalm.” <i>Bioinformatics</i>, vol. 41, no. 5, btaf280, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/bioinformatics/btaf280\">10.1093/bioinformatics/btaf280</a>."},"project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"article_type":"original","oa_version":"Published Version","intvolume":"        41","acknowledgement":"V.-G.T. was supported by Institut Carnot STAR, Marseille, France. K.H.P. was supported by NSF grant MCB1715826 to Réka Albert. S.P. has received funding from the European Union’s Horizon 2020 Research and Innovation Programme under the Marie Sklodowska-Curie Grant Agreement No. 101034413. J.C.R. was supported by internal departmental funds provided by Luis M. Rocha. No funding bodies had any role in study design, analysis, decision to publish, or preparation of the article.","type":"journal_article","_id":"19796","scopus_import":"1","isi":1,"oa":1,"DOAJ_listed":"1","file_date_updated":"2025-06-10T07:07:45Z","language":[{"iso":"eng"}],"month":"05","date_published":"2025-05-01T00:00:00Z","publisher":"Oxford University Press","department":[{"_id":"ToHe"}],"date_updated":"2025-09-30T12:46:33Z","year":"2025","date_created":"2025-06-08T22:01:22Z","article_number":"btaf280","issue":"5","publication_identifier":{"eissn":["1367-4811"]},"doi":"10.1093/bioinformatics/btaf280","publication":"Bioinformatics","corr_author":"1","file":[{"date_created":"2025-06-10T07:07:45Z","content_type":"application/pdf","file_name":"2025_Bioinformatics_Trinh.pdf","success":1,"creator":"dernst","file_id":"19801","access_level":"open_access","checksum":"fa9d68aa0f5ce37598a623c9be936f09","relation":"main_file","file_size":2695801,"date_updated":"2025-06-10T07:07:45Z"}],"quality_controlled":"1","has_accepted_license":"1","ddc":["000"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"last_name":"Trinh","first_name":"Van Giang","full_name":"Trinh, Van Giang"},{"full_name":"Park, Kyu Hyong","first_name":"Kyu Hyong","last_name":"Park"},{"last_name":"Pastva","first_name":"Samuel","full_name":"Pastva, Samuel","orcid":"0000-0003-1993-0331","id":"07c5ea74-f61c-11ec-a664-aa7c5d957b2b"},{"first_name":"Jordan C.","last_name":"Rozum","full_name":"Rozum, Jordan C."}],"OA_place":"publisher","volume":41,"related_material":{"record":[{"status":"public","relation":"research_data","id":"19800"}],"link":[{"relation":"software","url":"https://github.com/jcrozum/biobalm"}]},"pmid":1,"article_processing_charge":"Yes","abstract":[{"text":"Motivation: Boolean networks are popular dynamical models of cellular processes in systems biology. Their attractors model phenotypes that arise from the interplay of key regulatory subcircuits. A succession diagram (SD) describes this interplay in a discrete analog of Waddington’s epigenetic attractor landscape that allows for fast identification of attractors and attractor control strategies. Efficient computational tools for studying SDs are essential for the understanding of Boolean attractor landscapes and connecting them to their biological functions.\r\nResults: We present a new approach to SD construction for asynchronously updated Boolean networks, implemented in the biologist’s Boolean attractor landscape mapper, biobalm. We compare biobalm to similar tools and find a substantial performance increase in SD construction, attractor identification, and attractor control. We perform the most comprehensive comparative analysis to date of the SD structure in experimentally-validated Boolean models of cell processes and random ensembles. We find that random models (including critical Kauffman networks) have relatively small SDs, indicating simple decision structures. In contrast, nonrandom models from the literature are enriched in extremely large SDs, indicating an abundance of decision points and suggesting the presence of complex Waddington landscapes in nature.\r\nAvailability and implementation: The tool biobalm is available online at https://github.com/jcrozum/biobalm. Further data, scripts for testing, analysis, and figure generation are available online at https://github.com/jcrozum/biobalm-analysis and in the reproducibility artefact at https://doi.org/10.5281/zenodo.13854760.","lang":"eng"}],"external_id":{"isi":["001493400600001"],"pmid":["40327535"]},"publication_status":"published","title":"Mapping the attractor landscape of Boolean networks with biobalm"},{"oa_version":"Published Version","intvolume":"       697","article_type":"original","type":"journal_article","acknowledgement":"We thank the anonymous referee for providing a constructive report. We thank Tomer Shenar and Selma de Mink for the interesting discussions that helped us improve the content of Sect. 4. Thank you to Jorick Vink and Andreas Sander for helpful discussions about wind driving. BHA thanks the Caltech Summer Undergraduate Research Fellowship (SURF) program and Peter Adams for supporting this project in memory of Alain Porter and Arthur R. Adams. BHA thanks Gwen Rudie for organizing the Carnegie Astrophysics Summer Student Internship (CASSI) program and all the staff at Carnegie Observatories who help to support this program. BHA also thanks Laura Jaliff, Sal Wanying Fu, Ivanna Escala, Johanna Teske, Tony Piro, Brian Lorenz, and Peter Senchyna for their mentorship during this project. Computing resources used for this work were made possible by a grant from the Ahmanson Foundation. We thank the Observatories of the Carnegie Institution for Science for support, including Chris Burns for help with computations. This work used computing resources provided by Northwestern University and the Center for Interdisciplinary Exploration and Research in Astrophysics (CIERA). This research was supported in part through the computational resources and staff contributions provided for the Quest high performance computing facility at Northwestern University which is jointly supported by the Office of the Provost, the Office for Research, and Northwestern University Information Technology. MRD acknowledges support from the NSERC through grant RGPIN-2019-06186, the Canada Research Chairs Program, and the Dunlap Institute at the University of Toronto. BHA is supported by the National Science Foundation Graduate Research Fellowship under Grant No. DGE-2234667.","scopus_import":"1","_id":"19797","isi":1,"file_date_updated":"2025-06-10T07:00:38Z","oa":1,"date_published":"2025-05-01T00:00:00Z","language":[{"iso":"eng"}],"month":"05","date_updated":"2026-02-16T12:10:11Z","arxiv":1,"publisher":"EDP Sciences","department":[{"_id":"YlGo"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"OA_type":"diamond","day":"01","status":"public","citation":{"ista":"Hovis-Afflerbach B, Götberg YLL, Schootemeijer A, Klencki J, Strom AL, Ludwig BA, Drout MR. 2025. The mass distribution of stars stripped in binaries: The effect of metallicity. Astronomy &#38; Astrophysics. 697, A239.","ama":"Hovis-Afflerbach B, Götberg YLL, Schootemeijer A, et al. The mass distribution of stars stripped in binaries: The effect of metallicity. <i>Astronomy &#38; Astrophysics</i>. 2025;697. doi:<a href=\"https://doi.org/10.1051/0004-6361/202453185\">10.1051/0004-6361/202453185</a>","short":"B. Hovis-Afflerbach, Y.L.L. Götberg, A. Schootemeijer, J. Klencki, A.L. Strom, B.A. Ludwig, M.R. Drout, Astronomy &#38; Astrophysics 697 (2025).","ieee":"B. Hovis-Afflerbach <i>et al.</i>, “The mass distribution of stars stripped in binaries: The effect of metallicity,” <i>Astronomy &#38; Astrophysics</i>, vol. 697. EDP Sciences, 2025.","mla":"Hovis-Afflerbach, B., et al. “The Mass Distribution of Stars Stripped in Binaries: The Effect of Metallicity.” <i>Astronomy &#38; Astrophysics</i>, vol. 697, A239, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202453185\">10.1051/0004-6361/202453185</a>.","apa":"Hovis-Afflerbach, B., Götberg, Y. L. L., Schootemeijer, A., Klencki, J., Strom, A. L., Ludwig, B. A., &#38; Drout, M. R. (2025). The mass distribution of stars stripped in binaries: The effect of metallicity. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202453185\">https://doi.org/10.1051/0004-6361/202453185</a>","chicago":"Hovis-Afflerbach, B., Ylva Louise Linsdotter Götberg, A. Schootemeijer, J. Klencki, A. L. Strom, B. A. Ludwig, and M. R. Drout. “The Mass Distribution of Stars Stripped in Binaries: The Effect of Metallicity.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202453185\">https://doi.org/10.1051/0004-6361/202453185</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Hovis-Afflerbach, B.","last_name":"Hovis-Afflerbach","first_name":"B."},{"first_name":"Ylva Louise Linsdotter","last_name":"Götberg","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","orcid":"0000-0002-6960-6911","full_name":"Götberg, Ylva Louise Linsdotter"},{"full_name":"Schootemeijer, A.","last_name":"Schootemeijer","first_name":"A."},{"last_name":"Klencki","first_name":"J.","full_name":"Klencki, J."},{"full_name":"Strom, A. L.","last_name":"Strom","first_name":"A. L."},{"full_name":"Ludwig, B. A.","first_name":"B. A.","last_name":"Ludwig"},{"last_name":"Drout","first_name":"M. R.","full_name":"Drout, M. R."}],"volume":697,"OA_place":"publisher","article_processing_charge":"No","publication_status":"published","external_id":{"isi":["001494033100007"],"arxiv":["2412.05356"]},"abstract":[{"lang":"eng","text":"Stars stripped of their hydrogen-rich envelopes through binary interaction are thought to be responsible for both hydrogen-poor supernovae and the hard ionizing radiation observed in low-Z galaxies. A population of these stars was recently observed for the first time, but their prevalence remains unknown. In preparation for such measurements, we estimate the mass distribution of hot, stripped stars using a population synthesis code that interpolates over detailed single and binary stellar evolution tracks. We predict that for a constant star formation rate of 1 M⊙/yr and regardless of metallicity, a scalable model population contains ∼30 000 stripped stars with mass Mstrip > 1 M⊙ and ∼4000 stripped stars that are sufficiently massive to explode (Mstrip > 2.6 M⊙). Below Mstrip = 5 M⊙, the distribution is metallicity-independent and can be described by a power law with the exponent α ∼ −2. At higher masses and lower metallicity (Z ≲ 0.002), the mass distribution exhibits a drop. This originates from the prediction, frequently seen in evolutionary models, that massive low-metallicity stars do not expand substantially until central helium burning or later and therefore cannot form long-lived stripped stars. With weaker line-driven winds at low metallicity, this suggests that neither binary interaction nor wind mass loss can efficiently strip massive stars at low metallicity. As a result, a “helium-star desert” emerges around Mstrip = 15 M⊙ at Z = 0.002, covering an increasingly large mass range with decreasing metallicity. We note that these high-mass stars are those that potentially boost a galaxy’s He+-ionizing radiation and that participate in the formation of merging black holes. This “helium-star desert” therefore merits further study."}],"title":"The mass distribution of stars stripped in binaries: The effect of metallicity","date_created":"2025-06-08T22:01:22Z","year":"2025","article_number":"A239","doi":"10.1051/0004-6361/202453185","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"publication":"Astronomy & Astrophysics","corr_author":"1","quality_controlled":"1","file":[{"file_id":"19799","checksum":"caa92beb22ab3146a75c5b03e926de1f","relation":"main_file","access_level":"open_access","date_updated":"2025-06-10T07:00:38Z","file_size":6378030,"date_created":"2025-06-10T07:00:38Z","file_name":"2025_AstronomyAstrophysics_HovisAfflerbach.pdf","content_type":"application/pdf","creator":"dernst","success":1}],"has_accepted_license":"1","ddc":["520"]}]