[{"month":"02","status":"public","acknowledgement":"We thank Malgorzata Borczyk for creating the gene burden scores. We thank Robin Beaumont, Amedeo Roberto Esposito, Gareth Hawkes, Philip Schniter, Matthew Stephens, Pragya Sur, Peter Visscher, Michael Weedon, and Harry Wright for providing valuable suggestions and comments on earlier versions of the work. This project was funded by a Lopez-Loreta Prize to M.M., an SNSF Eccellenza Grant to M.R.R. (PCEGP3-181181), an ERC Starting Grant to M.M. (INF2, project number 101161364), and core funding from ISTA. High-performance computing was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We would like to acknowledge the participants and investigators of the UK Biobank study. We gratefully acknowledge the All of Us participants for their contributions, without whom this research would not have been possible. We also thank the National Institutes of Health All of Us Research Program for making available the participant data (and/or samples and/or cohort) examined in this study.","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_updated":"2026-07-14T09:41:44Z","year":"2026","day":"18","DOAJ_listed":"1","publication_identifier":{"eissn":["2666-979X"]},"language":[{"iso":"eng"}],"corr_author":"1","oa_version":"Published Version","publication":"Cell Genomics","has_accepted_license":"1","department":[{"_id":"MaMo"},{"_id":"MaRo"}],"article_number":"101162","ddc":["000","570"],"OA_type":"gold","title":"Joint modeling of whole-genome sequencing data for human height via approximate message passing","OA_place":"publisher","related_material":{"record":[{"id":"22258","status":"for_moderation","relation":"dissertation_contains"}],"link":[{"url":"https://ista.ac.at/en/news/big-data-and-human-height/","relation":"press_release","description":"News on ISTA website"}]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2026-03-23T15:10:03Z","project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits"},{"name":"Improving estimation and prediction of common complex disease risk","grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A"}],"author":[{"id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","full_name":"Depope, Al","last_name":"Depope","first_name":"Al"},{"id":"b995e25b-8c4b-11ed-a6d8-f71b7bcd6122","full_name":"Bajzik, Jakub","first_name":"Jakub","last_name":"Bajzik"},{"orcid":"0000-0002-3242-7020","first_name":"Marco","last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","last_name":"Robinson","full_name":"Robinson, Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"}],"_id":"21488","abstract":[{"text":"Human height is a model for the genetic analysis of complex traits, and recent studies suggest the presence of thousands of common genetic variant associations and hundreds of low-frequency/rare variants. Here, we develop a new algorithmic paradigm based on approximate message passing (genomic vector approximate message passing [gVAMP]) for identifying DNA sequence variants associated with complex traits and common diseases in large-scale whole-genome sequencing (WGS) data. We show that gVAMP accurately localizes associations to variants with the correct frequency and position in the DNA, outperforming existing fine-mapping methods in selecting the appropriate genetic variants within WGS data. We then apply gVAMP to jointly model the relationship of tens of millions of WGS variants with human height in hundreds of thousands of UK Biobank individuals. We identify 59 rare variants and gene burden scores alongside many hundreds of DNA regions containing common variant associations and show that understanding the genetic basis of complex traits will require the joint analysis of hundreds of millions of variables measured on millions of people. The polygenic risk scores obtained from gVAMP have high accuracy (including a prediction accuracy of ∼46% for human height) and outperform current methods for downstream tasks such as mixed linear model association testing across 13 UK Biobank traits. In conclusion, gVAMP offers a scalable foundation for a wider range of analyses in WGS data.","lang":"eng"}],"article_type":"original","citation":{"mla":"Depope, Al, et al. “Joint Modeling of Whole-Genome Sequencing Data for Human Height via Approximate Message Passing.” Cell Genomics, 101162, Elsevier, 2026, doi:10.1016/j.xgen.2026.101162.","ama":"Depope A, Bajzik J, Mondelli M, Robinson MR. Joint modeling of whole-genome sequencing data for human height via approximate message passing. Cell Genomics. 2026. doi:10.1016/j.xgen.2026.101162","ieee":"A. Depope, J. Bajzik, M. Mondelli, and M. R. Robinson, “Joint modeling of whole-genome sequencing data for human height via approximate message passing,” Cell Genomics. Elsevier, 2026.","apa":"Depope, A., Bajzik, J., Mondelli, M., & Robinson, M. R. (2026). Joint modeling of whole-genome sequencing data for human height via approximate message passing. Cell Genomics. Elsevier. https://doi.org/10.1016/j.xgen.2026.101162","chicago":"Depope, Al, Jakub Bajzik, Marco Mondelli, and Matthew Richard Robinson. “Joint Modeling of Whole-Genome Sequencing Data for Human Height via Approximate Message Passing.” Cell Genomics. Elsevier, 2026. https://doi.org/10.1016/j.xgen.2026.101162.","ista":"Depope A, Bajzik J, Mondelli M, Robinson MR. 2026. Joint modeling of whole-genome sequencing data for human height via approximate message passing. Cell Genomics., 101162.","short":"A. Depope, J. Bajzik, M. Mondelli, M.R. Robinson, Cell Genomics (2026)."},"article_processing_charge":"Yes","date_published":"2026-02-18T00:00:00Z","doi":"10.1016/j.xgen.2026.101162","oa":1,"publisher":"Elsevier","quality_controlled":"1","publication_status":"epub_ahead","type":"journal_article","main_file_link":[{"url":"https://doi.org/10.1016/j.xgen.2026.101162","open_access":"1"}]},{"status":"public","month":"01","extern":"1","arxiv":1,"mathsc":["05D10","05C55"],"page":"85-138","date_updated":"2026-07-14T09:53:07Z","year":"2026","day":"01","publication_identifier":{"issn":["0303-1179","2492-5926"]},"language":[{"iso":"eng"}],"publication":"Astérisque","oa_version":"Preprint","scopus_import":"1","external_id":{"arxiv":["2411.09321"]},"OA_type":"green","title":"Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe)","OA_place":"repository","author":[{"first_name":"Yuval","last_name":"Wigderson","full_name":"Wigderson, Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-29T12:02:59Z","_id":"22184","abstract":[{"lang":"eng","text":"Ramsey's theorem states that if N\r\n is sufficiently large, then no matter how one colors the edges among N\r\n vertices with two colors, there are always k\r\n vertices spanning edges in only one color. Given this theorem, it is natural to ask \"how large is sufficiently large?\" Ramsey's original proof showed that N=k!\r\n is sufficient, and five years later Erdős and Szekeres improved this bound to N=4^k\r\n. And then progress stalled for almost 90 years.\r\n\r\nIn this survey, I present the history of the problem, and discuss some of the ideas used in the recent breakthrough of Campos–Griffiths–Morris–Sahasrabudhe, who proved that N=3.993^k\r\n is sufficient. In addition, I discuss the subsequent work of Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, and Tiba, who gave an alternative, and more conceptual, proof."},{"lang":"fre","text":"Le théorème de Ramsey stipule que si N\r\n est suffisamment grand, alors quelle que soit la manière dont l'on colore les arêtes entre N\r\n sommets avec deux couleurs, il y a toujours k\r\n sommets dont les arêtes ne sont colorées que d'une seule couleur. Compte tenu de ce théorème, il est naturel de se demander \"À quel point N\r\n doit être grand ?\" La preuve originale de Ramsey a montré que N=k!\r\n suffit, et cinq ans plus tard, Erdős et Szekeres ont amélioré cette borne à N=4k\r\n. Puis le progrès s'est arrêté pendant près de 90 ans.\r\n\r\nDans cet exposé, je présente l'histoire du problème et je discute certaines idées utilisées dans la percée récente de Campos--Griffiths-Morris--Sahasrabudhe, qui ont prouvé que N=3,993k\r\n suffit. De plus, je discute le travail suivant de Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, et Tiba, qui ont donné une preuve alternative et plus conceptuelle."}],"article_type":"original","citation":{"ieee":"Y. Wigderson, “Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe),” Astérisque. Societe Mathematique de France, pp. 85–138, 2026.","mla":"Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” Astérisque, Societe Mathematique de France, 2026, pp. 85–138, doi:10.24033/ast.1255.","ama":"Wigderson Y. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque. 2026:85-138. doi:10.24033/ast.1255","ista":"Wigderson Y. 2026. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque., 85–138.","short":"Y. Wigderson, Astérisque (2026) 85–138.","apa":"Wigderson, Y. (2026). Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque. Societe Mathematique de France. https://doi.org/10.24033/ast.1255","chicago":"Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” Astérisque. Societe Mathematique de France, 2026. https://doi.org/10.24033/ast.1255."},"date_published":"2026-01-01T00:00:00Z","article_processing_charge":"No","quality_controlled":"1","doi":"10.24033/ast.1255","publisher":"Societe Mathematique de France","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2411.09321 "}],"type":"journal_article","publication_status":"published"},{"language":[{"iso":"eng"}],"publication":"Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms","oa_version":"Preprint","scopus_import":"1","year":"2026","conference":{"name":"SODA: Symposium on Discrete Algorithms","start_date":"2026-01-11","end_date":"2026-01-14","location":"Vancouver, Canada"},"day":"07","publication_identifier":{"eisbn":["9781611978971"],"eissn":["1557-9468"],"issn":["1071-9040"]},"volume":2026,"date_updated":"2026-07-14T11:45:11Z","status":"public","acknowledgement":"Funded by the European union. Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council Executive Agency. Neither the European Union nor the granting authority can be held responsible for them. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","month":"01","arxiv":1,"page":"613-663","quality_controlled":"1","oa":1,"doi":"10.1137/1.9781611978971.25","publisher":"Society for Industrial and Applied Mathematics","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2512.13105"}],"publication_status":"published","type":"conference","_id":"21720","abstract":[{"lang":"eng","text":"We present an exact fully-dynamic minimum cut algorithm that runs in 𝑛𝑜(1) deterministic update time when the minimum cut size is at most 2Θ(log3/4−𝑐𝑛) for any 𝑐 >0, improving on the previous algorithm of Jin, Sun, and Thorup (SODA 2024) whose minimum cut size limit is (log𝑛)𝑜(1). Combined with graph sparsification, we obtain the first (1 +𝜖)-approximate fully-dynamic minimum cut algorithm on weighted graphs, for any 𝜖 ≥2−Θ(log3/4−𝑐𝑛), in 𝑛𝑜(1) randomized update time.\r\nOur main technical contribution is a deterministic local minimum cut algorithm, which replaces the randomized LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025)."}],"ec_funded":1,"citation":{"chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, 2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25.","apa":"El-Hayek, A., Henzinger, M., & Li, J. (2026). Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms (Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978971.25","short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2026, pp. 613–663.","ista":"El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms vol. 2026, 613–663.","ama":"El-Hayek A, Henzinger M, Li J. Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25","mla":"El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time,” in Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms, Vancouver, Canada, 2026, vol. 2026, pp. 613–663."},"date_published":"2026-01-07T00:00:00Z","article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","id":"22281","status":"for_moderation"}]},"OA_type":"green","title":"Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time","OA_place":"repository","author":[{"orcid":"0000-0003-4268-7368","first_name":"Antoine","last_name":"El-Hayek","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H"},{"full_name":"Li, Jason","last_name":"Li","first_name":"Jason"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-04-12T22:01:51Z","project":[{"grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"department":[{"_id":"MoHe"},{"_id":"GradSch"}],"external_id":{"arxiv":["2512.13105"]},"intvolume":" 2026"},{"PlanS_conform":"1","status":"public","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).","month":"06","dataavailabilitystatement":"The cryo and room-temperature crystal structures of GB1QDD are deposited at the PDB under the access codes 9I2I and 9T8Z, respectively. The solid-state NMR backbone assignment of GB1QDD is deposited at the BMRB under the access code 53330. NMR spectra, analysis scripts and raw data are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-20641)120. Files to reproduce the enhanced-sampling MD simulations are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-21145)121.","date_updated":"2026-07-14T14:00:54Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"supplementarymaterial":"yes","das_tickbox":"1","year":"2026","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"researchdata_availability":"yes","day":"10","publication_identifier":{"issn":["17554330"],"eissn":["17554349"]},"language":[{"iso":"eng"}],"corr_author":"1","publication":"Nature Chemistry","oa_version":"Published Version","scopus_import":"1","department":[{"_id":"PaSc"},{"_id":"LifeSc"}],"has_accepted_license":"1","ddc":["540"],"external_id":{"pmid":["42271006"]},"related_material":{"record":[{"relation":"research_data","status":"public","id":"20641"},{"status":"public","id":"21145","relation":"research_data"},{"relation":"dissertation_contains","status":"for_moderation","id":"22334"}]},"OA_type":"hybrid","title":"Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes","OA_place":"publisher","author":[{"full_name":"Becker, Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","orcid":"0000-0002-6401-5151","first_name":"Lea Marie","last_name":"Becker"},{"last_name":"Fu","first_name":"Haohao","full_name":"Fu, Haohao"},{"full_name":"Tatman, Benjamin","id":"71cda2f3-e604-11ee-a1df-da10587eda3f","last_name":"Tatman","first_name":"Benjamin"},{"full_name":"Dreydoppel, Matthias","first_name":"Matthias","last_name":"Dreydoppel"},{"full_name":"Kapitonova, Anna","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","first_name":"Anna","last_name":"Kapitonova"},{"first_name":"Daniel","last_name":"Balazs","orcid":"0000-0001-7597-043X","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","full_name":"Balazs, Daniel"},{"first_name":"Ulrich","last_name":"Weininger","full_name":"Weininger, Ulrich"},{"last_name":"Engilberge","first_name":"Sylvain","full_name":"Engilberge, Sylvain"},{"last_name":"Chipot","first_name":"Christophe","full_name":"Chipot, Christophe"},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"26777","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0","name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches"}],"date_created":"2026-06-21T22:03:01Z","_id":"22105","abstract":[{"text":"Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein–protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope 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.","lang":"eng"}],"pmid":1,"citation":{"ieee":"L. M. Becker et al., “Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes,” Nature Chemistry. Springer Nature, 2026.","mla":"Becker, Lea Marie, et al. “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Nature Chemistry, Springer Nature, 2026, doi:10.1038/s41557-026-02155-0.","ama":"Becker LM, Fu H, Tatman B, et al. Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. Nature Chemistry. 2026. doi:10.1038/s41557-026-02155-0","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.","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).","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.” Nature Chemistry. Springer Nature, 2026. https://doi.org/10.1038/s41557-026-02155-0.","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. Nature Chemistry. Springer Nature. https://doi.org/10.1038/s41557-026-02155-0"},"article_type":"original","date_published":"2026-06-10T00:00:00Z","article_processing_charge":"Yes (via OA deal)","quality_controlled":"1","oa":1,"doi":"10.1038/s41557-026-02155-0","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1038/s41557-026-02155-0"}],"type":"journal_article","publication_status":"epub_ahead"},{"publication_identifier":{"eissn":["2699-0016"]},"DOAJ_listed":"1","day":"16","year":"2026","acknowledged_ssus":[{"_id":"NMR"},{"_id":"LifeSc"}],"scopus_import":"1","oa_version":"Published Version","publication":"Magnetic Resonance","language":[{"iso":"eng"}],"corr_author":"1","page":"29-37","month":"04","acknowledgement":"We thank Ben P. Tatman for insightful discussions. This research was supported by the Scientific Service Units (SSUs) of ISTA through resources provided by the Nuclear Magnetic Resonance Facility and the Lab Support Facility. We thank Prof. Tobias Madl (Medical University Graz) for a sample of Omniscan. Lea M. Becker is the recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01).","PlanS_conform":"1","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":7,"date_updated":"2026-07-14T14:00:54Z","date_published":"2026-04-16T00:00:00Z","article_processing_charge":"Yes","article_type":"original","citation":{"short":"L.M. Becker, G. Toscano, A. Kapitonova, R. Singh, U. Guillerm, R.J. Lichtenecker, P. Schanda, Magnetic Resonance 7 (2026) 29–37.","ista":"Becker LM, Toscano G, Kapitonova A, Singh R, Guillerm U, Lichtenecker RJ, Schanda P. 2026. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. Magnetic Resonance. 7(1), 29–37.","chicago":"Becker, Lea Marie, Giorgia Toscano, Anna Kapitonova, Rajkumar Singh, Undina Guillerm, Roman J. Lichtenecker, and Paul Schanda. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” Magnetic Resonance. Copernicus Publications, 2026. https://doi.org/10.5194/mr-7-29-2026.","apa":"Becker, L. M., Toscano, G., Kapitonova, A., Singh, R., Guillerm, U., Lichtenecker, R. J., & Schanda, P. (2026). Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. Magnetic Resonance. Copernicus Publications. https://doi.org/10.5194/mr-7-29-2026","ieee":"L. M. Becker et al., “Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants,” Magnetic Resonance, vol. 7, no. 1. Copernicus Publications, pp. 29–37, 2026.","ama":"Becker LM, Toscano G, Kapitonova A, et al. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants. Magnetic Resonance. 2026;7(1):29-37. doi:10.5194/mr-7-29-2026","mla":"Becker, Lea Marie, et al. “Accelerated 19F Biomolecular Magic-Angle Spinning NMR with Paramagnetic Dopants.” Magnetic Resonance, vol. 7, no. 1, Copernicus Publications, 2026, pp. 29–37, doi:10.5194/mr-7-29-2026."},"pmid":1,"abstract":[{"lang":"eng","text":"The advantageous characteristics attributed to the 19F nucleus have made it a popular target for nuclear magnetic resonance (NMR) once again in recent years. Aside from solution NMR, an increasing number of studies have been conducted applying solid-state magic-angle spinning (MAS) NMR to fluorine-labelled samples. Here, the high chemical shift anisotropy and strong dipolar couplings can be utilised to get structural insights into proteins and measure long distances. Despite increasing popularity and promising benefits, the sensitivity of biomolecular 19F MAS NMR often suffers from slow longitudinal T1 relaxation and therefore long recycle delays. In this work, we expand paramagnetic doping, an approach commonly used to reduce proton T1 relaxation times, to 19F-labelled biological samples. We study the effect of Gd(DTPA) and Gd(DTPA-BMA) on 19F T1 and T2, and 13C T1 and T2 relaxation in a [5-19F13C]-tryptophan-labelled protein via 19F-detected MAS NMR experiments. The observed paramagnetic relaxation enhancement substantially reduces measurement times of 19F MAS NMR experiments without compromising resolution. Additionally, we report the chemical shift assignments of all four fluorotryptophan signals in the 12×39 kDa-large protein TET2 using a mutagenesis approach."}],"_id":"21777","publication_status":"published","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5194/mr-7-29-2026"}],"doi":"10.5194/mr-7-29-2026","publisher":"Copernicus Publications","oa":1,"quality_controlled":"1","intvolume":" 7","external_id":{"pmid":["42057802"]},"ddc":["540"],"has_accepted_license":"1","department":[{"_id":"PaSc"},{"_id":"GradSch"}],"date_created":"2026-05-03T22:01:36Z","project":[{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"},{"name":"Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches","grant_number":"26777","_id":"7be609c4-9f16-11ee-852c-85015ce2b9b0"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","author":[{"full_name":"Becker, Lea Marie","id":"36336939-eb97-11eb-a6c2-c83f1214ca79","orcid":"0000-0002-6401-5151","first_name":"Lea Marie","last_name":"Becker"},{"full_name":"Toscano, Giorgia","id":"334a5e40-8747-11f0-b671-ba1f5154b4b4","first_name":"Giorgia","last_name":"Toscano"},{"full_name":"Kapitonova, Anna","id":"9fb2a840-89e1-11ee-a8b7-cc5c7ba62471","last_name":"Kapitonova","first_name":"Anna"},{"last_name":"Singh","first_name":"Rajkumar","id":"a3089acd-6806-11ee-bacc-f0c7d500ad20","full_name":"Singh, Rajkumar"},{"first_name":"Undina","last_name":"Guillerm","full_name":"Guillerm, Undina","id":"bb74f472-ae54-11eb-9835-bc9c22fb1183"},{"first_name":"Roman J.","last_name":"Lichtenecker","full_name":"Lichtenecker, Roman J."},{"id":"7B541462-FAF6-11E9-A490-E8DFE5697425","full_name":"Schanda, Paul","first_name":"Paul","last_name":"Schanda","orcid":"0000-0002-9350-7606"}],"OA_type":"gold","title":"Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants","OA_place":"publisher","related_material":{"record":[{"id":"22334","status":"for_moderation","relation":"dissertation_contains"}]}},{"month":"09","status":"public","das_tickbox":"0","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2026-06-22T08:57:41Z","volume":343,"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]},"day":"08","conference":{"start_date":"2025-08-16","name":"ITC: Information Theoretic Cryptography","end_date":"2025-08-17","location":"Santa Barbara, CA, United States"},"year":"2025","scopus_import":"1","oa_version":"Published Version","publication":"6th Conference on Information-Theoretic Cryptography","language":[{"iso":"eng"}],"corr_author":"1","external_id":{"cryptoeprintid":["2025/723"]},"intvolume":" 343","ddc":["000"],"cryptoeprintid":1,"article_number":"4:1-4:10","has_accepted_license":"1","department":[{"_id":"KrPi"}],"alternative_title":["LIPIcs"],"date_created":"2026-06-14T22:01:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pengxiang","last_name":"Wang","full_name":"Wang, Pengxiang"}],"OA_place":"publisher","title":"Time-space tradeoffs of truncation with preprocessing","OA_type":"gold","file":[{"access_level":"open_access","date_updated":"2026-06-22T08:54:32Z","date_created":"2026-06-22T08:54:32Z","relation":"main_file","file_id":"22118","success":1,"checksum":"3f791b03df26853342855a9d9581cb58","file_size":772046,"content_type":"application/pdf","creator":"dernst","file_name":"2025_LIPIcs_Pietrzak.pdf"}],"date_published":"2025-09-08T00:00:00Z","article_processing_charge":"Yes","citation":{"apa":"Pietrzak, K. Z., & Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In 6th Conference on Information-Theoretic Cryptography (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2025.4","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In 6th Conference on Information-Theoretic Cryptography, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITC.2025.4.","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ista":"Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing. 6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic Cryptography, LIPIcs, vol. 343, 4:1-4:10.","ama":"Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: 6th Conference on Information-Theoretic Cryptography. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.ITC.2025.4","mla":"Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” 6th Conference on Information-Theoretic Cryptography, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ITC.2025.4.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in 6th Conference on Information-Theoretic Cryptography, Santa Barbara, CA, United States, 2025, vol. 343."},"keyword":["Time-Space Lower Bounds","Blockchains"],"abstract":[{"lang":"eng","text":"Truncation of cryptographic outputs is a technique that was recently introduced in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try out many inputs to some cryptographic algorithm until the output (e.g. a public-key or some hash value) falls into some sparse set and thus can be compressed: by trying out an expected 2^k different inputs one will find an output that starts with k zeros.\r\nUsing such truncation one can for example save substantial gas fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi et al., 2022] show that truncation preserves the security of the underlying primitive, they only consider a setting without preprocessing. In this work we show that lower bounds on the time-space tradeoff for inverting random functions and permutations also hold with truncation, except for parameters ranges where the bound fails to hold for \"trivial\" reasons.\r\nConcretely, it’s known that any algorithm that inverts a random function or permutation with range N making T queries and using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no longer holds in the truncated setting where one must only invert a challenge from a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges, which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query.\r\nWe show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog N lower bound applies."}],"file_date_updated":"2026-06-22T08:54:32Z","_id":"22007","publication_status":"published","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa":1,"doi":"10.4230/LIPIcs.ITC.2025.4","quality_controlled":"1"},{"publication":"Communications of the American Mathematical Society","oa_version":"Published Version","scopus_import":"1","language":[{"iso":"eng"}],"day":"23","publication_identifier":{"issn":["2692-3688"]},"year":"2025","das_tickbox":"1","date_updated":"2026-06-22T11:21:09Z","volume":5,"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)"},"arxiv":1,"page":"284-320","status":"public","month":"06","extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.12334"}],"publication_status":"published","type":"journal_article","quality_controlled":"1","publisher":"American Mathematical Society","doi":"10.1090/cams/48","oa":1,"article_type":"original","citation":{"short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320.","ista":"Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. 5(7), 284–320.","chicago":"Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” Communications of the American Mathematical Society. American Mathematical Society, 2025. https://doi.org/10.1090/cams/48.","apa":"Killip, R., Laurens, T., & Vişan, M. (2025). Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/cams/48","ieee":"R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for continuum Calogero–Moser models on the line,” Communications of the American Mathematical Society, vol. 5, no. 7. American Mathematical Society, pp. 284–320, 2025.","ama":"Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. 2025;5(7):284-320. doi:10.1090/cams/48","mla":"Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” Communications of the American Mathematical Society, vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:10.1090/cams/48."},"article_processing_charge":"No","date_published":"2025-06-23T00:00:00Z","_id":"22032","abstract":[{"text":"We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton.","lang":"eng"}],"author":[{"last_name":"Killip","first_name":"Rowan","full_name":"Killip, Rowan"},{"last_name":"Laurens","first_name":"Thierry","full_name":"Laurens, Thierry"},{"last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"issue":"7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-19T07:42:34Z","OA_place":"publisher","title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","OA_type":"diamond","ddc":["500"],"external_id":{"arxiv":["2311.12334"]},"intvolume":" 5","has_accepted_license":"1"},{"date_updated":"2026-06-22T13:00:14Z","volume":311,"das_tickbox":"1","status":"public","month":"07","extern":"1","arxiv":1,"language":[{"iso":"eng"}],"publication":"Mathematische Zeitschrift","oa_version":"Preprint","scopus_import":"1","year":"2025","day":"24","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","OA_type":"green","OA_place":"repository","author":[{"full_name":"Fan, Chenjie","last_name":"Fan","first_name":"Chenjie"},{"full_name":"Killip, Rowan","first_name":"Rowan","last_name":"Killip"},{"last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica"},{"full_name":"Zhao, Zehua","last_name":"Zhao","first_name":"Zehua"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-19T07:44:05Z","article_number":"21","intvolume":" 311","external_id":{"arxiv":["2403.09989"]},"quality_controlled":"1","doi":"10.1007/s00209-025-03821-8","publisher":"Springer Nature","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"type":"journal_article","publication_status":"published","_id":"22036","abstract":[{"text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.","lang":"eng"}],"article_type":"original","citation":{"ieee":"C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical nonlinear Schrödinger equation,” Mathematische Zeitschrift, vol. 311. Springer Nature, 2025.","ama":"Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 2025;311. doi:10.1007/s00209-025-03821-8","mla":"Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” Mathematische Zeitschrift, vol. 311, 21, Springer Nature, 2025, doi:10.1007/s00209-025-03821-8.","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","chicago":"Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” Mathematische Zeitschrift. Springer Nature, 2025. https://doi.org/10.1007/s00209-025-03821-8.","apa":"Fan, C., Killip, R., Vişan, M., & Zhao, Z. (2025). Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. Springer Nature. https://doi.org/10.1007/s00209-025-03821-8"},"article_processing_charge":"No","date_published":"2025-07-24T00:00:00Z"},{"quality_controlled":"1","oa":1,"publisher":"Cambridge University Press","doi":"10.1017/prm.2024.7","publication_status":"published","type":"journal_article","_id":"12311","file_date_updated":"2025-12-30T06:45:47Z","abstract":[{"lang":"eng","text":"In this note, we prove a formula for the cancellation exponent kv,n between division polynomials ψn and ϕn associated with a sequence {nP}n∈N of points on an elliptic curve E defined over a discrete valuation field K. The formula greatly generalizes the previously known special cases and treats also the case of non-standard Kodaira types for non-perfect residue fields."}],"keyword":["Elliptic curves","Néron models","division polynomials","height functions","discrete valuation rings"],"ec_funded":1,"article_type":"original","citation":{"mla":"Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.” Proceedings of the Royal Society of Edinburgh Section A: Mathematics, vol. 155, no. 5, Cambridge University Press, 2025, pp. 1646–60, doi:10.1017/prm.2024.7.","ama":"Naskręcki B, Verzobio M. Common valuations of division polynomials. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 2025;155(5):1646-1660. doi:10.1017/prm.2024.7","ieee":"B. Naskręcki and M. Verzobio, “Common valuations of division polynomials,” Proceedings of the Royal Society of Edinburgh Section A: Mathematics, vol. 155, no. 5. Cambridge University Press, pp. 1646–1660, 2025.","chicago":"Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.” Proceedings of the Royal Society of Edinburgh Section A: Mathematics. Cambridge University Press, 2025. https://doi.org/10.1017/prm.2024.7.","apa":"Naskręcki, B., & Verzobio, M. (2025). Common valuations of division polynomials. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. Cambridge University Press. https://doi.org/10.1017/prm.2024.7","ista":"Naskręcki B, Verzobio M. 2025. Common valuations of division polynomials. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 155(5), 1646–1660.","short":"B. Naskręcki, M. Verzobio, Proceedings of the Royal Society of Edinburgh Section A: Mathematics 155 (2025) 1646–1660."},"date_published":"2025-10-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","file":[{"relation":"main_file","date_created":"2025-12-30T06:45:47Z","file_id":"20878","access_level":"open_access","date_updated":"2025-12-30T06:45:47Z","file_name":"2025_ProceedingsRoyalSocEdinburghA_Naskrecki.pdf","checksum":"c5ec6e29aca2fb4533cb95fac409a0b2","success":1,"file_size":477624,"content_type":"application/pdf","creator":"dernst"}],"isi":1,"OA_type":"hybrid","title":"Common valuations of division polynomials","OA_place":"publisher","author":[{"full_name":"Naskręcki, Bartosz","first_name":"Bartosz","last_name":"Naskręcki"},{"orcid":"0000-0002-0854-0306","first_name":"Matteo","last_name":"Verzobio","full_name":"Verzobio, Matteo","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb"}],"issue":"5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-01-16T11:45:22Z","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"department":[{"_id":"TiBr"}],"has_accepted_license":"1","ddc":["510"],"external_id":{"arxiv":["2203.02015"],"isi":["001174907100001"]},"intvolume":" 155","language":[{"iso":"eng"}],"corr_author":"1","publication":"Proceedings of the Royal Society of Edinburgh Section A: Mathematics","oa_version":"Published Version","scopus_import":"1","year":"2025","day":"01","publication_identifier":{"eissn":["1473-7124"],"issn":["0308-2105"]},"volume":155,"date_updated":"2025-12-30T06:46:17Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"PlanS_conform":"1","status":"public","acknowledgement":"Silverman, and Paul Voutier for the comments on the earlier version of this paper. The first author acknowledges the support by Dioscuri programme initiated by the Max Planck Society, jointly managed with the National Science Centre (Poland), and mutually funded by the Polish Ministry of Science and Higher Education and the German Federal Ministry of Education and Research. The second author has been supported by MIUR (Italy) through PRIN 2017 ‘Geometric, algebraic and analytic methods in arithmetic’ and has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","month":"10","arxiv":1,"page":"1646-1660"},{"publication_status":"published","type":"journal_article","publisher":"Springer Nature","oa":1,"doi":"10.1007/s00521-024-10616-1","quality_controlled":"1","article_type":"original","citation":{"ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 24669–24683.","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","chicago":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” Neural Computing and Applications. Springer Nature, 2025. https://doi.org/10.1007/s00521-024-10616-1.","apa":"Súkeník, P., & Lampert, C. (2025). Generalization in multi-objective machine learning. Neural Computing and Applications. Springer Nature. https://doi.org/10.1007/s00521-024-10616-1","ieee":"P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” Neural Computing and Applications, vol. 37. Springer Nature, pp. 24669–24683, 2025.","mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” Neural Computing and Applications, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:10.1007/s00521-024-10616-1.","ama":"Súkeník P, Lampert C. Generalization in multi-objective machine learning. Neural Computing and Applications. 2025;37:24669–24683. doi:10.1007/s00521-024-10616-1"},"article_processing_charge":"Yes (via OA deal)","date_published":"2025-10-01T00:00:00Z","_id":"12662","file_date_updated":"2025-12-30T06:39:11Z","abstract":[{"text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2023-02-20T08:23:06Z","author":[{"full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","last_name":"Súkeník","first_name":"Peter"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"}],"title":"Generalization in multi-objective machine learning","OA_place":"publisher","OA_type":"hybrid","file":[{"access_level":"open_access","date_updated":"2025-12-30T06:39:11Z","file_id":"20877","date_created":"2025-12-30T06:39:11Z","relation":"main_file","checksum":"61ad4591aee16b1e02daf6c164321a42","success":1,"creator":"dernst","file_size":500213,"content_type":"application/pdf","file_name":"2025_NeuralCompApplic_Sukenik.pdf"}],"external_id":{"arxiv":["2208.13499"]},"intvolume":" 37","ddc":["004"],"has_accepted_license":"1","department":[{"_id":"ChLa"}],"scopus_import":"1","oa_version":"Published Version","publication":"Neural Computing and Applications","corr_author":"1","language":[{"iso":"eng"}],"day":"01","publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"year":"2025","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"volume":37,"date_updated":"2025-12-30T06:39:56Z","page":"24669–24683","arxiv":1,"month":"10","PlanS_conform":"1","status":"public","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria)."},{"scopus_import":"1","oa_version":"Published Version","publication":"42nd International Conference on Machine Learning","corr_author":"1","language":[{"iso":"eng"}],"day":"01","publication_identifier":{"eissn":["2640-3498"]},"year":"2025","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-12-16T12:34:32Z","volume":267,"page":"55556-55590","arxiv":1,"month":"05","status":"public","publication_status":"published","type":"conference","oa":1,"publisher":"ML Research Press","quality_controlled":"1","citation":{"short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.","ista":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. 2025. EvoPress: Accurate dynamic model compression via evolutionary search. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 55556–55590.","chicago":"Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In 42nd International Conference on Machine Learning, 267:55556–90. ML Research Press, 2025.","apa":"Sieberling, O., Kuznedelev, D., Kurtic, E., & Alistarh, D.-A. (2025). EvoPress: Accurate dynamic model compression via evolutionary search. In 42nd International Conference on Machine Learning (Vol. 267, pp. 55556–55590). Vancouver, Canada: ML Research Press.","ieee":"O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate dynamic model compression via evolutionary search,” in 42nd International Conference on Machine Learning, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.","ama":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic model compression via evolutionary search. In: 42nd International Conference on Machine Learning. Vol 267. ML Research Press; 2025:55556-55590.","mla":"Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” 42nd International Conference on Machine Learning, vol. 267, ML Research Press, 2025, pp. 55556–90."},"article_processing_charge":"No","date_published":"2025-05-01T00:00:00Z","_id":"20820","file_date_updated":"2025-12-16T12:32:40Z","abstract":[{"lang":"eng","text":"The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the \"importance\" of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["PMLR"],"date_created":"2025-12-14T23:02:05Z","author":[{"last_name":"Sieberling","first_name":"Oliver","full_name":"Sieberling, Oliver"},{"last_name":"Kuznedelev","first_name":"Denis","full_name":"Kuznedelev, Denis"},{"first_name":"Eldar","last_name":"Kurtic","full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"}],"OA_type":"gold","title":"EvoPress: Accurate dynamic model compression via evolutionary search","OA_place":"publisher","file":[{"file_name":"2025_ICML_Sieberling.pdf","success":1,"checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","content_type":"application/pdf","creator":"dernst","file_size":908379,"relation":"main_file","date_created":"2025-12-16T12:32:40Z","file_id":"20828","access_level":"open_access","date_updated":"2025-12-16T12:32:40Z"}],"external_id":{"arxiv":["2410.14649"]},"intvolume":" 267","ddc":["000"],"has_accepted_license":"1","department":[{"_id":"DaAl"}]},{"citation":{"apa":"Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos, K., Alistarh, D.-A., & Cevher, V. (2025). Layer-wise quantization for quantized optimistic dual averaging. In 42nd International Conference on Machine Learning (Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.","chicago":"Nguyen, Anh Duc, Ilia Markov, Frank Zhengqing Wu, Ali Ramezani-Kebrya, Kimon Antonakopoulos, Dan-Adrian Alistarh, and Volkan Cevher. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” In 42nd International Conference on Machine Learning, 267:46026–72. ML Research Press, 2025.","ista":"Nguyen AD, Markov I, Wu FZ, Ramezani-Kebrya A, Antonakopoulos K, Alistarh D-A, Cevher V. 2025. Layer-wise quantization for quantized optimistic dual averaging. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 46026–46072.","short":"A.D. Nguyen, I. Markov, F.Z. Wu, A. Ramezani-Kebrya, K. Antonakopoulos, D.-A. Alistarh, V. Cevher, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 46026–46072.","mla":"Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” 42nd International Conference on Machine Learning, vol. 267, ML Research Press, 2025, pp. 46026–72.","ama":"Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic dual averaging. In: 42nd International Conference on Machine Learning. Vol 267. ML Research Press; 2025:46026-46072.","ieee":"A. D. Nguyen et al., “Layer-wise quantization for quantized optimistic dual averaging,” in 42nd International Conference on Machine Learning, Vancouver, Canada, 2025, vol. 267, pp. 46026–46072."},"date_published":"2025-05-01T00:00:00Z","article_processing_charge":"No","_id":"20821","file_date_updated":"2025-12-16T12:45:41Z","abstract":[{"lang":"eng","text":"Modern deep neural networks exhibit heterogeneity across numerous layers of various types such as residuals, multi-head attention, etc., due to varying structures (dimensions, activation functions, etc.), distinct representation characteristics, which impact predictions. We develop a general layer-wise quantization framework with tight variance and code-length bounds, adapting to the heterogeneities over the course of training. We then apply a new layer-wise quantization technique within distributed variational inequalities (VIs), proposing a novel Quantized Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which achieves competitive convergence rates for monotone VIs. We empirically show that QODA achieves up to a 150% speedup over the baselines in end-to-end training time for training Wasserstein GAN on 12+GPUs."}],"publication_status":"published","type":"conference","quality_controlled":"1","oa":1,"publisher":"ML Research Press","ddc":["000"],"external_id":{"arxiv":["2505.14371"]},"intvolume":" 267","department":[{"_id":"DaAl"}],"has_accepted_license":"1","author":[{"full_name":"Nguyen, Anh Duc","last_name":"Nguyen","first_name":"Anh Duc"},{"first_name":"Ilia","last_name":"Markov","full_name":"Markov, Ilia","id":"D0CF4148-C985-11E9-8066-0BDEE5697425"},{"full_name":"Wu, Frank Zhengqing","last_name":"Wu","first_name":"Frank Zhengqing"},{"full_name":"Ramezani-Kebrya, Ali","last_name":"Ramezani-Kebrya","first_name":"Ali"},{"first_name":"Kimon","last_name":"Antonakopoulos","full_name":"Antonakopoulos, Kimon"},{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cevher","first_name":"Volkan","full_name":"Cevher, Volkan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-12-14T23:02:06Z","alternative_title":["PMLR"],"project":[{"_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","grant_number":"101158077","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning"}],"file":[{"access_level":"open_access","date_updated":"2025-12-16T12:45:41Z","file_id":"20830","date_created":"2025-12-16T12:45:41Z","relation":"main_file","checksum":"a7edf0e4304171a3e035842b3aab1704","success":1,"file_size":756213,"creator":"dernst","content_type":"application/pdf","file_name":"2025_ICML_Nguyen.pdf"}],"OA_type":"gold","OA_place":"publisher","title":"Layer-wise quantization for quantized optimistic dual averaging","day":"01","publication_identifier":{"eissn":["2640-3498"]},"conference":{"location":"Vancouver, Canada","end_date":"2025-07-19","start_date":"2025-07-13","name":"ICML: International Conference on Machine Learning"},"year":"2025","oa_version":"Published Version","publication":"42nd International Conference on Machine Learning","scopus_import":"1","language":[{"iso":"eng"}],"arxiv":1,"page":"46026-46072","status":"public","acknowledgement":"This work was supported by Hasler Foundation Program: Hasler Responsible AI (project number 21043). The research was also sponsored by the Army Research Office and was accomplished under Grant Number W911NF-24-1-0048. This work was further funded by the Swiss National Science Foundation (SNSF) under grant number 200021_205011. We also acknowledge project A11 of the Swiss National Supercomputing Centre (CSCS) for providing computing resources. Dan Alistarh and Ilia Markov were supported in part through the ERC Proofof-Concept grant FastML (Grant Agreement 101158077). Ali Ramezani-Kebrya was supported by the Research Council of Norway through FRIPRO Grant under project number 356103, its Centres of Excellence scheme, Integreat - Norwegian Centre for knowledge-driven machine learning under\r\nproject number 332645 - and its Centre for Research-based Innovation funding scheme (Visual Intelligence under grant no. 309439).","month":"05","volume":267,"date_updated":"2025-12-16T12:46:54Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"scopus_import":"1","publication":"Journal of Fractal Geometry","oa_version":"Published Version","corr_author":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2308-1317"],"issn":["2308-1309"]},"day":"07","DOAJ_listed":"1","year":"2025","date_updated":"2026-06-18T18:26:33Z","month":"11","status":"public","publication_status":"epub_ahead","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4171/jfg/177"}],"oa":1,"doi":"10.4171/jfg/177","publisher":"EMS Press","quality_controlled":"1","date_published":"2025-11-07T00:00:00Z","article_processing_charge":"Yes","article_type":"original","citation":{"short":"M. Helfter, Journal of Fractal Geometry (2025).","ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","chicago":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” Journal of Fractal Geometry. EMS Press, 2025. https://doi.org/10.4171/jfg/177.","apa":"Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry. EMS Press. https://doi.org/10.4171/jfg/177","ieee":"M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” Journal of Fractal Geometry. EMS Press, 2025.","ama":"Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry. 2025. doi:10.4171/jfg/177","mla":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” Journal of Fractal Geometry, EMS Press, 2025, doi:10.4171/jfg/177."},"abstract":[{"lang":"eng","text":"For every couple of Hausdorff functions ψ and φ verifying some mild assumptions, there exists a compact subset K of the Baire space such that the φ-Hausdorff measure and the ψ-packing measure on K are both finite and positive. Such examples are then embedded in any infinite dimensional Banach space to answer positively a question of Fan on the existence of metric spaces with arbitrary scales."}],"_id":"20839","date_created":"2025-12-19T10:15:37Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Mathieu","last_name":"Helfter","id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57","full_name":"Helfter, Mathieu"}],"OA_type":"gold","OA_place":"publisher","title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","ddc":["500"],"department":[{"_id":"VaKa"}]},{"has_accepted_license":"1","contributor":[{"first_name":"Pere","last_name":"Rosello"},{"last_name":"Mekonnen","first_name":"Manuel"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","contributor_type":"supervisor","first_name":"Onur","last_name":"Hosten"}],"month":"12","status":"public","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","project":[{"_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907","name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics"}],"date_created":"2025-12-21T14:23:50Z","author":[{"id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","full_name":"Agafonova, Sofya","first_name":"Sofya","last_name":"Agafonova","orcid":"0000-0003-0582-2946"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","file":[{"relation":"main_file","date_created":"2025-12-22T13:45:30Z","file_id":"20854","date_updated":"2025-12-22T13:45:30Z","access_level":"open_access","file_name":"AllData.zip","content_type":"application/x-zip-compressed","file_size":146656591,"creator":"sagafono","success":1,"checksum":"7af34e4226a00cdcb7f154272050e217"},{"success":1,"checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","content_type":"application/x-zip-compressed","creator":"sagafono","file_size":93470129,"file_name":"SourceData.zip","access_level":"open_access","date_updated":"2025-12-22T13:45:33Z","file_id":"20855","date_created":"2025-12-22T13:45:33Z","relation":"main_file"},{"file_id":"20856","date_created":"2025-12-22T13:51:09Z","relation":"main_file","date_updated":"2025-12-22T13:51:09Z","access_level":"open_access","file_name":"readme.txt","creator":"sagafono","file_size":461,"content_type":"text/plain","success":1,"checksum":"08facd1b4a102f83e4d99d48a85b258d"}],"related_material":{"record":[{"id":"20840","status":"public","relation":"used_in_publication"}]},"date_updated":"2026-06-10T08:36:07Z","citation":{"apa":"Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20842","chicago":"Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20842.","short":"S. Agafonova, (2025).","ista":"Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-20842.","ama":"Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” 2025. doi:10.15479/AT-ISTA-20842","mla":"Agafonova, Sofia. Research Data for: “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.” Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20842.","ieee":"S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface.’” Institute of Science and Technology Austria, 2025."},"day":"22","date_published":"2025-12-22T00:00:00Z","article_processing_charge":"No","_id":"20842","year":"2025","abstract":[{"lang":"eng","text":"Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240~microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface."}],"file_date_updated":"2025-12-22T13:51:09Z","type":"research_data","oa_version":"Published Version","doi":"10.15479/AT-ISTA-20842","oa":1,"publisher":"Institute of Science and Technology Austria","corr_author":"1"},{"department":[{"_id":"KrPi"}],"intvolume":" 16271","OA_place":"repository","OA_type":"green","title":"Space-deniable proofs","author":[{"first_name":"Jesko","last_name":"Dujmovic","full_name":"Dujmovic, Jesko"},{"full_name":"Günther, Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","first_name":"Christoph Ullrich","last_name":"Günther"},{"orcid":"0000-0002-9139-1654","last_name":"Pietrzak","first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"project":[{"name":"Security and Privacy by Design for Complex Systems","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","grant_number":"F8509"}],"alternative_title":["LNCS"],"date_created":"2025-12-21T23:01:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We introduce and construct a new proof system called Non-interactive Arguments of Knowledge or Space (NArKoS), where a space-bounded prover can convince a verifier they know a secret, while having access to sufficient space allows one to forge indistinguishable proofs without the secret.\r\nAn application of NArKoS are space-deniable proofs, which are proofs of knowledge (say for authentication in access control) that are sound when executed by a lightweight device like a smart-card or an RFID chip that cannot have much storage, but are deniable (in the strong sense of online deniability) as the verifier, like a card reader, can efficiently forge such proofs.\r\nWe construct NArKoS in the random oracle model using an OR-proof combining a sigma protocol (for the proof of knowledge of the secret) with a new proof system called simulatable Proof of Transient Space (simPoTS). We give two different constructions of simPoTS, one based on labelling graphs with high pebbling complexity, a technique used in the construction of memory-hard functions and proofs of space, and a more practical construction based on the verifiable space-hard functions from TCC’24 where a prover must compute a root of a sparse polynomial. In both cases, the main challenge is making the proofs efficiently simulatable."}],"_id":"20844","article_processing_charge":"No","date_published":"2025-12-05T00:00:00Z","citation":{"short":"J. Dujmovic, C.U. Günther, K.Z. Pietrzak, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 171–202.","ista":"Dujmovic J, Günther CU, Pietrzak KZ. 2025. Space-deniable proofs. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16271, 171–202.","apa":"Dujmovic, J., Günther, C. U., & Pietrzak, K. Z. (2025). Space-deniable proofs. In 23rd International Conference on Theory of Cryptography (Vol. 16271, pp. 171–202). Aarhus, Denmark: Springer Nature. https://doi.org/10.1007/978-3-032-12290-2_6","chicago":"Dujmovic, Jesko, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Space-Deniable Proofs.” In 23rd International Conference on Theory of Cryptography, 16271:171–202. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-12290-2_6.","ieee":"J. Dujmovic, C. U. Günther, and K. Z. Pietrzak, “Space-deniable proofs,” in 23rd International Conference on Theory of Cryptography, Aarhus, Denmark, 2025, vol. 16271, pp. 171–202.","ama":"Dujmovic J, Günther CU, Pietrzak KZ. Space-deniable proofs. In: 23rd International Conference on Theory of Cryptography. Vol 16271. Springer Nature; 2025:171-202. doi:10.1007/978-3-032-12290-2_6","mla":"Dujmovic, Jesko, et al. “Space-Deniable Proofs.” 23rd International Conference on Theory of Cryptography, vol. 16271, Springer Nature, 2025, pp. 171–202, doi:10.1007/978-3-032-12290-2_6."},"quality_controlled":"1","oa":1,"publisher":"Springer Nature","doi":"10.1007/978-3-032-12290-2_6","main_file_link":[{"url":"https://eprint.iacr.org/2025/1723","open_access":"1"}],"type":"conference","publication_status":"published","acknowledgement":"Jesko Dujmovic: Funded by the European Union (ERC, LACONIC, 101041207). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them.\r\nChristoph U. Günther and Krzysztof Pietrzak: This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","status":"public","month":"12","page":"171-202","date_updated":"2025-12-29T11:44:16Z","volume":16271,"year":"2025","conference":{"location":"Aarhus, Denmark","end_date":"2025-12-05","name":"TCC: Theory of Cryptography","start_date":"2025-12-01"},"publication_identifier":{"isbn":["9783032122896"],"issn":["0302-9743"],"eissn":["1611-3349"]},"day":"05","corr_author":"1","language":[{"iso":"eng"}],"publication":"23rd International Conference on Theory of Cryptography","oa_version":"Preprint","scopus_import":"1"},{"oa_version":"Preprint","publication":"23rd International Conference on Theory of Cryptography","scopus_import":"1","language":[{"iso":"eng"}],"day":"05","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032122926"],"eissn":["1611-3349"]},"conference":{"end_date":"2025-12-05","name":"TCC: Theory of Cryptography","start_date":"2025-12-01","location":"Aarhus, Denmark"},"year":"2025","volume":16269,"date_updated":"2025-12-29T11:51:13Z","page":"259-290","status":"public","acknowledgement":"We thank Rachel Lin for expressing concern about the applicability of “HJL-style” attacks [15] on the construction in [2] during a talk by the first author about [2]. This was the starting point of the investigation that led us to develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for sharing his rationale for introducing evasive LWE.\r\nThe first author is supported by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship. The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras during which the collaboration was initiated. The 4th author is partly supported by JST CREST Grant Number JPMJCR22M1.","month":"12","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/375"}],"type":"conference","publication_status":"published","quality_controlled":"1","doi":"10.1007/978-3-032-12293-3_9","oa":1,"publisher":"Springer Nature","citation":{"ista":"Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive and circular evasive LWE. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290.","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","apa":"Agrawal, S., Modi, A., Yadav, A., & Yamada, S. (2025). Zeroizing attacks against evasive and circular evasive LWE. In 23rd International Conference on Theory of Cryptography (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer Nature. https://doi.org/10.1007/978-3-032-12293-3_9","chicago":"Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” In 23rd International Conference on Theory of Cryptography, 16269:259–90. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-12293-3_9.","ieee":"S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive and circular evasive LWE,” in 23rd International Conference on Theory of Cryptography, Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.","mla":"Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” 23rd International Conference on Theory of Cryptography, vol. 16269, Springer Nature, 2025, pp. 259–90, doi:10.1007/978-3-032-12293-3_9.","ama":"Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular evasive LWE. In: 23rd International Conference on Theory of Cryptography. Vol 16269. Springer Nature; 2025:259-290. doi:10.1007/978-3-032-12293-3_9"},"article_processing_charge":"No","date_published":"2025-12-05T00:00:00Z","_id":"20845","abstract":[{"lang":"eng","text":"We develop new attacks against the Evasive LWE family of assumptions, in both the public and private-coin regime. To the best of our knowledge, ours are the first attacks against Evasive LWE in the public-coin regime, for any instantiation from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption. This assumption has been popularly considered as a safe, public-coin instance of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10, 11]).\r\nWe provide the first attack against this assumption, challenging the widely held belief that this is a public-coin assumption.\r\n2. We demonstrate a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural parameter regime. Our attack crucially relies on the error in the pre-condition being larger than the error in the post-condition, necessitating a refinement of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal, Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against the assumption stated in the first posting of their work (subsequently refined to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently to [4]) provides a construction of obfuscation for pseudorandom functionalities by relying on private-coin evasive LWE. We provide a new attack against their stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived, “self-referential” classes of pseudorandom functionalities for which pseudorandom obfuscation cannot exist. We extend their techniques to develop an analogous result for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed to specifically avoid “zeroizing attacks”, our work shows that in certain settings, such attacks can still apply."}],"author":[{"full_name":"Agrawal, Shweta","first_name":"Shweta","last_name":"Agrawal"},{"last_name":"Modi","first_name":"Anuja","full_name":"Modi, Anuja"},{"id":"dc8f1524-403e-11ee-bf07-9649ad996e21","full_name":"Yadav, Anshu","last_name":"Yadav","first_name":"Anshu"},{"full_name":"Yamada, Shota","first_name":"Shota","last_name":"Yamada"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-12-21T23:01:33Z","alternative_title":["LNCS"],"title":"Zeroizing attacks against evasive and circular evasive LWE","OA_type":"green","OA_place":"repository","intvolume":" 16269","department":[{"_id":"KrPi"}]},{"language":[{"iso":"eng"}],"corr_author":"1","scopus_import":"1","publication":"23rd International Conference on Theory of Cryptography","oa_version":"Preprint","conference":{"start_date":"2025-12-01","name":"TCC: Theory of Cryptography","end_date":"2025-12-05","location":"Aarhus, Denmark"},"year":"2025","day":"05","publication_identifier":{"isbn":["9783032122896"],"issn":["0302-9743"],"eissn":["1611-3349"]},"date_updated":"2025-12-29T11:11:29Z","volume":16271,"month":"12","status":"public","acknowledgement":"We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","page":"478-511","oa":1,"publisher":"Springer Nature","doi":"10.1007/978-3-032-12290-2_16","quality_controlled":"1","publication_status":"published","type":"conference","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1045"}],"_id":"20846","abstract":[{"text":"CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.\r\nWe prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons.","lang":"eng"}],"citation":{"mla":"Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation and Friends.” 23rd International Conference on Theory of Cryptography, vol. 16271, Springer Nature, 2025, pp. 478–511, doi:10.1007/978-3-032-12290-2_16.","ama":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable random functions without obfuscation and friends. In: 23rd International Conference on Theory of Cryptography. Vol 16271. Springer Nature; 2025:478-511. doi:10.1007/978-3-032-12290-2_16","ieee":"N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained verifiable random functions without obfuscation and friends,” in 23rd International Conference on Theory of Cryptography, Aarhus, Denmark, 2025, vol. 16271, pp. 478–511.","chicago":"Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal, and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation and Friends.” In 23rd International Conference on Theory of Cryptography, 16271:478–511. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-12290-2_16.","apa":"Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., & Wohnig, S. (2025). Constrained verifiable random functions without obfuscation and friends. In 23rd International Conference on Theory of Cryptography (Vol. 16271, pp. 478–511). Aarhus, Denmark: Springer Nature. https://doi.org/10.1007/978-3-032-12290-2_16","ista":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained verifiable random functions without obfuscation and friends. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16271, 478–511.","short":"N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511."},"date_published":"2025-12-05T00:00:00Z","article_processing_charge":"No","OA_type":"green","title":"Constrained verifiable random functions without obfuscation and friends","OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-12-21T23:01:34Z","project":[{"name":"Security and Privacy by Design for Complex Systems","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","grant_number":"F8509"}],"alternative_title":["LNCS"],"author":[{"full_name":"Brandt, Nicholas","last_name":"Brandt","first_name":"Nicholas"},{"orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","first_name":"Miguel","full_name":"Cueto Noval, Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"last_name":"Günther","first_name":"Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","full_name":"Günther, Christoph Ullrich"},{"full_name":"Ünal, Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","first_name":"Akin","last_name":"Ünal"},{"first_name":"Stella","last_name":"Wohnig","full_name":"Wohnig, Stella"}],"department":[{"_id":"KrPi"}],"intvolume":" 16271"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"date_updated":"2025-12-29T11:19:34Z","volume":112,"arxiv":1,"month":"12","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) [Grant DOI: 10.55776/ESP298]. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nAgreement No. 949120). This research was supported by the Scientific Service Units of The Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. We wish to acknowledge the crucial contributions of Alexandre Morin in getting the project off the ground, and Jack Merrin for creating the SU-8 deposition protocol used in the construction of our\r\ncells. We also wish to thank Kimberley Modic and Hamza Nasir for their work on single-particle characterization. ","status":"public","PlanS_conform":"1","scopus_import":"1","oa_version":"Published Version","publication":"Physical Review E","language":[{"iso":"eng"}],"corr_author":"1","publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"day":"01","year":"2025","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"date_created":"2025-12-21T23:01:34Z","project":[{"name":"MixQUIckR: Mixing with QUIncke Rollers","grant_number":"E 298","_id":"bd8eede5-d553-11ed-ba76-eaded0d13485"},{"_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","grant_number":"949120","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"6","author":[{"first_name":"Eavan","last_name":"Fitzgerald","full_name":"Fitzgerald, Eavan","id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa"},{"id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8","full_name":"Clavaud, Cécile","first_name":"Cécile","last_name":"Clavaud","orcid":"0000-0002-1843-3803"},{"last_name":"Das","first_name":"Debasish","full_name":"Das, Debasish"},{"full_name":"Lenton, Isaac C","id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984","first_name":"Isaac C","last_name":"Lenton"},{"last_name":"Waitukaitis","first_name":"Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R"}],"OA_place":"publisher","OA_type":"hybrid","title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","file":[{"access_level":"open_access","date_updated":"2025-12-29T11:15:42Z","file_id":"20862","date_created":"2025-12-29T11:15:42Z","relation":"main_file","checksum":"d593e933f976c3f3cde37ad66539d57d","success":1,"content_type":"application/pdf","file_size":2131491,"creator":"dernst","file_name":"2025_PhysReviewE_Fitzgerald.pdf"}],"external_id":{"arxiv":["2508.05643"]},"intvolume":" 112","ddc":["530"],"article_number":"065418","has_accepted_license":"1","department":[{"_id":"ScWa"}],"publication_status":"published","type":"journal_article","doi":"10.1103/1ss8-31rb","oa":1,"publisher":"American Physical Society","quality_controlled":"1","article_processing_charge":"Yes (via OA deal)","date_published":"2025-12-01T00:00:00Z","citation":{"ieee":"E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter,” Physical Review E, vol. 112, no. 6. American Physical Society, 2025.","mla":"Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” Physical Review E, vol. 112, no. 6, 065418, American Physical Society, 2025, doi:10.1103/1ss8-31rb.","ama":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical Review E. 2025;112(6). doi:10.1103/1ss8-31rb","ista":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. 2025. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical Review E. 112(6), 065418.","short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","apa":"Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., & Waitukaitis, S. R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical Review E. American Physical Society. https://doi.org/10.1103/1ss8-31rb","chicago":"Fitzgerald, Eavan, Cécile Clavaud, Debasish Das, Isaac C Lenton, and Scott R Waitukaitis. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” Physical Review E. American Physical Society, 2025. https://doi.org/10.1103/1ss8-31rb."},"article_type":"original","ec_funded":1,"file_date_updated":"2025-12-29T11:15:42Z","abstract":[{"lang":"eng","text":"We report on an experimental active matter system with motion restricted to four cardinal directions. Our particles are magnetite-doped colloidal spheres driven by the Quincke electrorotational instability. The absence of a magnetic field (|𝑩|=0) leads to circular trajectories interspersed with short spontaneous runs. Intermediate fields (|𝑩|≲20mT) linearize the motion along the axis perpendicular to 𝑩. At high magnetic fields, we observe the surprising emergence of a second, distinct linearization along the axis parallel to 𝑩. With numerical simulations, we show that this behavior can be explained by anisotropic magnetic susceptibility."}],"_id":"20847"},{"date_created":"2025-12-21T23:01:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"4","author":[{"last_name":"Berg","first_name":"Jeremy J.","full_name":"Berg, Jeremy J."},{"first_name":"Xinyi","last_name":"Li","full_name":"Li, Xinyi"},{"full_name":"Riall, Kellen","first_name":"Kellen","last_name":"Riall"},{"first_name":"Laura","last_name":"Hayward","full_name":"Hayward, Laura","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b"},{"full_name":"Sella, Guy","first_name":"Guy","last_name":"Sella"}],"title":"Mutation–selection–drift balance models of complex diseases","OA_place":"publisher","OA_type":"hybrid","file":[{"date_created":"2025-12-29T11:27:51Z","relation":"main_file","file_id":"20863","access_level":"open_access","date_updated":"2025-12-29T11:27:51Z","file_name":"2025_Genetics_Berg.pdf","checksum":"b02eb6b78028b8bef435edc8435a8468","success":1,"creator":"dernst","file_size":1182339,"content_type":"application/pdf"}],"external_id":{"pmid":["41073879"]},"intvolume":" 231","ddc":["570"],"article_number":"iyaf220","has_accepted_license":"1","department":[{"_id":"NiBa"}],"publication_status":"published","type":"journal_article","publisher":"Oxford University Press","oa":1,"doi":"10.1093/genetics/iyaf220","quality_controlled":"1","article_processing_charge":"Yes (in subscription journal)","date_published":"2025-12-01T00:00:00Z","citation":{"short":"J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).","ista":"Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift balance models of complex diseases. Genetics. 231(4), iyaf220.","chicago":"Berg, Jeremy J., Xinyi Li, Kellen Riall, Laura Hayward, and Guy Sella. “Mutation–Selection–Drift Balance Models of Complex Diseases.” Genetics. Oxford University Press, 2025. https://doi.org/10.1093/genetics/iyaf220.","apa":"Berg, J. J., Li, X., Riall, K., Hayward, L., & Sella, G. (2025). Mutation–selection–drift balance models of complex diseases. Genetics. Oxford University Press. https://doi.org/10.1093/genetics/iyaf220","ieee":"J. J. Berg, X. Li, K. Riall, L. Hayward, and G. Sella, “Mutation–selection–drift balance models of complex diseases,” Genetics, vol. 231, no. 4. Oxford University Press, 2025.","ama":"Berg JJ, Li X, Riall K, Hayward L, Sella G. Mutation–selection–drift balance models of complex diseases. Genetics. 2025;231(4). doi:10.1093/genetics/iyaf220","mla":"Berg, Jeremy J., et al. “Mutation–Selection–Drift Balance Models of Complex Diseases.” Genetics, vol. 231, no. 4, iyaf220, Oxford University Press, 2025, doi:10.1093/genetics/iyaf220."},"article_type":"original","pmid":1,"file_date_updated":"2025-12-29T11:27:51Z","abstract":[{"lang":"eng","text":"Genetic variation that influences complex disease susceptibility is introduced into the population by mutation and removed by natural selection and genetic drift. This mutation–selection–drift balance (MSDB) shapes the prevalence of a disease and its genetic architecture. To date, however, MSDB has been modeled only for monogenic (Mendelian) diseases. Here, we develop an MSDB model for complex disease susceptibility: we assume that genotype relates to disease risk according to the canonical liability threshold model and that the selection on variants affecting risk stems from the fitness cost of the disease. We focus on diseases that are highly polygenic, entail a substantial fitness cost, and are neither extremely common in the population nor exceedingly rare. The comparison of model predictions with genome-wide association studies and other observations in humans indicates that common genetic variation affecting complex disease susceptibility is little affected by directional selection and instead shaped by pleiotropic stabilizing selection on other traits. In turn, directional selection may exert a more substantial effect on rare, large-effect variants. Our results also suggest that current estimates of disease heritability are likely biased. The model thus provides a better understanding of the evolutionary processes that shape the architecture and prevalence of complex diseases."}],"_id":"20848","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_updated":"2025-12-29T11:29:16Z","volume":231,"month":"12","acknowledgement":"We thank Nick Barton, Magnus Nordborg, John Novembre, Molly Przeworski, and Himani Sachdeva for many helpful discussions and for comments on the manuscript, and we thank Joshua Schraiber and 2 anonymous reviewers for comments on the manuscript. We also thank members of the Sella, Przeworski and Andolfatto labs at Columbia University, and the Berg, Novembre and Steinrücken labs at the University of Chicago, for feedback on the work at various stages. This work was completed in part with resources provided by the University of Chicago's Research Computing Center. This work was supported by National Institutes of Health F32 grant GM126787 and R35 grant GM151257 to J.J.B. and National Institutes of Health R01 grant GM115889 to G.S.","status":"public","scopus_import":"1","oa_version":"Published Version","publication":"Genetics","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"day":"01","year":"2025"},{"tmp":{"image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","short":"CC BY-ND (4.0)"},"volume":37,"date_updated":"2025-12-29T10:08:46Z","month":"11","acknowledgement":"The author would like to thank his supervisor Tim Browning for suggesting this project and many helpful conversations and useful comments. Moreover, he is grateful to Jakob Glas, Damaris Schindler, Igor Shparlinski, Matteo Verzobio, Victor Wang, Florian Wilsch and Shuntaro Yamagishi for taking their time to answer his questions and their valuable suggestions.","status":"public","page":"973-988","arxiv":1,"corr_author":"1","language":[{"iso":"eng"}],"scopus_import":"1","oa_version":"Published Version","publication":"Journal de theorie des nombres de Bordeaux","year":"2025","publication_identifier":{"eissn":["2118-8572"],"issn":["1246-7405"]},"day":"27","OA_type":"hybrid","title":"Class numbers and integer points on some Pellian surfaces","OA_place":"publisher","file":[{"content_type":"application/pdf","creator":"dernst","file_size":766196,"checksum":"67aa0afbc0b5bcbff5341f4d25e6ba20","success":1,"file_name":"2025_JTNB_Diao.pdf","date_updated":"2025-12-29T10:05:22Z","access_level":"open_access","date_created":"2025-12-29T10:05:22Z","relation":"main_file","file_id":"20861"}],"date_created":"2025-12-21T23:01:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"3","author":[{"orcid":"0000-0002-4989-5330","first_name":"Yijie","last_name":"Diao","full_name":"Diao, Yijie","id":"7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b"}],"has_accepted_license":"1","department":[{"_id":"TiBr"}],"external_id":{"arxiv":["2408.03774"]},"intvolume":" 37","ddc":["510"],"oa":1,"doi":"10.5802/jtnb.1348","publisher":"Université de Bordeaux","quality_controlled":"1","type":"journal_article","publication_status":"published","abstract":[{"lang":"eng","text":"We provide an estimate for the number of nontrivial integer points on the Pellian surface t^2 - du^2 = 1 in a bounded region. We give a lower bound on the size of fundamental solutions for almost all d in a certain class, based on a recent conjecture of Browning and Wilsch about integer points on log K3 surfaces. We also obtain an upper bound on the average of class number in this class, assuming the same conjecture."},{"text":"Nous donnons une estimation du nombre de points entiers non triviaux sur la surface pellienne \r\nt^2 - du^2 = 1 dans une région bornée. Nous établissons une borne inférieure pour la taille des solutions fondamentales pour presque tout d appartenant à une certaine classe, en nous fondant sur une conjecture récente de Browning et Wilsch concernant les points entiers sur les surfaces log K3. Nous obtenons également une borne supérieure pour la moyenne du nombre de classes dans cette classe, sous la même hypothèse conjecturale.","lang":"fre"}],"file_date_updated":"2025-12-29T10:05:22Z","_id":"20850","article_processing_charge":"Yes (in subscription journal)","date_published":"2025-11-27T00:00:00Z","article_type":"original","citation":{"short":"Y. Diao, Journal de Theorie Des Nombres de Bordeaux 37 (2025) 973–988.","ista":"Diao Y. 2025. Class numbers and integer points on some Pellian surfaces. Journal de theorie des nombres de Bordeaux. 37(3), 973–988.","chicago":"Diao, Yijie. “Class Numbers and Integer Points on Some Pellian Surfaces.” Journal de Theorie Des Nombres de Bordeaux. Université de Bordeaux, 2025. https://doi.org/10.5802/jtnb.1348.","apa":"Diao, Y. (2025). Class numbers and integer points on some Pellian surfaces. Journal de Theorie Des Nombres de Bordeaux. Université de Bordeaux. https://doi.org/10.5802/jtnb.1348","ieee":"Y. Diao, “Class numbers and integer points on some Pellian surfaces,” Journal de theorie des nombres de Bordeaux, vol. 37, no. 3. Université de Bordeaux, pp. 973–988, 2025.","ama":"Diao Y. Class numbers and integer points on some Pellian surfaces. Journal de theorie des nombres de Bordeaux. 2025;37(3):973-988. doi:10.5802/jtnb.1348","mla":"Diao, Yijie. “Class Numbers and Integer Points on Some Pellian Surfaces.” Journal de Theorie Des Nombres de Bordeaux, vol. 37, no. 3, Université de Bordeaux, 2025, pp. 973–88, doi:10.5802/jtnb.1348."}}]