[{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2026-07-30T05:42:17Z","date_published":"2026-07-17T00:00:00Z","article_type":"original","OA_place":"publisher","doi":"10.1038/s41467-026-75598-1","PlanS_conform":"1","month":"07","corr_author":"1","ddc":["530"],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1038/s41467-026-75598-1","open_access":"1"}],"DOAJ_listed":"1","author":[{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","orcid":"0009-0002-2370-8661","full_name":"Kerschbaumer, Aron","last_name":"Kerschbaumer","first_name":"Aron"},{"last_name":"Desaules","full_name":"Desaules, Jean-Yves Marc","first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","orcid":"0000-0003-0038-7068","full_name":"Ljubotina, Marko","last_name":"Ljubotina","first_name":"Marko"},{"last_name":"Serbyn","full_name":"Serbyn, Maksym","first_name":"Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827"}],"publication":"Nature Communications","date_created":"2026-07-27T07:26:27Z","acknowledgement":"We acknowledge useful discussions with J.-S. Caux, E. Demler, J. Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter, F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. We acknowledge support by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI). This research was funded in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This research was supported in part by grant NSF PHY2309135 to the Kavli Institute for Theoretical Physics (KITP).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” <i>Nature Communications</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-75598-1\">10.1038/s41467-026-75598-1</a>.","ieee":"A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons in Rydberg atom chains,” <i>Nature Communications</i>. Springer Nature, 2026.","ama":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg atom chains. <i>Nature Communications</i>. 2026. doi:<a href=\"https://doi.org/10.1038/s41467-026-75598-1\">10.1038/s41467-026-75598-1</a>","ista":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons in Rydberg atom chains. Nature Communications.","short":"A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications (2026).","chicago":"Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-75598-1\">https://doi.org/10.1038/s41467-026-75598-1</a>.","apa":"Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., &#38; Serbyn, M. (2026). Quasi-solitons in Rydberg atom chains. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-75598-1\">https://doi.org/10.1038/s41467-026-75598-1</a>"},"publication_identifier":{"eissn":["2041-1723"]},"language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"day":"17","publication_status":"epub_ahead","publisher":"Springer Nature","has_accepted_license":"1","year":"2026","ec_funded":1,"supplementarymaterial":"yes","status":"public","type":"journal_article","abstract":[{"text":"Solitons—localized wave packets that travel without spreading—play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays.","lang":"eng"}],"title":"Quasi-solitons in Rydberg atom chains","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"OA_type":"gold","article_processing_charge":"Yes","_id":"22408","quality_controlled":"1"},{"department":[{"_id":"KrCh"}],"type":"journal_article","title":"The effect of the fitness gradient on fixation probability","abstract":[{"lang":"eng","text":"Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects."}],"quality_controlled":"1","_id":"22101","OA_type":"gold","article_processing_charge":"Yes","researchdata_availability":"no","file_date_updated":"2026-06-24T06:50:24Z","pmid":1,"has_accepted_license":"1","volume":17,"file":[{"content_type":"application/pdf","date_updated":"2026-06-24T06:50:24Z","date_created":"2026-06-24T06:50:24Z","creator":"dernst","relation":"main_file","file_name":"2026_NatureComm_Svoboda.pdf","success":1,"checksum":"b660048bb271f24d6763803e247d5c32","access_level":"open_access","file_id":"22136","file_size":1068919}],"status":"public","intvolume":"        17","year":"2026","supplementarymaterial":"yes","ec_funded":1,"dataavailabilitystatement":"Correspondence and requests for materials should be addressed to Krishnendu Chatterjee.","citation":{"mla":"Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>, vol. 17, 5325, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>.","ama":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>","short":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026).","ista":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325.","chicago":"Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>.","ieee":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","apa":"Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>"},"das_tickbox":"1","date_created":"2026-06-21T22:02:59Z","publication":"Nature Communications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","publication_status":"published","publisher":"Springer Nature","publication_identifier":{"eissn":["2041-1723"]},"day":"01","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"language":[{"iso":"eng"}],"scopus_import":"1","external_id":{"pmid":["41997932"]},"article_number":"5325","date_updated":"2026-07-30T07:24:55Z","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"oa_version":"Published Version","date_published":"2026-12-01T00:00:00Z","author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda","full_name":"Svoboda, Jakub","first_name":"Jakub"},{"full_name":"Nemati, Hossein","last_name":"Nemati","first_name":"Hossein"},{"first_name":"Josef","full_name":"Tkadlec, Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kaveh, Kamran","last_name":"Kaveh","first_name":"Kamran"},{"first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"DOAJ_listed":"1","doi":"10.1038/s41467-026-71777-2","article_type":"original","OA_place":"publisher","ddc":["000"],"oa":1,"month":"12","corr_author":"1"},{"date_published":"2026-07-27T00:00:00Z","oa_version":"Published Version","date_updated":"2026-07-31T10:52:08Z","supervisor":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6220-2052","last_name":"Guet","full_name":"Guet, Calin C","first_name":"Calin C"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","full_name":"Tkačik, Gašper","last_name":"Tkačik"}],"corr_author":"1","month":"07","ddc":["576"],"oa":1,"OA_place":"publisher","doi":"10.15479/AT-ISTA-22399","degree_awarded":"MS","author":[{"id":"ecee9d38-4040-11ef-8843-b941efb445d6","full_name":"Spasić, Aleksa","last_name":"Spasić","first_name":"Aleksa"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","das_tickbox":"0","date_created":"2026-07-25T13:08:32Z","citation":{"ieee":"A. Spasić, “Studying the evolutionary systems biology of the lac operon,” Institute of Science and Technology Austria, 2026.","short":"A. Spasić, Studying the Evolutionary Systems Biology of the Lac Operon, Institute of Science and Technology Austria, 2026.","ista":"Spasić A. 2026. Studying the evolutionary systems biology of the lac operon. Institute of Science and Technology Austria.","chicago":"Spasić, Aleksa. “Studying the Evolutionary Systems Biology of the Lac Operon.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>.","ama":"Spasić A. Studying the evolutionary systems biology of the lac operon. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>","apa":"Spasić, A. (2026). <i>Studying the evolutionary systems biology of the lac operon</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>","mla":"Spasić, Aleksa. <i>Studying the Evolutionary Systems Biology of the Lac Operon</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>."},"language":[{"iso":"eng"}],"day":"27","publication_identifier":{"issn":["2791-4585"]},"publication_status":"published","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","file_date_updated":"2026-07-27T13:07:23Z","year":"2026","doi_confirm":"1","status":"public","file":[{"relation":"main_file","file_name":"Aleksa_Spasic_Thesis_final.pdf","date_updated":"2026-07-27T13:00:07Z","creator":"aspasic","date_created":"2026-07-27T13:00:07Z","content_type":"application/pdf","checksum":"c29880dd71fcc37f23ac6e2843066ede","access_level":"open_access","success":1,"file_size":1986078,"file_id":"22588"},{"file_name":"Thesis_final.docx","relation":"source_file","date_updated":"2026-07-27T13:07:23Z","creator":"aspasic","date_created":"2026-07-27T13:00:22Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":1868853,"file_id":"22589","access_level":"closed","checksum":"4ebe3bd2d833d913c0756343cca5e5f0"}],"abstract":[{"lang":"eng","text":"Gaining an understanding of how biological regulation evolves is a fundamental research \r\nquestion in both evolutionary biology and molecular genetics. In order to gain more insight \r\ninto this topic, we focus on studying the simple gene regulatory system of the lac operon in \r\nE. coli. We show that simple population genetic models can shed light on evolution \r\nexperiments and that this combined approach of modelling the experimental system gives \r\ninsight to better understand the causes of evolutionary change in the experiment. We also \r\nstudy the natural diversity in the lac operon from 308 publicly available E. coli genomes that \r\ncome from various host species and different regions of the world. Evidence that selection is \r\ngenerally maintaining the function of the lac operon across the sample regardless of host \r\nspecies is provided and we show that different protein coding genes in the operon are under \r\ndifferent selective constraints on protein sequence preservation. A similar frameshift \r\nmutation found in experimental evolution studies is shown to be present in the sample we \r\nanalyzed, indicating that selectively relevant variants in evolution experiments are also \r\npresent in natural populations. We show that there is no simple phylogenetic relationship \r\nbetween host species, geographical location and the lac operon sequence. Finally, we argue \r\nthat a combined approach of comparative genomics, experimental evolution and theoretical \r\nmodelling contributes to a more complete understanding of molecular evolution. "}],"title":"Studying the evolutionary systems biology of the lac operon","type":"dissertation","alternative_title":["ISTA Master’s Thesis"],"department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"CaGu"}],"article_processing_charge":"No","page":"32","_id":"22399"},{"type":"journal_article","abstract":[{"text":"We prove discrete-to-continuum convergence for dynamical optimal transport on  Zd\r\n -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of  1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.","lang":"eng"}],"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","isi":1,"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20563"}]},"keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"OA_type":"gold","article_processing_charge":"Yes","_id":"18706","quality_controlled":"1","page":"614-642","issue":"3","has_accepted_license":"1","volume":37,"file_date_updated":"2026-07-23T05:55:03Z","researchdata_availability":"no","year":"2026","supplementarymaterial":"no","status":"public","intvolume":"        37","file":[{"access_level":"open_access","checksum":"d038f4d00cbfbde2672c17138eab21c9","success":1,"file_size":612317,"file_id":"22386","relation":"main_file","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","content_type":"application/pdf","creator":"dernst","date_updated":"2026-07-23T05:55:03Z","date_created":"2026-07-23T05:55:03Z"}],"publication":"European Journal of Applied Mathematics","date_created":"2024-12-23T11:03:59Z","das_tickbox":"0","acknowledgement":"L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1, Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science Fund (FWF) project 10.55776/F65.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Portinale, L., &#38; Quattrocchi, F. (2026). Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>","ieee":"L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs,” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026.","chicago":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>.","ama":"Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. 2026;37(3):614-642. doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>","ista":"Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. 37(3), 614–642.","short":"L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37 (2026) 614–642.","mla":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3, Cambridge University Press, 2026, pp. 614–42, doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>."},"publication_identifier":{"issn":["0956-7925"],"eissn":["1469-4425"]},"language":[{"iso":"eng"}],"scopus_import":"1","day":"01","project":[{"grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","name":"Taming Complexity in Partial Differential Systems"}],"publisher":"Cambridge University Press","publication_status":"published","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-08-01T22:31:10Z","date_published":"2026-06-01T00:00:00Z","external_id":{"isi":["001381435800001"]},"OA_place":"publisher","article_type":"original","doi":"10.1017/s0956792524000810","month":"06","PlanS_conform":"1","oa":1,"ddc":["500"],"DOAJ_listed":"1","author":[{"last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Quattrocchi, Filippo","last_name":"Quattrocchi","first_name":"Filippo","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","orcid":"0009-0000-9773-1931"}]},{"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","conference":{"location":"Santa Barbara, CA, United States","start_date":"2025-08-16","name":"ITC: Information Theoretic Cryptography","end_date":"2025-08-17"},"day":"08","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]},"citation":{"mla":"Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” <i>6th Conference on Information-Theoretic Cryptography</i>, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>.","ista":"Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing. 6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic Cryptography, LIPIcs, vol. 343, 4:1-4:10.","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: <i>6th Conference on Information-Theoretic Cryptography</i>. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In <i>6th Conference on Information-Theoretic Cryptography</i>, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara, CA, United States, 2025, vol. 343.","apa":"Pietrzak, K. Z., &#38; Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In <i>6th Conference on Information-Theoretic Cryptography</i> (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"0","date_created":"2026-06-14T22:01:45Z","cryptoeprintid":1,"publication":"6th Conference on Information-Theoretic Cryptography","author":[{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Pengxiang","last_name":"Wang","full_name":"Wang, Pengxiang"}],"ddc":["000"],"oa":1,"month":"09","corr_author":"1","doi":"10.4230/LIPIcs.ITC.2025.4","OA_place":"publisher","external_id":{"cryptoeprintid":["2025/723"]},"article_number":"4:1-4:10","date_published":"2025-09-08T00:00:00Z","date_updated":"2026-06-22T08:57:41Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","_id":"22007","article_processing_charge":"Yes","OA_type":"gold","alternative_title":["LIPIcs"],"keyword":["Time-Space Lower Bounds","Blockchains"],"department":[{"_id":"KrPi"}],"title":"Time-space tradeoffs of truncation with preprocessing","abstract":[{"text":"Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected 2^k different inputs one will find an output that starts with k zeros.\r\nUsing such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi et al., 2022] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for \"trivial\" reasons.\r\nConcretely, it’s known that any algorithm that inverts a random function or permutation with range N making T queries and using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges, which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query.\r\nWe show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog N lower bound applies.","lang":"eng"}],"type":"conference","file":[{"date_updated":"2026-06-22T08:54:32Z","creator":"dernst","date_created":"2026-06-22T08:54:32Z","content_type":"application/pdf","relation":"main_file","file_name":"2025_LIPIcs_Pietrzak.pdf","file_id":"22118","file_size":772046,"success":1,"checksum":"3f791b03df26853342855a9d9581cb58","access_level":"open_access"}],"status":"public","intvolume":"       343","year":"2025","file_date_updated":"2026-06-22T08:54:32Z","has_accepted_license":"1","volume":343},{"publisher":"American Mathematical Society","publication_status":"published","arxiv":1,"publication_identifier":{"issn":["2692-3688"]},"day":"23","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. 2025;5(7):284-320. doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>","chicago":"Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>. American Mathematical Society, 2025. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>.","ista":"Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. 5(7), 284–320.","short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320.","ieee":"R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for continuum Calogero–Moser models on the line,” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7. American Mathematical Society, pp. 284–320, 2025.","apa":"Killip, R., Laurens, T., &#38; Vişan, M. (2025). Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>","mla":"Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>."},"date_created":"2026-06-19T07:42:34Z","das_tickbox":"1","extern":"1","publication":"Communications of the American Mathematical Society","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"full_name":"Laurens, Thierry","last_name":"Laurens","first_name":"Thierry"},{"last_name":"Visan","full_name":"Visan, Monica","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"doi":"10.1090/cams/48","OA_place":"publisher","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.12334"}],"ddc":["500"],"oa":1,"month":"06","external_id":{"arxiv":["2311.12334"]},"date_updated":"2026-06-22T11:21:09Z","oa_version":"Published Version","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_published":"2025-06-23T00:00:00Z","quality_controlled":"1","_id":"22032","page":"284-320","OA_type":"diamond","article_processing_charge":"No","type":"journal_article","title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","abstract":[{"text":"We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton.","lang":"eng"}],"status":"public","intvolume":"         5","year":"2025","issue":"7","has_accepted_license":"1","volume":5},{"publication_status":"published","publisher":"Springer Nature","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"day":"24","citation":{"ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","chicago":"Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>.","ama":"Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. 2025;311. doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>","ieee":"C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical nonlinear Schrödinger equation,” <i>Mathematische Zeitschrift</i>, vol. 311. Springer Nature, 2025.","apa":"Fan, C., Killip, R., Vişan, M., &#38; Zhao, Z. (2025). Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>","mla":"Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>, vol. 311, 21, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>."},"extern":"1","publication":"Mathematische Zeitschrift","date_created":"2026-06-19T07:44:05Z","das_tickbox":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Fan","full_name":"Fan, Chenjie","first_name":"Chenjie"},{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"full_name":"Visan, Monica","last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"},{"first_name":"Zehua","last_name":"Zhao","full_name":"Zhao, Zehua"}],"article_type":"original","OA_place":"repository","doi":"10.1007/s00209-025-03821-8","month":"07","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"oa":1,"article_number":"21","external_id":{"arxiv":["2403.09989"]},"oa_version":"Preprint","date_updated":"2026-06-22T13:00:14Z","date_published":"2025-07-24T00:00:00Z","_id":"22036","quality_controlled":"1","OA_type":"green","article_processing_charge":"No","type":"journal_article","abstract":[{"text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.","lang":"eng"}],"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","status":"public","intvolume":"       311","year":"2025","volume":311},{"file":[{"file_name":"2025_NeuralCompApplic_Sukenik.pdf","relation":"main_file","date_updated":"2025-12-30T06:39:11Z","date_created":"2025-12-30T06:39:11Z","creator":"dernst","content_type":"application/pdf","checksum":"61ad4591aee16b1e02daf6c164321a42","access_level":"open_access","success":1,"file_size":500213,"file_id":"20877"}],"intvolume":"        37","status":"public","year":"2025","file_date_updated":"2025-12-30T06:39:11Z","has_accepted_license":"1","volume":37,"quality_controlled":"1","_id":"12662","page":"24669–24683","OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","department":[{"_id":"ChLa"}],"type":"journal_article","title":"Generalization in multi-objective machine learning","abstract":[{"lang":"eng","text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa."}],"author":[{"last_name":"Súkeník","full_name":"Súkeník, Peter","first_name":"Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"doi":"10.1007/s00521-024-10616-1","article_type":"original","OA_place":"publisher","ddc":["004"],"oa":1,"corr_author":"1","PlanS_conform":"1","month":"10","external_id":{"arxiv":["2208.13499"]},"date_updated":"2025-12-30T06:39:56Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2025-10-01T00:00:00Z","publisher":"Springer Nature","publication_status":"published","arxiv":1,"publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"citation":{"ama":"Súkeník P, Lampert C. Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. 2025;37:24669–24683. doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","chicago":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>.","ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 24669–24683.","ieee":"P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” <i>Neural Computing and Applications</i>, vol. 37. Springer Nature, pp. 24669–24683, 2025.","apa":"Súkeník, P., &#38; Lampert, C. (2025). Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>","mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>."},"date_created":"2023-02-20T08:23:06Z","publication":"Neural Computing and Applications","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria)."},{"file_date_updated":"2025-12-16T12:32:40Z","has_accepted_license":"1","volume":267,"file":[{"file_name":"2025_ICML_Sieberling.pdf","relation":"main_file","date_created":"2025-12-16T12:32:40Z","creator":"dernst","date_updated":"2025-12-16T12:32:40Z","content_type":"application/pdf","access_level":"open_access","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","success":1,"file_size":908379,"file_id":"20828"}],"intvolume":"       267","status":"public","year":"2025","department":[{"_id":"DaAl"}],"alternative_title":["PMLR"],"type":"conference","title":"EvoPress: Accurate dynamic model compression via evolutionary search","abstract":[{"lang":"eng","text":"The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the \"importance\" of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths."}],"quality_controlled":"1","_id":"20820","page":"55556-55590","OA_type":"gold","article_processing_charge":"No","external_id":{"arxiv":["2410.14649"]},"date_updated":"2025-12-16T12:34:32Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2025-05-01T00:00:00Z","author":[{"full_name":"Sieberling, Oliver","last_name":"Sieberling","first_name":"Oliver"},{"full_name":"Kuznedelev, Denis","last_name":"Kuznedelev","first_name":"Denis"},{"id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar","last_name":"Kurtic","first_name":"Eldar"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"OA_place":"publisher","oa":1,"ddc":["000"],"corr_author":"1","month":"05","citation":{"mla":"Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 55556–90.","ista":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. 2025. EvoPress: Accurate dynamic model compression via evolutionary search. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 55556–55590.","ama":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic model compression via evolutionary search. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:55556-55590.","chicago":"Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In <i>42nd International Conference on Machine Learning</i>, 267:55556–90. ML Research Press, 2025.","short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.","ieee":"O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate dynamic model compression via evolutionary search,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.","apa":"Sieberling, O., Kuznedelev, D., Kurtic, E., &#38; Alistarh, D.-A. (2025). EvoPress: Accurate dynamic model compression via evolutionary search. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 55556–55590). Vancouver, Canada: ML Research Press."},"date_created":"2025-12-14T23:02:05Z","publication":"42nd International Conference on Machine Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"ML Research Press","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning"},"arxiv":1,"publication_identifier":{"eissn":["2640-3498"]},"day":"01","scopus_import":"1","language":[{"iso":"eng"}]},{"citation":{"mla":"Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 46026–72.","apa":"Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos, K., Alistarh, D.-A., &#38; Cevher, V. (2025). Layer-wise quantization for quantized optimistic dual averaging. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.","ista":"Nguyen AD, Markov I, Wu FZ, Ramezani-Kebrya A, Antonakopoulos K, Alistarh D-A, Cevher V. 2025. Layer-wise quantization for quantized optimistic dual averaging. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 46026–46072.","ama":"Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic dual averaging. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:46026-46072.","short":"A.D. Nguyen, I. Markov, F.Z. Wu, A. Ramezani-Kebrya, K. Antonakopoulos, D.-A. Alistarh, V. Cevher, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 46026–46072.","chicago":"Nguyen, Anh Duc, Ilia Markov, Frank Zhengqing Wu, Ali Ramezani-Kebrya, Kimon Antonakopoulos, Dan-Adrian Alistarh, and Volkan Cevher. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” In <i>42nd International Conference on Machine Learning</i>, 267:46026–72. ML Research Press, 2025.","ieee":"A. D. Nguyen <i>et al.</i>, “Layer-wise quantization for quantized optimistic dual averaging,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 46026–46072."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by Hasler Foundation Program: Hasler Responsible AI (project number 21043). The research was also sponsored by the Army Research Office and was accomplished under Grant Number W911NF-24-1-0048. This work was further funded by the Swiss National Science Foundation (SNSF) under grant number 200021_205011. We also acknowledge project A11 of the Swiss National Supercomputing Centre (CSCS) for providing computing resources. Dan Alistarh and Ilia Markov were supported in part through the ERC Proofof-Concept grant FastML (Grant Agreement 101158077). Ali Ramezani-Kebrya was supported by the Research Council of Norway through FRIPRO Grant under project number 356103, its Centres of Excellence scheme, Integreat - Norwegian Centre for knowledge-driven machine learning under\r\nproject number 332645 - and its Centre for Research-based Innovation funding scheme (Visual Intelligence under grant no. 309439).","date_created":"2025-12-14T23:02:06Z","publication":"42nd International Conference on Machine Learning","publication_status":"published","publisher":"ML Research Press","conference":{"start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada"},"day":"01","project":[{"name":"FastML: Efficient and Cost-Effective Distributed Machine Learning","_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","grant_number":"101158077"}],"language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["2640-3498"]},"arxiv":1,"external_id":{"arxiv":["2505.14371"]},"date_published":"2025-05-01T00:00:00Z","date_updated":"2025-12-16T12:46:54Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","author":[{"first_name":"Anh Duc","last_name":"Nguyen","full_name":"Nguyen, Anh Duc"},{"first_name":"Ilia","full_name":"Markov, Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"first_name":"Frank Zhengqing","last_name":"Wu","full_name":"Wu, Frank Zhengqing"},{"full_name":"Ramezani-Kebrya, Ali","last_name":"Ramezani-Kebrya","first_name":"Ali"},{"last_name":"Antonakopoulos","full_name":"Antonakopoulos, Kimon","first_name":"Kimon"},{"first_name":"Dan-Adrian","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Volkan","full_name":"Cevher, Volkan","last_name":"Cevher"}],"ddc":["000"],"oa":1,"month":"05","OA_place":"publisher","alternative_title":["PMLR"],"department":[{"_id":"DaAl"}],"title":"Layer-wise quantization for quantized optimistic dual averaging","abstract":[{"text":"Modern deep neural networks exhibit heterogeneity across numerous layers of various types such as residuals, multi-head attention, etc., due to varying structures (dimensions, activation functions, etc.), distinct representation characteristics, which impact predictions. We develop a general layer-wise quantization framework with tight variance and code-length bounds, adapting to the heterogeneities over the course of training. We then apply a new layer-wise quantization technique within distributed variational inequalities (VIs), proposing a novel Quantized Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which achieves competitive convergence rates for monotone VIs. We empirically show that QODA achieves up to a 150% speedup over the baselines in end-to-end training time for training Wasserstein GAN on 12+GPUs.","lang":"eng"}],"type":"conference","page":"46026-46072","quality_controlled":"1","_id":"20821","article_processing_charge":"No","OA_type":"gold","file_date_updated":"2025-12-16T12:45:41Z","has_accepted_license":"1","volume":267,"file":[{"success":1,"access_level":"open_access","checksum":"a7edf0e4304171a3e035842b3aab1704","file_id":"20830","file_size":756213,"date_updated":"2025-12-16T12:45:41Z","date_created":"2025-12-16T12:45:41Z","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2025_ICML_Nguyen.pdf"}],"status":"public","intvolume":"       267","year":"2025"},{"DOAJ_listed":"1","author":[{"first_name":"Mathieu","full_name":"Helfter, Mathieu","last_name":"Helfter","id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57"}],"month":"11","corr_author":"1","main_file_link":[{"url":"https://doi.org/10.4171/jfg/177","open_access":"1"}],"ddc":["500"],"oa":1,"article_type":"original","OA_place":"publisher","doi":"10.4171/jfg/177","date_published":"2025-11-07T00:00:00Z","oa_version":"Published Version","date_updated":"2026-06-18T18:26:33Z","publisher":"EMS Press","publication_status":"epub_ahead","scopus_import":"1","language":[{"iso":"eng"}],"day":"07","publication_identifier":{"issn":["2308-1309"],"eissn":["2308-1317"]},"citation":{"ieee":"M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” <i>Journal of Fractal Geometry</i>. EMS Press, 2025.","chicago":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>. EMS Press, 2025. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>.","ama":"Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>","short":"M. Helfter, Journal of Fractal Geometry (2025).","ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","apa":"Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. EMS Press. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>","mla":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>, EMS Press, 2025, doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Fractal Geometry","date_created":"2025-12-19T10:15:37Z","status":"public","year":"2025","_id":"20839","quality_controlled":"1","article_processing_charge":"Yes","OA_type":"gold","department":[{"_id":"VaKa"}],"abstract":[{"lang":"eng","text":"For every couple of Hausdorff functions ψ and φ verifying some mild assumptions, there exists a compact subset K of the Baire space such that the φ-Hausdorff measure and the ψ-packing measure on K are both finite and positive. Such examples are then embedded in any infinite dimensional Banach space to answer positively a question of Fan on the existence of metric spaces with arbitrary scales."}],"title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","type":"journal_article"},{"_id":"20842","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907"}],"day":"22","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"contributor":[{"last_name":"Rosello","first_name":"Pere"},{"last_name":"Mekonnen","first_name":"Manuel"},{"last_name":"Hosten","first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","contributor_type":"supervisor","orcid":"0000-0002-2031-204X"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20840"}]},"citation":{"apa":"Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>","ieee":"S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface.’” Institute of Science and Technology Austria, 2025.","ama":"Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>","ista":"Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>.","short":"S. Agafonova, (2025).","chicago":"Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>.","mla":"Agafonova, Sofia. <i>Research Data for: “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.”</i> Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>."},"type":"research_data","date_created":"2025-12-21T14:23:50Z","abstract":[{"lang":"eng","text":"Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240~microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface."}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","status":"public","file":[{"file_name":"AllData.zip","relation":"main_file","content_type":"application/x-zip-compressed","creator":"sagafono","date_created":"2025-12-22T13:45:30Z","date_updated":"2025-12-22T13:45:30Z","file_size":146656591,"file_id":"20854","access_level":"open_access","checksum":"7af34e4226a00cdcb7f154272050e217","success":1},{"file_id":"20855","file_size":93470129,"success":1,"checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","access_level":"open_access","creator":"sagafono","date_updated":"2025-12-22T13:45:33Z","date_created":"2025-12-22T13:45:33Z","content_type":"application/x-zip-compressed","relation":"main_file","file_name":"SourceData.zip"},{"date_created":"2025-12-22T13:51:09Z","creator":"sagafono","date_updated":"2025-12-22T13:51:09Z","content_type":"text/plain","relation":"main_file","file_name":"readme.txt","success":1,"access_level":"open_access","checksum":"08facd1b4a102f83e4d99d48a85b258d","file_id":"20856","file_size":461}],"author":[{"orcid":"0000-0003-0582-2946","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","first_name":"Sofya","full_name":"Agafonova, Sofya","last_name":"Agafonova"}],"year":"2025","doi":"10.15479/AT-ISTA-20842","corr_author":"1","month":"12","oa":1,"file_date_updated":"2025-12-22T13:51:09Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2026-06-10T08:36:07Z","has_accepted_license":"1","date_published":"2025-12-22T00:00:00Z"},{"oa_version":"Preprint","date_updated":"2025-12-29T11:51:13Z","date_published":"2025-12-05T00:00:00Z","OA_place":"repository","doi":"10.1007/978-3-032-12293-3_9","month":"12","main_file_link":[{"url":"https://eprint.iacr.org/2025/375","open_access":"1"}],"oa":1,"author":[{"full_name":"Agrawal, Shweta","last_name":"Agrawal","first_name":"Shweta"},{"last_name":"Modi","full_name":"Modi, Anuja","first_name":"Anuja"},{"id":"dc8f1524-403e-11ee-bf07-9649ad996e21","first_name":"Anshu","full_name":"Yadav, Anshu","last_name":"Yadav"},{"first_name":"Shota","full_name":"Yamada, Shota","last_name":"Yamada"}],"publication":"23rd International Conference on Theory of Cryptography","date_created":"2025-12-21T23:01:33Z","acknowledgement":"We thank Rachel Lin for expressing concern about the applicability of “HJL-style” attacks [15] on the construction in [2] during a talk by the first author about [2]. This was the starting point of the investigation that led us to develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for sharing his rationale for introducing evasive LWE.\r\nThe first author is supported by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship. The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras during which the collaboration was initiated. The 4th author is partly supported by JST CREST Grant Number JPMJCR22M1.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Agrawal, S., Modi, A., Yadav, A., &#38; Yamada, S. (2025). Zeroizing attacks against evasive and circular evasive LWE. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>","ieee":"S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive and circular evasive LWE,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.","chicago":"Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” In <i>23rd International Conference on Theory of Cryptography</i>, 16269:259–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>.","ama":"Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular evasive LWE. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16269. Springer Nature; 2025:259-290. doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>","ista":"Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive and circular evasive LWE. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290.","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","mla":"Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16269, Springer Nature, 2025, pp. 259–90, doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>."},"publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122926"]},"scopus_import":"1","language":[{"iso":"eng"}],"day":"05","conference":{"location":"Aarhus, Denmark","end_date":"2025-12-05","name":"TCC: Theory of Cryptography","start_date":"2025-12-01"},"publisher":"Springer Nature","publication_status":"published","volume":16269,"year":"2025","intvolume":"     16269","status":"public","type":"conference","abstract":[{"text":"We develop new attacks against the Evasive LWE family of assumptions, in both the public and private-coin regime. To the best of our knowledge, ours are the first attacks against Evasive LWE in the public-coin regime, for any instantiation from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption. This assumption has been popularly considered as a safe, public-coin instance of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10, 11]).\r\nWe provide the first attack against this assumption, challenging the widely held belief that this is a public-coin assumption.\r\n2. We demonstrate a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural parameter regime. Our attack crucially relies on the error in the pre-condition being larger than the error in the post-condition, necessitating a refinement of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal, Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against the assumption stated in the first posting of their work (subsequently refined to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently to [4]) provides a construction of obfuscation for pseudorandom functionalities by relying on private-coin evasive LWE. We provide a new attack against their stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived, “self-referential” classes of pseudorandom functionalities for which pseudorandom obfuscation cannot exist. We extend their techniques to develop an analogous result for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed to specifically avoid “zeroizing attacks”, our work shows that in certain settings, such attacks can still apply.","lang":"eng"}],"title":"Zeroizing attacks against evasive and circular evasive LWE","department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"OA_type":"green","article_processing_charge":"No","_id":"20845","quality_controlled":"1","page":"259-290"},{"date_published":"2025-12-05T00:00:00Z","oa_version":"Preprint","date_updated":"2025-12-29T11:11:29Z","month":"12","corr_author":"1","main_file_link":[{"url":"https://eprint.iacr.org/2025/1045","open_access":"1"}],"oa":1,"OA_place":"repository","doi":"10.1007/978-3-032-12290-2_16","author":[{"first_name":"Nicholas","last_name":"Brandt","full_name":"Brandt, Nicholas"},{"first_name":"Miguel","full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval","orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","first_name":"Christoph Ullrich","full_name":"Günther, Christoph Ullrich","last_name":"Günther"},{"first_name":"Akin","last_name":"Ünal","full_name":"Ünal, Akin","orcid":"0000-0002-8929-0221","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a"},{"last_name":"Wohnig","full_name":"Wohnig, Stella","first_name":"Stella"}],"acknowledgement":"We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"23rd International Conference on Theory of Cryptography","date_created":"2025-12-21T23:01:34Z","citation":{"mla":"Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation and Friends.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16271, Springer Nature, 2025, pp. 478–511, doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>.","apa":"Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., &#38; Wohnig, S. (2025). Constrained verifiable random functions without obfuscation and friends. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16271, pp. 478–511). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>","ieee":"N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained verifiable random functions without obfuscation and friends,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16271, pp. 478–511.","short":"N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511.","ama":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable random functions without obfuscation and friends. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:478-511. doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>","ista":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained verifiable random functions without obfuscation and friends. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16271, 478–511.","chicago":"Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal, and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation and Friends.” In <i>23rd International Conference on Theory of Cryptography</i>, 16271:478–511. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>."},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"grant_number":"F8509","name":"Security and Privacy by Design for Complex Systems","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1"}],"day":"05","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122896"]},"conference":{"end_date":"2025-12-05","name":"TCC: Theory of Cryptography","start_date":"2025-12-01","location":"Aarhus, Denmark"},"publication_status":"published","publisher":"Springer Nature","volume":16271,"year":"2025","intvolume":"     16271","status":"public","abstract":[{"lang":"eng","text":"CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.\r\nWe prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons."}],"title":"Constrained verifiable random functions without obfuscation and friends","type":"conference","alternative_title":["LNCS"],"department":[{"_id":"KrPi"}],"article_processing_charge":"No","OA_type":"green","page":"478-511","_id":"20846","quality_controlled":"1"},{"publication":"Physical Review E","date_created":"2025-12-21T23:01:34Z","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) [Grant DOI: 10.55776/ESP298]. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nAgreement No. 949120). This research was supported by the Scientific Service Units of The Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. We wish to acknowledge the crucial contributions of Alexandre Morin in getting the project off the ground, and Jack Merrin for creating the SU-8 deposition protocol used in the construction of our\r\ncells. We also wish to thank Kimberley Modic and Hamza Nasir for their work on single-particle characterization. ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” <i>Physical Review E</i>, vol. 112, no. 6, 065418, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>.","apa":"Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., &#38; Waitukaitis, S. R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>","ieee":"E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter,” <i>Physical Review E</i>, vol. 112, no. 6. American Physical Society, 2025.","short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","ama":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. 2025;112(6). doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>","ista":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. 2025. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical Review E. 112(6), 065418.","chicago":"Fitzgerald, Eavan, Cécile Clavaud, Debasish Das, Isaac C Lenton, and Scott R Waitukaitis. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” <i>Physical Review E</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>."},"publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"project":[{"_id":"bd8eede5-d553-11ed-ba76-eaded0d13485","name":"MixQUIckR: Mixing with QUIncke Rollers","grant_number":"E 298"},{"call_identifier":"H2020","grant_number":"949120","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}],"day":"01","publication_status":"published","publisher":"American Physical Society","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2025-12-29T11:19:34Z","date_published":"2025-12-01T00:00:00Z","article_number":"065418","external_id":{"arxiv":["2508.05643"]},"OA_place":"publisher","article_type":"original","doi":"10.1103/1ss8-31rb","corr_author":"1","PlanS_conform":"1","month":"12","ddc":["530"],"oa":1,"author":[{"last_name":"Fitzgerald","full_name":"Fitzgerald, Eavan","first_name":"Eavan","id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa"},{"first_name":"Cécile","last_name":"Clavaud","full_name":"Clavaud, Cécile","orcid":"0000-0002-1843-3803","id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8"},{"last_name":"Das","full_name":"Das, Debasish","first_name":"Debasish"},{"id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984","last_name":"Lenton","full_name":"Lenton, Isaac C","first_name":"Isaac C"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","first_name":"Scott R"}],"type":"journal_article","abstract":[{"lang":"eng","text":"We report on an experimental active matter system with motion restricted to four cardinal directions. Our particles are magnetite-doped colloidal spheres driven by the Quincke electrorotational instability. The absence of a magnetic field (|𝑩|=0) leads to circular trajectories interspersed with short spontaneous runs. Intermediate fields (|𝑩|≲20mT) linearize the motion along the axis perpendicular to 𝑩. At high magnetic fields, we observe the surprising emergence of a second, distinct linearization along the axis parallel to 𝑩. With numerical simulations, we show that this behavior can be explained by anisotropic magnetic susceptibility."}],"title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","department":[{"_id":"ScWa"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"_id":"20847","quality_controlled":"1","issue":"6","has_accepted_license":"1","volume":112,"file_date_updated":"2025-12-29T11:15:42Z","year":"2025","ec_funded":1,"intvolume":"       112","status":"public","file":[{"file_name":"2025_PhysReviewE_Fitzgerald.pdf","relation":"main_file","content_type":"application/pdf","date_updated":"2025-12-29T11:15:42Z","creator":"dernst","date_created":"2025-12-29T11:15:42Z","checksum":"d593e933f976c3f3cde37ad66539d57d","access_level":"open_access","success":1,"file_size":2131491,"file_id":"20862"}]},{"department":[{"_id":"NiBa"}],"type":"journal_article","abstract":[{"text":"Genetic variation that influences complex disease susceptibility is introduced into the population by mutation and removed by natural selection and genetic drift. This mutation–selection–drift balance (MSDB) shapes the prevalence of a disease and its genetic architecture. To date, however, MSDB has been modeled only for monogenic (Mendelian) diseases. Here, we develop an MSDB model for complex disease susceptibility: we assume that genotype relates to disease risk according to the canonical liability threshold model and that the selection on variants affecting risk stems from the fitness cost of the disease. We focus on diseases that are highly polygenic, entail a substantial fitness cost, and are neither extremely common in the population nor exceedingly rare. The comparison of model predictions with genome-wide association studies and other observations in humans indicates that common genetic variation affecting complex disease susceptibility is little affected by directional selection and instead shaped by pleiotropic stabilizing selection on other traits. In turn, directional selection may exert a more substantial effect on rare, large-effect variants. Our results also suggest that current estimates of disease heritability are likely biased. The model thus provides a better understanding of the evolutionary processes that shape the architecture and prevalence of complex diseases.","lang":"eng"}],"title":"Mutation–selection–drift balance models of complex diseases","_id":"20848","quality_controlled":"1","OA_type":"hybrid","article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2025-12-29T11:27:51Z","pmid":1,"issue":"4","volume":231,"has_accepted_license":"1","status":"public","intvolume":"       231","file":[{"checksum":"b02eb6b78028b8bef435edc8435a8468","access_level":"open_access","success":1,"file_size":1182339,"file_id":"20863","file_name":"2025_Genetics_Berg.pdf","relation":"main_file","creator":"dernst","date_created":"2025-12-29T11:27:51Z","date_updated":"2025-12-29T11:27:51Z","content_type":"application/pdf"}],"year":"2025","citation":{"mla":"Berg, Jeremy J., et al. “Mutation–Selection–Drift Balance Models of Complex Diseases.” <i>Genetics</i>, vol. 231, no. 4, iyaf220, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/genetics/iyaf220\">10.1093/genetics/iyaf220</a>.","apa":"Berg, J. J., Li, X., Riall, K., Hayward, L., &#38; Sella, G. (2025). Mutation–selection–drift balance models of complex diseases. <i>Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/genetics/iyaf220\">https://doi.org/10.1093/genetics/iyaf220</a>","ista":"Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift balance models of complex diseases. Genetics. 231(4), iyaf220.","chicago":"Berg, Jeremy J., Xinyi Li, Kellen Riall, Laura Hayward, and Guy Sella. “Mutation–Selection–Drift Balance Models of Complex Diseases.” <i>Genetics</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/genetics/iyaf220\">https://doi.org/10.1093/genetics/iyaf220</a>.","short":"J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).","ama":"Berg JJ, Li X, Riall K, Hayward L, Sella G. Mutation–selection–drift balance models of complex diseases. <i>Genetics</i>. 2025;231(4). doi:<a href=\"https://doi.org/10.1093/genetics/iyaf220\">10.1093/genetics/iyaf220</a>","ieee":"J. J. Berg, X. Li, K. Riall, L. Hayward, and G. Sella, “Mutation–selection–drift balance models of complex diseases,” <i>Genetics</i>, vol. 231, no. 4. Oxford University Press, 2025."},"publication":"Genetics","date_created":"2025-12-21T23:01:34Z","acknowledgement":"We thank Nick Barton, Magnus Nordborg, John Novembre, Molly Przeworski, and Himani Sachdeva for many helpful discussions and for comments on the manuscript, and we thank Joshua Schraiber and 2 anonymous reviewers for comments on the manuscript. We also thank members of the Sella, Przeworski and Andolfatto labs at Columbia University, and the Berg, Novembre and Steinrücken labs at the University of Chicago, for feedback on the work at various stages. This work was completed in part with resources provided by the University of Chicago's Research Computing Center. This work was supported by National Institutes of Health F32 grant GM126787 and R35 grant GM151257 to J.J.B. and National Institutes of Health R01 grant GM115889 to G.S.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Oxford University Press","publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"scopus_import":"1","language":[{"iso":"eng"}],"day":"01","article_number":"iyaf220","external_id":{"pmid":["41073879"]},"oa_version":"Published Version","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_updated":"2025-12-29T11:29:16Z","date_published":"2025-12-01T00:00:00Z","author":[{"first_name":"Jeremy J.","full_name":"Berg, Jeremy J.","last_name":"Berg"},{"first_name":"Xinyi","full_name":"Li, Xinyi","last_name":"Li"},{"full_name":"Riall, Kellen","last_name":"Riall","first_name":"Kellen"},{"first_name":"Laura","last_name":"Hayward","full_name":"Hayward, Laura","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b"},{"full_name":"Sella, Guy","last_name":"Sella","first_name":"Guy"}],"article_type":"original","OA_place":"publisher","doi":"10.1093/genetics/iyaf220","month":"12","ddc":["570"],"oa":1},{"pmid":1,"file_date_updated":"2025-12-29T09:36:50Z","volume":122,"has_accepted_license":"1","issue":"51","file":[{"relation":"main_file","file_name":"2025_PNAS_Svoboda.pdf","creator":"dernst","date_updated":"2025-12-29T09:36:50Z","date_created":"2025-12-29T09:36:50Z","content_type":"application/pdf","file_size":2308124,"file_id":"20860","access_level":"open_access","checksum":"dd50b62a1efc28c0133fe9c11dbee53c","success":1}],"intvolume":"       122","status":"public","ec_funded":1,"APC_amount":"3003,56 EUR","year":"2025","department":[{"_id":"KrCh"}],"title":"Promoters of cooperation in evolutionary games","abstract":[{"text":"Evolutionary games provide a flexible mathematical framework for many problems in biology and social evolution. Prisoners’ dilemma, and in particular, the important special case of donation games, represents social dilemmas where cooperation is mutually beneficial, yet defection is preferred by selfish agents. In evolutionary games on networks, the agents interact over a population structure. The existence of population structures that promote cooperative behavior is a fascinating and active research topic. Previous research establishes structures promoting cooperation in the limit of weak selection where the benefit-to-cost ratio β exceeds 1.5. The existence of such structures for medium and strong selection for 1 < ß < 2 and for weak selection for 1 < ß < 1.5 has been a long-standing open question. First, we answer the open questions in the affirmative: For every selection strength and every ß > 1, we construct networks promoting cooperation. Second, we present a robustness result with respect to β and selection strength: Our structures promote cooperation for a range of these parameter values rather than specific parameter values. Finally, we supplement our theoretical results with simulation results on small population structures that show the effectiveness of our construction over well-studied population structures.","lang":"eng"}],"type":"journal_article","page":"e2524109122","quality_controlled":"1","_id":"20857","article_processing_charge":"Yes (in subscription journal)","OA_type":"hybrid","external_id":{"pmid":["41397136"]},"date_published":"2025-12-15T00:00:00Z","date_updated":"2026-05-20T08:13:17Z","oa_version":"Published Version","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","last_name":"Svoboda","full_name":"Svoboda, Jakub","first_name":"Jakub"},{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"ddc":["000"],"oa":1,"month":"12","corr_author":"1","doi":"10.1073/pnas.2524109122","article_type":"original","OA_place":"publisher","citation":{"mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51, National Academy of Sciences, 2025, p. e2524109122, doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>.","apa":"Svoboda, J., &#38; Chatterjee, K. (2025). Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2025. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>.","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences 122 (2025) e2524109122.","ista":"Svoboda J, Chatterjee K. 2025. Promoters of cooperation in evolutionary games. Proceedings of the National Academy of Sciences. 122(51), e2524109122.","ama":"Svoboda J, Chatterjee K. Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. 2025;122(51):e2524109122. doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>","ieee":"J. Svoboda and K. Chatterjee, “Promoters of cooperation in evolutionary games,” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51. National Academy of Sciences, p. e2524109122, 2025."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.","date_created":"2025-12-28T23:01:26Z","publication":"Proceedings of the National Academy of Sciences","publisher":"National Academy of Sciences","publication_status":"published","day":"15","project":[{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1091-6490"]}},{"citation":{"mla":"Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments in Studies of Early Galaxies.” <i>Contemporary Physics</i>, vol. 66, no. 1–4, Taylor &#38; Francis, 2025, pp. 116–51, doi:<a href=\"https://doi.org/10.1080/00107514.2025.2586370\">10.1080/00107514.2025.2586370</a>.","ama":"Matthee JJ. JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. <i>Contemporary Physics</i>. 2025;66(1-4):116-151. doi:<a href=\"https://doi.org/10.1080/00107514.2025.2586370\">10.1080/00107514.2025.2586370</a>","chicago":"Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments in Studies of Early Galaxies.” <i>Contemporary Physics</i>. Taylor &#38; Francis, 2025. <a href=\"https://doi.org/10.1080/00107514.2025.2586370\">https://doi.org/10.1080/00107514.2025.2586370</a>.","short":"J.J. Matthee, Contemporary Physics 66 (2025) 116–151.","ista":"Matthee JJ. 2025. JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. Contemporary Physics. 66(1–4), 116–151.","ieee":"J. J. Matthee, “JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies,” <i>Contemporary Physics</i>, vol. 66, no. 1–4. Taylor &#38; Francis, pp. 116–151, 2025.","apa":"Matthee, J. J. (2025). JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. <i>Contemporary Physics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00107514.2025.2586370\">https://doi.org/10.1080/00107514.2025.2586370</a>"},"acknowledgement":"I thank Claudia Di Cesare, Edoardo Iani, Gauri Kotiwale and Wendy Sun for proofreading, Daichi Kashino, Gauri Kotiwale, Sara Mascia, Benjamín Navarette and Joris Witstok for their assistance in preparing some of the Figures, and Richard Ellis and Stephen Blundell for constructive comments. Funded by the European Union (ERC, AGENTS, 101076224).","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication":"Contemporary Physics","date_created":"2025-12-29T12:05:25Z","publication_status":"published","publisher":"Taylor & Francis","scopus_import":"1","language":[{"iso":"eng"}],"day":"04","project":[{"grant_number":"101076224","name":"Young galaxies as tracers and agents of cosmic reionization","_id":"bd9b2118-d553-11ed-ba76-db24564edfea"}],"arxiv":1,"publication_identifier":{"eissn":["1366-5812"],"issn":["0010-7514"]},"external_id":{"arxiv":["2511.04843"]},"date_published":"2025-12-04T00:00:00Z","oa_version":"Preprint","date_updated":"2026-04-07T08:44:00Z","author":[{"full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"}],"corr_author":"1","month":"12","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.04843"}],"OA_place":"repository","article_type":"original","doi":"10.1080/00107514.2025.2586370","department":[{"_id":"JoMa"}],"abstract":[{"text":"Studies of the distant Universe are providing key insights into our understanding of the formation of galaxies. The advent of the James Webb Space Telescope (JWST) has significantly enhanced our observational capabilities, leading to an expanded redshift frontier, providing unprecedented detail in the characterisation of early galaxies and enabling the discovery of new populations of accreting black holes. This review aims to provide an introduction to the basic processes and components that shape the observed spectra of galaxies, with a focus on their relevance to techniques with which high-redshift galaxies are selected. The review further introduces specific topics that have attracted significant attention in recent literature, including the discovery of highly efficient galaxy formation in the early Universe, the relation between galaxies and the process of reionization, new insights into the formation of the first stars and the enrichment of interstellar gas with heavy elements, and breakthroughs in our understanding of the origins of supermassive black holes.","lang":"eng"}],"title":"JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies","type":"journal_article","page":"116-151","_id":"20864","quality_controlled":"1","article_processing_charge":"No","OA_type":"green","volume":66,"issue":"1-4","status":"public","intvolume":"        66","year":"2025"},{"ec_funded":1,"year":"2025","status":"public","intvolume":"        62","file":[{"content_type":"application/pdf","date_updated":"2026-01-05T12:26:43Z","creator":"dernst","date_created":"2026-01-05T12:26:43Z","file_name":"2025_ActaInformatica_Bartocci.pdf","relation":"main_file","success":1,"access_level":"open_access","checksum":"06ed45a1218ad8464818803ae2968aaf","file_id":"20944","file_size":7117003}],"has_accepted_license":"1","volume":62,"issue":"4","file_date_updated":"2026-01-05T12:26:43Z","article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","_id":"20866","quality_controlled":"1","abstract":[{"lang":"eng","text":"In this work, we present hypernode automata as a specification formalism for hyperproperties of systems whose executions may be misaligned among themselves, such as concurrent systems. These automata consist of nodes labeled with hypernode logic formulas and transitions marked with synchronizing actions. Hypernode logic formulas establish relations between sequences of variable values among different system executions. This logic enables both synchronous and asynchronous analysis of traces. In its asynchronous view on execution traces, hypernode formulas establish relations on the order of value changes for each variable without correlating their timing. In both views, the analysis of different execution traces is synchronized through the transitions of hypernode automata. By combining logic’s declarative nature with automata’s procedural power, hypernode automata seamlessly integrate asynchronicity requirements at the node level with synchronicity between node transitions. We show that the model-checking problem for hypernode automata is decidable for specifications where each node specifies either a synchronous or an asynchronous requirement for the system’s executions, but not both."}],"title":"Hypernode automata","type":"journal_article","related_material":{"record":[{"relation":"earlier_version","id":"14405","status":"public"}]},"department":[{"_id":"ToHe"}],"corr_author":"1","month":"12","oa":1,"ddc":["000"],"OA_place":"publisher","article_type":"original","doi":"10.1007/s00236-025-00509-8","author":[{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","last_name":"Nickovic","first_name":"Dejan"},{"id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","orcid":"0000-0002-8741-5799","full_name":"Oliveira da Costa, Ana","last_name":"Oliveira da Costa","first_name":"Ana"}],"date_published":"2025-12-09T00:00:00Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-01-05T12:27:41Z","article_number":"43","external_id":{"arxiv":["2305.02836"]},"scopus_import":"1","language":[{"iso":"eng"}],"project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy"}],"day":"09","arxiv":1,"publication_identifier":{"eissn":["1432-0525"],"issn":["0001-5903"]},"publisher":"Springer Nature","publication_status":"published","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant VAMOS 101020093. Open access funding provided by Institute of Science and Technology (IST Austria).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Acta Informatica","date_created":"2025-12-29T12:07:12Z","citation":{"apa":"Bartocci, E., Chalupa, M., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Hypernode automata. <i>Acta Informatica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>","ista":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Hypernode automata. Acta Informatica. 62(4), 43.","ama":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. <i>Acta Informatica</i>. 2025;62(4). doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>","chicago":"Bartocci, Ezio, Marek Chalupa, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” <i>Acta Informatica</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>.","short":"E. Bartocci, M. Chalupa, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Acta Informatica 62 (2025).","ieee":"E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” <i>Acta Informatica</i>, vol. 62, no. 4. Springer Nature, 2025.","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” <i>Acta Informatica</i>, vol. 62, no. 4, 43, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>."}},{"arxiv":1,"publication_identifier":{"eissn":["1472-2739"],"issn":["1472-2747"]},"language":[{"iso":"eng"}],"scopus_import":"1","project":[{"call_identifier":"FWF","_id":"26AD5D90-B435-11E9-9278-68D0E5697425","name":"Algebraic Footprints of Geometric Features in Homology","grant_number":"I04245"}],"day":"20","publisher":"Mathematical Sciences Publishers","publication_status":"published","publication":"Algebraic & Geometric Topology","date_created":"2025-12-29T12:09:09Z","acknowledgement":"The author was supported by the FWF Grant, Project number I4245-N35. The author would like to thank Thomas Weighill for the helpful discussions around Theorem 3.10, and Takamitsu Yamauchi for bringing to my attention the fundamental reference [35]. Furthermore, the author\r\nis thankful for the detailed and helpful comments of the reviewer of this manuscript.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Zava, N. (2025). Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>","ieee":"N. Zava, “Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces,” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8. Mathematical Sciences Publishers, pp. 5153–5174, 2025.","ista":"Zava N. 2025. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. Algebraic &#38; Geometric Topology. 25(8), 5153–5174.","ama":"Zava N. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. 2025;25(8):5153-5174. doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>","chicago":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers, 2025. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>.","short":"N. Zava, Algebraic &#38; Geometric Topology 25 (2025) 5153–5174.","mla":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8, Mathematical Sciences Publishers, 2025, pp. 5153–74, doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>."},"OA_place":"publisher","article_type":"original","doi":"10.2140/agt.2025.25.5153","corr_author":"1","PlanS_conform":"1","month":"11","ddc":["500"],"oa":1,"author":[{"id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","orcid":"0000-0001-8686-1888","full_name":"Zava, Nicolò","last_name":"Zava","first_name":"Nicolò"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2026-01-05T12:19:09Z","date_published":"2025-11-20T00:00:00Z","external_id":{"arxiv":["2303.04730"]},"OA_type":"diamond","article_processing_charge":"No","_id":"20867","quality_controlled":"1","page":"5153-5174","type":"journal_article","abstract":[{"text":"We discuss the embeddability of subspaces of the Gromov–Hausdorff space, which consists of isometry classes of compact metric spaces endowed with the Gromov–Hausdorff distance, into Hilbert spaces. These embeddings are particularly valuable for applications to topological data analysis. We prove that its subspace consisting of metric spaces with at most n points has asymptotic dimension n(n−1)∕2. Thus, there exists a coarse embedding of that space into a Hilbert space. On the contrary, if the number of points is not bounded, then the subspace cannot be coarsely embedded into any uniformly convex Banach space and so, in particular, into any Hilbert space. Furthermore, we prove that, even if we restrict to finite metric spaces whose diameter is bounded by some constant, the subspace still cannot be bi-Lipschitz embedded into any finite-dimensional Hilbert space. We obtain both nonembeddability results by finding obstructions to coarse and bi-Lipschitz embeddings in families of isometry classes of finite subsets of the real line endowed with the Euclidean–Hausdorff distance.","lang":"eng"}],"title":"Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces","department":[{"_id":"HeEd"}],"year":"2025","status":"public","intvolume":"        25","file":[{"file_id":"20943","file_size":574389,"success":1,"checksum":"1e05b4f17a44500ae1ae1e21bc636f6a","access_level":"open_access","date_created":"2026-01-05T12:16:38Z","creator":"dernst","date_updated":"2026-01-05T12:16:38Z","content_type":"application/pdf","relation":"main_file","file_name":"2025_AlgebraicGeomTopology_Zava.pdf"}],"issue":"8","volume":25,"has_accepted_license":"1","file_date_updated":"2026-01-05T12:16:38Z"}]