[{"publication_identifier":{"eisbn":["9798331555573"]},"date_updated":"2026-05-05T11:52:57Z","date_published":"2025-07-30T00:00:00Z","title":"RACS-SADL: Robust and understandable randomized consensus in the cloud","month":"07","oa":1,"abstract":[{"lang":"eng","text":"Widely deployed consensus protocols in the cloud are often leader-based and optimized for low latency under synchronous network conditions. However, cloud networks can experience disruptions such as network partitions, high-loss links, and configuration errors. These disruptions interfere with the operation of leader-based protocols, as their view change mechanisms interrupt the normal case replication and cause the system to stall. We propose RACS, a novel randomized consensus protocol that ensures robustness against adversarial network conditions. RACS achieves optimal one-round trip latency under synchronous network conditions while remaining resilient to adversarial network conditions. RACS follows a simple design inspired by Raft, the most widely used consensus protocol in the cloud, and therefore enables seamless integration with the existing cloud software stack. Experiments with a prototype running on Amazon EC2 show that RACS achieves 28k cmd/sec throughput, ninefold higher than Raft under adversarial cloud network conditions. Under synchronous network conditions, RACS matches the performance of Multi-Paxos and Raft, achieving a throughput of 200k cmd/sec with a median latency of 300ms, confirming that RACS introduces no unnecessary overhead. Finally, SADL-RACS, a throughput-optimized version of RACS, achieves a throughput of 500k cmd/sec, delivering 150 percent higher throughput than Raft."}],"conference":{"location":"Helsinki, Finland","end_date":"2025-07-12","start_date":"2025-07-07","name":"CLOUD: Conference on Cloud Computing"},"arxiv":1,"doi":"10.1109/cloud67622.2025.00044","publication_status":"published","type":"conference","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.04183","open_access":"1"}],"oa_version":"Preprint","publisher":"IEEE","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"article_processing_charge":"No","OA_place":"repository","scopus_import":"1","department":[{"_id":"ElKo"}],"external_id":{"arxiv":["2404.04183"]},"quality_controlled":"1","citation":{"ista":"Tennage P, Desjardins A, Kokoris Kogias E. 2025. RACS-SADL: Robust and understandable randomized consensus in the cloud. 2025 IEEE 18th International Conference on Cloud Computing. CLOUD: Conference on Cloud Computing.","chicago":"Tennage, Pasindu, Antoine Desjardins, and Eleftherios Kokoris Kogias. “RACS-SADL: Robust and Understandable Randomized Consensus in the Cloud.” In <i>2025 IEEE 18th International Conference on Cloud Computing</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/cloud67622.2025.00044\">https://doi.org/10.1109/cloud67622.2025.00044</a>.","short":"P. Tennage, A. Desjardins, E. Kokoris Kogias, in:, 2025 IEEE 18th International Conference on Cloud Computing, IEEE, 2025.","apa":"Tennage, P., Desjardins, A., &#38; Kokoris Kogias, E. (2025). RACS-SADL: Robust and understandable randomized consensus in the cloud. In <i>2025 IEEE 18th International Conference on Cloud Computing</i>. Helsinki, Finland: IEEE. <a href=\"https://doi.org/10.1109/cloud67622.2025.00044\">https://doi.org/10.1109/cloud67622.2025.00044</a>","ieee":"P. Tennage, A. Desjardins, and E. Kokoris Kogias, “RACS-SADL: Robust and understandable randomized consensus in the cloud,” in <i>2025 IEEE 18th International Conference on Cloud Computing</i>, Helsinki, Finland, 2025.","mla":"Tennage, Pasindu, et al. “RACS-SADL: Robust and Understandable Randomized Consensus in the Cloud.” <i>2025 IEEE 18th International Conference on Cloud Computing</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/cloud67622.2025.00044\">10.1109/cloud67622.2025.00044</a>.","ama":"Tennage P, Desjardins A, Kokoris Kogias E. RACS-SADL: Robust and understandable randomized consensus in the cloud. In: <i>2025 IEEE 18th International Conference on Cloud Computing</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/cloud67622.2025.00044\">10.1109/cloud67622.2025.00044</a>"},"publication":"2025 IEEE 18th International Conference on Cloud Computing","status":"public","OA_type":"green","_id":"21243","author":[{"last_name":"Tennage","full_name":"Tennage, Pasindu","first_name":"Pasindu"},{"full_name":"Desjardins, Antoine","first_name":"Antoine","last_name":"Desjardins","id":"06d0c166-aec1-11ee-a7c0-b96e840a602b"},{"orcid":"0000-0002-8827-3382","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30"}],"date_created":"2026-02-16T15:21:27Z","corr_author":"1","day":"30"},{"volume":19,"date_created":"2026-02-16T15:22:19Z","author":[{"orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","first_name":"Timothy D","last_name":"Browning","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Lyczak","full_name":"Lyczak, Julian","first_name":"Julian"},{"full_name":"Smeets, Arne","first_name":"Arne","last_name":"Smeets"}],"page":"2049-2090","_id":"21244","day":"05","corr_author":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"year":"2025","publisher":"Mathematical Sciences Publishers","issue":"10","OA_place":"publisher","intvolume":"        19","article_processing_charge":"No","acknowledgement":"We are very grateful to Tim Santens for useful conversations and to the anonymous referees for numerous pertinent remarks. While working on this paper, Browning was supported by a FWF grant (DOI 10.55776/P32428), Lyczak was supported by UKRI MR/V021362/1, and Smeets was supported by grant G0B1721N of the Fund for Scientific Research – Flanders.","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"TiBr"}],"status":"public","OA_type":"diamond","publication":"Algebra & Number Theory","quality_controlled":"1","citation":{"apa":"Browning, T. D., Lyczak, J., &#38; Smeets, A. (2025). Paucity of rational points on fibrations with multiple fibres. <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/ant.2025.19.2049\">https://doi.org/10.2140/ant.2025.19.2049</a>","short":"T.D. Browning, J. Lyczak, A. Smeets, Algebra &#38; Number Theory 19 (2025) 2049–2090.","ista":"Browning TD, Lyczak J, Smeets A. 2025. Paucity of rational points on fibrations with multiple fibres. Algebra &#38; Number Theory. 19(10), 2049–2090.","chicago":"Browning, Timothy D, Julian Lyczak, and Arne Smeets. “Paucity of Rational Points on Fibrations with Multiple Fibres.” <i>Algebra &#38; Number Theory</i>. Mathematical Sciences Publishers, 2025. <a href=\"https://doi.org/10.2140/ant.2025.19.2049\">https://doi.org/10.2140/ant.2025.19.2049</a>.","ama":"Browning TD, Lyczak J, Smeets A. Paucity of rational points on fibrations with multiple fibres. <i>Algebra &#38; Number Theory</i>. 2025;19(10):2049-2090. doi:<a href=\"https://doi.org/10.2140/ant.2025.19.2049\">10.2140/ant.2025.19.2049</a>","ieee":"T. D. Browning, J. Lyczak, and A. Smeets, “Paucity of rational points on fibrations with multiple fibres,” <i>Algebra &#38; Number Theory</i>, vol. 19, no. 10. Mathematical Sciences Publishers, pp. 2049–2090, 2025.","mla":"Browning, Timothy D., et al. “Paucity of Rational Points on Fibrations with Multiple Fibres.” <i>Algebra &#38; Number Theory</i>, vol. 19, no. 10, Mathematical Sciences Publishers, 2025, pp. 2049–90, doi:<a href=\"https://doi.org/10.2140/ant.2025.19.2049\">10.2140/ant.2025.19.2049</a>."},"external_id":{"arxiv":["2310.01135"]},"ddc":["510"],"project":[{"name":"New frontiers of the Manin conjecture","_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","grant_number":"P32428","call_identifier":"FWF"}],"publication_status":"published","doi":"10.2140/ant.2025.19.2049","file_date_updated":"2026-02-17T11:56:20Z","has_accepted_license":"1","arxiv":1,"PlanS_conform":"1","oa_version":"Published Version","type":"journal_article","license":"https://creativecommons.org/licenses/by/4.0/","title":"Paucity of rational points on fibrations with multiple fibres","article_type":"original","date_published":"2025-09-05T00:00:00Z","publication_identifier":{"issn":["1937-0652"],"eissn":["1944-7833"]},"date_updated":"2026-02-17T11:59:57Z","file":[{"file_id":"21300","date_updated":"2026-02-17T11:56:20Z","content_type":"application/pdf","file_name":"2025_AlgebraNumberTheory_Browning.pdf","date_created":"2026-02-17T11:56:20Z","creator":"dernst","success":1,"relation":"main_file","file_size":1505580,"access_level":"open_access","checksum":"e50a60a4303b81563f7adbcadbe2e986"}],"month":"09","abstract":[{"lang":"eng","text":"Given a family of varieties over the projective line, we study the density of fibres that are everywhere locally soluble in the case that components of higher multiplicity are allowed. We use log geometry to formulate a new sparsity criterion for the existence of everywhere locally soluble fibres and formulate new conjectures that generalise previous work of Loughran and Smeets. These conjectures involve geometric invariants of the associated multiplicity orbifolds on the base of the fibration in the spirit of Campana. We give evidence for the conjectures by providing an assortment of bounds using Chebotarev’s theorem and sieve methods, with most of the evidence involving upper bounds. "}],"oa":1},{"external_id":{"pmid":["41056352 "]},"status":"public","OA_type":"gold","publication":"PLOS One","quality_controlled":"1","citation":{"ama":"Alamalhoda M, Leesch F, Giovanetti F, et al. Exploring neural entrainment and synchrony in response to repeated 60 Hz flickering white light in healthy volunteers. <i>PLOS One</i>. 2025;20(10). doi:<a href=\"https://doi.org/10.1371/journal.pone.0332310\">10.1371/journal.pone.0332310</a>","ieee":"M. Alamalhoda <i>et al.</i>, “Exploring neural entrainment and synchrony in response to repeated 60 Hz flickering white light in healthy volunteers,” <i>PLOS One</i>, vol. 20, no. 10. Public Library of Science, 2025.","mla":"Alamalhoda, MohammadAmin, et al. “Exploring Neural Entrainment and Synchrony in Response to Repeated 60 Hz Flickering White Light in Healthy Volunteers.” <i>PLOS One</i>, vol. 20, no. 10, e0332310, Public Library of Science, 2025, doi:<a href=\"https://doi.org/10.1371/journal.pone.0332310\">10.1371/journal.pone.0332310</a>.","short":"M. Alamalhoda, F. Leesch, F. Giovanetti, E. Dunne, G. Pilloni, M. Caffrey, J. O’Keeffe, A. Venturino, M.T. Ferretti, PLOS One 20 (2025).","apa":"Alamalhoda, M., Leesch, F., Giovanetti, F., Dunne, E., Pilloni, G., Caffrey, M., … Ferretti, M. T. (2025). Exploring neural entrainment and synchrony in response to repeated 60 Hz flickering white light in healthy volunteers. <i>PLOS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0332310\">https://doi.org/10.1371/journal.pone.0332310</a>","chicago":"Alamalhoda, MohammadAmin, Friederike Leesch, Francesca Giovanetti, Eoghan Dunne, Giuseppina Pilloni, Mark Caffrey, Jack O’Keeffe, Alessandro Venturino, and Maria Teresa Ferretti. “Exploring Neural Entrainment and Synchrony in Response to Repeated 60 Hz Flickering White Light in Healthy Volunteers.” <i>PLOS One</i>. Public Library of Science, 2025. <a href=\"https://doi.org/10.1371/journal.pone.0332310\">https://doi.org/10.1371/journal.pone.0332310</a>.","ista":"Alamalhoda M, Leesch F, Giovanetti F, Dunne E, Pilloni G, Caffrey M, O’Keeffe J, Venturino A, Ferretti MT. 2025. Exploring neural entrainment and synchrony in response to repeated 60 Hz flickering white light in healthy volunteers. PLOS One. 20(10), e0332310."},"department":[{"_id":"SaSi"}],"language":[{"iso":"eng"}],"acknowledgement":"This study was funded by Syntropic Medical and supported by an Austria Wirtschaftsservice (AWS) grant (grant number P2414247 to Syntropic Medical). Syntropic Medical employees were involved in study design, data collection and analysis, decision to publish, and preparation of the manuscript. AWS had no role in study design, data collection and analysis, decision to publish, or preparation of the manuscript.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","intvolume":"        20","article_processing_charge":"Yes","article_number":"e0332310","issue":"10","publisher":"Public Library of Science","year":"2025","DOAJ_listed":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"07","author":[{"first_name":"MohammadAmin","full_name":"Alamalhoda, MohammadAmin","last_name":"Alamalhoda"},{"first_name":"Friederike","full_name":"Leesch, Friederike","last_name":"Leesch"},{"full_name":"Giovanetti, Francesca","first_name":"Francesca","last_name":"Giovanetti"},{"first_name":"Eoghan","full_name":"Dunne, Eoghan","last_name":"Dunne"},{"full_name":"Pilloni, Giuseppina","first_name":"Giuseppina","last_name":"Pilloni"},{"last_name":"Caffrey","first_name":"Mark","full_name":"Caffrey, Mark"},{"last_name":"O’Keeffe","first_name":"Jack","full_name":"O’Keeffe, Jack"},{"id":"41CB84B2-F248-11E8-B48F-1D18A9856A87","last_name":"Venturino","orcid":"0000-0003-2356-9403","full_name":"Venturino, Alessandro","first_name":"Alessandro"},{"first_name":"Maria Teresa","full_name":"Ferretti, Maria Teresa","last_name":"Ferretti"}],"_id":"21245","related_material":{"link":[{"url":"https://github.com/AminAlam/HVS","relation":"software"}]},"date_created":"2026-02-16T15:29:26Z","volume":20,"abstract":[{"text":"Flickering light is a new promising, fully non-invasive brain stimulation technique that utilizes intermittent sensory stimulation to induce brainwave synchronization (entrainment). While the effects of 40 Hz externally induced neural entrainment have been extensively described, little is known about 60 Hz entrainment in humans. This study presents preliminary observations on the neural and somatic response to flickering 60 Hz light in healthy volunteers over a 3-week period. Fourteen volunteers were randomized to receive either 60 Hz flickering white light or constant light as sham (30-min sessions, 3 weeks, 5 days/week on weekdays). Neural entrainment was assessed with EEG on days 1, 5 and 19. Salivary cortisol and C-reactive protein (CRP) levels, measured with ELISA, assessed the somatic response to stimulation. Side effects and well-being were monitored via questionnaires. EEG recordings showed neural entrainment and synchrony in response to 60 Hz flickering light across multiple cortical regions, including occipital, central, temporal, and frontal areas. The entrainment power and synchronization between different cortical regions declined significantly by day 19 compared to day 1, indicating possible neural habituation. Cortisol and CRP salivary levels were unchanged, and minor side effects were reported with equal frequency in the active and sham groups. Our findings show that 60 Hz flickering light can induce significant neural entrainment and synchrony in healthy adults and is well tolerated. The decline in entrainment strength and neural synchrony observed with repeated 60 Hz stimulations suggests plastic changes in the cortex. To the best of our knowledge, this is the first study to characterize neural and somatic responses to repeated 60 Hz flickering visual stimuli. Given the well-known connection between 60 Hz brain oscillations and cognition, neuroplasticity, and their role in neuropsychiatric disorders, additional research in both preclinical and clinical settings is warranted.","lang":"eng"}],"oa":1,"file":[{"success":1,"file_size":1388424,"relation":"main_file","access_level":"open_access","checksum":"22a4e92a733152633c4553f107f66765","date_created":"2026-02-17T12:16:18Z","creator":"dernst","file_name":"2025_PlosOne_Alamalhoda.pdf","content_type":"application/pdf","file_id":"21301","date_updated":"2026-02-17T12:16:18Z"}],"month":"10","article_type":"original","date_published":"2025-10-07T00:00:00Z","publication_identifier":{"eissn":["1932-6203"]},"date_updated":"2026-02-17T12:19:15Z","pmid":1,"title":"Exploring neural entrainment and synchrony in response to repeated 60 Hz flickering white light in healthy volunteers","type":"journal_article","oa_version":"Published Version","PlanS_conform":"1","file_date_updated":"2026-02-17T12:16:18Z","doi":"10.1371/journal.pone.0332310","publication_status":"published","has_accepted_license":"1","ddc":["570"]},{"oa_version":"Published Version","type":"journal_article","publication_status":"published","file_date_updated":"2026-02-17T12:32:18Z","doi":"10.3847/1538-4357/ae0cbc","has_accepted_license":"1","PlanS_conform":"1","arxiv":1,"ddc":["520","000"],"oa":1,"abstract":[{"lang":"eng","text":"Stellar astrophysics relies on diverse observational modalities—primarily photometric light curves and spectroscopic data—from which fundamental stellar properties are inferred. While machine learning (ML) has advanced analysis within individual modalities, the complementary information encoded across modalities remains largely underexploited. We present the dual embedding for stellar astronomy (DESA) model, a novel multimodal foundation model that integrates light curves and spectra to learn a unified, physically meaningful latent space for stars. DESA first trains separate modality-specific encoders using a hybrid supervised/self-supervised scheme, and then aligns them through DualFormer, a transformer-based cross-modal integration module tailored for astrophysical data. DualFormer combines cross- and self-attention, a novel dual-projection alignment loss, and a projection-space eigendecomposition that yields physically structured embeddings. We demonstrate that DESA significantly outperforms leading unimodal and self-supervised baselines across a range of tasks. In zero- and few-shot settings, DESA’s learned representations recover stellar color–magnitude and Hertzsprung–Russell diagrams with high fidelity (R2 = 0.92 for photometric regressions). In full fine-tuning, DESA achieves state-of-the-art accuracy for binary star detection (AUC = 0.99, AP = 1.00) and stellar age prediction (RMSE = 0.94 Gyr). As a compelling case, DESA naturally separates synchronized binaries from young stars—two populations with nearly identical light curves—purely from their embedded positions in UMAP space, without requiring external kinematic or luminosity information. DESA thus offers a powerful new framework for multimodal, data-driven stellar population analysis, enabling both accurate prediction and novel discovery."}],"month":"11","file":[{"date_updated":"2026-02-17T12:32:18Z","content_type":"application/pdf","file_id":"21302","file_name":"2025_AstrophysicalJournal_Kamai.pdf","date_created":"2026-02-17T12:32:18Z","creator":"dernst","file_size":16415089,"access_level":"open_access","relation":"main_file","checksum":"255ffd6d664e6c2d1cffbaced650bd10","success":1}],"title":"Machine Learning inference of stellar properties using integrated photometric and spectroscopic data","date_updated":"2026-02-17T12:33:19Z","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"date_published":"2025-11-19T00:00:00Z","article_type":"original","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"19","date_created":"2026-02-16T15:35:29Z","_id":"21246","author":[{"last_name":"Kamai","full_name":"Kamai, Ilay","first_name":"Ilay"},{"last_name":"Bronstein","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","orcid":"0000-0001-9699-8730","full_name":"Bronstein, Alexander","first_name":"Alexander"},{"last_name":"Perets","full_name":"Perets, Hagai B.","first_name":"Hagai B."}],"volume":994,"citation":{"ama":"Kamai I, Bronstein AM, Perets HB. Machine Learning inference of stellar properties using integrated photometric and spectroscopic data. <i>The Astrophysical Journal</i>. 2025;994. doi:<a href=\"https://doi.org/10.3847/1538-4357/ae0cbc\">10.3847/1538-4357/ae0cbc</a>","ieee":"I. Kamai, A. M. Bronstein, and H. B. Perets, “Machine Learning inference of stellar properties using integrated photometric and spectroscopic data,” <i>The Astrophysical Journal</i>, vol. 994. IOP Publishing, 2025.","mla":"Kamai, Ilay, et al. “Machine Learning Inference of Stellar Properties Using Integrated Photometric and Spectroscopic Data.” <i>The Astrophysical Journal</i>, vol. 994, 110, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/1538-4357/ae0cbc\">10.3847/1538-4357/ae0cbc</a>.","short":"I. Kamai, A.M. Bronstein, H.B. Perets, The Astrophysical Journal 994 (2025).","apa":"Kamai, I., Bronstein, A. M., &#38; Perets, H. B. (2025). Machine Learning inference of stellar properties using integrated photometric and spectroscopic data. <i>The Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ae0cbc\">https://doi.org/10.3847/1538-4357/ae0cbc</a>","chicago":"Kamai, Ilay, Alex M. Bronstein, and Hagai B. Perets. “Machine Learning Inference of Stellar Properties Using Integrated Photometric and Spectroscopic Data.” <i>The Astrophysical Journal</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/1538-4357/ae0cbc\">https://doi.org/10.3847/1538-4357/ae0cbc</a>.","ista":"Kamai I, Bronstein AM, Perets HB. 2025. Machine Learning inference of stellar properties using integrated photometric and spectroscopic data. The Astrophysical Journal. 994, 110."},"quality_controlled":"1","publication":"The Astrophysical Journal","OA_type":"gold","status":"public","external_id":{"arxiv":["2507.10666"]},"department":[{"_id":"AlBr"}],"intvolume":"       994","article_processing_charge":"Yes","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"This research was partially supported by the Israeli Science Foundation grant 1834/24.","DOAJ_listed":"1","year":"2025","publisher":"IOP Publishing","article_number":"110"},{"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"01","date_created":"2026-02-16T15:36:51Z","author":[{"full_name":"Sasaki, Orie","first_name":"Orie","last_name":"Sasaki"},{"full_name":"Miles, Evan S.","first_name":"Evan S.","last_name":"Miles"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca","orcid":"0000-0002-5554-8087"},{"last_name":"Sakai","full_name":"Sakai, Akiko","first_name":"Akiko"},{"last_name":"Fujita","first_name":"Koji","full_name":"Fujita, Koji"}],"page":"5283-5298","_id":"21247","volume":19,"status":"public","publication":"The Cryosphere","OA_type":"gold","citation":{"apa":"Sasaki, O., Miles, E. S., Pellicciotti, F., Sakai, A., &#38; Fujita, K. (2025). Contrasting patterns of change in snowline altitude across five Himalayan catchments. <i>The Cryosphere</i>. Copernicus Publications. <a href=\"https://doi.org/10.5194/tc-19-5283-2025\">https://doi.org/10.5194/tc-19-5283-2025</a>","short":"O. Sasaki, E.S. Miles, F. Pellicciotti, A. Sakai, K. Fujita, The Cryosphere 19 (2025) 5283–5298.","chicago":"Sasaki, Orie, Evan S. Miles, Francesca Pellicciotti, Akiko Sakai, and Koji Fujita. “Contrasting Patterns of Change in Snowline Altitude across Five Himalayan Catchments.” <i>The Cryosphere</i>. Copernicus Publications, 2025. <a href=\"https://doi.org/10.5194/tc-19-5283-2025\">https://doi.org/10.5194/tc-19-5283-2025</a>.","ista":"Sasaki O, Miles ES, Pellicciotti F, Sakai A, Fujita K. 2025. Contrasting patterns of change in snowline altitude across five Himalayan catchments. The Cryosphere. 19(11), 5283–5298.","ama":"Sasaki O, Miles ES, Pellicciotti F, Sakai A, Fujita K. Contrasting patterns of change in snowline altitude across five Himalayan catchments. <i>The Cryosphere</i>. 2025;19(11):5283-5298. doi:<a href=\"https://doi.org/10.5194/tc-19-5283-2025\">10.5194/tc-19-5283-2025</a>","mla":"Sasaki, Orie, et al. “Contrasting Patterns of Change in Snowline Altitude across Five Himalayan Catchments.” <i>The Cryosphere</i>, vol. 19, no. 11, Copernicus Publications, 2025, pp. 5283–98, doi:<a href=\"https://doi.org/10.5194/tc-19-5283-2025\">10.5194/tc-19-5283-2025</a>.","ieee":"O. Sasaki, E. S. Miles, F. Pellicciotti, A. Sakai, and K. Fujita, “Contrasting patterns of change in snowline altitude across five Himalayan catchments,” <i>The Cryosphere</i>, vol. 19, no. 11. Copernicus Publications, pp. 5283–5298, 2025."},"quality_controlled":"1","department":[{"_id":"FrPe"}],"article_processing_charge":"No","intvolume":"        19","OA_place":"publisher","language":[{"iso":"eng"}],"acknowledgement":"We thank Maud Bernat for helping with the modification of the automatic detection code and Michael McCarthy for preparing snowline data derived from the MODIS satellite. This research was supported by the JSPS–SNSF (Japan Society for the Promotion of Science–Swiss National Science Foundation) bilateral program project (HOPE, High-elevation precipitation in High Mountain Asia; JPJSJRP 20191503, grant no. 183633) and JSPS KAKENHI (grant nos. 23K13417 and 23H01509).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Copernicus Publications","year":"2025","DOAJ_listed":"1","issue":"11","oa_version":"Published Version","type":"journal_article","file_date_updated":"2026-02-17T12:35:44Z","has_accepted_license":"1","doi":"10.5194/tc-19-5283-2025","publication_status":"published","PlanS_conform":"1","ddc":["550"],"abstract":[{"text":"Seasonal snowmelt in High Mountain Asia is an important source of river discharge. Therefore, observation of the spatiotemporal variations in snow cover at catchment scales using high-resolution satellites is essential for understanding changes in water supply from headwater catchments. In this study, we adapt an algorithm to automatically detect the snowline altitude (SLA) using the Google Earth Engine platform with available high-resolution multispectral satellite archives that can be readily applied for areas of interest. Here, we applied and evaluated the tool to five glacierized watersheds across the Himalayas to quantify the changes in seasonal and annual snow cover over the past 21 years and analyze climate reanalysis data to assess the meteorological factors influencing the SLA. Our findings revealed substantial variations in the SLA among sites in terms of seasonal patterns, decadal trends, and meteorological controls. We identify positive trends in SLA in Hidden Valley (+11.9 m yr−1), Langtang (+14.4 m yr−1), and Rolwaling (+8.2 m yr−1) in the Nepalese Himalayas but a negative trend in Satopanth (−15.6 m yr−1) in the western Indian Himalayas and no significant trend in Parlung in southeastern Tibet. We suggest that the increase in SLA in Nepal was caused by warmer temperatures during the monsoon season, whereas the decrease in SLA in India was driven by increased winter snowfall and reduced monsoon snowmelt. By integrating the outcomes of these analyses, we found that long-term changes in SLA are primarily driven by shifts in the local climate, whereas seasonal variability may be influenced by geographic features in conjunction with climate.","lang":"eng"}],"oa":1,"file":[{"success":1,"file_size":6617241,"access_level":"open_access","relation":"main_file","checksum":"2bb8ada7536bb69b39448f13098f8cea","date_created":"2026-02-17T12:35:44Z","creator":"dernst","file_name":"2025_Cryosphere_Sasaki.pdf","content_type":"application/pdf","date_updated":"2026-02-17T12:35:44Z","file_id":"21303"}],"month":"11","title":"Contrasting patterns of change in snowline altitude across five Himalayan catchments","date_published":"2025-11-01T00:00:00Z","article_type":"original","date_updated":"2026-02-17T12:49:00Z","publication_identifier":{"eissn":["1994-0424"]}},{"oa_version":"Published Version","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41467-025-65631-0"}],"doi":"10.1038/s41467-025-65631-0","publication_status":"published","PlanS_conform":"1","ddc":["570"],"oa":1,"abstract":[{"text":"Camera-type eyes in vertebrates and cephalopods are striking examples of parallel evolution of a complex structure. While comparisons have focused on these two groups, camera-type eyes with likely high functionality are also found in other invertebrate phyla with simpler brains. Employing single-cell RNA sequencing, we identify neurogenic cells in the adult eyes and brain of the marine annelid worm Platynereis dumerilii. Distinct neural stem cells in the camera-type adult eyes, located at the edge of the cup-shaped retina, and adjacent to the glass body/lens, produce radial lines of cells, reminiscent of stem cells in ciliary marginal zones of vertebrate eyes exhibiting life-long growth. Normal proliferation in the eye depends on ambient light, a phenomenon that depends on the integrity of the photoreceptor gene c-opsin1, which is present in emerging rhabdomeric photoreceptors, and impacts on their differentiation. During reproductive maturation, proliferation in the eye as well as the entire brain sharply declines, while cells upregulate molecular characteristics of mammalian adult neural stem cell quiescence. Our data provide insights into the development and modulation of annelid head and brain cells, revealing similarities and differences to vertebrate eye development, neurogenesis and brain plasticity.","lang":"eng"}],"month":"12","title":"Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity","date_updated":"2026-06-18T18:30:32Z","publication_identifier":{"eissn":["2041-1723"]},"date_published":"2025-12-01T00:00:00Z","article_type":"original","day":"01","date_created":"2026-02-16T15:38:11Z","_id":"21248","author":[{"full_name":"Milivojev, Nadja","first_name":"Nadja","last_name":"Milivojev"},{"last_name":"Scaramuzza","first_name":"Federico","full_name":"Scaramuzza, Federico"},{"last_name":"Brum","first_name":"Pedro Ozório","full_name":"Brum, Pedro Ozório"},{"last_name":"Velastegui Gamboa","id":"625aea67-91c1-11f0-aad8-f71452b4174d","full_name":"Velastegui Gamboa, Camila L","first_name":"Camila L"},{"first_name":"Gabriele","full_name":"Andreatta, Gabriele","last_name":"Andreatta"},{"last_name":"Raible","first_name":"Florian","full_name":"Raible, Florian"},{"last_name":"Tessmar-Raible","full_name":"Tessmar-Raible, Kristin","first_name":"Kristin"}],"volume":16,"quality_controlled":"1","citation":{"ieee":"N. Milivojev <i>et al.</i>, “Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity,” <i>Nature Communications</i>, vol. 16. Springer Nature, 2025.","mla":"Milivojev, Nadja, et al. “Light-Modulated Stem Cells in the Camera-Type Eye of an Annelid Model for Adult Brain Plasticity.” <i>Nature Communications</i>, vol. 16, 9861, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41467-025-65631-0\">10.1038/s41467-025-65631-0</a>.","ama":"Milivojev N, Scaramuzza F, Brum PO, et al. Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity. <i>Nature Communications</i>. 2025;16. doi:<a href=\"https://doi.org/10.1038/s41467-025-65631-0\">10.1038/s41467-025-65631-0</a>","ista":"Milivojev N, Scaramuzza F, Brum PO, Velastegui Gamboa CL, Andreatta G, Raible F, Tessmar-Raible K. 2025. Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity. Nature Communications. 16, 9861.","chicago":"Milivojev, Nadja, Federico Scaramuzza, Pedro Ozório Brum, Camila L Velastegui Gamboa, Gabriele Andreatta, Florian Raible, and Kristin Tessmar-Raible. “Light-Modulated Stem Cells in the Camera-Type Eye of an Annelid Model for Adult Brain Plasticity.” <i>Nature Communications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41467-025-65631-0\">https://doi.org/10.1038/s41467-025-65631-0</a>.","short":"N. Milivojev, F. Scaramuzza, P.O. Brum, C.L. Velastegui Gamboa, G. Andreatta, F. Raible, K. Tessmar-Raible, Nature Communications 16 (2025).","apa":"Milivojev, N., Scaramuzza, F., Brum, P. O., Velastegui Gamboa, C. L., Andreatta, G., Raible, F., &#38; Tessmar-Raible, K. (2025). Light-modulated stem cells in the camera-type eye of an annelid model for adult brain plasticity. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-025-65631-0\">https://doi.org/10.1038/s41467-025-65631-0</a>"},"OA_type":"gold","publication":"Nature Communications","status":"public","scopus_import":"1","department":[{"_id":"GradSch"}],"OA_place":"publisher","intvolume":"        16","article_processing_charge":"Yes (via OA deal)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"We are grateful to Andrij Belokurov, Margaryta Borysova and Netsanet Getachew for routine worm cultures and genotyping support, Lena Stumbauer for practical help, as well as all members of the Tessmar-Raible and Raible labs for constructive discussions. This work was supported by, Helmholtz Society, distinguished professorship by the Alfred Wegener Institute Helmholtz Centre for Polar and Marine Research (K.T.-R.), H2020 European Research Council, ERC Grant Agreement #819952 (K.T.-R.), Austrian Science Funds (FWF), SFB F78 (F.R., K.T-R; https://doi.org/10.55776/F78), the Human Frontier Science Program (HFSP), #RGP021/2024, https://doi.org/10.52044/HFSP.RGP0212024.pc.gr.194174 (KT-R), University of Vienna Research Platform SinCeReSt (F.R.), For open access purposes, K.T.-R. has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission. We acknowledge support by the Open Access publication fund of Alfred-Wegener-Institut Helmholtz-Zentrum für Polar- und Meeresforschung. None of the funding bodies was involved in the design of the study, the collection, analysis, and interpretation of data or in writing the manuscript. Open Access funding enabled and organized by Projekt DEAL.","DOAJ_listed":"1","publisher":"Springer Nature","year":"2025","article_number":"9861"},{"conference":{"end_date":"2025-10-31","location":"Berlin, Germany","name":"DISC: Symposium on Distributed Computing","start_date":"2025-10-27"},"alternative_title":["LIPIcs"],"ddc":["000"],"doi":"10.4230/LIPIcs.DISC.2025.3","publication_status":"published","has_accepted_license":"1","file_date_updated":"2026-02-18T06:46:02Z","type":"conference","oa_version":"Published Version","date_published":"2025-10-22T00:00:00Z","date_updated":"2026-02-18T06:49:38Z","title":"An almost-logarithmic lower bound for leader election with bounded value contention","file":[{"file_name":"2025_LIPIcs_Alistarh.pdf","file_id":"21310","date_updated":"2026-02-18T06:46:02Z","content_type":"application/pdf","creator":"dernst","date_created":"2026-02-18T06:46:02Z","success":1,"checksum":"3825a0e6e6a05503e842a59f95528bd9","access_level":"open_access","relation":"main_file","file_size":1492189}],"month":"10","abstract":[{"lang":"eng","text":"We investigate the step complexity of the Leader Election problem (and implementing the corresponding test-and-set object) in asynchronous shared memory, where processes communicate through registers supporting atomic read and write and must coordinate so that a single process becomes the leader. Determining tight step complexity bounds for solving this problem is one of the key open problems in the theory of shared memory distributed computing. The best known algorithm is a randomized tournament-tree, which has worst-case expected step complexity O(log N) for N processes. There are provably no deterministic wait-free algorithms, and only restricted lower bounds are known for obstruction-free and randomized wait-free algorithms. We introduce a new lower bound that establishes an Ω((log N)/(log log N + log Q)) step complexity for any obstruction-free Leader Election algorithm, where N is the number of processes, and 2 ≤ Q ≤ N is a bound on the value contention, which we define as the maximum number of different values that processes can be simultaneously poised to write to the same register in any execution of the algorithm. Our result is strictly stronger than previous bounds based on write contention. In particular, it implies new lower bounds on step complexity that depend on register size."}],"oa":1,"volume":356,"author":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ellen, Faith","first_name":"Faith","last_name":"Ellen"},{"last_name":"Fedorov","id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","full_name":"Fedorov, Alexander"}],"page":"3:1-3:16","_id":"21250","date_created":"2026-02-16T15:41:15Z","day":"22","corr_author":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2025","language":[{"iso":"eng"}],"acknowledgement":"The work of Dan Alistarh is supported by grants from ERC, Austrian FWF, and the Google and NVIDIA corporations. Faith Ellen was supported in part by the Natural Science and Engineering Research Council of Canada (NSERC) grant RGPIN-2020-04178.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","intvolume":"       356","article_processing_charge":"Yes","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"publication":"39th International Symposium on Distributed Computing","OA_type":"gold","status":"public","quality_controlled":"1","citation":{"ista":"Alistarh D-A, Ellen F, Fedorov A. 2025. An almost-logarithmic lower bound for leader election with bounded value contention. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 3:1-3:16.","chicago":"Alistarh, Dan-Adrian, Faith Ellen, and Alexander Fedorov. “An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention.” In <i>39th International Symposium on Distributed Computing</i>, 356:3:1-3:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.3\">https://doi.org/10.4230/LIPIcs.DISC.2025.3</a>.","apa":"Alistarh, D.-A., Ellen, F., &#38; Fedorov, A. (2025). An almost-logarithmic lower bound for leader election with bounded value contention. In <i>39th International Symposium on Distributed Computing</i> (Vol. 356, p. 3:1-3:16). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.3\">https://doi.org/10.4230/LIPIcs.DISC.2025.3</a>","short":"D.-A. Alistarh, F. Ellen, A. Fedorov, in:, 39th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 3:1-3:16.","mla":"Alistarh, Dan-Adrian, et al. “An Almost-Logarithmic Lower Bound for Leader Election with Bounded Value Contention.” <i>39th International Symposium on Distributed Computing</i>, vol. 356, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 3:1-3:16, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.3\">10.4230/LIPIcs.DISC.2025.3</a>.","ieee":"D.-A. Alistarh, F. Ellen, and A. Fedorov, “An almost-logarithmic lower bound for leader election with bounded value contention,” in <i>39th International Symposium on Distributed Computing</i>, Berlin, Germany, 2025, vol. 356, p. 3:1-3:16.","ama":"Alistarh D-A, Ellen F, Fedorov A. An almost-logarithmic lower bound for leader election with bounded value contention. In: <i>39th International Symposium on Distributed Computing</i>. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:3:1-3:16. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.3\">10.4230/LIPIcs.DISC.2025.3</a>"}},{"oa":1,"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"}],"title":"Balancing stability and flexibility when reshaping archaeal membranes","pmid":1,"date_updated":"2026-02-23T11:49:05Z","publication_identifier":{"eissn":["2050-084X"]},"date_published":"2025-10-07T00:00:00Z","article_type":"original","month":"10","file":[{"file_id":"21305","content_type":"application/pdf","file_name":"2025_elife_Amaral.pdf","date_updated":"2026-02-17T13:02:02Z","date_created":"2026-02-17T13:02:02Z","creator":"dernst","file_size":10668225,"access_level":"open_access","relation":"main_file","checksum":"4116cd5143558ded995fb9ff5fcbc7e0","success":1}],"doi":"10.7554/elife.105432","has_accepted_license":"1","publication_status":"published","file_date_updated":"2026-02-17T13:02:02Z","PlanS_conform":"1","oa_version":"Published Version","type":"journal_article","ddc":["570"],"project":[{"call_identifier":"H2020","grant_number":"802960","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines"}],"ec_funded":1,"department":[{"_id":"AnSa"}],"citation":{"short":"M. Santana de Freitas Amaral, F.F. Frey, X. Jiang, B. Baum, A. Šarić, ELife 14 (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>","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.","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>","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.","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>."},"quality_controlled":"1","publication":"eLife","status":"public","OA_type":"gold","external_id":{"pmid":["41056191 "]},"DOAJ_listed":"1","year":"2025","publisher":"eLife Sciences Publications","article_number":"105432","article_processing_charge":"Yes","intvolume":"        14","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"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.","corr_author":"1","day":"07","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":14,"date_created":"2026-02-16T15:43:57Z","related_material":{"record":[{"relation":"software","status":"public","id":"21304"}]},"_id":"21251","author":[{"full_name":"Santana de Freitas Amaral, Miguel","first_name":"Miguel","id":"4f2d02dd-47a9-11ec-ad10-82820ed3f501","last_name":"Santana de Freitas Amaral"},{"orcid":"0000-0001-8501-6017","full_name":"Frey, Felix F","first_name":"Felix F","last_name":"Frey","id":"a0270b37-8f1a-11ec-95c7-8e710c59a4f3"},{"last_name":"Jiang","full_name":"Jiang, Xiuyun","first_name":"Xiuyun"},{"first_name":"Buzz","full_name":"Baum, Buzz","last_name":"Baum"},{"full_name":"Šarić, Anđela","first_name":"Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b","last_name":"Šarić"}]},{"ddc":["520"],"PlanS_conform":"1","doi":"10.1051/0004-6361/202452093","file_date_updated":"2026-02-17T13:07:45Z","has_accepted_license":"1","publication_status":"published","type":"journal_article","oa_version":"Published Version","date_updated":"2026-02-17T13:10:18Z","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"article_type":"original","date_published":"2025-08-01T00:00:00Z","title":"The impact of rotation on the stochastic excitation of stellar acoustic modes in solar-like pulsators","month":"08","file":[{"checksum":"b8a0927307c1d82025bcb5af47b20b26","file_size":7161755,"relation":"main_file","access_level":"open_access","success":1,"creator":"dernst","date_created":"2026-02-17T13:07:45Z","file_id":"21306","content_type":"application/pdf","date_updated":"2026-02-17T13:07:45Z","file_name":"2025_AstronomyAstrophysics_Bessila.pdf"}],"oa":1,"abstract":[{"lang":"eng","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."}],"volume":700,"_id":"21252","author":[{"last_name":"Bessila","first_name":"L.","full_name":"Bessila, L."},{"full_name":"Deckx van Ruys, A.","first_name":"A.","last_name":"Deckx van Ruys"},{"last_name":"Buriasco","full_name":"Buriasco, V.","first_name":"V."},{"last_name":"Mathis","full_name":"Mathis, S.","first_name":"S."},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","orcid":"0000-0003-0142-4000","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."}],"date_created":"2026-02-16T15:46:59Z","day":"01","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_number":"A25","DOAJ_listed":"1","publisher":"EDP Sciences","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"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).","intvolume":"       700","OA_place":"publisher","article_processing_charge":"Yes","department":[{"_id":"LiBu"}],"quality_controlled":"1","citation":{"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.","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>.","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.","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>"},"status":"public","publication":"Astronomy & Astrophysics","OA_type":"gold"},{"department":[{"_id":"HeEd"}],"external_id":{"arxiv":["2306.13201"]},"status":"public","OA_type":"green","publication":"Computational Geometry","citation":{"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>.","ista":"Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186.","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).","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","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","article_number":"102186","year":"2025","publisher":"Elsevier","language":[{"iso":"eng"}],"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":"       129","article_processing_charge":"No","OA_place":"repository","day":"01","corr_author":"1","volume":129,"author":[{"first_name":"János","full_name":"Pach, János","last_name":"Pach"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"},{"last_name":"Schnider","full_name":"Schnider, Patrick","first_name":"Patrick"}],"_id":"21253","related_material":{"record":[{"id":"15012","status":"public","relation":"earlier_version"}]},"date_created":"2026-02-16T15:48:42Z","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"}],"oa":1,"article_type":"original","date_published":"2025-12-01T00:00:00Z","publication_identifier":{"issn":["0925-7721"]},"date_updated":"2026-04-16T09:12:36Z","title":"Decomposition of geometric graphs into star-forests","month":"12","arxiv":1,"doi":"10.1016/j.comgeo.2025.102186","publication_status":"published","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.13201","open_access":"1"}],"type":"journal_article","oa_version":"Preprint"},{"day":"02","publication_status":"published","doi":"10.1016/b978-0-443-15719-6.00015-5","editor":[{"last_name":"Irving","full_name":"Irving, Helen","first_name":"Helen"},{"full_name":"Gehring, Chris","first_name":"Chris","last_name":"Gehring"},{"last_name":"Wong","full_name":"Wong, Aloysius","first_name":"Aloysius"}],"type":"book_chapter","oa_version":"None","alternative_title":["Foundations and Frontiers in Enzymology"],"_id":"21255","author":[{"last_name":"Qi","first_name":"Linlin","full_name":"Qi, Linlin"},{"orcid":"0000-0002-8302-7596","first_name":"Jiří","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml"}],"page":"299-322","date_created":"2026-02-16T15:53:52Z","scopus_import":"1","department":[{"_id":"JiFr"}],"abstract":[{"text":"As an important plant hormone to regulate growth and development, auxin has been investigated for more than a century. It had been clearly demonstrated and well-accepted that the intracellular auxin receptors, TIR1/AFBs, are F-box proteins mediating transcriptional auxin signaling by their E3 ubiquitin ligase activity, which targets and sends for degradation the Aux/IAA transcriptional repressors. The recent discovery of adenylate cyclase (AC) and guanylate cyclase (GC) activities for TIR1/AFBs open entirely new perspectives on how auxin signaling can operate. This chapter traces back the history of how canonical transcriptional auxin signaling was established and introduces the discovery of the TIR1/AFBs-mediated nontranscriptional signaling branch. Finally, the current understanding and open questions of how TIR1/AFBs’ AC and GC activities contribute to the transcriptional and nontranscriptional auxin signaling are discussed, highlighting the possibility that cyclic adenosine monophosphate (cAMP) and cyclic guanosine monophosphate (cGMP) act as second messengers in auxin signal transduction.","lang":"eng"}],"citation":{"ieee":"L. Qi and J. Friml, “Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling,” in <i>Cryptic Enzymes and Moonlighting Proteins</i>, H. Irving, C. Gehring, and A. Wong, Eds. Elsevier, 2025, pp. 299–322.","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>.","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>","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>.","ista":"Qi L, Friml J. 2025.Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling. In: Cryptic Enzymes and Moonlighting Proteins. Foundations and Frontiers in Enzymology, , 299–322.","short":"L. Qi, J. Friml, in:, H. Irving, C. Gehring, A. Wong (Eds.), Cryptic Enzymes and Moonlighting Proteins, Elsevier, 2025, pp. 299–322.","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>"},"quality_controlled":"1","publication":"Cryptic Enzymes and Moonlighting Proteins","OA_type":"closed access","status":"public","publication_identifier":{"isbn":["9780443157196"]},"date_updated":"2026-02-17T13:28:38Z","date_published":"2025-05-02T00:00:00Z","title":"Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into the mechanism of auxin signaling","year":"2025","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"05","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"year":"2025","publisher":"American Physical Society","DOAJ_listed":"1","article_number":"033019","OA_place":"publisher","article_processing_charge":"Yes","intvolume":"         3","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.Š.).","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"department":[{"_id":"AnSa"}],"OA_type":"gold","publication":"PRX Life","status":"public","quality_controlled":"1","citation":{"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>","short":"B. Meadowcroft, V. Sorichetti, E. Ratajczyk, F.L. Perez Verdugo, N. Khalilgharibi, Y. Mao, I. Palaia, A. Šarić, PRX Life 3 (2025).","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>.","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.","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>","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>.","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."},"volume":3,"date_created":"2026-02-16T15:55:03Z","author":[{"id":"a4725fd6-932b-11ed-81e2-c098c7f37ae1","last_name":"Meadowcroft","orcid":"0000-0003-3441-1337","full_name":"Meadowcroft, Billie","first_name":"Billie"},{"orcid":"0000-0002-9645-6576","first_name":"Valerio","full_name":"Sorichetti, Valerio","last_name":"Sorichetti","id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b"},{"last_name":"Ratajczyk","full_name":"Ratajczyk, Eryk","first_name":"Eryk"},{"first_name":"Fernanda L","full_name":"Perez Verdugo, Fernanda L","last_name":"Perez Verdugo","id":"4ecec223-9070-11ef-a0a9-bc76077bea8d"},{"full_name":"Khalilgharibi, Nargess","first_name":"Nargess","last_name":"Khalilgharibi"},{"full_name":"Mao, Yanlan","first_name":"Yanlan","last_name":"Mao"},{"orcid":" 0000-0002-8843-9485 ","first_name":"Ivan","full_name":"Palaia, Ivan","id":"9c805cd2-4b75-11ec-a374-db6dd0ed57fa","last_name":"Palaia"},{"orcid":"0000-0002-7854-2139","full_name":"Šarić, Anđela","first_name":"Anđela","last_name":"Šarić","id":"bf63d406-f056-11eb-b41d-f263a6566d8b"}],"_id":"21256","day":"05","corr_author":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Nonequilibrium remodeling of collagen IV networks in Silico","date_published":"2025-09-05T00:00:00Z","article_type":"original","publication_identifier":{"eissn":["2835-8279"]},"date_updated":"2026-02-17T13:37:38Z","file":[{"checksum":"04cae5231d97e533145c493880fadbd9","file_size":2277704,"access_level":"open_access","relation":"main_file","success":1,"creator":"dernst","date_created":"2026-02-17T13:36:01Z","file_name":"2025_PRXLife_Meadowcroft.pdf","content_type":"application/pdf","file_id":"21308","date_updated":"2026-02-17T13:36:01Z"}],"month":"09","abstract":[{"lang":"eng","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."}],"oa":1,"ddc":["570"],"project":[{"call_identifier":"H2020","grant_number":"802960","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e"},{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"},{"name":"EMBO Young Investigator Program - Andela Saric","_id":"349b6ff1-11ca-11ed-8bc3-f006047c2eeb"}],"publication_status":"published","doi":"10.1103/gdd5-rnh7","has_accepted_license":"1","file_date_updated":"2026-02-17T13:36:01Z","PlanS_conform":"1","oa_version":"Published Version","type":"journal_article"},{"date_created":"2026-02-16T15:57:53Z","page":"83-97","author":[{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","last_name":"Kurtic","first_name":"Eldar","full_name":"Kurtic, Eldar"},{"full_name":"Kuznedelev, Denis","first_name":"Denis","last_name":"Kuznedelev"},{"id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar","full_name":"Frantar, Elias","first_name":"Elias"},{"last_name":"Goinv","first_name":"Michael","full_name":"Goinv, Michael"},{"first_name":"Shubhra","full_name":"Pandit, Shubhra","last_name":"Pandit"},{"full_name":"Agarwalla, Abhinav","first_name":"Abhinav","last_name":"Agarwalla"},{"first_name":"Tuan","full_name":"Nguyen, Tuan","last_name":"Nguyen"},{"last_name":"Marques","first_name":"Alexandre","full_name":"Marques, Alexandre"},{"last_name":"Kurtz","first_name":"Mark","full_name":"Kurtz, Mark"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"_id":"21257","editor":[{"last_name":"Passban","first_name":"Peyman","full_name":"Passban, Peyman"},{"last_name":"Way","full_name":"Way, Andy","first_name":"Andy"},{"full_name":"Rezagholizadeh, Mehdi","first_name":"Mehdi","last_name":"Rezagholizadeh"}],"day":"05","corr_author":"1","OA_place":"repository","article_processing_charge":"No","language":[{"iso":"eng"}],"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","publisher":"Springer Nature","status":"public","OA_type":"green","publication":"Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques","quality_controlled":"1","citation":{"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.","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>","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.","chicago":"Kurtic, Eldar, Denis Kuznedelev, Elias Frantar, Michael Goinv, Shubhra Pandit, Abhinav Agarwalla, Tuan Nguyen, Alexandre Marques, Mark Kurtz, and Dan-Adrian Alistarh. “Sparse Fine-Tuning for Inference Acceleration of Large Language Models.” In <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>, edited by Peyman Passban, Andy Way, and Mehdi Rezagholizadeh, 83–97. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">https://doi.org/10.1007/978-3-031-85747-8_6</a>.","ama":"Kurtic E, Kuznedelev D, Frantar E, et al. Sparse Fine-Tuning for Inference Acceleration of Large Language Models. In: Passban P, Way A, Rezagholizadeh M, eds. <i>Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques</i>. Springer Nature; 2025:83-97. doi:<a href=\"https://doi.org/10.1007/978-3-031-85747-8_6\">10.1007/978-3-031-85747-8_6</a>","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>.","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."},"external_id":{"arxiv":["2310.06927"]},"department":[{"_id":"DaAl"},{"_id":"GradSch"}],"alternative_title":["Machine Translation: Technologies and Applications"],"oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2310.06927"}],"type":"book_chapter","publication_status":"published","doi":"10.1007/978-3-031-85747-8_6","arxiv":1,"month":"07","title":"Sparse Fine-Tuning for Inference Acceleration of Large Language Models","date_published":"2025-07-05T00:00:00Z","date_updated":"2026-02-19T09:26:54Z","publication_identifier":{"eissn":["2522-803X"],"issn":["2522-8021"],"isbn":["9783031857461"],"eisbn":["9783031857478"]},"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"}],"oa":1},{"date_created":"2026-02-16T16:00:02Z","_id":"21260","author":[{"first_name":"Stanley","full_name":"Yao Xiao, Stanley","last_name":"Yao Xiao"},{"last_name":"Yamagishi","id":"0c3fbc5c-f7a6-11ec-8d70-9485e75b416b","full_name":"Yamagishi, Shuntaro","first_name":"Shuntaro"}],"corr_author":"1","day":"06","year":"2025","publisher":"EMS Press","OA_place":"publisher","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"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.","department":[{"_id":"TiBr"}],"quality_controlled":"1","citation":{"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.","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>.","short":"S. Yao Xiao, S. Yamagishi, Journal of the European Mathematical Society (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>","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>.","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.","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>"},"publication":"Journal of the European Mathematical Society","OA_type":"diamond","status":"public","external_id":{"arxiv":["2307.05712"]},"ddc":["500"],"project":[{"name":"New frontiers of the Manin conjecture","_id":"26AEDAB2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P32428"}],"doi":"10.4171/jems/1697","publication_status":"epub_ahead","arxiv":1,"oa_version":"Published Version","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4171/JEMS/1697"}],"title":"Quartic polynomials in two variables do not represent all non-negative integers","publication_identifier":{"eissn":["1435-9863"],"issn":["1435-9855"]},"date_updated":"2026-06-18T18:31:24Z","article_type":"original","date_published":"2025-08-06T00:00:00Z","month":"08","oa":1,"abstract":[{"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.","lang":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"B. Auerbach and B. Erol—Conducted part of this work at ISTA.","article_processing_charge":"No","OA_place":"repository","intvolume":"     16007","year":"2025","publisher":"Springer Nature","quality_controlled":"1","citation":{"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.","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.","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>","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.","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>."},"status":"public","publication":"45th Annual International Cryptology Conference","OA_type":"green","department":[{"_id":"KrPi"}],"_id":"21262","page":"141-172","author":[{"id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","last_name":"Auerbach","full_name":"Auerbach, Benedikt","first_name":"Benedikt","orcid":"0000-0002-7553-6606"},{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","last_name":"Cueto Noval","first_name":"Miguel","full_name":"Cueto Noval, Miguel","orcid":"0000-0002-2505-4246"},{"last_name":"Erol","full_name":"Erol, Boran","first_name":"Boran"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-02-17T07:41:04Z","volume":16007,"day":"17","month":"08","date_updated":"2026-02-18T07:36:42Z","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783032019134"],"issn":["0302-9743"],"isbn":["9783032019127"]},"date_published":"2025-08-17T00:00:00Z","title":"Continuous group-key agreement: Concurrent updates without pruning","oa":1,"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"}],"conference":{"start_date":"2025-08-17","name":"CRYPTO: International Cryptology Conference","location":"Santa Barbara, CA, United States","end_date":"2025-08-21"},"alternative_title":["LNCS"],"type":"conference","main_file_link":[{"url":"https://eprint.iacr.org/2025/1035","open_access":"1"}],"oa_version":"Preprint","doi":"10.1007/978-3-032-01913-4_5","publication_status":"published"},{"citation":{"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>","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>.","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.","short":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, I. Saraf‐Sinik, The Anatomical Record (2025).","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>","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>.","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."},"quality_controlled":"1","publication":"The Anatomical Record","status":"public","OA_type":"hybrid","external_id":{"pmid":["40923214"]},"scopus_import":"1","department":[{"_id":"MaJö"}],"OA_place":"publisher","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","language":[{"iso":"eng"}],"publisher":"Wiley","year":"2025","article_number":"ar.70051","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"09","date_created":"2026-02-17T07:44:23Z","_id":"21264","author":[{"full_name":"Haidarliu, Sebastian","first_name":"Sebastian","last_name":"Haidarliu"},{"last_name":"Nelinger","full_name":"Nelinger, Guy","first_name":"Guy"},{"id":"ed7c4564-13aa-11f0-9846-960f9afb2ddb","last_name":"Gantar","full_name":"Gantar, Luka","first_name":"Luka"},{"last_name":"Ahissar","full_name":"Ahissar, Ehud","first_name":"Ehud"},{"first_name":"Inbar","full_name":"Saraf‐Sinik, Inbar","last_name":"Saraf‐Sinik"}],"oa":1,"abstract":[{"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.","lang":"eng"}],"month":"09","title":"An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice","pmid":1,"publication_identifier":{"eissn":["1932-8494"],"issn":["1932-8486"]},"date_updated":"2026-02-23T10:50:27Z","article_type":"original","date_published":"2025-09-09T00:00:00Z","oa_version":"Published Version","main_file_link":[{"url":"https://doi.org/10.1002/ar.70051","open_access":"1"}],"type":"journal_article","has_accepted_license":"1","publication_status":"epub_ahead","doi":"10.1002/ar.70051","ddc":["570"]},{"day":"01","volume":2025,"_id":"21265","author":[{"first_name":"Victor","full_name":"Wang, Victor","orcid":"0000-0002-0704-7026","last_name":"Wang","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9"},{"full_name":"Xu, Max Wenqiang","first_name":"Max Wenqiang","last_name":"Xu"}],"date_created":"2026-02-17T07:45:45Z","scopus_import":"1","department":[{"_id":"TiBr"}],"ec_funded":1,"external_id":{"arxiv":["2405.04094"]},"citation":{"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.","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>","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.","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)."},"quality_controlled":"1","publication":"International Mathematics Research Notices","status":"public","OA_type":"green","article_number":"rnaf279","issue":"18","publisher":"Oxford University Press","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","language":[{"iso":"eng"}],"article_processing_charge":"No","OA_place":"repository","intvolume":"      2025","arxiv":1,"doi":"10.1093/imrn/rnaf279","publication_status":"published","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2405.04094"}],"type":"journal_article","oa_version":"Preprint","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"oa":1,"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"}],"date_updated":"2026-02-18T07:41:56Z","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"date_published":"2025-09-01T00:00:00Z","article_type":"original","title":"Harper’s beyond square-root conjecture","month":"09"},{"arxiv":1,"publication_status":"published","doi":"10.4230/LIPIcs.ICALP.2025.150","file_date_updated":"2026-02-18T07:50:56Z","has_accepted_license":"1","type":"conference","oa_version":"Published Version","conference":{"start_date":"2025-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11","location":"Aarhus, Denmark"},"alternative_title":["LIPIcs"],"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"ddc":["000"],"oa":1,"abstract":[{"lang":"eng","text":"We consider multiple-environment Markov decision processes (MEMDP), which consist of a finite set of MDPs over the same state space, representing different scenarios of transition structure and probability. The value of a strategy is the probability to satisfy the objective, here a parity objective, in the worst-case scenario, and the value of an MEMDP is the supremum of the values achievable by a strategy.\r\nWe show that deciding whether the value is 1 is a PSPACE-complete problem, and even in P when the number of environments is fixed, along with new insights to the almost-sure winning problem, which is to decide if there exists a strategy with value 1. Pure strategies are sufficient for theses problems, whereas randomization is necessary in general when the value is smaller than 1. We present an algorithm to approximate the value, running in double exponential space. Our results are in contrast to the related model of partially-observable MDPs where all these problems are known to be undecidable."}],"date_updated":"2026-02-18T07:53:26Z","publication_identifier":{"isbn":["9783959773720"]},"date_published":"2025-07-30T00:00:00Z","title":"The value problem for multiple-environment MDPs with parity objective","month":"07","file":[{"date_created":"2026-02-18T07:50:56Z","creator":"dernst","file_id":"21313","date_updated":"2026-02-18T07:50:56Z","content_type":"application/pdf","file_name":"2025_LIPIcs_Chatterjee.pdf","success":1,"checksum":"4477a7fd4fbf0ba6c8e9b15683b5a6b8","relation":"main_file","access_level":"open_access","file_size":1075724}],"corr_author":"1","day":"30","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"21268","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Raskin","first_name":"Jean-Francois","full_name":"Raskin, Jean-Francois"},{"last_name":"Sankur","full_name":"Sankur, Ocan","first_name":"Ocan"}],"date_created":"2026-02-17T07:49:17Z","scopus_import":"1","department":[{"_id":"KrCh"}],"ec_funded":1,"external_id":{"arxiv":["2504.15960"]},"quality_controlled":"1","citation":{"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.","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>.","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>","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>.","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>"},"OA_type":"gold","status":"public","publication":"52nd International Colloquium on Automata, Languages, and Programming","article_number":"150","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"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).","article_processing_charge":"No","OA_place":"publisher"},{"department":[{"_id":"GaTk"}],"quality_controlled":"1","citation":{"short":"C.Y. Zhang, A. Rosa, G. Sanguinetti, PRX Life 3 (2025).","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>","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>.","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.","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>","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.","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>."},"OA_type":"gold","status":"public","publication":"PRX Life","external_id":{"arxiv":["2409.14425"]},"DOAJ_listed":"1","year":"2025","publisher":"American Physical Society","issue":"4","article_number":"043006","OA_place":"publisher","intvolume":"         3","article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","language":[{"iso":"eng"}],"corr_author":"1","day":"21","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":3,"date_created":"2026-02-17T07:53:01Z","_id":"21269","author":[{"first_name":"Chen Y","full_name":"Zhang, Chen Y","id":"81b43fb8-c9d5-11ef-bf68-ade532a1f204","last_name":"Zhang"},{"first_name":"Angelo","full_name":"Rosa, Angelo","last_name":"Rosa"},{"last_name":"Sanguinetti","full_name":"Sanguinetti, Guido","first_name":"Guido"}],"oa":1,"abstract":[{"lang":"eng","text":"The spatial organization of chromatin within the nucleus plays a crucial role in gene expression and genome function. However, the quantitative relationship between this organization and nuclear biochemical processes remains under debate. In this study, we present a graph-based generative model, bioSBM, designed to capture long-range chromatin interaction patterns from Hi-C data and, importantly, simultaneously link these patterns to biochemical features. Applying bioSBM to Hi-C maps of the GM12878 lymphoblastoid cell line, we identified a latent structure of chromatin interactions, revealing seven distinct communities that strongly align with known biological annotations. Additionally, we infer a linear transformation that maps biochemical observables, such as histone marks, to the parameters of the generative graph model, enabling accurate genome-wide predictions of chromatin contact maps on out-of-sample data, both within the same cell line and on the completely unseen HCT116 cell line under RAD21 depletion. These findings highlight bioSBM's potential as a powerful tool for elucidating the relationship between biochemistry and chromatin architecture and predicting long-range genome organization from independent biochemical data."}],"title":"bioSBM: A random graph model to integrate epigenomic data in chromatin structure prediction","publication_identifier":{"issn":["2835-8279"]},"date_updated":"2026-02-18T08:01:00Z","date_published":"2025-10-21T00:00:00Z","article_type":"original","month":"10","file":[{"access_level":"open_access","file_size":1888053,"relation":"main_file","checksum":"76ddfee3efdb4c9d085059b5a142ed78","success":1,"creator":"dernst","date_created":"2026-02-18T07:57:39Z","date_updated":"2026-02-18T07:57:39Z","content_type":"application/pdf","file_name":"2025_PRXLife_Zhang.pdf","file_id":"21314"}],"has_accepted_license":"1","file_date_updated":"2026-02-18T07:57:39Z","doi":"10.1103/gy1p-4256","publication_status":"published","PlanS_conform":"1","arxiv":1,"oa_version":"Published Version","type":"journal_article","ddc":["570"]},{"arxiv":1,"publication_status":"published","doi":"10.1103/s9p9-jflq","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2506.02440 "}],"type":"journal_article","oa_version":"Preprint","article_type":"original","date_published":"2025-11-18T00:00:00Z","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"date_updated":"2026-02-18T08:23:59Z","title":"Bound excited states of Fröhlich polarons in one dimension","month":"11","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."}],"oa":1,"volume":112,"author":[{"last_name":"Taylor","full_name":"Taylor, J.","first_name":"J."},{"full_name":"Čufar, M.","first_name":"M.","last_name":"Čufar"},{"id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","last_name":"Mitrouskas","full_name":"Mitrouskas, David Johannes","first_name":"David Johannes"},{"last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","first_name":"Robert"},{"last_name":"Pahl","first_name":"E.","full_name":"Pahl, E."},{"first_name":"J.","full_name":"Brand, J.","last_name":"Brand"}],"_id":"21270","date_created":"2026-02-17T07:56:20Z","day":"18","issue":"18","article_number":"184312","year":"2025","publisher":"American Physical Society","language":[{"iso":"eng"}],"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.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","intvolume":"       112","article_processing_charge":"No","department":[{"_id":"RoSe"}],"scopus_import":"1","external_id":{"arxiv":["2506.02440 "]},"publication":"Physical Review B","OA_type":"green","status":"public","quality_controlled":"1","citation":{"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.","chicago":"Taylor, J., M. Čufar, David Johannes Mitrouskas, Robert Seiringer, E. Pahl, and J. Brand. “Bound Excited States of Fröhlich Polarons in One Dimension.” <i>Physical Review B</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>.","apa":"Taylor, J., Čufar, M., Mitrouskas, D. J., Seiringer, R., Pahl, E., &#38; Brand, J. (2025). Bound excited states of Fröhlich polarons in one dimension. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>","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.","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>"}}]