[{"publication_status":"published","article_type":"original","author":[{"last_name":"Taylor","first_name":"J.","full_name":"Taylor, J."},{"last_name":"Čufar","first_name":"M.","full_name":"Čufar, M."},{"id":"cbddacee-2b11-11eb-a02e-a2e14d04e52d","full_name":"Mitrouskas, David Johannes","first_name":"David Johannes","last_name":"Mitrouskas"},{"orcid":"0000-0002-6781-0521","last_name":"Seiringer","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"},{"first_name":"E.","full_name":"Pahl, E.","last_name":"Pahl"},{"first_name":"J.","full_name":"Brand, J.","last_name":"Brand"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"scopus_import":"1","date_published":"2025-11-18T00:00:00Z","abstract":[{"text":"The one-dimensional Fröhlich model describing the motion of a single electron interacting with optical phonons is a paradigmatic model of quantum many-body physics. We predict the existence of an arbitrarily large number of bound excited states in the strong-coupling limit and calculate their excitation energies. Numerical simulations of a discretized model demonstrate the complete amelioration of the projector Monte Carlo sign problem by walker annihilation in an infinite Hilbert space. They reveal the threshold for the occurrence of the first bound excited states at a value of 𝛼≈1.73 for the dimensionless coupling constant. This puts the threshold into the regime of intermediate interaction strength. We find a significant spectral weight and increased phonon number of the bound excited state at threshold.","lang":"eng"}],"status":"public","OA_type":"green","acknowledgement":"We are grateful to Dmytro Kolisnyk for his help in working out the spectrum of the Hessian. This work was supported by the Marsden Fund of New Zealand (Contract No. MAU2007) from government funding administered by the Royal Society Te Apārangi and by a summer scholarship from Te Whai Ao – Dodd-Walls Centre for Photonic and Quantum Technologies and the Physics Department, University of Auckland. We acknowledge support by the New Zealand eScience Infrastructure (NeSI) high-performance computing facilities in the form of a merit project allocation.","arxiv":1,"article_processing_charge":"No","month":"11","year":"2025","_id":"21270","issue":"18","oa_version":"Preprint","title":"Bound excited states of Fröhlich polarons in one dimension","date_created":"2026-02-17T07:56:20Z","article_number":"184312","department":[{"_id":"RoSe"}],"intvolume":"       112","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"date_updated":"2026-02-18T08:23:59Z","OA_place":"repository","external_id":{"arxiv":["2506.02440 "]},"publication":"Physical Review B","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2506.02440 ","open_access":"1"}],"citation":{"ama":"Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. Bound excited states of Fröhlich polarons in one dimension. <i>Physical Review B</i>. 2025;112(18). doi:<a href=\"https://doi.org/10.1103/s9p9-jflq\">10.1103/s9p9-jflq</a>","chicago":"Taylor, J., M. Čufar, David Johannes Mitrouskas, Robert Seiringer, E. Pahl, and J. Brand. “Bound Excited States of Fröhlich Polarons in One Dimension.” <i>Physical Review B</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>.","short":"J. Taylor, M. Čufar, D.J. Mitrouskas, R. Seiringer, E. Pahl, J. Brand, Physical Review B 112 (2025).","mla":"Taylor, J., et al. “Bound Excited States of Fröhlich Polarons in One Dimension.” <i>Physical Review B</i>, vol. 112, no. 18, 184312, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/s9p9-jflq\">10.1103/s9p9-jflq</a>.","apa":"Taylor, J., Čufar, M., Mitrouskas, D. J., Seiringer, R., Pahl, E., &#38; Brand, J. (2025). Bound excited states of Fröhlich polarons in one dimension. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/s9p9-jflq\">https://doi.org/10.1103/s9p9-jflq</a>","ista":"Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. 2025. Bound excited states of Fröhlich polarons in one dimension. Physical Review B. 112(18), 184312.","ieee":"J. Taylor, M. Čufar, D. J. Mitrouskas, R. Seiringer, E. Pahl, and J. Brand, “Bound excited states of Fröhlich polarons in one dimension,” <i>Physical Review B</i>, vol. 112, no. 18. American Physical Society, 2025."},"volume":112,"publisher":"American Physical Society","day":"18","doi":"10.1103/s9p9-jflq","type":"journal_article"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"article_type":"original","publication_status":"published","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"author":[{"last_name":"Campbell","id":"582b06a9-1f1c-11ee-b076-82ffce00dde4","full_name":"Campbell, Andrew J","first_name":"Andrew J"},{"first_name":"Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio","last_name":"Cipolloni","orcid":"0000-0002-4901-7992"},{"last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László","full_name":"Erdös, László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ji, Hong Chang","id":"dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d","first_name":"Hong Chang","last_name":"Ji"}],"OA_type":"green","arxiv":1,"acknowledgement":"The authors would like to thank the anonymous referee for providing helpful comments and suggestions. We also thank Joscha Henheik and Volodymyr Riabov for pointing out a gap in an earlier version of the proof of equation (3.18). The first, third, and fourth authors are supported by ERC Advanced Grant “RMTBeyond” No. 101020331.","abstract":[{"lang":"eng","text":"For general non-Hermitian large random matrices X and deterministic deformation matrices A, we prove that the local eigenvalue statistics of A+X close to the typical edge points of its spectrum are universal. Furthermore, we show that, under natural assumptions, on A the spectrum of A+X does not have outliers at a distance larger than the natural fluctuation scale of the eigenvalues. As a consequence, the number of eigenvalues in each component of Spec(A+X) is deterministic."}],"date_published":"2025-11-01T00:00:00Z","status":"public","month":"11","article_processing_charge":"No","title":"On the spectral edge of non-Hermitian random matrices","_id":"21271","issue":"6","year":"2025","oa_version":"Preprint","date_created":"2026-02-17T07:58:20Z","department":[{"_id":"LaEr"}],"OA_place":"repository","date_updated":"2026-02-18T08:35:38Z","corr_author":"1","external_id":{"arxiv":["2404.17512"]},"quality_controlled":"1","language":[{"iso":"eng"}],"intvolume":"        53","publication_identifier":{"eissn":["2168-894X"],"issn":["0091-1798"]},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2404.17512","open_access":"1"}],"publication":"The Annals of Probability","publisher":"Institute of Mathematical Statistics","doi":"10.1214/25-aop1761","day":"01","page":"2256-2308","type":"journal_article","ec_funded":1,"citation":{"ama":"Campbell AJ, Cipolloni G, Erdös L, Ji HC. On the spectral edge of non-Hermitian random matrices. <i>The Annals of Probability</i>. 2025;53(6):2256-2308. doi:<a href=\"https://doi.org/10.1214/25-aop1761\">10.1214/25-aop1761</a>","chicago":"Campbell, Andrew J, Giorgio Cipolloni, László Erdös, and Hong Chang Ji. “On the Spectral Edge of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-aop1761\">https://doi.org/10.1214/25-aop1761</a>.","short":"A.J. Campbell, G. Cipolloni, L. Erdös, H.C. Ji, The Annals of Probability 53 (2025) 2256–2308.","ieee":"A. J. Campbell, G. Cipolloni, L. Erdös, and H. C. Ji, “On the spectral edge of non-Hermitian random matrices,” <i>The Annals of Probability</i>, vol. 53, no. 6. Institute of Mathematical Statistics, pp. 2256–2308, 2025.","mla":"Campbell, Andrew J., et al. “On the Spectral Edge of Non-Hermitian Random Matrices.” <i>The Annals of Probability</i>, vol. 53, no. 6, Institute of Mathematical Statistics, 2025, pp. 2256–308, doi:<a href=\"https://doi.org/10.1214/25-aop1761\">10.1214/25-aop1761</a>.","apa":"Campbell, A. J., Cipolloni, G., Erdös, L., &#38; Ji, H. C. (2025). On the spectral edge of non-Hermitian random matrices. <i>The Annals of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-aop1761\">https://doi.org/10.1214/25-aop1761</a>","ista":"Campbell AJ, Cipolloni G, Erdös L, Ji HC. 2025. On the spectral edge of non-Hermitian random matrices. The Annals of Probability. 53(6), 2256–2308."},"volume":53},{"citation":{"ama":"Eder PJ, Kerschbaumer A, Finžgar JR, et al. Quantum-guided cluster algorithms for combinatorial optimization. In: <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE; 2025. doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>","chicago":"Eder, Peter J., Aron Kerschbaumer, Jernej Rudi Finžgar, Raimel A Medina Ramos, Martin J. A. Schuetz, Helmut G. Katzgraber, Sarah Braun, and Christian B. Mendl. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. IEEE, 2025. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>.","short":"P.J. Eder, A. Kerschbaumer, J.R. Finžgar, R.A. Medina Ramos, M.J.A. Schuetz, H.G. Katzgraber, S. Braun, C.B. Mendl, in:, 2025 IEEE International Conference on Quantum Computing and Engineering, IEEE, 2025.","ista":"Eder PJ, Kerschbaumer A, Finžgar JR, Medina Ramos RA, Schuetz MJA, Katzgraber HG, Braun S, Mendl CB. 2025. Quantum-guided cluster algorithms for combinatorial optimization. 2025 IEEE International Conference on Quantum Computing and Engineering. QCE: International Conference on Quantum Computing and Engineering.","mla":"Eder, Peter J., et al. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.” <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, IEEE, 2025, doi:<a href=\"https://doi.org/10.1109/qce65121.2025.00033\">10.1109/qce65121.2025.00033</a>.","apa":"Eder, P. J., Kerschbaumer, A., Finžgar, J. R., Medina Ramos, R. A., Schuetz, M. J. A., Katzgraber, H. G., … Mendl, C. B. (2025). Quantum-guided cluster algorithms for combinatorial optimization. In <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>. Albuquerque, NM, United States: IEEE. <a href=\"https://doi.org/10.1109/qce65121.2025.00033\">https://doi.org/10.1109/qce65121.2025.00033</a>","ieee":"P. J. Eder <i>et al.</i>, “Quantum-guided cluster algorithms for combinatorial optimization,” in <i>2025 IEEE International Conference on Quantum Computing and Engineering</i>, Albuquerque, NM, United States, 2025."},"type":"conference","day":"01","doi":"10.1109/qce65121.2025.00033","publisher":"IEEE","publication":"2025 IEEE International Conference on Quantum Computing and Engineering","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2508.10656","open_access":"1"}],"publication_identifier":{"eisbn":["9798331557362"]},"language":[{"iso":"eng"}],"quality_controlled":"1","corr_author":"1","external_id":{"arxiv":["2508.10656"]},"OA_place":"repository","date_updated":"2026-02-18T08:45:56Z","department":[{"_id":"MaSe"}],"date_created":"2026-02-17T08:00:17Z","oa_version":"Preprint","_id":"21272","year":"2025","title":"Quantum-guided cluster algorithms for combinatorial optimization","article_processing_charge":"No","month":"09","status":"public","date_published":"2025-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"Finding the ground state of Ising spin glasses is notoriously difficult due to disorder and frustration. Often, this challenge is framed as a combinatorial optimization problem, for which a common strategy employs simulated annealing, a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these localized updates can cause the system to become trapped in local minima. Cluster algorithms (CAs) were developed to address this limitation and have demonstrated considerable success in studying ferromagnetic systems; however, they tend to encounter percolation issues when applied to generic spin glasses. In this work, we introduce a novel CA designed to tackle these challenges by leveraging precomputed two-point correlations, aiming solve combinatorial optimization problems in the form of Max-Cut more efficiently. In our approach, clusters are formed probabilistically based on these correlations. Various classical and quantum algorithms can be employed to generate correlations that embody information about the energy landscape of the problem. By utilizing this information, the algorithm aims to identify groups of spins whose simultaneous flipping induces large transitions in configuration space with high acceptance probability - even at low energy levels - thereby escaping local minima more effectively. Notably, clusters generated using correlations from the Quantum Approximate Optimization Algorithm exhibit high acceptance rates at low temperatures. These acceptance rates often increase with circuit depth, accelerating the algorithm and enabling more efficient exploration of the solution space."}],"arxiv":1,"acknowledgement":"P.J.E was partially funded by the German BMWK project QCHALLenge (Grant No. 01MQ22008B).\r\n","conference":{"location":"Albuquerque, NM, United States","start_date":"2025-08-30","end_date":"2025-09-05","name":"QCE: International Conference on Quantum Computing and Engineering"},"OA_type":"green","author":[{"first_name":"Peter J.","full_name":"Eder, Peter J.","last_name":"Eder"},{"last_name":"Kerschbaumer","orcid":"0009-0002-2370-8661","first_name":"Aron","full_name":"Kerschbaumer, Aron","id":"ade85a9c-3200-11ee-973b-91c1eb240410"},{"full_name":"Finžgar, Jernej Rudi","first_name":"Jernej Rudi","last_name":"Finžgar"},{"first_name":"Raimel A","id":"CE680B90-D85A-11E9-B684-C920E6697425","full_name":"Medina Ramos, Raimel A","last_name":"Medina Ramos","orcid":"0000-0002-5383-2869"},{"last_name":"Schuetz","full_name":"Schuetz, Martin J. A.","first_name":"Martin J. A."},{"last_name":"Katzgraber","full_name":"Katzgraber, Helmut G.","first_name":"Helmut G."},{"full_name":"Braun, Sarah","first_name":"Sarah","last_name":"Braun"},{"last_name":"Mendl","first_name":"Christian B.","full_name":"Mendl, Christian B."}],"publication_status":"published","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"06","article_processing_charge":"No","alternative_title":["LIPIcs"],"title":"Incremental approximate maximum flow via residual graph sparsification","year":"2025","_id":"21280","oa_version":"Published Version","file":[{"date_updated":"2026-02-18T09:02:33Z","file_name":"2025_ICALP_Goranci.pdf","checksum":"c178cf554e44204b9f64ebd9b54cf7ba","success":1,"relation":"main_file","file_size":944824,"file_id":"21315","access_level":"open_access","creator":"dernst","date_created":"2026-02-18T09:02:33Z","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"name":"Efficient algorithms","grant_number":"Z00422","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775","name":"Fast Algorithms for a Reactive Network Layer"}],"publication_status":"published","author":[{"last_name":"Goranci","full_name":"Goranci, Gramoz","first_name":"Gramoz"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger"},{"last_name":"Räcke","first_name":"Harald","full_name":"Räcke, Harald"},{"last_name":"Sricharan","full_name":"Sricharan, A.","first_name":"A."}],"OA_type":"gold","conference":{"location":"Aarhus, Denmark","start_date":"2025-07-08","end_date":"2025-07-11","name":"ICALP: Automata, Languages and Programming"},"acknowledgement":"Monika Henzinger and A. R. Sricharan: This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI\r\n10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024. Harald Räcke: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","arxiv":1,"ddc":["000"],"date_published":"2025-06-30T00:00:00Z","scopus_import":"1","abstract":[{"text":"We give an algorithm that, with high probability, maintains a (1-ε)-approximate s-t maximum flow in undirected, uncapacitated n-vertex graphs undergoing m edge insertions in Õ(m+ n F^*/ε) total update time, where F^{*} is the maximum flow on the final graph. This is the first algorithm to achieve polylogarithmic amortized update time for dense graphs (m = Ω(n²)), and more generally, for graphs where F^* = Õ(m/n). At the heart of our incremental algorithm is the residual graph sparsification technique of Karger and Levine [SICOMP '15], originally designed for computing exact maximum flows in the static setting. Our main contributions are (i) showing how to maintain such sparsifiers for approximate maximum flows in the incremental setting and (ii) generalizing the cut sparsification framework of Fung et al. [SICOMP '19] from undirected graphs to balanced directed graphs.","lang":"eng"}],"status":"public","publication":"52nd International Colloquium on Automata, Languages, and Programming","page":"91:1-91:20","day":"30","doi":"10.4230/lipics.icalp.2025.91","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","ec_funded":1,"citation":{"short":"G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20.","mla":"Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 91:1-91:20, doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>.","apa":"Goranci, G., Henzinger, M., Räcke, H., &#38; Sricharan, A. (2025). Incremental approximate maximum flow via residual graph sparsification. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334, p. 91:1-91:20). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>","ista":"Goranci G, Henzinger M, Räcke H, Sricharan A. 2025. Incremental approximate maximum flow via residual graph sparsification. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334, 91:1-91:20.","ieee":"G. Goranci, M. Henzinger, H. Räcke, and A. Sricharan, “Incremental approximate maximum flow via residual graph sparsification,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334, p. 91:1-91:20.","ama":"Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum flow via residual graph sparsification. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:91:1-91:20. doi:<a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">10.4230/lipics.icalp.2025.91</a>","chicago":"Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental Approximate Maximum Flow via Residual Graph Sparsification.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, 334:91:1-91:20. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.icalp.2025.91\">https://doi.org/10.4230/lipics.icalp.2025.91</a>."},"volume":334,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2026-02-17T08:26:06Z","file_date_updated":"2026-02-18T09:02:33Z","department":[{"_id":"MoHe"}],"date_updated":"2026-02-18T09:06:12Z","has_accepted_license":"1","OA_place":"publisher","external_id":{"arxiv":["2502.09105"]},"corr_author":"1","intvolume":"       334","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783959773720"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","file_name":"2025_FSTTCS_Asadi.pdf","date_updated":"2026-02-18T09:13:25Z","content_type":"application/pdf","creator":"dernst","date_created":"2026-02-18T09:13:25Z","access_level":"open_access","file_id":"21316","file_size":1054007,"relation":"main_file"}],"oa":1,"publication_status":"published","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","first_name":"Ali","last_name":"Asadi"},{"first_name":"Leonard","full_name":"Brice, Leonard","last_name":"Brice"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Thejaswini","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S.","first_name":"K. S."}],"OA_type":"gold","arxiv":1,"ddc":["000"],"conference":{"location":"Pilani, India","start_date":"2025-12-17","end_date":"2025-12-19","name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science"},"acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n","abstract":[{"text":"A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.\r\nThe problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. \r\nWe further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small.","lang":"eng"}],"date_published":"2025-12-09T00:00:00Z","status":"public","month":"12","alternative_title":["LIPIcs"],"article_processing_charge":"Yes","title":"ε-stationary Nash equilibria in multi-player stochastic graph games","_id":"21281","year":"2025","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file_date_updated":"2026-02-18T09:13:25Z","date_created":"2026-02-17T08:27:14Z","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-02-19T09:39:15Z","corr_author":"1","external_id":{"arxiv":["2508.15356"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       360","publication_identifier":{"isbn":["9783959774062"]},"publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","day":"09","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/lipics.fsttcs.2025.9","page":"9:1-9:17","ec_funded":1,"type":"conference","citation":{"chicago":"Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>.","ama":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>","ieee":"A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 9:1-9:17.","ista":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria in multi-player stochastic graph games. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 9:1-9:17.","apa":"Asadi, A., Brice, L., Chatterjee, K., &#38; Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>","mla":"Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>.","short":"A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17."},"volume":360},{"external_id":{"arxiv":["2508.20170"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-02-19T07:27:01Z","publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       990","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"PlanS_conform":"1","department":[{"_id":"IlCa"}],"article_number":"L57","file_date_updated":"2026-02-19T07:24:10Z","date_created":"2026-02-18T10:17:04Z","type":"journal_article","doi":"10.3847/2041-8213/adff82","publisher":"IOP Publishing","day":"08","volume":990,"citation":{"ama":"Galiullin I, Rodriguez AC, El-Badry K, et al. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. 2025;990(2). doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>","chicago":"Galiullin, Ilkham, Antonio C. Rodriguez, Kareem El-Badry, Ilaria Caiazzo, Paula Szkody, Pranav Nagarajan, and Samuel Whitebook. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>. IOP Publishing, 2025. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>.","short":"I. Galiullin, A.C. Rodriguez, K. El-Badry, I. Caiazzo, P. Szkody, P. Nagarajan, S. Whitebook, The Astrophysical Journal Letters 990 (2025).","mla":"Galiullin, Ilkham, et al. “Optical Spectroscopy of the Most Compact Accreting Binary Harboring a Magnetic White Dwarf and a Hydrogen-Rich Donor.” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2, L57, IOP Publishing, 2025, doi:<a href=\"https://doi.org/10.3847/2041-8213/adff82\">10.3847/2041-8213/adff82</a>.","apa":"Galiullin, I., Rodriguez, A. C., El-Badry, K., Caiazzo, I., Szkody, P., Nagarajan, P., &#38; Whitebook, S. (2025). Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. <i>The Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/adff82\">https://doi.org/10.3847/2041-8213/adff82</a>","ista":"Galiullin I, Rodriguez AC, El-Badry K, Caiazzo I, Szkody P, Nagarajan P, Whitebook S. 2025. Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor. The Astrophysical Journal Letters. 990(2), L57.","ieee":"I. Galiullin <i>et al.</i>, “Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor,” <i>The Astrophysical Journal Letters</i>, vol. 990, no. 2. IOP Publishing, 2025."},"DOAJ_listed":"1","publication":"The Astrophysical Journal Letters","ddc":["520"],"arxiv":1,"acknowledgement":"Based on observations obtained with the Samuel Oschin Telescope 48 inch and the 60 inch Telescope at the Palomar Observatory as part of the Zwicky Transient Facility project. ZTF is supported by the National Science Foundation under grants No. AST-1440341 and AST-2034437 and a collaboration including current partners Caltech, IPAC, the Weizmann Institute of Science, the Oskar Klein Center at Stockholm University, the University of Maryland, Deutsches Elektronen-Synchrotron and Humboldt University, the TANGO Consortium of Taiwan, the University of Wisconsin at Milwaukee, Trinity College Dublin, Lawrence Livermore National Laboratories, IN2P3, University of Warwick, Ruhr University Bochum, Northwestern University and former partners the University of Washington, Los Alamos National Laboratories, and Lawrence Berkeley National Laboratories. Operations are conducted by COO, IPAC, and UW. This work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC; https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement. Some of the data presented herein were obtained at Keck Observatory, which is a private 501(c)3 nonprofit organization operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation. We wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the Native Hawaiian community. We are most fortunate to have had the opportunity to conduct observations from this mountain. We are grateful to the staff of the Palomar and Keck Observatories for their work in helping us carry out our observations.\r\n\r\nI.G. acknowledges support from Kazan Federal University. A.C.R. acknowledges support from the National Science Foundation via an NSF Graduate Research Fellowship. We thank the anonymous referee for useful comments and suggestions, which contributed to the improvement of this manuscript.","OA_type":"gold","status":"public","abstract":[{"text":"Accreting white dwarfs (WDs) in close binary systems, commonly known as cataclysmic variables (CVs), with orbital periods below the canonical period minimum (≈80 minutes) are rare. Such short periods can only be reached if the donor star in the CV is either significantly evolved before initiating mass transfer to the WD or is metal-poor. We present optical photometry and spectroscopy of Gaia19bxc, a high-amplitude variable identified as a polar CV with an exceptionally short orbital period of 64.42 minutes—well below the canonical CV period minimum. High-speed photometry confirms persistent double-peaked variability consistent with cyclotron beaming, thus indicating the presence of a magnetic WD. Phase-resolved Keck/Low-Resolution Imaging Spectrometer (LRIS) spectroscopy reveals strong hydrogen and helium emission lines but no donor features, indicating the accretor is a magnetic WD and the donor is hydrogen-rich, but cold and faint. The absence of a detectable donor and the low inferred temperature (≲3500 K) disfavor an evolved donor scenario. Instead, the short period and the system’s halo-like kinematics suggest Gaia19bxc may be the first known metal-poor polar. Because metal-poor donors are more compact than solar-metallicity donors of the same mass, they can reach shorter minimum periods. Gaia19bxc is one of only a handful of known metal-poor CVs below the canonical period minimum and has the shortest period of any such magnetic system discovered to date.","lang":"eng"}],"scopus_import":"1","date_published":"2025-09-08T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_size":3772189,"relation":"main_file","file_id":"21329","creator":"dernst","date_created":"2026-02-19T07:24:10Z","access_level":"open_access","content_type":"application/pdf","file_name":"2025_AstrophysicalJournal_Galiullin.pdf","date_updated":"2026-02-19T07:24:10Z","checksum":"f76556d129aa0e9facc85602b0b5b54d","success":1}],"author":[{"first_name":"Ilkham","full_name":"Galiullin, Ilkham","last_name":"Galiullin"},{"last_name":"Rodriguez","first_name":"Antonio C.","full_name":"Rodriguez, Antonio C."},{"first_name":"Kareem","full_name":"El-Badry, Kareem","last_name":"El-Badry"},{"last_name":"Caiazzo","orcid":"0000-0002-4770-5388","first_name":"Ilaria","id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d","full_name":"Caiazzo, Ilaria"},{"full_name":"Szkody, Paula","first_name":"Paula","last_name":"Szkody"},{"first_name":"Pranav","full_name":"Nagarajan, Pranav","last_name":"Nagarajan"},{"last_name":"Whitebook","full_name":"Whitebook, Samuel","first_name":"Samuel"}],"publication_status":"published","article_type":"original","title":"Optical spectroscopy of the most compact accreting binary harboring a magnetic White Dwarf and a hydrogen-rich donor","oa_version":"Published Version","issue":"2","_id":"21317","year":"2025","month":"09","article_processing_charge":"Yes"},{"publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       135","external_id":{"arxiv":["2408.01264"],"pmid":["40929305"]},"OA_place":"repository","date_updated":"2026-02-24T07:03:57Z","department":[{"_id":"JoFi"}],"article_number":"083601","date_created":"2026-02-18T10:19:30Z","volume":135,"citation":{"ama":"Rossi M, Militaru A, Carlon Zambon N, et al. Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. 2025;135(8). doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>","chicago":"Rossi, M., Andrei Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, and L. Novotny. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>.","short":"M. Rossi, A. Militaru, N. Carlon Zambon, A. Riera-Campeny, O. Romero-Isart, M. Frimmer, L. Novotny, Physical Review Letters 135 (2025).","apa":"Rossi, M., Militaru, A., Carlon Zambon, N., Riera-Campeny, A., Romero-Isart, O., Frimmer, M., &#38; Novotny, L. (2025). Quantum delocalization of a levitated nanoparticle. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/2yzc-fsm3\">https://doi.org/10.1103/2yzc-fsm3</a>","mla":"Rossi, M., et al. “Quantum Delocalization of a Levitated Nanoparticle.” <i>Physical Review Letters</i>, vol. 135, no. 8, 083601, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/2yzc-fsm3\">10.1103/2yzc-fsm3</a>.","ista":"Rossi M, Militaru A, Carlon Zambon N, Riera-Campeny A, Romero-Isart O, Frimmer M, Novotny L. 2025. Quantum delocalization of a levitated nanoparticle. Physical Review Letters. 135(8), 083601.","ieee":"M. Rossi <i>et al.</i>, “Quantum delocalization of a levitated nanoparticle,” <i>Physical Review Letters</i>, vol. 135, no. 8. American Physical Society, 2025."},"type":"journal_article","doi":"10.1103/2yzc-fsm3","day":"19","publisher":"American Physical Society","publication":"Physical Review Letters","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2408.01264","open_access":"1"}],"status":"public","abstract":[{"text":"Matter waves have been observed in double-slit experiments with microscopic objects, such as atoms or molecules. The wave function describing the motion of these objects must extend over a distance comparable to the slit separation, much larger than the characteristic size of the objects. Preparing such states for more massive objects, such as mechanical oscillators, remains an outstanding challenge. Here we delocalize the quantum ground state of an optically levitated nanosphere by modulating the stiffness of the confining potential. We show a more than threefold increase of the initial coherence length, which corresponds to mechanical momentum squeezing of more than 7 dB. Our work is a stepping stone toward the generation of coherence lengths comparable to the object size, a crucial regime for macroscopic quantum experiments.","lang":"eng"}],"date_published":"2025-08-19T00:00:00Z","arxiv":1,"OA_type":"green","author":[{"last_name":"Rossi","first_name":"M.","full_name":"Rossi, M."},{"first_name":"Andrei","full_name":"Militaru, Andrei","id":"d67706f8-8eb1-11ee-ad1b-9c30dfa19e0b","last_name":"Militaru"},{"last_name":"Carlon Zambon","first_name":"N.","full_name":"Carlon Zambon, N."},{"last_name":"Riera-Campeny","first_name":"A.","full_name":"Riera-Campeny, A."},{"first_name":"O.","full_name":"Romero-Isart, O.","last_name":"Romero-Isart"},{"full_name":"Frimmer, M.","first_name":"M.","last_name":"Frimmer"},{"full_name":"Novotny, L.","first_name":"L.","last_name":"Novotny"}],"publication_status":"published","article_type":"original","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","_id":"21318","issue":"8","year":"2025","title":"Quantum delocalization of a levitated nanoparticle","article_processing_charge":"No","month":"08","pmid":1},{"external_id":{"arxiv":["2407.11752"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-02-19T07:43:29Z","publication_identifier":{"isbn":["9783959773720"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       334","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"KrCh"}],"file_date_updated":"2026-02-19T07:41:55Z","date_created":"2026-02-18T10:44:14Z","type":"conference","ec_funded":1,"day":"30","doi":"10.4230/LIPIcs.ICALP.2025.87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":334,"citation":{"ista":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. 2025. IID prophet inequality with random horizon: Going beyond increasing hazard rates. 52nd International Colloquium on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming, LIPIcs, vol. 334.","apa":"Giambartolomei, G., Mallmann-Trenn, F., &#38; Saona Urmeneta, R. J. (2025). IID prophet inequality with random horizon: Going beyond increasing hazard rates. In <i>52nd International Colloquium on Automata, Languages, and Programming</i> (Vol. 334). Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>","mla":"Giambartolomei, Giordano, et al. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” <i>52nd International Colloquium on Automata, Languages, and Programming</i>, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>.","ieee":"G. Giambartolomei, F. Mallmann-Trenn, and R. J. Saona Urmeneta, “IID prophet inequality with random horizon: Going beyond increasing hazard rates,” in <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Aarhus, Denmark, 2025, vol. 334.","short":"G. Giambartolomei, F. Mallmann-Trenn, R.J. Saona Urmeneta, in:, 52nd International Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Giambartolomei, Giordano, Frederik Mallmann-Trenn, and Raimundo J Saona Urmeneta. “IID Prophet Inequality with Random Horizon: Going beyond Increasing Hazard Rates.” In <i>52nd International Colloquium on Automata, Languages, and Programming</i>, Vol. 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">https://doi.org/10.4230/LIPIcs.ICALP.2025.87</a>.","ama":"Giambartolomei G, Mallmann-Trenn F, Saona Urmeneta RJ. IID prophet inequality with random horizon: Going beyond increasing hazard rates. In: <i>52nd International Colloquium on Automata, Languages, and Programming</i>. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ICALP.2025.87\">10.4230/LIPIcs.ICALP.2025.87</a>"},"publication":"52nd International Colloquium on Automata, Languages, and Programming","arxiv":1,"ddc":["000"],"acknowledgement":"We would like to thank José Correa for his precious advice, Bruno Ziliotto and Vasilis Livanos for early conversations. Giambartolomei, Giordano: EPSRC grants EP/W005573/1 and EP/X021696/1. Mallmann-Trenn, Frederik: EPSRC grant EP/W005573/1. Saona, Raimundo: ERC grant CoG 863818 (ForM-SMArt), ANID Chile grant ACT210005, French Agence Nationale de la Recherche (ANR) grant ANR-21-CE40-0020 (CONVERGENCE), and Austrian Science Fund (FWF) grant 10.55776/COE12.","conference":{"location":"Aarhus, Denmark","start_date":"2025-07-08","name":"ICALP: Automata, Languages and Programming","end_date":"2025-07-11"},"OA_type":"gold","status":"public","abstract":[{"lang":"eng","text":"Prophet inequalities are a central object of study in optimal stopping theory. In the iid model, a gambler sees values in an online fashion, sampled independently from a given distribution. Upon observing each value, the gambler either accepts it as a reward, or irrevocably rejects it and proceeds to observe the next value. The goal of the gambler, who cannot see the future, is to maximise the expected value of the reward while competing against the expectation of a prophet (the offline maximum). In other words, one seeks to maximise the gambler-to-prophet ratio of the expectations. \r\nThis model has been studied with infinite, finite and unknown number of values. When the gambler faces a random number of values, the model is said to have a random horizon. We consider the model in which the gambler is given a priori knowledge of the horizon’s distribution. Alijani et al. (2020) designed a single-threshold algorithm achieving a ratio of 1/2 when the random horizon has an increasing hazard rate and is independent of the values. We prove that with a single threshold, a ratio of 1/2 is actually achievable for several larger classes of horizon distributions, with the largest being known as the 𝒢 class in reliability theory. Moreover, we show that this does not extend to its dual, the  ̅𝒢 class (which includes the decreasing hazard rate class), while it can be extended to low-variance horizons. Finally, we construct the first example of a family of horizons, for which multiple thresholds are necessary to achieve a nonzero ratio. We establish that the Secretary Problem optimal stopping rule provides one such algorithm, paving the way towards the study of the model beyond single-threshold algorithms."}],"date_published":"2025-06-30T00:00:00Z","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"960110956c26a5cefadde8e47888bfbe","success":1,"date_updated":"2026-02-19T07:41:55Z","file_name":"2025_ICALP_Giambartolomei.pdf","access_level":"open_access","date_created":"2026-02-19T07:41:55Z","creator":"dernst","content_type":"application/pdf","file_size":876167,"relation":"main_file","file_id":"21331"}],"author":[{"last_name":"Giambartolomei","full_name":"Giambartolomei, Giordano","first_name":"Giordano"},{"last_name":"Mallmann-Trenn","full_name":"Mallmann-Trenn, Frederik","first_name":"Frederik"},{"first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X"}],"publication_status":"published","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"title":"IID prophet inequality with random horizon: Going beyond increasing hazard rates","oa_version":"Published Version","_id":"21320","year":"2025","month":"06","alternative_title":["LIPIcs"],"article_processing_charge":"No"},{"citation":{"mla":"Xiao, Shanshan, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>, vol. 18, no. 1, 94907072, Tsinghua University Press, 2025, doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>.","apa":"Xiao, S., Zhao, M., Li, M., Wan, S., Genç, A., Huang, L., … Cabot, A. (2025). Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. Tsinghua University Press. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>","ista":"Xiao S, Zhao M, Li M, Wan S, Genç A, Huang L, Chen L, Zhang Y, Ibáñez M, Lim KH, Hong M, Liu Y, Cabot A. 2025. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. Nano Research. 18(1), 94907072.","ieee":"S. Xiao <i>et al.</i>, “Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>,” <i>Nano Research</i>, vol. 18, no. 1. Tsinghua University Press, 2025.","short":"S. Xiao, M. Zhao, M. Li, S. Wan, A. Genç, L. Huang, L. Chen, Y. Zhang, M. Ibáñez, K.H. Lim, M. Hong, Y. Liu, A. Cabot, Nano Research 18 (2025).","chicago":"Xiao, Shanshan, Mingjun Zhao, Mingquan Li, Shanhong Wan, Aziz Genç, Lulu Huang, Lei Chen, et al. “Band and Defect Engineering in Solution-Processed Nanocrystal Building Blocks to Promote Transport Properties in Nanomaterials: The Case of Thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>.” <i>Nano Research</i>. Tsinghua University Press, 2025. <a href=\"https://doi.org/10.26599/nr.2025.94907072\">https://doi.org/10.26599/nr.2025.94907072</a>.","ama":"Xiao S, Zhao M, Li M, et al. Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>. <i>Nano Research</i>. 2025;18(1). doi:<a href=\"https://doi.org/10.26599/nr.2025.94907072\">10.26599/nr.2025.94907072</a>"},"volume":18,"publisher":"Tsinghua University Press","day":"01","doi":"10.26599/nr.2025.94907072","type":"journal_article","publication":"Nano Research","intvolume":"        18","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1998-0124"],"eissn":["1998-0000"]},"date_updated":"2026-02-19T07:32:22Z","OA_place":"publisher","has_accepted_license":"1","date_created":"2026-02-18T10:45:06Z","file_date_updated":"2026-02-19T07:31:15Z","article_number":"94907072","department":[{"_id":"MaIb"}],"PlanS_conform":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"year":"2025","_id":"21321","issue":"1","oa_version":"Published Version","title":"Band and defect engineering in solution-processed nanocrystal building blocks to promote transport properties in nanomaterials: The case of thermoelectric Cu            <sub>3</sub>SbSe            <sub>4</sub>","article_processing_charge":"Yes (in subscription journal)","month":"01","abstract":[{"text":"The development of cost-effective and high-performance thermoelectric (TE) materials faces significant challenges, particularly in improving the properties of promising copper-based TE materials such as Cu3SbSe4, which are limited by their poor electrical conductivity. This study presents a detailed comparative analysis of three strategies to promote the electrical transport properties of Cu3SbSe4 through Sn doping: conventional Sn atomic doping, surface treatment with SnSe molecular complexes, and blending with SnSe nanocrystals to form nanocomposites, all followed by annealing and hot pressing under identical conditions. Our results reveal that a surface treatment using SnSe molecular complexes significantly enhances TE performance over atomic doping and nanocomposite formation, achieving a power factor of 1.1 mW·m−1·K−2 and a maximum dimensionless figure of merit zT value of 0.80 at 640 K, representing an excellent performance among Cu3SbSe4-based materials produced via solution-processing methods. This work highlights the effectiveness of surface engineering in optimizing the transport properties of nanostructured materials, demonstrating the versatility and cost-efficiency of solution-based technologies in the development of advanced nanostructured materials for application in the field of TE among others.","lang":"eng"}],"date_published":"2025-01-01T00:00:00Z","status":"public","OA_type":"hybrid","acknowledgement":"Y. L. acknowledges funding from the National Natural Science Foundation of China (No. 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (No. 2022LCX002), and the Fundamental Research Funds for the Central Universities (No. JZ2024HGTB0239). K. H. L. acknowledges financial support from the National Natural Science Foundation of China (No. 22208293). M. I. acknowledge financial support from ISTA and the Werner Siemens Foundation. M. H. acknowledges funding from Australian Research Council (No. FT230100316). L. L. H. and S. H. W. acknowledge the Fundamental Research Funds for the Central Universities (Nos. JZ2023HGTA0179 and JZ2024HGTA0170).","ddc":["540"],"project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"article_type":"original","publication_status":"published","author":[{"last_name":"Xiao","full_name":"Xiao, Shanshan","first_name":"Shanshan"},{"last_name":"Zhao","full_name":"Zhao, Mingjun","first_name":"Mingjun"},{"full_name":"Li, Mingquan","first_name":"Mingquan","last_name":"Li"},{"last_name":"Wan","full_name":"Wan, Shanhong","first_name":"Shanhong"},{"last_name":"Genç","first_name":"Aziz","full_name":"Genç, Aziz"},{"first_name":"Lulu","full_name":"Huang, Lulu","last_name":"Huang"},{"full_name":"Chen, Lei","first_name":"Lei","last_name":"Chen"},{"last_name":"Zhang","first_name":"Yu","full_name":"Zhang, Yu"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843"},{"last_name":"Lim","full_name":"Lim, Khak Ho","first_name":"Khak Ho"},{"last_name":"Hong","first_name":"Min","full_name":"Hong, Min"},{"last_name":"Liu","first_name":"Yu","full_name":"Liu, Yu"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"file":[{"file_name":"2025_NanoResearch_Xiao.pdf","date_updated":"2026-02-19T07:31:15Z","success":1,"checksum":"aa531f1363538fece12ecfad83456b65","file_id":"21330","file_size":27740524,"relation":"main_file","content_type":"application/pdf","date_created":"2026-02-19T07:31:15Z","creator":"dernst","access_level":"open_access"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Juraj","full_name":"Belohorec, Juraj","last_name":"Belohorec"},{"first_name":"Pavel","full_name":"Dvořák, Pavel","last_name":"Dvořák"},{"first_name":"Charlotte","full_name":"Hoffmann, Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","orcid":"0000-0003-2027-5549","last_name":"Hoffmann"},{"last_name":"Hubáček","first_name":"Pavel","full_name":"Hubáček, Pavel"},{"last_name":"Mašková","full_name":"Mašková, Kristýna","first_name":"Kristýna"},{"last_name":"Pastyřík","full_name":"Pastyřík, Martin","first_name":"Martin"}],"publication_status":"published","acknowledgement":"Juraj Belohorec, Pavel Hubáček, and Kristýna Mašková were partially supported by the Academy of Sciences of the Czech Republic (RVO 67985840), Czech Science Foundation GAČR grant No. 25-16311S, and by Zircuit. Pavel Dvořák was supported by Czech Science Foundation GAČR grant No. 22-14872O. Juraj Belohorec and Kristýna Mašková were supported by the grant SVV–2025–260822.","conference":{"end_date":"2025-08-221","name":"CRYPTO: International Cryptology Conference","start_date":"2025-08-17","location":"Santa Barbara, CA, United States"},"OA_type":"green","status":"public","date_published":"2025-08-17T00:00:00Z","abstract":[{"lang":"eng","text":"We present a unifying framework for proving the knowledge-soundness of KZG-like polynomial commitment schemes, encompassing both univariate and multivariate variants. By conceptualizing the proof technique of Lipmaa, Parisella, and Siim for the univariate KZG scheme (EUROCRYPT 2024), we present tools and falsifiable hardness assumptions that permit black-box extraction of the multivariate KZG scheme. Central to our approach is the notion of a canonical Proof-of-Knowledge of a Polynomial (PoKoP) of a polynomial commitment scheme, which we use to capture the extractability notion required in constructions of practical zk-SNARKs. We further present an explicit polynomial decomposition lemma for multivariate polynomials, enabling a more direct analysis of interpolating extractors and bridging the gap between univariate and multivariate commitments. Our results provide the first standard-model proofs of extractability for the multivariate KZG scheme and many of its variants under falsifiable assumptions."}],"month":"08","alternative_title":["LNCS"],"article_processing_charge":"No","title":"On extractability of the KZG family of polynomial commitment schemes","oa_version":"Preprint","_id":"21323","year":"2025","department":[{"_id":"KrPi"}],"date_created":"2026-02-18T10:59:58Z","OA_place":"repository","date_updated":"2026-02-19T07:50:33Z","publication_identifier":{"eisbn":["9783032018878"],"isbn":["9783032018861"],"issn":["0302-9743"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"     16005","main_file_link":[{"url":"https://eprint.iacr.org/2025/514","open_access":"1"}],"publication":"45th Annual International Cryptology Conference","type":"conference","publisher":"Springer Nature","doi":"10.1007/978-3-032-01887-8_19","day":"17","page":"584-616","volume":16005,"citation":{"ama":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. On extractability of the KZG family of polynomial commitment schemes. In: <i>45th Annual International Cryptology Conference</i>. Vol 16005. Springer Nature; 2025:584-616. doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>","chicago":"Belohorec, Juraj, Pavel Dvořák, Charlotte Hoffmann, Pavel Hubáček, Kristýna Mašková, and Martin Pastyřík. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” In <i>45th Annual International Cryptology Conference</i>, 16005:584–616. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>.","short":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, M. Pastyřík, in:, 45th Annual International Cryptology Conference, Springer Nature, 2025, pp. 584–616.","ieee":"J. Belohorec, P. Dvořák, C. Hoffmann, P. Hubáček, K. Mašková, and M. Pastyřík, “On extractability of the KZG family of polynomial commitment schemes,” in <i>45th Annual International Cryptology Conference</i>, Santa Barbara, CA, United States, 2025, vol. 16005, pp. 584–616.","mla":"Belohorec, Juraj, et al. “On Extractability of the KZG Family of Polynomial Commitment Schemes.” <i>45th Annual International Cryptology Conference</i>, vol. 16005, Springer Nature, 2025, pp. 584–616, doi:<a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">10.1007/978-3-032-01887-8_19</a>.","apa":"Belohorec, J., Dvořák, P., Hoffmann, C., Hubáček, P., Mašková, K., &#38; Pastyřík, M. (2025). On extractability of the KZG family of polynomial commitment schemes. In <i>45th Annual International Cryptology Conference</i> (Vol. 16005, pp. 584–616). Santa Barbara, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-01887-8_19\">https://doi.org/10.1007/978-3-032-01887-8_19</a>","ista":"Belohorec J, Dvořák P, Hoffmann C, Hubáček P, Mašková K, Pastyřík M. 2025. On extractability of the KZG family of polynomial commitment schemes. 45th Annual International Cryptology Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16005, 584–616."}},{"citation":{"short":"S. Bombari, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 4839–4873.","ieee":"S. Bombari and M. Mondelli, “Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 4839–4873.","apa":"Bombari, S., &#38; Mondelli, M. (2025). Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 4839–4873). Vancouver, Canada: ML Research Press.","ista":"Bombari S, Mondelli M. 2025. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 4839–4873.","mla":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 4839–73.","ama":"Bombari S, Mondelli M. Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:4839-4873.","chicago":"Bombari, Simone, and Marco Mondelli. “Spurious Correlations in High Dimensional Regression: The Roles of Regularization, Simplicity Bias and over-Parameterization.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:4839–73. ML Research Press, 2025."},"volume":267,"day":"30","publisher":"ML Research Press","page":"4839-4873","type":"conference","publication":"Proceedings of the 42nd International Conference on Machine Learning","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       267","publication_identifier":{"eissn":["2640-3498"]},"OA_place":"publisher","has_accepted_license":"1","date_updated":"2026-02-19T08:08:55Z","corr_author":"1","external_id":{"arxiv":["2502.01347"]},"date_created":"2026-02-18T11:58:00Z","file_date_updated":"2026-02-19T08:04:38Z","department":[{"_id":"MaMo"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"21324","year":"2025","oa_version":"Published Version","title":"Spurious correlations in high dimensional regression: The roles of regularization, simplicity bias and over-parameterization","article_processing_charge":"No","alternative_title":["PMLR"],"month":"07","abstract":[{"text":"Learning models have been shown to rely on spurious correlations between non-predictive features and the associated labels in the training data, with negative implications on robustness, bias and fairness. In this work, we provide a statistical characterization of this phenomenon for high-dimensional regression, when the data contains a predictive core feature x and a spurious feature y. Specifically, we quantify the amount of spurious correlations C learned via linear regression, in terms of the data covariance and the strength λ of the ridge regularization. As a consequence, we first capture the simplicity of y through the spectrum of its covariance, and its correlation with x through the Schur complement of the full data covariance. Next, we prove a trade-off between C and the in-distribution test loss L, by showing that the value of λ that minimizes L lies in an interval where C is increasing. Finally, we investigate the effects of over-parameterization via the random features model, by showing its equivalence to regularized linear regression. Our theoretical results are supported by numerical experiments on Gaussian, Color-MNIST, and CIFAR-10 datasets.","lang":"eng"}],"date_published":"2025-07-30T00:00:00Z","status":"public","OA_type":"gold","ddc":["000"],"arxiv":1,"conference":{"start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada"},"acknowledgement":"Marco Mondelli is funded by the European Union (ERC, INF2, project number 101161364). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. Simone Bombari is supported by a Google PhD fellowship. The authors would like to thank GuanWen Qiu for helpful discussions.","publication_status":"published","project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","grant_number":"101161364"},{"_id":"92099302-16d5-11f0-9cad-f9a785f54fbd","name":"Trustworthy Deep Learning Theory: Private Over-Parameterized Models and Robust LLMs"}],"author":[{"last_name":"Bombari","first_name":"Simone","id":"ca726dda-de17-11ea-bc14-f9da834f63aa","full_name":"Bombari, Simone"},{"last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"date_updated":"2026-02-19T08:04:38Z","file_name":"2025_ICML_Bombari.pdf","checksum":"d4ba4f7717b362ca38878f45e57bd643","success":1,"file_size":887526,"relation":"main_file","file_id":"21335","access_level":"open_access","date_created":"2026-02-19T08:04:38Z","creator":"dernst","content_type":"application/pdf"}],"oa":1},{"abstract":[{"lang":"eng","text":"Test-time training (TTT) methods explicitly update the weights of a model to adapt to the specific test instance, and they have found success in a variety of settings, including most recently language modeling and reasoning. To demystify this success, we investigate a gradient-based TTT algorithm for in-context learning, where we train a transformer model on the in-context demonstrations provided in the test prompt. Specifically, we provide a comprehensive theoretical characterization of linear transformers when the update rule is a single gradient step. Our theory (i) delineates the role of alignment between pretraining distribution and target task, (ii) demystifies how TTT can alleviate distribution shift, and (iii) quantifies the sample complexity of TTT including how it can significantly reduce the eventual sample size required for in-context learning. As our empirical contribution, we study the benefits of TTT for TabPFN, a tabular foundation model. In line with our theory, we demonstrate that TTT significantly reduces the required sample size for tabular classification (3 to 5 times fewer) unlocking substantial inference efficiency with a negligible training cost."}],"date_published":"2025-11-30T00:00:00Z","status":"public","OA_type":"gold","ddc":["000"],"conference":{"location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19","start_date":"2025-07-13"},"acknowledgement":"H.A.G., M.E.I., X.Z., and S.O. were supported in part by the NSF grants CCF2046816, CCF-2403075, CCF-2008020, and the Office of Naval Research grant N000142412289.\r\nM. M. is funded by the European Union (ERC, INF2 , project number 101161364). Views and opinions expressed are, however, those of the author(s) only and do not necessarily\r\nreflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. M.S. is supported by the Packard Fellowship in Science and Engineering, a Sloan Research Fellowship in Mathematics, an NSF-CAREER under award #1846369, DARPA FastNICS program, and NSF-CIF awards #1813877 and #2008443, and NIH DP2LM014564-01. The authors also\r\nacknowledge further support from Open Philanthropy, OpenAI, Amazon Research, Google Research, and Microsoft Research.","publication_status":"published","project":[{"grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits"}],"author":[{"full_name":"Gozeten, Halil Alperen","first_name":"Halil Alperen","last_name":"Gozeten"},{"first_name":"Muhammed Emrullah","full_name":"Ildiz, Muhammed Emrullah","last_name":"Ildiz"},{"last_name":"Zhang","full_name":"Zhang, Xuechen","first_name":"Xuechen"},{"first_name":"Mahdi","full_name":"Soltanolkotabi, Mahdi","last_name":"Soltanolkotabi"},{"first_name":"Marco","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"last_name":"Oymak","first_name":"Samet","full_name":"Oymak, Samet"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_name":"2025_ICML_Gozeten.pdf","date_updated":"2026-02-19T08:15:48Z","checksum":"f774f8619a0d72f3975d9cb23942a1e9","success":1,"file_size":471176,"relation":"main_file","file_id":"21336","creator":"dernst","date_created":"2026-02-19T08:15:48Z","access_level":"open_access","content_type":"application/pdf"}],"oa":1,"_id":"21325","year":"2025","oa_version":"Published Version","title":"Test-time training provably improves transformers as in-context learners","alternative_title":["PMLR"],"article_processing_charge":"No","pmid":1,"month":"11","language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"       267","publication_identifier":{"eissn":["2640-3498"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-02-19T08:18:24Z","external_id":{"pmid":["41321376"]},"date_created":"2026-02-18T12:00:44Z","file_date_updated":"2026-02-19T08:15:48Z","department":[{"_id":"MaMo"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"citation":{"short":"H.A. Gozeten, M.E. Ildiz, X. Zhang, M. Soltanolkotabi, M. Mondelli, S. Oymak, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 20266–20295.","mla":"Gozeten, Halil Alperen, et al. “Test-Time Training Provably Improves Transformers as in-Context Learners.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 20266–95.","ista":"Gozeten HA, Ildiz ME, Zhang X, Soltanolkotabi M, Mondelli M, Oymak S. 2025. Test-time training provably improves transformers as in-context learners. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 20266–20295.","apa":"Gozeten, H. A., Ildiz, M. E., Zhang, X., Soltanolkotabi, M., Mondelli, M., &#38; Oymak, S. (2025). Test-time training provably improves transformers as in-context learners. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 20266–20295). Vancouver, Canada: ML Research Press.","ieee":"H. A. Gozeten, M. E. Ildiz, X. Zhang, M. Soltanolkotabi, M. Mondelli, and S. Oymak, “Test-time training provably improves transformers as in-context learners,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 20266–20295.","ama":"Gozeten HA, Ildiz ME, Zhang X, Soltanolkotabi M, Mondelli M, Oymak S. Test-time training provably improves transformers as in-context learners. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:20266-20295.","chicago":"Gozeten, Halil Alperen, Muhammed Emrullah Ildiz, Xuechen Zhang, Mahdi Soltanolkotabi, Marco Mondelli, and Samet Oymak. “Test-Time Training Provably Improves Transformers as in-Context Learners.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:20266–95. ML Research Press, 2025."},"volume":267,"publisher":"ML Research Press","day":"30","page":"20266-20295","type":"conference","publication":"Proceedings of the 42nd International Conference on Machine Learning"},{"month":"07","article_processing_charge":"No","alternative_title":["PMLR"],"title":"Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime","oa_version":"Published Version","year":"2025","_id":"21326","oa":1,"file":[{"file_name":"2025_ICML_Wu.pdf","date_updated":"2026-02-19T08:28:22Z","checksum":"c5ce8b1c83e33dc3a11122f4910deb67","success":1,"relation":"main_file","file_size":3994385,"file_id":"21337","creator":"dernst","date_created":"2026-02-19T08:28:22Z","access_level":"open_access","content_type":"application/pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Diyuan","id":"1a5914c2-896a-11ed-bdf8-fb80621a0635","full_name":"Wu, Diyuan","last_name":"Wu"},{"orcid":"0000-0002-3242-7020","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco"}],"publication_status":"published","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For the purpose of open access, the authors have applied a CC BY public\r\ncopyright license to any Author Accepted Manuscript version arising from this submission. The authors would like to thank Peter Sukenık for general helpful discussions and for pointing out that all the stationary points are approximately proportional in the case without entropic regularization. ","conference":{"start_date":"2025-07-13","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19","location":"Vancouver, Canada"},"arxiv":1,"ddc":["000"],"OA_type":"gold","status":"public","date_published":"2025-07-30T00:00:00Z","abstract":[{"text":"Neural Collapse is a phenomenon where the last-layer representations of a well-trained neural network converge to a highly structured geometry. In this paper, we focus on its first (and most basic) property, known as NC1: the within-class variability vanishes. While prior theoretical studies establish the occurrence of NC1 via the data-agnostic unconstrained features model, our work adopts a data-specific perspective, analyzing NC1 in a three-layer neural network, with the first two layers operating in the mean-field regime and followed by a linear layer. In particular, we establish a fundamental connection between NC1 and the loss landscape: we prove that points with small empirical loss and gradient norm (thus, close to being stationary) approximately satisfy NC1, and the closeness to NC1 is controlled by the residual loss and gradient norm. We then show that (i) gradient flow on the mean squared error converges to NC1 solutions with small empirical loss, and (ii) for well-separated data distributions, both NC1 and vanishing test loss are achieved simultaneously. This aligns with the empirical observation that NC1 emerges during training while models attain near-zero test error. Overall, our results demonstrate that NC1 arises from gradient training due to the properties of the loss landscape, and they show the co-occurrence of NC1 and small test error for certain data distributions.","lang":"eng"}],"publication":"Proceedings of the 42nd International Conference on Machine Learning","type":"conference","page":"67499-67536","publisher":"ML Research Press","day":"30","volume":267,"citation":{"ieee":"D. Wu and M. Mondelli, “Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 67499–67536.","mla":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 67499–536.","apa":"Wu, D., &#38; Mondelli, M. (2025). Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 67499–67536). Vancouver, Canada: ML Research Press.","ista":"Wu D, Mondelli M. 2025. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 67499–67536.","short":"D. Wu, M. Mondelli, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 67499–67536.","chicago":"Wu, Diyuan, and Marco Mondelli. “Neural Collapse beyond the Unconstrained Features Model: Landscape, Dynamics, and Generalization in the Mean-Field Regime.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:67499–536. ML Research Press, 2025.","ama":"Wu D, Mondelli M. Neural collapse beyond the unconstrained features model: Landscape, dynamics, and generalization in the mean-field regime. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:67499-67536."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"MaMo"}],"file_date_updated":"2026-02-19T08:28:22Z","date_created":"2026-02-18T12:02:45Z","external_id":{"arxiv":["2501.19104"]},"corr_author":"1","date_updated":"2026-02-19T08:30:42Z","OA_place":"publisher","has_accepted_license":"1","publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       267","language":[{"iso":"eng"}],"quality_controlled":"1"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"acknowledged_ssus":[{"_id":"ScienComp"}],"file_date_updated":"2026-02-19T08:56:10Z","date_created":"2026-02-18T12:11:17Z","department":[{"_id":"PaSc"},{"_id":"AlBr"},{"_id":"GradSch"}],"date_updated":"2026-02-19T08:56:43Z","OA_place":"publisher","has_accepted_license":"1","external_id":{"arxiv":["2502.09372"]},"corr_author":"1","intvolume":"       267","language":[{"iso":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["2640-3498"]},"publication":"Proceedings of the 42nd International Conference on Machine Learning","page":"42366 - 42393","publisher":"ML Research Press","day":"30","type":"conference","citation":{"short":"S.A. Maddipatla, N.E. Sellam, M.I. Bojan, S. Vedula, P. Schanda, A. Marx, A.M. Bronstein, in:, Proceedings of the 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 42366–42393.","ieee":"S. A. Maddipatla <i>et al.</i>, “Inverse problems with experiment-guided AlphaFold,” in <i>Proceedings of the 42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 42366–42393.","apa":"Maddipatla, S. A., Sellam, N. E., Bojan, M. I., Vedula, S., Schanda, P., Marx, A., &#38; Bronstein, A. M. (2025). Inverse problems with experiment-guided AlphaFold. In <i>Proceedings of the 42nd International Conference on Machine Learning</i> (Vol. 267, pp. 42366–42393). Vancouver, Canada: ML Research Press.","ista":"Maddipatla SA, Sellam NE, Bojan MI, Vedula S, Schanda P, Marx A, Bronstein AM. 2025. Inverse problems with experiment-guided AlphaFold. Proceedings of the 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 42366–42393.","mla":"Maddipatla, Sai A., et al. “Inverse Problems with Experiment-Guided AlphaFold.” <i>Proceedings of the 42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 42366–93.","ama":"Maddipatla SA, Sellam NE, Bojan MI, et al. Inverse problems with experiment-guided AlphaFold. In: <i>Proceedings of the 42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:42366-42393.","chicago":"Maddipatla, Sai A, Nadav E Sellam, Meital I Bojan, Sanketh Vedula, Paul Schanda, Ailie Marx, and Alex M. Bronstein. “Inverse Problems with Experiment-Guided AlphaFold.” In <i>Proceedings of the 42nd International Conference on Machine Learning</i>, 267:42366–93. ML Research Press, 2025."},"volume":267,"file":[{"checksum":"f33230a6d59b7978d4cd72795e4e9059","success":1,"date_updated":"2026-02-19T08:56:10Z","file_name":"2025_ICML_Maddipatla.pdf","access_level":"open_access","creator":"dernst","date_created":"2026-02-19T08:56:10Z","content_type":"application/pdf","file_size":1924177,"relation":"main_file","file_id":"21338"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"project":[{"grant_number":"I05812","_id":"eb9c82eb-77a9-11ec-83b8-aadd536561cf","name":"AlloSpace. The emergence and mechanisms of allostery"},{"_id":"bdb9578d-d553-11ed-ba76-ed5d39fce6f0","grant_number":"I06223","name":"Structure and mechanism of the mitochondrial MIM insertase"}],"publication_status":"published","author":[{"id":"e957f5e5-91c9-11f0-a95f-e090f66ecb4d","full_name":"Maddipatla, Sai A","first_name":"Sai A","last_name":"Maddipatla"},{"id":"ef280fe0-91c9-11f0-a95f-8dea3f5bc513","full_name":"Sellam, Nadav E","first_name":"Nadav E","last_name":"Sellam"},{"last_name":"Bojan","first_name":"Meital I","id":"11d88cf5-91ca-11f0-a95f-edf9f08f47b7","full_name":"Bojan, Meital I"},{"last_name":"Vedula","first_name":"Sanketh","id":"94f2fe44-70fa-11f0-b76b-92922c09452b","full_name":"Vedula, Sanketh"},{"full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"},{"last_name":"Marx","full_name":"Marx, Ailie","first_name":"Ailie"},{"full_name":"Bronstein, Alexander","id":"58f3726e-7cba-11ef-ad8b-e6e8cb3904e6","first_name":"Alexander","last_name":"Bronstein","orcid":"0000-0001-9699-8730"}],"OA_type":"gold","acknowledgement":"This work was supported by the Israeli Science Foundation (ISF) grant number 1834/24. We acknowledge support from the Austrian Science Fund (FWF, grant numbers I5812-B and I6223) and the financial support of the Helmsley Fellowships Program for Sustainability and Health. This research uses resources of the Institute of Science and Technology Austria’s scientific computing cluster. ","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning"},"ddc":["000","540"],"arxiv":1,"abstract":[{"lang":"eng","text":"Proteins exist as a dynamic ensemble of multiple conformations, and these motions are often crucial for their functions. However, current structure prediction methods predominantly yield a single conformation, overlooking the conformational heterogeneity revealed by diverse experimental modalities. Here, we present a framework for building experiment-grounded protein structure generative models that infer conformational ensembles consistent with measured experimental data. The key idea is to treat stateof-the-art protein structure predictors (e.g., AlphaFold3) as sequence-conditioned structural priors, and cast ensemble modeling as posterior inference of protein structures given experimental measurements. Through extensive real-data experiments, we demonstrate the generality of our method to incorporate a variety of experimental measurements. In particular, our framework uncovers previously unmodeled conformational heterogeneity from crystallographic densities, and generates high-accuracy NMR ensembles orders of magnitude faster than the status quo. Notably, we demonstrate that our ensembles outperform AlphaFold3 (Abramson et al., 2024) and sometimes better fit experimental data than publicly deposited structures to the Protein Data Bank (PDB, Burley et al. (2017)). We believe that this approach will unlock building predictive models that fully embrace experimentally observed conformational diversity."}],"date_published":"2025-07-30T00:00:00Z","status":"public","month":"07","alternative_title":["PMLR"],"article_processing_charge":"No","title":"Inverse problems with experiment-guided AlphaFold","year":"2025","_id":"21327","oa_version":"Published Version"},{"external_id":{"arxiv":["2502.01583"]},"corr_author":"1","date_updated":"2026-02-19T09:03:53Z","OA_place":"publisher","has_accepted_license":"1","publication_identifier":{"eissn":["2640-3498"]},"intvolume":"       291","language":[{"iso":"eng"}],"quality_controlled":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"MaMo"}],"date_created":"2026-02-18T12:12:47Z","file_date_updated":"2026-02-19T09:03:43Z","type":"conference","page":"3354-3404","publisher":"ML Research Press","day":"01","volume":291,"citation":{"ama":"Kovačević F, Yihan Z, Mondelli M. Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. In: <i>Proceedings of 38th Conference on Learning Theory</i>. Vol 291. ML Research Press; 2025:3354-3404.","chicago":"Kovačević, Filip, Zhang Yihan, and Marco Mondelli. “Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery.” In <i>Proceedings of 38th Conference on Learning Theory</i>, 291:3354–3404. ML Research Press, 2025.","short":"F. Kovačević, Z. Yihan, M. Mondelli, in:, Proceedings of 38th Conference on Learning Theory, ML Research Press, 2025, pp. 3354–3404.","mla":"Kovačević, Filip, et al. “Spectral Estimators for Multi-Index Models: Precise Asymptotics and Optimal Weak Recovery.” <i>Proceedings of 38th Conference on Learning Theory</i>, vol. 291, ML Research Press, 2025, pp. 3354–404.","apa":"Kovačević, F., Yihan, Z., &#38; Mondelli, M. (2025). Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. In <i>Proceedings of 38th Conference on Learning Theory</i> (Vol. 291, pp. 3354–3404). Lyon, France: ML Research Press.","ista":"Kovačević F, Yihan Z, Mondelli M. 2025. Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery. Proceedings of 38th Conference on Learning Theory. COLT: Conference on Learning Theory, PMLR, vol. 291, 3354–3404.","ieee":"F. Kovačević, Z. Yihan, and M. Mondelli, “Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery,” in <i>Proceedings of 38th Conference on Learning Theory</i>, Lyon, France, 2025, vol. 291, pp. 3354–3404."},"publication":"Proceedings of 38th Conference on Learning Theory","conference":{"start_date":"2025-06-30","name":"COLT: Conference on Learning Theory","end_date":"2025-07-04","location":"Lyon, France"},"acknowledgement":"This work was done when Y. Z. was at the Institute of Science and Technology Austria. Y. Z. and\r\nM. M. are funded by the European Union (ERC, INF2, project number 101161364). Views and\r\nopinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. The authors would like to acknowledge (in alphabetical order) discussions with Yatin Dandi, Leonardo Defilippis and Bruno Loureiro concerning their parallel work (Defilippis et al., 2025).","arxiv":1,"ddc":["000"],"OA_type":"gold","status":"public","date_published":"2025-07-01T00:00:00Z","scopus_import":"1","abstract":[{"text":"Multi-index models provide a popular framework to investigate the learnability of functions with low-dimensional structure and, also due to their connections with neural networks, they have been object of recent intensive study. In this paper, we focus on recovering the subspace spanned by the signals via spectral estimators – a family of methods routinely used in practice, often as a warm-start for iterative algorithms. Our main technical contribution is a precise asymptotic characterization of the performance of spectral methods, when sample size and input dimension grow proportionally and the dimension p of the space to recover is fixed. Specifically, we locate the top-p eigenvalues of the spectral matrix and establish the overlaps between the corresponding eigenvectors (which give the spectral estimators) and a basis of the signal subspace. Our analysis unveils a phase transition phenomenon in which, as the sample complexity grows, eigenvalues escape from the bulk of the spectrum and, when that happens, eigenvectors recover directions of the desired subspace. The precise characterization we put forward enables the optimization of the data preprocessing, thus allowing to identify the spectral estimator that requires the minimal sample size for weak recovery.","lang":"eng"}],"oa":1,"file":[{"success":1,"checksum":"19aa70ab4f57fb9067b6ebb99a5fd6f0","date_updated":"2026-02-19T09:03:43Z","file_name":"2025_LearningTheory_Kovacevic.pdf","content_type":"application/pdf","access_level":"open_access","creator":"dernst","date_created":"2026-02-19T09:03:43Z","file_id":"21339","relation":"main_file","file_size":844611}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Kovačević","first_name":"Filip","id":"d0258e7b-50b8-11ef-ad56-8b9f537b6b1b","full_name":"Kovačević, Filip"},{"first_name":"Zhang","full_name":"Yihan, Zhang","last_name":"Yihan"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020"}],"project":[{"grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits"}],"publication_status":"published","title":"Spectral estimators for multi-index models: Precise asymptotics and optimal weak recovery","oa_version":"Published Version","year":"2025","_id":"21328","month":"07","article_processing_charge":"No","alternative_title":["PMLR"]},{"day":"21","publisher":"Ecole polytechnique","doi":"10.5802/jep.320","page":"1677-1691","type":"journal_article","citation":{"ama":"Browning TD, Chan S. Solubility of a resultant equation and applications. <i>Journal de l’ecole polytechnique mathematiques</i>. 2025;12:1677-1691. doi:<a href=\"https://doi.org/10.5802/jep.320\">10.5802/jep.320</a>","chicago":"Browning, Timothy D, and Stephanie Chan. “Solubility of a Resultant Equation and Applications.” <i>Journal de l’ecole Polytechnique Mathematiques</i>. Ecole polytechnique, 2025. <a href=\"https://doi.org/10.5802/jep.320\">https://doi.org/10.5802/jep.320</a>.","short":"T.D. Browning, S. Chan, Journal de l’ecole Polytechnique Mathematiques 12 (2025) 1677–1691.","mla":"Browning, Timothy D., and Stephanie Chan. “Solubility of a Resultant Equation and Applications.” <i>Journal de l’ecole Polytechnique Mathematiques</i>, vol. 12, Ecole polytechnique, 2025, pp. 1677–91, doi:<a href=\"https://doi.org/10.5802/jep.320\">10.5802/jep.320</a>.","ista":"Browning TD, Chan S. 2025. Solubility of a resultant equation and applications. Journal de l’ecole polytechnique mathematiques. 12, 1677–1691.","apa":"Browning, T. D., &#38; Chan, S. (2025). Solubility of a resultant equation and applications. <i>Journal de l’ecole Polytechnique Mathematiques</i>. Ecole polytechnique. <a href=\"https://doi.org/10.5802/jep.320\">https://doi.org/10.5802/jep.320</a>","ieee":"T. D. Browning and S. Chan, “Solubility of a resultant equation and applications,” <i>Journal de l’ecole polytechnique mathematiques</i>, vol. 12. Ecole polytechnique, pp. 1677–1691, 2025."},"DOAJ_listed":"1","volume":12,"publication":"Journal de l'ecole polytechnique mathematiques","OA_place":"publisher","has_accepted_license":"1","date_updated":"2026-02-24T07:57:53Z","corr_author":"1","external_id":{"arxiv":["2411.09264"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        12","publication_identifier":{"eissn":["2270-518X"],"issn":["2429-7100"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"file_date_updated":"2026-02-24T07:56:34Z","date_created":"2026-02-22T23:01:36Z","department":[{"_id":"TiBr"}],"PlanS_conform":"1","title":"Solubility of a resultant equation and applications","_id":"21343","year":"2025","oa_version":"Published Version","month":"10","article_processing_charge":"Yes","OA_type":"gold","arxiv":1,"ddc":["510"],"acknowledgement":"While working on this paper, the first author was supported by a FWF grant (DOI 10.55776/P36278).","abstract":[{"lang":"eng","text":"The large sieve is used to estimate the density of quadratic polynomials Q ∈ Z[x],\r\nsuch that there exists an odd degree polynomial defined over Z which has resultant ±1 with Q.\r\nGiven a monic polynomial R ∈ Z[x] of odd degree, this is used to show that for almost all\r\nquadratic polynomials Q ∈ Z[x], there exists a prime p such that Q and R share a common\r\nroot in Fp. Using recent work of Landesman, an application to the average size of the odd part\r\nof the class group of quadratic number fields is also given"},{"text":" Le grand crible est utilisé pour estimer la densité des polynômes quadratiques Q ∈ Z[x] tels qu’il existe un polynôme de degré impair défini sur Z dont le résultant avec Q est égal à ±1. Étant donné un polynôme unitaire R ∈ Z[x] de degré impair, on s’en sert pour montrer que, pour presque tous les polynômes quadratiques Q ∈ Z[x], il existe un nombre premier p tel que Q et R aient une racine commune dans Fp. En utilisant des travaux récents de Landesman, on obtient également une application concernant la taille moyenne de la partie impaire du groupe de classe des corps quadratiques.","lang":"fre"}],"scopus_import":"1","date_published":"2025-10-21T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","creator":"dernst","date_created":"2026-02-24T07:56:34Z","access_level":"open_access","file_id":"21356","relation":"main_file","file_size":1003689,"success":1,"checksum":"828577ea48ac6109d3e9dd1aeddd45c4","file_name":"2025_JEP_Browning.pdf","date_updated":"2026-02-24T07:56:34Z"}],"oa":1,"article_type":"original","publication_status":"published","project":[{"name":"Rational curves via function field analytic number theory","_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","grant_number":"P36278"}],"author":[{"first_name":"Timothy D","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8314-0177","last_name":"Browning"},{"orcid":"0000-0001-8467-4106","last_name":"Chan","full_name":"Chan, Yik Tung","id":"c4c0afc8-9262-11ed-9231-d8b0bc743af1","first_name":"Yik Tung"}]},{"status":"public","abstract":[{"text":"We report on the Equational Theories Project (ETP), an online collaborative pilot project to explore new ways to collaborate in mathematics with machine assistance. The project successfully determined all 22 028 942 edges of the implication graph between the 4694 simplest equational laws on magmas, by a combination of human-generated and automated proofs, all validated by the formal proof assistant language Lean. As a result of this project, several new constructions of magmas satisfying specific laws were discovered, and several auxiliary questions were also addressed, such as the effect of restricting attention to finite magmas.","lang":"eng"}],"language":[{"iso":"eng"}],"date_published":"2025-12-16T00:00:00Z","arxiv":1,"external_id":{"arxiv":["2512.07087"]},"OA_place":"repository","date_updated":"2026-03-12T08:36:21Z","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"author":[{"last_name":"Bolan","full_name":"Bolan, Matthew","first_name":"Matthew"},{"last_name":"Breitner","first_name":"Joachim","full_name":"Breitner, Joachim"},{"first_name":"Jose","full_name":"Brox, Jose","last_name":"Brox"},{"full_name":"Carlini, Nicholas","first_name":"Nicholas","last_name":"Carlini"},{"full_name":"Carneiro, Mario","first_name":"Mario","last_name":"Carneiro"},{"first_name":"Floris van","full_name":"Doorn, Floris van","last_name":"Doorn"},{"first_name":"Martin","full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","last_name":"Dvorak"},{"first_name":"Andrés","full_name":"Goens, Andrés","last_name":"Goens"},{"full_name":"Hill, Aaron","first_name":"Aaron","last_name":"Hill"},{"last_name":"Husum","full_name":"Husum, Harald","first_name":"Harald"},{"last_name":"Mejia","full_name":"Mejia, Hernán Ibarra","first_name":"Hernán Ibarra"},{"first_name":"Zoltan A.","full_name":"Kocsis, Zoltan A.","last_name":"Kocsis"},{"last_name":"Floch","first_name":"Bruno Le","full_name":"Floch, Bruno Le"},{"first_name":"Amir","full_name":"Bar-on, Amir","last_name":"Bar-on"},{"first_name":"Lorenzo","full_name":"Luccioli, Lorenzo","last_name":"Luccioli"},{"first_name":"Douglas","full_name":"McNeil, Douglas","last_name":"McNeil"},{"last_name":"Meiburg","full_name":"Meiburg, Alex","first_name":"Alex"},{"last_name":"Monticone","full_name":"Monticone, Pietro","first_name":"Pietro"},{"last_name":"Nielsen","full_name":"Nielsen, Pace P.","first_name":"Pace P."},{"last_name":"Osazuwa","full_name":"Osazuwa, Emmanuel Osalotioman","first_name":"Emmanuel Osalotioman"},{"last_name":"Paolini","first_name":"Giovanni","full_name":"Paolini, Giovanni"},{"last_name":"Petracci","first_name":"Marco","full_name":"Petracci, Marco"},{"last_name":"Reinke","first_name":"Bernhard","full_name":"Reinke, Bernhard"},{"last_name":"Renshaw","first_name":"David","full_name":"Renshaw, David"},{"last_name":"Rossel","full_name":"Rossel, Marcus","first_name":"Marcus"},{"last_name":"Roux","full_name":"Roux, Cody","first_name":"Cody"},{"last_name":"Scanvic","full_name":"Scanvic, Jérémy","first_name":"Jérémy"},{"last_name":"Srinivas","full_name":"Srinivas, Shreyas","first_name":"Shreyas"},{"first_name":"Anand Rao","full_name":"Tadipatri, Anand Rao","last_name":"Tadipatri"},{"last_name":"Tao","full_name":"Tao, Terence","first_name":"Terence"},{"full_name":"Tsyrklevich, Vlad","first_name":"Vlad","last_name":"Tsyrklevich"},{"last_name":"Vaquerizo-Villar","first_name":"Fernando","full_name":"Vaquerizo-Villar, Fernando"},{"last_name":"Weber","full_name":"Weber, Daniel","first_name":"Daniel"},{"full_name":"Zheng, Fan","first_name":"Fan","last_name":"Zheng"}],"publication_status":"submitted","date_created":"2026-03-04T12:00:16Z","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"oa_version":"Preprint","_id":"21399","citation":{"mla":"Bolan, Matthew, et al. “The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2512.07087\">10.48550/arXiv.2512.07087</a>.","ista":"Bolan M, Breitner J, Brox J, Carlini N, Carneiro M, Doorn F van, Dvorak M, Goens A, Hill A, Husum H, Mejia HI, Kocsis ZA, Floch BL, Bar-on A, Luccioli L, McNeil D, Meiburg A, Monticone P, Nielsen PP, Osazuwa EO, Paolini G, Petracci M, Reinke B, Renshaw D, Rossel M, Roux C, Scanvic J, Srinivas S, Tadipatri AR, Tao T, Tsyrklevich V, Vaquerizo-Villar F, Weber D, Zheng F. The equational theories project: Advancing collaborative mathematical research at scale. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2512.07087\">10.48550/arXiv.2512.07087</a>.","apa":"Bolan, M., Breitner, J., Brox, J., Carlini, N., Carneiro, M., Doorn, F. van, … Zheng, F. (n.d.). The equational theories project: Advancing collaborative mathematical research at scale. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2512.07087\">https://doi.org/10.48550/arXiv.2512.07087</a>","ieee":"M. Bolan <i>et al.</i>, “The equational theories project: Advancing collaborative mathematical research at scale,” <i>arXiv</i>. .","short":"M. Bolan, J. Breitner, J. Brox, N. Carlini, M. Carneiro, F. van Doorn, M. Dvorak, A. Goens, A. Hill, H. Husum, H.I. Mejia, Z.A. Kocsis, B.L. Floch, A. Bar-on, L. Luccioli, D. McNeil, A. Meiburg, P. Monticone, P.P. Nielsen, E.O. Osazuwa, G. Paolini, M. Petracci, B. Reinke, D. Renshaw, M. Rossel, C. Roux, J. Scanvic, S. Srinivas, A.R. Tadipatri, T. Tao, V. Tsyrklevich, F. Vaquerizo-Villar, D. Weber, F. Zheng, ArXiv (n.d.).","chicago":"Bolan, Matthew, Joachim Breitner, Jose Brox, Nicholas Carlini, Mario Carneiro, Floris van Doorn, Martin Dvorak, et al. “The Equational Theories Project: Advancing Collaborative Mathematical Research at Scale.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2512.07087\">https://doi.org/10.48550/arXiv.2512.07087</a>.","ama":"Bolan M, Breitner J, Brox J, et al. The equational theories project: Advancing collaborative mathematical research at scale. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2512.07087\">10.48550/arXiv.2512.07087</a>"},"year":"2025","type":"preprint","title":"The equational theories project: Advancing collaborative mathematical research at scale","day":"16","doi":"10.48550/arXiv.2512.07087","article_processing_charge":"No","publication":"arXiv","month":"12","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.07087"}]},{"title":"Boosting payment channel network liquidity with topology optimization and transaction selection","year":"2025","_id":"21412","oa_version":"Published Version","month":"10","article_processing_charge":"No","alternative_title":["LIPIcs"],"OA_type":"gold","acknowledgement":"Chatterjee, Krishnendu: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nKřišťan, Jan Matyáš: Czech Science Foundation Grant no. 24-12046S.\r\nSchmid, Stefan: German Research Foundation (DFG) project ReNO (SPP 2378) from 2023-2027.\r\nSvoboda, Jakub: European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.\r\nYeo, Michelle: MOE-T2EP20122-0014 (Data-Driven Distributed Algorithms).","conference":{"location":"Berlin, Germany","name":"DISC: Symposium on Distributed Computing","end_date":"2025-10-31","start_date":"2025-10-27"},"ddc":["000"],"arxiv":1,"scopus_import":"1","abstract":[{"text":"Payment channel networks (PCNs) are a promising technology that alleviates blockchain scalability by shifting the transaction load from the blockchain to the PCN. Nevertheless, the network topology has to be carefully designed to maximise the transaction throughput in PCNs. Additionally, users in PCNs also have to make optimal decisions on which transactions to forward and which to reject to prolong the lifetime of their channels. In this work, we consider an input sequence of transactions over p parties. Each transaction consists of a transaction size, source, and target, and can be either accepted or rejected (entailing a cost). The goal is to design a PCN topology among the p cooperating parties, along with the channel capacities, and then output a decision for each transaction in the sequence to minimise the cost of creating and augmenting channels, as well as the cost of rejecting transactions. Our main contribution is an 𝒪(p) approximation algorithm for the problem with p parties. We further show that with some assumptions on the distribution of transactions, we can reduce the approximation ratio to 𝒪(√p). We complement our theoretical analysis with an empirical study of our assumptions and approach in the context of the Lightning Network.","lang":"eng"}],"date_published":"2025-10-22T00:00:00Z","status":"public","file":[{"checksum":"8e3d1594365df60163d9df22158a37b1","success":1,"file_name":"2025_DISC_Chatterjee.pdf","date_updated":"2026-03-09T11:51:59Z","date_created":"2026-03-09T11:51:59Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":1130069,"file_id":"21418"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"publication_status":"published","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"last_name":"Křišťan","full_name":"Křišťan, Jan Matyáš","first_name":"Jan Matyáš"},{"last_name":"Schmid","first_name":"Stefan","full_name":"Schmid, Stefan"},{"orcid":"0000-0002-1419-3267","last_name":"Svoboda","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub"},{"first_name":"Michelle X","full_name":"Yeo, Michelle X","id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","orcid":"0009-0001-3676-4809"}],"day":"22","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","doi":"10.4230/LIPIcs.DISC.2025.23","ec_funded":1,"type":"conference","citation":{"ieee":"K. Chatterjee, J. M. Křišťan, S. Schmid, J. Svoboda, and M. X. Yeo, “Boosting payment channel network liquidity with topology optimization and transaction selection,” in <i>39th International Symposium on Distributed Computing</i>, Berlin, Germany, 2025, vol. 356.","mla":"Chatterjee, Krishnendu, et al. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” <i>39th International Symposium on Distributed Computing</i>, vol. 356, 23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>.","ista":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. 2025. Boosting payment channel network liquidity with topology optimization and transaction selection. 39th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 356, 23.","apa":"Chatterjee, K., Křišťan, J. M., Schmid, S., Svoboda, J., &#38; Yeo, M. X. (2025). Boosting payment channel network liquidity with topology optimization and transaction selection. In <i>39th International Symposium on Distributed Computing</i> (Vol. 356). Berlin, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>","short":"K. Chatterjee, J.M. Křišťan, S. Schmid, J. Svoboda, M.X. Yeo, in:, 39th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Chatterjee, Krishnendu, Jan Matyáš Křišťan, Stefan Schmid, Jakub Svoboda, and Michelle X Yeo. “Boosting Payment Channel Network Liquidity with Topology Optimization and Transaction Selection.” In <i>39th International Symposium on Distributed Computing</i>, Vol. 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">https://doi.org/10.4230/LIPIcs.DISC.2025.23</a>.","ama":"Chatterjee K, Křišťan JM, Schmid S, Svoboda J, Yeo MX. Boosting payment channel network liquidity with topology optimization and transaction selection. In: <i>39th International Symposium on Distributed Computing</i>. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2025.23\">10.4230/LIPIcs.DISC.2025.23</a>"},"volume":356,"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1484.pdf"}],"publication":"39th International Symposium on Distributed Computing","date_updated":"2026-03-09T11:52:58Z","has_accepted_license":"1","OA_place":"publisher","external_id":{"arxiv":["2508.14524"]},"intvolume":"       356","quality_controlled":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774024"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2026-03-08T23:01:46Z","file_date_updated":"2026-03-09T11:51:59Z","article_number":"23","department":[{"_id":"KrCh"}]},{"article_processing_charge":"Yes","month":"04","oa_version":"Published Version","_id":"21413","year":"2025","title":"Learning algorithms for verification of Markov decision processes","author":[{"last_name":"Brázdil","full_name":"Brázdil, Tomáš","first_name":"Tomáš"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"},{"last_name":"Chmelik","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"first_name":"Vojtěch","full_name":"Forejt, Vojtěch","last_name":"Forejt"},{"last_name":"Kretinsky","orcid":"0000-0002-8122-2881","id":"44CEF464-F248-11E8-B48F-1D18A9856A87","full_name":"Kretinsky, Jan","first_name":"Jan"},{"last_name":"Kwiatkowska","first_name":"Marta","full_name":"Kwiatkowska, Marta"},{"full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer"},{"full_name":"Parker, David","first_name":"David","last_name":"Parker"},{"full_name":"Ujma, Mateusz","first_name":"Mateusz","last_name":"Ujma"}],"article_type":"original","publication_status":"published","project":[{"grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"},{"_id":"25F2ACDE-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Rigorous Systems Engineering"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"checksum":"2ccf563ae577ee08d82baf752292ca7b","success":1,"file_name":"2026_TheoretiCS_Brazdil.pdf","date_updated":"2026-03-09T11:39:59Z","date_created":"2026-03-09T11:39:59Z","creator":"dernst","access_level":"open_access","content_type":"application/pdf","file_size":861607,"relation":"main_file","file_id":"21417"}],"status":"public","abstract":[{"lang":"eng","text":"We present a general framework for applying learning algorithms and heuristical guidance to the verification of Markov decision processes (MDPs).\r\nThe primary goal of our techniques is to improve performance by avoiding an exhaustive exploration of the state space, instead focussing on particularly relevant areas of the system, guided by heuristics. Our work builds on the previous results of Br{á}zdil et al., significantly extending it as well as refining several details and fixing errors.\r\nThe presented framework focuses on probabilistic reachability, which is a core problem in verification, and is instantiated in two distinct scenarios.\r\nThe first assumes that full knowledge of the MDP is available, in particular precise transition probabilities. It performs a heuristic-driven partial exploration of the model, yielding precise lower and upper bounds on the required probability. The second tackles the case where we may only sample the MDP without knowing the exact transition dynamics. Here, we obtain probabilistic guarantees, again in terms of both the lower and upper bounds, which provides efficient stopping criteria for the approximation. In particular, the latter is an extension of statistical model-checking (SMC) for unbounded properties in MDPs. In contrast to other related approaches, we do not restrict our attention to time-bounded (finite-horizon) or discounted properties, nor assume any particular structural properties of the MDP."}],"scopus_import":"1","date_published":"2025-04-01T00:00:00Z","arxiv":1,"ddc":["000"],"acknowledgement":"This research was funded in part by the European Research Council (ERC) under grant agreement AdG-267989 (QUAREM)*, AdG-246967 (VERIWARE)*, StG-279307 (Graph Games)*\r\n, CoG-863818 (ForM-SMArt), and AdG-834115 (FUN2MODEL), by the EU FP7 project HIERATIC*, by the German Research Foundation (DFG) project 427755713 (GOPro), by the Austrian Science Fund (FWF) projects S11402-N23 (RiSE)* , S11407-N23 (RiSE)*\r\n, and P23499-N23* , by the Czech Science Foundation grant No P202/12/P612* and GA23-06963S, by the MUNI Award in Science and Humanities (MUNI/I/1757/2021) of the Grant\r\nAgency of Masaryk University, by EPSRC project EP/K038575/1*, and by the Microsoft faculty fellows award*. A preliminary version of this article appeared at ATVA 2014 [33]. The * indicates funding that supported that version.","OA_type":"gold","publication":"TheoretiCS","volume":4,"citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Vojtěch Forejt, Jan Kretinsky, Marta Kwiatkowska, Tobias Meggendorfer, David Parker, and Mateusz Ujma. “Learning Algorithms for Verification of Markov Decision Processes.” <i>TheoretiCS</i>. TheoretiCS Foundation, 2025. <a href=\"https://doi.org/10.46298/theoretics.25.10\">https://doi.org/10.46298/theoretics.25.10</a>.","ama":"Brázdil T, Chatterjee K, Chmelik M, et al. Learning algorithms for verification of Markov decision processes. <i>TheoretiCS</i>. 2025;4. doi:<a href=\"https://doi.org/10.46298/theoretics.25.10\">10.46298/theoretics.25.10</a>","ieee":"T. Brázdil <i>et al.</i>, “Learning algorithms for verification of Markov decision processes,” <i>TheoretiCS</i>, vol. 4. TheoretiCS Foundation, 2025.","mla":"Brázdil, Tomáš, et al. “Learning Algorithms for Verification of Markov Decision Processes.” <i>TheoretiCS</i>, vol. 4, 10, TheoretiCS Foundation, 2025, doi:<a href=\"https://doi.org/10.46298/theoretics.25.10\">10.46298/theoretics.25.10</a>.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Forejt, V., Kretinsky, J., Kwiatkowska, M., … Ujma, M. (2025). Learning algorithms for verification of Markov decision processes. <i>TheoretiCS</i>. TheoretiCS Foundation. <a href=\"https://doi.org/10.46298/theoretics.25.10\">https://doi.org/10.46298/theoretics.25.10</a>","ista":"Brázdil T, Chatterjee K, Chmelik M, Forejt V, Kretinsky J, Kwiatkowska M, Meggendorfer T, Parker D, Ujma M. 2025. Learning algorithms for verification of Markov decision processes. TheoretiCS. 4, 10.","short":"T. Brázdil, K. Chatterjee, M. Chmelik, V. Forejt, J. Kretinsky, M. Kwiatkowska, T. Meggendorfer, D. Parker, M. Ujma, TheoretiCS 4 (2025)."},"DOAJ_listed":"1","ec_funded":1,"type":"journal_article","day":"01","doi":"10.46298/theoretics.25.10","publisher":"TheoretiCS Foundation","department":[{"_id":"KrCh"}],"PlanS_conform":"1","article_number":"10","date_created":"2026-03-08T23:01:46Z","file_date_updated":"2026-03-09T11:39:59Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"publication_identifier":{"eissn":["2751-4838"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"         4","external_id":{"arxiv":["2403.09184"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2026-03-09T11:43:38Z"},{"title":"Information-flow interfaces","oa_version":"Published Version","_id":"17094","year":"2025","month":"05","article_processing_charge":"Yes (via OA deal)","arxiv":1,"ddc":["000"],"acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation programme under grant agreement No 956123 and it was funded in part by the Austrian Science Fund (FWF) project W1255-N23, by the Austrian FWF project ZK-35, by the FWF project SpyCoDe 10.55776/F85 and by the ERC-2020-AdG 101020093. This paper extends the text and the results of the manuscript published at FASE 2022 [1].","OA_type":"hybrid","status":"public","date_published":"2025-05-01T00:00:00Z","abstract":[{"text":"Contract-based design is a promising methodology for taming the complexity of developing sophisticated systems. A formal contract distinguishes between assumptions, which are constraints that the designer of a component puts on the environments in which the component can be used safely, and guarantees, which are promises that the designer asks from the team that implements the component. A theory of formal contracts can be formalized as an interface theory, which supports the composition and refinement of both assumptions and guarantees. Although there is a rich landscape of contract-based design methods that address functional and extra-functional properties, we present the first interface theory designed to ensure system-wide security properties. Our framework provides a refinement relation and a composition operation that support both incremental design and independent implementability. We develop our theory for both stateless and stateful interfaces. Additionally, we introduce information-flow contracts where assumptions and guarantees are sets of flow relations. We use these contracts to illustrate how to enrich information-flow interfaces with a semantic view. We illustrate the applicability of our framework with two examples inspired by the automotive domain.","lang":"eng"}],"scopus_import":"1","oa":1,"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"success":1,"checksum":"244a71a916103b8ea08e9d0bab32bcd9","file_name":"2025_FormalMethodsSysDesign_Bartocci.pdf","date_updated":"2025-12-30T06:50:12Z","content_type":"application/pdf","date_created":"2025-12-30T06:50:12Z","creator":"dernst","access_level":"open_access","file_id":"20879","relation":"main_file","file_size":3860690}],"author":[{"last_name":"Bartocci","full_name":"Bartocci, Ezio","first_name":"Ezio"},{"first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"},{"last_name":"Nickovic","first_name":"Dejan","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Oliveira da Costa, Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4","first_name":"Ana","orcid":"0000-0002-8741-5799","last_name":"Oliveira da Costa"}],"article_type":"original","publication_status":"published","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502"}],"ec_funded":1,"type":"journal_article","related_material":{"record":[{"status":"public","relation":"shorter_version","id":"11355"}]},"day":"01","doi":"10.1007/s10703-024-00447-0","publisher":"Springer Nature","page":"3-48","volume":66,"citation":{"ieee":"E. Bartocci, T. Ferrere, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Information-flow interfaces,” <i>Formal Methods in System Design</i>, vol. 66. Springer Nature, pp. 3–48, 2025.","ista":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Information-flow interfaces. Formal Methods in System Design. 66, 3–48.","apa":"Bartocci, E., Ferrere, T., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Information-flow interfaces. <i>Formal Methods in System Design</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>","mla":"Bartocci, Ezio, et al. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>, vol. 66, Springer Nature, 2025, pp. 3–48, doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>.","short":"E. Bartocci, T. Ferrere, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Formal Methods in System Design 66 (2025) 3–48.","chicago":"Bartocci, Ezio, Thomas Ferrere, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Information-Flow Interfaces.” <i>Formal Methods in System Design</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10703-024-00447-0\">https://doi.org/10.1007/s10703-024-00447-0</a>.","ama":"Bartocci E, Ferrere T, Henzinger TA, Nickovic D, Oliveira da Costa A. Information-flow interfaces. <i>Formal Methods in System Design</i>. 2025;66:3-48. doi:<a href=\"https://doi.org/10.1007/s10703-024-00447-0\">10.1007/s10703-024-00447-0</a>"},"publication":"Formal Methods in System Design","corr_author":"1","external_id":{"arxiv":["2002.06465"],"isi":["001230084200001"]},"has_accepted_license":"1","OA_place":"publisher","date_updated":"2025-12-30T06:50:51Z","publication_identifier":{"issn":["0925-9856"],"eissn":["1572-8102"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"        66","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"department":[{"_id":"ToHe"}],"PlanS_conform":"1","file_date_updated":"2025-12-30T06:50:12Z","date_created":"2024-06-02T22:00:57Z"}]