[{"PlanS_conform":"1","project":[{"grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"author":[{"first_name":"Giorgio","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Erdös","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5366-9603","full_name":"Erdös, László"},{"id":"7902bdb1-a2a4-11eb-a164-c9216f71aea3","orcid":"0000-0003-1559-1205","full_name":"Xu, Yuanyuan","last_name":"Xu","first_name":"Yuanyuan"}],"external_id":{"oaworkid":["w4413883397"],"arxiv":["2411.16572"],"isi":["001583178200001"]},"corr_author":"1","publication_status":"published","article_number":"111180","tmp":{"image":"/images/cc_by.png","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)"},"oa":1,"issue":"1","isi":1,"acknowledgement":"Partially supported by ERC Advanced Grant “RMTBeyond” No. 101020331. Partially supported by National Key R&D Program of China No. 2024YFA1013503.","language":[{"iso":"eng"}],"intvolume":"       290","file_date_updated":"2026-01-05T13:05:47Z","date_published":"2026-01-01T00:00:00Z","year":"2026","article_type":"original","date_created":"2025-09-10T05:46:07Z","volume":290,"abstract":[{"lang":"eng","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."}],"oaworkid":1,"month":"01","publication_identifier":{"issn":["0022-1236"]},"doi":"10.1016/j.jfa.2025.111180","quality_controlled":"1","ec_funded":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","ddc":["510"],"type":"journal_article","article_processing_charge":"Yes (via OA deal)","arxiv":1,"publication":"Journal of Functional Analysis","has_accepted_license":"1","citation":{"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.","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>.","short":"G. Cipolloni, L. Erdös, Y. Xu, Journal of Functional Analysis 290 (2026).","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>","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>.","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.","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>"},"file":[{"date_updated":"2026-01-05T13:05:47Z","file_name":"2026_JourFuncAnalysis_Cipolloni.pdf","file_id":"20947","checksum":"ee53d5e695f0df11e017c8c9242a2b04","success":1,"content_type":"application/pdf","file_size":2503887,"creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2026-01-05T13:05:47Z"}],"publisher":"Elsevier","department":[{"_id":"LaEr"}],"OA_place":"publisher","title":"Optimal decay of eigenvector overlap for non-Hermitian random matrices","_id":"20328","date_updated":"2026-06-03T13:12:14Z","OA_type":"hybrid","day":"01"},{"page":"254-267","oa_version":"Published Version","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","publication_identifier":{"issn":["0095-8956"],"eissn":["1096-0902"]},"doi":"10.1016/j.jctb.2025.09.002","ec_funded":1,"status":"public","type":"journal_article","article_processing_charge":"Yes (via OA deal)","arxiv":1,"ddc":["510"],"OA_place":"publisher","title":"The Hamilton space of pseudorandom graphs","_id":"20422","citation":{"short":"M. Christoph, R. Nenadov, K.H. Petrova, Journal of Combinatorial Theory Series B 176 (2026) 254–267.","ista":"Christoph M, Nenadov R, Petrova KH. 2026. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 176, 254–267.","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>.","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>","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>.","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>","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."},"has_accepted_license":"1","publication":"Journal of Combinatorial Theory Series B","department":[{"_id":"MaKw"}],"publisher":"Elsevier","file":[{"checksum":"60676af4af4b3243ba187e7d65440d99","file_id":"20953","success":1,"date_updated":"2026-01-05T13:29:34Z","file_name":"2026_JourCombTheoryB_Christoph.pdf","access_level":"open_access","date_created":"2026-01-05T13:29:34Z","relation":"main_file","file_size":688924,"content_type":"application/pdf","creator":"dernst"}],"day":"01","date_updated":"2026-01-05T13:29:52Z","OA_type":"hybrid","PlanS_conform":"1","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"corr_author":"1","external_id":{"isi":["001585783400001"],"arxiv":["2402.01447"]},"tmp":{"image":"/images/cc_by.png","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)"},"publication_status":"published","author":[{"full_name":"Christoph, Micha","last_name":"Christoph","first_name":"Micha"},{"full_name":"Nenadov, Rajko","last_name":"Nenadov","first_name":"Rajko"},{"last_name":"Petrova","first_name":"Kalina H","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","full_name":"Petrova, Kalina H"}],"article_type":"original","year":"2026","date_published":"2026-01-01T00:00:00Z","file_date_updated":"2026-01-05T13:29:34Z","date_created":"2025-10-05T22:01:34Z","isi":1,"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.","oa":1,"language":[{"iso":"eng"}],"intvolume":"       176","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"}],"month":"01","volume":176},{"publication_status":"published","tmp":{"image":"/images/cc_by.png","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)"},"external_id":{"arxiv":["2212.03121"],"isi":["001584166900001"]},"corr_author":"1","author":[{"orcid":"0000-0002-5372-7890","full_name":"Biswas, Ranita","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","first_name":"Ranita","last_name":"Biswas"},{"last_name":"Cultrera di Montesano","first_name":"Sebastiano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6249-0832","full_name":"Cultrera di Montesano, Sebastiano"},{"orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","first_name":"Ondrej","last_name":"Draganov"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Morteza","last_name":"Saghafian","full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"name":"Mathematics, Computer Science","grant_number":"Z00342","call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"PlanS_conform":"1","month":"01","abstract":[{"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.","lang":"eng"}],"volume":75,"date_created":"2025-10-12T22:01:26Z","file_date_updated":"2026-01-05T13:21:20Z","date_published":"2026-01-01T00:00:00Z","year":"2026","article_type":"original","intvolume":"        75","language":[{"iso":"eng"}],"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.","oa":1,"isi":1,"arxiv":1,"article_processing_charge":"Yes (via OA deal)","type":"journal_article","ddc":["510"],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"15090"}]},"page":"24-47","ec_funded":1,"status":"public","doi":"10.1007/s00454-025-00778-7","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"quality_controlled":"1","day":"01","OA_type":"hybrid","date_updated":"2026-01-05T13:21:56Z","title":"On the size of chromatic Delaunay mosaics","_id":"20456","OA_place":"publisher","file":[{"relation":"main_file","date_created":"2026-01-05T13:21:20Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","file_size":570922,"success":1,"file_id":"20952","checksum":"0addb5c1b78142f9fb453bfa04695400","file_name":"2026_DiscreteCompGeom_Biswas.pdf","date_updated":"2026-01-05T13:21:20Z"}],"publisher":"Springer Nature","department":[{"_id":"HeEd"}],"publication":"Discrete and Computational Geometry","has_accepted_license":"1","citation":{"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>.","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>","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.","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>","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.","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>.","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)","arxiv":1,"type":"journal_article","ddc":["500"],"scopus_import":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","ec_funded":1,"publication_identifier":{"issn":["0195-6698"]},"doi":"10.1016/j.ejc.2025.104235","quality_controlled":"1","day":"01","OA_type":"hybrid","date_updated":"2026-01-05T13:34:48Z","title":"Odd-Ramsey numbers of complete bipartite graphs","_id":"20482","OA_place":"publisher","file":[{"creator":"dernst","file_size":563029,"content_type":"application/pdf","date_created":"2026-01-05T13:34:40Z","relation":"main_file","access_level":"open_access","file_name":"2026_EuropJourCombinatorics_Boyadzhiyska.pdf","date_updated":"2026-01-05T13:34:40Z","success":1,"checksum":"52883daa217398396cbf9b8ad9ddae92","file_id":"20954"}],"department":[{"_id":"MaKw"}],"publisher":"Elsevier","publication":"European Journal of Combinatorics","has_accepted_license":"1","citation":{"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.","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>","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>.","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>","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>.","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)."},"publication_status":"published","tmp":{"image":"/images/cc_by.png","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)"},"article_number":"104235","external_id":{"arxiv":["2410.05887"],"isi":["001573380700001"]},"corr_author":"1","author":[{"full_name":"Boyadzhiyska, Simona","first_name":"Simona","last_name":"Boyadzhiyska"},{"last_name":"Das","first_name":"Shagnik","full_name":"Das, Shagnik"},{"last_name":"Lesgourgues","first_name":"Thomas","full_name":"Lesgourgues, Thomas"},{"id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","full_name":"Petrova, Kalina H","last_name":"Petrova","first_name":"Kalina H"}],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"PlanS_conform":"1","month":"01","abstract":[{"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.","lang":"eng"}],"volume":131,"date_created":"2025-10-16T13:14:34Z","date_published":"2026-01-01T00:00:00Z","file_date_updated":"2026-01-05T13:34:40Z","year":"2026","article_type":"original","intvolume":"       131","isi":1,"oa":1,"language":[{"iso":"eng"}],"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."},{"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.","researchdata_availability":"yes","article_number":"224401","publication_status":"published","das_tickbox":"1","author":[{"full_name":"Liebman-Peláez, A.","last_name":"Liebman-Peláez","first_name":"A."},{"full_name":"Garratt, S. J.","first_name":"S. J.","last_name":"Garratt"},{"full_name":"Sunko, Veronika","orcid":"0000-0003-2724-3523","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","first_name":"Veronika","last_name":"Sunko"},{"full_name":"Sun, Y.","last_name":"Sun","first_name":"Y."},{"first_name":"J. R.","last_name":"Soh","full_name":"Soh, J. R."},{"full_name":"Prabhakaran, D.","last_name":"Prabhakaran","first_name":"D."},{"full_name":"Boothroyd, A. T.","first_name":"A. T.","last_name":"Boothroyd"},{"full_name":"Orenstein, J.","first_name":"J.","last_name":"Orenstein"}],"date_created":"2026-06-22T08:52:01Z","year":"2026","article_type":"original","date_published":"2026-06-01T00:00:00Z","intvolume":"       113","issue":"22","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.","month":"06","abstract":[{"lang":"eng","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."}],"volume":113,"oa_version":"None","supplementarymaterial":"no","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","doi":"10.1103/b48p-kw5l","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"article_processing_charge":"No","extern":"1","type":"journal_article","_id":"22116","title":"Observation of a Goldstone mode in the broken helix by time-resolved optical polarimetry","publisher":"American Physical Society","citation":{"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>.","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.","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).","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>.","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>"},"publication":"Physical Review B","day":"01","OA_type":"closed access","date_updated":"2026-06-24T09:49:27Z"},{"ddc":["530"],"article_processing_charge":"Yes","arxiv":1,"type":"journal_article","status":"public","doi":"10.1038/s41535-026-00901-8","publication_identifier":{"eissn":["2397-4648"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_type":"gold","date_updated":"2026-06-24T10:31:05Z","day":"30","publisher":"Springer Nature","department":[{"_id":"VeSu"}],"main_file_link":[{"url":"https://doi.org/10.1038/s41535-026-00901-8","open_access":"1"}],"citation":{"short":"V. Sunko, J. Orenstein, Npj Quantum Materials (2026).","ista":"Sunko V, Orenstein J. 2026. Linear magneto-birefringence as a probe of altermagnetism. npj Quantum Materials.","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>.","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>","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>.","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>","ieee":"V. Sunko and J. Orenstein, “Linear magneto-birefringence as a probe of altermagnetism,” <i>npj Quantum Materials</i>. Springer Nature, 2026."},"has_accepted_license":"1","publication":"npj Quantum Materials","title":"Linear magneto-birefringence as a probe of altermagnetism","_id":"21437","OA_place":"publisher","author":[{"full_name":"Sunko, Veronika","orcid":"0000-0003-2724-3523","id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","first_name":"Veronika","last_name":"Sunko"},{"first_name":"J.","last_name":"Orenstein","full_name":"Orenstein, J."}],"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"publication_status":"epub_ahead","corr_author":"1","external_id":{"arxiv":["2511.16421"]},"month":"05","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"}],"language":[{"iso":"eng"}],"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.","oa":1,"date_created":"2026-03-11T10:40:08Z","article_type":"original","year":"2026","date_published":"2026-05-30T00:00:00Z"},{"ddc":["000"],"type":"journal_article","article_processing_charge":"Yes","publication_identifier":{"eissn":["2041-1723"]},"doi":"10.1038/s41467-026-71777-2","quality_controlled":"1","ec_funded":1,"status":"public","scopus_import":"1","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","supplementarymaterial":"yes","date_updated":"2026-06-24T07:53:53Z","OA_type":"gold","day":"01","has_accepted_license":"1","publication":"Nature Communications","citation":{"ama":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>","ieee":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","apa":"Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>","mla":"Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>, vol. 17, 5325, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>.","short":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026).","chicago":"Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>.","ista":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325."},"file":[{"file_name":"2026_NatureComm_Svoboda.pdf","date_updated":"2026-06-24T06:50:24Z","success":1,"checksum":"b660048bb271f24d6763803e247d5c32","file_id":"22136","creator":"dernst","file_size":1068919,"content_type":"application/pdf","date_created":"2026-06-24T06:50:24Z","relation":"main_file","access_level":"open_access"}],"department":[{"_id":"KrCh"}],"publisher":"Springer Nature","OA_place":"publisher","title":"The effect of the fitness gradient on fixation probability","_id":"22101","author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"},{"full_name":"Nemati, Hossein","first_name":"Hossein","last_name":"Nemati"},{"last_name":"Tkadlec","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","full_name":"Tkadlec, Josef"},{"full_name":"Kaveh, Kamran","first_name":"Kamran","last_name":"Kaveh"},{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"}],"das_tickbox":"0","external_id":{"pmid":["41997932"]},"corr_author":"1","publication_status":"published","pmid":1,"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"article_number":"5325","researchdata_availability":"no","DOAJ_listed":"1","dataavailabilitystatement":"Correspondence and requests for materials should be addressed to Krishnendu Chatterjee.","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020"}],"volume":17,"abstract":[{"text":"Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects.","lang":"eng"}],"month":"12","oa":1,"acknowledgement":"J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","language":[{"iso":"eng"}],"intvolume":"        17","file_date_updated":"2026-06-24T06:50:24Z","date_published":"2026-12-01T00:00:00Z","article_type":"original","year":"2026","date_created":"2026-06-21T22:02:59Z"},{"researchdata_availability":"no","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"corr_author":"1","publication_status":"published","author":[{"orcid":"0000-0002-0783-904X","full_name":"Cano Cordoba, Filip","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","first_name":"Filip","last_name":"Cano Cordoba"}],"das_tickbox":"0","date_published":"2026-04-01T00:00:00Z","year":"2026","date_created":"2026-06-21T22:03:00Z","oa":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","language":[{"iso":"eng"}],"intvolume":"         5","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."}],"month":"04","volume":5,"oa_version":"Accepted Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","supplementarymaterial":"no","page":"4689-4696","conference":{"name":"ICAART: International Conference on Agents and Artificial Intelligence","start_date":"2026-03-05","location":"Marbella, Spain","end_date":"2026-03-08"},"publication_identifier":{"eissn":["2184-433X"],"issn":["2184-3589"],"isbn":["9789897587962"]},"doi":"10.5220/0014483200004052","quality_controlled":"1","status":"public","ec_funded":1,"type":"conference","article_processing_charge":"No","OA_place":"repository","_id":"22103","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","citation":{"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.","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>.","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>","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>.","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>","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."},"keyword":["Explainable AI","Large Language Models","Trust in AI"],"main_file_link":[{"open_access":"1","url":"https://filipcano.org/files/icaart26llm.pdf"}],"department":[{"_id":"ToHe"}],"publisher":"Science and Technology Publications","day":"01","date_updated":"2026-06-24T08:37:00Z","OA_type":"green"},{"abstract":[{"lang":"eng","text":"Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein–protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labelling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a crystal structure of a GB1 variant reported in this work, reproduce these elevated barriers and reveal how the crystal restrains motions."}],"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"month":"06","acknowledgement":"We thank N. R. Skrynnikov and O. O. Lebedenko (St. Petersburg) for insightful discussions and for performing exploratory MD simulations. We are grateful to T. Schubeis (Lyon) for advice on GB1 crystallization and R. Schmid for initial crystallization trials. We thank C. Mueller-Dieckmann for assistance with room-temperature X-ray crystallography data collection on beamline ID30B at the ESRF, which is acknowledged for providing beamtime through its In-House Research programme. We thank S. Falkner for assistance with constructing the structural model of the IgG:GB1 complex. We thank J. Lewandowski for providing feedback on the paper and granting access to backbone relaxation data of IgG:GB1T2Q and GB1T2Q microcrystals. This research was supported by the Scientific Service Units (SSU) of the Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities. We thank P. Rovó and M. V. Falcón for excellent support of the NMR facility. L.M.B. is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant number PR10660EAW01). C.C. acknowledges the European Research Council (grant project 101097272 ‘MilliInMicro’) and the Métropole du Grand Nancy (grant project ‘ARC’). BM07-FIP2 is supported by the French ANR PIA3 (France 2030) EquipEx+ project MAGNIFIX under grant agreement ANR-21-ESRE-0011.Open access funding provided by Institute of Science and Technology (IST Austria).","oa":1,"language":[{"iso":"eng"}],"year":"2026","article_type":"original","date_published":"2026-06-10T00:00:00Z","date_created":"2026-06-21T22:03:01Z","author":[{"first_name":"Lea Marie","last_name":"Becker","full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151","id":"36336939-eb97-11eb-a6c2-c83f1214ca79"},{"full_name":"Fu, Haohao","first_name":"Haohao","last_name":"Fu"},{"first_name":"Benjamin","last_name":"Tatman","full_name":"Tatman, Benjamin","id":"71cda2f3-e604-11ee-a1df-da10587eda3f"},{"full_name":"Dreydoppel, Matthias","last_name":"Dreydoppel","first_name":"Matthias"},{"id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","full_name":"Kapitonova, Anna","last_name":"Kapitonova","first_name":"Anna"},{"id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X","full_name":"Balazs, Daniel","last_name":"Balazs","first_name":"Daniel"},{"last_name":"Weininger","first_name":"Ulrich","full_name":"Weininger, Ulrich"},{"last_name":"Engilberge","first_name":"Sylvain","full_name":"Engilberge, Sylvain"},{"last_name":"Chipot","first_name":"Christophe","full_name":"Chipot, Christophe"},{"first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"das_tickbox":"1","corr_author":"1","external_id":{"pmid":["42271006"]},"pmid":1,"tmp":{"image":"/images/cc_by.png","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)"},"publication_status":"epub_ahead","PlanS_conform":"1","researchdata_availability":"yes","project":[{"_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","grant_number":"26777"}],"dataavailabilitystatement":"The cryo and room-temperature crystal structures of GB1QDD are deposited at the PDB under the access codes 9I2I and 9T8Z, respectively. The solid-state NMR backbone assignment of GB1QDD is deposited at the BMRB under the access code 53330. NMR spectra, analysis scripts and raw data are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-20641)120. Files to reproduce the enhanced-sampling MD simulations are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-21145)121.","date_updated":"2026-06-24T08:47:58Z","OA_type":"hybrid","day":"10","citation":{"short":"L.M. Becker, H. Fu, B. Tatman, M. Dreydoppel, A. Kapitonova, D. Balazs, U. Weininger, S. Engilberge, C. Chipot, P. Schanda, Nature Chemistry (2026).","ista":"Becker LM, Fu H, Tatman B, Dreydoppel M, Kapitonova A, Balazs D, Weininger U, Engilberge S, Chipot C, Schanda P. 2026. Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. Nature Chemistry.","chicago":"Becker, Lea Marie, Haohao Fu, Benjamin Tatman, Matthias Dreydoppel, Anna Kapitonova, Daniel Balazs, Ulrich Weininger, Sylvain Engilberge, Christophe Chipot, and Paul Schanda. “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” <i>Nature Chemistry</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41557-026-02155-0\">https://doi.org/10.1038/s41557-026-02155-0</a>.","ama":"Becker LM, Fu H, Tatman B, et al. Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. <i>Nature Chemistry</i>. 2026. doi:<a href=\"https://doi.org/10.1038/s41557-026-02155-0\">10.1038/s41557-026-02155-0</a>","apa":"Becker, L. M., Fu, H., Tatman, B., Dreydoppel, M., Kapitonova, A., Balazs, D., … Schanda, P. (2026). Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. <i>Nature Chemistry</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41557-026-02155-0\">https://doi.org/10.1038/s41557-026-02155-0</a>","mla":"Becker, Lea Marie, et al. “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” <i>Nature Chemistry</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41557-026-02155-0\">10.1038/s41557-026-02155-0</a>.","ieee":"L. M. Becker <i>et al.</i>, “Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes,” <i>Nature Chemistry</i>. Springer Nature, 2026."},"has_accepted_license":"1","publication":"Nature Chemistry","publisher":"Springer Nature","department":[{"_id":"PaSc"},{"_id":"LifeSc"}],"main_file_link":[{"url":"https://doi.org/10.1038/s41557-026-02155-0","open_access":"1"}],"OA_place":"publisher","title":"Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes","_id":"22105","ddc":["540"],"type":"journal_article","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","doi":"10.1038/s41557-026-02155-0","publication_identifier":{"eissn":["17554349"],"issn":["17554330"]},"status":"public","related_material":{"record":[{"relation":"research_data","id":"20641","status":"public"},{"status":"public","id":"21145","relation":"research_data"}]},"supplementarymaterial":"yes","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version"},{"ddc":["572"],"type":"research_data","article_processing_charge":"No","doi":"10.15479/AT-ISTA-21145","status":"public","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","contributor":[{"last_name":"Fu","contributor_type":"researcher","first_name":"Haohao"},{"last_name":"Tatman","first_name":"Benjamin","contributor_type":"researcher","id":"71cda2f3-e604-11ee-a1df-da10587eda3f"},{"first_name":"Matthias","contributor_type":"researcher","last_name":"Dreydoppel"},{"id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","last_name":"Kapitonova","contributor_type":"researcher","first_name":"Anna"},{"last_name":"Balazs","contributor_type":"researcher","first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X"},{"first_name":"Ulrich","contributor_type":"researcher","last_name":"Weininger"},{"first_name":"Sylvain","contributor_type":"researcher","last_name":"Engilberge"}],"related_material":{"record":[{"status":"public","id":"20641","relation":"earlier_version"},{"id":"22105","relation":"used_in_publication","status":"public"}]},"date_updated":"2026-06-24T08:47:57Z","day":"09","has_accepted_license":"1","citation":{"ama":"Becker LM, Schanda P, Chipot C. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>","mla":"Becker, Lea Marie, et al. <i>Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.”</i> Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>.","apa":"Becker, L. M., Schanda, P., &#38; Chipot, C. (2026). Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">https://doi.org/10.15479/AT-ISTA-21145</a>","ieee":"L. M. Becker, P. Schanda, and C. Chipot, “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026.","short":"L.M. Becker, P. Schanda, C. Chipot, (2026).","ista":"Becker LM, Schanda P, Chipot C. 2026. Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">10.15479/AT-ISTA-21145</a>.","chicago":"Becker, Lea Marie, Paul Schanda, and Christophe Chipot. “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21145\">https://doi.org/10.15479/AT-ISTA-21145</a>."},"file":[{"checksum":"02a419cce8cea450bc952f35488d2df5","file_id":"21146","date_updated":"2026-02-05T13:52:37Z","file_name":"README.txt","access_level":"open_access","date_created":"2026-02-05T13:52:37Z","relation":"table_of_contents","content_type":"text/plain","file_size":4263,"creator":"lbecker"},{"relation":"main_file","date_created":"2026-02-05T13:52:41Z","access_level":"open_access","creator":"lbecker","file_size":50647107,"content_type":"application/zip","success":1,"file_id":"21147","checksum":"b0b82b1aa73985b0b308a3fa52d21aea","file_name":"Research_Data.zip","date_updated":"2026-02-05T13:52:41Z"}],"publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"_id":"21145","title":"Additional Data for \"Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes\"","author":[{"orcid":"0000-0002-6401-5151","full_name":"Becker, Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","first_name":"Lea Marie","last_name":"Becker"},{"first_name":"Paul","last_name":"Schanda","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"},{"full_name":"Chipot, Christophe","last_name":"Chipot","first_name":"Christophe"}],"corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"project":[{"grant_number":"26777","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"abstract":[{"text":"Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein-protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labeling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a new crystal structure, reproduce these elevated barriers and reveal how the crystal restrains motions. ","lang":"eng"}],"month":"02","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"acknowledgement":"We thank Nikolai R. Skrynnikov and Olga O. Lebedenko (St. Petersburg) for insightful discussions and for performing exploratory MD simulations. We are grateful to Tobias Schubeis (Lyon) for advice with GB1 crystallization, and Rebecca Schmid for initial crystallization trials.\r\nWe thank Sebastian Falkner for assistance with constructing the structural model of the IgG:GB1 complex.\r\nThis research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities. We thank Petra Rovó and Margarita Valhondo Falcón for excellent support of the NMR facility.\r\nLea M. Becker is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01). Christophe Chipot acknowledges the European Research Council (grant project 101097272 ``MilliInMicro'') and the Métropole du Grand Nancy (grant project ``ARC''). BM07-FIP2 is supported by the French ANR PIA3 (France 2030) EquipEx+ project MAGNIFIX under grant agreement ANR-21-ESRE-0011.","license":"https://creativecommons.org/licenses/by-nc/4.0/","oa":1,"file_date_updated":"2026-02-05T13:52:41Z","date_published":"2026-02-09T00:00:00Z","year":"2026","date_created":"2026-02-05T13:54:39Z"},{"date_created":"2026-06-28T22:01:34Z","file_date_updated":"2026-06-29T06:55:23Z","date_published":"2026-06-01T00:00:00Z","year":"2026","intvolume":"       368","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","language":[{"iso":"eng"}],"oa":1,"month":"06","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,"project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564"}],"researchdata_availability":"no","publication_status":"published","tmp":{"image":"/images/cc_by.png","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)"},"article_number":"2:1-2:21","external_id":{"arxiv":["2511.17994"]},"corr_author":"1","das_tickbox":"0","author":[{"last_name":"Kalinin","first_name":"Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","full_name":"Kalinin, Nikita"},{"id":"4a893819-d954-11f0-89b1-e360bad9ccc5","full_name":"Andersson, Joel D","last_name":"Andersson","first_name":"Joel D"}],"_id":"22146","title":"Learning rate scheduling with matrix factorization for private training","OA_place":"publisher","file":[{"file_id":"22149","checksum":"c661f016d3861a1c1b590b87a744d087","success":1,"date_updated":"2026-06-29T06:55:23Z","file_name":"2026_LIPIcsFORC_Kalinin.pdf","access_level":"open_access","relation":"main_file","date_created":"2026-06-29T06:55:23Z","file_size":1231914,"content_type":"application/pdf","creator":"dernst"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ChLa"},{"_id":"GradSch"},{"_id":"MoHe"}],"has_accepted_license":"1","publication":"7th Symposium on Foundations of Responsible Computing","citation":{"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>.","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.","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.","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>","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>.","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>"},"keyword":["differential privacy","machine learning","matrix factorization"],"day":"01","alternative_title":["LIPIcs"],"OA_type":"gold","date_updated":"2026-06-29T06:56:34Z","conference":{"end_date":"2026-06-05","location":"Cambridge, MA; United States","name":"FORC: Symposium on Foundations of Responsible Computing","start_date":"2026-06-03"},"supplementarymaterial":"no","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":"1","ec_funded":1,"status":"public","publication_identifier":{"isbn":["9783959774192"],"eissn":["1868-8969"]},"doi":"10.4230/LIPIcs.FORC.2026.2","quality_controlled":"1","arxiv":1,"article_processing_charge":"No","type":"conference","ddc":["000"]},{"ddc":["530"],"type":"journal_article","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","publication_identifier":{"issn":["1936-0851"],"eissn":["1936-086X"]},"doi":"10.1021/acsnano.6c02466","status":"public","page":"17360-17372","scopus_import":"1","oa_version":"Published Version","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-06-29T09:00:33Z","OA_type":"hybrid","day":"23","keyword":["fulleride","intercalation","alkali metal","superconductivity","Raman"],"citation":{"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>.","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.","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.","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.","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>.","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>"},"publication":"ACS Nano","has_accepted_license":"1","department":[{"_id":"MiLe"}],"publisher":"American Chemical Society","file":[{"creator":"dernst","file_size":6290296,"content_type":"application/pdf","relation":"main_file","date_created":"2026-06-29T08:58:12Z","access_level":"open_access","file_name":"2026_ACSNano_Shchukin.pdf","date_updated":"2026-06-29T08:58:12Z","success":1,"file_id":"22150","checksum":"01ec8ee6fab7bf563df7af13f6b43045"}],"OA_place":"publisher","title":"On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation","_id":"22145","author":[{"first_name":"Konstantin P.","last_name":"Shchukin","full_name":"Shchukin, Konstantin P."},{"full_name":"Gallego Lacey, Oliver N.","last_name":"Gallego Lacey","first_name":"Oliver N."},{"last_name":"Coquinot","first_name":"Baptiste","id":"f8417bd4-f599-11ee-a482-b927e3ed1e8e","orcid":"0000-0001-5524-596X","full_name":"Coquinot, Baptiste"},{"full_name":"Jakowski, Jacek","first_name":"Jacek","last_name":"Jakowski"},{"first_name":"Jingsong","last_name":"Huang","full_name":"Huang, Jingsong"},{"full_name":"Staudenmayer, Patrik","first_name":"Patrik","last_name":"Staudenmayer"},{"first_name":"Yannic","last_name":"Falke","full_name":"Falke, Yannic"},{"first_name":"Ram Prakash","last_name":"Pandeya","full_name":"Pandeya, Ram Prakash"},{"full_name":"Grüneis, Alexander","last_name":"Grüneis","first_name":"Alexander"}],"das_tickbox":"0","external_id":{"pmid":["42260723"]},"tmp":{"image":"/images/cc_by.png","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)"},"pmid":1,"publication_status":"published","researchdata_availability":"no","PlanS_conform":"1","volume":20,"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"}],"month":"06","oa":1,"issue":"24","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.","language":[{"iso":"eng"}],"intvolume":"        20","year":"2026","article_type":"original","file_date_updated":"2026-06-29T08:58:12Z","date_published":"2026-06-23T00:00:00Z","date_created":"2026-06-28T22:01:34Z"},{"author":[{"full_name":"Mendhe, Rahul Mahadeo","last_name":"Mendhe","first_name":"Rahul Mahadeo"},{"last_name":"Christudas Dargily","first_name":"Neethu","id":"19edef5c-384c-11ef-8188-c73c9c31d601","full_name":"Christudas Dargily, Neethu"},{"first_name":"Alagar Raja","last_name":"Kottaichamy","full_name":"Kottaichamy, Alagar Raja"},{"full_name":"Dutt, Shifali","last_name":"Dutt","first_name":"Shifali"},{"first_name":"Mukaddar","last_name":"Sk","full_name":"Sk, Mukaddar"},{"first_name":"Harish","last_name":"Makri Nimbegondi Kotresh","full_name":"Makri Nimbegondi Kotresh, Harish"},{"first_name":"Musthafa","last_name":"Ottakam Thotiyl","full_name":"Ottakam Thotiyl, Musthafa"}],"publication_status":"epub_ahead","article_processing_charge":"No","pmid":1,"article_number":"jacs.6c02632","type":"journal_article","external_id":{"pmid":["42319128"]},"extern":"1","status":"public","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"doi":"10.1021/jacs.6c02632","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","OA_type":"closed access","date_updated":"2026-06-29T06:39:21Z","day":"19","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"}],"publisher":"American Chemical Society","publication":"Journal of the American Chemical Society","language":[{"iso":"eng"}],"citation":{"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>.","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.","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).","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>.","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>","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>"},"date_created":"2026-06-24T18:29:56Z","_id":"22141","title":"Mechanical gating of redox access in molecular electrocatalysis","date_published":"2026-06-19T00:00:00Z","year":"2026","article_type":"original"},{"date_created":"2026-06-28T22:01:34Z","article_type":"comment","year":"2026","date_published":"2026-06-25T00:00:00Z","intvolume":"       189","issue":"13","language":[{"iso":"eng"}],"month":"06","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"}],"volume":189,"researchdata_availability":"no","publication_status":"published","corr_author":"1","das_tickbox":"0","author":[{"first_name":"Michael","last_name":"Riedl","orcid":"0000-0003-4844-6311","full_name":"Riedl, Michael","id":"3BE60946-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","last_name":"Sixt"}],"title":"A new sense for electrical fields","_id":"22144","department":[{"_id":"MiSi"}],"publisher":"Elsevier","citation":{"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>","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>.","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>","short":"M. Riedl, M.K. Sixt, Cell 189 (2026) 3845–3846.","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>.","ista":"Riedl M, Sixt MK. 2026. A new sense for electrical fields. Cell. 189(13), 3845–3846."},"publication":"Cell","day":"25","OA_type":"closed access","date_updated":"2026-06-29T09:04:49Z","page":"3845-3846","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"None","supplementarymaterial":"no","status":"public","quality_controlled":"1","publication_identifier":{"eissn":["1097-4172"],"issn":["0092-8674"]},"doi":"10.1016/j.cell.2026.05.038","article_processing_charge":"No","type":"journal_article"},{"department":[{"_id":"MaKw"}],"publisher":"Oxford University Press","file":[{"access_level":"open_access","relation":"main_file","date_created":"2026-06-29T09:15:15Z","content_type":"application/pdf","file_size":524993,"creator":"dernst","file_id":"22151","checksum":"396b47d0532d7ea509f8cd30f11392a8","success":1,"date_updated":"2026-06-29T09:15:15Z","file_name":"2026_IMRN_Hunter.pdf"}],"citation":{"ista":"Hunter Z, Kwan MA, Sauermann L, Sawhney M. 2026. On random matrices with large corank. International Mathematics Research Notices. 2026(12), rnag126.","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>.","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>","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>.","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.","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>"},"has_accepted_license":"1","publication":"International Mathematics Research Notices","title":"On random matrices with large corank","_id":"22147","OA_place":"publisher","OA_type":"hybrid","date_updated":"2026-06-29T09:19:14Z","day":"01","status":"public","quality_controlled":"1","publication_identifier":{"issn":["1073-7928"],"eissn":["1687-0247"]},"doi":"10.1093/imrn/rnag126","oa_version":"Published Version","supplementarymaterial":"no","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["500"],"article_processing_charge":"Yes (via OA deal)","arxiv":1,"type":"journal_article","intvolume":"      2026","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.","language":[{"iso":"eng"}],"oa":1,"issue":"12","date_created":"2026-06-28T22:01:35Z","year":"2026","article_type":"original","date_published":"2026-06-01T00:00:00Z","file_date_updated":"2026-06-29T09:15:15Z","volume":2026,"month":"06","abstract":[{"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).","lang":"eng"}],"project":[{"_id":"bd95085b-d553-11ed-ba76-e55d3349be45","name":"Randomness and structure in combinatorics","grant_number":"101076777"}],"researchdata_availability":"no","PlanS_conform":"1","das_tickbox":"0","author":[{"full_name":"Hunter, Zach","last_name":"Hunter","first_name":"Zach"},{"full_name":"Kwan, Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","first_name":"Matthew Alan","last_name":"Kwan"},{"full_name":"Sauermann, Lisa","first_name":"Lisa","last_name":"Sauermann"},{"first_name":"Mehtaab","last_name":"Sawhney","full_name":"Sawhney, Mehtaab"}],"tmp":{"image":"/images/cc_by.png","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)"},"article_number":"rnag126","publication_status":"published","corr_author":"1","external_id":{"arxiv":["2510.12933"]}},{"day":"22","OA_type":"hybrid","date_updated":"2026-06-29T12:55:19Z","title":"Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo","_id":"22148","OA_place":"publisher","publisher":"Elsevier","department":[{"_id":"LeSa"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2026.05.026"}],"citation":{"ama":"Zhao Z, Sazanov LA. Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo. <i>Molecular Cell</i>. doi:<a href=\"https://doi.org/10.1016/j.molcel.2026.05.026\">10.1016/j.molcel.2026.05.026</a>","ieee":"Z. Zhao and L. A. Sazanov, “Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo,” <i>Molecular Cell</i>. Elsevier.","mla":"Zhao, Ziyu, and Leonid A. Sazanov. “Structure of E. Coli Twin-Arginine Translocase (Tat) Complex with Bound Cargo.” <i>Molecular Cell</i>, Elsevier, doi:<a href=\"https://doi.org/10.1016/j.molcel.2026.05.026\">10.1016/j.molcel.2026.05.026</a>.","apa":"Zhao, Z., &#38; Sazanov, L. A. (n.d.). Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo. <i>Molecular Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.molcel.2026.05.026\">https://doi.org/10.1016/j.molcel.2026.05.026</a>","short":"Z. Zhao, L.A. Sazanov, Molecular Cell (n.d.).","chicago":"Zhao, Ziyu, and Leonid A Sazanov. “Structure of E. Coli Twin-Arginine Translocase (Tat) Complex with Bound Cargo.” <i>Molecular Cell</i>. Elsevier, n.d. <a href=\"https://doi.org/10.1016/j.molcel.2026.05.026\">https://doi.org/10.1016/j.molcel.2026.05.026</a>.","ista":"Zhao Z, Sazanov LA. Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo. Molecular Cell."},"has_accepted_license":"1","publication":"Molecular Cell","article_processing_charge":"Yes (via OA deal)","type":"journal_article","ddc":["570"],"related_material":{"record":[{"status":"for_moderation","id":"22189","relation":"research_data"}]},"oa_version":"Published Version","supplementarymaterial":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","status":"public","quality_controlled":"1","doi":"10.1016/j.molcel.2026.05.026","publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"ScienComp"}],"month":"06","abstract":[{"text":"How the twin-arginine translocase (Tat) system transports fully folded substrate proteins across cellular membranes without disrupting membrane integrity has been a fundamental question in cell biology for decades. The Tat system, found in prokaryotes and plant organelles, recognizes a cargo signal peptide via a conserved twin-arginine motif. The multi-subunit Tat complex facilitates the proton-motive-force-dependent translocation process, yet its overall architecture has remained unknown. Here, we present the cryo-electron microscopy (cryo-EM) structure of the Escherichia coli (E. coli) trimeric TatB₃C₃ complex with bound substrate SufI, assembled in vivo. The complex adopts an unusual, wide-open, bowl-shaped architecture with a polar inner cavity. Unexpectedly, the cargo is engaged in a dual-contact mode: while the signal peptide binds inside one TatBC unit, the folded domain docks tightly onto an adjacent unit, possibly performing a proofreading function. This structure provides a mechanistic framework for substrate engagement and suggests the direct involvement of the entire Tat complex in substrate translocation.","lang":"eng"}],"date_created":"2026-06-28T22:01:35Z","article_type":"original","year":"2026","date_published":"2026-06-22T00:00:00Z","acknowledgement":"We thank IST Austria for providing the funding. We thank IST Austria EM facility for the use of Titan Krios TEM. Data processing was performed using IST high-performance computer cluster. We thank Dr. R. Roemhild and Professor C. Guet (ISTA) for help in constructing Tat deletion strains and Dr. A. Charnagalov (ISTA) for technical help.","language":[{"iso":"eng"}],"oa":1,"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"publication_status":"inpress","corr_author":"1","external_id":{"biorxivid":["10.1101/2025.09.16.676506"]},"das_tickbox":"1","author":[{"id":"a63fe682-9f3a-11ee-bf8c-cfdf919b9850","full_name":"Zhao, Ziyu","last_name":"Zhao","first_name":"Ziyu"},{"orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","id":"338D39FE-F248-11E8-B48F-1D18A9856A87","first_name":"Leonid A","last_name":"Sazanov"}],"dataavailabilitystatement":"This study did not generate new unique reagents. Strains and plasmids generated in this study are available from the lead contact without restrictions.\r\n• Source data are provided within this paper. The cryo-EM map is deposited in the Electron Microscopy Data Bank under accession number EMD-53848. The model is deposited in the Protein Data Bank under accession number 9R91. The structural data are publicly available as of the date of publication. Raw images of spot assays, SDS-PAGE and BN-PAGE gels with Coomassie staining and immunoblot images are available at Mendeley Data (https://doi.org/10.17632/v2g3p9n985.1).\r\n• This paper does not report original code.\r\n• Any additional information required to reanalyze the data reported in this paper is available from the lead contact upon request.","biorxivid":1,"researchdata_availability":"yes"},{"das_tickbox":"0","author":[{"first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wang","first_name":"Pengxiang","full_name":"Wang, Pengxiang"}],"publication_status":"published","tmp":{"image":"/images/cc_by.png","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)"},"article_number":"4:1-4:10","external_id":{"cryptoeprintid":["2025/723"]},"corr_author":"1","volume":343,"month":"09","abstract":[{"lang":"eng","text":"Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected 2^k different inputs one will find an output that starts with k zeros.\r\nUsing such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi et al., 2022] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for \"trivial\" reasons.\r\nConcretely, it’s known that any algorithm that inverts a random function or permutation with range N making T queries and using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges, which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query.\r\nWe show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog N lower bound applies."}],"cryptoeprintid":1,"intvolume":"       343","oa":1,"language":[{"iso":"eng"}],"date_created":"2026-06-14T22:01:45Z","date_published":"2025-09-08T00:00:00Z","file_date_updated":"2026-06-22T08:54:32Z","year":"2025","ddc":["000"],"article_processing_charge":"Yes","type":"conference","status":"public","doi":"10.4230/LIPIcs.ITC.2025.4","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]},"quality_controlled":"1","conference":{"location":"Santa Barbara, CA, United States","name":"ITC: Information Theoretic Cryptography","start_date":"2025-08-16","end_date":"2025-08-17"},"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","OA_type":"gold","date_updated":"2026-06-22T08:57:41Z","day":"08","alternative_title":["LIPIcs"],"file":[{"file_size":772046,"content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2026-06-22T08:54:32Z","relation":"main_file","date_updated":"2026-06-22T08:54:32Z","file_name":"2025_LIPIcs_Pietrzak.pdf","file_id":"22118","checksum":"3f791b03df26853342855a9d9581cb58","success":1}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"publication":"6th Conference on Information-Theoretic Cryptography","has_accepted_license":"1","keyword":["Time-Space Lower Bounds","Blockchains"],"citation":{"short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing. 6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic Cryptography, LIPIcs, vol. 343, 4:1-4:10.","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In <i>6th Conference on Information-Theoretic Cryptography</i>, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>.","ama":"Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: <i>6th Conference on Information-Theoretic Cryptography</i>. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>","apa":"Pietrzak, K. Z., &#38; Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In <i>6th Conference on Information-Theoretic Cryptography</i> (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>","mla":"Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” <i>6th Conference on Information-Theoretic Cryptography</i>, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara, CA, United States, 2025, vol. 343."},"_id":"22007","title":"Time-space tradeoffs of truncation with preprocessing","OA_place":"publisher"},{"status":"public","doi":"10.1090/cams/48","publication_identifier":{"issn":["2692-3688"]},"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","page":"284-320","ddc":["500"],"arxiv":1,"article_processing_charge":"No","type":"journal_article","extern":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.12334","open_access":"1"}],"publisher":"American Mathematical Society","has_accepted_license":"1","publication":"Communications of the American Mathematical Society","citation":{"chicago":"Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>. American Mathematical Society, 2025. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>.","ista":"Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. 5(7), 284–320.","short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320.","ieee":"R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for continuum Calogero–Moser models on the line,” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7. American Mathematical Society, pp. 284–320, 2025.","mla":"Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>.","apa":"Killip, R., Laurens, T., &#38; Vişan, M. (2025). Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>","ama":"Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. 2025;5(7):284-320. doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>"},"_id":"22032","title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","OA_place":"publisher","OA_type":"diamond","date_updated":"2026-06-22T11:21:09Z","day":"23","das_tickbox":"1","author":[{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"first_name":"Thierry","last_name":"Laurens","full_name":"Laurens, Thierry"},{"last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica"}],"publication_status":"published","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"external_id":{"arxiv":["2311.12334"]},"intvolume":"         5","language":[{"iso":"eng"}],"oa":1,"issue":"7","date_created":"2026-06-19T07:42:34Z","date_published":"2025-06-23T00:00:00Z","year":"2025","article_type":"original","volume":5,"month":"06","abstract":[{"lang":"eng","text":"We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton."}]},{"day":"24","OA_type":"green","date_updated":"2026-06-22T13:00:14Z","_id":"22036","title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","OA_place":"repository","publisher":"Springer Nature","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"citation":{"chicago":"Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>.","ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","ieee":"C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical nonlinear Schrödinger equation,” <i>Mathematische Zeitschrift</i>, vol. 311. Springer Nature, 2025.","mla":"Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>, vol. 311, 21, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>.","apa":"Fan, C., Killip, R., Vişan, M., &#38; Zhao, Z. (2025). Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>","ama":"Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. 2025;311. doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>"},"publication":"Mathematische Zeitschrift","article_processing_charge":"No","arxiv":1,"type":"journal_article","extern":"1","oa_version":"Preprint","scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","quality_controlled":"1","doi":"10.1007/s00209-025-03821-8","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"month":"07","abstract":[{"lang":"eng","text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3."}],"volume":311,"date_created":"2026-06-19T07:44:05Z","article_type":"original","year":"2025","date_published":"2025-07-24T00:00:00Z","intvolume":"       311","language":[{"iso":"eng"}],"oa":1,"article_number":"21","publication_status":"published","external_id":{"arxiv":["2403.09989"]},"das_tickbox":"1","author":[{"first_name":"Chenjie","last_name":"Fan","full_name":"Fan, Chenjie"},{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica"},{"full_name":"Zhao, Zehua","first_name":"Zehua","last_name":"Zhao"}]},{"page":"1646-1660","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","oa_version":"Published Version","quality_controlled":"1","doi":"10.1017/prm.2024.7","publication_identifier":{"eissn":["1473-7124"],"issn":["0308-2105"]},"ec_funded":1,"status":"public","type":"journal_article","arxiv":1,"article_processing_charge":"Yes (via OA deal)","ddc":["510"],"OA_place":"publisher","title":"Common valuations of division polynomials","_id":"12311","citation":{"short":"B. Naskręcki, M. Verzobio, Proceedings of the Royal Society of Edinburgh Section A: Mathematics 155 (2025) 1646–1660.","ista":"Naskręcki B, Verzobio M. 2025. Common valuations of division polynomials. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 155(5), 1646–1660.","chicago":"Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.” <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/prm.2024.7\">https://doi.org/10.1017/prm.2024.7</a>.","ama":"Naskręcki B, Verzobio M. Common valuations of division polynomials. <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>. 2025;155(5):1646-1660. doi:<a href=\"https://doi.org/10.1017/prm.2024.7\">10.1017/prm.2024.7</a>","apa":"Naskręcki, B., &#38; Verzobio, M. (2025). Common valuations of division polynomials. <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/prm.2024.7\">https://doi.org/10.1017/prm.2024.7</a>","mla":"Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.” <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol. 155, no. 5, Cambridge University Press, 2025, pp. 1646–60, doi:<a href=\"https://doi.org/10.1017/prm.2024.7\">10.1017/prm.2024.7</a>.","ieee":"B. Naskręcki and M. Verzobio, “Common valuations of division polynomials,” <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol. 155, no. 5. Cambridge University Press, pp. 1646–1660, 2025."},"keyword":["Elliptic curves","Néron models","division polynomials","height functions","discrete valuation rings"],"has_accepted_license":"1","publication":"Proceedings of the Royal Society of Edinburgh Section A: Mathematics","publisher":"Cambridge University Press","department":[{"_id":"TiBr"}],"file":[{"date_updated":"2025-12-30T06:45:47Z","file_name":"2025_ProceedingsRoyalSocEdinburghA_Naskrecki.pdf","file_id":"20878","checksum":"c5ec6e29aca2fb4533cb95fac409a0b2","success":1,"content_type":"application/pdf","file_size":477624,"creator":"dernst","access_level":"open_access","relation":"main_file","date_created":"2025-12-30T06:45:47Z"}],"day":"01","date_updated":"2025-12-30T06:46:17Z","OA_type":"hybrid","PlanS_conform":"1","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"corr_author":"1","external_id":{"arxiv":["2203.02015"],"isi":["001174907100001"]},"tmp":{"image":"/images/cc_by.png","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)"},"publication_status":"published","author":[{"full_name":"Naskręcki, Bartosz","first_name":"Bartosz","last_name":"Naskręcki"},{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","full_name":"Verzobio, Matteo","orcid":"0000-0002-0854-0306","last_name":"Verzobio","first_name":"Matteo"}],"year":"2025","article_type":"original","file_date_updated":"2025-12-30T06:45:47Z","date_published":"2025-10-01T00:00:00Z","date_created":"2023-01-16T11:45:22Z","language":[{"iso":"eng"}],"acknowledgement":"Silverman, and Paul Voutier for the comments on the earlier version of this paper. The first author acknowledges the support by Dioscuri programme initiated by the Max Planck Society, jointly managed with the National Science Centre (Poland), and mutually funded by the Polish Ministry of Science and Higher Education and the German Federal Ministry of Education and Research. The second author has been supported by MIUR (Italy) through PRIN 2017 ‘Geometric, algebraic and analytic methods in arithmetic’ and has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","issue":"5","isi":1,"oa":1,"intvolume":"       155","abstract":[{"text":"In this note, we prove a formula for the cancellation exponent  kv,n between division polynomials  ψn  and  ϕn  associated with a sequence  {nP}n∈N of points on an elliptic curve  E  defined over a discrete valuation field  K. The formula greatly generalizes the previously known special cases and treats also the case of non-standard Kodaira types for non-perfect residue fields.","lang":"eng"}],"month":"10","volume":155}]