[{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Balancing stability and flexibility when reshaping archaeal membranes","year":"2025","external_id":{"pmid":["41056191 "]},"file_date_updated":"2026-02-17T13:02:02Z","DOAJ_listed":"1","PlanS_conform":"1","date_published":"2025-10-07T00:00:00Z","_id":"21251","intvolume":"        14","language":[{"iso":"eng"}],"volume":14,"OA_place":"publisher","file":[{"date_updated":"2026-02-17T13:02:02Z","relation":"main_file","file_id":"21305","success":1,"file_name":"2025_elife_Amaral.pdf","file_size":10668225,"content_type":"application/pdf","date_created":"2026-02-17T13:02:02Z","access_level":"open_access","creator":"dernst","checksum":"4116cd5143558ded995fb9ff5fcbc7e0"}],"month":"10","article_type":"original","article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-16T15:43:57Z","type":"journal_article","pmid":1,"quality_controlled":"1","ec_funded":1,"citation":{"chicago":"Santana de Freitas Amaral, Miguel, Felix F Frey, Xiuyun Jiang, Buzz Baum, and Anđela Šarić. “Balancing Stability and Flexibility When Reshaping Archaeal Membranes.” <i>ELife</i>. eLife Sciences Publications, 2025. <a href=\"https://doi.org/10.7554/elife.105432\">https://doi.org/10.7554/elife.105432</a>.","ista":"Santana de Freitas Amaral M, Frey FF, Jiang X, Baum B, Šarić A. 2025. Balancing stability and flexibility when reshaping archaeal membranes. eLife. 14, 105432.","ieee":"M. Santana de Freitas Amaral, F. F. Frey, X. Jiang, B. Baum, and A. Šarić, “Balancing stability and flexibility when reshaping archaeal membranes,” <i>eLife</i>, vol. 14. eLife Sciences Publications, 2025.","apa":"Santana de Freitas Amaral, M., Frey, F. F., Jiang, X., Baum, B., &#38; Šarić, A. (2025). Balancing stability and flexibility when reshaping archaeal membranes. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.105432\">https://doi.org/10.7554/elife.105432</a>","short":"M. Santana de Freitas Amaral, F.F. Frey, X. Jiang, B. Baum, A. Šarić, ELife 14 (2025).","ama":"Santana de Freitas Amaral M, Frey FF, Jiang X, Baum B, Šarić A. Balancing stability and flexibility when reshaping archaeal membranes. <i>eLife</i>. 2025;14. doi:<a href=\"https://doi.org/10.7554/elife.105432\">10.7554/elife.105432</a>","mla":"Santana de Freitas Amaral, Miguel, et al. “Balancing Stability and Flexibility When Reshaping Archaeal Membranes.” <i>ELife</i>, vol. 14, 105432, eLife Sciences Publications, 2025, doi:<a href=\"https://doi.org/10.7554/elife.105432\">10.7554/elife.105432</a>."},"publisher":"eLife Sciences Publications","related_material":{"record":[{"status":"public","id":"21304","relation":"software"}]},"author":[{"last_name":"Santana de Freitas Amaral","id":"4f2d02dd-47a9-11ec-ad10-82820ed3f501","full_name":"Santana de Freitas Amaral, Miguel","first_name":"Miguel"},{"orcid":"0000-0001-8501-6017","id":"a0270b37-8f1a-11ec-95c7-8e710c59a4f3","last_name":"Frey","full_name":"Frey, Felix F","first_name":"Felix F"},{"last_name":"Jiang","full_name":"Jiang, Xiuyun","first_name":"Xiuyun"},{"last_name":"Baum","full_name":"Baum, Buzz","first_name":"Buzz"},{"full_name":"Šarić, Anđela","first_name":"Anđela","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","last_name":"Šarić","orcid":"0000-0002-7854-2139"}],"date_updated":"2026-02-23T11:49:05Z","project":[{"grant_number":"802960","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","call_identifier":"H2020"}],"oa":1,"acknowledgement":"MA, BB, and AŠ acknowledge funding by the Volkswagen Foundation Grant Az 96727. FF acknowledges financial support by the NOMIS foundation. AŠ acknowledges funding by ERC Starting Grant 'NEPA' 802960. We thank Claudia Flandoli for her help with illustrations.","status":"public","OA_type":"gold","publication_identifier":{"eissn":["2050-084X"]},"publication":"eLife","department":[{"_id":"AnSa"}],"article_number":"105432","doi":"10.7554/elife.105432","has_accepted_license":"1","day":"07","abstract":[{"text":"Cellular membranes differ across the tree of life. In most bacteria and eukaryotes, single-headed lipids self-assemble into flexible bilayer membranes. By contrast, thermophilic archaea tend to possess bilayer lipids together with double-headed, monolayer spanning bolalipids, which are thought to enable cells to survive in harsh environments. Here, using a minimal computational model for bolalipid membranes, we explore the trade-offs at play when forming membranes. We find that flexible bolalipids form membranes that resemble bilayer membranes because they are able to assume a U-shaped conformation. Conversely, rigid bolalipids, which resemble the bolalipids with cyclic groups found in thermophilic archaea, take on a straight conformation and form membranes that are stiff and prone to pore formation when they undergo changes in shape. Strikingly, however, the inclusion of small amounts of bilayer lipids in a bolalipid membrane is enough to achieve fluid bolalipid membranes that are both stable and flexible, resolving this trade-off. Our study suggests a mechanism by which archaea can tune the material properties of their membranes as and when required to enable them to survive in harsh environments and to undergo essential membrane remodelling events like cell division.","lang":"eng"}],"corr_author":"1","ddc":["570"],"publication_status":"published","oa_version":"Published Version"},{"file":[{"content_type":"application/pdf","file_size":7161755,"date_created":"2026-02-17T13:07:45Z","creator":"dernst","access_level":"open_access","checksum":"b8a0927307c1d82025bcb5af47b20b26","relation":"main_file","date_updated":"2026-02-17T13:07:45Z","file_id":"21306","success":1,"file_name":"2025_AstronomyAstrophysics_Bessila.pdf"}],"month":"08","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","date_created":"2026-02-16T15:46:59Z","type":"journal_article","intvolume":"       700","language":[{"iso":"eng"}],"volume":700,"OA_place":"publisher","DOAJ_listed":"1","date_published":"2025-08-01T00:00:00Z","PlanS_conform":"1","_id":"21252","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators","year":"2025","file_date_updated":"2026-02-17T13:07:45Z","abstract":[{"text":"Context. Recent observational results from asteroseismic studies show that an important fraction of solar-like stars do not present detectable stochastically excited acoustic oscillations. This non-detectability seems to correlate with a high rotation rate in the convective envelope and a high surface magnetic activity. At the same time, the properties of stellar convection are affected by rotation and magnetism.\r\nAims. We investigate the role of rotation in the excitation of acoustic modes in the convective envelope of solar-like stars, to evaluate its impact on the energy injected in the oscillations.\r\nMethods. We derived theoretical prescriptions for the excitation of acoustic waves in the convective envelope of rotating solar-like stars. We adopted the rotating mixing-length Theory to model the influence of rotation on convection. We used the MESA stellar evolution code and the GYRE stellar oscillation code to estimate the power injected in the oscillations from our theoretical prescriptions.\r\nResults. We demonstrate that the power injected in the acoustic modes is insensitive to rotation if a Gaussian time-correlation function is assumed, while it can decrease by up to 60% for a Lorentzian time-correlation function, for a 20 Ω⊙ rotation rate. We show that the modification of the excitation rate by rotation depends not only on the rotation rate but also on the radial and angular orders of the considered oscillation mode. This result can allow for better constraints on the properties of stellar convection by studying observationally acoustic mode excitation.\r\nConclusions. These results demonstrate how important it is to take into account the modification of stellar convection by rotation when evaluating the amplitude of the stellar oscillations it stochastically excites. They open the path for understanding the large variety of observed acoustic-mode amplitudes at the surface of solar-like stars as a function of surface rotation rates.","lang":"eng"}],"publication_status":"published","ddc":["520"],"oa_version":"Published Version","department":[{"_id":"LiBu"}],"doi":"10.1051/0004-6361/202452093","article_number":"A25","day":"01","has_accepted_license":"1","oa":1,"acknowledgement":"The authors thank the referee for detailed comments that allow them to improve their work. The authors thank Jordan Philidet and Kevin Belkacem for fruitful discussions. L.B. and Stéphane M. acknowledge support from the European Research Council (ERC) under the Horizon Europe program (Synergy Grant agreement 101071505: 4D-STAR), from the CNES SOHO-GOLF and PLATO grants at CEA-DAp, and from PNPS (CNRS/INSU). While partially funded by the European Union, views and opinions expressed are however those of the author only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. Savita M. acknowledges support from the Spanish Ministry of Science and Innovation with the grant no. PID2019-107061GB-C66 and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023 (CEX2019-000920-S).","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"OA_type":"gold","status":"public","publication":"Astronomy & Astrophysics","quality_controlled":"1","publisher":"EDP Sciences","citation":{"mla":"Bessila, L., et al. “The Impact of Rotation on the Stochastic Excitation of Stellar Acoustic Modes in Solar-like Pulsators.” <i>Astronomy &#38; Astrophysics</i>, vol. 700, A25, EDP Sciences, 2025, doi:<a href=\"https://doi.org/10.1051/0004-6361/202452093\">10.1051/0004-6361/202452093</a>.","ama":"Bessila L, Deckx van Ruys A, Buriasco V, et al. The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators. <i>Astronomy &#38; Astrophysics</i>. 2025;700. doi:<a href=\"https://doi.org/10.1051/0004-6361/202452093\">10.1051/0004-6361/202452093</a>","short":"L. Bessila, A. Deckx van Ruys, V. Buriasco, S. Mathis, L.A. Bugnet, R.A. García, S. Mathur, Astronomy &#38; Astrophysics 700 (2025).","apa":"Bessila, L., Deckx van Ruys, A., Buriasco, V., Mathis, S., Bugnet, L. A., García, R. A., &#38; Mathur, S. (2025). The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202452093\">https://doi.org/10.1051/0004-6361/202452093</a>","ieee":"L. Bessila <i>et al.</i>, “The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators,” <i>Astronomy &#38; Astrophysics</i>, vol. 700. EDP Sciences, 2025.","chicago":"Bessila, L., A. Deckx van Ruys, V. Buriasco, S. Mathis, Lisa Annabelle Bugnet, R. A. García, and S. Mathur. “The Impact of Rotation on the Stochastic Excitation of Stellar Acoustic Modes in Solar-like Pulsators.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2025. <a href=\"https://doi.org/10.1051/0004-6361/202452093\">https://doi.org/10.1051/0004-6361/202452093</a>.","ista":"Bessila L, Deckx van Ruys A, Buriasco V, Mathis S, Bugnet LA, García RA, Mathur S. 2025. The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators. Astronomy &#38; Astrophysics. 700, A25."},"date_updated":"2026-02-17T13:10:18Z","author":[{"last_name":"Bessila","full_name":"Bessila, L.","first_name":"L."},{"last_name":"Deckx van Ruys","full_name":"Deckx van Ruys, A.","first_name":"A."},{"full_name":"Buriasco, V.","first_name":"V.","last_name":"Buriasco"},{"last_name":"Mathis","first_name":"S.","full_name":"Mathis, S."},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle"},{"first_name":"R. A.","full_name":"García, R. A.","last_name":"García"},{"last_name":"Mathur","full_name":"Mathur, S.","first_name":"S."}]},{"_id":"21253","date_published":"2025-12-01T00:00:00Z","external_id":{"arxiv":["2306.13201"]},"year":"2025","title":"Decomposition of geometric graphs into star-forests","arxiv":1,"type":"journal_article","date_created":"2026-02-16T15:48:42Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","article_type":"original","month":"12","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.13201","open_access":"1"}],"OA_place":"repository","volume":129,"language":[{"iso":"eng"}],"intvolume":"       129","publication":"Computational Geometry","publication_identifier":{"issn":["0925-7721"]},"status":"public","OA_type":"green","oa":1,"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.","author":[{"last_name":"Pach","first_name":"János","full_name":"Pach, János"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","last_name":"Saghafian"},{"full_name":"Schnider, Patrick","first_name":"Patrick","last_name":"Schnider"}],"date_updated":"2026-04-16T09:12:36Z","publisher":"Elsevier","related_material":{"record":[{"relation":"earlier_version","id":"15012","status":"public"}]},"citation":{"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>","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.","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","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>.","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>"},"quality_controlled":"1","oa_version":"Preprint","publication_status":"published","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"}],"corr_author":"1","day":"01","doi":"10.1016/j.comgeo.2025.102186","article_number":"102186","department":[{"_id":"HeEd"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"doi":"10.1016/b978-0-443-15719-6.00015-5","day":"02","abstract":[{"lang":"eng","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."}],"month":"05","page":"299-322","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"None","date_created":"2026-02-16T15:53:52Z","type":"book_chapter","title":"Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling","editor":[{"last_name":"Irving","full_name":"Irving, Helen","first_name":"Helen"},{"full_name":"Gehring, Chris","first_name":"Chris","last_name":"Gehring"},{"full_name":"Wong, Aloysius","first_name":"Aloysius","last_name":"Wong"}],"year":"2025","quality_controlled":"1","citation":{"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>","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>.","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.","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.","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>.","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>","short":"L. Qi, J. Friml, in:, H. Irving, C. Gehring, A. Wong (Eds.), Cryptic Enzymes and Moonlighting Proteins, Elsevier, 2025, pp. 299–322."},"publisher":"Elsevier","author":[{"first_name":"Linlin","full_name":"Qi, Linlin","last_name":"Qi"},{"first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","last_name":"Friml"}],"date_updated":"2026-02-17T13:28:38Z","OA_type":"closed access","status":"public","publication_identifier":{"isbn":["9780443157196"]},"alternative_title":["Foundations and Frontiers in Enzymology"],"publication":"Cryptic Enzymes and Moonlighting Proteins","scopus_import":"1","date_published":"2025-05-02T00:00:00Z","_id":"21255"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Nonequilibrium remodeling of collagen IV networks in Silico","year":"2025","file_date_updated":"2026-02-17T13:36:01Z","DOAJ_listed":"1","date_published":"2025-09-05T00:00:00Z","PlanS_conform":"1","_id":"21256","language":[{"iso":"eng"}],"intvolume":"         3","volume":3,"OA_place":"publisher","month":"09","article_type":"original","file":[{"file_size":2277704,"content_type":"application/pdf","creator":"dernst","date_created":"2026-02-17T13:36:01Z","access_level":"open_access","checksum":"04cae5231d97e533145c493880fadbd9","date_updated":"2026-02-17T13:36:01Z","relation":"main_file","success":1,"file_id":"21308","file_name":"2025_PRXLife_Meadowcroft.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","date_created":"2026-02-16T15:55:03Z","type":"journal_article","ec_funded":1,"quality_controlled":"1","citation":{"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>.","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>","short":"B. Meadowcroft, V. Sorichetti, E. Ratajczyk, F.L. Perez Verdugo, N. Khalilgharibi, Y. Mao, I. Palaia, A. Šarić, PRX Life 3 (2025).","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>.","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.","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."},"publisher":"American Physical Society","project":[{"call_identifier":"H2020","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","grant_number":"802960","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e"},{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"},{"name":"EMBO Young Investigator Program - Andela Saric","_id":"349b6ff1-11ca-11ed-8bc3-f006047c2eeb"}],"date_updated":"2026-02-17T13:37:38Z","author":[{"orcid":"0000-0003-3441-1337","last_name":"Meadowcroft","id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","first_name":"Billie","full_name":"Meadowcroft, Billie"},{"id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b","orcid":"0000-0002-9645-6576","last_name":"Sorichetti","first_name":"Valerio","full_name":"Sorichetti, Valerio"},{"full_name":"Ratajczyk, Eryk","first_name":"Eryk","last_name":"Ratajczyk"},{"last_name":"Perez Verdugo","id":"4ecec223-9070-11ef-a0a9-bc76077bea8d","full_name":"Perez Verdugo, Fernanda L","first_name":"Fernanda L"},{"last_name":"Khalilgharibi","full_name":"Khalilgharibi, Nargess","first_name":"Nargess"},{"last_name":"Mao","first_name":"Yanlan","full_name":"Mao, Yanlan"},{"orcid":" 0000-0002-8843-9485 ","id":"9c805cd2-4b75-11ec-a374-db6dd0ed57fa","last_name":"Palaia","full_name":"Palaia, Ivan","first_name":"Ivan"},{"last_name":"Šarić","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","orcid":"0000-0002-7854-2139","first_name":"Anđela","full_name":"Šarić, Anđela"}],"oa":1,"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.Š.).","publication_identifier":{"eissn":["2835-8279"]},"status":"public","OA_type":"gold","publication":"PRX Life","department":[{"_id":"AnSa"}],"doi":"10.1103/gdd5-rnh7","article_number":"033019","day":"05","has_accepted_license":"1","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"}],"corr_author":"1","publication_status":"published","ddc":["570"],"oa_version":"Published Version"},{"oa_version":"Preprint","publication_status":"published","page":"83-97","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"}],"corr_author":"1","day":"05","doi":"10.1007/978-3-031-85747-8_6","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publication":"Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques","alternative_title":["Machine Translation: Technologies and Applications"],"publication_identifier":{"issn":["2522-8021"],"eissn":["2522-803X"],"isbn":["9783031857461"],"eisbn":["9783031857478"]},"OA_type":"green","status":"public","oa":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.","author":[{"first_name":"Eldar","full_name":"Kurtic, Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"last_name":"Kuznedelev","first_name":"Denis","full_name":"Kuznedelev, Denis"},{"first_name":"Elias","full_name":"Frantar, Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar"},{"last_name":"Goinv","full_name":"Goinv, Michael","first_name":"Michael"},{"first_name":"Shubhra","full_name":"Pandit, Shubhra","last_name":"Pandit"},{"full_name":"Agarwalla, Abhinav","first_name":"Abhinav","last_name":"Agarwalla"},{"last_name":"Nguyen","first_name":"Tuan","full_name":"Nguyen, Tuan"},{"last_name":"Marques","first_name":"Alexandre","full_name":"Marques, Alexandre"},{"full_name":"Kurtz, Mark","first_name":"Mark","last_name":"Kurtz"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"date_updated":"2026-02-19T09:26:54Z","citation":{"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>.","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.","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.","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>","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.","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>","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>."},"publisher":"Springer Nature","quality_controlled":"1","type":"book_chapter","date_created":"2026-02-16T15:57:53Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.06927","open_access":"1"}],"OA_place":"repository","language":[{"iso":"eng"}],"_id":"21257","date_published":"2025-07-05T00:00:00Z","external_id":{"arxiv":["2310.06927"]},"year":"2025","editor":[{"full_name":"Passban, Peyman","first_name":"Peyman","last_name":"Passban"},{"last_name":"Way","first_name":"Andy","full_name":"Way, Andy"},{"full_name":"Rezagholizadeh, Mehdi","first_name":"Mehdi","last_name":"Rezagholizadeh"}],"title":"Sparse Fine-Tuning for Inference Acceleration of Large Language Models","arxiv":1},{"corr_author":"1","abstract":[{"lang":"eng","text":"We prove that there does not exist F∈Q[x,y] of degree 4 such that F(Z^2 )=Z ≥0. In particular, this answers a question by John S. Lew and Bjorn Poonen for quartic polynomials."}],"publication_status":"epub_ahead","ddc":["500"],"oa_version":"Published Version","department":[{"_id":"TiBr"}],"doi":"10.4171/jems/1697","day":"06","oa":1,"acknowledgement":"The first author would like to thank Samir Siksek for introducing the problem\r\nto him. The material in Section 6 is a result of discussing with many people, and the second author is very grateful to Tim Browning, Stephanie Chan, Jakob Glas, Jakub Löwit, Mirko Mauri, Marta Pieropan, Mike Roth, Matteo Verzobio and Victor Wang for taking the time to answer his questions and for their valuable suggestions. We thank Tim Browning, Yijie Diao, Ana Marija Vego and the anonymous referee for their helpful comments.\r\nThe first author was supported by NSERC Discovery Grant RGPIN-2024-06810. The\r\nsecond author was supported by the NWO Veni Grant 016.Veni.192.047 during his time at\r\nUtrecht University and by a FWF grant (DOI 10.55776/P32428) at the Institute of Science and\r\nTechnology Austria while working on this paper.","publication_identifier":{"eissn":["1435-9863"],"issn":["1435-9855"]},"status":"public","OA_type":"diamond","publication":"Journal of the European Mathematical Society","quality_controlled":"1","citation":{"chicago":"Yao Xiao, Stanley, and Shuntaro Yamagishi. “Quartic Polynomials in Two Variables Do Not Represent All Non-Negative Integers.” <i>Journal of the European Mathematical Society</i>. EMS Press, 2025. <a href=\"https://doi.org/10.4171/jems/1697\">https://doi.org/10.4171/jems/1697</a>.","ista":"Yao Xiao S, Yamagishi S. 2025. Quartic polynomials in two variables do not represent all non-negative integers. Journal of the European Mathematical Society.","ieee":"S. Yao Xiao and S. Yamagishi, “Quartic polynomials in two variables do not represent all non-negative integers,” <i>Journal of the European Mathematical Society</i>. EMS Press, 2025.","apa":"Yao Xiao, S., &#38; Yamagishi, S. (2025). Quartic polynomials in two variables do not represent all non-negative integers. <i>Journal of the European Mathematical Society</i>. EMS Press. <a href=\"https://doi.org/10.4171/jems/1697\">https://doi.org/10.4171/jems/1697</a>","short":"S. Yao Xiao, S. Yamagishi, Journal of the European Mathematical Society (2025).","ama":"Yao Xiao S, Yamagishi S. Quartic polynomials in two variables do not represent all non-negative integers. <i>Journal of the European Mathematical Society</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jems/1697\">10.4171/jems/1697</a>","mla":"Yao Xiao, Stanley, and Shuntaro Yamagishi. “Quartic Polynomials in Two Variables Do Not Represent All Non-Negative Integers.” <i>Journal of the European Mathematical Society</i>, EMS Press, 2025, doi:<a href=\"https://doi.org/10.4171/jems/1697\">10.4171/jems/1697</a>."},"publisher":"EMS Press","project":[{"_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","name":"New frontiers of the Manin conjecture","grant_number":"P32428","call_identifier":"FWF"}],"date_updated":"2026-06-18T18:31:24Z","author":[{"last_name":"Yao Xiao","first_name":"Stanley","full_name":"Yao Xiao, Stanley"},{"first_name":"Shuntaro","full_name":"Yamagishi, Shuntaro","id":"0c3fbc5c-f7a6-11ec-8d70-9485e75b416b","last_name":"Yamagishi"}],"article_type":"original","month":"08","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-16T16:00:02Z","type":"journal_article","language":[{"iso":"eng"}],"OA_place":"publisher","main_file_link":[{"url":"https://doi.org/10.4171/JEMS/1697","open_access":"1"}],"date_published":"2025-08-06T00:00:00Z","_id":"21260","title":"Quartic polynomials in two variables do not represent all non-negative integers","arxiv":1,"year":"2025","external_id":{"arxiv":["2307.05712"]}},{"year":"2025","title":"Continuous group-key agreement: Concurrent updates without pruning","_id":"21262","date_published":"2025-08-17T00:00:00Z","volume":16007,"intvolume":"     16007","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://eprint.iacr.org/2025/1035","open_access":"1"}],"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"08","type":"conference","date_created":"2026-02-17T07:41:04Z","quality_controlled":"1","date_updated":"2026-02-18T07:36:42Z","author":[{"full_name":"Auerbach, Benedikt","first_name":"Benedikt","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","orcid":"0000-0002-7553-6606","last_name":"Auerbach"},{"last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","first_name":"Miguel"},{"last_name":"Erol","first_name":"Boran","full_name":"Erol, Boran"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"citation":{"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>","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>.","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.","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>.","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.","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>","short":"B. Auerbach, M. Cueto Noval, B. Erol, K.Z. Pietrzak, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 141–172."},"publisher":"Springer Nature","OA_type":"green","status":"public","publication_identifier":{"isbn":["9783032019127"],"eissn":["1611-3349"],"issn":["0302-9743"],"eisbn":["9783032019134"]},"oa":1,"acknowledgement":"B. Auerbach and B. Erol—Conducted part of this work at ISTA.","alternative_title":["LNCS"],"publication":"45th Annual International Cryptology Conference","conference":{"location":"Santa Barbara, CA, United States","name":"CRYPTO: International Cryptology Conference","start_date":"2025-08-17","end_date":"2025-08-21"},"department":[{"_id":"KrPi"}],"day":"17","doi":"10.1007/978-3-032-01913-4_5","publication_status":"published","abstract":[{"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.","lang":"eng"}],"page":"141-172","oa_version":"Preprint"},{"arxiv":1,"title":"The exact rank of sparse random graphs","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2025","external_id":{"arxiv":["2303.05435"]},"DOAJ_listed":"1","PlanS_conform":"1","date_published":"2025-09-02T00:00:00Z","_id":"21263","language":[{"iso":"eng"}],"OA_place":"publisher","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4171/JEMS/1692"}],"article_type":"original","month":"09","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-17T07:41:59Z","type":"journal_article","quality_controlled":"1","publisher":"European Mathematical Society Press","citation":{"ista":"Glasgow M, Kwan MA, Sah A, Sawhney M. 2025. The exact rank of sparse random graphs. Journal of the European Mathematical Society.","ieee":"M. Glasgow, M. A. Kwan, A. Sah, and M. Sawhney, “The exact rank of sparse random graphs,” <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press, 2025.","chicago":"Glasgow, Margalit, Matthew Alan Kwan, Ashwin Sah, and Mehtaab Sawhney. “The Exact Rank of Sparse Random Graphs.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press, 2025. <a href=\"https://doi.org/10.4171/jems/1692\">https://doi.org/10.4171/jems/1692</a>.","apa":"Glasgow, M., Kwan, M. A., Sah, A., &#38; Sawhney, M. (2025). The exact rank of sparse random graphs. <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press. <a href=\"https://doi.org/10.4171/jems/1692\">https://doi.org/10.4171/jems/1692</a>","short":"M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the European Mathematical Society (2025).","ama":"Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs. <i>Journal of the European Mathematical Society</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jems/1692\">10.4171/jems/1692</a>","mla":"Glasgow, Margalit, et al. “The Exact Rank of Sparse Random Graphs.” <i>Journal of the European Mathematical Society</i>, European Mathematical Society Press, 2025, doi:<a href=\"https://doi.org/10.4171/jems/1692\">10.4171/jems/1692</a>."},"project":[{"grant_number":"101076777","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","name":"Randomness and structure in combinatorics"}],"author":[{"first_name":"Margalit","full_name":"Glasgow, Margalit","last_name":"Glasgow"},{"full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","last_name":"Kwan"},{"last_name":"Sah","first_name":"Ashwin","full_name":"Sah, Ashwin"},{"last_name":"Sawhney","full_name":"Sawhney, Mehtaab","first_name":"Mehtaab"}],"date_updated":"2026-02-23T10:44:41Z","oa":1,"acknowledgement":"We would like to thank Noga Alon for suggesting that our main result gives\r\na linear-time algorithm for computing the rank. We also thank the referees for a number of thoughtful comments and suggestions. Glasgow was supported by NSF graduate research fellowship program award DGE1656518. Kwan was supported by ERC Starting Grant “RANDSTRUCT” No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship Program DGE-1745302.\r\n","status":"public","OA_type":"diamond","publication_identifier":{"eissn":["1435-9863"],"issn":["1435-9855"]},"publication":"Journal of the European Mathematical Society","department":[{"_id":"MaKw"}],"doi":"10.4171/jems/1692","day":"02","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Two landmark results in combinatorial random matrix theory, due to Komlós and Costello–Tao–Vu, show that discrete random matrices and symmetric discrete random matrices are typically nonsingular. In particular, in the language of graph theory, when p is a fixed constant, the biadjacency matrix of a random Erdős–Rényi bipartite graph G(n,n,p) and the adjacency matrix of an Erdős–Rényi random graph G(n,p) are both nonsingular with high probability. However, very sparse random graphs (i.e., where p is allowed to decay rapidly with n) are typically singular, due to the presence of “local” dependencies such as isolated vertices and pairs of degree-1 vertices with the same neighbour. In this paper, we give a combinatorial description of the rank of a sparse random graph G(n,n,c/n) or G(n,c/n) in terms of such local dependencies, for all constants c=e (and we present some evidence that the situation is very different for c=e). This gives an essentially complete answer to a question raised by Vu (2014). As applications of our main theorem and its proof, we also determine the asymptotic singularity probability of the 2-core of a sparse random graph, we show that the rank of a sparse random graph is extremely well approximated by its matching number, and we deduce a central limit theorem for the rank of G(n,c/n)."}],"corr_author":"1","ddc":["510"],"publication_status":"epub_ahead","oa_version":"Published Version"},{"language":[{"iso":"eng"}],"OA_place":"publisher","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/ar.70051"}],"article_type":"original","month":"09","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-17T07:44:23Z","type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice","year":"2025","external_id":{"pmid":["40923214"]},"date_published":"2025-09-09T00:00:00Z","_id":"21264","department":[{"_id":"MaJö"}],"article_number":"ar.70051","doi":"10.1002/ar.70051","day":"09","has_accepted_license":"1","abstract":[{"lang":"eng","text":"Rodents' ability to encode the whisking phase has been extensively documented through neuronal recordings from ascending sensory pathways. Yet, while indicating that reafference originates from the mechanoreceptors, the mechanistic underpinnings of the whisking phase encoding within the follicle remain unclear. Here we present anatomical, histological, and biomechanical evidence for the presence of a distinctive elastic segment (ES) within the basal part of the whisker shaft inside the follicle. This ES, composed of immature keratin, is capable of both bending and twisting. Forces generated by whisker movement deform this segment, causing whisker shaft deflections that can stimulate specific mechanoreceptor subsets within the follicle at different phases of the whisking cycle. This mechanism appears to operate during both free‐air whisking and object contact. We propose that the ES enables torsion‐based mechanoreceptor activation, allowing encoding of the whisking phase."}],"ddc":["570"],"publication_status":"epub_ahead","oa_version":"Published Version","pmid":1,"quality_controlled":"1","citation":{"apa":"Haidarliu, S., Nelinger, G., Gantar, L., Ahissar, E., &#38; Saraf‐Sinik, I. (2025). An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. <i>The Anatomical Record</i>. Wiley. <a href=\"https://doi.org/10.1002/ar.70051\">https://doi.org/10.1002/ar.70051</a>","short":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, I. Saraf‐Sinik, The Anatomical Record (2025).","ista":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. 2025. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. The Anatomical Record., ar. 70051.","ieee":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, and I. Saraf‐Sinik, “An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice,” <i>The Anatomical Record</i>. Wiley, 2025.","chicago":"Haidarliu, Sebastian, Guy Nelinger, Luka Gantar, Ehud Ahissar, and Inbar Saraf‐Sinik. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” <i>The Anatomical Record</i>. Wiley, 2025. <a href=\"https://doi.org/10.1002/ar.70051\">https://doi.org/10.1002/ar.70051</a>.","mla":"Haidarliu, Sebastian, et al. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” <i>The Anatomical Record</i>, ar. 70051, Wiley, 2025, doi:<a href=\"https://doi.org/10.1002/ar.70051\">10.1002/ar.70051</a>.","ama":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. <i>The Anatomical Record</i>. 2025. doi:<a href=\"https://doi.org/10.1002/ar.70051\">10.1002/ar.70051</a>"},"publisher":"Wiley","date_updated":"2026-02-23T10:50:27Z","author":[{"last_name":"Haidarliu","first_name":"Sebastian","full_name":"Haidarliu, Sebastian"},{"full_name":"Nelinger, Guy","first_name":"Guy","last_name":"Nelinger"},{"first_name":"Luka","full_name":"Gantar, Luka","last_name":"Gantar","id":"ed7c4564-13aa-11f0-9846-960f9afb2ddb"},{"last_name":"Ahissar","first_name":"Ehud","full_name":"Ahissar, Ehud"},{"first_name":"Inbar","full_name":"Saraf‐Sinik, Inbar","last_name":"Saraf‐Sinik"}],"acknowledgement":"The authors wish to express their gratitude to Prof. Menahem Segal and Dr. Yonatan Katz for their helpful comments and discussions. The United States-Israel Binational Science Foundation (BSF, grant no. 2021327); The European Research Council (ERC) under the EU Horizon 2020 Research and Innovation Programme (grant no. 786949); the Israel Science Foundation (ISF, grant no. 2237/20); The Weizmann-UK Collaboration and a research grant from the Estate of Thomas Gruen.","oa":1,"status":"public","OA_type":"hybrid","publication_identifier":{"issn":["1932-8486"],"eissn":["1932-8494"]},"publication":"The Anatomical Record","scopus_import":"1"},{"_id":"21265","date_published":"2025-09-01T00:00:00Z","external_id":{"arxiv":["2405.04094"]},"year":"2025","title":"Harper’s beyond square-root conjecture","arxiv":1,"type":"journal_article","date_created":"2026-02-17T07:45:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"09","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.04094"}],"OA_place":"repository","issue":"18","volume":2025,"language":[{"iso":"eng"}],"intvolume":"      2025","publication":"International Mathematics Research Notices","scopus_import":"1","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"status":"public","OA_type":"green","oa":1,"acknowledgement":"The first author is supported by the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 101034413. The second author is supported by a Simons Junior Fellowship from Simons Foundation. We thank Paul Bourgade and Kannan Soundararajan for discussions on random matrices and probability, Alexandra Florea for helpful comments on the Ratios Conjecture, and Joni Teräväinen for providing several references. We are also grateful to Alexandra Florea, Adam Harper, Joni Teräväinen, and the referee for helpful comments on earlier drafts.","author":[{"first_name":"Victor","full_name":"Wang, Victor","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9","orcid":"0000-0002-0704-7026","last_name":"Wang"},{"last_name":"Xu","full_name":"Xu, Max Wenqiang","first_name":"Max Wenqiang"}],"date_updated":"2026-02-18T07:41:56Z","project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"publisher":"Oxford University Press","citation":{"mla":"Wang, Victor, and Max Wenqiang Xu. “Harper’s beyond Square-Root Conjecture.” <i>International Mathematics Research Notices</i>, vol. 2025, no. 18, rnaf279, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/imrn/rnaf279\">10.1093/imrn/rnaf279</a>.","ama":"Wang V, Xu MW. Harper’s beyond square-root conjecture. <i>International Mathematics Research Notices</i>. 2025;2025(18). doi:<a href=\"https://doi.org/10.1093/imrn/rnaf279\">10.1093/imrn/rnaf279</a>","apa":"Wang, V., &#38; Xu, M. W. (2025). Harper’s beyond square-root conjecture. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnaf279\">https://doi.org/10.1093/imrn/rnaf279</a>","short":"V. Wang, M.W. Xu, International Mathematics Research Notices 2025 (2025).","chicago":"Wang, Victor, and Max Wenqiang Xu. “Harper’s beyond Square-Root Conjecture.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/imrn/rnaf279\">https://doi.org/10.1093/imrn/rnaf279</a>.","ista":"Wang V, Xu MW. 2025. Harper’s beyond square-root conjecture. International Mathematics Research Notices. 2025(18), rnaf279.","ieee":"V. Wang and M. W. Xu, “Harper’s beyond square-root conjecture,” <i>International Mathematics Research Notices</i>, vol. 2025, no. 18. Oxford University Press, 2025."},"ec_funded":1,"quality_controlled":"1","oa_version":"Preprint","publication_status":"published","abstract":[{"text":"We explain how the (shifted) Ratios Conjecture for $L(s,\\chi )$ would extend a randomization argument of Harper from a conductor-limited range to an unlimited range of “beyond square-root cancellation” for character twists of the Liouville function. As a corollary, the Liouville function would have nontrivial cancellation in arithmetic progressions of modulus just exceeding the well-known square-root barrier. Morally, the paper passes from random matrices to random multiplicative functions.","lang":"eng"}],"day":"01","doi":"10.1093/imrn/rnaf279","article_number":"rnaf279","department":[{"_id":"TiBr"}]},{"arxiv":1,"title":"Almost all quadratic twists of an elliptic curve have no integral points","year":"2025","external_id":{"arxiv":["2401.04375"]},"DOAJ_listed":"1","date_published":"2025-09-17T00:00:00Z","_id":"21266","language":[{"iso":"eng"}],"OA_place":"publisher","main_file_link":[{"url":"https://doi.org/10.4171/JEMS/1704","open_access":"1"}],"month":"09","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","date_created":"2026-02-17T07:46:26Z","type":"journal_article","quality_controlled":"1","publisher":"European Mathematical Society Press","citation":{"ama":"Browning TD, Chan S. Almost all quadratic twists of an elliptic curve have no integral points. <i>Journal of the European Mathematical Society</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jems/1704\">10.4171/jems/1704</a>","mla":"Browning, Timothy D., and Stephanie Chan. “Almost All Quadratic Twists of an Elliptic Curve Have No Integral Points.” <i>Journal of the European Mathematical Society</i>, European Mathematical Society Press, 2025, doi:<a href=\"https://doi.org/10.4171/jems/1704\">10.4171/jems/1704</a>.","chicago":"Browning, Timothy D, and Stephanie Chan. “Almost All Quadratic Twists of an Elliptic Curve Have No Integral Points.” <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press, 2025. <a href=\"https://doi.org/10.4171/jems/1704\">https://doi.org/10.4171/jems/1704</a>.","ieee":"T. D. Browning and S. Chan, “Almost all quadratic twists of an elliptic curve have no integral points,” <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press, 2025.","ista":"Browning TD, Chan S. 2025. Almost all quadratic twists of an elliptic curve have no integral points. Journal of the European Mathematical Society.","apa":"Browning, T. D., &#38; Chan, S. (2025). Almost all quadratic twists of an elliptic curve have no integral points. <i>Journal of the European Mathematical Society</i>. European Mathematical Society Press. <a href=\"https://doi.org/10.4171/jems/1704\">https://doi.org/10.4171/jems/1704</a>","short":"T.D. Browning, S. Chan, Journal of the European Mathematical Society (2025)."},"date_updated":"2026-06-18T18:31:51Z","project":[{"grant_number":"P36278","name":"Rational curves via function field analytic number theory","_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3"}],"author":[{"full_name":"Browning, Timothy D","first_name":"Timothy D","orcid":"0000-0002-8314-0177","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"id":"c4c0afc8-9262-11ed-9231-d8b0bc743af1","orcid":"0000-0001-8467-4106","last_name":"Chan","full_name":"Chan, Yik Tung","first_name":"Yik Tung"}],"oa":1,"acknowledgement":"The authors are grateful to Roger Heath-Brown and to the anonymous referees for useful comments. The first author was supported by an FWF grant (DOI 10.55776/P36278).","OA_type":"diamond","status":"public","publication_identifier":{"issn":["1435-9855"],"eissn":["1435-9863"]},"publication":"Journal of the European Mathematical Society","department":[{"_id":"TiBr"}],"doi":"10.4171/jems/1704","day":"17","abstract":[{"text":"For a given elliptic curve E in short Weierstrass form, we show that almost all quadratic twists E \r\nD have no integral points, as D ranges over square-free integers ordered by size. Our result is conditional on a weak form of the Hall–Lang conjecture in the case that E has partial 2-torsion. The proof uses a correspondence of Mordell and the reduction theory of binary quartic forms in order to transfer the problem to counting rational points of bounded height on a certain singular cubic surface, together with extensive use of cancellation in character sum estimates, drawn from Heath-Brown’s analysis of Selmer group statistics for the congruent number curve.","lang":"eng"}],"corr_author":"1","ddc":["510"],"publication_status":"epub_ahead","oa_version":"Published Version"},{"file_date_updated":"2026-02-18T07:50:56Z","external_id":{"arxiv":["2504.15960"]},"year":"2025","arxiv":1,"title":"The value problem for multiple-environment MDPs with parity objective","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"21268","date_published":"2025-07-30T00:00:00Z","OA_place":"publisher","language":[{"iso":"eng"}],"type":"conference","date_created":"2026-02-17T07:49:17Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"4477a7fd4fbf0ba6c8e9b15683b5a6b8","file_size":1075724,"content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2026-02-18T07:50:56Z","file_name":"2025_LIPIcs_Chatterjee.pdf","date_updated":"2026-02-18T07:50:56Z","relation":"main_file","file_id":"21313","success":1}],"month":"07","date_updated":"2026-02-18T07:53:26Z","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","full_name":"Doyen, Laurent","first_name":"Laurent"},{"last_name":"Raskin","full_name":"Raskin, Jean-Francois","first_name":"Jean-Francois"},{"last_name":"Sankur","full_name":"Sankur, Ocan","first_name":"Ocan"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","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>","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>.","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.","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>"},"ec_funded":1,"quality_controlled":"1","alternative_title":["LIPIcs"],"scopus_import":"1","publication":"52nd International Colloquium on Automata, Languages, and Programming","OA_type":"gold","status":"public","publication_identifier":{"isbn":["9783959773720"]},"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).","oa":1,"day":"30","has_accepted_license":"1","article_number":"150","doi":"10.4230/LIPIcs.ICALP.2025.150","conference":{"start_date":"2025-07-08","end_date":"2025-07-11","location":"Aarhus, Denmark","name":"ICALP: Automata, Languages and Programming"},"department":[{"_id":"KrCh"}],"oa_version":"Published Version","ddc":["000"],"publication_status":"published","abstract":[{"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.","lang":"eng"}],"corr_author":"1"},{"external_id":{"arxiv":["2409.14425"]},"file_date_updated":"2026-02-18T07:57:39Z","arxiv":1,"title":"bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2025","PlanS_conform":"1","date_published":"2025-10-21T00:00:00Z","_id":"21269","DOAJ_listed":"1","OA_place":"publisher","issue":"4","language":[{"iso":"eng"}],"intvolume":"         3","volume":3,"date_created":"2026-02-17T07:53:01Z","type":"journal_article","file":[{"checksum":"76ddfee3efdb4c9d085059b5a142ed78","date_created":"2026-02-18T07:57:39Z","creator":"dernst","access_level":"open_access","file_size":1888053,"content_type":"application/pdf","file_name":"2025_PRXLife_Zhang.pdf","file_id":"21314","success":1,"date_updated":"2026-02-18T07:57:39Z","relation":"main_file"}],"article_type":"original","month":"10","article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","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.","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>","short":"C.Y. Zhang, A. Rosa, G. Sanguinetti, PRX Life 3 (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>","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>."},"publisher":"American Physical Society","author":[{"first_name":"Chen Y","full_name":"Zhang, Chen Y","id":"81b43fb8-c9d5-11ef-bf68-ade532a1f204","last_name":"Zhang"},{"last_name":"Rosa","first_name":"Angelo","full_name":"Rosa, Angelo"},{"last_name":"Sanguinetti","first_name":"Guido","full_name":"Sanguinetti, Guido"}],"date_updated":"2026-02-18T08:01:00Z","quality_controlled":"1","publication":"PRX Life","oa":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.","status":"public","OA_type":"gold","publication_identifier":{"issn":["2835-8279"]},"article_number":"043006","doi":"10.1103/gy1p-4256","has_accepted_license":"1","day":"21","department":[{"_id":"GaTk"}],"oa_version":"Published Version","corr_author":"1","abstract":[{"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.","lang":"eng"}],"ddc":["570"],"publication_status":"published"},{"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.","oa":1,"publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"status":"public","OA_type":"green","scopus_import":"1","publication":"Physical Review B","quality_controlled":"1","publisher":"American Physical Society","citation":{"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>","short":"J. Taylor, M. Čufar, D.J. Mitrouskas, R. Seiringer, E. Pahl, J. Brand, Physical Review B 112 (2025).","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.","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>.","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>.","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>"},"author":[{"first_name":"J.","full_name":"Taylor, J.","last_name":"Taylor"},{"full_name":"Čufar, M.","first_name":"M.","last_name":"Čufar"},{"first_name":"David Johannes","full_name":"Mitrouskas, David Johannes","id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas"},{"full_name":"Seiringer, Robert","first_name":"Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Pahl, E.","first_name":"E.","last_name":"Pahl"},{"first_name":"J.","full_name":"Brand, J.","last_name":"Brand"}],"date_updated":"2026-02-18T08:23:59Z","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."}],"publication_status":"published","oa_version":"Preprint","department":[{"_id":"RoSe"}],"doi":"10.1103/s9p9-jflq","article_number":"184312","day":"18","date_published":"2025-11-18T00:00:00Z","_id":"21270","title":"Bound excited states of Fröhlich polarons in one dimension","arxiv":1,"year":"2025","external_id":{"arxiv":["2506.02440 "]},"month":"11","article_type":"original","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-17T07:56:20Z","type":"journal_article","language":[{"iso":"eng"}],"intvolume":"       112","volume":112,"issue":"18","OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2506.02440 "}]},{"date_published":"2025-11-01T00:00:00Z","_id":"21271","external_id":{"arxiv":["2404.17512"]},"title":"On the spectral edge of non-Hermitian random matrices","arxiv":1,"year":"2025","date_created":"2026-02-17T07:58:20Z","type":"journal_article","month":"11","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","issue":"6","OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.17512","open_access":"1"}],"intvolume":"        53","language":[{"iso":"eng"}],"volume":53,"publication":"The Annals of Probability","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.","oa":1,"publication_identifier":{"issn":["0091-1798"],"eissn":["2168-894X"]},"status":"public","OA_type":"green","citation":{"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>","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>.","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>.","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.","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.","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>","short":"A.J. Campbell, G. Cipolloni, L. Erdös, H.C. Ji, The Annals of Probability 53 (2025) 2256–2308."},"publisher":"Institute of Mathematical Statistics","project":[{"grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","name":"Random matrices beyond Wigner-Dyson-Mehta","call_identifier":"H2020"}],"author":[{"last_name":"Campbell","id":"582b06a9-1f1c-11ee-b076-82ffce00dde4","first_name":"Andrew J","full_name":"Campbell, Andrew J"},{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio"},{"last_name":"Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László","first_name":"László"},{"last_name":"Ji","id":"dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d","first_name":"Hong Chang","full_name":"Ji, Hong Chang"}],"date_updated":"2026-02-18T08:35:38Z","quality_controlled":"1","ec_funded":1,"oa_version":"Preprint","page":"2256-2308","corr_author":"1","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."}],"publication_status":"published","doi":"10.1214/25-aop1761","day":"01","department":[{"_id":"LaEr"}]},{"type":"conference","date_created":"2026-02-17T08:00:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","month":"09","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2508.10656"}],"OA_place":"repository","language":[{"iso":"eng"}],"_id":"21272","date_published":"2025-09-01T00:00:00Z","external_id":{"arxiv":["2508.10656"]},"year":"2025","arxiv":1,"title":"Quantum-guided cluster algorithms for combinatorial optimization","oa_version":"Preprint","publication_status":"published","corr_author":"1","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"}],"day":"01","doi":"10.1109/qce65121.2025.00033","conference":{"end_date":"2025-09-05","start_date":"2025-08-30","location":"Albuquerque, NM, United States","name":"QCE: International Conference on Quantum Computing and Engineering"},"department":[{"_id":"MaSe"}],"publication":"2025 IEEE International Conference on Quantum Computing and Engineering","status":"public","OA_type":"green","publication_identifier":{"eisbn":["9798331557362"]},"acknowledgement":"P.J.E was partially funded by the German BMWK project QCHALLenge (Grant No. 01MQ22008B).\r\n","oa":1,"author":[{"first_name":"Peter J.","full_name":"Eder, Peter J.","last_name":"Eder"},{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","last_name":"Kerschbaumer","orcid":"0009-0002-2370-8661","full_name":"Kerschbaumer, Aron","first_name":"Aron"},{"full_name":"Finžgar, Jernej Rudi","first_name":"Jernej Rudi","last_name":"Finžgar"},{"first_name":"Raimel A","full_name":"Medina Ramos, Raimel A","last_name":"Medina Ramos","orcid":"0000-0002-5383-2869","id":"CE680B90-D85A-11E9-B684-C920E6697425"},{"last_name":"Schuetz","first_name":"Martin J. A.","full_name":"Schuetz, Martin J. A."},{"full_name":"Katzgraber, Helmut G.","first_name":"Helmut G.","last_name":"Katzgraber"},{"first_name":"Sarah","full_name":"Braun, Sarah","last_name":"Braun"},{"full_name":"Mendl, Christian B.","first_name":"Christian B.","last_name":"Mendl"}],"date_updated":"2026-02-18T08:45:56Z","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.","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>.","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.","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>","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.","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>","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>."},"publisher":"IEEE","quality_controlled":"1"},{"doi":"10.4230/lipics.icalp.2025.91","has_accepted_license":"1","day":"30","department":[{"_id":"MoHe"}],"conference":{"location":"Aarhus, Denmark","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11","start_date":"2025-07-08"},"oa_version":"Published Version","corr_author":"1","abstract":[{"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.","lang":"eng"}],"page":"91:1-91:20","ddc":["000"],"publication_status":"published","citation":{"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>","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.","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.","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>.","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>","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."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz","first_name":"Gramoz"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"},{"full_name":"Sricharan, A.","first_name":"A.","last_name":"Sricharan"}],"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","call_identifier":"H2020"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982","name":"Static and Dynamic Hierarchical Graph Decompositions"},{"grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer"}],"date_updated":"2026-02-18T09:06:12Z","quality_controlled":"1","ec_funded":1,"alternative_title":["LIPIcs"],"publication":"52nd International Colloquium on Automata, Languages, and Programming","scopus_import":"1","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.","oa":1,"status":"public","OA_type":"gold","publication_identifier":{"isbn":["9783959773720"]},"OA_place":"publisher","language":[{"iso":"eng"}],"intvolume":"       334","volume":334,"date_created":"2026-02-17T08:26:06Z","type":"conference","month":"06","file":[{"file_name":"2025_ICALP_Goranci.pdf","success":1,"file_id":"21315","date_updated":"2026-02-18T09:02:33Z","relation":"main_file","checksum":"c178cf554e44204b9f64ebd9b54cf7ba","creator":"dernst","date_created":"2026-02-18T09:02:33Z","access_level":"open_access","file_size":944824,"content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","external_id":{"arxiv":["2502.09105"]},"file_date_updated":"2026-02-18T09:02:33Z","arxiv":1,"title":"Incremental approximate maximum flow via residual graph sparsification","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2025","date_published":"2025-06-30T00:00:00Z","_id":"21280"},{"department":[{"_id":"KrCh"},{"_id":"GradSch"}],"conference":{"name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","location":"Pilani, India","start_date":"2025-12-17","end_date":"2025-12-19"},"doi":"10.4230/lipics.fsttcs.2025.9","has_accepted_license":"1","day":"09","page":"9:1-9:17","corr_author":"1","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"}],"publication_status":"published","ddc":["000"],"oa_version":"Published Version","ec_funded":1,"quality_controlled":"1","citation":{"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>.","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>","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>","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.","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.","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.","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>."},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"author":[{"first_name":"Ali","full_name":"Asadi, Ali","last_name":"Asadi","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb"},{"first_name":"Leonard","full_name":"Brice, Leonard","last_name":"Brice"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"full_name":"Thejaswini, K. S.","first_name":"K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","last_name":"Thejaswini"}],"date_updated":"2026-02-19T09:39:15Z","oa":1,"acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n","publication_identifier":{"isbn":["9783959774062"]},"status":"public","OA_type":"gold","publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"intvolume":"       360","volume":360,"OA_place":"publisher","month":"12","file":[{"checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","file_size":1054007,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2026-02-18T09:13:25Z","file_name":"2025_FSTTCS_Asadi.pdf","date_updated":"2026-02-18T09:13:25Z","relation":"main_file","file_id":"21316","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes","date_created":"2026-02-17T08:27:14Z","type":"conference","title":"ε-stationary Nash equilibria in multi-player stochastic graph games","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"arxiv":1,"year":"2025","external_id":{"arxiv":["2508.15356"]},"file_date_updated":"2026-02-18T09:13:25Z","date_published":"2025-12-09T00:00:00Z","_id":"21281"},{"author":[{"first_name":"J.","full_name":"Vandersnickt, J.","last_name":"Vandersnickt"},{"full_name":"Armenta, R. Ochoa","first_name":"R. Ochoa","last_name":"Armenta"},{"full_name":"Vanlaer, V.","first_name":"V.","last_name":"Vanlaer"},{"last_name":"A. David-Uraz","full_name":"A. David-Uraz, A. David-Uraz","first_name":"A. David-Uraz"},{"last_name":"Aerts","full_name":"Aerts, C.","first_name":"C."},{"first_name":"S. B.","full_name":"Das, S. B.","last_name":"Das"},{"full_name":"Bouret, J. -C.","first_name":"J. -C.","last_name":"Bouret"},{"last_name":"Bowman","full_name":"Bowman, D. M.","first_name":"D. M."},{"last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle"},{"last_name":"Khalack","first_name":"V.","full_name":"Khalack, V."},{"last_name":"J. Labadie-Bartz","full_name":"J. Labadie-Bartz, J. Labadie-Bartz","first_name":"J. Labadie-Bartz"},{"full_name":"Mathis, S.","first_name":"S.","last_name":"Mathis"},{"last_name":"Nazé","first_name":"Y.","full_name":"Nazé, Y."},{"last_name":"Neiner","full_name":"Neiner, C.","first_name":"C."},{"first_name":"P.","full_name":"Petit, P.","last_name":"Petit"},{"last_name":"Petit","first_name":"V.","full_name":"Petit, V."},{"last_name":"K. Thomson-Paressant","full_name":"K. Thomson-Paressant, K. Thomson-Paressant","first_name":"K. Thomson-Paressant"},{"last_name":"Doorsselaere","full_name":"Doorsselaere, T. Van","first_name":"T. Van"},{"last_name":"Vanrespaille","full_name":"Vanrespaille, M.","first_name":"M."}],"date_updated":"2026-04-07T06:00:40Z","external_id":{"arxiv":["2512.15170"]},"citation":{"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>.","ieee":"J. Vandersnickt <i>et al.</i>, “Expanding stellar horizons with polarized light,” <i>arXiv</i>. .","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.","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>","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.).","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>","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>."},"year":"2025","arxiv":1,"title":"Expanding stellar horizons with polarized light","_id":"21309","publication":"arXiv","date_published":"2025-12-17T00:00:00Z","OA_type":"green","status":"public","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.15170"}],"day":"17","article_number":"2512.15170","OA_place":"repository","doi":"10.48550/arXiv.2512.15170","language":[{"iso":"eng"}],"department":[{"_id":"LiBu"}],"type":"preprint","oa_version":"Preprint","date_created":"2026-02-17T13:53:50Z","article_processing_charge":"No","publication_status":"submitted","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","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."}],"month":"12"}]