[{"date_published":"2025-11-12T00:00:00Z","oa":1,"date_created":"2025-11-14T09:40:52Z","type":"journal_article","issue":"4","status":"public","PlanS_conform":"1","year":"2025","related_material":{"link":[{"url":"https://ista.ac.at/en/news/reaching-for-the-quantum-scars/","description":"News on ISTA website","relation":"press_release"}]},"intvolume":"         6","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"PRX Quantum","fulldoi":"https://doi.org/10.1103/tldp-kvkd","publication_status":"published","arxiv":1,"volume":6,"file":[{"date_created":"2025-11-14T09:44:10Z","access_level":"open_access","file_name":"tldp-kvkd.pdf","date_updated":"2025-11-14T09:44:10Z","relation":"main_file","checksum":"5d6d04ac518b4118405334e1ddc7a56d","content_type":"application/pdf","file_id":"20647","success":1,"file_size":2504713,"creator":"gyalniz"}],"quality_controlled":"1","OA_type":"gold","article_type":"original","day":"12","isi":1,"author":[{"full_name":"Petrova, Elena","first_name":"Elena","last_name":"Petrova","id":"0ac84990-897b-11ed-a09c-f5abb56a4ede"},{"full_name":"Ljubotina, Marko","first_name":"Marko","last_name":"Ljubotina","orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E"},{"id":"66E74FA2-D8BF-11E9-8249-8DE2E5697425","last_name":"Yalniz","orcid":"0000-0002-8490-9312","first_name":"Gökhan","full_name":"Yalniz, Gökhan"},{"id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","last_name":"Serbyn","full_name":"Serbyn, Maksym","first_name":"Maksym"}],"OA_place":"publisher","ec_funded":1,"title":"Finding periodic orbits in projected quantum many-body dynamics","APC_amount":"3599,50 EUR","external_id":{"isi":["001616473700003"],"arxiv":["2504.12472"]},"acknowledgement":"We acknowledge useful discussions with C. Kollath, A. Green, and D. Huse. E.P., M.L., and M.S. acknowledge support by the European Research Council under the European Union’s Horizon 2020 research and innovation program (Grant Agreement No. 850899). This research was funded in whole or in part by the Austrian Science Fund (FWF) (Grant No. 10.55776/COE1). For open access purposes, the author has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission. M.L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. This research was supported in part by National Science Foundation (NSF) Grant No. PHY-2309135 to the Kavli Institute for Theoretical Physics (KITP) and by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI).","ddc":["539"],"date_updated":"2026-09-16T07:04:35Z","publisher":"American Physical Society","_id":"20646","department":[{"_id":"GradSch"},{"_id":"BjHo"},{"_id":"MaSe"}],"has_accepted_license":"1","corr_author":"1","publication_identifier":{"eissn":["2691-3399"]},"abstract":[{"lang":"eng","text":"Describing general quantum many-body dynamics is a challenging task due to the exponential growth of the Hilbert space with system size. The time-dependent variational principle (TDVP) provides a powerful tool to tackle this task by projecting quantum evolution onto a classical dynamical system within a variational manifold. In classical systems, periodic orbits play a crucial role in understanding the structure of the phase space and the long-term behavior of the system. However, finding periodic orbits is generally difficult, and their existence and properties in generic TDVP dynamics over matrix product states have remained largely unexplored. In this work, we develop an algorithm to systematically identify and characterize periodic orbits in TDVP dynamics. Applying our method to the periodically kicked Ising model, we uncover both stable and unstable periodic orbits. We characterize the Kolmogorov-Arnold-Moser tori in the vicinity of stable periodic orbits and track the change of the periodic orbits as we modify the Hamiltonian parameters. We observe that periodic orbits exist at any value of the coupling constant of the kicked Ising model between prethermal and fully thermalizing regimes, but their relevance to quantum dynamics and imprint on quantum eigenstates diminishes as the system leaves the prethermal regime. Our results demonstrate that periodic orbits provide valuable insights into the TDVP approximation of quantum many-body evolution and establish a closer connection between quantum and classical chaos."}],"file_date_updated":"2025-11-14T09:44:10Z","citation":{"apa":"Petrova, E., Ljubotina, M., Yalniz, G., &#38; Serbyn, M. (2025). Finding periodic orbits in projected quantum many-body dynamics. <i>PRX Quantum</i>. American Physical Society. <a href=\"https://doi.org/10.1103/tldp-kvkd\">https://doi.org/10.1103/tldp-kvkd</a>","mla":"Petrova, Elena, et al. “Finding Periodic Orbits in Projected Quantum Many-Body Dynamics.” <i>PRX Quantum</i>, vol. 6, no. 4, 040333, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/tldp-kvkd\">10.1103/tldp-kvkd</a>.","ama":"Petrova E, Ljubotina M, Yalniz G, Serbyn M. Finding periodic orbits in projected quantum many-body dynamics. <i>PRX Quantum</i>. 2025;6(4). doi:<a href=\"https://doi.org/10.1103/tldp-kvkd\">10.1103/tldp-kvkd</a>","short":"E. Petrova, M. Ljubotina, G. Yalniz, M. Serbyn, PRX Quantum 6 (2025).","chicago":"Petrova, Elena, Marko Ljubotina, Gökhan Yalniz, and Maksym Serbyn. “Finding Periodic Orbits in Projected Quantum Many-Body Dynamics.” <i>PRX Quantum</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/tldp-kvkd\">https://doi.org/10.1103/tldp-kvkd</a>.","ista":"Petrova E, Ljubotina M, Yalniz G, Serbyn M. 2025. Finding periodic orbits in projected quantum many-body dynamics. PRX Quantum. 6(4), 040333.","ieee":"E. Petrova, M. Ljubotina, G. Yalniz, and M. Serbyn, “Finding periodic orbits in projected quantum many-body dynamics,” <i>PRX Quantum</i>, vol. 6, no. 4. American Physical Society, 2025."},"doi":"10.1103/tldp-kvkd","article_processing_charge":"Yes","DOAJ_listed":"1","article_number":"040333","project":[{"call_identifier":"H2020","name":"Non-Ergodic Quantum Matter: Universality, Dynamics and Control","_id":"23841C26-32DE-11EA-91FC-C7463DDC885E","grant_number":"850899"},{"name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF"},{"grant_number":"COE01","name":"Quantum Science Austria (Serbyn)","_id":"92c64506-16d5-11f0-9cad-87ce313ee832"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"11","oa_version":"Published Version"},{"OA_place":"publisher","author":[{"last_name":"Brighi","orcid":"0000-0002-7969-2729","id":"4115AF5C-F248-11E8-B48F-1D18A9856A87","full_name":"Brighi, Pietro","first_name":"Pietro"},{"first_name":"Marko","full_name":"Ljubotina, Marko","orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","last_name":"Ljubotina"},{"last_name":"Roccati","full_name":"Roccati, Federico","first_name":"Federico"},{"first_name":"Federico","full_name":"Balducci, Federico","last_name":"Balducci"}],"day":"01","article_type":"original","OA_type":"gold","file":[{"file_id":"20715","content_type":"application/pdf","success":1,"file_size":483879,"creator":"dernst","access_level":"open_access","date_created":"2025-12-01T08:00:19Z","file_name":"2025_PhysReviewResearch_Brighi.pdf","checksum":"c4e582ab64ab9f8fface70bf2fd31882","date_updated":"2025-12-01T08:00:19Z","relation":"main_file"}],"quality_controlled":"1","volume":7,"fulldoi":"https://doi.org/10.1103/crwj-x7j8","arxiv":1,"publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Physical Review Research","status":"public","PlanS_conform":"1","year":"2025","intvolume":"         7","type":"journal_article","issue":"4","date_created":"2025-11-30T23:02:08Z","date_published":"2025-10-01T00:00:00Z","oa":1,"oa_version":"Published Version","language":[{"iso":"eng"}],"month":"10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","project":[{"name":"Quantum Science Austria (Serbyn)","_id":"92c64506-16d5-11f0-9cad-87ce313ee832","grant_number":"COE01"}],"article_number":"L042014","article_processing_charge":"Yes (via OA deal)","DOAJ_listed":"1","abstract":[{"lang":"eng","text":"Non-Hermitian many-body localization (NH MBL) has emerged as a possible scenario for stable localization in open systems, as suggested by spectral indicators identifying a putative transition for finite system sizes. In this work, we shift the focus to dynamical probes, specifically the steady-state spin current, to investigate transport properties in a disordered, non-Hermitian XXZ spin chain. Through exact diagonalization for small systems and tensor-network methods for larger chains, we demonstrate that the steady-state current remains finite and decays exponentially with disorder strength, showing no evidence of a transition up to disorder values far beyond the previously claimed critical point. Our results reveal a stark discrepancy between spectral indicators, which suggest localization, and transport behavior, which indicates delocalization. This highlights the importance of dynamical observables in characterizing NH MBL and suggests that traditional spectral measures may not fully capture the physics of non-Hermitian systems. Additionally, we observe a noncommutativity of limits in system size and time, further complicating the interpretation of finite-size studies. These findings challenge the existence of NH MBL in the studied model and underscore the need for alternative approaches to understanding localization in non-Hermitian settings."}],"publication_identifier":{"eissn":["2643-1564"]},"file_date_updated":"2025-12-01T08:00:19Z","doi":"10.1103/crwj-x7j8","citation":{"ista":"Brighi P, Ljubotina M, Roccati F, Balducci F. 2025. Finite steady-state current defies non-Hermitian many-body localization. Physical Review Research. 7(4), L042014.","ieee":"P. Brighi, M. Ljubotina, F. Roccati, and F. Balducci, “Finite steady-state current defies non-Hermitian many-body localization,” <i>Physical Review Research</i>, vol. 7, no. 4. American Physical Society, 2025.","ama":"Brighi P, Ljubotina M, Roccati F, Balducci F. Finite steady-state current defies non-Hermitian many-body localization. <i>Physical Review Research</i>. 2025;7(4). doi:<a href=\"https://doi.org/10.1103/crwj-x7j8\">10.1103/crwj-x7j8</a>","short":"P. Brighi, M. Ljubotina, F. Roccati, F. Balducci, Physical Review Research 7 (2025).","chicago":"Brighi, Pietro, Marko Ljubotina, Federico Roccati, and Federico Balducci. “Finite Steady-State Current Defies Non-Hermitian Many-Body Localization.” <i>Physical Review Research</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/crwj-x7j8\">https://doi.org/10.1103/crwj-x7j8</a>.","apa":"Brighi, P., Ljubotina, M., Roccati, F., &#38; Balducci, F. (2025). Finite steady-state current defies non-Hermitian many-body localization. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/crwj-x7j8\">https://doi.org/10.1103/crwj-x7j8</a>","mla":"Brighi, Pietro, et al. “Finite Steady-State Current Defies Non-Hermitian Many-Body Localization.” <i>Physical Review Research</i>, vol. 7, no. 4, L042014, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/crwj-x7j8\">10.1103/crwj-x7j8</a>."},"department":[{"_id":"MaSe"}],"has_accepted_license":"1","date_updated":"2026-09-16T07:06:16Z","ddc":["530"],"_id":"20709","publisher":"American Physical Society","external_id":{"arxiv":["2504.02460"]},"acknowledgement":"F.B. thanks Giuseppe de Tomasi and Oskar A. Prośniak for discussion. P.B. acknowledges support by the Austrian Science Fund (FWF) (Grant Agreement No. 10.55776/ESP9057324). This research was funded in whole or in part by the Austrian Science Fund (FWF) [10.55776/COE1]. The numerical simulations were performed using the ITensor library [73] on the Vienna Scientific Cluster (VSC) and on the MPIPKS HPC cluster. M.L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. F.R. acknowledges support by the European Union-Next Generation EU with the project “Quantum Optics in Many-Body photonic Environments” (QOMBE) code SOE2024_0000084-CUP B77G24000480006. Open\r\naccess publication funded by Max Planck Society.","title":"Finite steady-state current defies non-Hermitian many-body localization"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2408.03796"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"article_processing_charge":"No","citation":{"ama":"Chatterjee K, Goharshady AK, Goharshady E, et al. PolyQEnt: A polynomial quantified entailment solver. In: <i>23rd International Symposium on Automated Technology for Verification and Analysis</i>. Vol 16145. Springer Nature; 2025:411-424. doi:<a href=\"https://doi.org/10.1007/978-3-032-08707-2_19\">10.1007/978-3-032-08707-2_19</a>","short":"K. Chatterjee, A.K. Goharshady, E. Goharshady, M. Karrabi, M. Saadat, M. Seeliger, D. Zikelic, in:, 23rd International Symposium on Automated Technology for Verification and Analysis, Springer Nature, 2025, pp. 411–424.","chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, Ehsan Goharshady, Mehrdad Karrabi, Milad Saadat, Maximilian Seeliger, and Dorde Zikelic. “PolyQEnt: A Polynomial Quantified Entailment Solver.” In <i>23rd International Symposium on Automated Technology for Verification and Analysis</i>, 16145:411–24. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-08707-2_19\">https://doi.org/10.1007/978-3-032-08707-2_19</a>.","ista":"Chatterjee K, Goharshady AK, Goharshady E, Karrabi M, Saadat M, Seeliger M, Zikelic D. 2025. PolyQEnt: A polynomial quantified entailment solver. 23rd International Symposium on Automated Technology for Verification and Analysis. ATVA: Automated Technology for Verification and Analysis, LNCS, vol. 16145, 411–424.","ieee":"K. Chatterjee <i>et al.</i>, “PolyQEnt: A polynomial quantified entailment solver,” in <i>23rd International Symposium on Automated Technology for Verification and Analysis</i>, Bengaluru, India, 2025, vol. 16145, pp. 411–424.","apa":"Chatterjee, K., Goharshady, A. K., Goharshady, E., Karrabi, M., Saadat, M., Seeliger, M., &#38; Zikelic, D. (2025). PolyQEnt: A polynomial quantified entailment solver. In <i>23rd International Symposium on Automated Technology for Verification and Analysis</i> (Vol. 16145, pp. 411–424). Bengaluru, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-08707-2_19\">https://doi.org/10.1007/978-3-032-08707-2_19</a>","mla":"Chatterjee, Krishnendu, et al. “PolyQEnt: A Polynomial Quantified Entailment Solver.” <i>23rd International Symposium on Automated Technology for Verification and Analysis</i>, vol. 16145, Springer Nature, 2025, pp. 411–24, doi:<a href=\"https://doi.org/10.1007/978-3-032-08707-2_19\">10.1007/978-3-032-08707-2_19</a>."},"doi":"10.1007/978-3-032-08707-2_19","abstract":[{"lang":"eng","text":"Polynomial quantified entailments with existentially and universally quantified variables arise in many problems of verification and program analysis. We present PolyQEnt which is a tool for solving polynomial quantified entailments in which variables on both sides of the implication are real valued or unbounded integers. Our tool provides a unified framework for polynomial quantified entailment problems that arise in several papers in the literature. Our experimental evaluation over a wide range of benchmarks shows the applicability of the tool as well as its benefits as opposed to simply using existing SMT solvers to solve such constraints."}],"publication_identifier":{"isbn":["9783032087065"],"eissn":["1611-3349"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"corr_author":"1","department":[{"_id":"KrCh"}],"_id":"20648","publisher":"Springer Nature","date_updated":"2026-09-16T07:03:56Z","acknowledgement":"This work was supported by the following grants: ERC CoG 863818 (ForM-SMArt), Austrian Science Fund (FWF) 10.55776/COE12, ERC StG 101222524 (SPES), the Ethereum Foundation Research Grant FY24-1793, and the Singapore Ministry of Education (MOE) Academic Research Fund (AcRF) Tier 1 grant (Project ID:22-SISSMU-100).","external_id":{"arxiv":["2408.03796"]},"title":"PolyQEnt: A polynomial quantified entailment solver","ec_funded":1,"OA_place":"repository","page":"411-424","author":[{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Goharshady, Amir Kafshdar","first_name":"Amir Kafshdar","id":"391365CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1702-6584","last_name":"Goharshady"},{"first_name":"Ehsan","full_name":"Kafshdar Goharshadi, Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","orcid":"0000-0002-8595-0587","last_name":"Kafshdar Goharshadi"},{"full_name":"Karrabi, Mehrdad","first_name":"Mehrdad","id":"67638922-f394-11eb-9cf6-f20423e08757","last_name":"Karrabi","orcid":"0009-0007-5253-9170"},{"full_name":"Saadat, Milad","first_name":"Milad","last_name":"Saadat"},{"last_name":"Seeliger","full_name":"Seeliger, Maximilian","first_name":"Maximilian"},{"full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"day":"26","OA_type":"green","quality_controlled":"1","volume":16145,"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1007/978-3-032-08707-2_19","publication":"23rd International Symposium on Automated Technology for Verification and Analysis","conference":{"end_date":"2025-10-31","name":"ATVA: Automated Technology for Verification and Analysis","start_date":"2025-10-27","location":"Bengaluru, India"},"intvolume":"     16145","status":"public","year":"2025","type":"conference","date_created":"2025-11-16T23:01:24Z","oa":1,"date_published":"2025-10-26T00:00:00Z"},{"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"},{"_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12"}],"oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2505.09514","open_access":"1"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"10","acknowledgement":"This project has received funding from the Fonds de la Recherche Scientifique - FNRS under grant No. T.0027.21, the Belgian National Lottery; the ERC CoG 863818 (ForM-SMArt), the Austrian Science Fund (FWF) 10.55776/COE12; the DFG project 427755713, GOPro, and the DFG research training group GRK 2428 Continuous Verification of Cyber-Physical Systems\r\n(ConVeY); the EU’s Horizon 2020 research and innovation programmes under the Marie Sklodowska-Curie grant agreement No. 101034413 (IST-BRIDGE) and the ERC Starting Grant DEUCE (101077178).","external_id":{"arxiv":["2505.09514"]},"_id":"20690","publisher":"IEEE","date_updated":"2026-09-16T07:05:13Z","title":"Risk-aware Markov decision processes using cumulative prospect theory","doi":"10.1109/lics65433.2025.00041","citation":{"chicago":"Brihaye, Thomas, Krishnendu Chatterjee, Stefanie Mohr, and Maximilian Weininger. “Risk-Aware Markov Decision Processes Using Cumulative Prospect Theory.” In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 458–71. IEEE, 2025. <a href=\"https://doi.org/10.1109/lics65433.2025.00041\">https://doi.org/10.1109/lics65433.2025.00041</a>.","short":"T. Brihaye, K. Chatterjee, S. Mohr, M. Weininger, in:, 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2025, pp. 458–471.","ama":"Brihaye T, Chatterjee K, Mohr S, Weininger M. Risk-aware Markov decision processes using cumulative prospect theory. In: <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2025:458-471. doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00041\">10.1109/lics65433.2025.00041</a>","ieee":"T. Brihaye, K. Chatterjee, S. Mohr, and M. Weininger, “Risk-aware Markov decision processes using cumulative prospect theory,” in <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Singapore, Singapore, 2025, pp. 458–471.","ista":"Brihaye T, Chatterjee K, Mohr S, Weininger M. 2025. Risk-aware Markov decision processes using cumulative prospect theory. 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 458–471.","mla":"Brihaye, Thomas, et al. “Risk-Aware Markov Decision Processes Using Cumulative Prospect Theory.” <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2025, pp. 458–71, doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00041\">10.1109/lics65433.2025.00041</a>.","apa":"Brihaye, T., Chatterjee, K., Mohr, S., &#38; Weininger, M. (2025). Risk-aware Markov decision processes using cumulative prospect theory. In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 458–471). Singapore, Singapore: IEEE. <a href=\"https://doi.org/10.1109/lics65433.2025.00041\">https://doi.org/10.1109/lics65433.2025.00041</a>"},"abstract":[{"text":"Cumulative prospect theory (CPT) is the first theory for decision-making under uncertainty that combines full theoretical soundness and empirically realistic features [1], [Page 2]. While CPT was originally considered in one-shot settings for risk-aware decision-making, we consider CPT in sequential decision-making. The most fundamental and well-studied models for sequential decision-making are Markov chains (MCs), and their generalization Markov decision processes (MDPs). The complexity theoretic study of MCs and MDPs with CPT is a fundamental problem that has not been addressed in the literature.Our contributions are as follows: First, we present an alternative viewpoint for the CPT-value of MCs and MDPs. This allows us to establish a connection with multi-objective reachability analysis and conclude the strategy complexity result that memoryless randomized strategies are necessary and sufficient for optimality. Second, based on this connection, we provide an algorithm for computing the CPT-value in MDPs with infinite-horizon objectives. We show that the problem is in EXPTIME and fixed-parameter tractable. Moreover, we provide a polynomial-time algorithm for the special case of MCs.","lang":"eng"}],"publication_identifier":{"eisbn":["9798331579005"]},"article_processing_charge":"No","department":[{"_id":"KrCh"}],"corr_author":"1","quality_controlled":"1","OA_type":"green","page":"458-471","ec_funded":1,"OA_place":"repository","day":"09","author":[{"last_name":"Brihaye","full_name":"Brihaye, Thomas","first_name":"Thomas"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"full_name":"Mohr, Stefanie","first_name":"Stefanie","last_name":"Mohr"},{"full_name":"Weininger, Maximilian","first_name":"Maximilian","orcid":"0000-0002-0163-2152","id":"02ab0197-cc70-11ed-ab61-918e71f56881","last_name":"Weininger"}],"type":"conference","year":"2025","status":"public","oa":1,"date_published":"2025-10-09T00:00:00Z","date_created":"2025-11-24T14:43:47Z","publication":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science","arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1109/lics65433.2025.00041","conference":{"name":"LICS: Logic in Computer Science","end_date":"2025-06-26","start_date":"2025-06-23","location":"Singapore, Singapore"}},{"project":[{"call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"},{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2504.18277","open_access":"1"}],"oa_version":"Preprint","title":"Multiplicative rewards in Markovian models","date_updated":"2026-09-16T07:05:41Z","_id":"20689","publisher":"IEEE","external_id":{"arxiv":["2504.18277"]},"acknowledgement":"This work was partly funded by the ERC CoG 863818 (ForM-SMArt), the Austrian Science Fund (FWF) 10.55776/COE12, the DFG Grant 389792660 as part of TRR 248 (Foundations of Perspicuous Software Systems), the Cluster of Excellence EXC 2050/1 (CeTI, project ID\r\n390696704, as part of Germany’s Excellence Strategy), and by the BMBF (Federal Ministry of Education and Research) in DAAD project 57616814 (SECAI, School of Embedded and\r\nComposite AI) as part of the program Konrad Zuse Schools of Excellence in Artificial Intelligence.","corr_author":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"No","publication_identifier":{"eisbn":["9798331579005"]},"abstract":[{"text":"This paper studies the expected value of multiplicative rewards, where rewards obtained in each step are multiplied (instead of the usual addition), in Markov chains (MCs) and Markov decision processes (MDPs). One of the key differences to additive rewards is that the expected value may diverge to ∞ not only due to recurrent, but also due to transient states.For MCs, computing the value is shown to be possible in polynomial time given an oracle for the comparison of succinctly represented integers (CSRI), which is only known to be solvable in polynomial time subject to number-theoretic conjectures. Interestingly, distinguishing whether the value is ∞ or 0 is at least as hard as CSRI, while determining if it is one of these two can be done in polynomial time. In MDPs, the optimal value can be computed in polynomial space. Further refined complexity results and results on the complexity of optimal schedulers are presented. The techniques developed for MDPs additionally allow to solve the multiplicative variant of the stochastic shortest path problem. Finally, for MCs and MDPs where an absorbing state is reached almost surely, all considered problems are solvable in polynomial time.","lang":"eng"}],"citation":{"ama":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. Multiplicative rewards in Markovian models. In: <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>. IEEE; 2025:499-512. doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00044\">10.1109/lics65433.2025.00044</a>","chicago":"Baier, Christel, Krishnendu Chatterjee, Tobias Meggendorfer, and Jakob Piribauer. “Multiplicative Rewards in Markovian Models.” In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, 499–512. IEEE, 2025. <a href=\"https://doi.org/10.1109/lics65433.2025.00044\">https://doi.org/10.1109/lics65433.2025.00044</a>.","short":"C. Baier, K. Chatterjee, T. Meggendorfer, J. Piribauer, in:, 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science, IEEE, 2025, pp. 499–512.","ista":"Baier C, Chatterjee K, Meggendorfer T, Piribauer J. 2025. Multiplicative rewards in Markovian models. 2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science. LICS: Logic in Computer Science, 499–512.","ieee":"C. Baier, K. Chatterjee, T. Meggendorfer, and J. Piribauer, “Multiplicative rewards in Markovian models,” in <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, Singapore, Singapore, 2025, pp. 499–512.","apa":"Baier, C., Chatterjee, K., Meggendorfer, T., &#38; Piribauer, J. (2025). Multiplicative rewards in Markovian models. In <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i> (pp. 499–512). Singapore, Singapore: IEEE. <a href=\"https://doi.org/10.1109/lics65433.2025.00044\">https://doi.org/10.1109/lics65433.2025.00044</a>","mla":"Baier, Christel, et al. “Multiplicative Rewards in Markovian Models.” <i>2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science</i>, IEEE, 2025, pp. 499–512, doi:<a href=\"https://doi.org/10.1109/lics65433.2025.00044\">10.1109/lics65433.2025.00044</a>."},"doi":"10.1109/lics65433.2025.00044","OA_type":"green","quality_controlled":"1","author":[{"first_name":"Christel","full_name":"Baier, Christel","last_name":"Baier"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Tobias","full_name":"Meggendorfer, Tobias","last_name":"Meggendorfer","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Piribauer","first_name":"Jakob","full_name":"Piribauer, Jakob"}],"day":"09","OA_place":"repository","ec_funded":1,"page":"499-512","date_created":"2025-11-24T14:24:00Z","date_published":"2025-10-09T00:00:00Z","oa":1,"year":"2025","status":"public","type":"conference","conference":{"name":"LICS: Logic in Computer Science","end_date":"2025-06-26","start_date":"2025-06-23","location":"Singapore, Singapore"},"fulldoi":"https://doi.org/10.1109/lics65433.2025.00044","arxiv":1,"publication_status":"published","publication":"2025 40th Annual ACM/IEEE Symposium on Logic in Computer Science"},{"ddc":["000"],"date_updated":"2026-09-16T07:17:18Z","publisher":"ML Research Press","_id":"20817","external_id":{"arxiv":["2502.18377"]},"acknowledgement":"AP. This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.\r\nFL. This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For open access purposes, the author has applied a CC BY public\r\ncopyright license to any author accepted manuscript version arising from this submission.","title":"Mechanistic PDE networks for discovery of governing equations","article_processing_charge":"No","abstract":[{"lang":"eng","text":"We present Mechanistic PDE Networks -- a model for discovery of governing partial differential equations from data. Mechanistic PDE Networks represent spatiotemporal data as space-time dependent linear partial differential equations in neural network hidden representations. The represented PDEs are then solved and decoded for specific tasks. The learned PDE representations naturally express the spatiotemporal dynamics in data in neural network hidden space, enabling increased modeling power. Solving the PDE representations in a compute and memory-efficient way, however, is a significant challenge. We develop a native, GPU-capable, parallel, sparse and differentiable multigrid solver specialized for linear partial differential equations that acts as a module in Mechanistic PDE Networks. Leveraging the PDE solver we propose a discovery architecture that can discovers nonlinear PDEs in complex settings, while being robust to noise. We validate PDE discovery on a number of PDEs including reaction-diffusion and Navier-Stokes equations."}],"publication_identifier":{"eissn":["2640-3498"]},"citation":{"apa":"Pervez, A. A., Gavves, E., &#38; Locatello, F. (2025). Mechanistic PDE networks for discovery of governing equations. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 48962–48973). Vancouver, Canada: ML Research Press.","mla":"Pervez, Adeel A., et al. “Mechanistic PDE Networks for Discovery of Governing Equations.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 48962–73.","ista":"Pervez AA, Gavves E, Locatello F. 2025. Mechanistic PDE networks for discovery of governing equations. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 48962–48973.","ieee":"A. A. Pervez, E. Gavves, and F. Locatello, “Mechanistic PDE networks for discovery of governing equations,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 48962–48973.","ama":"Pervez AA, Gavves E, Locatello F. Mechanistic PDE networks for discovery of governing equations. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:48962-48973.","short":"A.A. Pervez, E. Gavves, F. Locatello, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 48962–48973.","chicago":"Pervez, Adeel A, Efstratios Gavves, and Francesco Locatello. “Mechanistic PDE Networks for Discovery of Governing Equations.” In <i>42nd International Conference on Machine Learning</i>, 267:48962–73. ML Research Press, 2025."},"file_date_updated":"2025-12-16T12:21:49Z","alternative_title":["PMLR"],"corr_author":"1","department":[{"_id":"FrLo"}],"has_accepted_license":"1","project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"},{"grant_number":"COE12","_id":"a392d8f0-b034-11f1-b88e-d3025c6734f6","name":"Bilateral Artificial Intelligence (Locatello)"}],"oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","scopus_import":"1","year":"2025","status":"public","related_material":{"link":[{"relation":"software","url":"https://github.com/ alpz/mech-nn-discovery-pde"}]},"intvolume":"       267","type":"conference","date_created":"2025-12-14T23:02:04Z","date_published":"2025-05-01T00:00:00Z","oa":1,"arxiv":1,"publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"42nd International Conference on Machine Learning","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19","start_date":"2025-07-13","location":"Vancouver, Canada"},"OA_type":"gold","file":[{"file_name":"2025_ICML_Pervez.pdf","date_created":"2025-12-16T12:21:49Z","access_level":"open_access","relation":"main_file","date_updated":"2025-12-16T12:21:49Z","checksum":"933cb673fb41416f537278fb990df6c3","success":1,"file_id":"20827","content_type":"application/pdf","creator":"dernst","file_size":993381}],"quality_controlled":"1","volume":267,"OA_place":"publisher","ec_funded":1,"page":"48962-48973","author":[{"id":"fca6d90c-d47f-11ee-bc87-93ff51604981","last_name":"Pervez","full_name":"Pervez, Adeel A","first_name":"Adeel A"},{"first_name":"Efstratios","full_name":"Gavves, Efstratios","last_name":"Gavves"},{"full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello"}],"day":"01"},{"date_created":"2025-12-28T23:01:26Z","oa":1,"date_published":"2025-12-15T00:00:00Z","intvolume":"       122","year":"2025","status":"public","issue":"51","type":"journal_article","publication_status":"published","fulldoi":"https://doi.org/10.1073/pnas.2524109122","publication":"Proceedings of the National Academy of Sciences","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"volume":122,"article_type":"original","OA_type":"hybrid","pmid":1,"quality_controlled":"1","file":[{"relation":"main_file","date_updated":"2025-12-29T09:36:50Z","checksum":"dd50b62a1efc28c0133fe9c11dbee53c","file_name":"2025_PNAS_Svoboda.pdf","date_created":"2025-12-29T09:36:50Z","access_level":"open_access","creator":"dernst","file_size":2308124,"success":1,"file_id":"20860","content_type":"application/pdf"}],"author":[{"last_name":"Svoboda","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"day":"15","ec_funded":1,"OA_place":"publisher","page":"e2524109122","title":"Promoters of cooperation in evolutionary games","publisher":"National Academy of Sciences","_id":"20857","date_updated":"2026-09-16T07:20:45Z","ddc":["000"],"acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.","external_id":{"pmid":["41397136"]},"APC_amount":"3003,56 EUR","corr_author":"1","has_accepted_license":"1","department":[{"_id":"KrCh"}],"article_processing_charge":"Yes (in subscription journal)","citation":{"mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51, National Academy of Sciences, 2025, p. e2524109122, doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>.","apa":"Svoboda, J., &#38; Chatterjee, K. (2025). Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences 122 (2025) e2524109122.","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2025. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>.","ama":"Svoboda J, Chatterjee K. Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. 2025;122(51):e2524109122. doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>","ieee":"J. Svoboda and K. Chatterjee, “Promoters of cooperation in evolutionary games,” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51. National Academy of Sciences, p. e2524109122, 2025.","ista":"Svoboda J, Chatterjee K. 2025. Promoters of cooperation in evolutionary games. Proceedings of the National Academy of Sciences. 122(51), e2524109122."},"file_date_updated":"2025-12-29T09:36:50Z","doi":"10.1073/pnas.2524109122","publication_identifier":{"eissn":["1091-6490"]},"abstract":[{"lang":"eng","text":"Evolutionary games provide a flexible mathematical framework for many problems in biology and social evolution. Prisoners’ dilemma, and in particular, the important special case of donation games, represents social dilemmas where cooperation is mutually beneficial, yet defection is preferred by selfish agents. In evolutionary games on networks, the agents interact over a population structure. The existence of population structures that promote cooperative behavior is a fascinating and active research topic. Previous research establishes structures promoting cooperation in the limit of weak selection where the benefit-to-cost ratio β exceeds 1.5. The existence of such structures for medium and strong selection for 1 < ß < 2 and for weak selection for 1 < ß < 1.5 has been a long-standing open question. First, we answer the open questions in the affirmative: For every selection strength and every ß > 1, we construct networks promoting cooperation. Second, we present a robustness result with respect to β and selection strength: Our structures promote cooperation for a range of these parameter values rather than specific parameter values. Finally, we supplement our theoretical results with simulation results on small population structures that show the effectiveness of our construction over well-studied population structures."}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","scopus_import":"1","oa_version":"Published Version"},{"volume":334,"quality_controlled":"1","file":[{"success":1,"file_id":"21331","content_type":"application/pdf","creator":"dernst","file_size":876167,"file_name":"2025_ICALP_Giambartolomei.pdf","access_level":"open_access","date_created":"2026-02-19T07:41:55Z","checksum":"960110956c26a5cefadde8e47888bfbe","relation":"main_file","date_updated":"2026-02-19T07:41:55Z"}],"OA_type":"gold","day":"30","author":[{"full_name":"Giambartolomei, Giordano","first_name":"Giordano","last_name":"Giambartolomei"},{"last_name":"Mallmann-Trenn","full_name":"Mallmann-Trenn, Frederik","first_name":"Frederik"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J"}],"ec_funded":1,"OA_place":"publisher","oa":1,"date_published":"2025-06-30T00:00:00Z","date_created":"2026-02-18T10:44:14Z","type":"conference","intvolume":"       334","year":"2025","status":"public","conference":{"location":"Aarhus, Denmark","end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming","start_date":"2025-07-08"},"publication":"52nd International Colloquium on Automata, Languages, and Programming","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.4230/LIPIcs.ICALP.2025.87","project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","language":[{"iso":"eng"}],"oa_version":"Published Version","title":"IID prophet inequality with random horizon: Going beyond increasing hazard rates","acknowledgement":"We would like to thank José Correa for his precious advice, Bruno Ziliotto and Vasilis Livanos for early conversations. Giambartolomei, Giordano: EPSRC grants EP/W005573/1 and EP/X021696/1. Mallmann-Trenn, Frederik: EPSRC grant EP/W005573/1. Saona, Raimundo: ERC grant CoG 863818 (ForM-SMArt), ANID Chile grant ACT210005, French Agence Nationale de la Recherche (ANR) grant ANR-21-CE40-0020 (CONVERGENCE), and Austrian Science Fund (FWF) grant 10.55776/COE12.","external_id":{"arxiv":["2407.11752"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","_id":"21320","date_updated":"2026-09-16T07:25:05Z","ddc":["000"],"has_accepted_license":"1","department":[{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"file_date_updated":"2026-02-19T07:41:55Z","citation":{"mla":"Giambartolomei, Giordano, et al. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>.","apa":"Giambartolomei, G., Mallmann-Trenn, F., &#38; Saona Urmeneta, R. J. (2025). IID prophet inequality with random horizon: Going beyond increasing hazard rates. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>","ieee":"G. Giambartolomei, F. Mallmann-Trenn, and R. J. Saona Urmeneta, “IID prophet inequality with random horizon: Going beyond increasing hazard rates,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334.","ista":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. 2025. IID prophet inequality with random horizon: Going beyond increasing hazard rates. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334.","chicago":"Giambartolomei, Giordano, Frederik Mallmann-Trenn, and Raimundo J Saona Urmeneta. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Vol. 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>.","short":"G. Giambartolomei, F. Mallmann-Trenn, R.J. Saona Urmeneta, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. IID prophet inequality with random horizon: Going beyond increasing hazard rates. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>"},"doi":"10.4230/LIPIcs.ICALP.2025.87","abstract":[{"lang":"eng","text":"Prophet inequalities are a central object of study in optimal stopping theory. In the iid model, a gambler sees values in an online fashion, sampled independently from a given distribution. Upon observing each value, the gambler either accepts it as a reward, or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is to maximise the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations. \r\nThis model has been studied with infinite, finite and unknown number of values. When the gambler faces a random number of values, the model is said to have a random horizon. We consider the model in which the gambler is given a priori knowledge of the horizon’s distribution. Alijani et al. (2020) designed a single-threshold algorithm achieving a ratio of 1/2 when the random horizon has an increasing hazard rate and is independent of the values. We prove that with a single threshold, a ratio of 1/2 is actually achievable for several larger classes of horizon distributions, with the largest being known as the 𝒢 class in reliability theory. Moreover, we show that this does not extend to its dual, the  ̅𝒢 class (which includes the decreasing hazard rate class), while it can be extended to low-variance horizons. Finally, we construct the first example of a family of horizons, for which multiple thresholds are necessary to achieve a nonzero ratio. We establish that the Secretary Problem optimal stopping rule provides one such algorithm, paving the way towards the study of the model beyond single-threshold algorithms."}],"publication_identifier":{"isbn":["9783959773720"]},"article_processing_charge":"No"},{"page":"67499-67536","OA_place":"publisher","day":"30","author":[{"id":"1a5914c2-896a-11ed-bdf8-fb80621a0635","last_name":"Wu","full_name":"Wu, Diyuan","first_name":"Diyuan"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco"}],"file":[{"success":1,"file_id":"21337","content_type":"application/pdf","creator":"dernst","file_size":3994385,"file_name":"2025_ICML_Wu.pdf","access_level":"open_access","date_created":"2026-02-19T08:28:22Z","checksum":"c5ce8b1c83e33dc3a11122f4910deb67","date_updated":"2026-02-19T08:28:22Z","relation":"main_file"}],"quality_controlled":"1","OA_type":"gold","volume":267,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Proceedings of the 42nd International Conference on Machine Learning","publication_status":"published","arxiv":1,"conference":{"start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada"},"type":"conference","year":"2025","status":"public","intvolume":"       267","date_published":"2025-07-30T00:00:00Z","oa":1,"date_created":"2026-02-18T12:02:45Z","oa_version":"Published Version","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","project":[{"grant_number":"COE12","_id":"74caaef7-b034-11f1-8f2d-e0e993bb422e","name":"Bilateral Artificial Intelligence (Mondelli)"}],"publication_identifier":{"eissn":["2640-3498"]},"abstract":[{"text":"Neural Collapse is a phenomenon where the last-layer representations of a well-trained neural network converge to a highly structured geometry. In this paper, we focus on its first (and most basic) property, known as NC1: the within-class variability vanishes. While prior theoretical studies establish the occurrence of NC1 via the data-agnostic unconstrained features model, our work adopts a data-specific perspective, analyzing NC1 in a three-layer neural network, with the first two layers operating in the mean-field regime and followed by a linear layer. In particular, we establish a fundamental connection between NC1 and the loss landscape: we prove that points with small empirical loss and gradient norm (thus, close to being stationary) approximately satisfy NC1, and the closeness to NC1 is controlled by the residual loss and gradient norm. We then show that (i) gradient flow on the mean squared error converges to NC1 solutions with small empirical loss, and (ii) for well-separated data distributions, both NC1 and vanishing test loss are achieved simultaneously. This aligns with the empirical observation that NC1 emerges during training while models attain near-zero test error. Overall, our results demonstrate that NC1 arises from gradient training due to the properties of the loss landscape, and they show the co-occurrence of NC1 and small test error for certain data distributions.","lang":"eng"}],"citation":{"ista":"Wu D, Mondelli M. 2025. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 67499–67536.","ieee":"D. Wu and M. Mondelli, “Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 67499–67536.","ama":"Wu D, Mondelli M. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:67499-67536.","chicago":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:67499–536. ML Research Press, 2025.","short":"D. Wu, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 67499–67536.","apa":"Wu, D., &#38; Mondelli, M. (2025). Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 67499–67536). Vancouver, Canada: ML Research Press.","mla":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 67499–536."},"file_date_updated":"2026-02-19T08:28:22Z","article_processing_charge":"No","department":[{"_id":"MaMo"}],"has_accepted_license":"1","corr_author":"1","alternative_title":["PMLR"],"external_id":{"arxiv":["2501.19104"]},"acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For the purpose of open access, the authors have applied a CC BY public\r\ncopyright license to any Author Accepted Manuscript version arising from this submission. The authors would like to thank Peter Sukenık for general helpful discussions and for pointing out that all the stationary points are approximately proportional in the case without entropic regularization. ","date_updated":"2026-09-16T07:25:42Z","ddc":["000"],"publisher":"ML Research Press","_id":"21326","title":"Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime"},{"doi":"10.4230/LIPIcs.ICALP.2025.150","file_date_updated":"2026-02-18T07:50:56Z","citation":{"ista":"Chatterjee K, Doyen L, Raskin J-F, Sankur O. 2025. The value problem for multiple-environment MDPs with parity objective. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, , 150.","ieee":"K. Chatterjee, L. Doyen, J.-F. Raskin, and O. Sankur, “The value problem for multiple-environment MDPs with parity objective,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025.","ama":"Chatterjee K, Doyen L, Raskin J-F, Sankur O. The value problem for multiple-environment MDPs with parity objective. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.150\">10.4230/LIPIcs.ICALP.2025.150</a>","short":"K. Chatterjee, L. Doyen, J.-F. Raskin, O. Sankur, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Jean-Francois Raskin, and Ocan Sankur. “The Value Problem for Multiple-Environment MDPs with Parity Objective.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.150\">https://doi.org/10.4230/LIPIcs.ICALP.2025.150</a>.","apa":"Chatterjee, K., Doyen, L., Raskin, J.-F., &#38; Sankur, O. (2025). The value problem for multiple-environment MDPs with parity objective. In <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.150\">https://doi.org/10.4230/LIPIcs.ICALP.2025.150</a>","mla":"Chatterjee, Krishnendu, et al. “The Value Problem for Multiple-Environment MDPs with Parity Objective.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.150\">10.4230/LIPIcs.ICALP.2025.150</a>."},"publication_identifier":{"isbn":["9783959773720"]},"abstract":[{"lang":"eng","text":"We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition structure and probability. The value of a strategy is the probability to satisfy the objective, here a parity objective, in the worst-case scenario, and the value of an MEMDP is the supremum of the values achievable by a strategy.\r\nWe show that deciding whether the value is 1 is a PSPACE-complete problem, and even in P when the number of environments is fixed, along with new insights to the almost-sure winning problem, which is to decide if there exists a strategy with value 1. Pure strategies are sufficient for theses problems, whereas randomization is necessary in general when the value is smaller than 1. We present an algorithm to approximate the value, running in double exponential space. Our results are in contrast to the related model of partially-observable MDPs where all these problems are known to be undecidable."}],"article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"KrCh"}],"alternative_title":["LIPIcs"],"corr_author":"1","acknowledgement":"Krishnendu Chatterjee: ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund\r\n(FWF) 10.55776/COE12. Jean-François Raskin: PDR Weave project FORM-LEARN-POMDP funded by FNRS and DFG, and the support of the Fondation ULB. Ocan Sankur: ANR BisoUS (ANR-22-CE48-0012) and ANR EpiRL (ANR-22-CE23-0029).","external_id":{"arxiv":["2504.15960"]},"_id":"21268","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","ddc":["000"],"date_updated":"2026-09-16T07:23:50Z","title":"The value problem for multiple-environment MDPs with parity objective","oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"month":"07","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"},{"_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12"}],"article_number":"150","publication":"52nd International Colloquium on Automata, Languages, and Programming","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.4230/LIPIcs.ICALP.2025.150","conference":{"location":"Aarhus, Denmark","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11","start_date":"2025-07-08"},"type":"conference","status":"public","year":"2025","oa":1,"date_published":"2025-07-30T00:00:00Z","date_created":"2026-02-17T07:49:17Z","ec_funded":1,"OA_place":"publisher","day":"30","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"first_name":"Jean-Francois","full_name":"Raskin, Jean-Francois","last_name":"Raskin"},{"last_name":"Sankur","full_name":"Sankur, Ocan","first_name":"Ocan"}],"quality_controlled":"1","file":[{"file_id":"21313","content_type":"application/pdf","success":1,"file_size":1075724,"creator":"dernst","date_created":"2026-02-18T07:50:56Z","access_level":"open_access","file_name":"2025_LIPIcs_Chatterjee.pdf","date_updated":"2026-02-18T07:50:56Z","relation":"main_file","checksum":"4477a7fd4fbf0ba6c8e9b15683b5a6b8"}],"OA_type":"gold"},{"department":[{"_id":"KrCh"}],"has_accepted_license":"1","alternative_title":["LIPIcs"],"abstract":[{"text":"Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over p parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the p cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an 𝒪(p) approximation algorithm for the problem with p parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to 𝒪(√p). We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network.","lang":"eng"}],"publication_identifier":{"isbn":["9783959774024"],"issn":["1868-8969"]},"file_date_updated":"2026-03-09T11:51:59Z","doi":"10.4230/LIPIcs.DISC.2025.23","citation":{"ista":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. 2025. Boosting payment channel network liquidity with topology optimization and transaction selection. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 23.","ieee":"K. Chatterjee, J. M. Křišťan, S. Schmid, J. Svoboda, and M. X. Yeo, “Boosting payment channel network liquidity with topology optimization and transaction selection,” in <i>39th International Symposium on Distributed Computing</i>, Berlin, Germany, 2025, vol. 356.","ama":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. Boosting payment channel network liquidity with topology optimization and transaction selection. In: <i>39th International Symposium on Distributed Computing</i>. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>","chicago":"Chatterjee, Krishnendu, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” In <i>39th International Symposium on Distributed Computing</i>, Vol. 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>.","short":"K. Chatterjee, J.M. Křišťan, S. Schmid, J. Svoboda, M.X. Yeo, in:, 39th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","apa":"Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2025). Boosting payment channel network liquidity with topology optimization and transaction selection. In <i>39th International Symposium on Distributed Computing</i> (Vol. 356). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>","mla":"Chatterjee, Krishnendu, et al. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” <i>39th International Symposium on Distributed Computing</i>, vol. 356, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>."},"article_processing_charge":"No","title":"Boosting payment channel network liquidity with topology optimization and transaction selection","external_id":{"cryptoeprintid":["2025/1484"],"arxiv":["2508.14524"]},"acknowledgement":"Chatterjee, Krishnendu: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nKřišťan, Jan Matyáš: Czech Science Foundation Grant no. 24-12046S.\r\nSchmid, Stefan: German Research Foundation (DFG) project ReNO (SPP 2378) from 2023-2027.\r\nSvoboda, Jakub: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nYeo, Michelle: MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms).","ddc":["000"],"date_updated":"2026-09-16T07:27:09Z","_id":"21412","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","oa_version":"Published Version","article_number":"23","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee"}],"conference":{"location":"Berlin, Germany","end_date":"2025-10-31","name":"DISC: Symposium on Distributed Computing","start_date":"2025-10-27"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"39th International Symposium on Distributed Computing","fulldoi":"https://doi.org/10.4230/LIPIcs.DISC.2025.23","publication_status":"published","arxiv":1,"date_published":"2025-10-22T00:00:00Z","oa":1,"date_created":"2026-03-08T23:01:46Z","type":"conference","year":"2025","status":"public","intvolume":"       356","day":"22","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš","first_name":"Jan Matyáš"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"},{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub"},{"first_name":"Michelle X","full_name":"Yeo, Michelle X","last_name":"Yeo","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0001-3676-4809"}],"OA_place":"publisher","ec_funded":1,"cryptoeprintid":1,"volume":356,"file":[{"checksum":"8e3d1594365df60163d9df22158a37b1","date_updated":"2026-03-09T11:51:59Z","relation":"main_file","file_name":"2025_DISC_Chatterjee.pdf","access_level":"open_access","date_created":"2026-03-09T11:51:59Z","creator":"dernst","file_size":1130069,"success":1,"file_id":"21418","content_type":"application/pdf"}],"quality_controlled":"1","OA_type":"gold"},{"external_id":{"arxiv":["2506.05408"]},"acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) [10.55776/COE12] and supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).\r\n","ddc":["000"],"date_updated":"2026-09-16T07:26:12Z","publisher":"ML Research Press","_id":"20819","title":"Differentially private federated k-means clustering with server-side data","publication_identifier":{"eissn":["2640-3498"]},"abstract":[{"text":"Clustering is a cornerstone of data analysis that is particularly suited to identifying coherent subgroups or substructures in unlabeled data, as are generated continuously in large amounts these days. However, in many cases traditional clustering methods are not applicable, because data are increasingly being produced and stored in a distributed way, e.g. on edge devices, and privacy concerns prevent it from being transferred to a central server. To address this challenge, we present FedDP-KMeans, a new algorithm for \r\n-means clustering that is fully-federated as well as differentially private. Our approach leverages (potentially small and out-of-distribution) server-side data to overcome the primary challenge of differentially private clustering methods: the need for a good initialization. Combining our initialization with a simple federated DP-Lloyds algorithm we obtain an algorithm that achieves excellent results on synthetic and real-world benchmark tasks. We also provide a theoretical analysis of our method that provides bounds on the convergence speed and cluster identification success.","lang":"eng"}],"file_date_updated":"2025-12-16T12:38:29Z","citation":{"apa":"Scott, J. A., Lampert, C., &#38; Saulpic, D. (2025). Differentially private federated k-means clustering with server-side data. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 53757–53790). Vancouver, Canada: ML Research Press.","mla":"Scott, Jonathan A., et al. “Differentially Private Federated K-Means Clustering with Server-Side Data.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 53757–90.","ama":"Scott JA, Lampert C, Saulpic D. Differentially private federated k-means clustering with server-side data. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:53757-53790.","chicago":"Scott, Jonathan A, Christoph Lampert, and David Saulpic. “Differentially Private Federated K-Means Clustering with Server-Side Data.” In <i>42nd International Conference on Machine Learning</i>, 267:53757–90. ML Research Press, 2025.","short":"J.A. Scott, C. Lampert, D. Saulpic, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 53757–53790.","ista":"Scott JA, Lampert C, Saulpic D. 2025. Differentially private federated k-means clustering with server-side data. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 53757–53790.","ieee":"J. A. Scott, C. Lampert, and D. Saulpic, “Differentially private federated k-means clustering with server-side data,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 53757–53790."},"article_processing_charge":"No","department":[{"_id":"ChLa"},{"_id":"MoHe"}],"has_accepted_license":"1","corr_author":"1","alternative_title":["PMLR"],"project":[{"grant_number":"COE12","_id":"d8f03aaa-b035-11f1-8588-d5147fa879e0","name":"Bilateral Artificial Intelligence (Lampert)"}],"oa_version":"Published Version","scopus_import":"1","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"type":"conference","year":"2025","status":"public","related_material":{"record":[{"id":"21198","status":"public","relation":"dissertation_contains"}]},"intvolume":"       267","date_published":"2025-05-01T00:00:00Z","oa":1,"date_created":"2025-12-14T23:02:05Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"42nd International Conference on Machine Learning","publication_status":"published","arxiv":1,"conference":{"end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13","location":"Vancouver, Canada"},"file":[{"creator":"dernst","file_size":746612,"success":1,"content_type":"application/pdf","file_id":"20829","checksum":"815b32b463023ca21e569c2158745c15","date_updated":"2025-12-16T12:38:29Z","relation":"main_file","file_name":"2025_ICML_Scott.pdf","access_level":"open_access","date_created":"2025-12-16T12:38:29Z"}],"quality_controlled":"1","OA_type":"gold","volume":267,"page":"53757-53790","OA_place":"publisher","day":"01","acknowledged_ssus":[{"_id":"ScienComp"}],"author":[{"id":"e499926b-f6e0-11ea-865d-9c63db0031e8","last_name":"Scott","first_name":"Jonathan A","full_name":"Scott, Jonathan A"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"last_name":"Saulpic","id":"f8e48cf0-b0ff-11ed-b0e9-b4c35598f964","first_name":"David","full_name":"Saulpic, David"}]},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2505.15579"}],"oa_version":"Preprint","month":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_number":"2505.15579","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Personalized federated learning has emerged as a popular approach to training on devices holding statistically heterogeneous data, known as clients. However, most existing approaches require a client to have labeled data for training or finetuning in order to obtain their own personalized model. In this paper we address this by proposing FLowDUP, a novel method that is able to generate a personalized model using only a forward pass with unlabeled data. The generated model parameters reside in a low-dimensional subspace, enabling efficient communication and computation. FLowDUP's learning objective is theoretically motivated by our new transductive multi-task PAC-Bayesian generalization bound, that provides performance guarantees for unlabeled clients. The objective is structured in such a way that it allows both clients with labeled data and clients with only unlabeled data to contribute to the training process. To supplement our theoretical results we carry out a thorough experimental evaluation of FLowDUP, demonstrating strong empirical performance on a range of datasets with differing sorts of statistically heterogeneous clients. Through numerous ablation studies, we test the efficacy of the individual components of the method."}],"doi":"10.48550/ARXIV.2505.15579","citation":{"ista":"Zakerinia H, Scott JA, Lampert C. Federated learning with unlabeled clients: Personalization can happen in low dimensions. arXiv, 2505.15579.","ieee":"H. Zakerinia, J. A. Scott, and C. Lampert, “Federated learning with unlabeled clients: Personalization can happen in low dimensions,” <i>arXiv</i>. .","ama":"Zakerinia H, Scott JA, Lampert C. Federated learning with unlabeled clients: Personalization can happen in low dimensions. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">10.48550/ARXIV.2505.15579</a>","chicago":"Zakerinia, Hossein, Jonathan A Scott, and Christoph Lampert. “Federated Learning with Unlabeled Clients: Personalization Can Happen in Low Dimensions.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">https://doi.org/10.48550/ARXIV.2505.15579</a>.","short":"H. Zakerinia, J.A. Scott, C. Lampert, ArXiv (n.d.).","apa":"Zakerinia, H., Scott, J. A., &#38; Lampert, C. (n.d.). Federated learning with unlabeled clients: Personalization can happen in low dimensions. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">https://doi.org/10.48550/ARXIV.2505.15579</a>","mla":"Zakerinia, Hossein, et al. “Federated Learning with Unlabeled Clients: Personalization Can Happen in Low Dimensions.” <i>ArXiv</i>, 2505.15579, doi:<a href=\"https://doi.org/10.48550/ARXIV.2505.15579\">10.48550/ARXIV.2505.15579</a>."},"corr_author":"1","department":[{"_id":"ChLa"}],"date_updated":"2026-09-16T07:26:12Z","_id":"21207","title":"Federated learning with unlabeled clients: Personalization can happen in low dimensions","OA_place":"repository","das_tickbox":"1","author":[{"first_name":"Hossein","full_name":"Zakerinia, Hossein","id":"653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4","orcid":"0009-0007-3977-6462","last_name":"Zakerinia"},{"full_name":"Scott, Jonathan A","first_name":"Jonathan A","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","last_name":"Scott"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"day":"21","OA_type":"green","fulldoi":"https://doi.org/10.48550/ARXIV.2505.15579","publication_status":"draft","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"arXiv","status":"public","year":"2025","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"21198"}]},"type":"preprint","date_created":"2026-02-10T08:20:59Z","date_published":"2025-05-21T00:00:00Z","oa":1},{"project":[{"_id":"d8f03aaa-b035-11f1-8588-d5147fa879e0","name":"Bilateral Artificial Intelligence (Lampert)","grant_number":"COE12"}],"scopus_import":"1","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","oa_version":"Published Version","main_file_link":[{"open_access":"1","url":"https://doi.org/10.52202/085713-1924"}],"title":"Continual release moment estimation with differential privacy","acknowledgement":"We thank Monika Henzinger for her valuable feedback and insightful discussions on earlier versions\r\nof this draft. We are also grateful to Mher Safaryan for his contributions to discussions on DP-Adam.\r\nAdditionally, we thank Ryan McKenna for suggesting Joint Clipping as a baseline.\r\nJalaj Upadhyay’s research was funded by the Rutgers Decanal Grant no. 302918, NSF CNS 2433628,\r\nGoogle Research Scholar Award, and Google Seed Fund Grant. A part of this work was done while\r\nvisiting the Institute of Science and Technology Austria (ISTA).\r\nNikita Kalinin’s research was funded in part by the Austrian Science Fund (FWF) [10.55776/COE12]","date_updated":"2026-09-16T07:40:56Z","_id":"22828","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"corr_author":"1","alternative_title":["Advances in Neural Information Processing Systems"],"publication_identifier":{"isbn":["9798331338275"],"issn":["1049-5258"]},"abstract":[{"lang":"eng","text":"We propose Joint Moment Estimation (JME), a method for continually and privately estimating both the first and second moments of a data stream with reduced noise compared to naive approaches. JME supports the matrix mechanism and exploits a joint sensitivity analysis to identify a privacy regime in which the second-moment estimation incurs no additional privacy cost, thereby improving accuracy while maintaining privacy. We demonstrate JME’s effectiveness in two applications: estimating the running mean and covariance matrix for Gaussian density estimation and model training with DP-Adam."}],"doi":"10.52202/085713-1924","citation":{"apa":"Kalinin, N., Upadhyay, J., &#38; Lampert, C. (2025). Continual release moment estimation with differential privacy. In <i>Advances in Neural Information Processing Systems</i> (Vol. 38, pp. 64002–64047). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-1924\">https://doi.org/10.52202/085713-1924</a>","mla":"Kalinin, Nikita, et al. “Continual Release Moment Estimation with Differential Privacy.” <i>Advances in Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 64002–47, doi:<a href=\"https://doi.org/10.52202/085713-1924\">10.52202/085713-1924</a>.","ista":"Kalinin N, Upadhyay J, Lampert C. 2025. Continual release moment estimation with differential privacy. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 64002–64047.","ieee":"N. Kalinin, J. Upadhyay, and C. Lampert, “Continual release moment estimation with differential privacy,” in <i>Advances in Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38, pp. 64002–64047.","ama":"Kalinin N, Upadhyay J, Lampert C. Continual release moment estimation with differential privacy. In: <i>Advances in Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025:64002-64047. doi:<a href=\"https://doi.org/10.52202/085713-1924\">10.52202/085713-1924</a>","short":"N. Kalinin, J. Upadhyay, C. Lampert, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 64002–64047.","chicago":"Kalinin, Nikita, Jalaj Upadhyay, and Christoph Lampert. “Continual Release Moment Estimation with Differential Privacy.” In <i>Advances in Neural Information Processing Systems</i>, 38:64002–47. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-1924\">https://doi.org/10.52202/085713-1924</a>."},"article_processing_charge":"No","supplementarymaterial":"no","volume":38,"quality_controlled":"1","OA_type":"free access","day":"02","author":[{"last_name":"Kalinin","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","full_name":"Kalinin, Nikita"},{"first_name":"Jalaj","full_name":"Upadhyay, Jalaj","last_name":"Upadhyay"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph"}],"page":"64002-64047","das_tickbox":"0","OA_place":"publisher","date_published":"2025-12-02T00:00:00Z","oa":1,"date_created":"2026-09-06T22:02:00Z","type":"conference","year":"2025","researchdata_availability":"no","status":"public","intvolume":"        38","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"San Diego, CA, United States"},"publication":"Advances in Neural Information Processing Systems","fulldoi":"https://doi.org/10.52202/085713-1924","publication_status":"published"},{"arxiv":1,"publication_status":"published","fulldoi":"https://doi.org/10.1051/0004-6361/202452963","publication":"Astronomy & Astrophysics","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2025-06-15T22:01:29Z","oa":1,"date_published":"2025-06-01T00:00:00Z","intvolume":"       698","researchdata_availability":"no","status":"public","year":"2025","type":"journal_article","author":[{"first_name":"N.","full_name":"Britavskiy, N.","last_name":"Britavskiy"},{"first_name":"L.","full_name":"Mahy, L.","last_name":"Mahy"},{"first_name":"D. J.","full_name":"Lennon, D. J.","last_name":"Lennon"},{"last_name":"Patrick","full_name":"Patrick, L. R.","first_name":"L. R."},{"last_name":"Sana","full_name":"Sana, H.","first_name":"H."},{"full_name":"Villaseñor, J. I.","first_name":"J. I.","last_name":"Villaseñor"},{"first_name":"T.","full_name":"Shenar, T.","last_name":"Shenar"},{"last_name":"Bodensteiner","full_name":"Bodensteiner, J.","first_name":"J."},{"first_name":"M.","full_name":"Bernini-Peron, M.","last_name":"Bernini-Peron"},{"last_name":"Berlanas","full_name":"Berlanas, S. R.","first_name":"S. R."},{"full_name":"Bowman, D. M.","first_name":"D. M.","last_name":"Bowman"},{"full_name":"Crowther, P. A.","first_name":"P. A.","last_name":"Crowther"},{"first_name":"S. E.","full_name":"De Mink, S. E.","last_name":"De Mink"},{"last_name":"Evans","first_name":"C. J.","full_name":"Evans, C. J."},{"orcid":"0000-0002-6960-6911","last_name":"Götberg","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","first_name":"Ylva Louise Linsdotter","full_name":"Götberg, Ylva Louise Linsdotter"},{"last_name":"Holgado","full_name":"Holgado, G.","first_name":"G."},{"full_name":"Johnston, C.","first_name":"C.","last_name":"Johnston"},{"full_name":"Keszthelyi, Z.","first_name":"Z.","last_name":"Keszthelyi"},{"full_name":"Klencki, J.","first_name":"J.","last_name":"Klencki"},{"full_name":"Langer, N.","first_name":"N.","last_name":"Langer"},{"first_name":"I.","full_name":"Mandel, I.","last_name":"Mandel"},{"first_name":"A.","full_name":"Menon, A.","last_name":"Menon"},{"first_name":"M.","full_name":"Moe, M.","last_name":"Moe"},{"last_name":"Oskinova","full_name":"Oskinova, L. M.","first_name":"L. M."},{"full_name":"Pauli, D.","first_name":"D.","last_name":"Pauli"},{"first_name":"M.","full_name":"Pawlak, M.","last_name":"Pawlak"},{"last_name":"Ramachandran","full_name":"Ramachandran, V.","first_name":"V."},{"last_name":"Renzo","full_name":"Renzo, M.","first_name":"M."},{"last_name":"Sander","full_name":"Sander, A. A.C.","first_name":"A. A.C."},{"last_name":"Schneider","full_name":"Schneider, F. R.N.","first_name":"F. R.N."},{"full_name":"Schootemeijer, A.","first_name":"A.","last_name":"Schootemeijer"},{"last_name":"Sen","full_name":"Sen, K.","first_name":"K."},{"full_name":"Simón-Díaz, S.","first_name":"S.","last_name":"Simón-Díaz"},{"last_name":"Van Loon","first_name":"J. T.","full_name":"Van Loon, J. T."},{"full_name":"Vink, J. S.","first_name":"J. S.","last_name":"Vink"}],"isi":1,"day":"01","OA_place":"publisher","das_tickbox":"1","volume":698,"supplementarymaterial":"no","OA_type":"diamond","article_type":"original","quality_controlled":"1","file":[{"file_size":7106568,"creator":"dernst","content_type":"application/pdf","file_id":"19901","success":1,"checksum":"53a9f290cb1f468895e0d4446e0020f0","relation":"main_file","date_updated":"2025-06-25T08:38:02Z","access_level":"open_access","date_created":"2025-06-25T08:38:02Z","file_name":"2025_AstronomyAstrophysics_Britavskiy.pdf"}],"has_accepted_license":"1","department":[{"_id":"YlGo"}],"article_processing_charge":"Yes","citation":{"apa":"Britavskiy, N., Mahy, L., Lennon, D. J., Patrick, L. R., Sana, H., Villaseñor, J. I., … Vink, J. S. (2025). Binarity at LOw Metallicity (BLOeM): Multiplicity of early B-type supergiants in the Small Magellanic Cloud. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452963\">https://doi.org/10.1051/0004-6361/202452963</a>","mla":"Britavskiy, N., et al. “Binarity at LOw Metallicity (BLOeM): Multiplicity of Early B-Type Supergiants in the Small Magellanic Cloud.” <i>Astronomy &#38; Astrophysics</i>, vol. 698, A40, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452963\">10.1051/0004-6361/202452963</a>.","ista":"Britavskiy N, Mahy L, Lennon DJ, Patrick LR, Sana H, Villaseñor JI, Shenar T, Bodensteiner J, Bernini-Peron M, Berlanas SR, Bowman DM, Crowther PA, De Mink SE, Evans CJ, Götberg YLL, Holgado G, Johnston C, Keszthelyi Z, Klencki J, Langer N, Mandel I, Menon A, Moe M, Oskinova LM, Pauli D, Pawlak M, Ramachandran V, Renzo M, Sander AAC, Schneider FRN, Schootemeijer A, Sen K, Simón-Díaz S, Van Loon JT, Vink JS. 2025. Binarity at LOw Metallicity (BLOeM): Multiplicity of early B-type supergiants in the Small Magellanic Cloud. Astronomy &#38; Astrophysics. 698, A40.","ieee":"N. Britavskiy <i>et al.</i>, “Binarity at LOw Metallicity (BLOeM): Multiplicity of early B-type supergiants in the Small Magellanic Cloud,” <i>Astronomy &#38; Astrophysics</i>, vol. 698. EDP Sciences, 2025.","ama":"Britavskiy N, Mahy L, Lennon DJ, et al. Binarity at LOw Metallicity (BLOeM): Multiplicity of early B-type supergiants in the Small Magellanic Cloud. <i>Astronomy &#38; Astrophysics</i>. 2025;698. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452963\">10.1051/0004-6361/202452963</a>","short":"N. Britavskiy, L. Mahy, D.J. Lennon, L.R. Patrick, H. Sana, J.I. Villaseñor, T. Shenar, J. Bodensteiner, M. Bernini-Peron, S.R. Berlanas, D.M. Bowman, P.A. Crowther, S.E. De Mink, C.J. Evans, Y.L.L. Götberg, G. Holgado, C. Johnston, Z. Keszthelyi, J. Klencki, N. Langer, I. Mandel, A. Menon, M. Moe, L.M. Oskinova, D. Pauli, M. Pawlak, V. Ramachandran, M. Renzo, A.A.C. Sander, F.R.N. Schneider, A. Schootemeijer, K. Sen, S. Simón-Díaz, J.T. Van Loon, J.S. Vink, Astronomy &#38; Astrophysics 698 (2025).","chicago":"Britavskiy, N., L. Mahy, D. J. Lennon, L. R. Patrick, H. Sana, J. I. Villaseñor, T. Shenar, et al. “Binarity at LOw Metallicity (BLOeM): Multiplicity of Early B-Type Supergiants in the Small Magellanic Cloud.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452963\">https://doi.org/10.1051/0004-6361/202452963</a>."},"doi":"10.1051/0004-6361/202452963","file_date_updated":"2025-06-25T08:38:02Z","abstract":[{"text":"Context. The blue supergiant (BSG) domain contains a large variety of stars whose past and future evolutionary paths are still highly uncertain. Since binary interaction plays a crucial role in the fate of massive stars, investigating the multiplicity among BSGs helps shed light on the fate of such objects.\r\nAims. We aim to estimate the binary fraction of a large sample of BSGs in the Small Magellanic Cloud (SMC) within the Binarity at LOw Metallicity (BLOeM) survey. In total, we selected 262 targets with spectral types B0-B3 and luminosity classes I-II.\r\n\r\nMethods. This work is based on spectroscopic data collected by the FLAMES instrument, mounted on the Very Large Telescope, which gathered nine epochs over three months. Our spectroscopic analysis for each target includes the individual and peak-to-peak radial velocity measurements, an investigation of the line profile variability, and a periodogram analysis to search for possible short- and long-period binaries.\r\n\r\nResults. By applying a 20 km s−1 threshold on the peak-to-peak radial velocities above which we would consider the star to be binary, the resulting observed spectroscopic binary fraction for our BSG sample is 23 ± 3%. An independent analysis of line profile variability reveals 11 (plus 5 candidates) double-lined spectroscopic binaries and 32 (plus 41 candidates) single-lined spectroscopic binaries. Based on these results, we estimated the overall observed binary fraction in this sample to be 34 ± 3%, which is close to the computed intrinsic binary fraction of 40 ± 4%. In addition, we derived reliable orbital periods for 41 spectroscopic binaries and potential binary candidates, among which there are 17 eclipsing binaries, including 20 SB1 and SB2 systems with periods of less than 10 days. We reported a significant drop in the binary fraction of BSGs with spectral types later than B2 and effective temperatures less than 18 kK, which could indicate the end of the main sequence phase in this temperature regime. We found no metallicity dependence in the binary fraction of BSGs, compared to existing spectroscopic surveys of the Galaxy and Large Magellanic Cloud.","lang":"eng"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"title":"Binarity at LOw Metallicity (BLOeM): Multiplicity of early B-type supergiants in the Small Magellanic Cloud","publisher":"EDP Sciences","_id":"19841","date_updated":"2026-09-16T09:10:41Z","ddc":["520"],"acknowledgement":"We thank the anonymous referee for helpful comments that have improved the manuscript. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement 101164755/METAL) and was supported by the Israel Science Foundation (ISF) under grant number 2434/24. NB acknowledges support from the Belgian federal government grant for Ukrainian postdoctoral researchers (contract UF/2022/10). TS acknowledges support by the Israel Science Foundation (ISF) under grant number 0603225041. DP acknowledges financial support from the Deutsches Zentrum für Luft und Raumfahrt (DLR) grant FKZ 50OR2005 and the FWO junior postdoctoral fellowship No. 1256225N. DMB gratefully acknowledges UK Research and Innovation (UKRI) in the form of a Frontier Research grant under the UK government’s ERC Horizon Europe funding guarantee (SYMPHONY; PI Bowman; grant number: EP/Y031059/1), and a Royal Society University Research Fellowship (PI Bowman; grant number: URF\\R1\\231631). KS is funded by the National Science Center (NCN), Poland, under grant number OPUS 2021/41/B/ST9/00757. IM acknowledges support from the Australian Research Council (ARC) Centre of Excellence for Gravitational Wave Discovery (OzGav), through project number CE230100016. JIV acknowledges support from the European Research Council through ERC Advanced Grant No. 101054731. SS-D, and GH acknowledge support from the Spanish Ministry of Science and Innovation and Universities (MICIU) through the Spanish State Research Agency (AEI) through grants PID2021-122397NB-C21, and the Severo Ochoa Program 2020-2023 (CEX2019-000920-S).","external_id":{"isi":["001497903100019"],"arxiv":["2502.12239"]},"month":"06","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","oa_version":"Published Version","article_number":"A40"},{"oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"month":"05","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"A239","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."}],"publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"citation":{"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>.","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).","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>","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.","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."},"file_date_updated":"2025-06-10T07:00:38Z","doi":"10.1051/0004-6361/202453185","article_processing_charge":"No","department":[{"_id":"YlGo"}],"has_accepted_license":"1","corr_author":"1","external_id":{"isi":["001494033100007"],"arxiv":["2412.05356"]},"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.","ddc":["520"],"date_updated":"2026-09-16T09:06:06Z","_id":"19797","publisher":"EDP Sciences","title":"The mass distribution of stars stripped in binaries: The effect of metallicity","das_tickbox":"0","OA_place":"publisher","day":"01","isi":1,"author":[{"first_name":"B.","full_name":"Hovis-Afflerbach, B.","last_name":"Hovis-Afflerbach"},{"first_name":"Ylva Louise Linsdotter","full_name":"Götberg, Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"first_name":"A.","full_name":"Schootemeijer, A.","last_name":"Schootemeijer"},{"last_name":"Klencki","first_name":"J.","full_name":"Klencki, J."},{"first_name":"A. L.","full_name":"Strom, A. L.","last_name":"Strom"},{"last_name":"Ludwig","first_name":"B. A.","full_name":"Ludwig, B. A."},{"last_name":"Drout","full_name":"Drout, M. R.","first_name":"M. R."}],"file":[{"relation":"main_file","date_updated":"2025-06-10T07:00:38Z","checksum":"caa92beb22ab3146a75c5b03e926de1f","date_created":"2025-06-10T07:00:38Z","access_level":"open_access","file_name":"2025_AstronomyAstrophysics_HovisAfflerbach.pdf","file_size":6378030,"creator":"dernst","content_type":"application/pdf","file_id":"19799","success":1}],"quality_controlled":"1","article_type":"original","OA_type":"diamond","supplementarymaterial":"no","volume":697,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Astronomy & Astrophysics","fulldoi":"https://doi.org/10.1051/0004-6361/202453185","publication_status":"published","arxiv":1,"type":"journal_article","year":"2025","status":"public","researchdata_availability":"no","intvolume":"       697","date_published":"2025-05-01T00:00:00Z","oa":1,"date_created":"2025-06-08T22:01:22Z"},{"day":"05","author":[{"full_name":"Mueller-Horn, Johanna","first_name":"Johanna","last_name":"Mueller-Horn"}],"month":"07","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","main_file_link":[{"url":"https://doi.org/10.17909/cfms-dg96","open_access":"1"}],"OA_place":"repository","OA_type":"green","department":[{"_id":"YlGo"}],"doi":"10.17909/cfms-dg96","citation":{"ama":"Mueller-Horn J. MWC656 Analysis. 2025. doi:<a href=\"https://doi.org/10.17909/cfms-dg96\">10.17909/cfms-dg96</a>","short":"J. Mueller-Horn, (2025).","chicago":"Mueller-Horn, Johanna. “MWC656 Analysis.” Repository, 2025. <a href=\"https://doi.org/10.17909/cfms-dg96\">https://doi.org/10.17909/cfms-dg96</a>.","ista":"Mueller-Horn J. 2025. MWC656 Analysis, Repository, <a href=\"https://doi.org/10.17909/cfms-dg96\">10.17909/cfms-dg96</a>.","ieee":"J. Mueller-Horn, “MWC656 Analysis.” Repository, 2025.","apa":"Mueller-Horn, J. (2025). MWC656 Analysis. Repository. <a href=\"https://doi.org/10.17909/cfms-dg96\">https://doi.org/10.17909/cfms-dg96</a>","mla":"Mueller-Horn, Johanna. <i>MWC656 Analysis</i>. Repository, 2025, doi:<a href=\"https://doi.org/10.17909/cfms-dg96\">10.17909/cfms-dg96</a>."},"abstract":[{"lang":"eng","text":"The HST spectra obtained for MWC656 and spectral data used for comparison in the publication.\r\nThis DOI is provided by the MAST archive at Space Telescope Science Institute"}],"fulldoi":"https://doi.org/10.17909/cfms-dg96","article_processing_charge":"No","oa":1,"title":"MWC656 Analysis","date_published":"2025-07-05T00:00:00Z","date_created":"2026-09-16T08:51:40Z","type":"research_data_reference","_id":"22933","publisher":"Repository","related_material":{"record":[{"relation":"used_in_publication","id":"22816","status":"public"}]},"status":"public","ddc":["520"],"date_updated":"2026-09-16T08:56:13Z","year":"2025"},{"article_processing_charge":"Yes","abstract":[{"text":"Context. Rapidly rotating classical OBe stars have been proposed as the products of binary interactions, and the fraction of Be stars with compact companions implies that at least some are. However, to constrain the interaction physics spinning up the OBe stars, a large sample of homogeneously analyzed OBe stars with well-determined binary characteristics and orbital parameters are required.\r\n\r\nAims. We investigated the multiplicity properties of a sample of 18 Oe, 62 Be, and two Of?p stars observed within the BLOeM survey in the Small Magellanic Cloud. We analyzed the first nine epochs of spectroscopic observations obtained over approximately three months in 2023.\r\n\r\nMethods. Radial velocities (RVs) of all stars were measured using cross-correlation based on different sets of absorption and emission lines. Applying commonly used binarity criteria, we classified objects as binaries, binary candidates, and apparently single (RV stable) objects. We further inspected the spectra for double-lined spectroscopic binaries and cross-matched with catalogs of X-ray sources and photometric binaries.\r\n\r\nResults. We classify 14 OBe stars as binaries, and an additional 11 as binary candidates. The two Of?p stars are apparently single. We find two more objects that are most likely currently interacting binaries. Without those, the observed binary fraction for the remaining OBe sample of 78 stars is fobs+candOBe = 0.18 ± 0.04 (fobs+candOBe = 0.32±0.05 including candidates). This binary fraction is less than half of that measured for OB stars in BLOeM. Combined with the lower fraction of SB2s, this suggests that OBe stars do indeed have fundamentally different present-day binary properties than OB stars. We find no evidence for OBe binaries with massive compact companions, in contrast to expectations from binary population synthesis.\r\n\r\nConclusions. Our results support the binary scenario as an important formation channel for OBe stars, as post-interaction binaries may have been disrupted or the stripped companions of OBe stars are harder to detect. Further observations are required to characterize the detected binaries, their orbital parameters, and the nature of their companions.","lang":"eng"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"doi":"10.1051/0004-6361/202452623","citation":{"mla":"Bodensteiner, J., et al. “Binarity at LOw Metallicity (BLOeM): Multiplicity Properties of Oe and Be Stars.” <i>Astronomy &#38; Astrophysics</i>, vol. 698, A38, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452623\">10.1051/0004-6361/202452623</a>.","apa":"Bodensteiner, J., Shenar, T., Sana, H., Britavskiy, N., Crowther, P. A., Langer, N., … Xu, X. T. (2025). Binarity at LOw Metallicity (BLOeM): Multiplicity properties of Oe and Be stars. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452623\">https://doi.org/10.1051/0004-6361/202452623</a>","chicago":"Bodensteiner, J., T. Shenar, H. Sana, N. Britavskiy, P. A. Crowther, N. Langer, D. J. Lennon, et al. “Binarity at LOw Metallicity (BLOeM): Multiplicity Properties of Oe and Be Stars.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452623\">https://doi.org/10.1051/0004-6361/202452623</a>.","short":"J. Bodensteiner, T. Shenar, H. Sana, N. Britavskiy, P.A. Crowther, N. Langer, D.J. Lennon, L. Mahy, L.R. Patrick, J.I. Villaseñor, M. Abdul-Masih, D.M. Bowman, A. De Koter, S.E. De Mink, K. Deshmukh, M. Fabry, A. Gilkis, Y.L.L. Götberg, G. Holgado, R.G. Izzard, S. Janssens, V.M. Kalari, Z. Keszthelyi, J. Kubát, I. Mandel, G. Maravelias, L.M. Oskinova, D. Pauli, V. Ramachandran, D.F. Rocha, M. Renzo, A.A.C. Sander, F.R.N. Schneider, A. Schootemeijer, K. Sen, M. Stoop, S. Toonen, J.T. Van Loon, R. Valli, A. Vigna-Gómez, J.S. Vink, C. Wang, X.T. Xu, Astronomy &#38; Astrophysics 698 (2025).","ama":"Bodensteiner J, Shenar T, Sana H, et al. Binarity at LOw Metallicity (BLOeM): Multiplicity properties of Oe and Be stars. <i>Astronomy &#38; Astrophysics</i>. 2025;698. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452623\">10.1051/0004-6361/202452623</a>","ieee":"J. Bodensteiner <i>et al.</i>, “Binarity at LOw Metallicity (BLOeM): Multiplicity properties of Oe and Be stars,” <i>Astronomy &#38; Astrophysics</i>, vol. 698. EDP Sciences, 2025.","ista":"Bodensteiner J, Shenar T, Sana H, Britavskiy N, Crowther PA, Langer N, Lennon DJ, Mahy L, Patrick LR, Villaseñor JI, Abdul-Masih M, Bowman DM, De Koter A, De Mink SE, Deshmukh K, Fabry M, Gilkis A, Götberg YLL, Holgado G, Izzard RG, Janssens S, Kalari VM, Keszthelyi Z, Kubát J, Mandel I, Maravelias G, Oskinova LM, Pauli D, Ramachandran V, Rocha DF, Renzo M, Sander AAC, Schneider FRN, Schootemeijer A, Sen K, Stoop M, Toonen S, Van Loon JT, Valli R, Vigna-Gómez A, Vink JS, Wang C, Xu XT. 2025. Binarity at LOw Metallicity (BLOeM): Multiplicity properties of Oe and Be stars. Astronomy &#38; Astrophysics. 698, A38."},"file_date_updated":"2025-06-23T07:54:57Z","department":[{"_id":"YlGo"}],"has_accepted_license":"1","date_updated":"2026-09-16T09:14:49Z","ddc":["520"],"_id":"19844","publisher":"EDP Sciences","external_id":{"isi":["001497903100011"],"arxiv":["2502.02641"]},"acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 and Horizon Europe research and innovation programme (grant agreement numbers 772225: MULTIPLES, and 945806) and is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster). DMB gratefully acknowledges funding from UK Research and Innovation (UKRI) in the form of a Frontier Research grant under the UK government’s ERC Horizon Europe funding guarantee (SYMPHONY; grant number: EP/Y031059/1), and a Royal Society University Research Fellowship (URF; grant number: URF\\R1\\231631). RGI is funded by STFC grant ST/Y002350/1 as part of the BRIDGCE UK network, and thanks IReNA colleagues for stimulating discussions. Z.K. acknowledges support from JSPS Kakenhi Grant-in-Aid for Scientific Research (23K19071). IM acknowledges support from the Australian Research Council (ARC) Centre of Excellence for GravitationalWave Discovery (OzGrav), through project number CE230100016. DP acknowledges financial support by the Deutsches Zentrum für Luft und Raumfahrt (DLR) grant FKZ 50OR2005. DFR is thankful for the support of CAPES-Br and FAPERJ/DSC-10 (SEI-260003/001630/2023). AACS and VR are supported by the German Deutsche Forschungsgemeinschaft (DFG) under Project-ID 445674056 (Emmy Noether Research Group SA4064/1-1, PI Sander). AACS and VR are further supported by funding from the Federal Ministry of Education and Research (BMBF) and the Baden-Württemberg Ministry of Science as part of the Excellence Strategy of the German Federal and State Governments. JIV acknowledges support from the European Research Council for the ERC Advanced Grant 101054731. LRP acknowledges support from grant PID2022-140483NB-C22 funded by MCIN/AEI/10.13039/501100011033. GH acknowledges support from grants PID2021-122397NB-C21/PID2022-136640NB-C22 funded by MCIN/AEI/FEDER/10.13039/501100011033. J.K. thanks for the support of a grant GA CR 22-34467S. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement 101164755/METAL) and was supported by the Israel Science Foundation (ISF) under grant number 2434/24.","title":"Binarity at LOw Metallicity (BLOeM): Multiplicity properties of Oe and Be stars","oa_version":"Published Version","month":"06","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","scopus_import":"1","article_number":"A38","fulldoi":"https://doi.org/10.1051/0004-6361/202452623","arxiv":1,"publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Astronomy & Astrophysics","researchdata_availability":"no","status":"public","year":"2025","intvolume":"       698","type":"journal_article","date_created":"2025-06-15T22:01:30Z","date_published":"2025-06-01T00:00:00Z","oa":1,"OA_place":"publisher","das_tickbox":"1","isi":1,"author":[{"last_name":"Bodensteiner","first_name":"J.","full_name":"Bodensteiner, J."},{"last_name":"Shenar","full_name":"Shenar, T.","first_name":"T."},{"last_name":"Sana","full_name":"Sana, H.","first_name":"H."},{"first_name":"N.","full_name":"Britavskiy, N.","last_name":"Britavskiy"},{"last_name":"Crowther","first_name":"P. A.","full_name":"Crowther, P. A."},{"last_name":"Langer","first_name":"N.","full_name":"Langer, N."},{"first_name":"D. J.","full_name":"Lennon, D. J.","last_name":"Lennon"},{"first_name":"L.","full_name":"Mahy, L.","last_name":"Mahy"},{"full_name":"Patrick, L. R.","first_name":"L. R.","last_name":"Patrick"},{"last_name":"Villaseñor","full_name":"Villaseñor, J. I.","first_name":"J. I."},{"last_name":"Abdul-Masih","first_name":"M.","full_name":"Abdul-Masih, M."},{"last_name":"Bowman","first_name":"D. M.","full_name":"Bowman, D. M."},{"first_name":"A.","full_name":"De Koter, A.","last_name":"De Koter"},{"first_name":"S. E.","full_name":"De Mink, S. E.","last_name":"De Mink"},{"full_name":"Deshmukh, K.","first_name":"K.","last_name":"Deshmukh"},{"first_name":"M.","full_name":"Fabry, M.","last_name":"Fabry"},{"first_name":"A.","full_name":"Gilkis, A.","last_name":"Gilkis"},{"full_name":"Götberg, Ylva Louise Linsdotter","first_name":"Ylva Louise Linsdotter","orcid":"0000-0002-6960-6911","last_name":"Götberg","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"last_name":"Holgado","first_name":"G.","full_name":"Holgado, G."},{"full_name":"Izzard, R. G.","first_name":"R. G.","last_name":"Izzard"},{"last_name":"Janssens","full_name":"Janssens, S.","first_name":"S."},{"first_name":"V. M.","full_name":"Kalari, V. M.","last_name":"Kalari"},{"last_name":"Keszthelyi","full_name":"Keszthelyi, Z.","first_name":"Z."},{"full_name":"Kubát, J.","first_name":"J.","last_name":"Kubát"},{"first_name":"I.","full_name":"Mandel, I.","last_name":"Mandel"},{"last_name":"Maravelias","full_name":"Maravelias, G.","first_name":"G."},{"first_name":"L. M.","full_name":"Oskinova, L. M.","last_name":"Oskinova"},{"last_name":"Pauli","full_name":"Pauli, D.","first_name":"D."},{"last_name":"Ramachandran","first_name":"V.","full_name":"Ramachandran, V."},{"first_name":"D. F.","full_name":"Rocha, D. F.","last_name":"Rocha"},{"last_name":"Renzo","full_name":"Renzo, M.","first_name":"M."},{"last_name":"Sander","first_name":"A. A.C.","full_name":"Sander, A. A.C."},{"full_name":"Schneider, F. R.N.","first_name":"F. R.N.","last_name":"Schneider"},{"full_name":"Schootemeijer, A.","first_name":"A.","last_name":"Schootemeijer"},{"last_name":"Sen","first_name":"K.","full_name":"Sen, K."},{"last_name":"Stoop","first_name":"M.","full_name":"Stoop, M."},{"full_name":"Toonen, S.","first_name":"S.","last_name":"Toonen"},{"last_name":"Van Loon","full_name":"Van Loon, J. T.","first_name":"J. T."},{"full_name":"Valli, R.","first_name":"R.","last_name":"Valli"},{"last_name":"Vigna-Gómez","full_name":"Vigna-Gómez, A.","first_name":"A."},{"full_name":"Vink, J. S.","first_name":"J. S.","last_name":"Vink"},{"full_name":"Wang, C.","first_name":"C.","last_name":"Wang"},{"first_name":"X. T.","full_name":"Xu, X. T.","last_name":"Xu"}],"day":"01","article_type":"original","OA_type":"diamond","file":[{"date_created":"2025-06-23T07:54:57Z","access_level":"open_access","file_name":"2025_AstronomyAstrophysics_Bodensteiner.pdf","relation":"main_file","date_updated":"2025-06-23T07:54:57Z","checksum":"51d79c82f6030180fb7c5d7ba01b2da8","file_id":"19866","content_type":"application/pdf","success":1,"file_size":2404827,"creator":"dernst"}],"quality_controlled":"1","supplementarymaterial":"yes","volume":698},{"status":"public","year":"2025","researchdata_availability":"no","intvolume":"       698","type":"journal_article","date_created":"2025-06-15T22:01:29Z","date_published":"2025-06-01T00:00:00Z","oa":1,"fulldoi":"https://doi.org/10.1051/0004-6361/202452949","arxiv":1,"publication_status":"published","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication":"Astronomy & Astrophysics","OA_type":"diamond","article_type":"original","file":[{"access_level":"open_access","date_created":"2025-06-23T07:09:38Z","file_name":"2025_AstronomyAstrophysics_Patrick.pdf","checksum":"93a907bf48da7e2ba7d75b53ea6011f5","relation":"main_file","date_updated":"2025-06-23T07:09:38Z","file_id":"19863","content_type":"application/pdf","success":1,"file_size":2130448,"creator":"dernst"}],"quality_controlled":"1","supplementarymaterial":"no","volume":698,"OA_place":"publisher","das_tickbox":"1","isi":1,"author":[{"full_name":"Patrick, L. R.","first_name":"L. R.","last_name":"Patrick"},{"full_name":"Lennon, D. J.","first_name":"D. J.","last_name":"Lennon"},{"first_name":"F.","full_name":"Najarro, F.","last_name":"Najarro"},{"first_name":"T.","full_name":"Shenar, T.","last_name":"Shenar"},{"first_name":"J.","full_name":"Bodensteiner, J.","last_name":"Bodensteiner"},{"last_name":"Sana","first_name":"H.","full_name":"Sana, H."},{"full_name":"Crowther, P. A.","first_name":"P. A.","last_name":"Crowther"},{"last_name":"Britavskiy","first_name":"N.","full_name":"Britavskiy, N."},{"first_name":"N.","full_name":"Langer, N.","last_name":"Langer"},{"first_name":"A.","full_name":"Schootemeijer, A.","last_name":"Schootemeijer"},{"last_name":"Evans","full_name":"Evans, C. J.","first_name":"C. J."},{"first_name":"L.","full_name":"Mahy, L.","last_name":"Mahy"},{"last_name":"Götberg","orcid":"0000-0002-6960-6911","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d","full_name":"Götberg, Ylva Louise Linsdotter","first_name":"Ylva Louise Linsdotter"},{"full_name":"De Mink, S. E.","first_name":"S. E.","last_name":"De Mink"},{"last_name":"Schneider","first_name":"F. R.N.","full_name":"Schneider, F. R.N."},{"last_name":"O’Grady","full_name":"O’Grady, A. J.G.","first_name":"A. J.G."},{"first_name":"J. I.","full_name":"Villaseñor, J. I.","last_name":"Villaseñor"},{"full_name":"Bernini-Peron, M.","first_name":"M.","last_name":"Bernini-Peron"},{"first_name":"D. M.","full_name":"Bowman, D. M.","last_name":"Bowman"},{"last_name":"De Koter","full_name":"De Koter, A.","first_name":"A."},{"first_name":"K.","full_name":"Deshmukh, K.","last_name":"Deshmukh"},{"last_name":"Gilkis","full_name":"Gilkis, A.","first_name":"A."},{"last_name":"González-Torà","first_name":"G.","full_name":"González-Torà, G."},{"first_name":"V. M.","full_name":"Kalari, V. M.","last_name":"Kalari"},{"full_name":"K̃Eszthelyi, Z.","first_name":"Z.","last_name":"K̃Eszthelyi"},{"last_name":"Mandel","full_name":"Mandel, I.","first_name":"I."},{"last_name":"Menon","first_name":"A.","full_name":"Menon, A."},{"full_name":"Moe, M.","first_name":"M.","last_name":"Moe"},{"full_name":"Oskinova, L. M.","first_name":"L. M.","last_name":"Oskinova"},{"first_name":"D.","full_name":"Pauli, D.","last_name":"Pauli"},{"last_name":"Renzo","full_name":"Renzo, M.","first_name":"M."},{"first_name":"A. A.C.","full_name":"Sander, A. A.C.","last_name":"Sander"},{"full_name":"Sen, K.","first_name":"K.","last_name":"Sen"},{"last_name":"Stoop","full_name":"Stoop, M.","first_name":"M."},{"first_name":"J. T.","full_name":"Van Loon, J. T.","last_name":"Van Loon"},{"full_name":"Toonen, S.","first_name":"S.","last_name":"Toonen"},{"full_name":"Tramper, F.","first_name":"F.","last_name":"Tramper"},{"first_name":"J. S.","full_name":"Vink, J. S.","last_name":"Vink"},{"last_name":"Wang","full_name":"Wang, C.","first_name":"C."}],"day":"01","ddc":["520"],"date_updated":"2026-09-16T09:11:14Z","publisher":"EDP Sciences","_id":"19842","external_id":{"isi":["001497903100028"],"arxiv":["2502.02644"]},"acknowledgement":"We thank Sipra Hota for kindly sharing the SMC UVIT catalogue prior to publication. LRP, FN. and FT acknowledge support by grants PID2019-105552RB-C41 and PID2022-137779OB-C41 funded by MCIN/AEI/10.13039/501100011033 by “ERDF A way of making Europe”. LRP acknowledges support from grant PID2022-140483NB-C22 funded by MCIN/AEI/10.13039/501100011033. TS acknowledges support by the Israel Science Foundation (ISF) under grant number 0603225041. The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement numbers 772225: MULTIPLES). DMB gratefully acknowledges support from UK Research and Innovation (UKRI) in the form of a Frontier Research grant under the UK government’s ERC Horizon Europe funding guarantee (SYMPHONY; grant number: EP/Y031059/1), and a Royal Society University Research Fellowship (grant number: URF\\R1\\231631). GGT is supported by the German Deutsche Forschungsgemeinschaft (DFG) under Project-ID 496854903 (SA4064/2-1, PI Sander). AACS is funded by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) in the form of an Emmy Noether Research Group – Project-ID 445674056 (SA4064/1-1, PI Sander). GGT and AACS further acknowledges support from the Federal Ministry of Education and Research (BMBF) and the Baden-Württemberg Ministry of Science as part of the Excellence Strategy of the German Federal and State Governments. This paper benefited from discussions at the International Space Science Institute (ISSI) in Bern through ISSI International Team project 512 (Multiwavelength View on Massive Stars in the Era of Multimessenger Astronomy). DP acknowledges financial support by the Deutsches Zentrum für Luft und Raumfahrt (DLR) grant FKZ 50OR2005. JIV acknowledges support from the European Research Council for the ERC Advanced Grant 101054731. PAC is supported by the Science and Technology Facilities Council research grant ST/V000853/1 (PI. V. Dhillon). JSV is supported by Science and Technology Facilities Council funding under grant number ST/V000233/1. DFR is thankful for the support of the CAPES-Br and FAPERJ/DSC-10 (SEI-260003/001630/2023). This work has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 945806) and is supported by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy EXC 2181/1-390900948 (the Heidelberg STRUCTURES Excellence Cluster).","title":"Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants","article_processing_charge":"Yes","abstract":[{"text":"Given the uncertain evolutionary status of blue supergiant stars, their multiplicity properties hold vital clues to better understand their origin and evolution. As part of The Binarity at LOw Metallicity (BLOeM) campaign in the Small Magellanic Cloud, we present a multi-epoch spectroscopic survey of 128 supergiant stars of spectral type B5–F5, which roughly correspond to initial masses in the 6–30 M⊙ range. The observed binary fraction for the B5–9 supergiants is 25 ± 6% (10 ± 4%) and 5 ± 2% (0%) for the A–F stars, which were found using a radial-velocity (RV) variability threshold of 5 km s−1 (10 km s−1) as a criterion for binarity. Accounting for observational biases, we find an intrinsic multiplicity fraction of less than 18% for the B5–9 stars and 8−7+9% for the AF stars, for the orbital periods up to 103.5 days and mass ratios (q) in the 0.1 < q < 1 range. The large stellar radii of these supergiant stars prevent short orbital periods, but we demonstrate that this effect alone cannot explain our results. We assessed the spectra and RV time series of the detected binary systems and find that only a small fraction display convincing solutions. We conclude that the multiplicity fractions are compromised by intrinsic stellar variability, such that the true multiplicity fraction may be significantly smaller. Our main conclusions from comparing the multiplicity properties of the B5–9- and AF-type supergiants to that of their less evolved counterparts is that such stars cannot be explained by a direct evolution from the main sequence. Furthermore, by comparing their multiplicity properties to red supergiant stars, we conclude that the AF supergiant stars are neither progenitors nor descendants of red supergiants.","lang":"eng"}],"publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"doi":"10.1051/0004-6361/202452949","file_date_updated":"2025-06-23T07:09:38Z","citation":{"ama":"Patrick LR, Lennon DJ, Najarro F, et al. Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants. <i>Astronomy &#38; Astrophysics</i>. 2025;698. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452949\">10.1051/0004-6361/202452949</a>","short":"L.R. Patrick, D.J. Lennon, F. Najarro, T. Shenar, J. Bodensteiner, H. Sana, P.A. Crowther, N. Britavskiy, N. Langer, A. Schootemeijer, C.J. Evans, L. Mahy, Y.L.L. Götberg, S.E. De Mink, F.R.N. Schneider, A.J.G. O’Grady, J.I. Villaseñor, M. Bernini-Peron, D.M. Bowman, A. De Koter, K. Deshmukh, A. Gilkis, G. González-Torà, V.M. Kalari, Z. K̃Eszthelyi, I. Mandel, A. Menon, M. Moe, L.M. Oskinova, D. Pauli, M. Renzo, A.A.C. Sander, K. Sen, M. Stoop, J.T. Van Loon, S. Toonen, F. Tramper, J.S. Vink, C. Wang, Astronomy &#38; Astrophysics 698 (2025).","chicago":"Patrick, L. R., D. J. Lennon, F. Najarro, T. Shenar, J. Bodensteiner, H. Sana, P. A. Crowther, et al. “Binarity at LOw Metallicity (BLOeM): The Multiplicity Properties and Evolution of BAF-Type Supergiants.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452949\">https://doi.org/10.1051/0004-6361/202452949</a>.","ista":"Patrick LR, Lennon DJ, Najarro F, Shenar T, Bodensteiner J, Sana H, Crowther PA, Britavskiy N, Langer N, Schootemeijer A, Evans CJ, Mahy L, Götberg YLL, De Mink SE, Schneider FRN, O’Grady AJG, Villaseñor JI, Bernini-Peron M, Bowman DM, De Koter A, Deshmukh K, Gilkis A, González-Torà G, Kalari VM, K̃Eszthelyi Z, Mandel I, Menon A, Moe M, Oskinova LM, Pauli D, Renzo M, Sander AAC, Sen K, Stoop M, Van Loon JT, Toonen S, Tramper F, Vink JS, Wang C. 2025. Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants. Astronomy &#38; Astrophysics. 698, A39.","ieee":"L. R. Patrick <i>et al.</i>, “Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants,” <i>Astronomy &#38; Astrophysics</i>, vol. 698. EDP Sciences, 2025.","apa":"Patrick, L. R., Lennon, D. J., Najarro, F., Shenar, T., Bodensteiner, J., Sana, H., … Wang, C. (2025). Binarity at LOw Metallicity (BLOeM): The multiplicity properties and evolution of BAF-type supergiants. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452949\">https://doi.org/10.1051/0004-6361/202452949</a>","mla":"Patrick, L. R., et al. “Binarity at LOw Metallicity (BLOeM): The Multiplicity Properties and Evolution of BAF-Type Supergiants.” <i>Astronomy &#38; Astrophysics</i>, vol. 698, A39, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452949\">10.1051/0004-6361/202452949</a>."},"department":[{"_id":"YlGo"}],"has_accepted_license":"1","article_number":"A39","oa_version":"Published Version","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"month":"06","scopus_import":"1"},{"publisher":"Springer Nature","_id":"20352","date_updated":"2026-09-16T10:03:32Z","acknowledgement":"Based on data collected at the European Southern Observatory (ESO) under programme ID 112.25R7. The research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 and Horizon Europe research and innovation programme (grant agreement numbers 772225: MULTIPLES, 772086: ASSESS and 945806: TEL-STARS, ADG101054731: Stellar-BHs-SDSS-V, and 101164755: METAL). This research was supported by the Israel Science Foundation (ISF) under grant number 0603225041. We acknowledge support from the Science and Technology Facilities Council (research grant ST/V000853/1 and ST/V000233/1), UK Research and Innovation (UKRI) and the UK government’s ERC Horizon Europe funding guarantee (grant number EP/Y031059/1), a Royal Society University Research Fellowship (grant number URF\\R1\\231631), a Royal Society–Science Foundation Ireland University Research Fellowship, the German Deutsche Forschungsgemeinschaft (Project-ID 496854903, 445674056 and 443790621, Germany’s Excellence Strategy EXC 2181/1-390900948), the Klaus Tschira Foundation, the JSPS Kakenhi Grant-in-Aid for Scientific Research (23K19071) and international fellowships (at the Graduate school of Science, Tokyo University), the Australian Research Council (ARC) Centre of Excellence for Gravitational Wave Discovery (OzGrav; project number CE230100016), the Deutsches Zentrum für Luft und Raumfahrt (DLR) grants FKZ 50OR2005 and 50OR2306, Agencia Española de Investigación (AEI) of the Spanish Ministerio de Ciencia Innovación y Universidades (MICIU) and the European Regional Development Fund, FEDER and Severo Ochoa Programme (grants PID2021-122397NB-C21 and CEX2019-000920-S), the NextGeneration EU/PRTR and MIU (UNI/551/2021) trough grant Margarita Salas-UL, the CAPES-Br and FAPERJ/DSC-10 (SEI-260003/001630/2023), MCIN/AEI/10.13039/501100011033 by ‘ERDF A way of making Europe’ (grants PID2019-105552RB-C41 and PID2022-137779OB-C41, PID2021-125485NB-C22, CEX2019-000918-M) funded by MCIN/AEI/10.13039/501100011033 (State Agency for Research of the Spanish Ministry of Science and Innovation) and SGR-2021-01069 (AGAUR), the Spanish Government Ministerio de Ciencia e Innovación and Agencia Estatal de Investigación (10.13 039/501 100 011 033; grant PID2022-136 640 NB-C22), the Consejo Superior de Investigaciones Científicas (CSIC; grant 2022-AEP 005), the Polish National Agency for Academic Exchange (BEKKER fellowship BPN/BEK/2022/1/00106) and National Science Center (NCN, Poland; grant number OPUS 2021/41/B/ST9/00757), the ‘La Caixa’ Foundation (ID 100010434) under the fellowship code LCF/BQ/PI23/11970035, the Research foundation Flanders (FWO) PhD fellowship under project 11E1721N and senior postdoctoral fellowship under number 12ZY523N, and the Netherlands Research Council NWO (VIDI 203.061 grant).","external_id":{"isi":["001568077900001"],"arxiv":["2509.12488"]},"title":"A high fraction of close massive binary stars at low metallicity","article_processing_charge":"No","doi":"10.1038/s41550-025-02610-x","citation":{"ista":"Sana H, Shenar T, Bodensteiner J, Britavskiy N, Langer N, Lennon DJ, Mahy L, Mandel I, De Mink SE, Patrick LR, Villaseñor JI, Dirickx M, Abdul-Masih M, Almeida LA, Backs F, Berlanas SR, Bernini-Peron M, Bowman DM, Bronner VA, Crowther PA, Deshmukh K, Evans CJ, Fabry M, Gieles M, Gilkis A, González-Torà G, Gräfener G, Götberg YLL, Hawcroft C, Hénault-Brunet V, Herrero A, Holgado G, Izzard RG, De Koter A, Janssens S, Johnston C, Josiek J, Justham S, Kalari VM, Klencki J, Kubát J, Kubátová B, Lefever RR, Van Loon JT, Ludwig B, Mackey J, Maíz Apellániz J, Maravelias G, Marchant P, Mazeh T, Menon A, Moe M, Najarro F, Oskinova LM, Ovadia R, Pauli D, Pawlak M, Ramachandran V, Renzo M, Rocha DF, Sander AAC, Schneider FRN, Schootemeijer A, Schösser EC, Schürmann C, Sen K, Shahaf S, Simón-Díaz S, Van Son LAC, Stoop M, Toonen S, Tramper F, Valli R, Vigna-Gómez A, Vink JS, Wang C, Willcox R. 2025. A high fraction of close massive binary stars at low metallicity. Nature Astronomy. 9, 1337–1346.","ieee":"H. Sana <i>et al.</i>, “A high fraction of close massive binary stars at low metallicity,” <i>Nature Astronomy</i>, vol. 9. Springer Nature, pp. 1337–1346, 2025.","ama":"Sana H, Shenar T, Bodensteiner J, et al. A high fraction of close massive binary stars at low metallicity. <i>Nature Astronomy</i>. 2025;9:1337-1346. doi:<a href=\"https://doi.org/10.1038/s41550-025-02610-x\">10.1038/s41550-025-02610-x</a>","short":"H. Sana, T. Shenar, J. Bodensteiner, N. Britavskiy, N. Langer, D.J. Lennon, L. Mahy, I. Mandel, S.E. De Mink, L.R. Patrick, J.I. Villaseñor, M. Dirickx, M. Abdul-Masih, L.A. Almeida, F. Backs, S.R. Berlanas, M. Bernini-Peron, D.M. Bowman, V.A. Bronner, P.A. Crowther, K. Deshmukh, C.J. Evans, M. Fabry, M. Gieles, A. Gilkis, G. González-Torà, G. Gräfener, Y.L.L. Götberg, C. Hawcroft, V. Hénault-Brunet, A. Herrero, G. Holgado, R.G. Izzard, A. De Koter, S. Janssens, C. Johnston, J. Josiek, S. Justham, V.M. Kalari, J. Klencki, J. Kubát, B. Kubátová, R.R. Lefever, J.T. Van Loon, B. Ludwig, J. Mackey, J. Maíz Apellániz, G. Maravelias, P. Marchant, T. Mazeh, A. Menon, M. Moe, F. Najarro, L.M. Oskinova, R. Ovadia, D. Pauli, M. Pawlak, V. Ramachandran, M. Renzo, D.F. Rocha, A.A.C. Sander, F.R.N. Schneider, A. Schootemeijer, E.C. Schösser, C. Schürmann, K. Sen, S. Shahaf, S. Simón-Díaz, L.A.C. Van Son, M. Stoop, S. Toonen, F. Tramper, R. Valli, A. Vigna-Gómez, J.S. Vink, C. Wang, R. Willcox, Nature Astronomy 9 (2025) 1337–1346.","chicago":"Sana, H., T. Shenar, J. Bodensteiner, N. Britavskiy, N. Langer, D. J. Lennon, L. Mahy, et al. “A High Fraction of Close Massive Binary Stars at Low Metallicity.” <i>Nature Astronomy</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41550-025-02610-x\">https://doi.org/10.1038/s41550-025-02610-x</a>.","apa":"Sana, H., Shenar, T., Bodensteiner, J., Britavskiy, N., Langer, N., Lennon, D. J., … Willcox, R. (2025). A high fraction of close massive binary stars at low metallicity. <i>Nature Astronomy</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41550-025-02610-x\">https://doi.org/10.1038/s41550-025-02610-x</a>","mla":"Sana, H., et al. “A High Fraction of Close Massive Binary Stars at Low Metallicity.” <i>Nature Astronomy</i>, vol. 9, Springer Nature, 2025, pp. 1337–46, doi:<a href=\"https://doi.org/10.1038/s41550-025-02610-x\">10.1038/s41550-025-02610-x</a>."},"abstract":[{"lang":"eng","text":"At high metallicity, a majority of massive stars have at least one close stellar companion. The evolution of such binaries is subject to strong interaction processes, which heavily impact the characteristics of their life-ending supernova and compact remnants. For the low-metallicity environments of high-redshift galaxies, constraints on the multiplicity properties of massive stars over the separation range leading to binary interaction are crucially missing. Here we show that the presence of massive stars in close binaries is ubiquitous, even at low metallicity. Using the Very Large Telescope, we obtained multi-epoch radial velocity measurements of a representative sample of 139 massive O-type stars across the Small Magellanic Cloud, which has a metal content of about one-fifth of the solar value. We find that 45% of them show radial velocity variations that demonstrate that they are members of close binary systems, and predominantly have orbital periods shorter than 1 year. Correcting for observational biases indicates that at least 70+11−6 %  of the O stars in our sample are in close binaries, and that at least 68+7\r\n−8% of all O stars interact with a companion star during their lifetime. We found no evidence supporting a statistically significant trend of the multiplicity properties with metallicity. Our results indicate that multiplicity and binary interactions govern the evolution of massive stars and determine their cosmic feedback and explosive fates."}],"publication_identifier":{"eissn":["2397-3366"]},"department":[{"_id":"YlGo"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2509.12488"}],"oa_version":"Preprint","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"09","language":[{"iso":"eng"}],"scopus_import":"1","intvolume":"         9","year":"2025","status":"public","researchdata_availability":"no","type":"journal_article","date_created":"2025-09-14T22:01:32Z","oa":1,"date_published":"2025-09-02T00:00:00Z","publication_status":"published","arxiv":1,"fulldoi":"https://doi.org/10.1038/s41550-025-02610-x","publication":"Nature Astronomy","article_type":"original","OA_type":"green","quality_controlled":"1","volume":9,"supplementarymaterial":"no","OA_place":"repository","das_tickbox":"1","page":"1337-1346","author":[{"last_name":"Sana","full_name":"Sana, H.","first_name":"H."},{"full_name":"Shenar, T.","first_name":"T.","last_name":"Shenar"},{"first_name":"J.","full_name":"Bodensteiner, J.","last_name":"Bodensteiner"},{"last_name":"Britavskiy","first_name":"N.","full_name":"Britavskiy, N."},{"first_name":"N.","full_name":"Langer, N.","last_name":"Langer"},{"last_name":"Lennon","first_name":"D. J.","full_name":"Lennon, D. J."},{"first_name":"L.","full_name":"Mahy, L.","last_name":"Mahy"},{"last_name":"Mandel","first_name":"I.","full_name":"Mandel, I."},{"full_name":"De Mink, S. E.","first_name":"S. E.","last_name":"De Mink"},{"first_name":"L. R.","full_name":"Patrick, L. R.","last_name":"Patrick"},{"first_name":"J. I.","full_name":"Villaseñor, J. I.","last_name":"Villaseñor"},{"full_name":"Dirickx, M.","first_name":"M.","last_name":"Dirickx"},{"first_name":"M.","full_name":"Abdul-Masih, M.","last_name":"Abdul-Masih"},{"full_name":"Almeida, L. A.","first_name":"L. A.","last_name":"Almeida"},{"last_name":"Backs","full_name":"Backs, F.","first_name":"F."},{"last_name":"Berlanas","full_name":"Berlanas, S. R.","first_name":"S. R."},{"first_name":"M.","full_name":"Bernini-Peron, M.","last_name":"Bernini-Peron"},{"last_name":"Bowman","full_name":"Bowman, D. M.","first_name":"D. M."},{"last_name":"Bronner","full_name":"Bronner, V. A.","first_name":"V. A."},{"first_name":"P. A.","full_name":"Crowther, P. A.","last_name":"Crowther"},{"full_name":"Deshmukh, K.","first_name":"K.","last_name":"Deshmukh"},{"last_name":"Evans","full_name":"Evans, C. J.","first_name":"C. J."},{"full_name":"Fabry, M.","first_name":"M.","last_name":"Fabry"},{"full_name":"Gieles, M.","first_name":"M.","last_name":"Gieles"},{"last_name":"Gilkis","first_name":"A.","full_name":"Gilkis, A."},{"last_name":"González-Torà","first_name":"G.","full_name":"González-Torà, G."},{"full_name":"Gräfener, G.","first_name":"G.","last_name":"Gräfener"},{"full_name":"Götberg, Ylva Louise Linsdotter","first_name":"Ylva Louise Linsdotter","last_name":"Götberg","orcid":"0000-0002-6960-6911","id":"d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d"},{"last_name":"Hawcroft","full_name":"Hawcroft, C.","first_name":"C."},{"last_name":"Hénault-Brunet","full_name":"Hénault-Brunet, V.","first_name":"V."},{"last_name":"Herrero","full_name":"Herrero, A.","first_name":"A."},{"last_name":"Holgado","first_name":"G.","full_name":"Holgado, G."},{"last_name":"Izzard","full_name":"Izzard, R. G.","first_name":"R. G."},{"first_name":"A.","full_name":"De Koter, A.","last_name":"De Koter"},{"last_name":"Janssens","first_name":"S.","full_name":"Janssens, S."},{"full_name":"Johnston, C.","first_name":"C.","last_name":"Johnston"},{"last_name":"Josiek","first_name":"J.","full_name":"Josiek, J."},{"last_name":"Justham","first_name":"S.","full_name":"Justham, S."},{"full_name":"Kalari, V. M.","first_name":"V. M.","last_name":"Kalari"},{"first_name":"J.","full_name":"Klencki, J.","last_name":"Klencki"},{"last_name":"Kubát","first_name":"J.","full_name":"Kubát, J."},{"full_name":"Kubátová, B.","first_name":"B.","last_name":"Kubátová"},{"first_name":"R. R.","full_name":"Lefever, R. R.","last_name":"Lefever"},{"last_name":"Van Loon","full_name":"Van Loon, J. Th","first_name":"J. Th"},{"full_name":"Ludwig, B.","first_name":"B.","last_name":"Ludwig"},{"full_name":"Mackey, J.","first_name":"J.","last_name":"Mackey"},{"last_name":"Maíz Apellániz","first_name":"J.","full_name":"Maíz Apellániz, J."},{"last_name":"Maravelias","first_name":"G.","full_name":"Maravelias, G."},{"first_name":"P.","full_name":"Marchant, P.","last_name":"Marchant"},{"last_name":"Mazeh","first_name":"T.","full_name":"Mazeh, T."},{"last_name":"Menon","first_name":"A.","full_name":"Menon, A."},{"first_name":"M.","full_name":"Moe, M.","last_name":"Moe"},{"last_name":"Najarro","first_name":"F.","full_name":"Najarro, F."},{"first_name":"L. M.","full_name":"Oskinova, L. M.","last_name":"Oskinova"},{"first_name":"R.","full_name":"Ovadia, R.","last_name":"Ovadia"},{"full_name":"Pauli, D.","first_name":"D.","last_name":"Pauli"},{"last_name":"Pawlak","first_name":"M.","full_name":"Pawlak, M."},{"last_name":"Ramachandran","first_name":"V.","full_name":"Ramachandran, V."},{"full_name":"Renzo, M.","first_name":"M.","last_name":"Renzo"},{"first_name":"D. F.","full_name":"Rocha, D. F.","last_name":"Rocha"},{"last_name":"Sander","full_name":"Sander, A. A.C.","first_name":"A. A.C."},{"last_name":"Schneider","full_name":"Schneider, F. R.N.","first_name":"F. R.N."},{"last_name":"Schootemeijer","first_name":"A.","full_name":"Schootemeijer, A."},{"full_name":"Schösser, E. C.","first_name":"E. C.","last_name":"Schösser"},{"full_name":"Schürmann, C.","first_name":"C.","last_name":"Schürmann"},{"last_name":"Sen","full_name":"Sen, K.","first_name":"K."},{"full_name":"Shahaf, S.","first_name":"S.","last_name":"Shahaf"},{"full_name":"Simón-Díaz, S.","first_name":"S.","last_name":"Simón-Díaz"},{"last_name":"Van Son","full_name":"Van Son, L. A.C.","first_name":"L. A.C."},{"last_name":"Stoop","full_name":"Stoop, M.","first_name":"M."},{"first_name":"S.","full_name":"Toonen, S.","last_name":"Toonen"},{"full_name":"Tramper, F.","first_name":"F.","last_name":"Tramper"},{"full_name":"Valli, R.","first_name":"R.","last_name":"Valli"},{"last_name":"Vigna-Gómez","first_name":"A.","full_name":"Vigna-Gómez, A."},{"full_name":"Vink, J. S.","first_name":"J. S.","last_name":"Vink"},{"full_name":"Wang, C.","first_name":"C.","last_name":"Wang"},{"last_name":"Willcox","full_name":"Willcox, R.","first_name":"R."}],"isi":1,"day":"02"}]