[{"oa_version":"Preprint","citation":{"ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","ama":"Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. 2025;129. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>","apa":"Pach, J., Saghafian, M., &#38; Schnider, P. (2025). Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>","chicago":"Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>.","mla":"Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>, vol. 129, 102186, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>.","short":"J. Pach, M. Saghafian, P. Schnider, Computational Geometry 129 (2025).","ista":"Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186."},"article_number":"102186","abstract":[{"text":"We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n - 1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2306.13201"}],"publisher":"Elsevier","OA_type":"green","related_material":{"record":[{"relation":"earlier_version","id":"15012","status":"public"}]},"status":"public","publication_identifier":{"issn":["0925-7721"]},"type":"journal_article","volume":129,"acknowledgement":"A preliminary version of this note has been published in the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, Palermo, 2023. The authors would like to thank the anonymous referees for their valuable comments.","arxiv":1,"article_processing_charge":"No","date_published":"2025-12-01T00:00:00Z","title":"Decomposition of geometric graphs into star-forests","date_updated":"2026-04-16T09:12:36Z","quality_controlled":"1","external_id":{"arxiv":["2306.13201"]},"month":"12","department":[{"_id":"HeEd"}],"_id":"21253","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","publication":"Computational Geometry","corr_author":"1","OA_place":"repository","year":"2025","article_type":"original","date_created":"2026-02-16T15:48:42Z","author":[{"full_name":"Pach, János","first_name":"János","last_name":"Pach"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","full_name":"Saghafian, Morteza","first_name":"Morteza","last_name":"Saghafian"},{"full_name":"Schnider, Patrick","first_name":"Patrick","last_name":"Schnider"}],"language":[{"iso":"eng"}],"intvolume":"       129","doi":"10.1016/j.comgeo.2025.102186","publication_status":"published","oa":1},{"publisher":"Elsevier","page":"299-322","oa_version":"None","citation":{"ieee":"L. Qi and J. Friml, “Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling,” in <i>Cryptic Enzymes and Moonlighting Proteins</i>, H. Irving, C. Gehring, and A. Wong, Eds. Elsevier, 2025, pp. 299–322.","ama":"Qi L, Friml J. Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling. In: Irving H, Gehring C, Wong A, eds. <i>Cryptic Enzymes and Moonlighting Proteins</i>. Elsevier; 2025:299-322. doi:<a href=\"https://doi.org/10.1016/b978-0-443-15719-6.00015-5\">10.1016/b978-0-443-15719-6.00015-5</a>","apa":"Qi, L., &#38; Friml, J. (2025). Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling. In H. Irving, C. Gehring, &#38; A. Wong (Eds.), <i>Cryptic Enzymes and Moonlighting Proteins</i> (pp. 299–322). Elsevier. <a href=\"https://doi.org/10.1016/b978-0-443-15719-6.00015-5\">https://doi.org/10.1016/b978-0-443-15719-6.00015-5</a>","chicago":"Qi, Linlin, and Jiří Friml. “Nucleotidyl Cyclase Activities of TIR1/AFB Auxin Receptors: New Insights into the Mechanism of Auxin Signaling.” In <i>Cryptic Enzymes and Moonlighting Proteins</i>, edited by Helen Irving, Chris Gehring, and Aloysius Wong, 299–322. Elsevier, 2025. <a href=\"https://doi.org/10.1016/b978-0-443-15719-6.00015-5\">https://doi.org/10.1016/b978-0-443-15719-6.00015-5</a>.","mla":"Qi, Linlin, and Jiří Friml. “Nucleotidyl Cyclase Activities of TIR1/AFB Auxin Receptors: New Insights into the Mechanism of Auxin Signaling.” <i>Cryptic Enzymes and Moonlighting Proteins</i>, edited by Helen Irving et al., Elsevier, 2025, pp. 299–322, doi:<a href=\"https://doi.org/10.1016/b978-0-443-15719-6.00015-5\">10.1016/b978-0-443-15719-6.00015-5</a>.","ista":"Qi L, Friml J. 2025.Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling. In: Cryptic Enzymes and Moonlighting Proteins. Foundations and Frontiers in Enzymology, , 299–322.","short":"L. Qi, J. Friml, in:, H. Irving, C. Gehring, A. Wong (Eds.), Cryptic Enzymes and Moonlighting Proteins, Elsevier, 2025, pp. 299–322."},"scopus_import":"1","abstract":[{"text":"As an important plant hormone to regulate growth and development, auxin has been investigated for more than a century. It had been clearly demonstrated and well-accepted that the intracellular auxin receptors, TIR1/AFBs, are F-box proteins mediating transcriptional auxin signaling by their E3 ubiquitin ligase activity, which targets and sends for degradation the Aux/IAA transcriptional repressors. The recent discovery of adenylate cyclase (AC) and guanylate cyclase (GC) activities for TIR1/AFBs open entirely new perspectives on how auxin signaling can operate. This chapter traces back the history of how canonical transcriptional auxin signaling was established and introduces the discovery of the TIR1/AFBs-mediated nontranscriptional signaling branch. Finally, the current understanding and open questions of how TIR1/AFBs’ AC and GC activities contribute to the transcriptional and nontranscriptional auxin signaling are discussed, highlighting the possibility that cyclic adenosine monophosphate (cAMP) and cyclic guanosine monophosphate (cGMP) act as second messengers in auxin signal transduction.","lang":"eng"}],"department":[{"_id":"JiFr"}],"_id":"21255","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Cryptic Enzymes and Moonlighting Proteins","status":"public","publication_identifier":{"isbn":["9780443157196"]},"type":"book_chapter","day":"02","OA_type":"closed access","article_processing_charge":"No","alternative_title":["Foundations and Frontiers in Enzymology"],"date_published":"2025-05-02T00:00:00Z","date_created":"2026-02-16T15:53:52Z","title":"Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling","editor":[{"first_name":"Helen","last_name":"Irving","full_name":"Irving, Helen"},{"full_name":"Gehring, Chris","first_name":"Chris","last_name":"Gehring"},{"last_name":"Wong","first_name":"Aloysius","full_name":"Wong, Aloysius"}],"year":"2025","doi":"10.1016/b978-0-443-15719-6.00015-5","month":"05","publication_status":"published","quality_controlled":"1","author":[{"last_name":"Qi","first_name":"Linlin","full_name":"Qi, Linlin"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-02-17T13:28:38Z","language":[{"iso":"eng"}]},{"file_date_updated":"2026-02-17T13:36:01Z","language":[{"iso":"eng"}],"ddc":["570"],"author":[{"last_name":"Meadowcroft","first_name":"Billie","orcid":"0000-0003-3441-1337","id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","full_name":"Meadowcroft, Billie"},{"id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b","full_name":"Sorichetti, Valerio","last_name":"Sorichetti","first_name":"Valerio","orcid":"0000-0002-9645-6576"},{"full_name":"Ratajczyk, Eryk","last_name":"Ratajczyk","first_name":"Eryk"},{"first_name":"Fernanda L","last_name":"Perez Verdugo","id":"4ecec223-9070-11ef-a0a9-bc76077bea8d","full_name":"Perez Verdugo, Fernanda L"},{"first_name":"Nargess","last_name":"Khalilgharibi","full_name":"Khalilgharibi, Nargess"},{"full_name":"Mao, Yanlan","first_name":"Yanlan","last_name":"Mao"},{"id":"9c805cd2-4b75-11ec-a374-db6dd0ed57fa","full_name":"Palaia, Ivan","last_name":"Palaia","first_name":"Ivan","orcid":" 0000-0002-8843-9485 "},{"last_name":"Šarić","first_name":"Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","full_name":"Šarić, Anđela"}],"publication_status":"published","oa":1,"doi":"10.1103/gdd5-rnh7","project":[{"_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","grant_number":"802960","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","call_identifier":"H2020"},{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"349b6ff1-11ca-11ed-8bc3-f006047c2eeb","name":"EMBO Young Investigator Program - Andela Saric"}],"file":[{"date_updated":"2026-02-17T13:36:01Z","content_type":"application/pdf","relation":"main_file","file_size":2277704,"access_level":"open_access","file_name":"2025_PRXLife_Meadowcroft.pdf","creator":"dernst","checksum":"04cae5231d97e533145c493880fadbd9","file_id":"21308","success":1,"date_created":"2026-02-17T13:36:01Z"}],"intvolume":"         3","year":"2025","DOAJ_listed":"1","date_created":"2026-02-16T15:55:03Z","article_type":"original","day":"05","OA_place":"publisher","corr_author":"1","publication":"PRX Life","_id":"21256","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"department":[{"_id":"AnSa"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","quality_controlled":"1","date_updated":"2026-02-17T13:37:38Z","month":"09","volume":3,"PlanS_conform":"1","title":"Nonequilibrium remodeling of collagen IV networks in Silico","date_published":"2025-09-05T00:00:00Z","article_processing_charge":"Yes","acknowledgement":"This work received funding from the European Research Council under the European Union's Horizon 2020 research and innovation program through Grant Agreement No. 802960 (B.M., V.S., I.P., and A.Š.), the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 101034413 (I.P.), the NOMIS Foundation (F.P.-V.), the National Centre for the Replacement, Refinement and Reduction of Animals in Research Grant No. NC/T002425/1 (N.K.), Leverhulme Trust project Grant No. RPG-2020-068 (N.K.), MRC Fellowship No. MR/W027437/1 (Y.M.), a Lister Institute Research Prize (Y.M.) and EMBO Young Investigator Programme (Y.M. and A.Š.).","OA_type":"gold","type":"journal_article","publication_identifier":{"eissn":["2835-8279"]},"status":"public","citation":{"ieee":"B. Meadowcroft <i>et al.</i>, “Nonequilibrium remodeling of collagen IV networks in Silico,” <i>PRX Life</i>, vol. 3. American Physical Society, 2025.","ama":"Meadowcroft B, Sorichetti V, Ratajczyk E, et al. Nonequilibrium remodeling of collagen IV networks in Silico. <i>PRX Life</i>. 2025;3. doi:<a href=\"https://doi.org/10.1103/gdd5-rnh7\">10.1103/gdd5-rnh7</a>","apa":"Meadowcroft, B., Sorichetti, V., Ratajczyk, E., Perez Verdugo, F. L., Khalilgharibi, N., Mao, Y., … Šarić, A. (2025). Nonequilibrium remodeling of collagen IV networks in Silico. <i>PRX Life</i>. American Physical Society. <a href=\"https://doi.org/10.1103/gdd5-rnh7\">https://doi.org/10.1103/gdd5-rnh7</a>","chicago":"Meadowcroft, Billie, Valerio Sorichetti, Eryk Ratajczyk, Fernanda L Perez Verdugo, Nargess Khalilgharibi, Yanlan Mao, Ivan Palaia, and Anđela Šarić. “Nonequilibrium Remodeling of Collagen IV Networks in Silico.” <i>PRX Life</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/gdd5-rnh7\">https://doi.org/10.1103/gdd5-rnh7</a>.","mla":"Meadowcroft, Billie, et al. “Nonequilibrium Remodeling of Collagen IV Networks in Silico.” <i>PRX Life</i>, vol. 3, 033019, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/gdd5-rnh7\">10.1103/gdd5-rnh7</a>.","short":"B. Meadowcroft, V. Sorichetti, E. Ratajczyk, F.L. Perez Verdugo, N. Khalilgharibi, Y. Mao, I. Palaia, A. Šarić, PRX Life 3 (2025).","ista":"Meadowcroft B, Sorichetti V, Ratajczyk E, Perez Verdugo FL, Khalilgharibi N, Mao Y, Palaia I, Šarić A. 2025. Nonequilibrium remodeling of collagen IV networks in Silico. PRX Life. 3, 033019."},"article_number":"033019","abstract":[{"text":"Collagen IV is one of the main components of the basement membrane, a layer of material that lines the majority of tissues in multicellular organisms. Collagen IV molecules assemble into networks, providing stiffness and elasticity to tissues and informing cell and organ shape, especially during development. In this work, we develop two coarse-grained models for collagen IV molecules that retain biochemical bond specificity and coarse grain at different length scales. Through molecular-dynamics simulations, we test the assembly and mechanics of the resulting networks and measure their response to strain in terms of stress, microscopic alignment, and bond dynamics. Within the basement membrane, collagen IV networks rearrange by molecule turnover, which affects tissue organization and can be linked with enzyme activity. Here we explore network rearrangements via bond remodeling, the process of breaking and remaking of bonds between network molecules. We then investigate the effects of active (enzymatic) bond remodeling. We find that this nonequilibrium remodeling allows a network to keep its integrity under strain, while relaxing fully over a variety of timescales, a dynamic response that is unavailable to networks undergoing equilibrium remodeling.","lang":"eng"}],"oa_version":"Published Version","publisher":"American Physical Society"},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.06927"}],"publisher":"Springer Nature","abstract":[{"text":"We investigate the problem of accurate sparse fine-tuning of large language models (LLMs), that is, fine-tuning pre-trained LLMs on specialized tasks, while inducing sparsity in their weights. Our work is motivated by experiments showing that standard loss-based fine-tuning methods are not able to achieve high accuracy in this setting, especially at high sparsity targets. To address this issue, we perform a detailed study of knowledge distillation losses for fine-tuning of sparse models. We determine an L2-based distillation approach that we term ‘SquareHead’, which enables accurate recovery even at higher sparsities. Investigating the question of efficient inference, we show that sparse LLMs can be executed faster by taking advantage of sparsity. Specifically, we exhibit end-to-end results showing speedups enabled by sparsity, while recovering accuracy, on the following models and tasks, respectively: T5 for language translation, Whisper for speech translation, and open GPT-type models such as the Mosaic Pre-Trained Transformer (MPT) and Llama-2 models for text generation. In particular, for popular generative tasks, we show for the first time that sparse fine-tuning can reach 75% sparsity without drops in accuracy, and provide notable end-to-end speedups for inference on CPUs. Moreover, we also highlight that sparsity is compatible with other compression approaches, such as quantization.","lang":"eng"}],"citation":{"mla":"Kurtic, Eldar, et al. “Sparse Fine-Tuning for Inference Acceleration of Large Language Models.” <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>, edited by Peyman Passban et al., Springer Nature, 2025, pp. 83–97, doi:<a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">10.1007/978-3-031-85747-8_6</a>.","short":"E. Kurtic, D. Kuznedelev, E. Frantar, M. Goinv, S. Pandit, A. Agarwalla, T. Nguyen, A. Marques, M. Kurtz, D.-A. Alistarh, in:, P. Passban, A. Way, M. Rezagholizadeh (Eds.), Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques, Springer Nature, 2025, pp. 83–97.","ista":"Kurtic E, Kuznedelev D, Frantar E, Goinv M, Pandit S, Agarwalla A, Nguyen T, Marques A, Kurtz M, Alistarh D-A. 2025.Sparse Fine-Tuning for Inference Acceleration of Large Language Models. In: Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques. Machine Translation: Technologies and Applications, , 83–97.","apa":"Kurtic, E., Kuznedelev, D., Frantar, E., Goinv, M., Pandit, S., Agarwalla, A., … Alistarh, D.-A. (2025). Sparse Fine-Tuning for Inference Acceleration of Large Language Models. In P. Passban, A. Way, &#38; M. Rezagholizadeh (Eds.), <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i> (pp. 83–97). Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">https://doi.org/10.1007/978-3-031-85747-8_6</a>","chicago":"Kurtic, Eldar, Denis Kuznedelev, Elias Frantar, Michael Goinv, Shubhra Pandit, Abhinav Agarwalla, Tuan Nguyen, Alexandre Marques, Mark Kurtz, and Dan-Adrian Alistarh. “Sparse Fine-Tuning for Inference Acceleration of Large Language Models.” In <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>, edited by Peyman Passban, Andy Way, and Mehdi Rezagholizadeh, 83–97. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">https://doi.org/10.1007/978-3-031-85747-8_6</a>.","ama":"Kurtic E, Kuznedelev D, Frantar E, et al. Sparse Fine-Tuning for Inference Acceleration of Large Language Models. In: Passban P, Way A, Rezagholizadeh M, eds. <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>. Springer Nature; 2025:83-97. doi:<a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">10.1007/978-3-031-85747-8_6</a>","ieee":"E. Kurtic <i>et al.</i>, “Sparse Fine-Tuning for Inference Acceleration of Large Language Models,” in <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>, P. Passban, A. Way, and M. Rezagholizadeh, Eds. Springer Nature, 2025, pp. 83–97."},"oa_version":"Preprint","status":"public","type":"book_chapter","publication_identifier":{"isbn":["9783031857461"],"eissn":["2522-803X"],"eisbn":["9783031857478"],"issn":["2522-8021"]},"OA_type":"green","date_published":"2025-07-05T00:00:00Z","article_processing_charge":"No","arxiv":1,"acknowledgement":"We would like to thank Eugenia Iofinova for useful comments on an earlier version of this draft, and Artur Niederfahrenhorst for useful suggestions regarding fine-tuning on the GSM8k dataset.","editor":[{"full_name":"Passban, Peyman","last_name":"Passban","first_name":"Peyman"},{"last_name":"Way","first_name":"Andy","full_name":"Way, Andy"},{"full_name":"Rezagholizadeh, Mehdi","last_name":"Rezagholizadeh","first_name":"Mehdi"}],"title":"Sparse Fine-Tuning for Inference Acceleration of Large Language Models","month":"07","quality_controlled":"1","date_updated":"2026-02-19T09:26:54Z","external_id":{"arxiv":["2310.06927"]},"page":"83-97","_id":"21257","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publication":"Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques","OA_place":"repository","corr_author":"1","day":"05","alternative_title":["Machine Translation: Technologies and Applications"],"date_created":"2026-02-16T15:57:53Z","year":"2025","oa":1,"publication_status":"published","doi":"10.1007/978-3-031-85747-8_6","language":[{"iso":"eng"}],"author":[{"full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","last_name":"Kurtic"},{"last_name":"Kuznedelev","first_name":"Denis","full_name":"Kuznedelev, Denis"},{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias","last_name":"Frantar","first_name":"Elias"},{"full_name":"Goinv, Michael","first_name":"Michael","last_name":"Goinv"},{"last_name":"Pandit","first_name":"Shubhra","full_name":"Pandit, Shubhra"},{"first_name":"Abhinav","last_name":"Agarwalla","full_name":"Agarwalla, Abhinav"},{"first_name":"Tuan","last_name":"Nguyen","full_name":"Nguyen, Tuan"},{"full_name":"Marques, Alexandre","first_name":"Alexandre","last_name":"Marques"},{"first_name":"Mark","last_name":"Kurtz","full_name":"Kurtz, Mark"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}]},{"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1035"}],"publisher":"Springer Nature","oa_version":"Preprint","abstract":[{"lang":"eng","text":"Continuous Group Key Agreement (CGKA) is the primitive underlying secure group messaging. It allows a large group of N users to maintain a shared secret key that is frequently rotated by the\r\ngroup members in order to achieve forward secrecy and post compromise security. The group messaging scheme Messaging Layer Security (MLS) standardized by the IETF makes use of a CGKA called TreeKEM which arranges the N group members in a binary tree. Here, each node is associated with a public-key, each user is assigned one of the leaves, and a user knows the corresponding secret keys from their leaf to the root. To update the key material known to them, a user must just replace keys at log(N) nodes, which requires them to create and upload log(N) ciphertexts. Such updates must be processed sequentially by all users, which for large groups is impractical. To allow for concurrent updates, TreeKEM uses the “propose and commit” paradigm, where multiple users can concurrently propose to update (by just sampling a fresh leaf key), and a single user can then commit to all proposals at once. Unfortunately, this process destroys the binary tree structure as the tree gets pruned and some nodes must be “blanked” at the cost of increasing the in-degree of others, which makes the commit operation, as well as, future commits more costly. In the worst case, the update cost (in terms of uploaded ciphertexts) per user can grow from log(N) to Ω(N). In this work we provide two main contributions. First, we show that MLS’ communication complexity is bad not only in the worst case but also if the proposers and committers are chosen at random: even if there’s just one update proposal for every commit the expected cost is already over √N, and it approaches N as this ratio changes towards more proposals. Our second contribution is a new variant of propose and commit for\r\nTreeKEM which for moderate amounts of update proposals per commit provably achieves an update cost of Θ(log(N)) assuming the proposers and committers are chosen at random."}],"citation":{"ieee":"B. Auerbach, M. Cueto Noval, B. Erol, and K. Z. Pietrzak, “Continuous group-key agreement: Concurrent updates without pruning,” in <i>45th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2025, vol. 16007, pp. 141–172.","ama":"Auerbach B, Cueto Noval M, Erol B, Pietrzak KZ. Continuous group-key agreement: Concurrent updates without pruning. In: <i>45th Annual International Cryptology Conference</i>. Vol 16007. Springer Nature; 2025:141-172. doi:<a href=\"https://doi.org/10.1007/978-3-032-01913-4_5\">10.1007/978-3-032-01913-4_5</a>","apa":"Auerbach, B., Cueto Noval, M., Erol, B., &#38; Pietrzak, K. Z. (2025). Continuous group-key agreement: Concurrent updates without pruning. In <i>45th Annual International Cryptology Conference</i> (Vol. 16007, pp. 141–172). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-01913-4_5\">https://doi.org/10.1007/978-3-032-01913-4_5</a>","chicago":"Auerbach, Benedikt, Miguel Cueto Noval, Boran Erol, and Krzysztof Z Pietrzak. “Continuous Group-Key Agreement: Concurrent Updates without Pruning.” In <i>45th Annual International Cryptology Conference</i>, 16007:141–72. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01913-4_5\">https://doi.org/10.1007/978-3-032-01913-4_5</a>.","mla":"Auerbach, Benedikt, et al. “Continuous Group-Key Agreement: Concurrent Updates without Pruning.” <i>45th Annual International Cryptology Conference</i>, vol. 16007, Springer Nature, 2025, pp. 141–72, doi:<a href=\"https://doi.org/10.1007/978-3-032-01913-4_5\">10.1007/978-3-032-01913-4_5</a>.","ista":"Auerbach B, Cueto Noval M, Erol B, Pietrzak KZ. 2025. Continuous group-key agreement: Concurrent updates without pruning. 45th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16007, 141–172.","short":"B. Auerbach, M. Cueto Noval, B. Erol, K.Z. Pietrzak, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 141–172."},"status":"public","publication_identifier":{"isbn":["9783032019127"],"eisbn":["9783032019134"],"issn":["0302-9743"],"eissn":["1611-3349"]},"type":"conference","OA_type":"green","acknowledgement":"B. Auerbach and B. Erol—Conducted part of this work at ISTA.","date_published":"2025-08-17T00:00:00Z","article_processing_charge":"No","title":"Continuous group-key agreement: Concurrent updates without pruning","volume":16007,"month":"08","date_updated":"2026-02-18T07:36:42Z","quality_controlled":"1","page":"141-172","department":[{"_id":"KrPi"}],"conference":{"start_date":"2025-08-17","name":"CRYPTO: International Cryptology Conference","end_date":"2025-08-21","location":"Santa Barbara, CA, United States"},"_id":"21262","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"45th Annual International Cryptology Conference","OA_place":"repository","day":"17","alternative_title":["LNCS"],"date_created":"2026-02-17T07:41:04Z","year":"2025","intvolume":"     16007","doi":"10.1007/978-3-032-01913-4_5","publication_status":"published","oa":1,"author":[{"last_name":"Auerbach","first_name":"Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","full_name":"Auerbach, Benedikt"},{"first_name":"Miguel","last_name":"Cueto Noval","orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","full_name":"Cueto Noval, Miguel"},{"full_name":"Erol, Boran","first_name":"Boran","last_name":"Erol"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}]},{"status":"public","type":"conference","publication_identifier":{"isbn":["9783959773720"]},"OA_type":"gold","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","scopus_import":"1","article_number":"150","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."}],"citation":{"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>","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.","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.","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.","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>.","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>"},"oa_version":"Published Version","month":"07","date_updated":"2026-02-18T07:53:26Z","quality_controlled":"1","external_id":{"arxiv":["2504.15960"]},"arxiv":1,"date_published":"2025-07-30T00:00:00Z","article_processing_charge":"No","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).","title":"The value problem for multiple-environment MDPs with parity objective","publication":"52nd International Colloquium on Automata, Languages, and Programming","corr_author":"1","OA_place":"publisher","day":"30","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","_id":"21268","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"department":[{"_id":"KrCh"}],"conference":{"end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming","start_date":"2025-07-08","location":"Aarhus, Denmark"},"publication_status":"published","oa":1,"file":[{"success":1,"file_id":"21313","date_created":"2026-02-18T07:50:56Z","file_name":"2025_LIPIcs_Chatterjee.pdf","access_level":"open_access","checksum":"4477a7fd4fbf0ba6c8e9b15683b5a6b8","creator":"dernst","content_type":"application/pdf","relation":"main_file","date_updated":"2026-02-18T07:50:56Z","file_size":1075724}],"doi":"10.4230/LIPIcs.ICALP.2025.150","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"ddc":["000"],"language":[{"iso":"eng"}],"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Laurent","last_name":"Doyen","full_name":"Doyen, Laurent"},{"full_name":"Raskin, Jean-Francois","first_name":"Jean-Francois","last_name":"Raskin"},{"first_name":"Ocan","last_name":"Sankur","full_name":"Sankur, Ocan"}],"file_date_updated":"2026-02-18T07:50:56Z","alternative_title":["LIPIcs"],"date_created":"2026-02-17T07:49:17Z","year":"2025"},{"publication_identifier":{"issn":["2835-8279"]},"type":"journal_article","status":"public","OA_type":"gold","publisher":"American Physical Society","oa_version":"Published Version","abstract":[{"lang":"eng","text":"The spatial organization of chromatin within the nucleus plays a crucial role in gene expression and genome function. However, the quantitative relationship between this organization and nuclear biochemical processes remains under debate. In this study, we present a graph-based generative model, bioSBM, designed to capture long-range chromatin interaction patterns from Hi-C data and, importantly, simultaneously link these patterns to biochemical features. Applying bioSBM to Hi-C maps of the GM12878 lymphoblastoid cell line, we identified a latent structure of chromatin interactions, revealing seven distinct communities that strongly align with known biological annotations. Additionally, we infer a linear transformation that maps biochemical observables, such as histone marks, to the parameters of the generative graph model, enabling accurate genome-wide predictions of chromatin contact maps on out-of-sample data, both within the same cell line and on the completely unseen HCT116 cell line under RAD21 depletion. These findings highlight bioSBM's potential as a powerful tool for elucidating the relationship between biochemistry and chromatin architecture and predicting long-range genome organization from independent biochemical data."}],"article_number":"043006","citation":{"chicago":"Zhang, Chen Y, Angelo Rosa, and Guido Sanguinetti. “BioSBM: A Random Graph Model to Integrate Epigenomic Data in Chromatin Structure Prediction.” <i>PRX Life</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/gy1p-4256\">https://doi.org/10.1103/gy1p-4256</a>.","apa":"Zhang, C. Y., Rosa, A., &#38; Sanguinetti, G. (2025). bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction. <i>PRX Life</i>. American Physical Society. <a href=\"https://doi.org/10.1103/gy1p-4256\">https://doi.org/10.1103/gy1p-4256</a>","ista":"Zhang CY, Rosa A, Sanguinetti G. 2025. bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction. PRX Life. 3(4), 043006.","short":"C.Y. Zhang, A. Rosa, G. Sanguinetti, PRX Life 3 (2025).","mla":"Zhang, Chen Y., et al. “BioSBM: A Random Graph Model to Integrate Epigenomic Data in Chromatin Structure Prediction.” <i>PRX Life</i>, vol. 3, no. 4, 043006, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/gy1p-4256\">10.1103/gy1p-4256</a>.","ieee":"C. Y. Zhang, A. Rosa, and G. Sanguinetti, “bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction,” <i>PRX Life</i>, vol. 3, no. 4. American Physical Society, 2025.","ama":"Zhang CY, Rosa A, Sanguinetti G. bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction. <i>PRX Life</i>. 2025;3(4). doi:<a href=\"https://doi.org/10.1103/gy1p-4256\">10.1103/gy1p-4256</a>"},"month":"10","external_id":{"arxiv":["2409.14425"]},"quality_controlled":"1","date_updated":"2026-02-18T08:01:00Z","title":"bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction","PlanS_conform":"1","acknowledgement":"G.S. acknowledges co-funding from Next Generation EU, in the context of the National Recovery and Resilience Plan, Investment PE1 - Project FAIR “Future Artificial Intelligence Research”. This resource was co-financed by the Next Generation EU [DM 1555 del 11.10.22]. A.R. acknowledges financial support from PNRR Grant CN 00000013 CN-HPC, M4C2I1.4, spoke 7, funded by Next Generation EU.","article_processing_charge":"Yes","arxiv":1,"date_published":"2025-10-21T00:00:00Z","volume":3,"corr_author":"1","OA_place":"publisher","publication":"PRX Life","day":"21","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"issue":"4","department":[{"_id":"GaTk"}],"_id":"21269","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2026-02-18T07:57:39Z","content_type":"application/pdf","relation":"main_file","file_size":1888053,"file_id":"21314","success":1,"date_created":"2026-02-18T07:57:39Z","access_level":"open_access","file_name":"2025_PRXLife_Zhang.pdf","creator":"dernst","checksum":"76ddfee3efdb4c9d085059b5a142ed78"}],"doi":"10.1103/gy1p-4256","oa":1,"publication_status":"published","intvolume":"         3","file_date_updated":"2026-02-18T07:57:39Z","author":[{"full_name":"Zhang, Chen Y","id":"81b43fb8-c9d5-11ef-bf68-ade532a1f204","last_name":"Zhang","first_name":"Chen Y"},{"first_name":"Angelo","last_name":"Rosa","full_name":"Rosa, Angelo"},{"last_name":"Sanguinetti","first_name":"Guido","full_name":"Sanguinetti, Guido"}],"language":[{"iso":"eng"}],"ddc":["570"],"date_created":"2026-02-17T07:53:01Z","article_type":"original","year":"2025","DOAJ_listed":"1"},{"issue":"18","department":[{"_id":"RoSe"}],"_id":"21270","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Physical Review B","OA_place":"repository","day":"18","article_type":"original","date_created":"2026-02-17T07:56:20Z","year":"2025","intvolume":"       112","doi":"10.1103/s9p9-jflq","publication_status":"published","oa":1,"author":[{"last_name":"Taylor","first_name":"J.","full_name":"Taylor, J."},{"full_name":"Čufar, M.","first_name":"M.","last_name":"Čufar"},{"full_name":"Mitrouskas, David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","first_name":"David Johannes","last_name":"Mitrouskas"},{"id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert","last_name":"Seiringer","first_name":"Robert","orcid":"0000-0002-6781-0521"},{"full_name":"Pahl, E.","last_name":"Pahl","first_name":"E."},{"last_name":"Brand","first_name":"J.","full_name":"Brand, J."}],"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2506.02440 "}],"publisher":"American Physical Society","oa_version":"Preprint","citation":{"short":"J. Taylor, M. Čufar, D.J. Mitrouskas, R. Seiringer, E. Pahl, J. Brand, Physical Review B 112 (2025).","ista":"Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. 2025. Bound excited states of Fröhlich polarons in one dimension. Physical Review B. 112(18), 184312.","mla":"Taylor, J., et al. “Bound Excited States of Fröhlich Polarons in One Dimension.” <i>Physical Review B</i>, vol. 112, no. 18, 184312, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/s9p9-jflq\">10.1103/s9p9-jflq</a>.","chicago":"Taylor, J., M. Čufar, David Johannes Mitrouskas, Robert Seiringer, E. Pahl, and J. Brand. “Bound Excited States of Fröhlich Polarons in One Dimension.” <i>Physical Review B</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>.","apa":"Taylor, J., Čufar, M., Mitrouskas, D. J., Seiringer, R., Pahl, E., &#38; Brand, J. (2025). Bound excited states of Fröhlich polarons in one dimension. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>","ama":"Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. Bound excited states of Fröhlich polarons in one dimension. <i>Physical Review B</i>. 2025;112(18). doi:<a href=\"https://doi.org/10.1103/s9p9-jflq\">10.1103/s9p9-jflq</a>","ieee":"J. Taylor, M. Čufar, D. J. Mitrouskas, R. Seiringer, E. Pahl, and J. Brand, “Bound excited states of Fröhlich polarons in one dimension,” <i>Physical Review B</i>, vol. 112, no. 18. American Physical Society, 2025."},"abstract":[{"lang":"eng","text":"The one-dimensional Fröhlich model describing the motion of a single electron interacting with optical phonons is a paradigmatic model of quantum many-body physics. We predict the existence of an arbitrarily large number of bound excited states in the strong-coupling limit and calculate their excitation energies. Numerical simulations of a discretized model demonstrate the complete amelioration of the projector Monte Carlo sign problem by walker annihilation in an infinite Hilbert space. They reveal the threshold for the occurrence of the first bound excited states at a value of 𝛼≈1.73 for the dimensionless coupling constant. This puts the threshold into the regime of intermediate interaction strength. We find a significant spectral weight and increased phonon number of the bound excited state at threshold."}],"article_number":"184312","scopus_import":"1","status":"public","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"type":"journal_article","OA_type":"green","acknowledgement":"We are grateful to Dmytro Kolisnyk for his help in working out the spectrum of the Hessian. This work was supported by the Marsden Fund of New Zealand (Contract No. MAU2007) from government funding administered by the Royal Society Te Apārangi and by a summer scholarship from Te Whai Ao – Dodd-Walls Centre for Photonic and Quantum Technologies and the Physics Department, University of Auckland. We acknowledge support by the New Zealand eScience Infrastructure (NeSI) high-performance computing facilities in the form of a merit project allocation.","arxiv":1,"date_published":"2025-11-18T00:00:00Z","article_processing_charge":"No","title":"Bound excited states of Fröhlich polarons in one dimension","volume":112,"month":"11","quality_controlled":"1","date_updated":"2026-02-18T08:23:59Z","external_id":{"arxiv":["2506.02440 "]}},{"OA_place":"repository","corr_author":"1","publication":"The Annals of Probability","day":"01","page":"2256-2308","issue":"6","department":[{"_id":"LaEr"}],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21271","project":[{"call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331"}],"doi":"10.1214/25-aop1761","publication_status":"published","oa":1,"intvolume":"        53","author":[{"id":"582b06a9-1f1c-11ee-b076-82ffce00dde4","full_name":"Campbell, Andrew J","last_name":"Campbell","first_name":"Andrew J"},{"full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","last_name":"Cipolloni","first_name":"Giorgio"},{"orcid":"0000-0001-5366-9603","first_name":"László","last_name":"Erdös","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ji, Hong Chang","id":"dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d","first_name":"Hong Chang","last_name":"Ji"}],"language":[{"iso":"eng"}],"date_created":"2026-02-17T07:58:20Z","article_type":"original","year":"2025","publication_identifier":{"eissn":["2168-894X"],"issn":["0091-1798"]},"type":"journal_article","status":"public","OA_type":"green","publisher":"Institute of Mathematical Statistics","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2404.17512"}],"oa_version":"Preprint","citation":{"ieee":"A. J. Campbell, G. Cipolloni, L. Erdös, and H. C. Ji, “On the spectral edge of non-Hermitian random matrices,” <i>The Annals of Probability</i>, vol. 53, no. 6. Institute of Mathematical Statistics, pp. 2256–2308, 2025.","ama":"Campbell AJ, Cipolloni G, Erdös L, Ji HC. On the spectral edge of non-Hermitian random matrices. <i>The Annals of Probability</i>. 2025;53(6):2256-2308. doi:<a href=\"https://doi.org/10.1214/25-aop1761\">10.1214/25-aop1761</a>","apa":"Campbell, A. J., Cipolloni, G., Erdös, L., &#38; Ji, H. C. (2025). On the spectral edge of non-Hermitian random matrices. <i>The Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-aop1761\">https://doi.org/10.1214/25-aop1761</a>","chicago":"Campbell, Andrew J, Giorgio Cipolloni, László Erdös, and Hong Chang Ji. “On the Spectral Edge of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-aop1761\">https://doi.org/10.1214/25-aop1761</a>.","mla":"Campbell, Andrew J., et al. “On the Spectral Edge of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>, vol. 53, no. 6, Institute of Mathematical Statistics, 2025, pp. 2256–308, doi:<a href=\"https://doi.org/10.1214/25-aop1761\">10.1214/25-aop1761</a>.","ista":"Campbell AJ, Cipolloni G, Erdös L, Ji HC. 2025. On the spectral edge of non-Hermitian random matrices. The Annals of Probability. 53(6), 2256–2308.","short":"A.J. Campbell, G. Cipolloni, L. Erdös, H.C. Ji, The Annals of Probability 53 (2025) 2256–2308."},"abstract":[{"lang":"eng","text":"For general non-Hermitian large random matrices X and deterministic deformation matrices A, we prove that the local eigenvalue statistics of A+X close to the typical edge points of its spectrum are universal. Furthermore, we show that, under natural assumptions, on A the spectrum of A+X does not have outliers at a distance larger than the natural fluctuation scale of the eigenvalues. As a consequence, the number of eigenvalues in each component of Spec(A+X) is deterministic."}],"month":"11","external_id":{"arxiv":["2404.17512"]},"date_updated":"2026-02-18T08:35:38Z","quality_controlled":"1","title":"On the spectral edge of non-Hermitian random matrices","acknowledgement":"The authors would like to thank the anonymous referee for providing helpful comments and suggestions. We also thank Joscha Henheik and Volodymyr Riabov for pointing out a gap in an earlier version of the proof of equation (3.18). The first, third, and fourth authors are supported by ERC Advanced Grant “RMTBeyond” No. 101020331.","arxiv":1,"date_published":"2025-11-01T00:00:00Z","article_processing_charge":"No","volume":53},{"acknowledgement":"P.J.E was partially funded by the German BMWK project QCHALLenge (Grant No. 01MQ22008B).\r\n","article_processing_charge":"No","arxiv":1,"date_published":"2025-09-01T00:00:00Z","title":"Quantum-guided cluster algorithms for combinatorial optimization","date_updated":"2026-02-18T08:45:56Z","quality_controlled":"1","external_id":{"arxiv":["2508.10656"]},"month":"09","oa_version":"Preprint","abstract":[{"text":"Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these localized updates can cause the system to become trapped in local minima. Cluster algorithms (CAs) were developed to address this limitation and have demonstrated considerable success in studying ferromagnetic systems; however, they tend to encounter percolation issues when applied to generic spin glasses. In this work, we introduce a novel CA designed to tackle these challenges by leveraging precomputed two-point correlations, aiming solve combinatorial optimization problems in the form of Max-Cut more efficiently. In our approach, clusters are formed probabilistically based on these correlations. Various classical and quantum algorithms can be employed to generate correlations that embody information about the energy landscape of the problem. By utilizing this information, the algorithm aims to identify groups of spins whose simultaneous flipping induces large transitions in configuration space with high acceptance probability - even at low energy levels - thereby escaping local minima more effectively. Notably, clusters generated using correlations from the Quantum Approximate Optimization Algorithm exhibit high acceptance rates at low temperatures. These acceptance rates often increase with circuit depth, accelerating the algorithm and enabling more efficient exploration of the solution space.","lang":"eng"}],"citation":{"ieee":"P. J. Eder <i>et al.</i>, “Quantum-guided cluster algorithms for combinatorial optimization,” in <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, Albuquerque, NM, United States, 2025.","ama":"Eder PJ, Kerschbaumer A, Finžgar JR, et al. Quantum-guided cluster algorithms for combinatorial optimization. In: <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>","chicago":"Eder, Peter J., Aron Kerschbaumer, Jernej Rudi Finžgar, Raimel A Medina Ramos, Martin J. A. Schuetz, Helmut G. Katzgraber, Sarah Braun, and Christian B. Mendl. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>.","apa":"Eder, P. J., Kerschbaumer, A., Finžgar, J. R., Medina Ramos, R. A., Schuetz, M. J. A., Katzgraber, H. G., … Mendl, C. B. (2025). Quantum-guided cluster algorithms for combinatorial optimization. In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. Albuquerque, NM, United States: IEEE. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>","ista":"Eder PJ, Kerschbaumer A, Finžgar JR, Medina Ramos RA, Schuetz MJA, Katzgraber HG, Braun S, Mendl CB. 2025. Quantum-guided cluster algorithms for combinatorial optimization. 2025 IEEE International Conference on Quantum Computing and Engineering. QCE: International Conference on Quantum Computing and Engineering.","short":"P.J. Eder, A. Kerschbaumer, J.R. Finžgar, R.A. Medina Ramos, M.J.A. Schuetz, H.G. Katzgraber, S. Braun, C.B. Mendl, in:, 2025 IEEE International Conference on Quantum Computing and Engineering, IEEE, 2025.","mla":"Eder, Peter J., et al. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>."},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.10656"}],"publisher":"IEEE","OA_type":"green","status":"public","publication_identifier":{"eisbn":["9798331557362"]},"type":"conference","year":"2025","date_created":"2026-02-17T08:00:17Z","author":[{"first_name":"Peter J.","last_name":"Eder","full_name":"Eder, Peter J."},{"last_name":"Kerschbaumer","first_name":"Aron","orcid":"0009-0002-2370-8661","id":"ade85a9c-3200-11ee-973b-91c1eb240410","full_name":"Kerschbaumer, Aron"},{"last_name":"Finžgar","first_name":"Jernej Rudi","full_name":"Finžgar, Jernej Rudi"},{"id":"CE680B90-D85A-11E9-B684-C920E6697425","full_name":"Medina Ramos, Raimel A","first_name":"Raimel A","last_name":"Medina Ramos","orcid":"0000-0002-5383-2869"},{"last_name":"Schuetz","first_name":"Martin J. A.","full_name":"Schuetz, Martin J. A."},{"first_name":"Helmut G.","last_name":"Katzgraber","full_name":"Katzgraber, Helmut G."},{"full_name":"Braun, Sarah","last_name":"Braun","first_name":"Sarah"},{"full_name":"Mendl, Christian B.","last_name":"Mendl","first_name":"Christian B."}],"language":[{"iso":"eng"}],"doi":"10.1109/qce65121.2025.00033","publication_status":"published","oa":1,"department":[{"_id":"MaSe"}],"conference":{"end_date":"2025-09-05","name":"QCE: International Conference on Quantum Computing and Engineering","start_date":"2025-08-30","location":"Albuquerque, NM, United States"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21272","day":"01","publication":"2025 IEEE International Conference on Quantum Computing and Engineering","OA_place":"repository","corr_author":"1"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21280","department":[{"_id":"MoHe"}],"ec_funded":1,"conference":{"location":"Aarhus, Denmark","start_date":"2025-07-08","end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming"},"page":"91:1-91:20","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","day":"30","OA_place":"publisher","corr_author":"1","publication":"52nd International Colloquium on Automata, Languages, and Programming","year":"2025","date_created":"2026-02-17T08:26:06Z","alternative_title":["LIPIcs"],"file_date_updated":"2026-02-18T09:02:33Z","language":[{"iso":"eng"}],"ddc":["000"],"author":[{"first_name":"Gramoz","last_name":"Goranci","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"},{"full_name":"Sricharan, A.","first_name":"A.","last_name":"Sricharan"}],"oa":1,"publication_status":"published","project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"doi":"10.4230/lipics.icalp.2025.91","file":[{"file_size":944824,"date_updated":"2026-02-18T09:02:33Z","relation":"main_file","content_type":"application/pdf","date_created":"2026-02-18T09:02:33Z","success":1,"file_id":"21315","creator":"dernst","checksum":"c178cf554e44204b9f64ebd9b54cf7ba","file_name":"2025_ICALP_Goranci.pdf","access_level":"open_access"}],"intvolume":"       334","abstract":[{"lang":"eng","text":"We give an algorithm that, with high probability, maintains a (1-ε)-approximate s-t maximum flow in undirected, uncapacitated n-vertex graphs undergoing m edge insertions in Õ(m+ n F^*/ε) total update time, where F^{*} is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs (m = Ω(n²)), and more generally, for graphs where F^* = Õ(m/n). At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [SICOMP '15], originally designed for computing exact maximum flows in the static setting. Our main contributions are (i) showing how to maintain such sparsifiers for approximate maximum flows in the incremental setting and (ii) generalizing the cut sparsification framework of Fung et al. [SICOMP '19] from undirected graphs to balanced directed graphs."}],"citation":{"mla":"Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20, doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>.","ista":"Goranci G, Henzinger M, Räcke H, Sricharan A. 2025. Incremental approximate maximum flow via residual graph sparsification. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334, 91:1-91:20.","short":"G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20.","apa":"Goranci, G., Henzinger, M., Räcke, H., &#38; Sricharan, A. (2025). Incremental approximate maximum flow via residual graph sparsification. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334, p. 91:1-91:20). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>","chicago":"Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, 334:91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>.","ama":"Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum flow via residual graph sparsification. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:91:1-91:20. doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>","ieee":"G. Goranci, M. Henzinger, H. Räcke, and A. Sricharan, “Incremental approximate maximum flow via residual graph sparsification,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334, p. 91:1-91:20."},"scopus_import":"1","oa_version":"Published Version","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","OA_type":"gold","type":"conference","publication_identifier":{"isbn":["9783959773720"]},"status":"public","volume":334,"title":"Incremental approximate maximum flow via residual graph sparsification","article_processing_charge":"No","arxiv":1,"date_published":"2025-06-30T00:00:00Z","acknowledgement":"Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Harald Räcke: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","external_id":{"arxiv":["2502.09105"]},"date_updated":"2026-02-18T09:06:12Z","quality_controlled":"1","month":"06"},{"month":"12","quality_controlled":"1","date_updated":"2026-02-19T09:39:15Z","external_id":{"arxiv":["2508.15356"]},"acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n","article_processing_charge":"Yes","date_published":"2025-12-09T00:00:00Z","arxiv":1,"title":"ε-stationary Nash equilibria in multi-player stochastic graph games","volume":360,"status":"public","publication_identifier":{"isbn":["9783959774062"]},"type":"conference","OA_type":"gold","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","abstract":[{"text":"A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.\r\nThe problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. \r\nWe further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small.","lang":"eng"}],"citation":{"ista":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria in multi-player stochastic graph games. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 9:1-9:17.","short":"A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.","mla":"Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>.","chicago":"Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>.","apa":"Asadi, A., Brice, L., Chatterjee, K., &#38; Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>","ama":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>","ieee":"A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 9:1-9:17."},"intvolume":"       360","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"file":[{"access_level":"open_access","file_name":"2025_FSTTCS_Asadi.pdf","checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","creator":"dernst","file_id":"21316","success":1,"date_created":"2026-02-18T09:13:25Z","content_type":"application/pdf","relation":"main_file","date_updated":"2026-02-18T09:13:25Z","file_size":1054007}],"doi":"10.4230/lipics.fsttcs.2025.9","publication_status":"published","oa":1,"author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali"},{"full_name":"Brice, Leonard","last_name":"Brice","first_name":"Leonard"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Thejaswini, K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S.","last_name":"Thejaswini"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2026-02-18T09:13:25Z","alternative_title":["LIPIcs"],"date_created":"2026-02-17T08:27:14Z","year":"2025","publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","OA_place":"publisher","corr_author":"1","day":"09","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"9:1-9:17","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"ec_funded":1,"conference":{"location":"Pilani, India","name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","end_date":"2025-12-19","start_date":"2025-12-17"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21281"},{"year":"2025","date_created":"2026-02-17T13:53:50Z","title":"Expanding stellar horizons with polarized light","article_processing_charge":"No","arxiv":1,"date_published":"2025-12-17T00:00:00Z","external_id":{"arxiv":["2512.15170"]},"author":[{"full_name":"Vandersnickt, J.","first_name":"J.","last_name":"Vandersnickt"},{"first_name":"R. Ochoa","last_name":"Armenta","full_name":"Armenta, R. Ochoa"},{"full_name":"Vanlaer, V.","first_name":"V.","last_name":"Vanlaer"},{"last_name":"A. David-Uraz","first_name":"A. David-Uraz","full_name":"A. David-Uraz, A. David-Uraz"},{"full_name":"Aerts, C.","first_name":"C.","last_name":"Aerts"},{"last_name":"Das","first_name":"S. B.","full_name":"Das, S. B."},{"full_name":"Bouret, J. -C.","last_name":"Bouret","first_name":"J. -C."},{"first_name":"D. M.","last_name":"Bowman","full_name":"Bowman, D. M."},{"orcid":"0000-0003-0142-4000","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle","id":"d9edb345-f866-11ec-9b37-d119b5234501"},{"full_name":"Khalack, V.","last_name":"Khalack","first_name":"V."},{"full_name":"J. Labadie-Bartz, J. Labadie-Bartz","last_name":"J. Labadie-Bartz","first_name":"J. Labadie-Bartz"},{"full_name":"Mathis, S.","last_name":"Mathis","first_name":"S."},{"full_name":"Nazé, Y.","first_name":"Y.","last_name":"Nazé"},{"full_name":"Neiner, C.","first_name":"C.","last_name":"Neiner"},{"full_name":"Petit, P.","first_name":"P.","last_name":"Petit"},{"first_name":"V.","last_name":"Petit","full_name":"Petit, V."},{"full_name":"K. Thomson-Paressant, K. Thomson-Paressant","last_name":"K. Thomson-Paressant","first_name":"K. Thomson-Paressant"},{"first_name":"T. Van","last_name":"Doorsselaere","full_name":"Doorsselaere, T. Van"},{"full_name":"Vanrespaille, M.","first_name":"M.","last_name":"Vanrespaille"}],"date_updated":"2026-04-07T06:00:40Z","language":[{"iso":"eng"}],"month":"12","doi":"10.48550/arXiv.2512.15170","publication_status":"submitted","oa":1,"department":[{"_id":"LiBu"}],"_id":"21309","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","citation":{"ama":"Vandersnickt J, Armenta RO, Vanlaer V, et al. Expanding stellar horizons with polarized light. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2512.15170\">10.48550/arXiv.2512.15170</a>","ieee":"J. Vandersnickt <i>et al.</i>, “Expanding stellar horizons with polarized light,” <i>arXiv</i>. .","mla":"Vandersnickt, J., et al. “Expanding Stellar Horizons with Polarized Light.” <i>ArXiv</i>, 2512.15170, doi:<a href=\"https://doi.org/10.48550/arXiv.2512.15170\">10.48550/arXiv.2512.15170</a>.","ista":"Vandersnickt J, Armenta RO, Vanlaer V, A. David-Uraz AD-U, Aerts C, Das SB, Bouret J-C, Bowman DM, Bugnet LA, Khalack V, J. Labadie-Bartz JL-B, Mathis S, Nazé Y, Neiner C, Petit P, Petit V, K. Thomson-Paressant KT-P, Doorsselaere TV, Vanrespaille M. Expanding stellar horizons with polarized light. arXiv, 2512.15170.","short":"J. Vandersnickt, R.O. Armenta, V. Vanlaer, A.D.-U. A. David-Uraz, C. Aerts, S.B. Das, J.-C. Bouret, D.M. Bowman, L.A. Bugnet, V. Khalack, J.L.-B. J. Labadie-Bartz, S. Mathis, Y. Nazé, C. Neiner, P. Petit, V. Petit, K.T.-P. K. Thomson-Paressant, T.V. Doorsselaere, M. Vanrespaille, ArXiv (n.d.).","apa":"Vandersnickt, J., Armenta, R. O., Vanlaer, V., A. David-Uraz, A. D.-U., Aerts, C., Das, S. B., … Vanrespaille, M. (n.d.). Expanding stellar horizons with polarized light. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2512.15170\">https://doi.org/10.48550/arXiv.2512.15170</a>","chicago":"Vandersnickt, J., R. Ochoa Armenta, V. Vanlaer, A. David-Uraz A. David-Uraz, C. Aerts, S. B. Das, J. -C. Bouret, et al. “Expanding Stellar Horizons with Polarized Light.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2512.15170\">https://doi.org/10.48550/arXiv.2512.15170</a>."},"article_number":"2512.15170","abstract":[{"text":"The polarization of light is a critically under-utilized, rich source of information in astronomy. For stars in particular, surface magnetism polarization that can be detected and measured with spectro-polarimetry. Many questions about these surface fields remain unanswered due to a lack of dedicated instruments capable of probing weak and strong surface magnetic fields for the entire mass range of stars, from M-dwarfs (and even substellar objects) to massive O-type stars at different evolutionary stages and metallicities. These questions range from the origin of these fields to their true incidence rate throughout the stellar population and the dependence on metallicity. Magnetic fields, although currently often excluded from stellar evolution models, play an important role in stellar evolution. Connecting the surface fields to internal fields through asteroseismology will instigate a new era of understanding stellar evolution and the transport of angular momentum and chemical elements throughout stellar interiors, also impacting our understanding of star-planet interactions and stellar remnants. Polarimetry is also an under-utilized tool to observationally constrain the mode identification of nonradial oscillations, which lies at the basis of accurate asteroseismic parameter estimation at percentage-level for stellar radii, masses, ages, internal rotation, and magnetic field strengths. Combining strong constraints on mode identification and surface magnetic properties through the acquisition of time-resolved, high-resolution and high-signal-to-noise (S/N) spectro-polarimetry and spectroscopy promises to bring leaps forward in our understanding of stellar structure, particularly when combined with long-term space photometric data from past, current, and future missions.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.15170"}],"OA_type":"green","day":"17","OA_place":"repository","type":"preprint","publication":"arXiv","status":"public"},{"OA_place":"publisher","publication":"The Astrophysical Journal Letters","day":"08","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21317","department":[{"_id":"IlCa"}],"issue":"2","oa":1,"publication_status":"published","file":[{"file_size":3772189,"relation":"main_file","date_updated":"2026-02-19T07:24:10Z","content_type":"application/pdf","date_created":"2026-02-19T07:24:10Z","file_id":"21329","success":1,"creator":"dernst","checksum":"f76556d129aa0e9facc85602b0b5b54d","access_level":"open_access","file_name":"2025_AstrophysicalJournal_Galiullin.pdf"}],"doi":"10.3847/2041-8213/adff82","intvolume":"       990","file_date_updated":"2026-02-19T07:24:10Z","language":[{"iso":"eng"}],"ddc":["520"],"author":[{"last_name":"Galiullin","first_name":"Ilkham","full_name":"Galiullin, Ilkham"},{"last_name":"Rodriguez","first_name":"Antonio C.","full_name":"Rodriguez, Antonio C."},{"full_name":"El-Badry, Kareem","first_name":"Kareem","last_name":"El-Badry"},{"id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d","full_name":"Caiazzo, Ilaria","last_name":"Caiazzo","first_name":"Ilaria","orcid":"0000-0002-4770-5388"},{"first_name":"Paula","last_name":"Szkody","full_name":"Szkody, Paula"},{"first_name":"Pranav","last_name":"Nagarajan","full_name":"Nagarajan, Pranav"},{"full_name":"Whitebook, Samuel","first_name":"Samuel","last_name":"Whitebook"}],"date_created":"2026-02-18T10:17:04Z","article_type":"original","year":"2025","DOAJ_listed":"1","type":"journal_article","publication_identifier":{"issn":["2041-8205"],"eissn":["2041-8213"]},"status":"public","OA_type":"gold","publisher":"IOP Publishing","abstract":[{"lang":"eng","text":"Accreting white dwarfs (WDs) in close binary systems, commonly known as cataclysmic variables (CVs), with orbital periods below the canonical period minimum (≈80 minutes) are rare. Such short periods can only be reached if the donor star in the CV is either significantly evolved before initiating mass transfer to the WD or is metal-poor. We present optical photometry and spectroscopy of Gaia19bxc, a high-amplitude variable identified as a polar CV with an exceptionally short orbital period of 64.42 minutes—well below the canonical CV period minimum. High-speed photometry confirms persistent double-peaked variability consistent with cyclotron beaming, thus indicating the presence of a magnetic WD. Phase-resolved Keck/Low-Resolution Imaging Spectrometer (LRIS) spectroscopy reveals strong hydrogen and helium emission lines but no donor features, indicating the accretor is a magnetic WD and the donor is hydrogen-rich, but cold and faint. The absence of a detectable donor and the low inferred temperature (≲3500 K) disfavor an evolved donor scenario. Instead, the short period and the system’s halo-like kinematics suggest Gaia19bxc may be the first known metal-poor polar. Because metal-poor donors are more compact than solar-metallicity donors of the same mass, they can reach shorter minimum periods. Gaia19bxc is one of only a handful of known metal-poor CVs below the canonical period minimum and has the shortest period of any such magnetic system discovered to date."}],"scopus_import":"1","article_number":"L57","citation":{"apa":"Galiullin, I., Rodriguez, A. C., El-Badry, K., Caiazzo, I., Szkody, P., Nagarajan, P., &#38; Whitebook, S. (2025). Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>","chicago":"Galiullin, Ilkham, Antonio C. Rodriguez, Kareem El-Badry, Ilaria Caiazzo, Paula Szkody, Pranav Nagarajan, and Samuel Whitebook. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>.","mla":"Galiullin, Ilkham, et al. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2, L57, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>.","ista":"Galiullin I, Rodriguez AC, El-Badry K, Caiazzo I, Szkody P, Nagarajan P, Whitebook S. 2025. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. The Astrophysical Journal Letters. 990(2), L57.","short":"I. Galiullin, A.C. Rodriguez, K. El-Badry, I. Caiazzo, P. Szkody, P. Nagarajan, S. Whitebook, The Astrophysical Journal Letters 990 (2025).","ieee":"I. Galiullin <i>et al.</i>, “Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor,” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2. IOP Publishing, 2025.","ama":"Galiullin I, Rodriguez AC, El-Badry K, et al. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. 2025;990(2). doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>"},"oa_version":"Published Version","month":"09","external_id":{"arxiv":["2508.20170"]},"quality_controlled":"1","date_updated":"2026-02-19T07:27:01Z","PlanS_conform":"1","title":"Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor","arxiv":1,"article_processing_charge":"Yes","date_published":"2025-09-08T00:00:00Z","acknowledgement":"Based on observations obtained with the Samuel Oschin Telescope 48 inch and the 60 inch Telescope at the Palomar Observatory as part of the Zwicky Transient Facility project. ZTF is supported by the National Science Foundation under grants No. AST-1440341 and AST-2034437 and a collaboration including current partners Caltech, IPAC, the Weizmann Institute of Science, the Oskar Klein Center at Stockholm University, the University of Maryland, Deutsches Elektronen-Synchrotron and Humboldt University, the TANGO Consortium of Taiwan, the University of Wisconsin at Milwaukee, Trinity College Dublin, Lawrence Livermore National Laboratories, IN2P3, University of Warwick, Ruhr University Bochum, Northwestern University and former partners the University of Washington, Los Alamos National Laboratories, and Lawrence Berkeley National Laboratories. Operations are conducted by COO, IPAC, and UW. This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC; https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. Some of the data presented herein were obtained at Keck Observatory, which is a private 501(c)3 nonprofit organization operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation. We wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the Native Hawaiian community. We are most fortunate to have had the opportunity to conduct observations from this mountain. We are grateful to the staff of the Palomar and Keck Observatories for their work in helping us carry out our observations.\r\n\r\nI.G. acknowledges support from Kazan Federal University. A.C.R. acknowledges support from the National Science Foundation via an NSF Graduate Research Fellowship. We thank the anonymous referee for useful comments and suggestions, which contributed to the improvement of this manuscript.","volume":990},{"publication_status":"published","oa":1,"doi":"10.1103/2yzc-fsm3","intvolume":"       135","language":[{"iso":"eng"}],"author":[{"full_name":"Rossi, M.","last_name":"Rossi","first_name":"M."},{"full_name":"Militaru, Andrei","id":"d67706f8-8eb1-11ee-ad1b-9c30dfa19e0b","last_name":"Militaru","first_name":"Andrei"},{"full_name":"Carlon Zambon, N.","last_name":"Carlon Zambon","first_name":"N."},{"full_name":"Riera-Campeny, A.","first_name":"A.","last_name":"Riera-Campeny"},{"last_name":"Romero-Isart","first_name":"O.","full_name":"Romero-Isart, O."},{"first_name":"M.","last_name":"Frimmer","full_name":"Frimmer, M."},{"full_name":"Novotny, L.","first_name":"L.","last_name":"Novotny"}],"date_created":"2026-02-18T10:19:30Z","article_type":"original","year":"2025","OA_place":"repository","publication":"Physical Review Letters","day":"19","_id":"21318","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"8","department":[{"_id":"JoFi"}],"pmid":1,"month":"08","external_id":{"pmid":["40929305"],"arxiv":["2408.01264"]},"date_updated":"2026-02-24T07:03:57Z","quality_controlled":"1","title":"Quantum delocalization of a levitated nanoparticle","arxiv":1,"article_processing_charge":"No","date_published":"2025-08-19T00:00:00Z","volume":135,"type":"journal_article","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"status":"public","OA_type":"green","publisher":"American Physical Society","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2408.01264"}],"article_number":"083601","citation":{"apa":"Rossi, M., Militaru, A., Carlon Zambon, N., Riera-Campeny, A., Romero-Isart, O., Frimmer, M., &#38; Novotny, L. (2025). Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>","chicago":"Rossi, M., Andrei Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, and L. Novotny. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>.","mla":"Rossi, M., et al. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>, vol. 135, no. 8, 083601, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>.","ista":"Rossi M, Militaru A, Carlon Zambon N, Riera-Campeny A, Romero-Isart O, Frimmer M, Novotny L. 2025. Quantum delocalization of a levitated nanoparticle. Physical Review Letters. 135(8), 083601.","short":"M. Rossi, A. Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, L. Novotny, Physical Review Letters 135 (2025).","ieee":"M. Rossi <i>et al.</i>, “Quantum delocalization of a levitated nanoparticle,” <i>Physical Review Letters</i>, vol. 135, no. 8. American Physical Society, 2025.","ama":"Rossi M, Militaru A, Carlon Zambon N, et al. Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. 2025;135(8). doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>"},"abstract":[{"text":"Matter waves have been observed in double-slit experiments with microscopic objects, such as atoms or molecules. The wave function describing the motion of these objects must extend over a distance comparable to the slit separation, much larger than the characteristic size of the objects. Preparing such states for more massive objects, such as mechanical oscillators, remains an outstanding challenge. Here we delocalize the quantum ground state of an optically levitated nanosphere by modulating the stiffness of the confining potential. We show a more than threefold increase of the initial coherence length, which corresponds to mechanical momentum squeezing of more than 7 dB. Our work is a stepping stone toward the generation of coherence lengths comparable to the object size, a crucial regime for macroscopic quantum experiments.","lang":"eng"}],"oa_version":"Preprint"},{"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"department":[{"_id":"KrCh"}],"ec_funded":1,"conference":{"start_date":"2025-07-08","end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming","location":"Aarhus, Denmark"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21320","publication":"52nd International Colloquium on Automata, Languages, and Programming","OA_place":"publisher","day":"30","alternative_title":["LIPIcs"],"date_created":"2026-02-18T10:44:14Z","year":"2025","intvolume":"       334","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"file":[{"date_updated":"2026-02-19T07:41:55Z","relation":"main_file","content_type":"application/pdf","file_size":876167,"file_id":"21331","success":1,"date_created":"2026-02-19T07:41:55Z","access_level":"open_access","file_name":"2025_ICALP_Giambartolomei.pdf","checksum":"960110956c26a5cefadde8e47888bfbe","creator":"dernst"}],"doi":"10.4230/LIPIcs.ICALP.2025.87","publication_status":"published","oa":1,"author":[{"full_name":"Giambartolomei, Giordano","last_name":"Giambartolomei","first_name":"Giordano"},{"full_name":"Mallmann-Trenn, Frederik","last_name":"Mallmann-Trenn","first_name":"Frederik"},{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2026-02-19T07:41:55Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","abstract":[{"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.","lang":"eng"}],"citation":{"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.","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>","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>","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>.","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>.","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.","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."},"status":"public","publication_identifier":{"isbn":["9783959773720"]},"type":"conference","OA_type":"gold","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.","date_published":"2025-06-30T00:00:00Z","article_processing_charge":"No","arxiv":1,"title":"IID prophet inequality with random horizon: Going beyond increasing hazard rates","volume":334,"month":"06","quality_controlled":"1","date_updated":"2026-02-19T07:43:29Z","external_id":{"arxiv":["2407.11752"]}},{"article_type":"original","date_created":"2026-02-18T10:45:06Z","year":"2025","intvolume":"        18","publication_status":"published","oa":1,"doi":"10.26599/nr.2025.94907072","file":[{"success":1,"file_id":"21330","date_created":"2026-02-19T07:31:15Z","file_name":"2025_NanoResearch_Xiao.pdf","access_level":"open_access","checksum":"aa531f1363538fece12ecfad83456b65","creator":"dernst","date_updated":"2026-02-19T07:31:15Z","relation":"main_file","content_type":"application/pdf","file_size":27740524}],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"ddc":["540"],"language":[{"iso":"eng"}],"author":[{"last_name":"Xiao","first_name":"Shanshan","full_name":"Xiao, Shanshan"},{"full_name":"Zhao, Mingjun","last_name":"Zhao","first_name":"Mingjun"},{"first_name":"Mingquan","last_name":"Li","full_name":"Li, Mingquan"},{"full_name":"Wan, Shanhong","first_name":"Shanhong","last_name":"Wan"},{"full_name":"Genç, Aziz","last_name":"Genç","first_name":"Aziz"},{"first_name":"Lulu","last_name":"Huang","full_name":"Huang, Lulu"},{"first_name":"Lei","last_name":"Chen","full_name":"Chen, Lei"},{"first_name":"Yu","last_name":"Zhang","full_name":"Zhang, Yu"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria"},{"full_name":"Lim, Khak Ho","first_name":"Khak Ho","last_name":"Lim"},{"full_name":"Hong, Min","last_name":"Hong","first_name":"Min"},{"last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"file_date_updated":"2026-02-19T07:31:15Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","_id":"21321","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"MaIb"}],"issue":"1","publication":"Nano Research","OA_place":"publisher","day":"01","date_published":"2025-01-01T00:00:00Z","article_processing_charge":"Yes (in subscription journal)","acknowledgement":"Y. L. acknowledges funding from the National Natural Science Foundation of China (No. 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (No. 2022LCX002), and the Fundamental Research Funds for the Central Universities (No. JZ2024HGTB0239). K. H. L. acknowledges financial support from the National Natural Science Foundation of China (No. 22208293). M. I. acknowledge financial support from ISTA and the Werner Siemens Foundation. M. H. acknowledges funding from Australian Research Council (No. FT230100316). L. L. H. and S. H. W. acknowledge the Fundamental Research Funds for the Central Universities (Nos. JZ2023HGTA0179 and JZ2024HGTA0170).","title":"Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>","PlanS_conform":"1","volume":18,"month":"01","date_updated":"2026-02-19T07:32:22Z","publisher":"Tsinghua University Press","article_number":"94907072","abstract":[{"lang":"eng","text":"The development of cost-effective and high-performance thermoelectric (TE) materials faces significant challenges, particularly in improving the properties of promising copper-based TE materials such as Cu3SbSe4, which are limited by their poor electrical conductivity. This study presents a detailed comparative analysis of three strategies to promote the electrical transport properties of Cu3SbSe4 through Sn doping: conventional Sn atomic doping, surface treatment with SnSe molecular complexes, and blending with SnSe nanocrystals to form nanocomposites, all followed by annealing and hot pressing under identical conditions. Our results reveal that a surface treatment using SnSe molecular complexes significantly enhances TE performance over atomic doping and nanocomposite formation, achieving a power factor of 1.1 mW·m−1·K−2 and a maximum dimensionless figure of merit zT value of 0.80 at 640 K, representing an excellent performance among Cu3SbSe4-based materials produced via solution-processing methods. This work highlights the effectiveness of surface engineering in optimizing the transport properties of nanostructured materials, demonstrating the versatility and cost-efficiency of solution-based technologies in the development of advanced nanostructured materials for application in the field of TE among others."}],"citation":{"mla":"Xiao, Shanshan, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>, vol. 18, no. 1, 94907072, Tsinghua University Press, 2025, doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>.","short":"S. Xiao, M. Zhao, M. Li, S. Wan, A. Genç, L. Huang, L. Chen, Y. Zhang, M. Ibáñez, K.H. Lim, M. Hong, Y. Liu, A. Cabot, Nano Research 18 (2025).","ista":"Xiao S, Zhao M, Li M, Wan S, Genç A, Huang L, Chen L, Zhang Y, Ibáñez M, Lim KH, Hong M, Liu Y, Cabot A. 2025. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. Nano Research. 18(1), 94907072.","apa":"Xiao, S., Zhao, M., Li, M., Wan, S., Genç, A., Huang, L., … Cabot, A. (2025). Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. Tsinghua University Press. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>","chicago":"Xiao, Shanshan, Mingjun Zhao, Mingquan Li, Shanhong Wan, Aziz Genç, Lulu Huang, Lei Chen, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>. Tsinghua University Press, 2025. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>.","ama":"Xiao S, Zhao M, Li M, et al. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. 2025;18(1). doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>","ieee":"S. Xiao <i>et al.</i>, “Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>,” <i>Nano Research</i>, vol. 18, no. 1. Tsinghua University Press, 2025."},"oa_version":"Published Version","status":"public","type":"journal_article","publication_identifier":{"eissn":["1998-0000"],"issn":["1998-0124"]},"OA_type":"hybrid"},{"abstract":[{"lang":"eng","text":"Habitat fragmentation poses a significant risk to population survival, causing both demographic stochasticity and genetic drift within local populations to increase, thereby increasing genetic load. Higher load causes population numbers to decline, which reduces the efficiency of selection and further increases load, resulting in a positive feedback that may drive entire populations to extinction. Here, we investigate this eco-evolutionary feedback in a metapopulation consisting of local demes connected via migration, with individuals subject to deleterious mutation at a large number of loci. We first analyze the determinants of load under soft selection, where population sizes are fixed, and then build on this to understand hard selection, where population sizes and load coevolve. We show that under soft selection, very little gene flow (less than one migrant per generation) is enough to prevent fixation of deleterious alleles. By contrast, much higher levels of migration are required to mitigate load and prevent extinction when selection is hard, with critical migration thresholds for metapopulation persistence increasing sharply as the genome-wide deleterious mutation rate becomes comparable to the baseline population growth rate. Moreover, critical migration thresholds are highest if deleterious mutations have intermediate selection coefficients but lower if alleles are predominantly recessive rather than additive (due to more efficient purging of recessive load within local populations). Our analysis is based on a combination of analytical approximations and simulations, allowing for a more comprehensive understanding of the factors influencing load and extinction in fragmented populations."}],"citation":{"ieee":"O. O. Olusanya, K. Khudiakova, and H. Sachdeva, “Genetic load, eco-evolutionary feedback, and extinction in metapopulations,” <i>The American Naturalist</i>, vol. 205, no. 6. University of Chicago Press, pp. 617–636, 2025.","ama":"Olusanya OO, Khudiakova K, Sachdeva H. Genetic load, eco-evolutionary feedback, and extinction in metapopulations. <i>The American Naturalist</i>. 2025;205(6):617-636. doi:<a href=\"https://doi.org/10.1086/735562\">10.1086/735562</a>","apa":"Olusanya, O. O., Khudiakova, K., &#38; Sachdeva, H. (2025). Genetic load, eco-evolutionary feedback, and extinction in metapopulations. <i>The American Naturalist</i>. University of Chicago Press. <a href=\"https://doi.org/10.1086/735562\">https://doi.org/10.1086/735562</a>","chicago":"Olusanya, Oluwafunmilola O, Kseniia Khudiakova, and Himani Sachdeva. “Genetic Load, Eco-Evolutionary Feedback, and Extinction in Metapopulations.” <i>The American Naturalist</i>. University of Chicago Press, 2025. <a href=\"https://doi.org/10.1086/735562\">https://doi.org/10.1086/735562</a>.","mla":"Olusanya, Oluwafunmilola O., et al. “Genetic Load, Eco-Evolutionary Feedback, and Extinction in Metapopulations.” <i>The American Naturalist</i>, vol. 205, no. 6, University of Chicago Press, 2025, pp. 617–36, doi:<a href=\"https://doi.org/10.1086/735562\">10.1086/735562</a>.","short":"O.O. Olusanya, K. Khudiakova, H. Sachdeva, The American Naturalist 205 (2025) 617–636.","ista":"Olusanya OO, Khudiakova K, Sachdeva H. 2025. Genetic load, eco-evolutionary feedback, and extinction in metapopulations. The American Naturalist. 205(6), 617–636."},"scopus_import":"1","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2023.12.02.569702"}],"publisher":"University of Chicago Press","OA_type":"green","related_material":{"record":[{"id":"14732","relation":"earlier_version","status":"public"}]},"status":"public","type":"journal_article","publication_identifier":{"eissn":["1537-5323"],"issn":["0003-0147"]},"volume":205,"article_processing_charge":"No","date_published":"2025-06-01T00:00:00Z","acknowledgement":"This research was partially funded by the Austrian Science Fund (FWF P-32896B) and DOC Fellowships of the Austrian Academy of Sciences: grants 26380 (O.O.) and 26293 (K.K.). We thank Nick Barton for useful comments on the chapter in O.O.’s thesis that led to this article.","title":"Genetic load, eco-evolutionary feedback, and extinction in metapopulations","quality_controlled":"1","date_updated":"2026-04-07T08:45:14Z","external_id":{"pmid":["40446297 "]},"month":"06","pmid":1,"_id":"21322","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","issue":"6","department":[{"_id":"JaMa"},{"_id":"NiBa"}],"page":"617-636","day":"01","publication":"The American Naturalist","OA_place":"repository","corr_author":"1","year":"2025","article_type":"original","date_created":"2026-02-18T10:47:18Z","language":[{"iso":"eng"}],"author":[{"id":"41AD96DC-F248-11E8-B48F-1D18A9856A87","full_name":"Olusanya, Oluwafunmilola O","first_name":"Oluwafunmilola O","last_name":"Olusanya","orcid":"0000-0003-1971-8314"},{"last_name":"Khudiakova","first_name":"Kseniia","orcid":"0000-0002-6246-1465","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","full_name":"Khudiakova, Kseniia"},{"first_name":"Himani","last_name":"Sachdeva","full_name":"Sachdeva, Himani","id":"42377A0A-F248-11E8-B48F-1D18A9856A87"}],"intvolume":"       205","publication_status":"published","oa":1,"doi":"10.1086/735562","project":[{"name":"Causes and consequences of population fragmentation","grant_number":"P32896","_id":"c08d3278-5a5b-11eb-8a69-fdb09b55f4b8"},{"name":"Polygenic Adaptation in a Metapopulation","_id":"34c872fe-11ca-11ed-8bc3-8534b82131e6","grant_number":"26380"},{"name":"The impact of deleterious mutations on small populations","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","grant_number":"26293"}]},{"page":"584-616","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21323","conference":{"name":"CRYPTO: International Cryptology Conference","end_date":"2025-08-221","start_date":"2025-08-17","location":"Santa Barbara, CA, United States"},"department":[{"_id":"KrPi"}],"publication":"45th Annual International Cryptology Conference","OA_place":"repository","day":"17","alternative_title":["LNCS"],"date_created":"2026-02-18T10:59:58Z","year":"2025","intvolume":"     16005","oa":1,"publication_status":"published","doi":"10.1007/978-3-032-01887-8_19","language":[{"iso":"eng"}],"author":[{"full_name":"Belohorec, Juraj","last_name":"Belohorec","first_name":"Juraj"},{"full_name":"Dvořák, Pavel","first_name":"Pavel","last_name":"Dvořák"},{"id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","full_name":"Hoffmann, Charlotte","first_name":"Charlotte","last_name":"Hoffmann","orcid":"0000-0003-2027-5549"},{"full_name":"Hubáček, Pavel","last_name":"Hubáček","first_name":"Pavel"},{"full_name":"Mašková, Kristýna","first_name":"Kristýna","last_name":"Mašková"},{"full_name":"Pastyřík, Martin","first_name":"Martin","last_name":"Pastyřík"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/514"}],"publisher":"Springer Nature","citation":{"mla":"Belohorec, Juraj, et al. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” <i>45th Annual International Cryptology Conference</i>, vol. 16005, Springer Nature, 2025, pp. 584–616, doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>.","ista":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. 2025. On extractability of the KZG family of polynomial commitment schemes. 45th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16005, 584–616.","short":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, M. Pastyřík, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 584–616.","apa":"Belohorec, J., Dvořák, P., Hoffmann, C., Hubáček, P., Mašková, K., &#38; Pastyřík, M. (2025). On extractability of the KZG family of polynomial commitment schemes. In <i>45th Annual International Cryptology Conference</i> (Vol. 16005, pp. 584–616). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>","chicago":"Belohorec, Juraj, Pavel Dvořák, Charlotte Hoffmann, Pavel Hubáček, Kristýna Mašková, and Martin Pastyřík. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” In <i>45th Annual International Cryptology Conference</i>, 16005:584–616. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>.","ama":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. On extractability of the KZG family of polynomial commitment schemes. In: <i>45th Annual International Cryptology Conference</i>. Vol 16005. Springer Nature; 2025:584-616. doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>","ieee":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, and M. Pastyřík, “On extractability of the KZG family of polynomial commitment schemes,” in <i>45th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2025, vol. 16005, pp. 584–616."},"abstract":[{"text":"We present a unifying framework for proving the knowledge-soundness of KZG-like polynomial commitment schemes, encompassing both univariate and multivariate variants. By conceptualizing the proof technique of Lipmaa, Parisella, and Siim for the univariate KZG scheme (EUROCRYPT 2024), we present tools and falsifiable hardness assumptions that permit black-box extraction of the multivariate KZG scheme. Central to our approach is the notion of a canonical Proof-of-Knowledge of a Polynomial (PoKoP) of a polynomial commitment scheme, which we use to capture the extractability notion required in constructions of practical zk-SNARKs. We further present an explicit polynomial decomposition lemma for multivariate polynomials, enabling a more direct analysis of interpolating extractors and bridging the gap between univariate and multivariate commitments. Our results provide the first standard-model proofs of extractability for the multivariate KZG scheme and many of its variants under falsifiable assumptions.","lang":"eng"}],"oa_version":"Preprint","status":"public","type":"conference","publication_identifier":{"eisbn":["9783032018878"],"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783032018861"]},"OA_type":"green","article_processing_charge":"No","date_published":"2025-08-17T00:00:00Z","acknowledgement":"Juraj Belohorec, Pavel Hubáček, and Kristýna Mašková were partially supported by the Academy of Sciences of the Czech Republic (RVO 67985840), Czech Science Foundation GAČR grant No. 25-16311S, and by Zircuit. Pavel Dvořák was supported by Czech Science Foundation GAČR grant No. 22-14872O. Juraj Belohorec and Kristýna Mašková were supported by the grant SVV–2025–260822.","title":"On extractability of the KZG family of polynomial commitment schemes","volume":16005,"month":"08","quality_controlled":"1","date_updated":"2026-02-19T07:50:33Z"},{"year":"2025","alternative_title":["PMLR"],"date_created":"2026-02-18T11:58:00Z","author":[{"id":"ca726dda-de17-11ea-bc14-f9da834f63aa","full_name":"Bombari, Simone","first_name":"Simone","last_name":"Bombari"},{"last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco"}],"ddc":["000"],"language":[{"iso":"eng"}],"file_date_updated":"2026-02-19T08:04:38Z","intvolume":"       267","file":[{"date_updated":"2026-02-19T08:04:38Z","content_type":"application/pdf","relation":"main_file","file_size":887526,"access_level":"open_access","file_name":"2025_ICML_Bombari.pdf","checksum":"d4ba4f7717b362ca38878f45e57bd643","creator":"dernst","file_id":"21335","success":1,"date_created":"2026-02-19T08:04:38Z"}],"project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","grant_number":"101161364"},{"_id":"92099302-16d5-11f0-9cad-f9a785f54fbd","name":"Trustworthy Deep Learning Theory: Private Over-Parameterized Models and Robust LLMs"}],"publication_status":"published","oa":1,"department":[{"_id":"MaMo"}],"conference":{"end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13","location":"Vancouver, Canada"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"21324","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"page":"4839-4873","day":"30","publication":"Proceedings of the 42nd International Conference on Machine Learning","OA_place":"publisher","corr_author":"1","volume":267,"acknowledgement":"Marco Mondelli is funded by the European Union (ERC, INF2, project number 101161364). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. Simone Bombari is supported by a Google PhD fellowship. The authors would like to thank GuanWen Qiu for helpful discussions.","date_published":"2025-07-30T00:00:00Z","arxiv":1,"article_processing_charge":"No","title":"Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization","quality_controlled":"1","date_updated":"2026-02-19T08:08:55Z","external_id":{"arxiv":["2502.01347"]},"month":"07","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Learning models have been shown to rely on spurious correlations between non-predictive features and the associated labels in the training data, with negative implications on robustness, bias and fairness. In this work, we provide a statistical characterization of this phenomenon for high-dimensional regression, when the data contains a predictive core feature x and a spurious feature y. Specifically, we quantify the amount of spurious correlations C learned via linear regression, in terms of the data covariance and the strength λ of the ridge regularization. As a consequence, we first capture the simplicity of y through the spectrum of its covariance, and its correlation with x through the Schur complement of the full data covariance. Next, we prove a trade-off between C and the in-distribution test loss L, by showing that the value of λ that minimizes L lies in an interval where C is increasing. Finally, we investigate the effects of over-parameterization via the random features model, by showing its equivalence to regularized linear regression. Our theoretical results are supported by numerical experiments on Gaussian, Color-MNIST, and CIFAR-10 datasets."}],"citation":{"apa":"Bombari, S., &#38; Mondelli, M. (2025). Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 4839–4873). Vancouver, Canada: ML Research Press.","chicago":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:4839–73. ML Research Press, 2025.","mla":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 4839–73.","ista":"Bombari S, Mondelli M. 2025. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 4839–4873.","short":"S. Bombari, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 4839–4873.","ieee":"S. Bombari and M. Mondelli, “Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 4839–4873.","ama":"Bombari S, Mondelli M. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:4839-4873."},"publisher":"ML Research Press","OA_type":"gold","status":"public","publication_identifier":{"eissn":["2640-3498"]},"type":"conference"}]