[{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-10T07:27:19Z","scopus_import":"1","quality_controlled":"1","citation":{"ieee":"A. Gulyaev, J. Hazarika, Z.-F. Liu, and L. Venkataraman, “A computationally efficient and accurate method for predicting conductance of single-molecule junctions,” <i>Nano Letters</i>, vol. 26, no. 22. American Chemical Society, pp. 7429–7434, 2026.","apa":"Gulyaev, A., Hazarika, J., Liu, Z.-F., &#38; Venkataraman, L. (2026). A computationally efficient and accurate method for predicting conductance of single-molecule junctions. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">https://doi.org/10.1021/acs.nanolett.6c01462</a>","chicago":"Gulyaev, Artem, Jyotisman Hazarika, Zhen-Fei Liu, and Latha Venkataraman. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” <i>Nano Letters</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">https://doi.org/10.1021/acs.nanolett.6c01462</a>.","ista":"Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. 2026. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 26(22), 7429–7434.","short":"A. Gulyaev, J. Hazarika, Z.-F. Liu, L. Venkataraman, Nano Letters 26 (2026) 7429–7434.","ama":"Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. <i>Nano Letters</i>. 2026;26(22):7429–7434. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">10.1021/acs.nanolett.6c01462</a>","mla":"Gulyaev, Artem, et al. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” <i>Nano Letters</i>, vol. 26, no. 22, American Chemical Society, 2026, pp. 7429–7434, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.6c01462\">10.1021/acs.nanolett.6c01462</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","volume":26,"type":"journal_article","issue":"22","year":"2026","pmid":1,"file":[{"date_created":"2026-06-16T09:11:35Z","date_updated":"2026-06-16T09:11:35Z","content_type":"application/pdf","relation":"main_file","file_size":3362800,"file_name":"2026_NanoLetters_Gulyaev.pdf","checksum":"897551374cac28e0db26dcb0b676b8e7","creator":"dernst","file_id":"22013","access_level":"open_access","success":1}],"language":[{"iso":"eng"}],"publication":"Nano Letters","corr_author":"1","title":"A computationally efficient and accurate method for predicting conductance of single-molecule junctions","intvolume":"        26","page":"7429–7434","date_published":"2026-06-01T00:00:00Z","PlanS_conform":"1","publication_identifier":{"eissn":["1530-6992"],"issn":["1530-6984"]},"department":[{"_id":"LaVe"},{"_id":"GradSch"}],"OA_place":"publisher","_id":"21980","author":[{"first_name":"Artem","full_name":"Gulyaev, Artem","id":"83ed7901-7380-11f0-bf20-a0788d5e654d","last_name":"Gulyaev"},{"last_name":"Hazarika","id":"d87714c4-663d-11f0-bd06-caece19833e5","orcid":"0009-0007-2542-7878","full_name":"Hazarika, Jyotisman","first_name":"Jyotisman"},{"last_name":"Liu","full_name":"Liu, Zhen-Fei","first_name":"Zhen-Fei"},{"first_name":"Latha","orcid":"0000-0002-6957-6089","full_name":"Venkataraman, Latha","last_name":"Venkataraman","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf"}],"external_id":{"pmid":["42223342"]},"publisher":"American Chemical Society","publication_status":"published","day":"01","doi":"10.1021/acs.nanolett.6c01462","abstract":[{"text":"Despite significant progress in the field of molecular electronics over the last two decades, the quantitative prediction of metal-molecule-metal junction conductance remains a challenge. The standard computational framework combines density functional theory (DFT) with nonequilibrium Green’s functions (NEGF) using low-rung exchange-correlation functionals such as PBE, which overestimate the conductances. More advanced correction methods exist but require complex workflows and high computational cost, limiting their accessibility. Here, we introduce a physically motivated approach that approximates results obtained with high-rung functionals. Our method fits the PBE-calculated transmission to a Breit-Wigner form and subsequently refines the fit parameters using molecular orbital energies and metal densities of states computed for the isolated subsystems with high-rung functionals. This approach is applicable to a broad range of molecular junctions yielding conductance values in quantitative agreement with experiments. Our approach is simple, low-cost, and accurate, making it well-suited for routine and large-scale prediction of single-molecule junction conductance.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","ddc":["540"],"has_accepted_license":"1","date_updated":"2026-06-16T09:13:30Z","month":"06","OA_type":"hybrid","acknowledgement":"This work was supported primarily by the Institute of Science and Technology Austria. L.V. was supported in part by the National Science Foundation (No. NSF-DMR 2241180). Z.-F.L. was supported by an NSF CAREER Award, No. DMR-2044552 and an Alfred P. Sloan Research Fellowship, No. FG-2024-21750.","oa":1,"article_type":"letter_note","oa_version":"Published Version","file_date_updated":"2026-06-16T09:11:35Z"},{"quality_controlled":"1","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-10T07:29:13Z","volume":227,"status":"public","citation":{"apa":"Goncharov, V. (2026). An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>","ieee":"V. Goncharov, “An easier way to compute 2-cocycles coming from a reduction for semidirect products,” <i>Journal of Geometry and Physics</i>, vol. 227. Elsevier, 2026.","chicago":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">https://doi.org/10.1016/j.geomphys.2026.105878</a>.","ista":"Goncharov V. 2026. An easier way to compute 2-cocycles coming from a reduction for semidirect products. Journal of Geometry and Physics. 227, 105878.","short":"V. Goncharov, Journal of Geometry and Physics 227 (2026).","mla":"Goncharov, Viacheslav. “An Easier Way to Compute 2-Cocycles Coming from a Reduction for Semidirect Products.” <i>Journal of Geometry and Physics</i>, vol. 227, 105878, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>.","ama":"Goncharov V. An easier way to compute 2-cocycles coming from a reduction for semidirect products. <i>Journal of Geometry and Physics</i>. 2026;227. doi:<a href=\"https://doi.org/10.1016/j.geomphys.2026.105878\">10.1016/j.geomphys.2026.105878</a>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","year":"2026","title":"An easier way to compute 2-cocycles coming from a reduction for semidirect products","publication":"Journal of Geometry and Physics","corr_author":"1","language":[{"iso":"eng"}],"intvolume":"       227","PlanS_conform":"1","date_published":"2026-05-21T00:00:00Z","article_number":"105878","arxiv":1,"publication_identifier":{"eissn":["1879-1662"],"issn":["0393-0440"]},"department":[{"_id":"GradSch"}],"OA_place":"publisher","day":"21","author":[{"id":"8a0e2993-7114-11f0-b60e-f50e633649d8","last_name":"Goncharov","full_name":"Goncharov, Viacheslav","first_name":"Viacheslav"}],"_id":"21981","external_id":{"arxiv":["2509.16169"]},"publisher":"Elsevier","publication_status":"epub_ahead","article_processing_charge":"Yes (via OA deal)","abstract":[{"text":"For Hamiltonian actions of semidirect products G = FxH, we study 2-cocycles arising from residual Hamiltonian actions of F on Hamiltonian reductions for H. The motivation comes from the study of Teichmüller spaces for surfaces with boundary, which carry Hamiltonian actions of the Virasoro algebra. In this paper, we give a general setup for the problem, and we suggest an easier way to obtain the Gelfand-Fuchs 2-cocycles for Hamiltonian actions on Teichmüller spaces.","lang":"eng"}],"doi":"10.1016/j.geomphys.2026.105878","ddc":["000"],"month":"05","date_updated":"2026-06-16T09:23:39Z","has_accepted_license":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.geomphys.2026.105878"}],"OA_type":"hybrid","oa":1,"article_type":"original","oa_version":"Published Version"},{"project":[{"name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020"}],"day":"01","publication_status":"published","_id":"20328","external_id":{"oaworkid":["w4413883397"],"isi":["001583178200001"],"arxiv":["2411.16572"]},"publisher":"Elsevier","author":[{"last_name":"Cipolloni","id":"42198EFA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4901-7992","full_name":"Cipolloni, Giorgio","first_name":"Giorgio"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László"},{"first_name":"Yuanyuan","full_name":"Xu, Yuanyuan","orcid":"0000-0003-1559-1205","id":"7902bdb1-a2a4-11eb-a164-c9216f71aea3","last_name":"Xu"}],"doi":"10.1016/j.jfa.2025.111180","article_processing_charge":"Yes (via OA deal)","abstract":[{"text":"We consider the standard overlap (math formular) of any bi-orthogonal family of left and right eigenvectors of a large random matrix X with centred i.i.d. entries and we prove that it decays as an inverse second power of the distance between the corresponding eigenvalues. This extends similar results for the complex Gaussian ensemble from Bourgade and Dubach [15], as well as Benaych-Georges and Zeitouni [13], to any i.i.d. matrix ensemble in both symmetry classes. As a main tool, we prove a two-resolvent local law for the Hermitisation of X uniformly in the spectrum with optimal decay rate and optimal dependence on the density near the spectral edge.","lang":"eng"}],"ddc":["510"],"ec_funded":1,"month":"01","has_accepted_license":"1","date_updated":"2026-06-03T13:12:14Z","acknowledgement":"Partially supported by ERC Advanced Grant “RMTBeyond” No. 101020331. Partially supported by National Key R&D Program of China No. 2024YFA1013503.","OA_type":"hybrid","article_type":"original","oa":1,"oa_version":"Published Version","file_date_updated":"2026-01-05T13:05:47Z","quality_controlled":"1","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2025-09-10T05:46:07Z","status":"public","volume":290,"citation":{"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>","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>.","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.","short":"G. Cipolloni, L. Erdös, Y. Xu, Journal of Functional Analysis 290 (2026).","chicago":"Cipolloni, Giorgio, László Erdös, and Yuanyuan Xu. “Optimal Decay of Eigenvector Overlap for Non-Hermitian Random Matrices.” <i>Journal of Functional Analysis</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.jfa.2025.111180\">https://doi.org/10.1016/j.jfa.2025.111180</a>.","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.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","year":"2026","issue":"1","corr_author":"1","publication":"Journal of Functional Analysis","title":"Optimal decay of eigenvector overlap for non-Hermitian random matrices","file":[{"relation":"main_file","file_size":2503887,"file_name":"2026_JourFuncAnalysis_Cipolloni.pdf","checksum":"ee53d5e695f0df11e017c8c9242a2b04","date_created":"2026-01-05T13:05:47Z","date_updated":"2026-01-05T13:05:47Z","content_type":"application/pdf","access_level":"open_access","file_id":"20947","success":1,"creator":"dernst"}],"language":[{"iso":"eng"}],"intvolume":"       290","PlanS_conform":"1","article_number":"111180","date_published":"2026-01-01T00:00:00Z","arxiv":1,"oaworkid":1,"isi":1,"department":[{"_id":"LaEr"}],"publication_identifier":{"issn":["0022-1236"]},"OA_place":"publisher"},{"type":"journal_article","year":"2026","corr_author":"1","publication":"Journal of Combinatorial Theory Series B","title":"The Hamilton space of pseudorandom graphs","file":[{"file_name":"2026_JourCombTheoryB_Christoph.pdf","checksum":"60676af4af4b3243ba187e7d65440d99","file_size":688924,"relation":"main_file","content_type":"application/pdf","date_created":"2026-01-05T13:29:34Z","date_updated":"2026-01-05T13:29:34Z","success":1,"access_level":"open_access","file_id":"20953","creator":"dernst"}],"language":[{"iso":"eng"}],"quality_controlled":"1","scopus_import":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2025-10-05T22:01:34Z","status":"public","volume":176,"citation":{"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.","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>.","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.","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>.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","isi":1,"publication_identifier":{"issn":["0095-8956"],"eissn":["1096-0902"]},"department":[{"_id":"MaKw"}],"OA_place":"publisher","intvolume":"       176","PlanS_conform":"1","date_published":"2026-01-01T00:00:00Z","page":"254-267","arxiv":1,"ddc":["510"],"ec_funded":1,"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"day":"01","author":[{"full_name":"Christoph, Micha","first_name":"Micha","last_name":"Christoph"},{"full_name":"Nenadov, Rajko","first_name":"Rajko","last_name":"Nenadov"},{"first_name":"Kalina H","full_name":"Petrova, Kalina H","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","last_name":"Petrova"}],"_id":"20422","publisher":"Elsevier","external_id":{"arxiv":["2402.01447"],"isi":["001585783400001"]},"publication_status":"published","doi":"10.1016/j.jctb.2025.09.002","article_processing_charge":"Yes (via OA deal)","abstract":[{"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","lang":"eng"}],"article_type":"original","oa":1,"file_date_updated":"2026-01-05T13:29:34Z","oa_version":"Published Version","month":"01","has_accepted_license":"1","date_updated":"2026-01-05T13:29:52Z","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_type":"hybrid"},{"_id":"20456","publication_status":"published","publisher":"Springer Nature","author":[{"first_name":"Ranita","full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas"},{"orcid":"0000-0001-6249-0832","full_name":"Cultrera di Montesano, Sebastiano","first_name":"Sebastiano","last_name":"Cultrera di Montesano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ondrej","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","last_name":"Draganov","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"external_id":{"arxiv":["2212.03121"],"isi":["001584166900001"]},"day":"01","project":[{"call_identifier":"H2020","grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"}],"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"}],"article_processing_charge":"Yes (via OA deal)","doi":"10.1007/s00454-025-00778-7","ddc":["510"],"ec_funded":1,"date_updated":"2026-01-05T13:21:56Z","has_accepted_license":"1","month":"01","OA_type":"hybrid","acknowledgement":"The fourth author thanks Boris Aronov for insightful discussions on the size of the overlay of Voronoi tessellations. Open access funding provided by Institute of Science and Technology (IST Austria). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35.","article_type":"original","oa":1,"file_date_updated":"2026-01-05T13:21:20Z","oa_version":"Published Version","date_created":"2025-10-12T22:01:26Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"related_material":{"record":[{"status":"public","id":"15090","relation":"earlier_version"}]},"scopus_import":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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>.","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>","short":"R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 75 (2026) 24–47.","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>.","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."},"volume":75,"status":"public","type":"journal_article","year":"2026","language":[{"iso":"eng"}],"file":[{"creator":"dernst","success":1,"file_id":"20952","access_level":"open_access","content_type":"application/pdf","date_created":"2026-01-05T13:21:20Z","date_updated":"2026-01-05T13:21:20Z","file_name":"2026_DiscreteCompGeom_Biswas.pdf","checksum":"0addb5c1b78142f9fb453bfa04695400","file_size":570922,"relation":"main_file"}],"title":"On the size of chromatic Delaunay mosaics","corr_author":"1","publication":"Discrete and Computational Geometry","intvolume":"        75","page":"24-47","arxiv":1,"date_published":"2026-01-01T00:00:00Z","PlanS_conform":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"department":[{"_id":"HeEd"}],"isi":1,"OA_place":"publisher"},{"intvolume":"       131","article_number":"104235","PlanS_conform":"1","date_published":"2026-01-01T00:00:00Z","arxiv":1,"isi":1,"department":[{"_id":"MaKw"}],"publication_identifier":{"issn":["0195-6698"]},"OA_place":"publisher","scopus_import":"1","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2025-10-16T13:14:34Z","status":"public","volume":131,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Boyadzhiyska, S., Das, S., Lesgourgues, T., &#38; Petrova, K. H. (2026). Odd-Ramsey numbers of complete bipartite graphs. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104235\">https://doi.org/10.1016/j.ejc.2025.104235</a>","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.","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).","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>"},"type":"journal_article","year":"2026","publication":"European Journal of Combinatorics","corr_author":"1","title":"Odd-Ramsey numbers of complete bipartite graphs","file":[{"content_type":"application/pdf","date_updated":"2026-01-05T13:34:40Z","date_created":"2026-01-05T13:34:40Z","checksum":"52883daa217398396cbf9b8ad9ddae92","file_name":"2026_EuropJourCombinatorics_Boyadzhiyska.pdf","file_size":563029,"relation":"main_file","creator":"dernst","success":1,"file_id":"20954","access_level":"open_access"}],"language":[{"iso":"eng"}],"month":"01","has_accepted_license":"1","date_updated":"2026-01-05T13:34:48Z","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.","OA_type":"hybrid","article_type":"original","oa":1,"file_date_updated":"2026-01-05T13:34:40Z","oa_version":"Published Version","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413"}],"day":"01","_id":"20482","publication_status":"published","external_id":{"arxiv":["2410.05887"],"isi":["001573380700001"]},"author":[{"first_name":"Simona","full_name":"Boyadzhiyska, Simona","last_name":"Boyadzhiyska"},{"last_name":"Das","full_name":"Das, Shagnik","first_name":"Shagnik"},{"last_name":"Lesgourgues","full_name":"Lesgourgues, Thomas","first_name":"Thomas"},{"first_name":"Kalina H","full_name":"Petrova, Kalina H","last_name":"Petrova","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381"}],"publisher":"Elsevier","doi":"10.1016/j.ejc.2025.104235","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"}],"article_processing_charge":"Yes (via OA deal)","ddc":["500"],"ec_funded":1},{"ddc":["530"],"external_id":{"arxiv":["2511.16421"]},"_id":"21437","publisher":"Springer Nature","author":[{"id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","last_name":"Sunko","first_name":"Veronika","full_name":"Sunko, Veronika","orcid":"0000-0003-2724-3523"},{"full_name":"Orenstein, J.","first_name":"J.","last_name":"Orenstein"}],"publication_status":"epub_ahead","day":"30","article_processing_charge":"Yes","abstract":[{"lang":"eng","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."}],"doi":"10.1038/s41535-026-00901-8","oa":1,"article_type":"original","oa_version":"Published Version","date_updated":"2026-06-24T10:31:05Z","has_accepted_license":"1","month":"05","OA_type":"gold","main_file_link":[{"url":"https://doi.org/10.1038/s41535-026-00901-8","open_access":"1"}],"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.","type":"journal_article","year":"2026","language":[{"iso":"eng"}],"title":"Linear magneto-birefringence as a probe of altermagnetism","publication":"npj Quantum Materials","corr_author":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_created":"2026-03-11T10:40:08Z","citation":{"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.","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>.","ista":"Sunko V, Orenstein J. 2026. Linear magneto-birefringence as a probe of altermagnetism. npj Quantum Materials.","short":"V. Sunko, J. Orenstein, Npj Quantum Materials (2026).","mla":"Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe of Altermagnetism.” <i>Npj Quantum Materials</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41535-026-00901-8\">10.1038/s41535-026-00901-8</a>.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publication_identifier":{"eissn":["2397-4648"]},"department":[{"_id":"VeSu"}],"OA_place":"publisher","arxiv":1,"date_published":"2026-05-30T00:00:00Z"},{"das_tickbox":"0","oa_version":"Published Version","file_date_updated":"2026-06-24T06:50:24Z","article_type":"original","oa":1,"dataavailabilitystatement":"Correspondence and requests for materials should be addressed to Krishnendu Chatterjee.","OA_type":"gold","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.","date_updated":"2026-06-24T07:53:53Z","has_accepted_license":"1","month":"12","ec_funded":1,"ddc":["000"],"supplementarymaterial":"yes","article_processing_charge":"Yes","abstract":[{"lang":"eng","text":"Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects."}],"doi":"10.1038/s41467-026-71777-2","_id":"22101","publisher":"Springer Nature","author":[{"orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","first_name":"Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"first_name":"Hossein","full_name":"Nemati, Hossein","last_name":"Nemati"},{"id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","full_name":"Tkadlec, Josef","orcid":"0000-0002-1097-9684","first_name":"Josef"},{"first_name":"Kamran","full_name":"Kaveh, Kamran","last_name":"Kaveh"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"publication_status":"published","external_id":{"pmid":["41997932"]},"day":"01","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818"}],"OA_place":"publisher","researchdata_availability":"no","department":[{"_id":"KrCh"}],"publication_identifier":{"eissn":["2041-1723"]},"date_published":"2026-12-01T00:00:00Z","article_number":"5325","DOAJ_listed":"1","intvolume":"        17","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_updated":"2026-06-24T06:50:24Z","date_created":"2026-06-24T06:50:24Z","checksum":"b660048bb271f24d6763803e247d5c32","file_name":"2026_NatureComm_Svoboda.pdf","relation":"main_file","file_size":1068919,"creator":"dernst","success":1,"access_level":"open_access","file_id":"22136"}],"title":"The effect of the fitness gradient on fixation probability","corr_author":"1","publication":"Nature Communications","type":"journal_article","year":"2026","pmid":1,"citation":{"chicago":"Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>.","ieee":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","apa":"Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>","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>","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).","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":17,"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"date_created":"2026-06-21T22:02:59Z","scopus_import":"1","quality_controlled":"1"},{"OA_place":"repository","publication_identifier":{"issn":["2184-3589"],"isbn":["9789897587962"],"eissn":["2184-433X"]},"department":[{"_id":"ToHe"}],"researchdata_availability":"no","date_published":"2026-04-01T00:00:00Z","page":"4689-4696","intvolume":"         5","title":"Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants","corr_author":"1","publication":"Proceedings of the 18th International Conference on Agents and Artificial Intelligence","language":[{"iso":"eng"}],"type":"conference","year":"2026","volume":5,"status":"public","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.","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>.","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.","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>","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>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","quality_controlled":"1","date_created":"2026-06-21T22:03:00Z","das_tickbox":"0","keyword":["Explainable AI","Large Language Models","Trust in AI"],"oa_version":"Accepted Version","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","OA_type":"green","main_file_link":[{"open_access":"1","url":"https://filipcano.org/files/icaart26llm.pdf"}],"month":"04","date_updated":"2026-06-24T08:37:00Z","ec_funded":1,"supplementarymaterial":"no","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"doi":"10.5220/0014483200004052","day":"01","conference":{"end_date":"2026-03-08","location":"Marbella, Spain","start_date":"2026-03-05","name":"ICAART: International Conference on Agents and Artificial Intelligence"},"project":[{"call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"_id":"22103","publisher":"Science and Technology Publications","author":[{"orcid":"0000-0002-0783-904X","full_name":"Cano Cordoba, Filip","first_name":"Filip","last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1"}],"publication_status":"published"},{"OA_place":"publisher","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"researchdata_availability":"yes","publication_identifier":{"issn":["17554330"],"eissn":["17554349"]},"department":[{"_id":"PaSc"},{"_id":"LifeSc"}],"date_published":"2026-06-10T00:00:00Z","PlanS_conform":"1","language":[{"iso":"eng"}],"title":"Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes","corr_author":"1","publication":"Nature Chemistry","type":"journal_article","year":"2026","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","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.","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>.","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.","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>.","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>"},"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-21T22:03:01Z","related_material":{"record":[{"id":"20641","status":"public","relation":"research_data"},{"status":"public","id":"21145","relation":"research_data"}]},"quality_controlled":"1","scopus_import":"1","das_tickbox":"1","oa_version":"Published Version","oa":1,"article_type":"original","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.","main_file_link":[{"url":"https://doi.org/10.1038/s41557-026-02155-0","open_access":"1"}],"OA_type":"hybrid","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).","date_updated":"2026-06-24T08:47:58Z","has_accepted_license":"1","month":"06","ddc":["540"],"supplementarymaterial":"yes","article_processing_charge":"Yes (via OA deal)","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."}],"doi":"10.1038/s41557-026-02155-0","_id":"22105","author":[{"id":"36336939-eb97-11eb-a6c2-c83f1214ca79","last_name":"Becker","first_name":"Lea Marie","full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151"},{"full_name":"Fu, Haohao","first_name":"Haohao","last_name":"Fu"},{"id":"71cda2f3-e604-11ee-a1df-da10587eda3f","last_name":"Tatman","full_name":"Tatman, Benjamin","first_name":"Benjamin"},{"full_name":"Dreydoppel, Matthias","first_name":"Matthias","last_name":"Dreydoppel"},{"first_name":"Anna","full_name":"Kapitonova, Anna","last_name":"Kapitonova","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471"},{"orcid":"0000-0001-7597-043X","full_name":"Balazs, Daniel","first_name":"Daniel","last_name":"Balazs","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E"},{"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","orcid":"0000-0002-9350-7606","full_name":"Schanda, Paul","last_name":"Schanda","id":"7B541462-FAF6-11E9-A490-E8DFE5697425"}],"publication_status":"epub_ahead","external_id":{"pmid":["42271006"]},"publisher":"Springer Nature","day":"10","project":[{"name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","grant_number":"26777"}]},{"month":"02","date_updated":"2026-06-24T08:47:57Z","has_accepted_license":"1","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.","oa":1,"file_date_updated":"2026-02-05T13:52:41Z","oa_version":"Published Version","day":"09","project":[{"name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","grant_number":"26777"}],"publisher":"Institute of Science and Technology Austria","_id":"21145","author":[{"id":"36336939-eb97-11eb-a6c2-c83f1214ca79","last_name":"Becker","full_name":"Becker, Lea Marie","orcid":"0000-0002-6401-5151","first_name":"Lea Marie"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","last_name":"Schanda","first_name":"Paul","full_name":"Schanda, Paul","orcid":"0000-0002-9350-7606"},{"first_name":"Christophe","full_name":"Chipot, Christophe","last_name":"Chipot"}],"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 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. "}],"article_processing_charge":"No","doi":"10.15479/AT-ISTA-21145","ddc":["572"],"date_published":"2026-02-09T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"PaSc"}],"acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"contributor":[{"last_name":"Fu","first_name":"Haohao","contributor_type":"researcher"},{"id":"71cda2f3-e604-11ee-a1df-da10587eda3f","last_name":"Tatman","first_name":"Benjamin","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Matthias","last_name":"Dreydoppel"},{"last_name":"Kapitonova","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","contributor_type":"researcher","first_name":"Anna"},{"orcid":"0000-0001-7597-043X","contributor_type":"researcher","first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","last_name":"Balazs"},{"first_name":"Ulrich","contributor_type":"researcher","last_name":"Weininger"},{"last_name":"Engilberge","first_name":"Sylvain","contributor_type":"researcher"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"20641"},{"status":"public","id":"22105","relation":"used_in_publication"}]},"tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"date_created":"2026-02-05T13:54:39Z","status":"public","citation":{"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.","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>.","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>.","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>.","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>"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"research_data","year":"2026","title":"Additional Data for \"Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes\"","corr_author":"1","file":[{"creator":"lbecker","file_id":"21146","access_level":"open_access","content_type":"text/plain","date_created":"2026-02-05T13:52:37Z","date_updated":"2026-02-05T13:52:37Z","file_name":"README.txt","checksum":"02a419cce8cea450bc952f35488d2df5","file_size":4263,"relation":"table_of_contents"},{"content_type":"application/zip","date_updated":"2026-02-05T13:52:41Z","date_created":"2026-02-05T13:52:41Z","checksum":"b0b82b1aa73985b0b308a3fa52d21aea","file_name":"Research_Data.zip","relation":"main_file","file_size":50647107,"creator":"lbecker","success":1,"access_level":"open_access","file_id":"21147"}]},{"conference":{"location":"Cambridge, MA; United States","start_date":"2026-06-03","name":"FORC: Symposium on Foundations of Responsible Computing","end_date":"2026-06-05"},"day":"01","project":[{"_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","grant_number":"101019564"}],"_id":"22146","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","author":[{"last_name":"Kalinin","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","first_name":"Nikita","full_name":"Kalinin, Nikita"},{"full_name":"Andersson, Joel D","first_name":"Joel D","id":"4a893819-d954-11f0-89b1-e360bad9ccc5","last_name":"Andersson"}],"external_id":{"arxiv":["2511.17994"]},"publication_status":"published","article_processing_charge":"No","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"}],"doi":"10.4230/LIPIcs.FORC.2026.2","ddc":["000"],"supplementarymaterial":"no","ec_funded":1,"month":"06","date_updated":"2026-06-29T06:56:34Z","has_accepted_license":"1","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","OA_type":"gold","oa":1,"das_tickbox":"0","keyword":["differential privacy","machine learning","matrix factorization"],"oa_version":"Published Version","file_date_updated":"2026-06-29T06:55:23Z","quality_controlled":"1","scopus_import":"1","date_created":"2026-06-28T22:01:34Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":368,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization for private training. 7th Symposium on Foundations of Responsible Computing. FORC: Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.","short":"N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” <i>7th Symposium on Foundations of Responsible Computing</i>, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>.","ama":"Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization for private training. In: <i>7th Symposium on Foundations of Responsible Computing</i>. Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">10.4230/LIPIcs.FORC.2026.2</a>","apa":"Kalinin, N., &#38; Andersson, J. D. (2026). Learning rate scheduling with matrix factorization for private training. In <i>7th Symposium on Foundations of Responsible Computing</i> (Vol. 368). Cambridge, MA; United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>","ieee":"N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization for private training,” in <i>7th Symposium on Foundations of Responsible Computing</i>, Cambridge, MA; United States, 2026, vol. 368.","chicago":"Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix Factorization for Private Training.” In <i>7th Symposium on Foundations of Responsible Computing</i>, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.FORC.2026.2\">https://doi.org/10.4230/LIPIcs.FORC.2026.2</a>."},"year":"2026","type":"conference","title":"Learning rate scheduling with matrix factorization for private training","corr_author":"1","publication":"7th Symposium on Foundations of Responsible Computing","language":[{"iso":"eng"}],"file":[{"creator":"dernst","success":1,"file_id":"22149","access_level":"open_access","content_type":"application/pdf","date_updated":"2026-06-29T06:55:23Z","date_created":"2026-06-29T06:55:23Z","checksum":"c661f016d3861a1c1b590b87a744d087","file_name":"2026_LIPIcsFORC_Kalinin.pdf","relation":"main_file","file_size":1231914}],"intvolume":"       368","date_published":"2026-06-01T00:00:00Z","article_number":"2:1-2:21","alternative_title":["LIPIcs"],"arxiv":1,"department":[{"_id":"ChLa"},{"_id":"GradSch"},{"_id":"MoHe"}],"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959774192"]},"researchdata_availability":"no","OA_place":"publisher"},{"OA_place":"publisher","researchdata_availability":"no","department":[{"_id":"MiLe"}],"publication_identifier":{"eissn":["1936-086X"],"issn":["1936-0851"]},"page":"17360-17372","PlanS_conform":"1","date_published":"2026-06-23T00:00:00Z","intvolume":"        20","file":[{"creator":"dernst","success":1,"access_level":"open_access","file_id":"22150","content_type":"application/pdf","date_updated":"2026-06-29T08:58:12Z","date_created":"2026-06-29T08:58:12Z","checksum":"01ec8ee6fab7bf563df7af13f6b43045","file_name":"2026_ACSNano_Shchukin.pdf","file_size":6290296,"relation":"main_file"}],"language":[{"iso":"eng"}],"publication":"ACS Nano","title":"On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation","issue":"24","year":"2026","type":"journal_article","pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Shchukin, K. P., Gallego Lacey, O. N., Coquinot, B., Jakowski, J., Huang, J., Staudenmayer, P., … Grüneis, A. (2026). On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation. <i>ACS Nano</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsnano.6c02466\">https://doi.org/10.1021/acsnano.6c02466</a>","ieee":"K. P. Shchukin <i>et al.</i>, “On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation,” <i>ACS Nano</i>, vol. 20, no. 24. American Chemical Society, pp. 17360–17372, 2026.","chicago":"Shchukin, Konstantin P., Oliver N. Gallego Lacey, Baptiste Coquinot, Jacek Jakowski, Jingsong Huang, Patrik Staudenmayer, Yannic Falke, Ram Prakash Pandeya, and Alexander Grüneis. “On-Chip Tuning of Superconductivity in Fullerides via Current-Driven Rb+ Intercalation.” <i>ACS Nano</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acsnano.6c02466\">https://doi.org/10.1021/acsnano.6c02466</a>.","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.","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>.","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>"},"status":"public","volume":20,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-28T22:01:34Z","scopus_import":"1","quality_controlled":"1","file_date_updated":"2026-06-29T08:58:12Z","keyword":["fulleride","intercalation","alkali metal","superconductivity","Raman"],"oa_version":"Published Version","das_tickbox":"0","oa":1,"article_type":"original","OA_type":"hybrid","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.","has_accepted_license":"1","date_updated":"2026-06-29T09:00:33Z","month":"06","supplementarymaterial":"yes","ddc":["530"],"doi":"10.1021/acsnano.6c02466","abstract":[{"lang":"eng","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."}],"article_processing_charge":"Yes (via OA deal)","_id":"22145","publication_status":"published","publisher":"American Chemical Society","author":[{"last_name":"Shchukin","first_name":"Konstantin P.","full_name":"Shchukin, Konstantin P."},{"last_name":"Gallego Lacey","first_name":"Oliver N.","full_name":"Gallego Lacey, Oliver N."},{"full_name":"Coquinot, Baptiste","orcid":"0000-0001-5524-596X","first_name":"Baptiste","id":"f8417bd4-f599-11ee-a482-b927e3ed1e8e","last_name":"Coquinot"},{"last_name":"Jakowski","full_name":"Jakowski, Jacek","first_name":"Jacek"},{"last_name":"Huang","full_name":"Huang, Jingsong","first_name":"Jingsong"},{"first_name":"Patrik","full_name":"Staudenmayer, Patrik","last_name":"Staudenmayer"},{"first_name":"Yannic","full_name":"Falke, Yannic","last_name":"Falke"},{"first_name":"Ram Prakash","full_name":"Pandeya, Ram Prakash","last_name":"Pandeya"},{"last_name":"Grüneis","full_name":"Grüneis, Alexander","first_name":"Alexander"}],"external_id":{"pmid":["42260723"]},"day":"23"},{"arxiv":1,"date_published":"2026-06-01T00:00:00Z","PlanS_conform":"1","article_number":"rnag126","intvolume":"      2026","OA_place":"publisher","researchdata_availability":"no","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"department":[{"_id":"MaKw"}],"citation":{"mla":"Hunter, Zach, et al. “On Random Matrices with Large Corank.” <i>International Mathematics Research Notices</i>, vol. 2026, no. 12, rnag126, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/imrn/rnag126\">10.1093/imrn/rnag126</a>.","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>","short":"Z. Hunter, M.A. Kwan, L. Sauermann, M. Sawhney, International Mathematics Research Notices 2026 (2026).","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>.","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>","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","volume":2026,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-28T22:01:35Z","quality_controlled":"1","scopus_import":"1","file":[{"file_size":524993,"relation":"main_file","checksum":"396b47d0532d7ea509f8cd30f11392a8","file_name":"2026_IMRN_Hunter.pdf","date_updated":"2026-06-29T09:15:15Z","date_created":"2026-06-29T09:15:15Z","content_type":"application/pdf","access_level":"open_access","file_id":"22151","success":1,"creator":"dernst"}],"language":[{"iso":"eng"}],"publication":"International Mathematics Research Notices","corr_author":"1","title":"On random matrices with large corank","year":"2026","issue":"12","type":"journal_article","OA_type":"hybrid","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.","has_accepted_license":"1","date_updated":"2026-06-29T09:19:14Z","month":"06","oa_version":"Published Version","file_date_updated":"2026-06-29T09:15:15Z","das_tickbox":"0","oa":1,"article_type":"original","doi":"10.1093/imrn/rnag126","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"}],"article_processing_charge":"Yes (via OA deal)","_id":"22147","external_id":{"arxiv":["2510.12933"]},"author":[{"first_name":"Zach","full_name":"Hunter, Zach","last_name":"Hunter"},{"last_name":"Kwan","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","orcid":"0000-0002-4003-7567","full_name":"Kwan, Matthew Alan","first_name":"Matthew Alan"},{"last_name":"Sauermann","first_name":"Lisa","full_name":"Sauermann, Lisa"},{"first_name":"Mehtaab","full_name":"Sawhney, Mehtaab","last_name":"Sawhney"}],"publication_status":"published","publisher":"Oxford University Press","project":[{"_id":"bd95085b-d553-11ed-ba76-e55d3349be45","name":"Randomness and structure in combinatorics","grant_number":"101076777"}],"day":"01","ddc":["500"],"supplementarymaterial":"no"},{"biorxivid":1,"date_published":"2026-06-22T00:00:00Z","OA_place":"publisher","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"ScienComp"}],"researchdata_availability":"yes","department":[{"_id":"LeSa"}],"publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>.","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>","short":"Z. Zhao, L.A. Sazanov, Molecular Cell (n.d.).","ista":"Zhao Z, Sazanov LA. Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo. Molecular Cell.","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>.","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>","ieee":"Z. Zhao and L. A. Sazanov, “Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo,” <i>Molecular Cell</i>. Elsevier."},"status":"public","date_created":"2026-06-28T22:01:35Z","tmp":{"short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png"},"related_material":{"record":[{"status":"for_moderation","id":"22189","relation":"research_data"}]},"quality_controlled":"1","scopus_import":"1","language":[{"iso":"eng"}],"title":"Structure of E. Coli twin-arginine translocase (Tat) complex with bound cargo","corr_author":"1","publication":"Molecular Cell","type":"journal_article","year":"2026","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.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.molcel.2026.05.026"}],"OA_type":"hybrid","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.","date_updated":"2026-06-29T12:55:19Z","has_accepted_license":"1","month":"06","das_tickbox":"1","oa_version":"Published Version","oa":1,"article_type":"original","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"}],"article_processing_charge":"Yes (via OA deal)","doi":"10.1016/j.molcel.2026.05.026","publication_status":"inpress","_id":"22148","publisher":"Elsevier","external_id":{"biorxivid":["10.1101/2025.09.16.676506"]},"author":[{"first_name":"Ziyu","full_name":"Zhao, Ziyu","last_name":"Zhao","id":"a63fe682-9f3a-11ee-bf8c-cfdf919b9850"},{"orcid":"0000-0002-0977-7989","full_name":"Sazanov, Leonid A","first_name":"Leonid A","last_name":"Sazanov","id":"338D39FE-F248-11E8-B48F-1D18A9856A87"}],"day":"22","supplementarymaterial":"yes","ddc":["570"]},{"language":[{"iso":"eng"}],"publication":"Proceedings of the American Mathematical Society","title":"Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity","year":"2026","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “Scattering for the Nonlinear Schrödinger Equation with Concentrated Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2026. <a href=\"https://doi.org/10.1090/proc/17760\">https://doi.org/10.1090/proc/17760</a>.","ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity,” <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society, 2026.","apa":"Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2026). Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. <i>Proceedings of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/proc/17760\">https://doi.org/10.1090/proc/17760</a>","ama":"Harrop-Griffiths B, Killip R, Vişan M. Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. <i>Proceedings of the American Mathematical Society</i>. 2026. doi:<a href=\"https://doi.org/10.1090/proc/17760\">10.1090/proc/17760</a>","mla":"Harrop-Griffiths, Benjamin, et al. “Scattering for the Nonlinear Schrödinger Equation with Concentrated Nonlinearity.” <i>Proceedings of the American Mathematical Society</i>, American Mathematical Society, 2026, doi:<a href=\"https://doi.org/10.1090/proc/17760\">10.1090/proc/17760</a>.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, Proceedings of the American Mathematical Society (2026).","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2026. Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity. Proceedings of the American Mathematical Society."},"status":"public","date_created":"2026-06-19T08:59:17Z","quality_controlled":"1","scopus_import":"1","OA_place":"repository","publication_identifier":{"eissn":["1088-6826"],"issn":["0002-9939"]},"arxiv":1,"date_published":"2026-06-12T00:00:00Z","doi":"10.1090/proc/17760","abstract":[{"text":"We consider the cubic defocusing nonlinear Schrödinger equation in one dimension with the nonlinearity concentrated at a single point. We prove global well-posedness in the scaling-critical space L^2(R) and scattering for all such solutions. Moreover, we demonstrate that the same phenomenology holds whenever nonlinear effects are sufficiently concentrated in space.","lang":"eng"}],"article_processing_charge":"No","_id":"22097","publisher":"American Mathematical Society","publication_status":"epub_ahead","external_id":{"arxiv":["2507.14571"]},"author":[{"last_name":"Harrop-Griffiths","full_name":"Harrop-Griffiths, Benjamin","first_name":"Benjamin"},{"full_name":"Killip, Rowan","first_name":"Rowan","last_name":"Killip"},{"first_name":"Monica","full_name":"Visan, Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"extern":"1","day":"12","oa_version":"Preprint","das_tickbox":"1","oa":1,"article_type":"original","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2507.14571","open_access":"1"}],"OA_type":"green","date_updated":"2026-06-30T11:13:33Z","month":"06"},{"PlanS_conform":"1","article_number":"5540","date_published":"2026-06-23T00:00:00Z","DOAJ_listed":"1","intvolume":"        17","OA_place":"publisher","acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"M-Shop"},{"_id":"ScienComp"}],"researchdata_availability":"yes","publication_identifier":{"eissn":["2041-1723"]},"department":[{"_id":"PeJo"},{"_id":"ScienComp"}],"citation":{"ieee":"V. M. Vargas Barroso, J. Watson, A. C. Navas Olivé, A. Schlögl, and P. M. Jonas, “Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","apa":"Vargas Barroso, V. M., Watson, J., Navas Olivé, A. C., Schlögl, A., &#38; Jonas, P. M. (2026). Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71914-x\">https://doi.org/10.1038/s41467-026-71914-x</a>","chicago":"Vargas Barroso, Victor M, Jake Watson, Andrea C Navas Olivé, Alois Schlögl, and Peter M Jonas. “Developmental Emergence of Sparse and Structured Synaptic Connectivity in the Hippocampal CA3 Memory Circuit.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71914-x\">https://doi.org/10.1038/s41467-026-71914-x</a>.","short":"V.M. Vargas Barroso, J. Watson, A.C. Navas Olivé, A. Schlögl, P.M. Jonas, Nature Communications 17 (2026).","ista":"Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. 2026. Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. Nature Communications. 17, 5540.","ama":"Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71914-x\">10.1038/s41467-026-71914-x</a>","mla":"Vargas Barroso, Victor M., et al. “Developmental Emergence of Sparse and Structured Synaptic Connectivity in the Hippocampal CA3 Memory Circuit.” <i>Nature Communications</i>, vol. 17, 5540, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71914-x\">10.1038/s41467-026-71914-x</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":17,"status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-30T13:05:52Z","related_material":{"record":[{"relation":"research_data","status":"public","id":"21442"}]},"scopus_import":"1","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"file_id":"22231","access_level":"open_access","success":1,"creator":"dernst","relation":"main_file","file_size":18304997,"checksum":"d0b0093493926985b4c268662ff4d556","file_name":"2026_NatureComm_VargasBarroso.pdf","date_updated":"2026-07-01T06:46:06Z","date_created":"2026-07-01T06:46:06Z","content_type":"application/pdf"}],"title":"Developmental emergence of sparse and structured synaptic connectivity in the hippocampal CA3 memory circuit","corr_author":"1","publication":"Nature Communications","year":"2026","type":"journal_article","pmid":1,"dataavailabilitystatement":"Source data are provided with this paper. Additional original data are available from the corresponding author upon request. Code is available from https://doi.org/10.15479/AT-ISTA-21442 under the link https://research-explorer.ista.ac.at/download/21442/21443/ca3simu-vargas2026v1.tar.gz","OA_type":"gold","acknowledgement":"We thank Jose Guzman, Simon Hippenmeyer, and Tim Vogels for critically reading the manuscript, Jozsef Csicsvari for useful discussions, Florian Marr for technical assistance, and Eleftheria Kralli-Beller for manuscript editing. This research was supported by the Scientific Services Units (SSUs) of ISTA: the preclinical facility (PCF) provided housing and breeding of the animals, the imaging and optics facility (IOF) offered technical training and state of the art equipment, the Miba machine shop contributed to the construction and maintenance of multicellular recording setups, and the scientific computing unit helped with the large-scale simulations. The project received funding from the European Union’s Horizon 2020 research and innovation programme (ERC Advanced Grants No 692692 GIANTSYN and 101199096 CA3-SYNGRAM to P.J.; Marie Skłodowska-Curie Grant 754411 to V.V.B.; Marie Skłodowska-Curie Grant 101026635 to J.F.W.), the Fond zur Förderung der Wissenschaftlichen Forschung (P 36232-B, PAT4178023, and 10.55776/CoE16 to P.J.), and the Nomis Foundation (fellowship to A.N.-O.). V.V.B. received funding from a CONACyT fellowship (289638).","date_updated":"2026-07-01T06:47:49Z","has_accepted_license":"1","month":"06","das_tickbox":"1","file_date_updated":"2026-07-01T06:46:06Z","oa_version":"Published Version","article_type":"original","oa":1,"article_processing_charge":"Yes","abstract":[{"lang":"eng","text":"Hippocampal CA3 pyramidal neurons (PNs) form the largest autoassociative network in the mammalian brain. Whether CA3–CA3 recurrent connectivity is genetically preconfigured or environmentally shaped during ongoing memory storage is currently unknown. To address this question, we performed multicellular patch-clamp-based circuit mapping of up to eight CA3 PNs in the mouse hippocampus at multiple postnatal time points (P7–8, P18–25, and P45–50). Here, we show that the hippocampal CA3 network undergoes a developmental transformation from local, dense, and random connectivity to a distributed, sparse, and structured configuration. Thus, sparse and structured connectivity may emerge via experience-dependent mechanisms. In parallel, the strength of single synapses is downregulated; single synaptic events are sufficient to trigger postsynaptic spiking early in development, whereas spatial summation of several inputs is required at later time points. Biologically inspired models of memory storage by Hebbian synaptic plasticity and retrieval via pattern completion suggest that developmental changes improve specific aspects of memory storage and retrieval. Our results imply a developmental transformation of the neuronal code and the memory functions in the hippocampal CA3 network.</jats:p>"}],"doi":"10.1038/s41467-026-71914-x","_id":"22229","external_id":{"pmid":["42014695"]},"author":[{"id":"2F55A9DE-F248-11E8-B48F-1D18A9856A87","last_name":"Vargas Barroso","full_name":"Vargas Barroso, Victor M","first_name":"Victor M"},{"first_name":"Jake","full_name":"Watson, Jake","orcid":"0000-0002-8698-3823","id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson"},{"last_name":"Navas Olivé","id":"739d26c9-52e8-11ee-8d72-f14d3893b4ce","first_name":"Andrea C","orcid":"0000-0002-9280-8597","full_name":"Navas Olivé, Andrea C"},{"id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","first_name":"Alois"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","first_name":"Peter M","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804"}],"publication_status":"published","publisher":"Springer Nature","day":"23","project":[{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692"},{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","grant_number":"101199096"},{"name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"754411"},{"call_identifier":"H2020","grant_number":"101026635","_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","name":"Synaptic computations of the hippocampal CA3 circuitry"},{"name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","grant_number":"P36232"},{"grant_number":"PAT 4178023","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","name":"Synaptic networks of human brain"},{"name":"Reglas de Conectividad funcional en el hipocampo","_id":"26366136-B435-11E9-9278-68D0E5697425"}],"ec_funded":1,"ddc":["570"],"supplementarymaterial":"yes"},{"PlanS_conform":"1","date_published":"2026-06-01T00:00:00Z","page":"411-439","arxiv":1,"intvolume":"         8","OA_place":"publisher","publication_identifier":{"eissn":["2577-0187"]},"department":[{"_id":"MaMo"}],"mathsc":["62E20","62J05","62J12"],"researchdata_availability":"no","status":"public","volume":8,"citation":{"ista":"Zhang Y, Mondelli M, Venkataramanan R. 2026. Precise asymptotics for spectral methods in mixed generalized linear models. SIAM Journal on Mathematics of Data Science. 8(2), 411–439.","short":"Y. Zhang, M. Mondelli, R. Venkataramanan, SIAM Journal on Mathematics of Data Science 8 (2026) 411–439.","ama":"Zhang Y, Mondelli M, Venkataramanan R. Precise asymptotics for spectral methods in mixed generalized linear models. <i>SIAM Journal on Mathematics of Data Science</i>. 2026;8(2):411-439. doi:<a href=\"https://doi.org/10.1137/24m1702854\">10.1137/24m1702854</a>","mla":"Zhang, Yihan, et al. “Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models.” <i>SIAM Journal on Mathematics of Data Science</i>, vol. 8, no. 2, Society for Industrial &#38; Applied Mathematics, 2026, pp. 411–39, doi:<a href=\"https://doi.org/10.1137/24m1702854\">10.1137/24m1702854</a>.","ieee":"Y. Zhang, M. Mondelli, and R. Venkataramanan, “Precise asymptotics for spectral methods in mixed generalized linear models,” <i>SIAM Journal on Mathematics of Data Science</i>, vol. 8, no. 2. Society for Industrial &#38; Applied Mathematics, pp. 411–439, 2026.","apa":"Zhang, Y., Mondelli, M., &#38; Venkataramanan, R. (2026). Precise asymptotics for spectral methods in mixed generalized linear models. <i>SIAM Journal on Mathematics of Data Science</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/24m1702854\">https://doi.org/10.1137/24m1702854</a>","chicago":"Zhang, Yihan, Marco Mondelli, and Ramji Venkataramanan. “Precise Asymptotics for Spectral Methods in Mixed Generalized Linear Models.” <i>SIAM Journal on Mathematics of Data Science</i>. Society for Industrial &#38; Applied Mathematics, 2026. <a href=\"https://doi.org/10.1137/24m1702854\">https://doi.org/10.1137/24m1702854</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":"1","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_created":"2026-06-30T13:03:41Z","publication":"SIAM Journal on Mathematics of Data Science","corr_author":"1","title":"Precise asymptotics for spectral methods in mixed generalized linear models","file":[{"success":1,"file_id":"22230","access_level":"open_access","creator":"dernst","checksum":"5cfd350dc64d1476063e959316dbff65","file_name":"2026_SIAMJourmathDataScience_Zhang.pdf","file_size":1210346,"relation":"main_file","content_type":"application/pdf","date_updated":"2026-07-01T06:22:15Z","date_created":"2026-07-01T06:22:15Z"}],"language":[{"iso":"eng"}],"type":"journal_article","year":"2026","issue":"2","acknowledgement":"The first and second authors were partially supported by the 2019 Lopez-Loreta prize.","OA_type":"hybrid","month":"06","has_accepted_license":"1","date_updated":"2026-07-01T06:29:52Z","oa_version":"Published Version","file_date_updated":"2026-07-01T06:22:15Z","keyword":["spectral estimator","generalized linear models","mixed regression","high-dimensional asymptotics","random matrix theory","approximate message passing (AMP)"],"das_tickbox":"0","oa":1,"article_type":"original","doi":"10.1137/24m1702854","abstract":[{"text":"In a mixed generalized linear model, the goal is to learn multiple signals from unlabeled observations: each sample comes from exactly one signal, but it is not known which one. We consider the prototypical problem of estimating two statistically independent signals in a mixed generalized linear model with Gaussian covariates. Spectral methods are a popular class of estimators which output the top two eigenvectors of a suitable data-dependent matrix. However, despite the wide applicability, their design is still obtained via heuristic considerations, and the number of samples 𝑛 needed to guarantee recovery is superlinear in the signal dimension 𝑑. In this paper, we develop exact asymptotics on spectral methods in the challenging proportional regime in which 𝑛,𝑑 grow large and their ratio converges to a finite constant. This allows us optimize the design of the spectral method, and combine it with a simple linear estimator, to minimize the estimation error. Our characterization exploits a mix of tools from random matrices, free probability, and the theory of approximate message passing algorithms. Numerical simulations for mixed linear regression and phase retrieval demonstrate the advantage enabled by our analysis over existing designs of spectral methods.","lang":"eng"}],"article_processing_charge":"Yes (in subscription journal)","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"day":"01","_id":"22228","publication_status":"published","author":[{"last_name":"Zhang","full_name":"Zhang, Yihan","first_name":"Yihan"},{"id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco","orcid":"0000-0002-3242-7020"},{"last_name":"Venkataramanan","full_name":"Venkataramanan, Ramji","first_name":"Ramji"}],"external_id":{"arxiv":["2211.11368"]},"publisher":"Society for Industrial & Applied Mathematics","supplementarymaterial":"no","ddc":["000"]},{"tmp":{"name":"GNU General Public License 3.0","short":"GPL 3.0","legal_code_url":"https://www.gnu.org/licenses/gpl-3.0.en.html"},"_id":"21442","author":[{"first_name":"Alois","orcid":"0000-0002-5621-8100","full_name":"Schlögl, Alois","last_name":"Schlögl","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2026-03-12T08:20:46Z","publisher":"Institute of Science and Technology Austria","project":[{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","grant_number":"101199096"},{"grant_number":"P36232","name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5"},{"grant_number":"PAT 4178023","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","name":"Synaptic networks of human brain"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692"}],"day":"12","related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"22229"}]},"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","citation":{"apa":"Schlögl, A. (2026). CA3Simu v1.06 (vargas2026v1). Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>","ieee":"A. Schlögl, “CA3Simu v1.06 (vargas2026v1).” Institute of Science and Technology Austria, 2026.","chicago":"Schlögl, Alois. “CA3Simu v1.06 (Vargas2026v1).” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>.","short":"A. Schlögl, (2026).","ista":"Schlögl A. 2026. CA3Simu v1.06 (vargas2026v1), Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","mla":"Schlögl, Alois. <i>CA3Simu v1.06 (Vargas2026v1)</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","ama":"Schlögl A. CA3Simu v1.06 (vargas2026v1). 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>"},"doi":"10.15479/AT-ISTA-21442","status":"public","year":"2026","type":"software","file":[{"relation":"main_file","file_size":160410,"checksum":"441c8827717dcda05f91c127d15cf1e9","file_name":"ca3simu-vargas2026v1.tar.gz","date_updated":"2026-03-12T08:19:14Z","date_created":"2026-03-12T08:19:14Z","content_type":"application/gzip","access_level":"open_access","file_id":"21443","success":1,"creator":"schloegl"},{"checksum":"3c0092076228a15c0a7ae703192d43ea","file_name":"README.md","relation":"main_file","file_size":10923,"content_type":"text/markdown","date_updated":"2026-03-12T10:24:45Z","date_created":"2026-03-12T10:24:45Z","success":1,"file_id":"21445","access_level":"open_access","creator":"schloegl"}],"ec_funded":1,"corr_author":"1","title":"CA3Simu v1.06 (vargas2026v1)","has_accepted_license":"1","date_updated":"2026-07-01T06:47:49Z","month":"03","date_published":"2026-03-12T00:00:00Z","department":[{"_id":"ScienComp"},{"_id":"PeJo"}],"oa":1,"file_date_updated":"2026-03-12T10:24:45Z","keyword":["hypocampus","ca3 simulations","modelling"]},{"day":"08","extern":"1","_id":"22096","publisher":"Springer Nature","author":[{"first_name":"B.","full_name":"Harrop-Griffiths, B.","last_name":"Harrop-Griffiths"},{"last_name":"Killip","first_name":"R.","full_name":"Killip, R."},{"full_name":"Visan, Monica","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan"}],"external_id":{"arxiv":["2506.23868"]},"publication_status":"published","abstract":[{"text":"We prove uniform-in-time a priori Hs bounds for solutions to the intermediate longwave equation\r\nposed both on the line and on the circle, covering the range −1\r\n2 < s ≤ 0. Additionally, we prove that the\r\nset of orbits emanating from a bounded and equicontinuous set in Hs is also bounded and equicontinuous\r\nin Hs . Our proof is based on the identification of a suitable Lax pair formulation for the intermediate long\r\nwave equation.","lang":"eng"}],"article_processing_charge":"No","doi":"10.1007/s00028-026-01228-4","oa":1,"article_type":"original","das_tickbox":"1","oa_version":"Preprint","month":"06","date_updated":"2026-07-02T06:02:36Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2506.23868"}],"OA_type":"green","year":"2026","type":"journal_article","issue":"3","title":"A priori bounds and equicontinuity of orbits for the intermediate long wave equation","publication":"Journal of Evolution Equations","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","date_created":"2026-06-19T08:58:33Z","volume":26,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"B. Harrop-Griffiths, R. Killip, and M. Vişan, “A priori bounds and equicontinuity of orbits for the intermediate long wave equation,” <i>Journal of Evolution Equations</i>, vol. 26, no. 3. Springer Nature, 2026.","apa":"Harrop-Griffiths, B., Killip, R., &#38; Vişan, M. (2026). A priori bounds and equicontinuity of orbits for the intermediate long wave equation. <i>Journal of Evolution Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00028-026-01228-4\">https://doi.org/10.1007/s00028-026-01228-4</a>","chicago":"Harrop-Griffiths, B., R. Killip, and Monica Vişan. “A Priori Bounds and Equicontinuity of Orbits for the Intermediate Long Wave Equation.” <i>Journal of Evolution Equations</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00028-026-01228-4\">https://doi.org/10.1007/s00028-026-01228-4</a>.","ista":"Harrop-Griffiths B, Killip R, Vişan M. 2026. A priori bounds and equicontinuity of orbits for the intermediate long wave equation. Journal of Evolution Equations. 26(3), 81.","short":"B. Harrop-Griffiths, R. Killip, M. Vişan, Journal of Evolution Equations 26 (2026).","ama":"Harrop-Griffiths B, Killip R, Vişan M. A priori bounds and equicontinuity of orbits for the intermediate long wave equation. <i>Journal of Evolution Equations</i>. 2026;26(3). doi:<a href=\"https://doi.org/10.1007/s00028-026-01228-4\">10.1007/s00028-026-01228-4</a>","mla":"Harrop-Griffiths, B., et al. “A Priori Bounds and Equicontinuity of Orbits for the Intermediate Long Wave Equation.” <i>Journal of Evolution Equations</i>, vol. 26, no. 3, 81, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s00028-026-01228-4\">10.1007/s00028-026-01228-4</a>."},"publication_identifier":{"eissn":["1424-3202"],"issn":["1424-3199"]},"OA_place":"repository","intvolume":"        26","article_number":"81","date_published":"2026-06-08T00:00:00Z","arxiv":1}]