[{"publication_status":"published","_id":"21896","article_type":"original","issue":"5","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"department":[{"_id":"MaIb"}],"abstract":[{"text":"Redox-mediated flow batteries boost energy density by utilizing dissolved redox species as charge carriers for solid charge-storage materials. This strategy strongly depends on the thermodynamics and kinetics between the solid booster and dissolved redox species. Conventional electrochemical methods often convolute intrinsic reactivity with mass transport effects, introducing complexity in determining limiting steps. We propose a strategy that confines solid boosters within recessed microelectrodes and employs scanning electrochemical microscopy (SECM) to estimate reaction kinetics between booster and dissolved active redox species. Confining the solid booster in the recessed microelectrode overcomes mass transport limitations of dissolved redox species and enables controlled polarization of the booster material, allowing deconvolution of key rate-determining factors. As an initial model system, Prussian blue-ferricyanide/ferrocyanide [Fe(CN)6]3−/4− was used as solid booster and dissolved redox active species, respectively. The methodology was further explored for copper hexacyanoferrate with N,N,N-2,2,6,6-heptamethylpiperidinyl oxy-4-ammonium chloride and nickel hydroxide with [Fe(CN)6]3−/4− and extended to Mn-based Prussian blue analogues in combination with organic redox species. Our results demonstrate that SECM coupled with the proposed recessed microelectrode strategy provides a powerful platform to disentangle interfacial kinetics and guide the rational design of solid booster-dissolved redox species and electrolytes for high-performance redox-mediated flow batteries.","lang":"eng"}],"PlanS_conform":"1","month":"05","date_published":"2026-05-01T00:00:00Z","has_accepted_license":"1","publication":"Batteries & Supercaps","title":"Evaluating reaction kinetics between solid booster and dissolved active species in redox‐mediated flow batteries using scanning electrochemical microscopy","article_number":"e70303","oa_version":"Published Version","das_tickbox":"1","citation":{"ieee":"C. Santana Santos et al., “Evaluating reaction kinetics between solid booster and dissolved active species in redox‐mediated flow batteries using scanning electrochemical microscopy,” Batteries & Supercaps, vol. 9, no. 5. Wiley, 2026.","apa":"Santana Santos, C., Jiyane, N., Quast, T., Ibáñez, M., Rubio‐Presa, R., Peljo, P., & Schuhmann, W. (2026). Evaluating reaction kinetics between solid booster and dissolved active species in redox‐mediated flow batteries using scanning electrochemical microscopy. Batteries & Supercaps. Wiley. https://doi.org/10.1002/batt.70303","ama":"Santana Santos C, Jiyane N, Quast T, et al. Evaluating reaction kinetics between solid booster and dissolved active species in redox‐mediated flow batteries using scanning electrochemical microscopy. Batteries & Supercaps. 2026;9(5). doi:10.1002/batt.70303","short":"C. Santana Santos, N. Jiyane, T. Quast, M. Ibáñez, R. Rubio‐Presa, P. Peljo, W. Schuhmann, Batteries & Supercaps 9 (2026).","chicago":"Santana Santos, Carla, Nomnotho Jiyane, Thomas Quast, Maria Ibáñez, Rubén Rubio‐Presa, Pekka Peljo, and Wolfgang Schuhmann. “Evaluating Reaction Kinetics between Solid Booster and Dissolved Active Species in Redox‐mediated Flow Batteries Using Scanning Electrochemical Microscopy.” Batteries & Supercaps. Wiley, 2026. https://doi.org/10.1002/batt.70303.","mla":"Santana Santos, Carla, et al. “Evaluating Reaction Kinetics between Solid Booster and Dissolved Active Species in Redox‐mediated Flow Batteries Using Scanning Electrochemical Microscopy.” Batteries & Supercaps, vol. 9, no. 5, e70303, Wiley, 2026, doi:10.1002/batt.70303.","ista":"Santana Santos C, Jiyane N, Quast T, Ibáñez M, Rubio‐Presa R, Peljo P, Schuhmann W. 2026. Evaluating reaction kinetics between solid booster and dissolved active species in redox‐mediated flow batteries using scanning electrochemical microscopy. Batteries & Supercaps. 9(5), e70303."},"quality_controlled":"1","publication_identifier":{"eissn":["2566-6223"]},"intvolume":" 9","volume":9,"OA_place":"publisher","article_processing_charge":"Yes (via OA deal)","file":[{"file_id":"21904","relation":"main_file","file_size":756344,"file_name":"2026_BatteriesSupercaps_SantanaSantos.pdf","success":1,"access_level":"open_access","checksum":"292d65503a63cc7df92b960627634dad","date_updated":"2026-05-21T06:54:57Z","content_type":"application/pdf","date_created":"2026-05-21T06:54:57Z","creator":"dernst"}],"author":[{"full_name":"Santana Santos, Carla","last_name":"Santana Santos","first_name":"Carla"},{"full_name":"Jiyane, Nomnotho","last_name":"Jiyane","first_name":"Nomnotho"},{"last_name":"Quast","first_name":"Thomas","full_name":"Quast, Thomas"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria"},{"last_name":"Rubio‐Presa","first_name":"Rubén","full_name":"Rubio‐Presa, Rubén"},{"full_name":"Peljo, Pekka","first_name":"Pekka","last_name":"Peljo"},{"last_name":"Schuhmann","first_name":"Wolfgang","full_name":"Schuhmann, Wolfgang"}],"OA_type":"hybrid","day":"01","ddc":["530"],"date_updated":"2026-07-08T06:48:01Z","acknowledgement":"The authors acknowledge funding from the European Union's Horizon Europe research and innovation programme— European Innovation Council (EIC) under the grant agreement No 101046742 (MeBattery). P.P. acknowledges the funding from the European Research Council through a Starting Grant (agreement no. 950038). Dr. Mahdi Moghaddam, University of Turku, is acknowledged for providing the CuHCF, and Prof. Hubert Girault, EPFL, is acknowledged for providing the TEMPTMA.\r\nOpen Access funding enabled and organized by Projekt DEAL.","publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","status":"public","oa":1,"year":"2026","scopus_import":"1","doi":"10.1002/batt.70303","date_created":"2026-05-20T14:32:37Z","file_date_updated":"2026-05-21T06:54:57Z","language":[{"iso":"eng"}]},{"mathsc":["05D10","05D40","05C65"],"date_created":"2026-06-29T10:47:02Z","language":[{"iso":"eng"}],"type":"journal_article","page":"1-14","scopus_import":"1","doi":"10.1017/s0963548326100443","status":"public","external_id":{"arxiv":["2507.05641"]},"oa":1,"year":"2026","day":"14","ddc":["500"],"date_updated":"2026-07-08T07:24:54Z","author":[{"last_name":"He","first_name":"Xiaoyu","full_name":"He, Xiaoyu"},{"full_name":"Nie, Jiaxi","first_name":"Jiaxi","last_name":"Nie"},{"last_name":"Wigderson","first_name":"Yuval","id":"2d0023a0-1567-11f0-833d-d5c1e476d4b5","full_name":"Wigderson, Yuval"},{"full_name":"Yu, Hung-Hsun","first_name":"Hung-Hsun","last_name":"Yu"}],"OA_type":"hybrid","publisher":"Cambridge University Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/S0963548326100443"}],"article_processing_charge":"No","OA_place":"publisher","publication_identifier":{"eissn":["1469-2163"],"issn":["0963-5483"]},"citation":{"short":"X. He, J. Nie, Y. Wigderson, H.-H. Yu, Combinatorics, Probability and Computing (2026) 1–14.","ama":"He X, Nie J, Wigderson Y, Yu H-H. Off-diagonal Ramsey numbers for linear hypergraphs. Combinatorics, Probability and Computing. 2026:1-14. doi:10.1017/s0963548326100443","apa":"He, X., Nie, J., Wigderson, Y., & Yu, H.-H. (2026). Off-diagonal Ramsey numbers for linear hypergraphs. Combinatorics, Probability and Computing. Cambridge University Press. https://doi.org/10.1017/s0963548326100443","ieee":"X. He, J. Nie, Y. Wigderson, and H.-H. Yu, “Off-diagonal Ramsey numbers for linear hypergraphs,” Combinatorics, Probability and Computing. Cambridge University Press, pp. 1–14, 2026.","ista":"He X, Nie J, Wigderson Y, Yu H-H. 2026. Off-diagonal Ramsey numbers for linear hypergraphs. Combinatorics, Probability and Computing., 1–14.","chicago":"He, Xiaoyu, Jiaxi Nie, Yuval Wigderson, and Hung-Hsun Yu. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” Combinatorics, Probability and Computing. Cambridge University Press, 2026. https://doi.org/10.1017/s0963548326100443.","mla":"He, Xiaoyu, et al. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” Combinatorics, Probability and Computing, Cambridge University Press, 2026, pp. 1–14, doi:10.1017/s0963548326100443."},"quality_controlled":"1","title":"Off-diagonal Ramsey numbers for linear hypergraphs","arxiv":1,"publication":"Combinatorics, Probability and Computing","oa_version":"Published Version","extern":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"month":"04","date_published":"2026-04-14T00:00:00Z","abstract":[{"text":"We study off-diagonal Ramsey numbers 𝑟(𝐻,𝐾(𝑘)\r\n𝑛) of 𝑘-uniform hypergraphs, where 𝐻 is a fixed linear 𝑘-uniform hypergraph and 𝐾(𝑘)\r\n𝑛 is complete on 𝑛 vertices. Recently, Conlon, Fox, Gunby, He, Mubayi, Suk, and Verstraëte disproved the folklore conjecture that 𝑟(𝐻,𝐾(3)\r\n𝑛) always grows polynomially in 𝑛. In this paper, we show that much larger growth rates are possible in higher uniformity. In uniformity 𝑘 ≥4, we prove that for any constant 𝐶 >0, there exists a linear 𝑘-uniform hypergraph 𝐻 for which\r\n\r\n𝑟(𝐻,𝐾(𝑘)\r\n𝑛)≥twr𝑘−2(2(log𝑛)𝐶).","lang":"eng"}],"publication_status":"epub_ahead","_id":"22152","article_type":"original"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Royal Society of London","acknowledgement":"This work was partly funded by an Austrian Science Foundation FWF ESPRIT fellowship (10.55776/ESP6331524) to C.B. We would like to thank the Vicoso group for their invaluable input and discussions throughout this work. We thank Filip Ruzicka for his insightful comments on the manuscript. All computational resources were provided by the Scientific Computing Unit at ISTA. This research was also supported through resources provided by the Imaging & Optics Facility (IOF) at ISTA.","author":[{"id":"20565186-803f-11ed-ab7e-96a4ff7694ef","first_name":"Carolina","orcid":"0000-0003-1945-2245","last_name":"De Castro Barbosa Rodrigues Barata","full_name":"De Castro Barbosa Rodrigues Barata, Carolina"},{"full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso"}],"OA_type":"hybrid","ddc":["570"],"day":"28","date_updated":"2026-07-08T09:17:41Z","OA_place":"publisher","file":[{"file_name":"2026_RoyalSocPubProceedingsB_Barata.pdf","success":1,"content_type":"application/pdf","date_created":"2026-02-16T09:26:02Z","creator":"dernst","access_level":"open_access","checksum":"d76afebca0a6f112df0146ae2d929f36","date_updated":"2026-02-16T09:26:02Z","file_id":"21226","relation":"main_file","file_size":2230841}],"article_processing_charge":"Yes (via OA deal)","volume":293,"language":[{"iso":"eng"}],"date_created":"2026-02-08T23:02:49Z","file_date_updated":"2026-02-16T09:26:02Z","oa":1,"year":"2026","status":"public","external_id":{"pmid":["41592777"]},"doi":"10.1098/rspb.2025.2471","scopus_import":"1","type":"journal_article","abstract":[{"text":"In many species, sex-biased expression is widespread and thought to contribute to sexual dimorphism. While bulk RNA-sequencing has been instrumental in identifying strongly sex-biased genes, it lacks resolution to assess variation across cell-types and tissue compartments. Using single-nucleus expression data from the Fly Cell Atlas, we investigate sex differences in adult Drosophila melanogaster. We find that differences in cell-type composition between the sexes are not a major source of sex-bias, as for the vast majority of genes, the degree of sex-bias is similar regardless of whether sex differences in cell-type composition are controlled for or not. Our analysis confirms a deficit of X-linked male-biased genes in the body’s somatic tissues that is widespread across cell-types. We also find the excess of X-linked female-biased genes to be associated with nervous system cells in the head but with epithelial cells in the body’s somatic tissues, showing that single-nucleus data crucially resolves sex-bias at the cell-type level. We investigate dosage compensation (DC) across 15 tissues and 17 cell-types. We observe that it varies throughout the body. Surprisingly, we observe a lack of DC in a cluster of main cells within the male accessory glands. This result highlights the importance of understanding context-dependent DC.","lang":"eng"}],"department":[{"_id":"BeVi"}],"date_published":"2026-01-28T00:00:00Z","month":"01","project":[{"_id":"90ef7108-16d5-11f0-9cad-e6e116913473","grant_number":"ESP 6331524","name":"Does genetic drift set a limit on the adaptive evolution of sex-biased expression?"}],"PlanS_conform":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"2063","article_type":"original","_id":"21161","publication_status":"published","quality_controlled":"1","citation":{"chicago":"Castro Barbosa Rodrigues Barata, Carolina de, and Beatriz Vicoso. “Single-Nucleus Resolution of Sex-Biased Expression and Dosage Compensation in Drosophila Melanogaster.” Proceedings of the Royal Society B Biological Sciences. Royal Society of London, 2026. https://doi.org/10.1098/rspb.2025.2471.","mla":"de Castro Barbosa Rodrigues Barata, Carolina, and Beatriz Vicoso. “Single-Nucleus Resolution of Sex-Biased Expression and Dosage Compensation in Drosophila Melanogaster.” Proceedings of the Royal Society B Biological Sciences, vol. 293, no. 2063, 20252471, Royal Society of London, 2026, doi:10.1098/rspb.2025.2471.","ista":"de Castro Barbosa Rodrigues Barata C, Vicoso B. 2026. Single-nucleus resolution of sex-biased expression and dosage compensation in Drosophila melanogaster. Proceedings of the Royal Society B Biological Sciences. 293(2063), 20252471.","ieee":"C. de Castro Barbosa Rodrigues Barata and B. Vicoso, “Single-nucleus resolution of sex-biased expression and dosage compensation in Drosophila melanogaster,” Proceedings of the Royal Society B Biological Sciences, vol. 293, no. 2063. Royal Society of London, 2026.","apa":"de Castro Barbosa Rodrigues Barata, C., & Vicoso, B. (2026). Single-nucleus resolution of sex-biased expression and dosage compensation in Drosophila melanogaster. Proceedings of the Royal Society B Biological Sciences. Royal Society of London. https://doi.org/10.1098/rspb.2025.2471","ama":"de Castro Barbosa Rodrigues Barata C, Vicoso B. Single-nucleus resolution of sex-biased expression and dosage compensation in Drosophila melanogaster. Proceedings of the Royal Society B Biological Sciences. 2026;293(2063). doi:10.1098/rspb.2025.2471","short":"C. de Castro Barbosa Rodrigues Barata, B. Vicoso, Proceedings of the Royal Society B Biological Sciences 293 (2026)."},"intvolume":" 293","publication_identifier":{"eissn":["1471-2954"]},"das_tickbox":"1","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"Bio"}],"article_number":"20252471","oa_version":"Published Version","publication":"Proceedings of the Royal Society B Biological Sciences","has_accepted_license":"1","corr_author":"1","pmid":1,"title":"Single-nucleus resolution of sex-biased expression and dosage compensation in Drosophila melanogaster"},{"article_processing_charge":"Yes","OA_place":"publisher","DOAJ_listed":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.xgen.2026.101162"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Elsevier","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.","day":"18","date_updated":"2026-07-10T13:27:19Z","ddc":["000","570"],"author":[{"full_name":"Depope, Al","id":"0b77531d-dbcd-11ea-9d1d-a8eee0bf3830","last_name":"Depope","first_name":"Al"},{"full_name":"Bajzik, Jakub","id":"b995e25b-8c4b-11ed-a6d8-f71b7bcd6122","first_name":"Jakub","last_name":"Bajzik"},{"full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","last_name":"Mondelli"},{"full_name":"Robinson, Matthew Richard","last_name":"Robinson","orcid":"0000-0001-8982-8813","first_name":"Matthew Richard","id":"E5D42276-F5DA-11E9-8E24-6303E6697425"}],"OA_type":"gold","doi":"10.1016/j.xgen.2026.101162","oa":1,"year":"2026","status":"public","type":"journal_article","language":[{"iso":"eng"}],"date_created":"2026-03-23T15:10:03Z","article_type":"original","_id":"21488","publication_status":"epub_ahead","date_published":"2026-02-18T00:00:00Z","month":"02","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"},{"grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf","name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits"},{"grant_number":"PCEGP3_181181","_id":"9B8D11D6-BA93-11EA-9121-9846C619BF3A","name":"Improving estimation and prediction of common complex disease risk"}],"related_material":{"link":[{"relation":"press_release","description":"News on ISTA website","url":"https://ista.ac.at/en/news/big-data-and-human-height/"}],"record":[{"id":"22258","relation":"dissertation_contains","status":"for_moderation"}]},"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"}],"department":[{"_id":"MaMo"},{"_id":"MaRo"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"oa_version":"Published Version","article_number":"101162","corr_author":"1","title":"Joint modeling of whole-genome sequencing data for human height via approximate message passing","publication":"Cell Genomics","has_accepted_license":"1","publication_identifier":{"eissn":["2666-979X"]},"quality_controlled":"1","citation":{"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.","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.","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.","short":"A. Depope, J. Bajzik, M. Mondelli, M.R. Robinson, Cell Genomics (2026).","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","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"}},{"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"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."}],"department":[{"_id":"KrPi"}],"month":"09","date_published":"2025-09-08T00:00:00Z","publication_status":"published","_id":"22007","das_tickbox":"0","quality_controlled":"1","citation":{"ista":"Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing. 6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic Cryptography, LIPIcs, vol. 343, 4:1-4:10.","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In 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.","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.","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","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.","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","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"},"intvolume":" 343","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]},"publication":"6th Conference on Information-Theoretic Cryptography","has_accepted_license":"1","corr_author":"1","title":"Time-space tradeoffs of truncation with preprocessing","article_number":"4:1-4:10","oa_version":"Published Version","OA_type":"gold","author":[{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wang, Pengxiang","last_name":"Wang","first_name":"Pengxiang"}],"ddc":["000"],"date_updated":"2026-06-22T08:57:41Z","day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","volume":343,"OA_place":"publisher","file":[{"file_name":"2025_LIPIcs_Pietrzak.pdf","success":1,"access_level":"open_access","checksum":"3f791b03df26853342855a9d9581cb58","date_updated":"2026-06-22T08:54:32Z","content_type":"application/pdf","date_created":"2026-06-22T08:54:32Z","creator":"dernst","file_id":"22118","relation":"main_file","file_size":772046}],"article_processing_charge":"Yes","date_created":"2026-06-14T22:01:45Z","keyword":["Time-Space Lower Bounds","Blockchains"],"file_date_updated":"2026-06-22T08:54:32Z","alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"type":"conference","cryptoeprintid":1,"oa":1,"year":"2025","conference":{"location":"Santa Barbara, CA, United States","start_date":"2025-08-16","name":"ITC: Information Theoretic Cryptography","end_date":"2025-08-17"},"external_id":{"cryptoeprintid":["2025/723"]},"status":"public","doi":"10.4230/LIPIcs.ITC.2025.4","scopus_import":"1"},{"author":[{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"last_name":"Laurens","first_name":"Thierry","full_name":"Laurens, Thierry"},{"full_name":"Visan, Monica","last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"OA_type":"diamond","date_updated":"2026-06-22T11:21:09Z","day":"23","ddc":["500"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"American Mathematical Society","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.12334"}],"volume":5,"OA_place":"publisher","article_processing_charge":"No","date_created":"2026-06-19T07:42:34Z","language":[{"iso":"eng"}],"page":"284-320","type":"journal_article","oa":1,"year":"2025","external_id":{"arxiv":["2311.12334"]},"status":"public","doi":"10.1090/cams/48","scopus_import":"1","extern":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"issue":"7","abstract":[{"lang":"eng","text":"We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton."}],"month":"06","date_published":"2025-06-23T00:00:00Z","publication_status":"published","article_type":"original","_id":"22032","das_tickbox":"1","quality_controlled":"1","citation":{"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.","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.","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.","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","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.","short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320."},"intvolume":" 5","publication_identifier":{"issn":["2692-3688"]},"publication":"Communications of the American Mathematical Society","has_accepted_license":"1","title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","arxiv":1,"oa_version":"Published Version"},{"type":"journal_article","doi":"10.1007/s00209-025-03821-8","scopus_import":"1","oa":1,"year":"2025","external_id":{"arxiv":["2403.09989"]},"status":"public","date_created":"2026-06-19T07:44:05Z","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"volume":311,"article_processing_charge":"No","OA_place":"repository","date_updated":"2026-06-22T13:00:14Z","day":"24","author":[{"full_name":"Fan, Chenjie","last_name":"Fan","first_name":"Chenjie"},{"full_name":"Killip, Rowan","last_name":"Killip","first_name":"Rowan"},{"last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","full_name":"Visan, Monica"},{"last_name":"Zhao","first_name":"Zehua","full_name":"Zhao, Zehua"}],"OA_type":"green","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","arxiv":1,"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","publication":"Mathematische Zeitschrift","oa_version":"Preprint","article_number":"21","das_tickbox":"1","intvolume":" 311","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"quality_controlled":"1","citation":{"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","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.","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","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","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.","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.","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."},"publication_status":"published","article_type":"original","_id":"22036","extern":"1","month":"07","date_published":"2025-07-24T00:00:00Z","abstract":[{"lang":"eng","text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3."}]},{"abstract":[{"text":"In this note, we prove a formula for the cancellation exponent kv,n between division polynomials ψn and ϕn associated with a sequence {nP}n∈N of points on an elliptic curve E defined over a discrete valuation field K. The formula greatly generalizes the previously known special cases and treats also the case of non-standard Kodaira types for non-perfect residue fields.","lang":"eng"}],"department":[{"_id":"TiBr"}],"date_published":"2025-10-01T00:00:00Z","month":"10","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"}],"PlanS_conform":"1","issue":"5","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"ec_funded":1,"article_type":"original","_id":"12311","publication_status":"published","quality_controlled":"1","isi":1,"citation":{"short":"B. Naskręcki, M. Verzobio, Proceedings of the Royal Society of Edinburgh Section A: Mathematics 155 (2025) 1646–1660.","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","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.","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","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.","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.","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."},"intvolume":" 155","publication_identifier":{"issn":["0308-2105"],"eissn":["1473-7124"]},"oa_version":"Published Version","publication":"Proceedings of the Royal Society of Edinburgh Section A: Mathematics","has_accepted_license":"1","corr_author":"1","title":"Common valuations of division polynomials","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","publisher":"Cambridge University Press","OA_type":"hybrid","author":[{"first_name":"Bartosz","last_name":"Naskręcki","full_name":"Naskręcki, Bartosz"},{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306","first_name":"Matteo","last_name":"Verzobio","full_name":"Verzobio, Matteo"}],"date_updated":"2025-12-30T06:46:17Z","day":"01","ddc":["510"],"OA_place":"publisher","file":[{"success":1,"file_name":"2025_ProceedingsRoyalSocEdinburghA_Naskrecki.pdf","date_updated":"2025-12-30T06:45:47Z","access_level":"open_access","checksum":"c5ec6e29aca2fb4533cb95fac409a0b2","creator":"dernst","date_created":"2025-12-30T06:45:47Z","content_type":"application/pdf","file_id":"20878","relation":"main_file","file_size":477624}],"article_processing_charge":"Yes (via OA deal)","volume":155,"language":[{"iso":"eng"}],"date_created":"2023-01-16T11:45:22Z","keyword":["Elliptic curves","Néron models","division polynomials","height functions","discrete valuation rings"],"file_date_updated":"2025-12-30T06:45:47Z","year":"2025","oa":1,"status":"public","external_id":{"arxiv":["2203.02015"],"isi":["001174907100001"]},"doi":"10.1017/prm.2024.7","scopus_import":"1","page":"1646-1660","type":"journal_article"},{"language":[{"iso":"eng"}],"file_date_updated":"2025-12-30T06:39:11Z","date_created":"2023-02-20T08:23:06Z","scopus_import":"1","doi":"10.1007/s00521-024-10616-1","external_id":{"arxiv":["2208.13499"]},"status":"public","oa":1,"year":"2025","type":"journal_article","page":"24669–24683","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","ddc":["004"],"date_updated":"2025-12-30T06:39:56Z","author":[{"first_name":"Peter","last_name":"Súkeník","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","file":[{"success":1,"file_name":"2025_NeuralCompApplic_Sukenik.pdf","date_updated":"2025-12-30T06:39:11Z","access_level":"open_access","checksum":"61ad4591aee16b1e02daf6c164321a42","creator":"dernst","content_type":"application/pdf","date_created":"2025-12-30T06:39:11Z","file_id":"20877","relation":"main_file","file_size":500213}],"OA_place":"publisher","volume":37,"publication_identifier":{"issn":["0941-0643"],"eissn":["1433-3058"]},"intvolume":" 37","citation":{"ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 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.","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.","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","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","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.","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"},"quality_controlled":"1","oa_version":"Published Version","title":"Generalization in multi-objective machine learning","arxiv":1,"corr_author":"1","has_accepted_license":"1","publication":"Neural Computing and Applications","PlanS_conform":"1","date_published":"2025-10-01T00:00:00Z","month":"10","department":[{"_id":"ChLa"}],"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"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"12662","article_type":"original","publication_status":"published"},{"volume":267,"OA_place":"publisher","file":[{"relation":"main_file","file_id":"20828","file_size":908379,"file_name":"2025_ICML_Sieberling.pdf","success":1,"content_type":"application/pdf","date_created":"2025-12-16T12:32:40Z","creator":"dernst","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","access_level":"open_access","date_updated":"2025-12-16T12:32:40Z"}],"article_processing_charge":"No","author":[{"last_name":"Sieberling","first_name":"Oliver","full_name":"Sieberling, Oliver"},{"full_name":"Kuznedelev, Denis","last_name":"Kuznedelev","first_name":"Denis"},{"full_name":"Kurtic, Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar","last_name":"Kurtic"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"OA_type":"gold","date_updated":"2025-12-16T12:34:32Z","day":"01","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ML Research Press","page":"55556-55590","type":"conference","conference":{"end_date":"2025-07-19","start_date":"2025-07-13","location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning"},"year":"2025","oa":1,"external_id":{"arxiv":["2410.14649"]},"status":"public","scopus_import":"1","date_created":"2025-12-14T23:02:05Z","file_date_updated":"2025-12-16T12:32:40Z","alternative_title":["PMLR"],"language":[{"iso":"eng"}],"publication_status":"published","_id":"20820","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"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."}],"department":[{"_id":"DaAl"}],"date_published":"2025-05-01T00:00:00Z","month":"05","publication":"42nd International Conference on Machine Learning","has_accepted_license":"1","corr_author":"1","title":"EvoPress: Accurate dynamic model compression via evolutionary search","arxiv":1,"oa_version":"Published Version","quality_controlled":"1","citation":{"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.","short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 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.","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.","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."},"intvolume":" 267","publication_identifier":{"eissn":["2640-3498"]}},{"month":"05","date_published":"2025-05-01T00:00:00Z","project":[{"name":"FastML: Efficient and Cost-Effective Distributed Machine Learning","grant_number":"101158077","_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161"}],"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."}],"department":[{"_id":"DaAl"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"_id":"20821","publication_status":"published","intvolume":" 267","publication_identifier":{"eissn":["2640-3498"]},"quality_controlled":"1","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.","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.","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.","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.","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."},"oa_version":"Published Version","title":"Layer-wise quantization for quantized optimistic dual averaging","arxiv":1,"publication":"42nd International Conference on Machine Learning","has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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).","publisher":"ML Research Press","ddc":["000"],"date_updated":"2025-12-16T12:46:54Z","day":"01","author":[{"last_name":"Nguyen","first_name":"Anh Duc","full_name":"Nguyen, Anh Duc"},{"first_name":"Ilia","last_name":"Markov","id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia"},{"first_name":"Frank Zhengqing","last_name":"Wu","full_name":"Wu, Frank Zhengqing"},{"first_name":"Ali","last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali"},{"full_name":"Antonakopoulos, Kimon","last_name":"Antonakopoulos","first_name":"Kimon"},{"last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian"},{"last_name":"Cevher","first_name":"Volkan","full_name":"Cevher, Volkan"}],"OA_type":"gold","file":[{"file_size":756213,"file_id":"20830","relation":"main_file","date_updated":"2025-12-16T12:45:41Z","checksum":"a7edf0e4304171a3e035842b3aab1704","access_level":"open_access","creator":"dernst","date_created":"2025-12-16T12:45:41Z","content_type":"application/pdf","success":1,"file_name":"2025_ICML_Nguyen.pdf"}],"article_processing_charge":"No","OA_place":"publisher","volume":267,"alternative_title":["PMLR"],"language":[{"iso":"eng"}],"file_date_updated":"2025-12-16T12:45:41Z","date_created":"2025-12-14T23:02:06Z","scopus_import":"1","oa":1,"conference":{"end_date":"2025-07-19","location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13"},"year":"2025","status":"public","external_id":{"arxiv":["2505.14371"]},"type":"conference","page":"46026-46072"},{"citation":{"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.","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.","ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","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","short":"M. Helfter, Journal of Fractal Geometry (2025)."},"quality_controlled":"1","publication_identifier":{"issn":["2308-1309"],"eissn":["2308-1317"]},"oa_version":"Published Version","publication":"Journal of Fractal Geometry","title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","corr_author":"1","department":[{"_id":"VaKa"}],"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."}],"date_published":"2025-11-07T00:00:00Z","month":"11","_id":"20839","article_type":"original","publication_status":"epub_ahead","language":[{"iso":"eng"}],"date_created":"2025-12-19T10:15:37Z","status":"public","oa":1,"year":"2025","scopus_import":"1","doi":"10.4171/jfg/177","type":"journal_article","publisher":"EMS Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_type":"gold","author":[{"id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57","last_name":"Helfter","first_name":"Mathieu","full_name":"Helfter, Mathieu"}],"day":"07","date_updated":"2026-06-18T18:26:33Z","ddc":["500"],"OA_place":"publisher","article_processing_charge":"Yes","DOAJ_listed":"1","main_file_link":[{"url":"https://doi.org/10.4171/jfg/177","open_access":"1"}]},{"date_created":"2025-12-21T14:23:50Z","file_date_updated":"2025-12-22T13:51:09Z","citation":{"short":"S. Agafonova, (2025).","ama":"Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” 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.","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","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.","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.","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."},"contributor":[{"last_name":"Rosello","first_name":"Pere"},{"first_name":"Manuel","last_name":"Mekonnen"},{"last_name":"Hosten","orcid":"0000-0002-2031-204X","first_name":"Onur","contributor_type":"supervisor","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"type":"research_data","has_accepted_license":"1","corr_author":"1","title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","oa":1,"year":"2025","status":"public","oa_version":"Published Version","doi":"10.15479/AT-ISTA-20842","author":[{"orcid":"0000-0003-0582-2946","first_name":"Sofya","last_name":"Agafonova","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","full_name":"Agafonova, Sofya"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"day":"22","date_updated":"2026-06-10T08:36:07Z","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."}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20840"}]},"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"publisher":"Institute of Science and Technology Austria","month":"12","date_published":"2025-12-22T00:00:00Z","project":[{"_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907","name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics"}],"file":[{"file_name":"AllData.zip","success":1,"access_level":"open_access","checksum":"7af34e4226a00cdcb7f154272050e217","date_updated":"2025-12-22T13:45:30Z","content_type":"application/x-zip-compressed","date_created":"2025-12-22T13:45:30Z","creator":"sagafono","file_id":"20854","relation":"main_file","file_size":146656591},{"file_id":"20855","relation":"main_file","file_size":93470129,"success":1,"file_name":"SourceData.zip","creator":"sagafono","content_type":"application/x-zip-compressed","date_created":"2025-12-22T13:45:33Z","date_updated":"2025-12-22T13:45:33Z","checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","access_level":"open_access"},{"file_size":461,"relation":"main_file","file_id":"20856","date_updated":"2025-12-22T13:51:09Z","checksum":"08facd1b4a102f83e4d99d48a85b258d","access_level":"open_access","creator":"sagafono","date_created":"2025-12-22T13:51:09Z","content_type":"text/plain","success":1,"file_name":"readme.txt"}],"_id":"20842","article_processing_charge":"No"},{"quality_controlled":"1","citation":{"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.","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.","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.","short":"J. Dujmovic, C.U. Günther, K.Z. Pietrzak, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 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","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"},"intvolume":" 16271","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032122896"],"issn":["0302-9743"]},"publication":"23rd International Conference on Theory of Cryptography","corr_author":"1","title":"Space-deniable proofs","oa_version":"Preprint","abstract":[{"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.","lang":"eng"}],"department":[{"_id":"KrPi"}],"month":"12","date_published":"2025-12-05T00:00:00Z","project":[{"grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","name":"Security and Privacy by Design for Complex Systems"}],"publication_status":"published","_id":"20844","date_created":"2025-12-21T23:01:33Z","alternative_title":["LNCS"],"language":[{"iso":"eng"}],"page":"171-202","type":"conference","conference":{"end_date":"2025-12-05","start_date":"2025-12-01","name":"TCC: Theory of Cryptography","location":"Aarhus, Denmark"},"year":"2025","oa":1,"status":"public","doi":"10.1007/978-3-032-12290-2_6","scopus_import":"1","OA_type":"green","author":[{"full_name":"Dujmovic, Jesko","last_name":"Dujmovic","first_name":"Jesko"},{"full_name":"Günther, Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","first_name":"Christoph Ullrich","last_name":"Günther"},{"full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2025-12-29T11:44:16Z","day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","publisher":"Springer Nature","main_file_link":[{"url":"https://eprint.iacr.org/2025/1723","open_access":"1"}],"volume":16271,"OA_place":"repository","article_processing_charge":"No"},{"alternative_title":["LNCS"],"language":[{"iso":"eng"}],"date_created":"2025-12-21T23:01:33Z","year":"2025","conference":{"location":"Aarhus, Denmark","start_date":"2025-12-01","name":"TCC: Theory of Cryptography","end_date":"2025-12-05"},"oa":1,"status":"public","doi":"10.1007/978-3-032-12293-3_9","scopus_import":"1","type":"conference","page":"259-290","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","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.","OA_type":"green","author":[{"first_name":"Shweta","last_name":"Agrawal","full_name":"Agrawal, Shweta"},{"first_name":"Anuja","last_name":"Modi","full_name":"Modi, Anuja"},{"full_name":"Yadav, Anshu","first_name":"Anshu","last_name":"Yadav","id":"dc8f1524-403e-11ee-bf07-9649ad996e21"},{"first_name":"Shota","last_name":"Yamada","full_name":"Yamada, Shota"}],"day":"05","date_updated":"2025-12-29T11:51:13Z","OA_place":"repository","article_processing_charge":"No","main_file_link":[{"url":"https://eprint.iacr.org/2025/375","open_access":"1"}],"volume":16269,"quality_controlled":"1","citation":{"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","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","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.","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","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.","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.","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."},"intvolume":" 16269","publication_identifier":{"isbn":["9783032122926"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa_version":"Preprint","publication":"23rd International Conference on Theory of Cryptography","title":"Zeroizing attacks against evasive and circular evasive LWE","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."}],"department":[{"_id":"KrPi"}],"date_published":"2025-12-05T00:00:00Z","month":"12","_id":"20845","publication_status":"published"},{"article_processing_charge":"No","OA_place":"repository","main_file_link":[{"url":"https://eprint.iacr.org/2025/1045","open_access":"1"}],"volume":16271,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","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.","date_updated":"2025-12-29T11:11:29Z","day":"05","author":[{"last_name":"Brandt","first_name":"Nicholas","full_name":"Brandt, Nicholas"},{"full_name":"Cueto Noval, Miguel","first_name":"Miguel","orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"full_name":"Günther, Christoph Ullrich","last_name":"Günther","first_name":"Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1"},{"full_name":"Ünal, Akin","last_name":"Ünal","orcid":"0000-0002-8929-0221","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a"},{"last_name":"Wohnig","first_name":"Stella","full_name":"Wohnig, Stella"}],"OA_type":"green","doi":"10.1007/978-3-032-12290-2_16","scopus_import":"1","year":"2025","oa":1,"conference":{"end_date":"2025-12-05","location":"Aarhus, Denmark","start_date":"2025-12-01","name":"TCC: Theory of Cryptography"},"status":"public","page":"478-511","type":"conference","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"date_created":"2025-12-21T23:01:34Z","_id":"20846","publication_status":"published","month":"12","date_published":"2025-12-05T00:00:00Z","project":[{"name":"Security and Privacy by Design for Complex Systems","grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1"}],"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"}],"department":[{"_id":"KrPi"}],"oa_version":"Preprint","corr_author":"1","title":"Constrained verifiable random functions without obfuscation and friends","publication":"23rd International Conference on Theory of Cryptography","intvolume":" 16271","publication_identifier":{"issn":["0302-9743"],"isbn":["9783032122896"],"eissn":["1611-3349"]},"quality_controlled":"1","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.","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.","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.","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","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.","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","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."}},{"publication_status":"published","_id":"20847","article_type":"original","ec_funded":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"6","project":[{"grant_number":"E 298","_id":"bd8eede5-d553-11ed-ba76-eaded0d13485","name":"MixQUIckR: Mixing with QUIncke Rollers"},{"_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","grant_number":"949120","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}],"PlanS_conform":"1","date_published":"2025-12-01T00:00:00Z","month":"12","department":[{"_id":"ScWa"}],"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."}],"arxiv":1,"title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","corr_author":"1","has_accepted_license":"1","publication":"Physical Review E","oa_version":"Published Version","article_number":"065418","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"intvolume":" 112","citation":{"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.","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.","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.","short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","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.","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","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"},"quality_controlled":"1","volume":112,"article_processing_charge":"Yes (via OA deal)","file":[{"file_name":"2025_PhysReviewE_Fitzgerald.pdf","success":1,"date_created":"2025-12-29T11:15:42Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","checksum":"d593e933f976c3f3cde37ad66539d57d","date_updated":"2025-12-29T11:15:42Z","file_id":"20862","relation":"main_file","file_size":2131491}],"OA_place":"publisher","day":"01","date_updated":"2025-12-29T11:19:34Z","ddc":["530"],"author":[{"full_name":"Fitzgerald, Eavan","last_name":"Fitzgerald","first_name":"Eavan","id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa"},{"full_name":"Clavaud, Cécile","orcid":"0000-0002-1843-3803","first_name":"Cécile","last_name":"Clavaud","id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8"},{"full_name":"Das, Debasish","last_name":"Das","first_name":"Debasish"},{"full_name":"Lenton, Isaac C","last_name":"Lenton","orcid":"0000-0002-5010-6984","first_name":"Isaac C","id":"a550210f-223c-11ec-8182-e2d45e817efb"},{"full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis"}],"OA_type":"hybrid","publisher":"American Physical Society","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. ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","scopus_import":"1","doi":"10.1103/1ss8-31rb","external_id":{"arxiv":["2508.05643"]},"status":"public","oa":1,"year":"2025","file_date_updated":"2025-12-29T11:15:42Z","date_created":"2025-12-21T23:01:34Z","language":[{"iso":"eng"}]},{"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"issue":"4","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."}],"department":[{"_id":"NiBa"}],"date_published":"2025-12-01T00:00:00Z","month":"12","publication_status":"published","article_type":"original","_id":"20848","quality_controlled":"1","citation":{"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","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.","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","short":"J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).","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.","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.","ista":"Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift balance models of complex diseases. Genetics. 231(4), iyaf220."},"intvolume":" 231","publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"publication":"Genetics","has_accepted_license":"1","title":"Mutation–selection–drift balance models of complex diseases","pmid":1,"article_number":"iyaf220","oa_version":"Published Version","OA_type":"hybrid","author":[{"last_name":"Berg","first_name":"Jeremy J.","full_name":"Berg, Jeremy J."},{"first_name":"Xinyi","last_name":"Li","full_name":"Li, Xinyi"},{"first_name":"Kellen","last_name":"Riall","full_name":"Riall, Kellen"},{"full_name":"Hayward, Laura","last_name":"Hayward","first_name":"Laura","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b"},{"first_name":"Guy","last_name":"Sella","full_name":"Sella, Guy"}],"ddc":["570"],"date_updated":"2025-12-29T11:29:16Z","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Oxford University Press","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.","volume":231,"OA_place":"publisher","file":[{"checksum":"b02eb6b78028b8bef435edc8435a8468","access_level":"open_access","date_updated":"2025-12-29T11:27:51Z","date_created":"2025-12-29T11:27:51Z","content_type":"application/pdf","creator":"dernst","file_name":"2025_Genetics_Berg.pdf","success":1,"file_size":1182339,"file_id":"20863","relation":"main_file"}],"article_processing_charge":"Yes (in subscription journal)","date_created":"2025-12-21T23:01:34Z","file_date_updated":"2025-12-29T11:27:51Z","language":[{"iso":"eng"}],"type":"journal_article","year":"2025","oa":1,"status":"public","external_id":{"pmid":["41073879"]},"doi":"10.1093/genetics/iyaf220","scopus_import":"1"},{"article_type":"original","_id":"20850","publication_status":"published","abstract":[{"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.","lang":"eng"},{"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"}],"department":[{"_id":"TiBr"}],"date_published":"2025-11-27T00:00:00Z","month":"11","tmp":{"name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"issue":"3","oa_version":"Published Version","publication":"Journal de theorie des nombres de Bordeaux","has_accepted_license":"1","corr_author":"1","arxiv":1,"title":"Class numbers and integer points on some Pellian surfaces","quality_controlled":"1","citation":{"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.","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.","short":"Y. Diao, Journal de Theorie Des Nombres de Bordeaux 37 (2025) 973–988.","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","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."},"intvolume":" 37","publication_identifier":{"issn":["1246-7405"],"eissn":["2118-8572"]},"OA_place":"publisher","file":[{"file_size":766196,"file_id":"20861","relation":"main_file","access_level":"open_access","checksum":"67aa0afbc0b5bcbff5341f4d25e6ba20","date_updated":"2025-12-29T10:05:22Z","date_created":"2025-12-29T10:05:22Z","content_type":"application/pdf","creator":"dernst","file_name":"2025_JTNB_Diao.pdf","success":1}],"article_processing_charge":"Yes (in subscription journal)","volume":37,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","publisher":"Université de Bordeaux","OA_type":"hybrid","author":[{"full_name":"Diao, Yijie","last_name":"Diao","orcid":"0000-0002-4989-5330","first_name":"Yijie","id":"7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b"}],"ddc":["510"],"date_updated":"2025-12-29T10:08:46Z","day":"27","year":"2025","oa":1,"external_id":{"arxiv":["2408.03774"]},"status":"public","doi":"10.5802/jtnb.1348","scopus_import":"1","page":"973-988","type":"journal_article","language":[{"iso":"eng"}],"date_created":"2025-12-21T23:01:35Z","file_date_updated":"2025-12-29T10:05:22Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported by the European Commission-financed project IntelLigent (HORIZON-CL5-2021-D2-01-02) with project ID number 101069765. In collaboration with ALBA staff, the operando SXRD and XAS experiments were performed at BL-16-NOTOS beamline at ALBA Synchrotron Light Source (experiment number: 2023097765). This research was supported by the Scientific Service Units (SSU) of the Institute of Science and Technology Austria (ISTA) through resources provided by the Electron Microscopy Facility (EMF) and the Nanofabrication Facility (NFF), and M.I. and S.H. acknowledge financial support from ISTA and the Werner Siemens Foundation. Jordi Jacas Biendicho acknowledges the fellowship RYC2021-034994-I, funded by MICIU/AEI/10.13039/501100011033 and the European Union «NextGenerationEU»/PRTR». Jordi Llorca is a Serra Húnter Fellow and is grateful to projects MICIN/AEI/FEDER PID2021-124572OB-C31 and Maria de Maeztu Units of Excellence Programme CEX2023-001300-M, and GC 2021 SGR 01061.","publisher":"Wiley","day":"12","date_updated":"2025-12-29T10:15:43Z","ddc":["540"],"OA_type":"gold","author":[{"full_name":"Chang, Xingqi","first_name":"Xingqi","last_name":"Chang"},{"full_name":"Escudero, Carlos","first_name":"Carlos","last_name":"Escudero"},{"last_name":"Black","first_name":"Ashley P.","full_name":"Black, Ashley P."},{"last_name":"Horta","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona"},{"full_name":"Martínez, Elías","first_name":"Elías","last_name":"Martínez"},{"full_name":"Lu, Xuan","first_name":"Xuan","last_name":"Lu"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"full_name":"Ibáñez, Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Jordi Jacas","last_name":"Biendicho","full_name":"Biendicho, Jordi Jacas"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"article_processing_charge":"Yes","OA_place":"publisher","DOAJ_listed":"1","language":[{"iso":"eng"}],"date_created":"2025-12-21T23:01:35Z","doi":"10.1002/advs.202515962","scopus_import":"1","year":"2025","status":"public","type":"journal_article","month":"12","date_published":"2025-12-12T00:00:00Z","PlanS_conform":"1","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"abstract":[{"text":"High-voltage disordered spinel LiNi0.5Mn1.5O4 is a promising cathode material for high power density in lithium-ion batteries. However, it suffers from poor cycle life associated with the rock-salt phase transformation. This study presents a straightforward synthesis approach to enhance the electrochemical performance of LiNi0.5Mn1.5O4 through a synergistic solid-state modification with LiF and AlF3. This dual modification promotes rapid Li⁺ diffusion, enables near-complete delithiation/lithiation, approaching the theoretical capacity of disordered LiNi0.5Mn1.5O4, and, more importantly, effectively mitigates the formation of the rock-salt phase, thereby enhancing structural stability, as confirmed by operando X-ray absorption spectroscopy (XAS) and synchrotron X-ray diffraction (SXRD). As a result, the optimized LiNi0.5Mn1.5O4 (10 mg AlF3 + 30 mg LiF) delivers high reversible capacities of 142.1, 139.1, 129.2, 121.6, 110.3, 93.5, and 76.1 mAh∙g−1 at 0.2C, 0.5C, 1.0C, 2.0C, 3.0C, 4.0C, and 5.0C, respectively. Full cells using graphite as the anode and a high-loading cathode exhibit excellent cycling performance. They retain 80% of their capacity after 200 cycles at 0.5C within a voltage window of 3.5–4.9 V with cathode loading of 11 mg∙cm−2. The findings of this study will significantly advance high-power LiNi0.5Mn1.5O4 materials, offering improved battery life and thereby enhancing their potential for practical applications.","lang":"eng"}],"department":[{"_id":"MaIb"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"article_type":"original","_id":"20851","publication_status":"epub_ahead","publication_identifier":{"eissn":["2198-3844"]},"quality_controlled":"1","citation":{"ista":"Chang X, Escudero C, Black AP, Horta S, Martínez E, Lu X, Llorca J, Ibáñez M, Biendicho JJ, Cabot A. 2025. Mitigating the rock-salt phase transformation in disordered LNMO through synergetic solid-state AlF3/LiF modifications. Advanced Science., e15962.","mla":"Chang, Xingqi, et al. “Mitigating the Rock-Salt Phase Transformation in Disordered LNMO through Synergetic Solid-State AlF3/LiF Modifications.” Advanced Science, e15962, Wiley, 2025, doi:10.1002/advs.202515962.","chicago":"Chang, Xingqi, Carlos Escudero, Ashley P. Black, Sharona Horta, Elías Martínez, Xuan Lu, Jordi Llorca, Maria Ibáñez, Jordi Jacas Biendicho, and Andreu Cabot. “Mitigating the Rock-Salt Phase Transformation in Disordered LNMO through Synergetic Solid-State AlF3/LiF Modifications.” Advanced Science. Wiley, 2025. https://doi.org/10.1002/advs.202515962.","short":"X. Chang, C. Escudero, A.P. Black, S. Horta, E. Martínez, X. Lu, J. Llorca, M. Ibáñez, J.J. Biendicho, A. Cabot, Advanced Science (2025).","apa":"Chang, X., Escudero, C., Black, A. P., Horta, S., Martínez, E., Lu, X., … Cabot, A. (2025). Mitigating the rock-salt phase transformation in disordered LNMO through synergetic solid-state AlF3/LiF modifications. Advanced Science. Wiley. https://doi.org/10.1002/advs.202515962","ieee":"X. Chang et al., “Mitigating the rock-salt phase transformation in disordered LNMO through synergetic solid-state AlF3/LiF modifications,” Advanced Science. Wiley, 2025.","ama":"Chang X, Escudero C, Black AP, et al. Mitigating the rock-salt phase transformation in disordered LNMO through synergetic solid-state AlF3/LiF modifications. Advanced Science. 2025. doi:10.1002/advs.202515962"},"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"NanoFab"}],"oa_version":"Published Version","article_number":"e15962","title":"Mitigating the rock-salt phase transformation in disordered LNMO through synergetic solid-state AlF3/LiF modifications","publication":"Advanced Science","has_accepted_license":"1"}]