[{"doi":"10.1016/j.celrep.2026.117227","related_material":{"record":[{"status":"for_moderation","id":"22667","relation":"dissertation_contains"}]},"scopus_import":"1","abstract":[{"text":"As vertebrates transitioned from water to land, locomotion shifted from undulatory swimming to limb-based movement. How spinal circuits and their cell types evolved to support this transition remains unclear. We leverage frog metamorphosis, which recapitulates this transition within a single organism, to define how spinal circuits generate aquatic versus terrestrial motor patterns. At swim stages, spinal architecture is uniform, with a transcriptionally and anatomically homogeneous motor and interneurons. As limbs develop and their movement complexifies, spinal circuits expand in neuron number and subtype diversity. This expansion is most pronounced for V1 inhibitory neurons, which increase ∼70-fold and diversify into transcriptionally distinct subtypes. Disrupting transcription factors defining emerging motor and V1 populations reveals molecular segregation between swim and limb circuits, highlighting the role of subtype diversity in motor coordination. A multifold increase in inhibitory neuron diversity thus underlies the tail-to-limb locomotor transition, providing a framework for spinal circuit adaptation during vertebrate evolution.","lang":"eng"}],"citation":{"ieee":"D. Vijatovic <i>et al.</i>, “Multifold increase in spinal inhibitory cell types with emergence of limb movement,” <i>Cell Reports</i>, vol. 45, no. 4. Elsevier, 2026.","ista":"Vijatovic D, Toma FA, Ignatyev Y, Harrington ZP, Sommer CM, Hauschild R, Smits MG, Dalla Vecchia M, Trevisan AJ, Chapman P, Julseth M, Brenner-Morton S, Gabitto MI, Dasen JS, Bikoff JB, Sweeney LB. 2026. Multifold increase in spinal inhibitory cell types with emergence of limb movement. Cell Reports. 45(4), 117227.","chicago":"Vijatovic, David, Florina Alexandra  Toma, Y Ignatyev, Zoe P Harrington, Christoph M Sommer, Robert Hauschild, Matthijs Geert Smits, et al. “Multifold Increase in Spinal Inhibitory Cell Types with Emergence of Limb Movement.” <i>Cell Reports</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.celrep.2026.117227\">https://doi.org/10.1016/j.celrep.2026.117227</a>.","short":"D. Vijatovic, F.A. Toma, Y. Ignatyev, Z.P. Harrington, C.M. Sommer, R. Hauschild, M.G. Smits, M. Dalla Vecchia, A.J. Trevisan, P. Chapman, M. Julseth, S. Brenner-Morton, M.I. Gabitto, J.S. Dasen, J.B. Bikoff, L.B. Sweeney, Cell Reports 45 (2026).","ama":"Vijatovic D, Toma FA, Ignatyev Y, et al. Multifold increase in spinal inhibitory cell types with emergence of limb movement. <i>Cell Reports</i>. 2026;45(4). doi:<a href=\"https://doi.org/10.1016/j.celrep.2026.117227\">10.1016/j.celrep.2026.117227</a>","apa":"Vijatovic, D., Toma, F. A., Ignatyev, Y., Harrington, Z. P., Sommer, C. M., Hauschild, R., … Sweeney, L. B. (2026). Multifold increase in spinal inhibitory cell types with emergence of limb movement. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2026.117227\">https://doi.org/10.1016/j.celrep.2026.117227</a>","mla":"Vijatovic, David, et al. “Multifold Increase in Spinal Inhibitory Cell Types with Emergence of Limb Movement.” <i>Cell Reports</i>, vol. 45, no. 4, 117227, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.celrep.2026.117227\">10.1016/j.celrep.2026.117227</a>."},"type":"journal_article","corr_author":"1","publisher":"Elsevier","publication_status":"published","intvolume":"        45","PlanS_conform":"1","has_accepted_license":"1","year":"2026","ddc":["570"],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"quality_controlled":"1","volume":45,"language":[{"iso":"eng"}],"article_processing_charge":"Yes","file_date_updated":"2026-05-04T12:20:10Z","issue":"4","month":"04","publication_identifier":{"eissn":["2211-1247"],"issn":["2639-1856"]},"OA_type":"gold","DOAJ_listed":"1","date_published":"2026-04-28T00:00:00Z","oa":1,"external_id":{"pmid":["41964955 "]},"_id":"21746","pmid":1,"project":[{"grant_number":"101041551","_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","name":"Development and Evolution of Tetrapod Motor Circuits"},{"_id":"8da85f50-16d5-11f0-9cad-eab8b0ff6c9e","grant_number":"F7814","name":"Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb transition: cell type to connection diversity"},{"_id":"c08e9ad1-5a5b-11eb-8a69-9d1cf3b07473","grant_number":"CZI01","name":"Tools for automation and feedback microscopy"},{"name":"Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis","grant_number":"FTI21-D-046","_id":"bd73af52-d553-11ed-ba76-912049f0ac7a"}],"date_created":"2026-04-19T22:07:43Z","oa_version":"Published Version","article_number":"117227","file":[{"access_level":"open_access","date_updated":"2026-05-04T12:20:10Z","success":1,"content_type":"application/pdf","file_id":"21795","file_name":"2026_CellReports_Vijatovic.pdf","creator":"dernst","checksum":"0d26cdb5b8d8dec3a911d8261a65cdef","date_created":"2026-05-04T12:20:10Z","file_size":14925958,"relation":"main_file"}],"publication":"Cell Reports","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-08-12T13:57:57Z","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)"},"status":"public","title":"Multifold increase in spinal inhibitory cell types with emergence of limb movement","author":[{"id":"cf391e77-ec3c-11ea-a124-d69323410b58","first_name":"David","last_name":"Vijatovic","orcid":"0000-0002-5494-0941","full_name":"Vijatovic, David"},{"last_name":"Toma","first_name":"Florina Alexandra ","full_name":"Toma, Florina Alexandra ","id":"2f73f876-f128-11eb-9611-b96b5a30cb0e"},{"full_name":"Ignatyev, Y","first_name":"Y","last_name":"Ignatyev"},{"first_name":"Zoe P","last_name":"Harrington","orcid":"0009-0008-0158-4032","full_name":"Harrington, Zoe P","id":"a8144562-32c9-11ee-b5ce-d9800628bda2"},{"full_name":"Sommer, Christoph M","orcid":"0000-0003-1216-9105","first_name":"Christoph M","last_name":"Sommer","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Hauschild","first_name":"Robert","full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"id":"7a231d52-e216-11ee-a0bb-8acd55f8f1f0","last_name":"Smits","first_name":"Matthijs Geert","full_name":"Smits, Matthijs Geert"},{"id":"02a7a869-ff06-11ed-a87f-86649d6077e5","last_name":"Dalla Vecchia","first_name":"Marco","full_name":"Dalla Vecchia, Marco"},{"full_name":"Trevisan, Alexandra J.","first_name":"Alexandra J.","last_name":"Trevisan"},{"full_name":"Chapman, Phillip","first_name":"Phillip","last_name":"Chapman"},{"full_name":"Julseth, Mara","first_name":"Mara","last_name":"Julseth","id":"1cf464b2-dc7d-11ea-9b2f-f9b1aa9417d1"},{"last_name":"Brenner-Morton","first_name":"Susan","full_name":"Brenner-Morton, Susan"},{"last_name":"Gabitto","first_name":"Mariano I.","full_name":"Gabitto, Mariano I."},{"first_name":"Jeremy S.","last_name":"Dasen","full_name":"Dasen, Jeremy S."},{"full_name":"Bikoff, Jay B.","first_name":"Jay B.","last_name":"Bikoff"},{"last_name":"Sweeney","first_name":"Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601","full_name":"Sweeney, Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425"}],"department":[{"_id":"LoSw"},{"_id":"GradSch"},{"_id":"TiVo"},{"_id":"Bio"},{"_id":"NiBa"}],"day":"28","acknowledgement":"We would like to thank the members of the Sweeney Lab, Mario de Bono, Michael Forsthofer, Katharina Lust, and Meital Oren, for comments on the manuscript. We are also grateful to Tom Jessell and Chris Kintner for their scientific insight and mentorship during the conception of this project. It would also have not been possible without the technical support of the Aquatics and Imaging and Optics Facility support teams (ISTA). We thank Martin Estermann for preparing the initial draft of the graphical abstract and Niki Barolini for the final version. In addition, we thank our funding sources for providing the resources to do these experiments: GFF NÖ FTI Strategy Lower Austria dissertation grant FT121-D-046 (to D.V.), Horizon Europe ERC starting grant 101041551 (to Y.I., L.B.S., F.A.T., and D.V.), Special Research Program (SFB) of the Austrian Science Fund (FWF) project F7814-B (to L.B.S.), Austrian Science Fund (FWF) 10.55776/COE16 (to Y.I. and L.B.S.), NINDS 5R35NS116858 (to J.S.D.), CZI grant DAF2020-225401 (DOI) 10.37921/120055ratwvi (to R.H.), NIH grant R01NS123116 (to J.B.B.), American Lebanese Syrian Associated Charities (ALSAC) (to J.B.B.), German Academic Exchange Service (DAAD) IFI grant 57515251-91853472 (to Z.H.), and Project A.L.S. (to S.B.-M.).","OA_place":"publisher","article_type":"original"},{"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)"},"date_updated":"2026-08-12T22:31:02Z","keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"das_tickbox":"0","article_type":"original","OA_place":"publisher","acknowledgement":"L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1, Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science Fund (FWF) project 10.55776/F65.","author":[{"last_name":"Portinale","first_name":"Lorenzo","full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0009-0000-9773-1931","full_name":"Quattrocchi, Filippo","first_name":"Filippo","last_name":"Quattrocchi","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308"}],"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","researchdata_availability":"no","external_id":{"isi":["001381435800001"]},"oa":1,"publication_identifier":{"eissn":["1469-4425"],"issn":["0956-7925"]},"OA_type":"gold","date_published":"2026-06-01T00:00:00Z","DOAJ_listed":"1","file":[{"file_size":612317,"checksum":"d038f4d00cbfbde2672c17138eab21c9","date_created":"2026-07-23T05:55:03Z","relation":"main_file","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","creator":"dernst","file_id":"22386","access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-07-23T05:55:03Z"}],"publication":"European Journal of Applied Mathematics","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"_id":"18706","oa_version":"Published Version","date_created":"2024-12-23T11:03:59Z","volume":37,"language":[{"iso":"eng"}],"ddc":["500"],"year":"2026","quality_controlled":"1","page":"614-642","issue":"3","file_date_updated":"2026-07-23T05:55:03Z","month":"06","isi":1,"article_processing_charge":"Yes","abstract":[{"text":"We prove discrete-to-continuum convergence for dynamical optimal transport on  Zd\r\n -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of  1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.","lang":"eng"}],"citation":{"apa":"Portinale, L., &#38; Quattrocchi, F. (2026). Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>","mla":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3, Cambridge University Press, 2026, pp. 614–42, doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>.","ama":"Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. 2026;37(3):614-642. doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>","short":"L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37 (2026) 614–642.","ieee":"L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs,” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026.","chicago":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>.","ista":"Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. 37(3), 614–642."},"related_material":{"record":[{"relation":"dissertation_contains","id":"20563","status":"public"}]},"doi":"10.1017/s0956792524000810","scopus_import":"1","PlanS_conform":"1","intvolume":"        37","has_accepted_license":"1","type":"journal_article","publisher":"Cambridge University Press","publication_status":"published","supplementarymaterial":"no"},{"month":"04","issue":"7","file_date_updated":"2026-05-06T06:35:05Z","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"volume":2026,"quality_controlled":"1","year":"2026","ddc":["510"],"has_accepted_license":"1","PlanS_conform":"1","intvolume":"      2026","publication_status":"published","corr_author":"1","type":"journal_article","publisher":"Oxford University Press","citation":{"mla":"Löwit, Jakub. “Equivariant Localizing Invariants of Simple Varieties.” <i>International Mathematics Research Notices</i>, vol. 2026, no. 7, rnag058, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/imrn/rnag058\">10.1093/imrn/rnag058</a>.","apa":"Löwit, J. (2026). Equivariant localizing invariants of simple varieties. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnag058\">https://doi.org/10.1093/imrn/rnag058</a>","short":"J. Löwit, International Mathematics Research Notices 2026 (2026).","ama":"Löwit J. Equivariant localizing invariants of simple varieties. <i>International Mathematics Research Notices</i>. 2026;2026(7). doi:<a href=\"https://doi.org/10.1093/imrn/rnag058\">10.1093/imrn/rnag058</a>","ieee":"J. Löwit, “Equivariant localizing invariants of simple varieties,” <i>International Mathematics Research Notices</i>, vol. 2026, no. 7. Oxford University Press, 2026.","ista":"Löwit J. 2026. Equivariant localizing invariants of simple varieties. International Mathematics Research Notices. 2026(7), rnag058.","chicago":"Löwit, Jakub. “Equivariant Localizing Invariants of Simple Varieties.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2026. <a href=\"https://doi.org/10.1093/imrn/rnag058\">https://doi.org/10.1093/imrn/rnag058</a>."},"abstract":[{"lang":"eng","text":"We define a certain class of simple varieties over a field k by a constructive recipe and show how to control their (equivariant) truncating invariants. Consequently, we prove that on simple varieties: (i) if k = k and char k = p, the p-adic cyclotomic trace is an equivalence; (ii) if k = Q, the Goodwillie–Jones trace is an isomorphism in degree zero; (iii) we can control homotopy invariant K-theory KH, which is equivariantly formal and determined by its topological counterparts. Simple varieties are quite special, but encompass important singular examples appearing in geometric representation theory. We, in particular, show that both finite and affine Schubert varieties for GLn lie in this class, so all the above results hold for them. "}],"scopus_import":"1","related_material":{"record":[{"status":"for_moderation","relation":"dissertation_contains","id":"22694"}]},"doi":"10.1093/imrn/rnag058","OA_place":"publisher","article_type":"original","acknowledgement":"This work was supported by a DOC Fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (ISTA) and by an Erasmus+ staff mobility training. It took place during the author’s visit to Laboratoire de Mathématiques d’Orsay in the course of his PhD at the Institute of Science and Technology Austria. First and foremost, I would like to thank Matthew Morrow for discussions, explanations and ideas without which this work would not have been carried out. I would further like to thank Brian Conrad for providing an amazing reference on projective cones in appropriate generality, to Vova Sosnilo for carefully discussing – among other things – the derived nilinvariance for quotients by any linearly reductive group, and to Adeel Khan, Timo Richarz, Matthias Wendt and Xinwen Zhu for helpful conversations\r\nabout the results. I would moreover like to thank the referee for the very useful comments.","day":"01","department":[{"_id":"TaHa"}],"title":"Equivariant localizing invariants of simple varieties","author":[{"id":"e3b80ae2-eb8e-11eb-b029-9aef4a9108a0","first_name":"Jakub","last_name":"Löwit","full_name":"Löwit, Jakub"}],"status":"public","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)"},"date_updated":"2026-08-13T07:00:17Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"International Mathematics Research Notices","file":[{"access_level":"open_access","success":1,"content_type":"application/pdf","date_updated":"2026-05-06T06:35:05Z","file_id":"21803","file_name":"2026_IMRN_Loewit.pdf","creator":"dernst","file_size":1663246,"checksum":"306f4567b7b2dcf38e23f7b55a27514e","date_created":"2026-05-06T06:35:05Z","relation":"main_file"}],"article_number":"rnag058","oa_version":"Published Version","date_created":"2026-04-19T22:07:48Z","project":[{"name":"Arithmetic, geometry, topology and representation theory arising from the affine Grassmannian","_id":"901e2a43-16d5-11f0-9cad-9cead34748d6","grant_number":"27004"}],"_id":"21751","external_id":{"arxiv":["2507.09392"]},"oa":1,"date_published":"2026-04-01T00:00:00Z","OA_type":"hybrid","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"arxiv":1},{"supplementarymaterial":"no","publication_status":"epub_ahead","publisher":"EMS Press","type":"journal_article","corr_author":"1","has_accepted_license":"1","PlanS_conform":"1","scopus_import":"1","doi":"10.4171/dm/1064","related_material":{"record":[{"status":"for_moderation","relation":"dissertation_contains","id":"22694"}]},"citation":{"short":"J. Löwit, Documenta Mathematica (2026).","ama":"Löwit J. Equivariant K-theory, affine Grassmannian and perfection. <i>Documenta Mathematica</i>. 2026. doi:<a href=\"https://doi.org/10.4171/dm/1064\">10.4171/dm/1064</a>","ista":"Löwit J. 2026. Equivariant K-theory, affine Grassmannian and perfection. Documenta Mathematica.","chicago":"Löwit, Jakub. “Equivariant K-Theory, Affine Grassmannian and Perfection.” <i>Documenta Mathematica</i>. EMS Press, 2026. <a href=\"https://doi.org/10.4171/dm/1064\">https://doi.org/10.4171/dm/1064</a>.","ieee":"J. Löwit, “Equivariant K-theory, affine Grassmannian and perfection,” <i>Documenta Mathematica</i>. EMS Press, 2026.","apa":"Löwit, J. (2026). Equivariant K-theory, affine Grassmannian and perfection. <i>Documenta Mathematica</i>. EMS Press. <a href=\"https://doi.org/10.4171/dm/1064\">https://doi.org/10.4171/dm/1064</a>","mla":"Löwit, Jakub. “Equivariant K-Theory, Affine Grassmannian and Perfection.” <i>Documenta Mathematica</i>, EMS Press, 2026, doi:<a href=\"https://doi.org/10.4171/dm/1064\">10.4171/dm/1064</a>."},"abstract":[{"text":"We study torus-equivariant algebraic K-theory of affine Schubert varieties in the perfect affine Grassmannians over Fp. We further compare it to the torus-equivariant Hochschild homology of perfect complexes, which has a geometric description in terms of global functions on certain fixed-point schemes. We prove that Fp-linearly, this comparison is an isomorphism. Our approach is quite constructive, resulting in new computations of these K-theory rings. We establish various structural results for equivariant perfect algebraic K-theory on the way; we believe these are of independent interest.","lang":"eng"}],"article_processing_charge":"Yes (in subscription journal)","month":"03","quality_controlled":"1","year":"2026","ddc":["500"],"language":[{"iso":"eng"}],"date_created":"2026-08-12T13:29:17Z","oa_version":"Published Version","_id":"22693","mathsc":["19E08","19L47","20G44","14G17","19D55","14F43","14L30","14D24","14M25"],"project":[{"name":"Geometry of the tip of the global nilpotent cone","_id":"34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3","grant_number":"P35847"}],"publication":"Documenta Mathematica","date_published":"2026-03-26T00:00:00Z","arxiv":1,"publication_identifier":{"eissn":["1431-0643"],"issn":["1431-0635"]},"OA_type":"hybrid","oa":1,"researchdata_availability":"no","external_id":{"arxiv":["2409.18925"]},"title":"Equivariant K-theory, affine Grassmannian and perfection","main_file_link":[{"url":"https://doi.org/10.4171/DM/1064","open_access":"1"}],"author":[{"id":"e3b80ae2-eb8e-11eb-b029-9aef4a9108a0","first_name":"Jakub","last_name":"Löwit","full_name":"Löwit, Jakub"}],"acknowledgement":"I would like to thank the following people for fruitful discussions,\r\nhelpful sanity checks or comments on previous drafts: Roman Bezrukavnikov, Jens Niklas Eberhardt, Mischa Elkner, Tamás Hausel, Andres Fernandez Herrero, Adeel Khan,\r\nBernhard Köck, Andrei Konovalov, Quoc Ho, Mirko Mauri, Matthew Morrow, Charanya\r\nRavi, Kamil Rychlewicz, Shyiu Shen, Vladimir Sosnilo, Georg Tamme, Xinwen Zhu. I\r\nwould further like to thank Marc Hoyois and the anonymous referee for spotting an error\r\nin a previous version.\r\nThis work was done during author’s PhD at the Institute of Science and Technology Austria (ISTA). It was funded by a DOC Fellowship of the Austrian Academy\r\nof Sciences and by the Austrian Science Fund (FWF) 10.55776/P35847. For open access\r\npurposes, the author has applied a CC BY public copyright license to any author-accepted\r\nmanuscript version arising from this submission.","article_type":"original","OA_place":"publisher","das_tickbox":"0","day":"26","department":[{"_id":"GradSch"},{"_id":"TaHa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","keyword":["equivariant algebraic K-theory","perfection in positive characteristic","affine Grassmannian","affine Schubert varieties","Dennis trace map","equivariant Hochschild homology","fixed-point schemes","toric varieties"],"date_updated":"2026-08-13T07:00:17Z","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":"22704","publisher":"Institute of Science and Technology Austria","type":"research_data","corr_author":"1","project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385"},{"grant_number":"PAT 5720324","_id":"92503f6e-16d5-11f0-9cad-8c571927f3b7","name":"New regime of presynaptic release regulation"}],"date_created":"2026-08-13T12:20:08Z","doi_confirm":"1","oa_version":"None","file":[{"creator":"elemonni","file_name":"Behavior.zip","relation":"main_file","checksum":"7742bb211a43bb87c2b5ce7bda3068ae","date_created":"2026-08-13T12:07:53Z","file_size":162086,"date_updated":"2026-08-13T12:07:53Z","success":1,"content_type":"application/x-zip-compressed","access_level":"open_access","file_id":"22705"},{"access_level":"open_access","success":1,"content_type":"application/x-zip-compressed","date_updated":"2026-08-13T12:07:57Z","file_id":"22706","file_name":"image_analysis.zip","creator":"elemonni","file_size":6643,"checksum":"a162eb6103a770d94536374e02934fcf","date_created":"2026-08-13T12:07:57Z","relation":"main_file"},{"creator":"elemonni","file_name":"Recordings.zip","relation":"main_file","checksum":"608aaf395bba5fd9cf62d8c8940d63aa","date_created":"2026-08-13T12:07:59Z","file_size":1193016,"date_updated":"2026-08-13T12:07:59Z","content_type":"application/x-zip-compressed","success":1,"access_level":"open_access","file_id":"22707"},{"file_id":"22708","access_level":"open_access","date_updated":"2026-08-13T13:06:29Z","content_type":"text/plain","success":1,"date_created":"2026-08-13T13:06:29Z","checksum":"2389ebd71238bd7de03d20504a8cf962","file_size":246,"relation":"main_file","file_name":"README.txt","creator":"elemonni"}],"has_accepted_license":"1","doi":"10.15479/AT-ISTA-22704","date_published":"2026-08-13T00:00:00Z","abstract":[{"text":"The medial habenula (MHb) is implicated in regulating emotional responses to aversive events. Studies in zebrafish have identified a remarkable morphological left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior. However, there is little evidence for structural or functional lateralization in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties of left- and right-MHb afferents to the IPN and their roles in the expression of conditioned fear in mice. We found that each IPN neuron receives inputs from both left and right MHb, but the left MHb-originating synapses exhibit lower release probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation compared to the right MHb-originating synapses. Interestingly, these asymmetrical properties persist in the inversus visceral mutant mice with normal internal organ laterality (situs solitus), but nearly disappear in those with reversed internal organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic neurons and conditional deletion of GABABR in the left, but not the right, MHb significantly attenuated cue-dependent fear recall. Our results demonstrate functional asymmetry of the MHb under partial influence of the nodal flow in mice, revealing a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in modulating fear memories. These findings suggest that lateralized MHb pathways could represent a fundamental principle in the neural regulation of emotion across species but that they develop differently in zebrafish and mice.\r\n","lang":"eng"}],"oa":1,"citation":{"ista":"Le Monnier E, Önal C. 2026. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>.","chicago":"Le Monnier, Elodie, and Cihan Önal. “Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">https://doi.org/10.15479/AT-ISTA-22704</a>.","ieee":"E. Le Monnier and C. Önal, “Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula.” Institute of Science and Technology Austria, 2026.","ama":"Le Monnier E, Önal C. Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>","short":"E. Le Monnier, C. Önal, (2026).","apa":"Le Monnier, E., &#38; Önal, C. (2026). Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22704\">https://doi.org/10.15479/AT-ISTA-22704</a>","mla":"Le Monnier, Elodie, and Cihan Önal. <i>Asymmetrical Modulation of Fear Expression via GABAB Receptors in the Mouse Medial Habenula</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22704\">10.15479/AT-ISTA-22704</a>."},"author":[{"full_name":"Le Monnier, Elodie","last_name":"Le Monnier","first_name":"Elodie","id":"3B59276A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Önal","first_name":"Cihan","full_name":"Önal, Cihan"}],"title":"Asymmetrical modulation of fear expression via GABAB receptors in the mouse medial habenula","article_processing_charge":"No","file_date_updated":"2026-08-13T13:06:29Z","ec_funded":1,"department":[{"_id":"RySh"}],"day":"13","month":"08","OA_place":"repository","year":"2026","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_updated":"2026-08-13T13:30:37Z","tmp":{"short":"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","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"status":"public"},{"month":"09","file_date_updated":"2026-06-22T08:54:32Z","article_processing_charge":"Yes","language":[{"iso":"eng"}],"volume":343,"cryptoeprintid":1,"quality_controlled":"1","conference":{"location":"Santa Barbara, CA, United States","name":"ITC: Information Theoretic Cryptography","end_date":"2025-08-17","start_date":"2025-08-16"},"ddc":["000"],"year":"2025","has_accepted_license":"1","intvolume":"       343","publication_status":"published","corr_author":"1","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"mla":"Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” <i>6th Conference on Information-Theoretic Cryptography</i>, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>.","apa":"Pietrzak, K. Z., &#38; Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In <i>6th Conference on Information-Theoretic Cryptography</i> (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ama":"Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: <i>6th Conference on Information-Theoretic Cryptography</i>. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>","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.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara, CA, United States, 2025, vol. 343.","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In <i>6th Conference on Information-Theoretic Cryptography</i>, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>."},"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."}],"scopus_import":"1","doi":"10.4230/LIPIcs.ITC.2025.4","OA_place":"publisher","das_tickbox":"0","department":[{"_id":"KrPi"}],"day":"08","title":"Time-space tradeoffs of truncation with preprocessing","author":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Wang, Pengxiang","last_name":"Wang","first_name":"Pengxiang"}],"alternative_title":["LIPIcs"],"status":"public","keyword":["Time-Space Lower Bounds","Blockchains"],"date_updated":"2026-06-22T08:57:41Z","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)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"6th Conference on Information-Theoretic Cryptography","file":[{"access_level":"open_access","date_updated":"2026-06-22T08:54:32Z","content_type":"application/pdf","success":1,"file_id":"22118","file_name":"2025_LIPIcs_Pietrzak.pdf","creator":"dernst","date_created":"2026-06-22T08:54:32Z","checksum":"3f791b03df26853342855a9d9581cb58","file_size":772046,"relation":"main_file"}],"date_created":"2026-06-14T22:01:45Z","oa_version":"Published Version","article_number":"4:1-4:10","_id":"22007","oa":1,"external_id":{"cryptoeprintid":["2025/723"]},"date_published":"2025-09-08T00:00:00Z","OA_type":"gold","publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]}},{"article_processing_charge":"No","issue":"7","page":"284-320","month":"06","ddc":["500"],"year":"2025","quality_controlled":"1","volume":5,"language":[{"iso":"eng"}],"type":"journal_article","publisher":"American Mathematical Society","publication_status":"published","intvolume":"         5","has_accepted_license":"1","doi":"10.1090/cams/48","scopus_import":"1","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."}],"citation":{"apa":"Killip, R., Laurens, T., &#38; Vişan, M. (2025). Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>","mla":"Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>.","short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320.","ama":"Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. 2025;5(7):284-320. doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>","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.","ieee":"R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for continuum Calogero–Moser models on the line,” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7. American Mathematical Society, pp. 284–320, 2025.","chicago":"Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>. American Mathematical Society, 2025. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.12334","open_access":"1"}],"title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","author":[{"full_name":"Killip, Rowan","first_name":"Rowan","last_name":"Killip"},{"last_name":"Laurens","first_name":"Thierry","full_name":"Laurens, Thierry"},{"last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"}],"das_tickbox":"1","day":"23","article_type":"original","OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-06-22T11:21:09Z","tmp":{"short":"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","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"status":"public","_id":"22032","date_created":"2026-06-19T07:42:34Z","oa_version":"Published Version","extern":"1","publication":"Communications of the American Mathematical Society","arxiv":1,"OA_type":"diamond","publication_identifier":{"issn":["2692-3688"]},"date_published":"2025-06-23T00:00:00Z","oa":1,"external_id":{"arxiv":["2311.12334"]}},{"abstract":[{"text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.","lang":"eng"}],"citation":{"mla":"Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>, vol. 311, 21, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>.","apa":"Fan, C., Killip, R., Vişan, M., &#38; Zhao, Z. (2025). Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>","ama":"Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. 2025;311. doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","chicago":"Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>.","ieee":"C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical nonlinear Schrödinger equation,” <i>Mathematische Zeitschrift</i>, vol. 311. Springer Nature, 2025."},"doi":"10.1007/s00209-025-03821-8","scopus_import":"1","intvolume":"       311","type":"journal_article","publisher":"Springer Nature","publication_status":"published","volume":311,"language":[{"iso":"eng"}],"year":"2025","quality_controlled":"1","month":"07","article_processing_charge":"No","external_id":{"arxiv":["2403.09989"]},"oa":1,"publication_identifier":{"issn":["0025-5874"],"eissn":["1432-1823"]},"OA_type":"green","arxiv":1,"date_published":"2025-07-24T00:00:00Z","publication":"Mathematische Zeitschrift","extern":"1","_id":"22036","article_number":"21","oa_version":"Preprint","date_created":"2026-06-19T07:44:05Z","date_updated":"2026-06-22T13:00:14Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"24","das_tickbox":"1","OA_place":"repository","article_type":"original","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2403.09989"}],"author":[{"full_name":"Fan, Chenjie","first_name":"Chenjie","last_name":"Fan"},{"last_name":"Killip","first_name":"Rowan","full_name":"Killip, Rowan"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","first_name":"Monica","full_name":"Visan, Monica"},{"first_name":"Zehua","last_name":"Zhao","full_name":"Zhao, Zehua"}],"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation"},{"language":[{"iso":"eng"}],"volume":37,"quality_controlled":"1","ddc":["004"],"year":"2025","month":"10","page":"24669–24683","file_date_updated":"2025-12-30T06:39:11Z","article_processing_charge":"Yes (via OA deal)","citation":{"apa":"Súkeník, P., &#38; Lampert, C. (2025). Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>","mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>.","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. <i>Neural Computing and Applications</i>. 2025;37:24669–24683. doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>","ieee":"P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” <i>Neural Computing and Applications</i>, vol. 37. Springer Nature, pp. 24669–24683, 2025.","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.” <i>Neural Computing and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>."},"abstract":[{"lang":"eng","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."}],"scopus_import":"1","doi":"10.1007/s00521-024-10616-1","has_accepted_license":"1","PlanS_conform":"1","intvolume":"        37","publication_status":"published","type":"journal_article","publisher":"Springer Nature","corr_author":"1","status":"public","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)"},"date_updated":"2025-12-30T06:39:56Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","article_type":"original","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","day":"01","department":[{"_id":"ChLa"}],"title":"Generalization in multi-objective machine learning","author":[{"last_name":"Súkeník","first_name":"Peter","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c"},{"last_name":"Lampert","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"}],"external_id":{"arxiv":["2208.13499"]},"oa":1,"date_published":"2025-10-01T00:00:00Z","OA_type":"hybrid","publication_identifier":{"issn":["0941-0643"],"eissn":["1433-3058"]},"arxiv":1,"publication":"Neural Computing and Applications","file":[{"creator":"dernst","file_name":"2025_NeuralCompApplic_Sukenik.pdf","relation":"main_file","file_size":500213,"checksum":"61ad4591aee16b1e02daf6c164321a42","date_created":"2025-12-30T06:39:11Z","success":1,"content_type":"application/pdf","date_updated":"2025-12-30T06:39:11Z","access_level":"open_access","file_id":"20877"}],"oa_version":"Published Version","date_created":"2023-02-20T08:23:06Z","_id":"12662"},{"day":"01","department":[{"_id":"DaAl"}],"OA_place":"publisher","author":[{"full_name":"Sieberling, Oliver","first_name":"Oliver","last_name":"Sieberling"},{"first_name":"Denis","last_name":"Kuznedelev","full_name":"Kuznedelev, Denis"},{"full_name":"Kurtic, Eldar","last_name":"Kurtic","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian"}],"title":"EvoPress: Accurate dynamic model compression via evolutionary search","alternative_title":["PMLR"],"date_updated":"2025-12-16T12:34:32Z","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)"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"relation":"main_file","file_size":908379,"date_created":"2025-12-16T12:32:40Z","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","creator":"dernst","file_name":"2025_ICML_Sieberling.pdf","file_id":"20828","success":1,"content_type":"application/pdf","date_updated":"2025-12-16T12:32:40Z","access_level":"open_access"}],"publication":"42nd International Conference on Machine Learning","_id":"20820","date_created":"2025-12-14T23:02:05Z","oa_version":"Published Version","oa":1,"external_id":{"arxiv":["2410.14649"]},"arxiv":1,"publication_identifier":{"eissn":["2640-3498"]},"OA_type":"gold","date_published":"2025-05-01T00:00:00Z","file_date_updated":"2025-12-16T12:32:40Z","page":"55556-55590","month":"05","article_processing_charge":"No","volume":267,"language":[{"iso":"eng"}],"ddc":["000"],"year":"2025","conference":{"name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19","location":"Vancouver, Canada","start_date":"2025-07-13"},"quality_controlled":"1","intvolume":"       267","has_accepted_license":"1","publisher":"ML Research Press","corr_author":"1","type":"conference","publication_status":"published","abstract":[{"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.","lang":"eng"}],"citation":{"ama":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic model compression via evolutionary search. In: <i>42nd International Conference on Machine Learning</i>. 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.","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.","ieee":"O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate dynamic model compression via evolutionary search,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.","chicago":"Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In <i>42nd International Conference on Machine Learning</i>, 267:55556–90. ML Research Press, 2025.","apa":"Sieberling, O., Kuznedelev, D., Kurtic, E., &#38; Alistarh, D.-A. (2025). EvoPress: Accurate dynamic model compression via evolutionary search. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 55556–55590). Vancouver, Canada: ML Research Press.","mla":"Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 55556–90."},"scopus_import":"1"},{"date_published":"2025-05-01T00:00:00Z","arxiv":1,"OA_type":"gold","publication_identifier":{"eissn":["2640-3498"]},"oa":1,"external_id":{"arxiv":["2505.14371"]},"date_created":"2025-12-14T23:02:06Z","oa_version":"Published Version","_id":"20821","project":[{"grant_number":"101158077","_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning"}],"publication":"42nd International Conference on Machine Learning","file":[{"file_id":"20830","content_type":"application/pdf","success":1,"date_updated":"2025-12-16T12:45:41Z","access_level":"open_access","relation":"main_file","file_size":756213,"date_created":"2025-12-16T12:45:41Z","checksum":"a7edf0e4304171a3e035842b3aab1704","creator":"dernst","file_name":"2025_ICML_Nguyen.pdf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2025-12-16T12:46:54Z","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)"},"author":[{"last_name":"Nguyen","first_name":"Anh Duc","full_name":"Nguyen, Anh Duc"},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","first_name":"Ilia","full_name":"Markov, Ilia"},{"last_name":"Wu","first_name":"Frank Zhengqing","full_name":"Wu, Frank Zhengqing"},{"full_name":"Ramezani-Kebrya, Ali","first_name":"Ali","last_name":"Ramezani-Kebrya"},{"full_name":"Antonakopoulos, Kimon","last_name":"Antonakopoulos","first_name":"Kimon"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cevher","first_name":"Volkan","full_name":"Cevher, Volkan"}],"title":"Layer-wise quantization for quantized optimistic dual averaging","alternative_title":["PMLR"],"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).","OA_place":"publisher","department":[{"_id":"DaAl"}],"day":"01","scopus_import":"1","citation":{"ama":"Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic dual averaging. In: <i>42nd International Conference on Machine Learning</i>. 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.","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 <i>42nd International Conference on Machine Learning</i>, 267:46026–72. ML Research Press, 2025.","ieee":"A. D. Nguyen <i>et al.</i>, “Layer-wise quantization for quantized optimistic dual averaging,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 46026–46072.","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.","apa":"Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos, K., Alistarh, D.-A., &#38; Cevher, V. (2025). Layer-wise quantization for quantized optimistic dual averaging. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.","mla":"Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 46026–72."},"abstract":[{"lang":"eng","text":"Modern deep neural networks exhibit heterogeneity across numerous layers of various types such as residuals, multi-head attention, etc., due to varying structures (dimensions, activation functions, etc.), distinct representation characteristics, which impact predictions. We develop a general layer-wise quantization framework with tight variance and code-length bounds, adapting to the heterogeneities over the course of training. We then apply a new layer-wise quantization technique within distributed variational inequalities (VIs), proposing a novel Quantized Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which achieves competitive convergence rates for monotone VIs. We empirically show that QODA achieves up to a 150% speedup over the baselines in end-to-end training time for training Wasserstein GAN on 12+GPUs."}],"publication_status":"published","type":"conference","publisher":"ML Research Press","has_accepted_license":"1","intvolume":"       267","quality_controlled":"1","ddc":["000"],"conference":{"end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning","location":"Vancouver, Canada","start_date":"2025-07-13"},"year":"2025","language":[{"iso":"eng"}],"volume":267,"article_processing_charge":"No","month":"05","file_date_updated":"2025-12-16T12:45:41Z","page":"46026-46072"},{"publication":"Journal of Fractal Geometry","oa_version":"Published Version","date_created":"2025-12-19T10:15:37Z","_id":"20839","oa":1,"date_published":"2025-11-07T00:00:00Z","DOAJ_listed":"1","publication_identifier":{"issn":["2308-1309"],"eissn":["2308-1317"]},"OA_type":"gold","article_type":"original","OA_place":"publisher","day":"07","department":[{"_id":"VaKa"}],"title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","main_file_link":[{"url":"https://doi.org/10.4171/jfg/177","open_access":"1"}],"author":[{"full_name":"Helfter, Mathieu","last_name":"Helfter","first_name":"Mathieu","id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57"}],"status":"public","date_updated":"2026-06-18T18:26:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"epub_ahead","publisher":"EMS Press","corr_author":"1","type":"journal_article","citation":{"ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","ieee":"M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” <i>Journal of Fractal Geometry</i>. EMS Press, 2025.","chicago":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>. EMS Press, 2025. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>.","ama":"Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>","short":"M. Helfter, Journal of Fractal Geometry (2025).","apa":"Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. EMS Press. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>","mla":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>, EMS Press, 2025, doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>."},"abstract":[{"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.","lang":"eng"}],"scopus_import":"1","doi":"10.4171/jfg/177","month":"11","article_processing_charge":"Yes","language":[{"iso":"eng"}],"quality_controlled":"1","year":"2025","ddc":["500"]},{"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","year":"2025","status":"public","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)"},"date_updated":"2026-06-10T08:36:07Z","article_processing_charge":"No","author":[{"full_name":"Agafonova, Sofya","orcid":"0000-0003-0582-2946","first_name":"Sofya","last_name":"Agafonova","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80"}],"title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","month":"12","contributor":[{"last_name":"Rosello","first_name":"Pere"},{"first_name":"Manuel","last_name":"Mekonnen"},{"id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2031-204X","last_name":"Hosten","first_name":"Onur","contributor_type":"supervisor"}],"day":"22","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"file_date_updated":"2025-12-22T13:51:09Z","date_published":"2025-12-22T00:00:00Z","related_material":{"record":[{"status":"public","id":"20840","relation":"used_in_publication"}]},"doi":"10.15479/AT-ISTA-20842","citation":{"short":"S. Agafonova, (2025).","ama":"Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>","ista":"Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>.","ieee":"S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface.’” Institute of Science and Technology Austria, 2025.","chicago":"Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>.","apa":"Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>","mla":"Agafonova, Sofia. <i>Research Data for: “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.”</i> Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>."},"oa":1,"abstract":[{"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.","lang":"eng"}],"oa_version":"Published Version","date_created":"2025-12-21T14:23:50Z","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","grant_number":"101087907","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6"}],"corr_author":"1","_id":"20842","publisher":"Institute of Science and Technology Austria","type":"research_data","has_accepted_license":"1","file":[{"access_level":"open_access","success":1,"content_type":"application/x-zip-compressed","date_updated":"2025-12-22T13:45:30Z","file_id":"20854","file_name":"AllData.zip","creator":"sagafono","file_size":146656591,"checksum":"7af34e4226a00cdcb7f154272050e217","date_created":"2025-12-22T13:45:30Z","relation":"main_file"},{"file_id":"20855","content_type":"application/x-zip-compressed","success":1,"date_updated":"2025-12-22T13:45:33Z","access_level":"open_access","relation":"main_file","file_size":93470129,"date_created":"2025-12-22T13:45:33Z","checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","creator":"sagafono","file_name":"SourceData.zip"},{"creator":"sagafono","file_name":"readme.txt","relation":"main_file","file_size":461,"checksum":"08facd1b4a102f83e4d99d48a85b258d","date_created":"2025-12-22T13:51:09Z","success":1,"content_type":"text/plain","date_updated":"2025-12-22T13:51:09Z","access_level":"open_access","file_id":"20856"}]},{"quality_controlled":"1","year":"2025","conference":{"start_date":"2025-12-01","end_date":"2025-12-05","name":"TCC: Theory of Cryptography","location":"Aarhus, Denmark"},"language":[{"iso":"eng"}],"volume":16269,"article_processing_charge":"No","month":"12","page":"259-290","scopus_import":"1","doi":"10.1007/978-3-032-12293-3_9","citation":{"short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","ama":"Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular evasive LWE. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16269. Springer Nature; 2025:259-290. doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>","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.","ieee":"S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive and circular evasive LWE,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.","chicago":"Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” In <i>23rd International Conference on Theory of Cryptography</i>, 16269:259–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>.","apa":"Agrawal, S., Modi, A., Yadav, A., &#38; Yamada, S. (2025). Zeroizing attacks against evasive and circular evasive LWE. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>","mla":"Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16269, Springer Nature, 2025, pp. 259–90, doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>."},"abstract":[{"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.","lang":"eng"}],"publication_status":"published","type":"conference","publisher":"Springer Nature","intvolume":"     16269","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2025-12-29T11:51:13Z","alternative_title":["LNCS"],"author":[{"first_name":"Shweta","last_name":"Agrawal","full_name":"Agrawal, Shweta"},{"full_name":"Modi, Anuja","last_name":"Modi","first_name":"Anuja"},{"id":"dc8f1524-403e-11ee-bf07-9649ad996e21","first_name":"Anshu","last_name":"Yadav","full_name":"Yadav, Anshu"},{"last_name":"Yamada","first_name":"Shota","full_name":"Yamada, Shota"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/375"}],"title":"Zeroizing attacks against evasive and circular evasive LWE","OA_place":"repository","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.","day":"05","department":[{"_id":"KrPi"}],"date_published":"2025-12-05T00:00:00Z","OA_type":"green","publication_identifier":{"isbn":["9783032122926"],"eissn":["1611-3349"],"issn":["0302-9743"]},"oa":1,"oa_version":"Preprint","date_created":"2025-12-21T23:01:33Z","_id":"20845","publication":"23rd International Conference on Theory of Cryptography"},{"year":"2025","conference":{"location":"Aarhus, Denmark","name":"TCC: Theory of Cryptography","end_date":"2025-12-05","start_date":"2025-12-01"},"quality_controlled":"1","volume":16271,"language":[{"iso":"eng"}],"article_processing_charge":"No","page":"478-511","month":"12","doi":"10.1007/978-3-032-12290-2_16","scopus_import":"1","abstract":[{"lang":"eng","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."}],"citation":{"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.","ieee":"N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained verifiable random functions without obfuscation and friends,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16271, pp. 478–511.","chicago":"Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal, and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation and Friends.” In <i>23rd International Conference on Theory of Cryptography</i>, 16271:478–511. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>.","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.","ama":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable random functions without obfuscation and friends. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:478-511. doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>","mla":"Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation and Friends.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16271, Springer Nature, 2025, pp. 478–511, doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>.","apa":"Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., &#38; Wohnig, S. (2025). Constrained verifiable random functions without obfuscation and friends. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16271, pp. 478–511). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>"},"type":"conference","publisher":"Springer Nature","corr_author":"1","publication_status":"published","intvolume":"     16271","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-12-29T11:11:29Z","status":"public","alternative_title":["LNCS"],"title":"Constrained verifiable random functions without obfuscation and friends","author":[{"last_name":"Brandt","first_name":"Nicholas","full_name":"Brandt, Nicholas"},{"full_name":"Cueto Noval, Miguel","orcid":"0000-0002-2505-4246","last_name":"Cueto Noval","first_name":"Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc"},{"first_name":"Christoph Ullrich","last_name":"Günther","full_name":"Günther, Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1"},{"id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","full_name":"Ünal, Akin","last_name":"Ünal","first_name":"Akin"},{"first_name":"Stella","last_name":"Wohnig","full_name":"Wohnig, Stella"}],"main_file_link":[{"url":"https://eprint.iacr.org/2025/1045","open_access":"1"}],"department":[{"_id":"KrPi"}],"day":"05","OA_place":"repository","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.","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122896"]},"OA_type":"green","date_published":"2025-12-05T00:00:00Z","oa":1,"project":[{"grant_number":"F8509","_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","name":"Security and Privacy by Design for Complex Systems"}],"_id":"20846","oa_version":"Preprint","date_created":"2025-12-21T23:01:34Z","publication":"23rd International Conference on Theory of Cryptography"},{"date_created":"2025-12-21T23:01:34Z","oa_version":"Published Version","article_number":"065418","_id":"20847","project":[{"grant_number":"E 298","_id":"bd8eede5-d553-11ed-ba76-eaded0d13485","name":"MixQUIckR: Mixing with QUIncke Rollers"},{"grant_number":"949120","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics"}],"publication":"Physical Review E","file":[{"access_level":"open_access","date_updated":"2025-12-29T11:15:42Z","success":1,"content_type":"application/pdf","file_id":"20862","file_name":"2025_PhysReviewE_Fitzgerald.pdf","creator":"dernst","date_created":"2025-12-29T11:15:42Z","checksum":"d593e933f976c3f3cde37ad66539d57d","file_size":2131491,"relation":"main_file"}],"date_published":"2025-12-01T00:00:00Z","arxiv":1,"publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"OA_type":"hybrid","oa":1,"external_id":{"arxiv":["2508.05643"]},"title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","author":[{"id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa","last_name":"Fitzgerald","first_name":"Eavan","full_name":"Fitzgerald, Eavan"},{"id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8","last_name":"Clavaud","first_name":"Cécile","orcid":"0000-0002-1843-3803","full_name":"Clavaud, Cécile"},{"last_name":"Das","first_name":"Debasish","full_name":"Das, Debasish"},{"id":"a550210f-223c-11ec-8182-e2d45e817efb","last_name":"Lenton","first_name":"Isaac C","orcid":"0000-0002-5010-6984","full_name":"Lenton, Isaac C"},{"orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","first_name":"Scott R","last_name":"Waitukaitis","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"}],"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. ","OA_place":"publisher","article_type":"original","ec_funded":1,"day":"01","department":[{"_id":"ScWa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_updated":"2025-12-29T11:19:34Z","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)"},"publication_status":"published","publisher":"American Physical Society","corr_author":"1","type":"journal_article","has_accepted_license":"1","intvolume":"       112","PlanS_conform":"1","scopus_import":"1","doi":"10.1103/1ss8-31rb","citation":{"short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","ama":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. 2025;112(6). doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>","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,” <i>Physical Review E</i>, vol. 112, no. 6. American Physical Society, 2025.","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.” <i>Physical Review E</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>.","apa":"Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., &#38; Waitukaitis, S. R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>","mla":"Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” <i>Physical Review E</i>, vol. 112, no. 6, 065418, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>."},"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."}],"article_processing_charge":"Yes (via OA deal)","month":"12","file_date_updated":"2025-12-29T11:15:42Z","issue":"6","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"quality_controlled":"1","ddc":["530"],"year":"2025","language":[{"iso":"eng"}],"volume":112},{"doi":"10.1093/genetics/iyaf220","scopus_import":"1","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."}],"citation":{"ista":"Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift balance models of complex diseases. Genetics. 231(4), iyaf220.","chicago":"Berg, Jeremy J., Xinyi Li, Kellen Riall, Laura Hayward, and Guy Sella. “Mutation–Selection–Drift Balance Models of Complex Diseases.” <i>Genetics</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/genetics/iyaf220\">https://doi.org/10.1093/genetics/iyaf220</a>.","ieee":"J. J. Berg, X. Li, K. Riall, L. Hayward, and G. Sella, “Mutation–selection–drift balance models of complex diseases,” <i>Genetics</i>, vol. 231, no. 4. Oxford University Press, 2025.","ama":"Berg JJ, Li X, Riall K, Hayward L, Sella G. Mutation–selection–drift balance models of complex diseases. <i>Genetics</i>. 2025;231(4). doi:<a href=\"https://doi.org/10.1093/genetics/iyaf220\">10.1093/genetics/iyaf220</a>","short":"J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).","mla":"Berg, Jeremy J., et al. “Mutation–Selection–Drift Balance Models of Complex Diseases.” <i>Genetics</i>, vol. 231, no. 4, iyaf220, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/genetics/iyaf220\">10.1093/genetics/iyaf220</a>.","apa":"Berg, J. J., Li, X., Riall, K., Hayward, L., &#38; Sella, G. (2025). Mutation–selection–drift balance models of complex diseases. <i>Genetics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/genetics/iyaf220\">https://doi.org/10.1093/genetics/iyaf220</a>"},"publisher":"Oxford University Press","type":"journal_article","publication_status":"published","intvolume":"       231","has_accepted_license":"1","year":"2025","ddc":["570"],"quality_controlled":"1","volume":231,"language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","file_date_updated":"2025-12-29T11:27:51Z","issue":"4","month":"12","OA_type":"hybrid","publication_identifier":{"issn":["0016-6731"],"eissn":["1943-2631"]},"date_published":"2025-12-01T00:00:00Z","oa":1,"external_id":{"pmid":["41073879"]},"_id":"20848","pmid":1,"date_created":"2025-12-21T23:01:34Z","oa_version":"Published Version","article_number":"iyaf220","file":[{"creator":"dernst","file_name":"2025_Genetics_Berg.pdf","relation":"main_file","file_size":1182339,"checksum":"b02eb6b78028b8bef435edc8435a8468","date_created":"2025-12-29T11:27:51Z","success":1,"content_type":"application/pdf","date_updated":"2025-12-29T11:27:51Z","access_level":"open_access","file_id":"20863"}],"publication":"Genetics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2025-12-29T11:29:16Z","tmp":{"short":"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","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"status":"public","author":[{"full_name":"Berg, Jeremy J.","last_name":"Berg","first_name":"Jeremy J."},{"full_name":"Li, Xinyi","last_name":"Li","first_name":"Xinyi"},{"full_name":"Riall, Kellen","last_name":"Riall","first_name":"Kellen"},{"id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b","last_name":"Hayward","first_name":"Laura","full_name":"Hayward, Laura"},{"first_name":"Guy","last_name":"Sella","full_name":"Sella, Guy"}],"title":"Mutation–selection–drift balance models of complex diseases","department":[{"_id":"NiBa"}],"day":"01","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.","OA_place":"publisher","article_type":"original"},{"has_accepted_license":"1","intvolume":"       122","publication_status":"published","corr_author":"1","publisher":"National Academy of Sciences","type":"journal_article","citation":{"mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51, National Academy of Sciences, 2025, p. e2524109122, doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>.","apa":"Svoboda, J., &#38; Chatterjee, K. (2025). Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary Games.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2025. <a href=\"https://doi.org/10.1073/pnas.2524109122\">https://doi.org/10.1073/pnas.2524109122</a>.","ieee":"J. Svoboda and K. Chatterjee, “Promoters of cooperation in evolutionary games,” <i>Proceedings of the National Academy of Sciences</i>, vol. 122, no. 51. National Academy of Sciences, p. e2524109122, 2025.","ista":"Svoboda J, Chatterjee K. 2025. Promoters of cooperation in evolutionary games. Proceedings of the National Academy of Sciences. 122(51), e2524109122.","ama":"Svoboda J, Chatterjee K. Promoters of cooperation in evolutionary games. <i>Proceedings of the National Academy of Sciences</i>. 2025;122(51):e2524109122. doi:<a href=\"https://doi.org/10.1073/pnas.2524109122\">10.1073/pnas.2524109122</a>","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences 122 (2025) e2524109122."},"abstract":[{"lang":"eng","text":"Evolutionary games provide a flexible mathematical framework for many problems in biology and social evolution. Prisoners’ dilemma, and in particular, the important special case of donation games, represents social dilemmas where cooperation is mutually beneficial, yet defection is preferred by selfish agents. In evolutionary games on networks, the agents interact over a population structure. The existence of population structures that promote cooperative behavior is a fascinating and active research topic. Previous research establishes structures promoting cooperation in the limit of weak selection where the benefit-to-cost ratio β exceeds 1.5. The existence of such structures for medium and strong selection for 1 < ß < 2 and for weak selection for 1 < ß < 1.5 has been a long-standing open question. First, we answer the open questions in the affirmative: For every selection strength and every ß > 1, we construct networks promoting cooperation. Second, we present a robustness result with respect to β and selection strength: Our structures promote cooperation for a range of these parameter values rather than specific parameter values. Finally, we supplement our theoretical results with simulation results on small population structures that show the effectiveness of our construction over well-studied population structures."}],"scopus_import":"1","doi":"10.1073/pnas.2524109122","month":"12","file_date_updated":"2025-12-29T09:36:50Z","page":"e2524109122","issue":"51","article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"volume":122,"quality_controlled":"1","ddc":["000"],"year":"2025","publication":"Proceedings of the National Academy of Sciences","file":[{"relation":"main_file","date_created":"2025-12-29T09:36:50Z","checksum":"dd50b62a1efc28c0133fe9c11dbee53c","file_size":2308124,"creator":"dernst","file_name":"2025_PNAS_Svoboda.pdf","file_id":"20860","date_updated":"2025-12-29T09:36:50Z","content_type":"application/pdf","success":1,"access_level":"open_access"}],"date_created":"2025-12-28T23:01:26Z","oa_version":"Published Version","_id":"20857","pmid":1,"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"oa":1,"external_id":{"pmid":["41397136"]},"date_published":"2025-12-15T00:00:00Z","publication_identifier":{"eissn":["1091-6490"]},"OA_type":"hybrid","acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.","article_type":"original","APC_amount":"3003,56 EUR","OA_place":"publisher","ec_funded":1,"day":"15","department":[{"_id":"KrCh"}],"title":"Promoters of cooperation in evolutionary games","author":[{"last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"}],"status":"public","date_updated":"2026-05-20T08:13:17Z","tmp":{"short":"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","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"doi":"10.1080/00107514.2025.2586370","scopus_import":"1","abstract":[{"text":"Studies of the distant Universe are providing key insights into our understanding of the formation of galaxies. The advent of the James Webb Space Telescope (JWST) has significantly enhanced our observational capabilities, leading to an expanded redshift frontier, providing unprecedented detail in the characterisation of early galaxies and enabling the discovery of new populations of accreting black holes. This review aims to provide an introduction to the basic processes and components that shape the observed spectra of galaxies, with a focus on their relevance to techniques with which high-redshift galaxies are selected. The review further introduces specific topics that have attracted significant attention in recent literature, including the discovery of highly efficient galaxy formation in the early Universe, the relation between galaxies and the process of reionization, new insights into the formation of the first stars and the enrichment of interstellar gas with heavy elements, and breakthroughs in our understanding of the origins of supermassive black holes.","lang":"eng"}],"citation":{"apa":"Matthee, J. J. (2025). JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. <i>Contemporary Physics</i>. Taylor &#38; Francis. <a href=\"https://doi.org/10.1080/00107514.2025.2586370\">https://doi.org/10.1080/00107514.2025.2586370</a>","mla":"Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments in Studies of Early Galaxies.” <i>Contemporary Physics</i>, vol. 66, no. 1–4, Taylor &#38; Francis, 2025, pp. 116–51, doi:<a href=\"https://doi.org/10.1080/00107514.2025.2586370\">10.1080/00107514.2025.2586370</a>.","short":"J.J. Matthee, Contemporary Physics 66 (2025) 116–151.","ama":"Matthee JJ. JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. <i>Contemporary Physics</i>. 2025;66(1-4):116-151. doi:<a href=\"https://doi.org/10.1080/00107514.2025.2586370\">10.1080/00107514.2025.2586370</a>","ieee":"J. J. Matthee, “JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies,” <i>Contemporary Physics</i>, vol. 66, no. 1–4. Taylor &#38; Francis, pp. 116–151, 2025.","chicago":"Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments in Studies of Early Galaxies.” <i>Contemporary Physics</i>. Taylor &#38; Francis, 2025. <a href=\"https://doi.org/10.1080/00107514.2025.2586370\">https://doi.org/10.1080/00107514.2025.2586370</a>.","ista":"Matthee JJ. 2025. JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies. Contemporary Physics. 66(1–4), 116–151."},"publisher":"Taylor & Francis","type":"journal_article","corr_author":"1","publication_status":"published","intvolume":"        66","year":"2025","quality_controlled":"1","volume":66,"language":[{"iso":"eng"}],"article_processing_charge":"No","page":"116-151","issue":"1-4","month":"12","arxiv":1,"OA_type":"green","publication_identifier":{"eissn":["1366-5812"],"issn":["0010-7514"]},"date_published":"2025-12-04T00:00:00Z","oa":1,"external_id":{"arxiv":["2511.04843"]},"_id":"20864","project":[{"grant_number":"101076224","_id":"bd9b2118-d553-11ed-ba76-db24564edfea","name":"Young galaxies as tracers and agents of cosmic reionization"}],"date_created":"2025-12-29T12:05:25Z","oa_version":"Preprint","publication":"Contemporary Physics","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_updated":"2026-04-07T08:44:00Z","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.04843"}],"author":[{"last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"}],"title":"JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies","day":"04","department":[{"_id":"JoMa"}],"acknowledgement":"I thank Claudia Di Cesare, Edoardo Iani, Gauri Kotiwale and Wendy Sun for proofreading, Daichi Kashino, Gauri Kotiwale, Sara Mascia, Benjamín Navarette and Joris Witstok for their assistance in preparing some of the Figures, and Richard Ellis and Stephen Blundell for constructive comments. Funded by the European Union (ERC, AGENTS, 101076224).","article_type":"original","OA_place":"repository"},{"publication":"Acta Informatica","file":[{"date_updated":"2026-01-05T12:26:43Z","success":1,"content_type":"application/pdf","access_level":"open_access","file_id":"20944","creator":"dernst","file_name":"2025_ActaInformatica_Bartocci.pdf","relation":"main_file","date_created":"2026-01-05T12:26:43Z","checksum":"06ed45a1218ad8464818803ae2968aaf","file_size":7117003}],"date_created":"2025-12-29T12:07:12Z","article_number":"43","oa_version":"Published Version","_id":"20866","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"name":"Interface Theory for Security and Privacy","grant_number":"F8502","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"}],"oa":1,"external_id":{"arxiv":["2305.02836"]},"date_published":"2025-12-09T00:00:00Z","arxiv":1,"publication_identifier":{"issn":["0001-5903"],"eissn":["1432-0525"]},"OA_type":"hybrid","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF) SFB project SpyCoDe 10.55776/F85, by the FWF projects ZK-35 and W1255-N23, and by the ERC Advanced Grant VAMOS 101020093. Open access funding provided by Institute of Science and Technology (IST Austria).","article_type":"original","OA_place":"publisher","ec_funded":1,"department":[{"_id":"ToHe"}],"day":"09","title":"Hypernode automata","author":[{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87","full_name":"Nickovic, Dejan","first_name":"Dejan","last_name":"Nickovic"},{"last_name":"Oliveira da Costa","first_name":"Ana","orcid":"0000-0002-8741-5799","full_name":"Oliveira da Costa, Ana","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4"}],"status":"public","date_updated":"2026-01-05T12:27:41Z","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)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","intvolume":"        62","publication_status":"published","corr_author":"1","type":"journal_article","publisher":"Springer Nature","citation":{"ama":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode automata. <i>Acta Informatica</i>. 2025;62(4). doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>","short":"E. Bartocci, M. Chalupa, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa, Acta Informatica 62 (2025).","chicago":"Bartocci, Ezio, Marek Chalupa, Thomas A Henzinger, Dejan Nickovic, and Ana Oliveira da Costa. “Hypernode Automata.” <i>Acta Informatica</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>.","ista":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Hypernode automata. Acta Informatica. 62(4), 43.","ieee":"E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da Costa, “Hypernode automata,” <i>Acta Informatica</i>, vol. 62, no. 4. Springer Nature, 2025.","mla":"Bartocci, Ezio, et al. “Hypernode Automata.” <i>Acta Informatica</i>, vol. 62, no. 4, 43, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00236-025-00509-8\">10.1007/s00236-025-00509-8</a>.","apa":"Bartocci, E., Chalupa, M., Henzinger, T. A., Nickovic, D., &#38; Oliveira da Costa, A. (2025). Hypernode automata. <i>Acta Informatica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00236-025-00509-8\">https://doi.org/10.1007/s00236-025-00509-8</a>"},"abstract":[{"text":"In this work, we present hypernode automata as a specification formalism for hyperproperties of systems whose executions may be misaligned among themselves, such as concurrent systems. These automata consist of nodes labeled with hypernode logic formulas and transitions marked with synchronizing actions. Hypernode logic formulas establish relations between sequences of variable values among different system executions. This logic enables both synchronous and asynchronous analysis of traces. In its asynchronous view on execution traces, hypernode formulas establish relations on the order of value changes for each variable without correlating their timing. In both views, the analysis of different execution traces is synchronized through the transitions of hypernode automata. By combining logic’s declarative nature with automata’s procedural power, hypernode automata seamlessly integrate asynchronicity requirements at the node level with synchronicity between node transitions. We show that the model-checking problem for hypernode automata is decidable for specifications where each node specifies either a synchronous or an asynchronous requirement for the system’s executions, but not both.","lang":"eng"}],"scopus_import":"1","doi":"10.1007/s00236-025-00509-8","related_material":{"record":[{"id":"14405","relation":"earlier_version","status":"public"}]},"month":"12","file_date_updated":"2026-01-05T12:26:43Z","issue":"4","article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"volume":62,"quality_controlled":"1","ddc":["000"],"year":"2025"}]