[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-10T07:29:13Z","oa":1,"PlanS_conform":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2509.16169"]},"OA_place":"publisher","corr_author":"1","department":[{"_id":"GradSch"}],"year":"2026","intvolume":"       227","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.geomphys.2026.105878"}],"arxiv":1,"doi":"10.1016/j.geomphys.2026.105878","publisher":"Elsevier","OA_type":"hybrid","day":"21","ddc":["000"],"scopus_import":"1","title":"An easier way to compute 2-cocycles coming from a reduction for semidirect products","date_published":"2026-05-21T00:00:00Z","article_number":"105878","author":[{"full_name":"Goncharov, Viacheslav","last_name":"Goncharov","first_name":"Viacheslav","id":"8a0e2993-7114-11f0-b60e-f50e633649d8"}],"publication_status":"epub_ahead","quality_controlled":"1","publication":"Journal of Geometry and Physics","type":"journal_article","publication_identifier":{"issn":["0393-0440"],"eissn":["1879-1662"]},"article_processing_charge":"Yes (via OA deal)","citation":{"short":"V. Goncharov, Journal of Geometry and Physics 227 (2026).","ista":"Goncharov V. 2026. An easier way to compute 2-cocycles coming from a reduction for semidirect products. Journal of Geometry and Physics. 227, 105878.","chicago":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>.","ieee":"V. Goncharov, “An easier way to compute 2-cocycles coming from a reduction for semidirect products,” <i>Journal of Geometry and Physics</i>, vol. 227. Elsevier, 2026.","mla":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>, vol. 227, 105878, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>.","ama":"Goncharov V. An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. 2026;227. doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>","apa":"Goncharov, V. (2026). An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>"},"status":"public","_id":"21981","article_type":"original","abstract":[{"lang":"eng","text":"For Hamiltonian actions of semidirect products G = FxH, we study 2-cocycles arising from residual Hamiltonian actions of F on Hamiltonian reductions for H. The motivation comes from the study of Teichmüller spaces for surfaces with boundary, which carry Hamiltonian actions of the Virasoro algebra. In this paper, we give a general setup for the problem, and we suggest an easier way to obtain the Gelfand-Fuchs 2-cocycles for Hamiltonian actions on Teichmüller spaces."}],"month":"05","volume":227,"date_updated":"2026-06-16T09:23:39Z","has_accepted_license":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"external_id":{"isi":["001583178200001"],"arxiv":["2411.16572"],"oaworkid":["w4413883397"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-09-10T05:46:07Z","file_date_updated":"2026-01-05T13:05:47Z","PlanS_conform":"1","oa":1,"ec_funded":1,"project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","grant_number":"101020331"}],"department":[{"_id":"LaEr"}],"intvolume":"       290","year":"2026","day":"01","OA_type":"hybrid","doi":"10.1016/j.jfa.2025.111180","arxiv":1,"publisher":"Elsevier","ddc":["510"],"acknowledgement":"Partially supported by ERC Advanced Grant “RMTBeyond” No. 101020331. Partially supported by National Key R&D Program of China No. 2024YFA1013503.","scopus_import":"1","author":[{"orcid":"0000-0002-4901-7992","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgio"},{"first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","last_name":"Erdös","orcid":"0000-0001-5366-9603"},{"full_name":"Xu, Yuanyuan","orcid":"0000-0003-1559-1205","last_name":"Xu","first_name":"Yuanyuan","id":"7902bdb1-a2a4-11eb-a164-c9216f71aea3"}],"date_published":"2026-01-01T00:00:00Z","article_number":"111180","title":"Optimal decay of eigenvector overlap for non-Hermitian random matrices","quality_controlled":"1","file":[{"creator":"dernst","success":1,"relation":"main_file","checksum":"ee53d5e695f0df11e017c8c9242a2b04","date_updated":"2026-01-05T13:05:47Z","date_created":"2026-01-05T13:05:47Z","file_size":2503887,"file_id":"20947","access_level":"open_access","content_type":"application/pdf","file_name":"2026_JourFuncAnalysis_Cipolloni.pdf"}],"publication":"Journal of Functional Analysis","publication_status":"published","oaworkid":1,"_id":"20328","status":"public","publication_identifier":{"issn":["0022-1236"]},"type":"journal_article","citation":{"short":"G. Cipolloni, L. Erdös, Y. Xu, Journal of Functional Analysis 290 (2026).","ista":"Cipolloni G, Erdös L, Xu Y. 2026. Optimal decay of eigenvector overlap for non-Hermitian random matrices. Journal of Functional Analysis. 290(1), 111180.","ieee":"G. Cipolloni, L. Erdös, and Y. Xu, “Optimal decay of eigenvector overlap for non-Hermitian random matrices,” <i>Journal of Functional Analysis</i>, vol. 290, no. 1. Elsevier, 2026.","chicago":"Cipolloni, Giorgio, László Erdös, and Yuanyuan Xu. “Optimal Decay of Eigenvector Overlap for Non-Hermitian Random Matrices.” <i>Journal of Functional Analysis</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.jfa.2025.111180\">https://doi.org/10.1016/j.jfa.2025.111180</a>.","mla":"Cipolloni, Giorgio, et al. “Optimal Decay of Eigenvector Overlap for Non-Hermitian Random Matrices.” <i>Journal of Functional Analysis</i>, vol. 290, no. 1, 111180, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.jfa.2025.111180\">10.1016/j.jfa.2025.111180</a>.","ama":"Cipolloni G, Erdös L, Xu Y. Optimal decay of eigenvector overlap for non-Hermitian random matrices. <i>Journal of Functional Analysis</i>. 2026;290(1). doi:<a href=\"https://doi.org/10.1016/j.jfa.2025.111180\">10.1016/j.jfa.2025.111180</a>","apa":"Cipolloni, G., Erdös, L., &#38; Xu, Y. (2026). Optimal decay of eigenvector overlap for non-Hermitian random matrices. <i>Journal of Functional Analysis</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jfa.2025.111180\">https://doi.org/10.1016/j.jfa.2025.111180</a>"},"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","isi":1,"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_type":"original","issue":"1","date_updated":"2026-06-03T13:12:14Z","month":"01","volume":290,"abstract":[{"text":"We consider the standard overlap (math formular) of any bi-orthogonal family of left and right eigenvectors of a large random matrix X with centred i.i.d. entries and we prove that it decays as an inverse second power of the distance between the corresponding eigenvalues. This extends similar results for the complex Gaussian ensemble from Bourgade and Dubach [15], as well as Benaych-Georges and Zeitouni [13], to any i.i.d. matrix ensemble in both symmetry classes. As a main tool, we prove a two-resolvent local law for the Hermitisation of X uniformly in the spectrum with optimal decay rate and optimal dependence on the density near the spectral edge.","lang":"eng"}]},{"author":[{"last_name":"Christoph","full_name":"Christoph, Micha","first_name":"Micha"},{"last_name":"Nenadov","full_name":"Nenadov, Rajko","first_name":"Rajko"},{"full_name":"Petrova, Kalina H","last_name":"Petrova","first_name":"Kalina H","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381"}],"date_published":"2026-01-01T00:00:00Z","title":"The Hamilton space of pseudorandom graphs","quality_controlled":"1","file":[{"creator":"dernst","checksum":"60676af4af4b3243ba187e7d65440d99","success":1,"relation":"main_file","date_updated":"2026-01-05T13:29:34Z","file_size":688924,"date_created":"2026-01-05T13:29:34Z","file_id":"20953","file_name":"2026_JourCombTheoryB_Christoph.pdf","access_level":"open_access","content_type":"application/pdf"}],"publication":"Journal of Combinatorial Theory Series B","page":"254-267","publication_status":"published","_id":"20422","status":"public","publication_identifier":{"eissn":["1096-0902"],"issn":["0095-8956"]},"type":"journal_article","citation":{"ama":"Christoph M, Nenadov R, Petrova KH. The Hamilton space of pseudorandom graphs. <i>Journal of Combinatorial Theory Series B</i>. 2026;176:254-267. doi:<a href=\"https://doi.org/10.1016/j.jctb.2025.09.002\">10.1016/j.jctb.2025.09.002</a>","apa":"Christoph, M., Nenadov, R., &#38; Petrova, K. H. (2026). The Hamilton space of pseudorandom graphs. <i>Journal of Combinatorial Theory Series B</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jctb.2025.09.002\">https://doi.org/10.1016/j.jctb.2025.09.002</a>","ista":"Christoph M, Nenadov R, Petrova KH. 2026. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 176, 254–267.","short":"M. Christoph, R. Nenadov, K.H. Petrova, Journal of Combinatorial Theory Series B 176 (2026) 254–267.","mla":"Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” <i>Journal of Combinatorial Theory Series B</i>, vol. 176, Elsevier, 2026, pp. 254–67, doi:<a href=\"https://doi.org/10.1016/j.jctb.2025.09.002\">10.1016/j.jctb.2025.09.002</a>.","ieee":"M. Christoph, R. Nenadov, and K. H. Petrova, “The Hamilton space of pseudorandom graphs,” <i>Journal of Combinatorial Theory Series B</i>, vol. 176. Elsevier, pp. 254–267, 2026.","chicago":"Christoph, Micha, Rajko Nenadov, and Kalina H Petrova. “The Hamilton Space of Pseudorandom Graphs.” <i>Journal of Combinatorial Theory Series B</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.jctb.2025.09.002\">https://doi.org/10.1016/j.jctb.2025.09.002</a>."},"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","isi":1,"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_type":"original","date_updated":"2026-01-05T13:29:52Z","month":"01","abstract":[{"lang":"eng","text":"We show that if n is odd and p>=Clog n/n, then with high probability Hamilton cycles in G(n,p) span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph G, that is, a graph G with odd n vertices and minimum degree n/2+C for sufficiently large constant C, span its cycle space.\r\n"}],"volume":176,"external_id":{"isi":["001585783400001"],"arxiv":["2402.01447"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-10-05T22:01:34Z","file_date_updated":"2026-01-05T13:29:34Z","PlanS_conform":"1","oa":1,"ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"year":"2026","intvolume":"       176","department":[{"_id":"MaKw"}],"OA_type":"hybrid","day":"01","doi":"10.1016/j.jctb.2025.09.002","arxiv":1,"publisher":"Elsevier","acknowledgement":"This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. Image 1 Part of this research was conducted while the author was at Department of Computer Science, ETH Zürich, Switzerland. This author was supported by grant no. CRSII5 173721 of the Swiss National Science Foundation.","ddc":["510"],"scopus_import":"1"},{"title":"On the size of chromatic Delaunay mosaics","author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","last_name":"Biswas","first_name":"Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87"},{"id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","first_name":"Sebastiano","orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","full_name":"Cultrera di Montesano, Sebastiano"},{"last_name":"Draganov","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej"},{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert"},{"last_name":"Saghafian","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza"}],"date_published":"2026-01-01T00:00:00Z","page":"24-47","publication_status":"published","quality_controlled":"1","file":[{"date_updated":"2026-01-05T13:21:20Z","creator":"dernst","checksum":"0addb5c1b78142f9fb453bfa04695400","success":1,"relation":"main_file","access_level":"open_access","file_name":"2026_DiscreteCompGeom_Biswas.pdf","file_id":"20952","content_type":"application/pdf","date_created":"2026-01-05T13:21:20Z","file_size":570922}],"publication":"Discrete and Computational Geometry","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"type":"journal_article","citation":{"apa":"Biswas, R., Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2026). On the size of chromatic Delaunay mosaics. <i>Discrete and Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-025-00778-7\">https://doi.org/10.1007/s00454-025-00778-7</a>","ama":"Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. On the size of chromatic Delaunay mosaics. <i>Discrete and Computational Geometry</i>. 2026;75:24-47. doi:<a href=\"https://doi.org/10.1007/s00454-025-00778-7\">10.1007/s00454-025-00778-7</a>","mla":"Biswas, Ranita, et al. “On the Size of Chromatic Delaunay Mosaics.” <i>Discrete and Computational Geometry</i>, vol. 75, Springer Nature, 2026, pp. 24–47, doi:<a href=\"https://doi.org/10.1007/s00454-025-00778-7\">10.1007/s00454-025-00778-7</a>.","chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “On the Size of Chromatic Delaunay Mosaics.” <i>Discrete and Computational Geometry</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00454-025-00778-7\">https://doi.org/10.1007/s00454-025-00778-7</a>.","ieee":"R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “On the size of chromatic Delaunay mosaics,” <i>Discrete and Computational Geometry</i>, vol. 75. Springer Nature, pp. 24–47, 2026.","ista":"Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. 75, 24–47.","short":"R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 75 (2026) 24–47."},"article_processing_charge":"Yes (via OA deal)","status":"public","_id":"20456","related_material":{"record":[{"status":"public","id":"15090","relation":"earlier_version"}]},"article_type":"original","date_updated":"2026-01-05T13:21:56Z","volume":75,"abstract":[{"lang":"eng","text":"Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents how points of different colors mingle. Our main results are bounds on the size of the chromatic Delaunay mosaic, in which we assume that d and s are constants. For example, if A is finite with n=#A, and the coloring is random, then the chromatic Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets and Poisson point processes in Rd, the expected number of cells within a closed ball is only a constant times the number of points in this ball. Furthermore, in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics of size O(n). This encourages the use of chromatic Delaunay mosaics in applications."}],"month":"01","isi":1,"oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_created":"2025-10-12T22:01:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","file_date_updated":"2026-01-05T13:21:20Z","oa":1,"external_id":{"arxiv":["2212.03121"],"isi":["001584166900001"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","ec_funded":1,"project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"},{"grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"year":"2026","department":[{"_id":"HeEd"}],"intvolume":"        75","doi":"10.1007/s00454-025-00778-7","arxiv":1,"publisher":"Springer Nature","day":"01","OA_type":"hybrid","acknowledgement":"The fourth author thanks Boris Aronov for insightful discussions on the size of the overlay of Voronoi tessellations. Open access funding provided by Institute of Science and Technology (IST Austria). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.","ddc":["510"],"scopus_import":"1"},{"publication_identifier":{"issn":["0195-6698"]},"type":"journal_article","citation":{"apa":"Boyadzhiyska, S., Das, S., Lesgourgues, T., &#38; Petrova, K. H. (2026). Odd-Ramsey numbers of complete bipartite graphs. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104235\">https://doi.org/10.1016/j.ejc.2025.104235</a>","ama":"Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. Odd-Ramsey numbers of complete bipartite graphs. <i>European Journal of Combinatorics</i>. 2026;131. doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104235\">10.1016/j.ejc.2025.104235</a>","mla":"Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” <i>European Journal of Combinatorics</i>, vol. 131, 104235, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104235\">10.1016/j.ejc.2025.104235</a>.","chicago":"Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” <i>European Journal of Combinatorics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.ejc.2025.104235\">https://doi.org/10.1016/j.ejc.2025.104235</a>.","ieee":"S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers of complete bipartite graphs,” <i>European Journal of Combinatorics</i>, vol. 131. Elsevier, 2026.","ista":"Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. 2026. Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. 131, 104235.","short":"S. Boyadzhiyska, S. Das, T. Lesgourgues, K.H. Petrova, European Journal of Combinatorics 131 (2026)."},"article_processing_charge":"Yes (via OA deal)","_id":"20482","status":"public","article_type":"original","date_updated":"2026-01-05T13:34:48Z","month":"01","abstract":[{"lang":"eng","text":"In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs H in Kn, defined as the minimum number of colours needed to colour the edges of K so that every copy of a graph H E H intersects some colour class in an odd number of edges. In this paper, we focus on complete bipartite graphs. First, we completely resolve the problem when H is the family of all spanning complete bipartite graphs on n vertices. We then focus on its subfamilies, that is, {Kt,n-t : t E T} for a fixed set of integers T c [[n/2]]. We prove that the odd-Ramsey problem is equivalent to determining the maximum dimension of a linear binary code avoiding codewords of given weights, and leverage known results from coding theory to deduce asymptotically tight bounds in our setting. We conclude with bounds for the odd-Ramsey numbers of fixed (that is, non-spanning) complete bipartite subgraphs."}],"volume":131,"oa_version":"Published Version","isi":1,"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"title":"Odd-Ramsey numbers of complete bipartite graphs","author":[{"first_name":"Simona","last_name":"Boyadzhiyska","full_name":"Boyadzhiyska, Simona"},{"first_name":"Shagnik","last_name":"Das","full_name":"Das, Shagnik"},{"last_name":"Lesgourgues","full_name":"Lesgourgues, Thomas","first_name":"Thomas"},{"id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","first_name":"Kalina H","last_name":"Petrova","full_name":"Petrova, Kalina H"}],"date_published":"2026-01-01T00:00:00Z","article_number":"104235","publication_status":"published","quality_controlled":"1","file":[{"file_size":563029,"date_created":"2026-01-05T13:34:40Z","file_name":"2026_EuropJourCombinatorics_Boyadzhiyska.pdf","access_level":"open_access","file_id":"20954","content_type":"application/pdf","success":1,"checksum":"52883daa217398396cbf9b8ad9ddae92","relation":"main_file","creator":"dernst","date_updated":"2026-01-05T13:34:40Z"}],"publication":"European Journal of Combinatorics","doi":"10.1016/j.ejc.2025.104235","arxiv":1,"publisher":"Elsevier","day":"01","OA_type":"hybrid","acknowledgement":"The authors would like to thank Gilles Zémor for a helpful clarification on [3], Deepak Bal and Patrick Bennett for bringing [25] to their attention, and both referees for several helpful comments.\r\nS.B.: Most of this research was conducted while the author was at the School of Mathematics, University of Birmingham, Birmingham, United Kingdom. The research leading to these results was supported by EPSRC, United Kingdom, grant no. EP/V048287/1 and by ERC Advanced Grants “GeoScape”, no. 882971 and “ERMiD”, no. 101054936. There are no additional data beyond that contained within the main manuscript.\r\nS.D.: Research supported by Taiwan NSTC grants 111-2115-M-002-009-MY2 and 113-2628-M-002-008-MY4.\r\nK.P.: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. Parts of this research was conducted while K.P. was at the Department of Computer Science, ETH Zürich, Switzerland, supported by Swiss National Science Foundation, Switzerland , grant no. CRSII5 173721.","ddc":["500"],"scopus_import":"1","date_created":"2025-10-16T13:14:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","file_date_updated":"2026-01-05T13:34:40Z","oa":1,"external_id":{"isi":["001573380700001"],"arxiv":["2410.05887"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"year":"2026","intvolume":"       131","department":[{"_id":"MaKw"}]},{"status":"public","_id":"22103","article_processing_charge":"No","researchdata_availability":"no","citation":{"chicago":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, 5:4689–96. Science and Technology Publications, 2026. <a href=\"https://doi.org/10.5220/0014483200004052\">https://doi.org/10.5220/0014483200004052</a>.","ieee":"F. Cano Cordoba, “Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants,” in <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, Marbella, Spain, 2026, vol. 5, pp. 4689–4696.","mla":"Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>, vol. 5, Science and Technology Publications, 2026, pp. 4689–96, doi:<a href=\"https://doi.org/10.5220/0014483200004052\">10.5220/0014483200004052</a>.","short":"F. Cano Cordoba, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Science and Technology Publications, 2026, pp. 4689–4696.","ista":"Cano Cordoba F. 2026. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 5, 4689–4696.","apa":"Cano Cordoba, F. (2026). Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i> (Vol. 5, pp. 4689–4696). Marbella, Spain: Science and Technology Publications. <a href=\"https://doi.org/10.5220/0014483200004052\">https://doi.org/10.5220/0014483200004052</a>","ama":"Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In: <i>Proceedings of the 18th International Conference on Agents and Artificial Intelligence</i>. Vol 5. Science and Technology Publications; 2026:4689-4696. doi:<a href=\"https://doi.org/10.5220/0014483200004052\">10.5220/0014483200004052</a>"},"type":"conference","publication_identifier":{"issn":["2184-3589"],"isbn":["9789897587962"],"eissn":["2184-433X"]},"oa_version":"Accepted Version","month":"04","abstract":[{"lang":"eng","text":"Modern AI systems increasingly rely on opaque, highly complex models whose inner workings remain inaccessible even to experts. This opacity creates challenges for trust, accountability, and compliance with\r\nemerging regulatory expectations such as the “right to an explanation”. While traditional explainability methods—feature attributions, counterfactuals, surrogate models—and interpretable model classes provide valuable insights for engineers, they often fall short of delivering the contextual, conversational explanations that\r\nreal users expect. Large Language Models (LLMs) offer a promising new avenue for explanation due to their\r\nability to engage interactively, adapt to user needs, and translate technical outputs into more accessible reasoning. However, their tendencies toward hallucination, conflict avoidance, and oversimplification introduce\r\nserious risks when used as explanatory agents. This paper analyzes these opportunities and limitations, examines verification strategies for ensuring explanation fidelity, and situates LLM-generated explanations within\r\nbroader concerns about public trust. The paper concludes by outlining best practices and future research directions for building robust, verifiable, and human-aligned explanation systems."}],"volume":5,"date_updated":"2026-06-24T08:37:00Z","keyword":["Explainable AI","Large Language Models","Trust in AI"],"date_published":"2026-04-01T00:00:00Z","author":[{"first_name":"Filip","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","full_name":"Cano Cordoba, Filip","last_name":"Cano Cordoba","orcid":"0000-0002-0783-904X"}],"conference":{"location":"Marbella, Spain","start_date":"2026-03-05","end_date":"2026-03-08","name":"ICAART: International Conference on Agents and Artificial Intelligence"},"title":"Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","quality_controlled":"1","publication_status":"published","page":"4689-4696","day":"01","OA_type":"green","publisher":"Science and Technology Publications","doi":"10.5220/0014483200004052","scopus_import":"1","acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG\r\n101020093. LLM–based tools have been used as\r\nwriting assistance to help improve presentation.\r\n","OA_place":"repository","corr_author":"1","language":[{"iso":"eng"}],"oa":1,"das_tickbox":"0","date_created":"2026-06-21T22:03:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://filipcano.org/files/icaart26llm.pdf","open_access":"1"}],"department":[{"_id":"ToHe"}],"year":"2026","intvolume":"         5","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"supplementarymaterial":"no","ec_funded":1},{"publication_status":"published","publication":"Physical Review B","extern":"1","quality_controlled":"1","title":"Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry","author":[{"first_name":"A.","last_name":"Liebman-Peláez","full_name":"Liebman-Peláez, A."},{"last_name":"Garratt","full_name":"Garratt, S. J.","first_name":"S. J."},{"first_name":"Veronika","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","full_name":"Sunko, Veronika","last_name":"Sunko","orcid":"0000-0003-2724-3523"},{"full_name":"Sun, Y.","last_name":"Sun","first_name":"Y."},{"first_name":"J. R.","last_name":"Soh","full_name":"Soh, J. R."},{"first_name":"D.","full_name":"Prabhakaran, D.","last_name":"Prabhakaran"},{"full_name":"Boothroyd, A. T.","last_name":"Boothroyd","first_name":"A. T."},{"first_name":"J.","last_name":"Orenstein","full_name":"Orenstein, J."}],"date_published":"2026-06-01T00:00:00Z","article_number":"224401","issue":"22","date_updated":"2026-06-24T09:49:27Z","month":"06","abstract":[{"text":"Magnets with isotropic easy-plane symmetry host Goldstone modes that can be leveraged for efficient\r\nspin transport. Here, we present a time-resolved optical polarimetry technique that allows us to detect and\r\ncharacterize such low-frequency modes, and use it to observe the Goldstone mode in the multi-Q broken helix\r\nphase of EuIn2As2. The strength of our technique comes from the ability to distinguish between nematic and\r\nmagnetization dynamics in order to yield information about the mode structure, in addition to its frequency. We\r\nfind that the nearly uniform spin precession characteristic of a Goldstone mode is realized only when a small\r\nmagnetic field is used to unpin the broken helix from local strain generated during crystal growth. In this regime,\r\nthe mode frequency scales linearly with the applied field due to the ground state C2z symmetry of the broken\r\nhelix. Our work shows how optical polarimetry can be used to study the Goldstone modes of complex magnets.","lang":"eng"}],"volume":113,"article_type":"original","oa_version":"None","citation":{"apa":"Liebman-Peláez, A., Garratt, S. J., Sunko, V., Sun, Y., Soh, J. R., Prabhakaran, D., … Orenstein, J. (2026). Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/b48p-kw5l\">https://doi.org/10.1103/b48p-kw5l</a>","ama":"Liebman-Peláez A, Garratt SJ, Sunko V, et al. Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry. <i>Physical Review B</i>. 2026;113(22). doi:<a href=\"https://doi.org/10.1103/b48p-kw5l\">10.1103/b48p-kw5l</a>","chicago":"Liebman-Peláez, A., S. J. Garratt, Veronika Sunko, Y. Sun, J. R. Soh, D. Prabhakaran, A. T. Boothroyd, and J. Orenstein. “Observation of a Goldstone Mode in the Broken Helix by Time-Resolved Optical Polarimetry.” <i>Physical Review B</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/b48p-kw5l\">https://doi.org/10.1103/b48p-kw5l</a>.","ieee":"A. Liebman-Peláez <i>et al.</i>, “Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry,” <i>Physical Review B</i>, vol. 113, no. 22. American Physical Society, 2026.","mla":"Liebman-Peláez, A., et al. “Observation of a Goldstone Mode in the Broken Helix by Time-Resolved Optical Polarimetry.” <i>Physical Review B</i>, vol. 113, no. 22, 224401, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/b48p-kw5l\">10.1103/b48p-kw5l</a>.","short":"A. Liebman-Peláez, S.J. Garratt, V. Sunko, Y. Sun, J.R. Soh, D. Prabhakaran, A.T. Boothroyd, J. Orenstein, Physical Review B 113 (2026).","ista":"Liebman-Peláez A, Garratt SJ, Sunko V, Sun Y, Soh JR, Prabhakaran D, Boothroyd AT, Orenstein J. 2026. Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry. Physical Review B. 113(22), 224401."},"article_processing_charge":"No","researchdata_availability":"yes","publication_identifier":{"issn":["2469-9950"],"eissn":["2469-9969"]},"type":"journal_article","_id":"22116","status":"public","intvolume":"       113","year":"2026","supplementarymaterial":"no","das_tickbox":"1","date_created":"2026-06-22T08:52:01Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"acknowledgement":"We would like to thank Ehud Altman for helpful discussions. This research was primarily funded by the Quantum\r\nMaterials (KC2202) program under the U.S. Department of\r\nEnergy, Office of Science, Office of Basic Energy Sciences,\r\nMaterials Sciences and Engineering Division under Contract\r\nNo. DE-AC02-05CH11231, which supported the experimental and theoretical work at the Lawrence Berkeley National\r\nLaboratory and UC Berkeley. D.P. and A.T.B. would like to\r\nacknowledge the Engineering and Physical Sciences Research\r\nCouncil, UK and the Oxford- ShanghaiTech collaboration\r\nproject for financial support. J.O. received support from\r\nthe Gordon and Betty Moore Foundation’s EPiQS Initiative\r\nthrough Grant No. GBMF4537 to J.O. at UC Berkeley. V.S.\r\nis supported by the Miller Institute for Basic Research in\r\nScience, UC Berkeley. S.J.G. was supported by the Gordon\r\nand Betty Moore Foundation.","publisher":"American Physical Society","dataavailabilitystatement":"The data that support the findings of this article are openly\r\navailable [27 -  https://doi.org/10.7910/dvn/rqp3az], embargo periods may apply.","doi":"10.1103/b48p-kw5l","day":"01","OA_type":"closed access"},{"acknowledgement":"We thank Nicola Spaldin and Marc Vila for valuable discussions. J.O. received support from the Quantum Materials (KC2202) program under the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Materials Sciences and Engineering Division under Contract No. DE-AC02-05CH11231, and the Gordon and Betty Moore Foundation's EPiQS Initiative through Grant GBMF4537 to J.O. at UC Berkeley.","ddc":["530"],"day":"30","OA_type":"gold","arxiv":1,"doi":"10.1038/s41535-026-00901-8","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41535-026-00901-8"}],"department":[{"_id":"VeSu"}],"year":"2026","language":[{"iso":"eng"}],"external_id":{"arxiv":["2511.16421"]},"OA_place":"publisher","corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-03-11T10:40:08Z","oa":1,"has_accepted_license":"1","oa_version":"Published Version","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"article_type":"original","abstract":[{"text":"Altermagnets are a class of collinear magnets that exhibit non-relativistic spin splitting (NRSS) of electronic bands in the absence of net magnetization. Their potential to generate large spin polarization without spin-orbit coupling has created strong interest in probes that access the underlying order parameter directly. In this Perspective, we show that linear magneto-birefringence (LMB) provides a natural and broadly applicable route to detecting altermagnetic order. Building on the correspondence between the momentum-space structure of NRSS and the ferroic ordering of magnetic multipoles in real space, we demonstrate how $d$-wave and $g$-wave NRSS textures yield distinct LMB responses. We present a symmetry-based framework that identifies the optical geometries and field configurations required to isolate specific multipole components, enabling domain imaging and providing benchmarks for theoretical models of LMB.","lang":"eng"}],"month":"05","date_updated":"2026-06-24T10:31:05Z","status":"public","_id":"21437","type":"journal_article","publication_identifier":{"eissn":["2397-4648"]},"article_processing_charge":"Yes","citation":{"ista":"Sunko V, Orenstein J. 2026. Linear magneto-birefringence as a probe of altermagnetism. npj Quantum Materials.","short":"V. Sunko, J. Orenstein, Npj Quantum Materials (2026).","mla":"Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe of Altermagnetism.” <i>Npj Quantum Materials</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41535-026-00901-8\">10.1038/s41535-026-00901-8</a>.","chicago":"Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe of Altermagnetism.” <i>Npj Quantum Materials</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41535-026-00901-8\">https://doi.org/10.1038/s41535-026-00901-8</a>.","ieee":"V. Sunko and J. Orenstein, “Linear magneto-birefringence as a probe of altermagnetism,” <i>npj Quantum Materials</i>. Springer Nature, 2026.","ama":"Sunko V, Orenstein J. Linear magneto-birefringence as a probe of altermagnetism. <i>npj Quantum Materials</i>. 2026. doi:<a href=\"https://doi.org/10.1038/s41535-026-00901-8\">10.1038/s41535-026-00901-8</a>","apa":"Sunko, V., &#38; Orenstein, J. (2026). Linear magneto-birefringence as a probe of altermagnetism. <i>Npj Quantum Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41535-026-00901-8\">https://doi.org/10.1038/s41535-026-00901-8</a>"},"publication":"npj Quantum Materials","publication_status":"epub_ahead","date_published":"2026-05-30T00:00:00Z","author":[{"full_name":"Sunko, Veronika","last_name":"Sunko","orcid":"0000-0003-2724-3523","first_name":"Veronika","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3"},{"last_name":"Orenstein","full_name":"Orenstein, J.","first_name":"J."}],"title":"Linear magneto-birefringence as a probe of altermagnetism"},{"ec_funded":1,"supplementarymaterial":"no","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","call_identifier":"H2020"}],"intvolume":"       368","department":[{"_id":"ChLa"},{"_id":"GradSch"},{"_id":"MoHe"}],"year":"2026","external_id":{"arxiv":["2511.17994"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","date_created":"2026-06-28T22:01:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-06-29T06:55:23Z","oa":1,"das_tickbox":"0","ddc":["000"],"acknowledgement":"We thank Rasmus Pagh, Christoph Lampert and Jalaj Upadhyay for valuable\r\ncomments on an early draft. We thank Ryan Mckenna for a fruitful discussion on the experiment\r\ndesign. We thank Antti Honkela for sharing insights on learning rate scheduling and DP.\r\nNikita P. Kalinin: Funded in part by the Austrian Science Fund (FWF) [10.55776/COE12].\r\nJoel Daniel Andersson: Funded by the European Union. Views and opinions expressed are however\r\nthose of the author(s) only and do not necessarily reflect those of the European Union or the European\r\nResearch Council Executive Agency. Neither the European Union nor the granting authority can be\r\nheld responsible for them. This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564). Additional funding by Providentia, a Data Science Distinguished Investigator grant\r\nfrom Novo Nordisk Fonden, with additional support from VILLUM Investigator grant 54451.\r\n","scopus_import":"1","day":"01","OA_type":"gold","alternative_title":["LIPIcs"],"doi":"10.4230/LIPIcs.FORC.2026.2","arxiv":1,"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","publication":"7th Symposium on Foundations of Responsible Computing","file":[{"file_name":"2026_LIPIcsFORC_Kalinin.pdf","file_id":"22149","content_type":"application/pdf","access_level":"open_access","date_created":"2026-06-29T06:55:23Z","file_size":1231914,"date_updated":"2026-06-29T06:55:23Z","success":1,"checksum":"c661f016d3861a1c1b590b87a744d087","creator":"dernst","relation":"main_file"}],"publication_status":"published","author":[{"id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","last_name":"Kalinin","full_name":"Kalinin, Nikita"},{"id":"4a893819-d954-11f0-89b1-e360bad9ccc5","first_name":"Joel D","last_name":"Andersson","full_name":"Andersson, Joel D"}],"date_published":"2026-06-01T00:00:00Z","article_number":"2:1-2:21","title":"Learning rate scheduling with matrix factorization for private training","conference":{"start_date":"2026-06-03","location":"Cambridge, MA; United States","name":"FORC: Symposium on Foundations of Responsible Computing","end_date":"2026-06-05"},"oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"keyword":["differential privacy","machine learning","matrix factorization"],"date_updated":"2026-06-29T06:56:34Z","abstract":[{"text":"We study differentially private model training with stochastic gradient descent under learning rate scheduling and correlated noise. Although correlated noise, in particular via matrix factorizations, has been shown to improve accuracy, prior theoretical work focused primarily on the prefix-sum workload. That workload assumes a constant learning rate, whereas in practice learning rate schedules are widely used to accelerate training and improve convergence. We close this gap by deriving general upper and lower bounds for a broad class of learning rate schedules in both single- and multi-epoch settings. Building on these results, we propose a learning-rate-aware factorization that achieves improvements over prefix-sum factorizations under both MaxSE and MeanSE error metrics. Our theoretical analysis yields memory-efficient constructions suitable for practical deployment, and experiments on CIFAR-10 and IMDB datasets confirm that schedule-aware factorizations improve accuracy in private training.","lang":"eng"}],"volume":368,"month":"06","_id":"22146","status":"public","publication_identifier":{"isbn":["9783959774192"],"eissn":["1868-8969"]},"type":"conference","citation":{"ama":"Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: <i>7th Symposium on Foundations of Responsible Computing</i>. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>","apa":"Kalinin, N., &#38; Andersson, J. D. (2026). Learning rate scheduling with matrix factorization for private training. In <i>7th Symposium on Foundations of Responsible Computing</i> (Vol. 368). Cambridge, MA; United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>","ista":"Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization for private training. 7th Symposium on Foundations of Responsible Computing. FORC: Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.","short":"N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” <i>7th Symposium on Foundations of Responsible Computing</i>, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>.","ieee":"N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in <i>7th Symposium on Foundations of Responsible Computing</i>, Cambridge, MA; United States, 2026, vol. 368.","chicago":"Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In <i>7th Symposium on Foundations of Responsible Computing</i>, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>."},"article_processing_charge":"No","researchdata_availability":"no"},{"ddc":["530"],"acknowledgement":"A.G. and K.P.S. acknowledge the DFG through CRC 1238 (277146847, A01) and DFG project SE 2575. K.P.S., P.S., and A.G. would like to thank the Center for Micro- and Nanostructures (ZMNS) for providing the cleanroom facilities. K.P.S. thanks Daniele Nazari for help with ALD of Al2O3 films. Financial support from FFG Austria (CrystalGate) is acknowledged. A.G. thanks John Weaver for discussions about the structure of RbxC60. B.C. acknowledges support from the NOMIS Foundation. First-principles simulations were supported as part of user project CNMS2025-R-03182 at the Center for Nanophase Materials Sciences (CNMS), which is a US Department of Energy, Office of Science User Facility at Oak Ridge National Laboratory. J.J. and J.H. acknowledge the computational resources provided by the ACCESS (Advanced Cyberinfrastructure Coordination Ecosystem: Services & Support) program through allocation TG-DMR110037; the National Energy Research Scientific Computing Center (NERSC), a DOE Office of Science User Facility supported under Contract No. DE-AC02-05CH11231, through NERSC award BES-ERCAP0031261; and the Compute and Data Environment for Science (CADES) Baseline at Oak Ridge National Laboratory, supported by the Office of Science of the U.S. Department of Energy under Contract No. DE-AC05-00OR22725. The authors acknowledge TU Wien Bibliothek for financial support through its Open access funding provided by Technische Universitat Wien.","scopus_import":"1","doi":"10.1021/acsnano.6c02466","publisher":"American Chemical Society","OA_type":"hybrid","day":"23","supplementarymaterial":"yes","department":[{"_id":"MiLe"}],"intvolume":"        20","year":"2026","date_created":"2026-06-28T22:01:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","PlanS_conform":"1","file_date_updated":"2026-06-29T08:58:12Z","oa":1,"das_tickbox":"0","external_id":{"pmid":["42260723"]},"language":[{"iso":"eng"}],"OA_place":"publisher","article_type":"original","keyword":["fulleride","intercalation","alkali metal","superconductivity","Raman"],"date_updated":"2026-06-29T09:00:33Z","issue":"24","abstract":[{"text":"An in-operando electro-intercalation method for the on-chip synthesis of alkali-metal-intercalated materials and their Raman spectroscopic and transport characterization in ultrahigh vacuum (UHV) is developed. We apply this method to synthesize fulleride superconductors via Rb+ intercalation into a C60 film. During the intercalation, we monitor the stoichiometry via UHV-Raman spectroscopy and probe superconductivity via transport measurements. An increase of the superconducting transition temperature from 7.0 K to 14.5 K is observed when the stoichiometry is tuned from Rb2.7C60 to Rb3C60. In our experiment, an ionic Rb+ flux into the host material is induced by an applied electronic current via a Butler–Volmer-type mechanism. Electro-intercalation captivates through improved stoichiometric precision, the ability to smoothly vary stoichiometry via duration of current application, and the absence of a lower limit of the volume of the host material. It represents a powerful concept for the on-chip synthesis of intercalated materials, battery research, and beyond.","lang":"eng"}],"volume":20,"month":"06","oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["1936-086X"],"issn":["1936-0851"]},"type":"journal_article","citation":{"apa":"Shchukin, K. P., Gallego Lacey, O. N., Coquinot, B., Jakowski, J., Huang, J., Staudenmayer, P., … Grüneis, A. (2026). On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsnano.6c02466\">https://doi.org/10.1021/acsnano.6c02466</a>","ama":"Shchukin KP, Gallego Lacey ON, Coquinot B, et al. On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation. <i>ACS Nano</i>. 2026;20(24):17360-17372. doi:<a href=\"https://doi.org/10.1021/acsnano.6c02466\">10.1021/acsnano.6c02466</a>","ieee":"K. P. Shchukin <i>et al.</i>, “On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation,” <i>ACS Nano</i>, vol. 20, no. 24. American Chemical Society, pp. 17360–17372, 2026.","chicago":"Shchukin, Konstantin P., Oliver N. Gallego Lacey, Baptiste Coquinot, Jacek Jakowski, Jingsong Huang, Patrik Staudenmayer, Yannic Falke, Ram Prakash Pandeya, and Alexander Grüneis. “On-Chip Tuning of Superconductivity in Fullerides via Current-Driven Rb+ Intercalation.” <i>ACS Nano</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acsnano.6c02466\">https://doi.org/10.1021/acsnano.6c02466</a>.","mla":"Shchukin, Konstantin P., et al. “On-Chip Tuning of Superconductivity in Fullerides via Current-Driven Rb+ Intercalation.” <i>ACS Nano</i>, vol. 20, no. 24, American Chemical Society, 2026, pp. 17360–72, doi:<a href=\"https://doi.org/10.1021/acsnano.6c02466\">10.1021/acsnano.6c02466</a>.","short":"K.P. Shchukin, O.N. Gallego Lacey, B. Coquinot, J. Jakowski, J. Huang, P. Staudenmayer, Y. Falke, R.P. Pandeya, A. Grüneis, ACS Nano 20 (2026) 17360–17372.","ista":"Shchukin KP, Gallego Lacey ON, Coquinot B, Jakowski J, Huang J, Staudenmayer P, Falke Y, Pandeya RP, Grüneis A. 2026. On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation. ACS Nano. 20(24), 17360–17372."},"researchdata_availability":"no","article_processing_charge":"Yes (via OA deal)","status":"public","_id":"22145","page":"17360-17372","publication_status":"published","pmid":1,"quality_controlled":"1","file":[{"date_updated":"2026-06-29T08:58:12Z","creator":"dernst","checksum":"01ec8ee6fab7bf563df7af13f6b43045","success":1,"relation":"main_file","content_type":"application/pdf","file_name":"2026_ACSNano_Shchukin.pdf","access_level":"open_access","file_id":"22150","date_created":"2026-06-29T08:58:12Z","file_size":6290296}],"publication":"ACS Nano","title":"On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation","author":[{"full_name":"Shchukin, Konstantin P.","last_name":"Shchukin","first_name":"Konstantin P."},{"first_name":"Oliver N.","full_name":"Gallego Lacey, Oliver N.","last_name":"Gallego Lacey"},{"full_name":"Coquinot, Baptiste","orcid":"0000-0001-5524-596X","last_name":"Coquinot","first_name":"Baptiste","id":"f8417bd4-f599-11ee-a482-b927e3ed1e8e"},{"full_name":"Jakowski, Jacek","last_name":"Jakowski","first_name":"Jacek"},{"first_name":"Jingsong","last_name":"Huang","full_name":"Huang, Jingsong"},{"first_name":"Patrik","last_name":"Staudenmayer","full_name":"Staudenmayer, Patrik"},{"last_name":"Falke","full_name":"Falke, Yannic","first_name":"Yannic"},{"first_name":"Ram Prakash","full_name":"Pandeya, Ram Prakash","last_name":"Pandeya"},{"full_name":"Grüneis, Alexander","last_name":"Grüneis","first_name":"Alexander"}],"date_published":"2026-06-23T00:00:00Z"},{"date_created":"2026-06-24T18:29:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Mechanical gating of redox access in molecular electrocatalysis","external_id":{"pmid":["42319128"]},"language":[{"iso":"eng"}],"author":[{"first_name":"Rahul Mahadeo","full_name":"Mendhe, Rahul Mahadeo","last_name":"Mendhe"},{"first_name":"Neethu","id":"19edef5c-384c-11ef-8188-c73c9c31d601","full_name":"Christudas Dargily, Neethu","last_name":"Christudas Dargily"},{"last_name":"Kottaichamy","full_name":"Kottaichamy, Alagar Raja","first_name":"Alagar Raja"},{"first_name":"Shifali","last_name":"Dutt","full_name":"Dutt, Shifali"},{"first_name":"Mukaddar","last_name":"Sk","full_name":"Sk, Mukaddar"},{"last_name":"Makri Nimbegondi Kotresh","full_name":"Makri Nimbegondi Kotresh, Harish","first_name":"Harish"},{"first_name":"Musthafa","full_name":"Ottakam Thotiyl, Musthafa","last_name":"Ottakam Thotiyl"}],"article_number":"jacs.6c02632","date_published":"2026-06-19T00:00:00Z","publication_status":"epub_ahead","year":"2026","pmid":1,"quality_controlled":"1","publication":"Journal of the American Chemical Society","extern":"1","doi":"10.1021/jacs.6c02632","publication_identifier":{"eissn":["1520-5126"],"issn":["0002-7863"]},"type":"journal_article","citation":{"ama":"Mendhe RM, Christudas Dargily N, Kottaichamy AR, et al. Mechanical gating of redox access in molecular electrocatalysis. <i>Journal of the American Chemical Society</i>. 2026. doi:<a href=\"https://doi.org/10.1021/jacs.6c02632\">10.1021/jacs.6c02632</a>","apa":"Mendhe, R. M., Christudas Dargily, N., Kottaichamy, A. R., Dutt, S., Sk, M., Makri Nimbegondi Kotresh, H., &#38; Ottakam Thotiyl, M. (2026). Mechanical gating of redox access in molecular electrocatalysis. <i>Journal of the American Chemical Society</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/jacs.6c02632\">https://doi.org/10.1021/jacs.6c02632</a>","short":"R.M. Mendhe, N. Christudas Dargily, A.R. Kottaichamy, S. Dutt, M. Sk, H. Makri Nimbegondi Kotresh, M. Ottakam Thotiyl, Journal of the American Chemical Society (2026).","ista":"Mendhe RM, Christudas Dargily N, Kottaichamy AR, Dutt S, Sk M, Makri Nimbegondi Kotresh H, Ottakam Thotiyl M. 2026. Mechanical gating of redox access in molecular electrocatalysis. Journal of the American Chemical Society., jacs. 6c02632.","chicago":"Mendhe, Rahul Mahadeo, Neethu Christudas Dargily, Alagar Raja Kottaichamy, Shifali Dutt, Mukaddar Sk, Harish Makri Nimbegondi Kotresh, and Musthafa Ottakam Thotiyl. “Mechanical Gating of Redox Access in Molecular Electrocatalysis.” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/jacs.6c02632\">https://doi.org/10.1021/jacs.6c02632</a>.","ieee":"R. M. Mendhe <i>et al.</i>, “Mechanical gating of redox access in molecular electrocatalysis,” <i>Journal of the American Chemical Society</i>. American Chemical Society, 2026.","mla":"Mendhe, Rahul Mahadeo, et al. “Mechanical Gating of Redox Access in Molecular Electrocatalysis.” <i>Journal of the American Chemical Society</i>, jacs. 6c02632, American Chemical Society, 2026, doi:<a href=\"https://doi.org/10.1021/jacs.6c02632\">10.1021/jacs.6c02632</a>."},"article_processing_charge":"No","publisher":"American Chemical Society","_id":"22141","OA_type":"closed access","status":"public","day":"19","article_type":"original","date_updated":"2026-06-29T06:39:21Z","month":"06","abstract":[{"text":"Molecular electrocatalysis is commonly interpreted through electronic descriptors, implicitly treating catalysts as mechanically passive during redox cycling. Yet, electron transfer often imposes structural demands on molecular scaffolds, raising the question of whether internal mechanical constraints can directly regulate access to reactive states and, in turn, catalytic outcomes. Addressing this question has remained challenging because mechanical effects are typically inseparable from changes in composition or electronic structure. Here, we achieve this separation by exploiting two constitutionally identical molecular catalysts whose only distinction is ligand geometry. This minimal geometric variation enables or suppresses intramolecular hydrogen bonding, thereby encoding distinct mechanical constraints that isolate molecular mechanics as a variable in redox accessibility. In the α isomer, molecular constraints impose a mechanically enforced barrier that severely limits access to the reactive redox state. This disrupts the temporal ordering of elementary steps, and diverts reactivity toward competing hydrogen evolution, eroding both selectivity and stability. In contrast, mechanical compliance in the β isomer enables facile access to the redox-active state, allowing CO2 activation to intrinsically outpace water activation and yielding CO selectivities exceeding 92%. Operando spectroscopy and real-time mass spectrometry, combined with computational simulation, directly resolve this mechanically gated reaction sequence as it unfolds. Molecular mechanics thus emerge as determinants that link electron flow to reaction sequencing and catalytic selectivity, revealing that constitutionally similar catalysts can be mechanically, and therefore catalytically, distinct.","lang":"eng"}],"oa_version":"None"},{"publication_status":"published","page":"3845-3846","publication":"Cell","quality_controlled":"1","title":"A new sense for electrical fields","author":[{"first_name":"Michael","id":"3BE60946-F248-11E8-B48F-1D18A9856A87","full_name":"Riedl, Michael","last_name":"Riedl","orcid":"0000-0003-4844-6311"},{"last_name":"Sixt","orcid":"0000-0002-6620-9179","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K"}],"date_published":"2026-06-25T00:00:00Z","date_updated":"2026-06-29T09:04:49Z","issue":"13","volume":189,"abstract":[{"text":"Most cells polarize and migrate in response to electrical fields. In this issue of Cell, Belliveau et al. identify TMEM154/Galvanin, a receptor that serves as a cellular antenna to sense electrical gradients and guide migration toward the cathode.","lang":"eng"}],"month":"06","article_type":"comment","oa_version":"None","citation":{"apa":"Riedl, M., &#38; Sixt, M. K. (2026). A new sense for electrical fields. <i>Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cell.2026.05.038\">https://doi.org/10.1016/j.cell.2026.05.038</a>","ama":"Riedl M, Sixt MK. A new sense for electrical fields. <i>Cell</i>. 2026;189(13):3845-3846. doi:<a href=\"https://doi.org/10.1016/j.cell.2026.05.038\">10.1016/j.cell.2026.05.038</a>","chicago":"Riedl, Michael, and Michael K Sixt. “A New Sense for Electrical Fields.” <i>Cell</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.cell.2026.05.038\">https://doi.org/10.1016/j.cell.2026.05.038</a>.","ieee":"M. Riedl and M. K. Sixt, “A new sense for electrical fields,” <i>Cell</i>, vol. 189, no. 13. Elsevier, pp. 3845–3846, 2026.","mla":"Riedl, Michael, and Michael K. Sixt. “A New Sense for Electrical Fields.” <i>Cell</i>, vol. 189, no. 13, Elsevier, 2026, pp. 3845–46, doi:<a href=\"https://doi.org/10.1016/j.cell.2026.05.038\">10.1016/j.cell.2026.05.038</a>.","short":"M. Riedl, M.K. Sixt, Cell 189 (2026) 3845–3846.","ista":"Riedl M, Sixt MK. 2026. A new sense for electrical fields. Cell. 189(13), 3845–3846."},"article_processing_charge":"No","researchdata_availability":"no","publication_identifier":{"issn":["0092-8674"],"eissn":["1097-4172"]},"type":"journal_article","_id":"22144","status":"public","intvolume":"       189","department":[{"_id":"MiSi"}],"year":"2026","supplementarymaterial":"no","das_tickbox":"0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-28T22:01:34Z","corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","publisher":"Elsevier","doi":"10.1016/j.cell.2026.05.038","OA_type":"closed access","day":"25"},{"ddc":["500"],"acknowledgement":"Z.H. was supported by SNSF grant 200021-228014. M.K. was supported by ERC Starting Grant “RANDSTRUCT” No. 101076777. L.S. was supported by the Deutsche Forschungsgemeinschaft (DFG, German\r\nResearch Foundation)—CRC 1720–539309657. This research was conducted during the period M.S. served\r\nas a Clay Research Fellow. This work began when the authors were visiting Mathematisches Forschungsinstitut Oberwolfach, which\r\nprovided ideal working conditions. M.S. thanks Vishesh Jain for initial discussions regarding the problem.\r\nWe also thank the anonymous referee for helpful comments.","scopus_import":"1","doi":"10.1093/imrn/rnag126","arxiv":1,"publisher":"Oxford University Press","day":"01","OA_type":"hybrid","supplementarymaterial":"no","project":[{"grant_number":"101076777","_id":"bd95085b-d553-11ed-ba76-e55d3349be45","name":"Randomness and structure in combinatorics"}],"intvolume":"      2026","department":[{"_id":"MaKw"}],"year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-28T22:01:35Z","file_date_updated":"2026-06-29T09:15:15Z","PlanS_conform":"1","das_tickbox":"0","oa":1,"external_id":{"arxiv":["2510.12933"]},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","article_type":"original","date_updated":"2026-06-29T09:19:14Z","issue":"12","volume":2026,"abstract":[{"lang":"eng","text":"Let 1 ≤ k ≤ n and M be a random n × n matrix with independent uniformly random {±1}-entries. We\r\nshow that there exists an absolute constant c > 0 such that\r\nP[rank(M) ≤ n − k] ≤ exp(−cnk).\r\nThis confirms a well-known prediction in the area, extending a result of Rudelson (who previously\r\nproved this same result under the restriction k ≤ √n, via different methods)."}],"month":"06","oa_version":"Published Version","has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"type":"journal_article","citation":{"mla":"Hunter, Zach, et al. “On Random Matrices with Large Corank.” <i>International Mathematics Research Notices</i>, vol. 2026, no. 12, rnag126, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/imrn/rnag126\">10.1093/imrn/rnag126</a>.","chicago":"Hunter, Zach, Matthew Alan Kwan, Lisa Sauermann, and Mehtaab Sawhney. “On Random Matrices with Large Corank.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2026. <a href=\"https://doi.org/10.1093/imrn/rnag126\">https://doi.org/10.1093/imrn/rnag126</a>.","ieee":"Z. Hunter, M. A. Kwan, L. Sauermann, and M. Sawhney, “On random matrices with large corank,” <i>International Mathematics Research Notices</i>, vol. 2026, no. 12. Oxford University Press, 2026.","ista":"Hunter Z, Kwan MA, Sauermann L, Sawhney M. 2026. On random matrices with large corank. International Mathematics Research Notices. 2026(12), rnag126.","short":"Z. Hunter, M.A. Kwan, L. Sauermann, M. Sawhney, International Mathematics Research Notices 2026 (2026).","apa":"Hunter, Z., Kwan, M. A., Sauermann, L., &#38; Sawhney, M. (2026). On random matrices with large corank. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnag126\">https://doi.org/10.1093/imrn/rnag126</a>","ama":"Hunter Z, Kwan MA, Sauermann L, Sawhney M. On random matrices with large corank. <i>International Mathematics Research Notices</i>. 2026;2026(12). doi:<a href=\"https://doi.org/10.1093/imrn/rnag126\">10.1093/imrn/rnag126</a>"},"researchdata_availability":"no","article_processing_charge":"Yes (via OA deal)","status":"public","_id":"22147","publication_status":"published","quality_controlled":"1","publication":"International Mathematics Research Notices","file":[{"date_updated":"2026-06-29T09:15:15Z","creator":"dernst","checksum":"396b47d0532d7ea509f8cd30f11392a8","success":1,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2026_IMRN_Hunter.pdf","file_id":"22151","date_created":"2026-06-29T09:15:15Z","file_size":524993}],"title":"On random matrices with large corank","author":[{"first_name":"Zach","last_name":"Hunter","full_name":"Hunter, Zach"},{"id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan"},{"first_name":"Lisa","last_name":"Sauermann","full_name":"Sauermann, Lisa"},{"first_name":"Mehtaab","last_name":"Sawhney","full_name":"Sawhney, Mehtaab"}],"article_number":"rnag126","date_published":"2026-06-01T00:00:00Z"},{"title":"Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity","author":[{"full_name":"Harrop-Griffiths, Benjamin","last_name":"Harrop-Griffiths","first_name":"Benjamin"},{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","last_name":"Visan","full_name":"Visan, Monica"}],"date_published":"2026-06-12T00:00:00Z","publication_status":"epub_ahead","quality_controlled":"1","publication":"Proceedings of the American Mathematical Society","extern":"1","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"type":"journal_article","citation":{"apa":"Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2026). Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/17760\">https://doi.org/10.1090/proc/17760</a>","ama":"Harrop-Griffiths B, Killip R, Vişan M. Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. <i>Proceedings of the American Mathematical Society</i>. 2026. doi:<a href=\"https://doi.org/10.1090/proc/17760\">10.1090/proc/17760</a>","mla":"Harrop-Griffiths, Benjamin, et al. “Scattering for the Nonlinear Schrödinger Equation with Concentrated Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>, American Mathematical Society, 2026, doi:<a href=\"https://doi.org/10.1090/proc/17760\">10.1090/proc/17760</a>.","ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity,” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2026.","chicago":"Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “Scattering for the Nonlinear Schrödinger Equation with Concentrated Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2026. <a href=\"https://doi.org/10.1090/proc/17760\">https://doi.org/10.1090/proc/17760</a>.","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2026. Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. Proceedings of the American Mathematical Society.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, Proceedings of the American Mathematical Society (2026)."},"article_processing_charge":"No","status":"public","_id":"22097","article_type":"original","date_updated":"2026-06-30T11:13:33Z","abstract":[{"text":"We consider the cubic defocusing nonlinear Schrödinger equation in one dimension with the nonlinearity concentrated at a single point. We prove global well-posedness in the scaling-critical space L^2(R) and scattering for all such solutions. Moreover, we demonstrate that the same phenomenology holds whenever nonlinear effects are sufficiently concentrated in space.","lang":"eng"}],"month":"06","oa_version":"Preprint","date_created":"2026-06-19T08:59:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"das_tickbox":"1","external_id":{"arxiv":["2507.14571"]},"language":[{"iso":"eng"}],"OA_place":"repository","year":"2026","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.14571","open_access":"1"}],"doi":"10.1090/proc/17760","arxiv":1,"publisher":"American Mathematical Society","day":"12","OA_type":"green","scopus_import":"1"},{"OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"pmid":["42014695"]},"oa":1,"das_tickbox":"1","file_date_updated":"2026-07-01T06:46:06Z","PlanS_conform":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-30T13:05:52Z","department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"intvolume":"        17","year":"2026","project":[{"grant_number":"692692","call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse"},{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","grant_number":"101199096"},{"call_identifier":"H2020","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Synaptic computations of the hippocampal CA3 circuitry","_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","grant_number":"101026635","call_identifier":"H2020"},{"_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","name":"Mechanisms of GABA release in hippocampal circuits","grant_number":"P36232"},{"_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","name":"Synaptic networks of human brain","grant_number":"PAT 4178023"},{"_id":"26366136-B435-11E9-9278-68D0E5697425","name":"Reglas de Conectividad funcional en el hipocampo"}],"supplementarymaterial":"yes","ec_funded":1,"DOAJ_listed":"1","OA_type":"gold","day":"23","publisher":"Springer Nature","dataavailabilitystatement":"Source data are provided with this paper. Additional original data are available from the corresponding author upon request. Code is available from https://doi.org/10.15479/AT-ISTA-21442 under the link https://research-explorer.ista.ac.at/download/21442/21443/ca3simu-vargas2026v1.tar.gz","doi":"10.1038/s41467-026-71914-x","scopus_import":"1","ddc":["570"],"acknowledgement":"We thank Jose Guzman, Simon Hippenmeyer, and Tim Vogels for critically reading the manuscript, Jozsef Csicsvari for useful discussions, Florian Marr for technical assistance, and Eleftheria Kralli-Beller for manuscript editing. This research was supported by the Scientific Services Units (SSUs) of ISTA: the preclinical facility (PCF) provided housing and breeding of the animals, the imaging and optics facility (IOF) offered technical training and state of the art equipment, the Miba machine shop contributed to the construction and maintenance of multicellular recording setups, and the scientific computing unit helped with the large-scale simulations. The project received funding from the European Union’s Horizon 2020 research and innovation programme (ERC Advanced Grants No 692692 GIANTSYN and 101199096 CA3-SYNGRAM to P.J.; Marie Skłodowska-Curie Grant 754411 to V.V.B.; Marie Skłodowska-Curie Grant 101026635 to J.F.W.), the Fond zur Förderung der Wissenschaftlichen Forschung (P 36232-B, PAT4178023, and 10.55776/CoE16 to P.J.), and the Nomis Foundation (fellowship to A.N.-O.). V.V.B. received funding from a CONACyT fellowship (289638).","date_published":"2026-06-23T00:00:00Z","article_number":"5540","author":[{"id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","first_name":"Victor M","last_name":"Vargas Barroso","full_name":"Vargas Barroso, Victor M"},{"first_name":"Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","full_name":"Watson, Jake","orcid":"0000-0002-8698-3823","last_name":"Watson"},{"id":"739d26c9-52e8-11ee-8d72-f14d3893b4ce","first_name":"Andrea C","orcid":"0000-0002-9280-8597","last_name":"Navas Olivé","full_name":"Navas Olivé, Andrea C"},{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl","first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","last_name":"Jonas"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"M-Shop"},{"_id":"ScienComp"}],"title":"Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit","file":[{"date_updated":"2026-07-01T06:46:06Z","checksum":"d0b0093493926985b4c268662ff4d556","creator":"dernst","relation":"main_file","success":1,"file_id":"22231","access_level":"open_access","content_type":"application/pdf","file_name":"2026_NatureComm_VargasBarroso.pdf","date_created":"2026-07-01T06:46:06Z","file_size":18304997}],"publication":"Nature Communications","quality_controlled":"1","pmid":1,"publication_status":"published","status":"public","_id":"22229","article_processing_charge":"Yes","researchdata_availability":"yes","citation":{"apa":"Vargas Barroso, V. M., Watson, J., Navas Olivé, A. C., Schlögl, A., &#38; Jonas, P. M. (2026). Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71914-x\">https://doi.org/10.1038/s41467-026-71914-x</a>","ama":"Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71914-x\">10.1038/s41467-026-71914-x</a>","mla":"Vargas Barroso, Victor M., et al. “Developmental Emergence of Sparse and Structured Synaptic Connectivity in the Hippocampal CA3 Memory Circuit.” <i>Nature Communications</i>, vol. 17, 5540, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71914-x\">10.1038/s41467-026-71914-x</a>.","ieee":"V. M. Vargas Barroso, J. Watson, A. C. Navas Olivé, A. Schlögl, and P. M. Jonas, “Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","chicago":"Vargas Barroso, Victor M, Jake Watson, Andrea C Navas Olivé, Alois Schlögl, and Peter M Jonas. “Developmental Emergence of Sparse and Structured Synaptic Connectivity in the Hippocampal CA3 Memory Circuit.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71914-x\">https://doi.org/10.1038/s41467-026-71914-x</a>.","ista":"Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. 2026. Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. Nature Communications. 17, 5540.","short":"V.M. Vargas Barroso, J. Watson, A.C. Navas Olivé, A. Schlögl, P.M. Jonas, Nature Communications 17 (2026)."},"type":"journal_article","publication_identifier":{"eissn":["2041-1723"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"Hippocampal CA3 pyramidal neurons (PNs) form the largest autoassociative network in the mammalian brain. Whether CA3–CA3 recurrent connectivity is genetically preconfigured or environmentally shaped during ongoing memory storage is currently unknown. To address this question, we performed multicellular patch-clamp-based circuit mapping of up to eight CA3 PNs in the mouse hippocampus at multiple postnatal time points (P7–8, P18–25, and P45–50). Here, we show that the hippocampal CA3 network undergoes a developmental transformation from local, dense, and random connectivity to a distributed, sparse, and structured configuration. Thus, sparse and structured connectivity may emerge via experience-dependent mechanisms. In parallel, the strength of single synapses is downregulated; single synaptic events are sufficient to trigger postsynaptic spiking early in development, whereas spatial summation of several inputs is required at later time points. Biologically inspired models of memory storage by Hebbian synaptic plasticity and retrieval via pattern completion suggest that developmental changes improve specific aspects of memory storage and retrieval. Our results imply a developmental transformation of the neuronal code and the memory functions in the hippocampal CA3 network.</jats:p>"}],"volume":17,"month":"06","date_updated":"2026-07-01T06:47:49Z","article_type":"original","related_material":{"record":[{"status":"public","id":"21442","relation":"research_data"}]}},{"file":[{"date_updated":"2026-03-12T08:19:14Z","creator":"schloegl","checksum":"441c8827717dcda05f91c127d15cf1e9","relation":"main_file","success":1,"content_type":"application/gzip","access_level":"open_access","file_name":"ca3simu-vargas2026v1.tar.gz","file_id":"21443","date_created":"2026-03-12T08:19:14Z","file_size":160410},{"content_type":"text/markdown","access_level":"open_access","file_name":"README.md","file_id":"21445","file_size":10923,"date_created":"2026-03-12T10:24:45Z","date_updated":"2026-03-12T10:24:45Z","relation":"main_file","success":1,"checksum":"3c0092076228a15c0a7ae703192d43ea","creator":"schloegl"}],"project":[{"grant_number":"101199096","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b"},{"grant_number":"P36232","name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692"}],"year":"2026","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"ec_funded":1,"author":[{"first_name":"Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","last_name":"Schlögl"}],"corr_author":"1","date_published":"2026-03-12T00:00:00Z","file_date_updated":"2026-03-12T10:24:45Z","oa":1,"license":"https://opensource.org/licenses/GPL-3.0","date_created":"2026-03-12T08:20:46Z","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","title":"CA3Simu v1.06 (vargas2026v1)","tmp":{"short":"GPL 3.0","name":"GNU General Public License 3.0","legal_code_url":"https://www.gnu.org/licenses/gpl-3.0.en.html"},"has_accepted_license":"1","date_updated":"2026-07-01T06:47:49Z","month":"03","related_material":{"record":[{"id":"22229","status":"public","relation":"used_in_publication"}]},"keyword":["hypocampus","ca3 simulations","modelling"],"_id":"21442","status":"public","day":"12","citation":{"short":"A. Schlögl, (2026).","ista":"Schlögl A. 2026. CA3Simu v1.06 (vargas2026v1), Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","ieee":"A. Schlögl, “CA3Simu v1.06 (vargas2026v1).” Institute of Science and Technology Austria, 2026.","chicago":"Schlögl, Alois. “CA3Simu v1.06 (Vargas2026v1).” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>.","mla":"Schlögl, Alois. <i>CA3Simu v1.06 (Vargas2026v1)</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","ama":"Schlögl A. CA3Simu v1.06 (vargas2026v1). 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>","apa":"Schlögl, A. (2026). CA3Simu v1.06 (vargas2026v1). Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>"},"publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT-ISTA-21442","type":"software"},{"scopus_import":"1","OA_type":"green","day":"08","doi":"10.1007/s00028-026-01228-4","arxiv":1,"publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2506.23868"}],"year":"2026","intvolume":"        26","external_id":{"arxiv":["2506.23868"]},"language":[{"iso":"eng"}],"OA_place":"repository","date_created":"2026-06-19T08:58:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"das_tickbox":"1","oa_version":"Preprint","article_type":"original","date_updated":"2026-07-02T06:02:36Z","issue":"3","abstract":[{"text":"We prove uniform-in-time a priori Hs bounds for solutions to the intermediate longwave equation\r\nposed both on the line and on the circle, covering the range −1\r\n2 < s ≤ 0. Additionally, we prove that the\r\nset of orbits emanating from a bounded and equicontinuous set in Hs is also bounded and equicontinuous\r\nin Hs . Our proof is based on the identification of a suitable Lax pair formulation for the intermediate long\r\nwave equation.","lang":"eng"}],"month":"06","volume":26,"_id":"22096","status":"public","publication_identifier":{"issn":["1424-3199"],"eissn":["1424-3202"]},"type":"journal_article","citation":{"ama":"Harrop-Griffiths B, Killip R, Vişan M. A priori bounds and equicontinuity of orbits for the intermediate long wave equation. <i>Journal of Evolution Equations</i>. 2026;26(3). doi:<a href=\"https://doi.org/10.1007/s00028-026-01228-4\">10.1007/s00028-026-01228-4</a>","apa":"Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2026). A priori bounds and equicontinuity of orbits for the intermediate long wave equation. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-026-01228-4\">https://doi.org/10.1007/s00028-026-01228-4</a>","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2026. A priori bounds and equicontinuity of orbits for the intermediate long wave equation. Journal of Evolution Equations. 26(3), 81.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, Journal of Evolution Equations 26 (2026).","mla":"Harrop-Griffiths, B., et al. “A Priori Bounds and Equicontinuity of Orbits for the Intermediate Long Wave Equation.” <i>Journal of Evolution Equations</i>, vol. 26, no. 3, 81, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s00028-026-01228-4\">10.1007/s00028-026-01228-4</a>.","chicago":"Harrop-Griffiths, B., R. Killip, and Monica Vişan. “A Priori Bounds and Equicontinuity of Orbits for the Intermediate Long Wave Equation.” <i>Journal of Evolution Equations</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00028-026-01228-4\">https://doi.org/10.1007/s00028-026-01228-4</a>.","ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “A priori bounds and equicontinuity of orbits for the intermediate long wave equation,” <i>Journal of Evolution Equations</i>, vol. 26, no. 3. Springer Nature, 2026."},"article_processing_charge":"No","quality_controlled":"1","extern":"1","publication":"Journal of Evolution Equations","publication_status":"published","author":[{"first_name":"B.","last_name":"Harrop-Griffiths","full_name":"Harrop-Griffiths, B."},{"full_name":"Killip, R.","last_name":"Killip","first_name":"R."},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","last_name":"Visan","full_name":"Visan, Monica"}],"article_number":"81","date_published":"2026-06-08T00:00:00Z","title":"A priori bounds and equicontinuity of orbits for the intermediate long wave equation"},{"doi":"10.5194/egusphere-egu26-19367","publisher":"European Geosciences Union","OA_type":"gold","day":"02","ddc":["550"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-22T12:16:50Z","oa":1,"file_date_updated":"2026-07-02T06:22:50Z","language":[{"iso":"eng"}],"OA_place":"publisher","corr_author":"1","year":"2026","department":[{"_id":"FrPe"},{"_id":"GradSch"}],"type":"conference_abstract","article_processing_charge":"No","citation":{"ista":"Muñoz Hermosilla JM, Miles E, McCarthy M, Melo Velasco JV, Hardmeier F, GANTAYAT P, Fontrodona-Bach A, Jouvet G, Pellicciotti F. 2026. Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. EGU General Assembly 2026. EGU General Assembly, EGU26-19367.","short":"J.M. Muñoz Hermosilla, E. Miles, M. McCarthy, J.V. Melo Velasco, F. Hardmeier, P. GANTAYAT, A. Fontrodona-Bach, G. Jouvet, F. Pellicciotti, in:, EGU General Assembly 2026, European Geosciences Union, 2026.","mla":"Muñoz Hermosilla, José M., et al. “Constraining Debris Input to Oberaletsch Glacier Using Ensemble-Based Lagrangian Modelling.” <i>EGU General Assembly 2026</i>, EGU26-19367, European Geosciences Union, 2026, doi:<a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">10.5194/egusphere-egu26-19367</a>.","ieee":"J. M. Muñoz Hermosilla <i>et al.</i>, “Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling,” in <i>EGU General Assembly 2026</i>, Vienna, Austria &#38; Virtual, 2026.","chicago":"Muñoz Hermosilla, José M, Evan Miles, Michael McCarthy, Juan Vicente Melo Velasco, Florian Hardmeier, PRATEEK GANTAYAT, Adrià Fontrodona-Bach, Guillaume Jouvet, and Francesca Pellicciotti. “Constraining Debris Input to Oberaletsch Glacier Using Ensemble-Based Lagrangian Modelling.” In <i>EGU General Assembly 2026</i>. European Geosciences Union, 2026. <a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">https://doi.org/10.5194/egusphere-egu26-19367</a>.","ama":"Muñoz Hermosilla JM, Miles E, McCarthy M, et al. Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. In: <i>EGU General Assembly 2026</i>. European Geosciences Union; 2026. doi:<a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">10.5194/egusphere-egu26-19367</a>","apa":"Muñoz Hermosilla, J. M., Miles, E., McCarthy, M., Melo Velasco, J. V., Hardmeier, F., GANTAYAT, P., … Pellicciotti, F. (2026). Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling. In <i>EGU General Assembly 2026</i>. Vienna, Austria &#38; Virtual: European Geosciences Union. <a href=\"https://doi.org/10.5194/egusphere-egu26-19367\">https://doi.org/10.5194/egusphere-egu26-19367</a>"},"status":"public","_id":"22119","month":"07","date_updated":"2026-07-02T06:42:37Z","has_accepted_license":"1","oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"title":"Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian modelling","conference":{"end_date":"2026-05-08","name":"EGU General Assembly","start_date":"2026-05-03","location":"Vienna, Austria & Virtual"},"date_published":"2026-07-02T00:00:00Z","article_number":"EGU26-19367","author":[{"first_name":"José M","id":"e1037a6d-646e-11ef-b402-e0ed9ab0901e","full_name":"Muñoz Hermosilla, José M","orcid":"0000-0002-1990-8508","last_name":"Muñoz Hermosilla"},{"first_name":"Evan","last_name":"Miles","full_name":"Miles, Evan"},{"first_name":"Michael","id":"22a2674a-61ce-11ee-94b5-d18813baf16f","full_name":"McCarthy, Michael","last_name":"McCarthy"},{"full_name":"Melo Velasco, Juan Vicente","last_name":"Melo Velasco","first_name":"Juan Vicente","id":"2611dec0-b9c6-11ed-9bea-a81c2b17a549"},{"full_name":"Hardmeier, Florian","last_name":"Hardmeier","first_name":"Florian"},{"id":"02734268-3e8d-11ef-80a1-cec4a088d004","first_name":"PRATEEK","last_name":"GANTAYAT","full_name":"GANTAYAT, PRATEEK"},{"first_name":"Adrià","id":"f06891fd-9f42-11ee-8632-a20971c43046","full_name":"Fontrodona-Bach, Adrià","last_name":"Fontrodona-Bach"},{"last_name":"Jouvet","full_name":"Jouvet, Guillaume","first_name":"Guillaume"},{"last_name":"Pellicciotti","orcid":"0000-0002-5554-8087","full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca"}],"publication_status":"published","file":[{"file_size":284023,"date_created":"2026-07-02T06:22:50Z","content_type":"application/pdf","file_name":"2026_EGU26_MunozHermosilla.pdf","file_id":"22233","access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"2ea3e691cfa53176d0e801b9172842d6","success":1,"date_updated":"2026-07-02T06:22:50Z"}],"publication":"EGU General Assembly 2026"},{"_id":"22245","status":"public","researchdata_availability":"no","article_processing_charge":"No","citation":{"apa":"Henzinger, M., Münk, R., &#38; Räcke, H. (2026). An improved quality hierarchical congestion approximator in near-linear time. In <i>58th Annual ACM Symposium on Theory of Computing</i> (pp. 1417–1428). Salt Lake City, UT, United States: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3798129.3800851\">https://doi.org/10.1145/3798129.3800851</a>","ama":"Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion approximator in near-linear time. In: <i>58th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery; 2026:1417-1428. doi:<a href=\"https://doi.org/10.1145/3798129.3800851\">10.1145/3798129.3800851</a>","chicago":"Henzinger, Monika, Robin Münk, and Harald Räcke. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” In <i>58th Annual ACM Symposium on Theory of Computing</i>, 1417–28. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3798129.3800851\">https://doi.org/10.1145/3798129.3800851</a>.","ieee":"M. Henzinger, R. Münk, and H. Räcke, “An improved quality hierarchical congestion approximator in near-linear time,” in <i>58th Annual ACM Symposium on Theory of Computing</i>, Salt Lake City, UT, United States, 2026, pp. 1417–1428.","mla":"Henzinger, Monika, et al. “An Improved Quality Hierarchical Congestion Approximator in Near-Linear Time.” <i>58th Annual ACM Symposium on Theory of Computing</i>, Association for Computing Machinery, 2026, pp. 1417–28, doi:<a href=\"https://doi.org/10.1145/3798129.3800851\">10.1145/3798129.3800851</a>.","short":"M. Henzinger, R. Münk, H. Räcke, in:, 58th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2026, pp. 1417–1428.","ista":"Henzinger M, Münk R, Räcke H. 2026. An improved quality hierarchical congestion approximator in near-linear time. 58th Annual ACM Symposium on Theory of Computing. STOC: Symposium on the Theory of Computing, 1417–1428."},"type":"conference","publication_identifier":{"issn":["0737-8017"],"isbn":["9798400725364"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","oa_version":"Published Version","abstract":[{"text":"A single-commodity congestion approximator for a graph is a compact data structure that approximately predicts the edge congestion required to route any set of single-commodity flow demands in a network. A hierarchical congestion approximator (HCA) consists of a laminar family of cuts in the graph and has numerous applications in approximating cut and flow problems in graphs, designing efficient routing schemes, and managing distributed networks.\r\nThere is a tradeoff between the running time for computing an HCA and its approximation quality. The best polynomial-time construction in an n-node graph gives an HCA with approximation quality O(log1.5n loglogn). Among near-linear time algorithms, the best previous result achieves approximation quality O(log4 n). We improve upon the latter result by giving the first near-linear time algorithm for computing an HCA with approximation quality O(log2 n loglogn). Additionally, our algorithm can be implemented in the parallel setting with polylogarithmic span and near-linear work, achieving the same approximation quality. This improves upon the best previous such algorithm, which has an O(log9n) approximation quality. We also present a lower bound of Ω(logn) for the approximation guarantee of hierarchical congestion approximators.\r\nCrucial for achieving a near-linear running time is a new partitioning routine that, unlike previous such routines, manages to avoid recursing on large subgraphs. To achieve the improved approximation quality, we introduce the new concept of border routability of a cut and provide an improved sparsest cut oracle for general vertex weights.","lang":"eng"}],"month":"06","date_updated":"2026-07-06T06:59:52Z","keyword":["Congestion Approximators","Hierarchical Graph Decompositions"],"date_published":"2026-06-09T00:00:00Z","author":[{"full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630"},{"first_name":"Robin","full_name":"Münk, Robin","last_name":"Münk"},{"full_name":"Räcke, Harald","last_name":"Räcke","first_name":"Harald"}],"conference":{"start_date":"2026-06-22","location":"Salt Lake City, UT, United States","name":"STOC: Symposium on the Theory of Computing","end_date":"2026-06-26"},"title":"An improved quality hierarchical congestion approximator in near-linear time","file":[{"content_type":"application/pdf","file_name":"2026_STOC_HenzingerMo.pdf","file_id":"22250","access_level":"open_access","date_created":"2026-07-06T06:57:16Z","file_size":919005,"date_updated":"2026-07-06T06:57:16Z","checksum":"2bef46be8da6d19a641697bb0d8ade65","creator":"dernst","success":1,"relation":"main_file"}],"publication":"58th Annual ACM Symposium on Theory of Computing","quality_controlled":"1","publication_status":"published","page":"1417-1428","OA_type":"gold","day":"09","publisher":"Association for Computing Machinery","arxiv":1,"doi":"10.1145/3798129.3800851","scopus_import":"1","ddc":["000"],"acknowledgement":"We thank Evangelos Kosinas for helpful discussions on this topic.\r\nFunded by the European Union. Views and opinions expressed\r\nare however those of the author(s) only and do not necessarily\r\nreflect those of the European Union or the European Research\r\nCouncil Executive Agency. Neither the European Union nor the\r\ngranting authority can be held responsible for them.\r\nThis project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research\r\nand innovation programme (MoDynStruct, No. 101019564)\r\nand the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For\r\nopen access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising\r\nfrom this submission.\r\nThis project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858.","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"external_id":{"arxiv":["2511.03716"]},"das_tickbox":"0","oa":1,"file_date_updated":"2026-07-06T06:57:16Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-07-05T22:01:36Z","year":"2026","department":[{"_id":"MoHe"}],"project":[{"call_identifier":"H2020","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"}],"supplementarymaterial":"no","ec_funded":1},{"OA_type":"hybrid","day":"03","publisher":"Association for Computing Machinery","doi":"10.1145/3811339","scopus_import":"1","acknowledgement":"We thank Sadashige Ishida and Ryusuke Sugimoto for their insightful discussions and proofreading and other members of the ISTA\r\nVisual Computing Group for their general feedback. This project was\r\nfunded in part by the European Research Council (ERC Consolidator\r\nGrant 101045083 CoDiNA).","ddc":["000"],"corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"file_date_updated":"2026-07-06T06:13:12Z","PlanS_conform":"1","das_tickbox":"0","oa":1,"date_created":"2026-07-03T21:03:48Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"}],"year":"2026","intvolume":"        45","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"supplementarymaterial":"no","_id":"22241","status":"public","citation":{"ieee":"P. Xie, C. Hafner, and C. Wojtan, “Fast and exact winding numbers for triangle meshes,” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4. Association for Computing Machinery, 2026.","chicago":"Xie, Peiyuan, Christian Hafner, and Chris Wojtan. “Fast and Exact Winding Numbers for Triangle Meshes.” <i>ACM Transactions on Graphics</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3811339\">https://doi.org/10.1145/3811339</a>.","mla":"Xie, Peiyuan, et al. “Fast and Exact Winding Numbers for Triangle Meshes.” <i>ACM Transactions on Graphics</i>, vol. 45, no. 4, 41, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3811339\">10.1145/3811339</a>.","short":"P. Xie, C. Hafner, C. Wojtan, ACM Transactions on Graphics 45 (2026).","ista":"Xie P, Hafner C, Wojtan C. 2026. Fast and exact winding numbers for triangle meshes. ACM Transactions on Graphics. 45(4), 41.","apa":"Xie, P., Hafner, C., &#38; Wojtan, C. (2026). Fast and exact winding numbers for triangle meshes. <i>ACM Transactions on Graphics</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3811339\">https://doi.org/10.1145/3811339</a>","ama":"Xie P, Hafner C, Wojtan C. Fast and exact winding numbers for triangle meshes. <i>ACM Transactions on Graphics</i>. 2026;45(4). doi:<a href=\"https://doi.org/10.1145/3811339\">10.1145/3811339</a>"},"researchdata_availability":"no","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0730-0301"],"eissn":["1557-7368"]},"type":"journal_article","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"oa_version":"Published Version","has_accepted_license":"1","issue":"4","date_updated":"2026-07-06T06:14:18Z","volume":45,"abstract":[{"lang":"eng","text":"We revisit the computation of 3D generalized winding numbers, a useful measure for inside-outside classification on triangle meshes with gaps, self-intersections, and open boundaries. At the core of our new method is an analytical reduction of the surface integral that defines the winding number, resulting in a single ray-mesh intersection test and an elementary sum over boundary edges per evaluation. This construction is orders of magnitude more efficient than the state of the art in practice, which we show in an extensive performance benchmark. Conveniently, the method also reduces to the best-available asymptotic complexity in the worst case, and it introduces no approximations apart from floating-point errors. Our algorithm is conceptually simple to understand, straightforward to implement and debug, and it works reliably even on extremely noisy and corrupt input geometry."}],"month":"07","article_type":"original","author":[{"last_name":"Xie","full_name":"Xie, Peiyuan","id":"488e236c-6bad-11f0-9831-859175c78e8a","first_name":"Peiyuan"},{"last_name":"Hafner","full_name":"Hafner, Christian","id":"400429CC-F248-11E8-B48F-1D18A9856A87","first_name":"Christian"},{"id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","full_name":"Wojtan, Christopher J"}],"date_published":"2026-07-03T00:00:00Z","article_number":"41","title":"Fast and exact winding numbers for triangle meshes","publication":"ACM Transactions on Graphics","file":[{"file_size":5212838,"date_created":"2026-07-06T06:13:12Z","access_level":"open_access","content_type":"application/pdf","file_name":"2026_TransactionsGraphics_Xie.pdf","file_id":"22249","success":1,"relation":"main_file","creator":"dernst","checksum":"7e36e69f377b680a893e65b620b43813","date_updated":"2026-07-06T06:13:12Z"}],"quality_controlled":"1","publication_status":"published"}]