[{"oa_version":"Published Version","acknowledgement":"This project was supported by the following funding agencies: ERC under the European\r\nUnion's Horizon 2020 research and innovation program (ERC Advanced Grants No 692692\r\n“GIANTSYN” and 101199096 “CA3-SYNGRAM” to P.J.), the Fonds zur Förderung der\r\nwissenschaftlichen Forschung (P 36232-B, stand-alone grant, PAT 4178023, principal\r\ninvestigator project, and 10.55776/CoE 16 “GABA neurons” to P.J.), and the European Union’s\r\nHorizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant\r\nagreement (No 101034413, to K.L.).","type":"dissertation","_id":"22735","file_date_updated":"2026-08-26T10:09:53Z","month":"08","language":[{"iso":"eng"}],"date_published":"2026-08-25T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-08-31T11:11:55Z","ec_funded":1,"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"alternative_title":["ISTA Thesis"],"status":"public","day":"25","citation":{"ama":"Lin P. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22735\">10.15479/AT-ISTA-22735</a>","ista":"Lin P. 2026. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. Institute of Science and Technology Austria.","short":"P. Lin, Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses, Institute of Science and Technology Austria, 2026.","ieee":"P. Lin, “Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses,” Institute of Science and Technology Austria, 2026.","mla":"Lin, Peipeng. <i>Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22735\">10.15479/AT-ISTA-22735</a>.","chicago":"Lin, Peipeng. “Calibrating the Teacher Synapse: Mechanisms and Functional Significance of Presynaptic Inhibition at Hippocampal Mossy Fiber Synapses.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22735\">https://doi.org/10.15479/AT-ISTA-22735</a>.","apa":"Lin, P. (2026). <i>Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22735\">https://doi.org/10.15479/AT-ISTA-22735</a>"},"project":[{"name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","call_identifier":"H2020","grant_number":"692692","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425"},{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","grant_number":"101199096","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b"},{"grant_number":"P36232","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","name":"Mechanisms of GABA release in hippocampal circuits"},{"name":"Synaptic networks of human brain","grant_number":"PAT 4178023","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Lin","first_name":"Peipeng","full_name":"Lin, Peipeng","id":"7E3060D0-A92C-11E9-A326-26C8E5697425"}],"OA_place":"publisher","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"},{"_id":"Bio"}],"page":"88","article_processing_charge":"No","publication_status":"published","degree_awarded":"PhD","title":"Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses","supervisor":[{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"}],"doi_confirm":"1","year":"2026","date_created":"2026-08-18T15:23:41Z","researchdata_availability":"upon request","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-088-6"]},"doi":"10.15479/AT-ISTA-22735","das_tickbox":"0","corr_author":"1","supplementarymaterial":"yes","file":[{"embargo":"2027-09-01","file_id":"22765","date_updated":"2026-08-26T10:09:48Z","embargo_to":"open_access","file_size":6376229,"relation":"main_file","checksum":"13cc7ead72aad90a134f310b531c73cd","access_level":"closed","file_name":"2026_Lin_Peipeng_Thesis.pdf","content_type":"application/pdf","date_created":"2026-08-26T10:09:48Z","creator":"plin"},{"access_level":"closed","checksum":"8c9c1445a7df284377be1a8c9dadd7c5","relation":"source_file","date_updated":"2026-08-26T10:09:53Z","file_size":17681883,"file_id":"22766","creator":"plin","date_created":"2026-08-26T10:09:53Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2026_Lin_Peipeng_Thesis.docx"}],"has_accepted_license":"1","ddc":["571","573"]},{"article_processing_charge":"No","abstract":[{"text":"Bacteria, like eukaryotes, use conserved cytoskeletal systems for intracellular organization. The plasmid-encoded ParMRC system forms actin-like filaments that segregate low–copy number plasmids. In multicellular cyanobacteria such as Anabaena sp., we found that a chromosomally encoded ParMR system has evolved into a cytoskeletal system named CorMR with a function in cell shape control rather than DNA segregation. Live-cell imaging, in vitro reconstitution, and cryo–electron microscopy revealed that CorM formed dynamically unstable, antiparallel double-stranded filaments that were recruited to the membrane by CorR through an amphipathic helix conserved in multicellular cyanobacteria. CorMR filaments were regulated by MinC, which excluded them from the poles and division plane. Comparative genomics indicated that the repurposing of ParMR and Min systems coevolved with cyanobacterial multicellularity, highlighting the evolutionary plasticity of cytoskeletal systems in bacteria.","lang":"eng"}],"external_id":{"pmid":["41990175"]},"publication_status":"published","title":"Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"b4eb62ef-ac72-11ed-9503-ed3b4d66c083","orcid":"0000-0002-3461-5391","full_name":"Springstein, Benjamin L","last_name":"Springstein","first_name":"Benjamin L"},{"last_name":"Javoor","first_name":"Manjunath","full_name":"Javoor, Manjunath","orcid":"0000-0003-2311-2112","id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2"},{"full_name":"Megrian, Daniela","last_name":"Megrian","first_name":"Daniela"},{"full_name":"Hajdu, Roman","id":"ffab949d-133f-11ed-8f02-94de21ace503","last_name":"Hajdu","first_name":"Roman"},{"last_name":"Hanke","first_name":"Dustin M.","full_name":"Hanke, Dustin M."},{"first_name":"Bettina","last_name":"Zens","id":"45FD126C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9561-1239","full_name":"Zens, Bettina"},{"full_name":"Weiss, Gregor L.","first_name":"Gregor L.","last_name":"Weiss"},{"full_name":"Schur, Florian Km","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","last_name":"Schur","first_name":"Florian Km"},{"full_name":"Loose, Martin","orcid":"0000-0001-7309-9724","id":"462D4284-F248-11E8-B48F-1D18A9856A87","last_name":"Loose","first_name":"Martin"}],"volume":392,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"ScienComp"},{"_id":"EM-Fac"},{"_id":"LifeSc"}],"related_material":{"record":[{"id":"22744","relation":"dissertation_contains","status":"public"}]},"pmid":1,"corr_author":"1","quality_controlled":"1","year":"2026","date_created":"2026-04-26T22:01:46Z","article_number":"eaea6343","issue":"6795","publication_identifier":{"issn":["0036-8075"],"eissn":["1095-9203"]},"doi":"10.1126/science.aea6343","publication":"Science","month":"04","language":[{"iso":"eng"}],"date_published":"2026-04-16T00:00:00Z","publisher":"AAAS","department":[{"_id":"MaLo"},{"_id":"FlSc"},{"_id":"GradSch"},{"_id":"EM-Fac"}],"date_updated":"2026-09-03T09:36:24Z","article_type":"original","intvolume":"       392","oa_version":"None","type":"journal_article","acknowledgement":"We thank all members of the Loose lab at ISTA for helpful discussions; M. Kojic for critical reading of the manuscript; A. Herrero (Sevilla University) for sharing her extensive BACTH plasmid library and other plasmids, as well as cyanobacterial strains; T. Dagan and F. Nies (both Kiel University) for sharing cyanobacterial strains and plasmids and for valuable discussions; N. Sapay and A. Michon for providing the Amphipaseek code, which enabled us to perform our large-scale amphipathic helix screen of cyanobacterial CorR proteins; V.-V. Hodirnau for support in cryo-ET data collection; and J. Hansen for advice about cryo-EM data processing.\r\nThis work was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Imaging & Optics Facility (IOF), the Scientific Computing (SciComp), the Electron Microscopy Facility (EMF), and the Lab Support Facility (LSF). This work was funded by the European Union’s Horizon 2020 research and innovation program (Marie Skłodowska-Curie grant 101034413 to B.L.S.); the European Research Council (ERC) of the European Union (grant ActinID 101076260 to F.K.M.S.); the Swiss National Science Foundation (starting grant TMSGI3_226208 to G.L.W.); and the Jean-Jacques et Letitia Lopez-Loreta Foundation (G.L.W.).","_id":"21762","scopus_import":"1","citation":{"ista":"Springstein BL, Javoor M, Megrian D, Hajdu R, Hanke DM, Zens B, Weiss GL, Schur FK, Loose M. 2026. Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape. Science. 392(6795), eaea6343.","ama":"Springstein BL, Javoor M, Megrian D, et al. Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape. <i>Science</i>. 2026;392(6795). doi:<a href=\"https://doi.org/10.1126/science.aea6343\">10.1126/science.aea6343</a>","ieee":"B. L. Springstein <i>et al.</i>, “Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape,” <i>Science</i>, vol. 392, no. 6795. AAAS, 2026.","short":"B.L. Springstein, M. Javoor, D. Megrian, R. Hajdu, D.M. Hanke, B. Zens, G.L. Weiss, F.K. Schur, M. Loose, Science 392 (2026).","mla":"Springstein, Benjamin L., et al. “Repurposing of a DNA Segregation Machinery into a Cytoskeletal System Controlling Cell Shape.” <i>Science</i>, vol. 392, no. 6795, eaea6343, AAAS, 2026, doi:<a href=\"https://doi.org/10.1126/science.aea6343\">10.1126/science.aea6343</a>.","apa":"Springstein, B. L., Javoor, M., Megrian, D., Hajdu, R., Hanke, D. M., Zens, B., … Loose, M. (2026). Repurposing of a DNA segregation machinery into a cytoskeletal system controlling cell shape. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.aea6343\">https://doi.org/10.1126/science.aea6343</a>","chicago":"Springstein, Benjamin L, Manjunath Javoor, Daniela Megrian, Roman Hajdu, Dustin M. Hanke, Bettina Zens, Gregor L. Weiss, Florian KM Schur, and Martin Loose. “Repurposing of a DNA Segregation Machinery into a Cytoskeletal System Controlling Cell Shape.” <i>Science</i>. AAAS, 2026. <a href=\"https://doi.org/10.1126/science.aea6343\">https://doi.org/10.1126/science.aea6343</a>."},"project":[{"grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"},{"grant_number":"101076260","_id":"bd980d18-d553-11ed-ba76-ceaa645c97eb","name":"A molecular atlas of Actin filament IDentities in the cell motility machinery"}],"ec_funded":1,"OA_type":"closed access","day":"16","status":"public"},{"publication_status":"published","article_processing_charge":"No","OA_embargo":"12","page":"121","supervisor":[{"full_name":"Schur, Florian KM","orcid":"0000-0003-4790-8078","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur"},{"orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K","last_name":"Sixt","first_name":"Michael K"}],"keyword":["Actin cytoskeleton","Cell migration","cryo-electron tomography"],"doi_confirm":"1","title":"Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography","degree_awarded":"PhD","OA_place":"publisher","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"last_name":"Javoor","first_name":"Manjunath","orcid":"0000-0003-2311-2112","id":"305ab18b-dc7d-11ea-9b2f-b58195228ea2","full_name":"Javoor, Manjunath"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"12334"},{"id":"21762","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"19795","relation":"part_of_dissertation"},{"id":"12421","relation":"part_of_dissertation","status":"public"}]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"file":[{"file_id":"22767","file_size":27430796,"date_updated":"2026-08-27T12:48:42Z","relation":"source_file","checksum":"f9c2847df9f1ac5a3d60c06b3b81a450","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"2026_Javoor_Manjunath_Thesis.docx","date_created":"2026-08-26T12:02:47Z","creator":"mjavoor"},{"date_created":"2026-08-26T12:02:46Z","file_name":"2026_Javoor_Manjunath_Thesis.pdf","content_type":"application/pdf","creator":"mjavoor","embargo":"2027-08-21","file_id":"22768","access_level":"closed","relation":"main_file","checksum":"8e9b4c0fcafbccf5c3796eacc9134a08","date_updated":"2026-08-26T12:02:46Z","file_size":19489230,"embargo_to":"open_access"}],"corr_author":"1","ddc":["570"],"has_accepted_license":"1","date_created":"2026-08-21T09:11:04Z","year":"2026","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-090-9 "]},"doi":"10.15479/AT-ISTA-22744","file_date_updated":"2026-08-27T12:48:42Z","date_updated":"2026-09-03T09:36:24Z","department":[{"_id":"GradSch"},{"_id":"FlSc"},{"_id":"MiSi"}],"publisher":"Institute of Science and Technology Austria ","date_published":"2026-08-21T00:00:00Z","language":[{"iso":"eng"}],"month":"08","type":"dissertation","acknowledgement":"This work was supported by the ERC StG grant ActinID (PRA01221F1049A) awarded to Florian\r\nSchur, the ERC-SyG grant Pushing from within (P01071793) awarded to Michael Sixt, and by ISTA.\r\nI would like to thank the Scientific Service Units at ISTA for their essential support throughout\r\nthis work. In particular, I am grateful to the Electron Microscopy Facility, Imaging and Optics\r\nFacility, Zebrafish Facility, Scientific Computing Facility, and Lab Support Facility for their services,\r\nand technical support, all of which were important for the successful completion of this project.","oa_version":"None","_id":"22744","project":[{"_id":"bd980d18-d553-11ed-ba76-ceaa645c97eb","grant_number":"101076260","name":"A molecular atlas of Actin filament IDentities in the cell motility machinery"},{"grant_number":"101071793","_id":"bd91e723-d553-11ed-ba76-fe7eeb2185fd","name":"Pushing from within: Control of cell shape, integrity and motility by cytoskeletal pushing forces"}],"citation":{"apa":"Javoor, M. (2026). <i>Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography</i>. Institute of Science and Technology Austria . <a href=\"https://doi.org/10.15479/AT-ISTA-22744\">https://doi.org/10.15479/AT-ISTA-22744</a>","chicago":"Javoor, Manjunath. “Large-Scale Imaging of Cellular Actin Networks at Single Filament Resolution Using Montage Cryo-Electron Tomography.” Institute of Science and Technology Austria , 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22744\">https://doi.org/10.15479/AT-ISTA-22744</a>.","mla":"Javoor, Manjunath. <i>Large-Scale Imaging of Cellular Actin Networks at Single Filament Resolution Using Montage Cryo-Electron Tomography</i>. Institute of Science and Technology Austria , 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22744\">10.15479/AT-ISTA-22744</a>.","ieee":"M. Javoor, “Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography,” Institute of Science and Technology Austria , 2026.","short":"M. Javoor, Large-Scale Imaging of Cellular Actin Networks at Single Filament Resolution Using Montage Cryo-Electron Tomography, Institute of Science and Technology Austria , 2026.","ama":"Javoor M. Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22744\">10.15479/AT-ISTA-22744</a>","ista":"Javoor M. 2026. Large-scale imaging of cellular actin networks at single filament resolution using montage cryo-electron tomography. Institute of Science and Technology Austria ."},"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"status":"public","day":"21","alternative_title":["ISTA Thesis"]},{"corr_author":"1","file":[{"creator":"dvijatov","date_created":"2026-08-10T13:35:39Z","file_name":"2026_Vijatovic_David_Thesis.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"e3acfea4b1a3abf99e74224656740a15","relation":"source_file","access_level":"closed","date_updated":"2026-08-10T13:35:39Z","file_size":14322760,"file_id":"22669"},{"file_id":"22695","embargo":"2027-08-10","embargo_to":"open_access","file_size":116926375,"date_updated":"2026-08-12T13:44:36Z","access_level":"closed","relation":"main_file","checksum":"dc8c78ae14f69e54faa41e65db5c6402","content_type":"application/pdf","file_name":"2026_Vijatovic_David_Thesis.pdf","date_created":"2026-08-12T13:44:36Z","creator":"dvijatov"}],"has_accepted_license":"1","ddc":["573"],"date_created":"2026-08-10T13:44:30Z","year":"2026","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-082-4"]},"doi":"10.15479/AT-ISTA-22667","article_processing_charge":"No","page":"172","publication_status":"published","supervisor":[{"full_name":"Sweeney, Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","orcid":"0000-0001-9242-5601","first_name":"Lora Beatrice Jaeger","last_name":"Sweeney"}],"doi_confirm":"1","degree_awarded":"PhD","title":"Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","author":[{"id":"cf391e77-ec3c-11ea-a124-d69323410b58","orcid":"0000-0002-5494-0941","full_name":"Vijatovic, David","first_name":"David","last_name":"Vijatovic"}],"OA_place":"publisher","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"21746"},{"id":"15016","relation":"part_of_dissertation","status":"public"}]},"citation":{"ieee":"D. Vijatovic, “Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis,” Institute of Science and Technology Austria, 2026.","short":"D. Vijatovic, Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis, Institute of Science and Technology Austria, 2026.","ista":"Vijatovic D. 2026. Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis. Institute of Science and Technology Austria.","ama":"Vijatovic D. Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22667\">10.15479/AT-ISTA-22667</a>","chicago":"Vijatovic, David. “Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22667\">https://doi.org/10.15479/AT-ISTA-22667</a>.","apa":"Vijatovic, D. (2026). <i>Dissecting the molecular and functional basis of motor control in the frog Xenopus laevis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22667\">https://doi.org/10.15479/AT-ISTA-22667</a>","mla":"Vijatovic, David. <i>Dissecting the Molecular and Functional Basis of Motor Control in the Frog Xenopus Laevis</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22667\">10.15479/AT-ISTA-22667</a>."},"project":[{"name":"Development and Evolution of Tetrapod Motor Circuits","_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","grant_number":"101041551"},{"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"},{"name":"Development of Viral Vectors for Amphibian Gene Delivery and Manipulation","_id":"34a02c70-11ca-11ed-8bc3-fbfd2c86c88f","grant_number":"3(GG016346-01)"}],"alternative_title":["ISTA Thesis"],"day":"10","status":"public","file_date_updated":"2026-08-12T13:44:36Z","date_published":"2026-08-10T00:00:00Z","language":[{"iso":"eng"}],"month":"08","date_updated":"2026-09-04T10:02:55Z","department":[{"_id":"GradSch"},{"_id":"LoSw"}],"publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","acknowledgement":"I am also grateful for the financial support that made this work possible, including the\r\nEuropean Research Council (ERC Starting Grant 101041551), the Austrian Science\r\nFund (FWF, Cluster of Excellence 10.55776/COE16), the GFF Lower Austria FTI\r\nStrategy Dissertation Fellowship (FTI21-D-046), and the FENS/IBRO-PERC\r\nExchange Fellowship. ","type":"dissertation","_id":"22667"},{"department":[{"_id":"GradSch"},{"_id":"CaHe"}],"publisher":"Institute of Science and Technology Austria","date_updated":"2026-09-04T12:49:45Z","month":"9","title":"Towards a deeper understanding of meroblastic cleavage - supplementary movies","doi_confirm":"1","date_published":"2026-09-04T00:00:00Z","oa":1,"file_date_updated":"2026-09-03T10:58:05Z","article_processing_charge":"No","_id":"22777","related_material":{"record":[{"status":"for_moderation","id":"22804","relation":"used_in_publication"}]},"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"}],"OA_place":"repository","type":"research_data","author":[{"first_name":"Xin","last_name":"Tong","full_name":"Tong, Xin","id":"50F65CDC-AA30-11E9-A72B-8A12E6697425"}],"oa_version":"None","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","has_accepted_license":"1","file":[{"success":1,"creator":"xtong","content_type":"text/plain","file_name":"README.txt","date_created":"2026-09-03T10:47:23Z","date_updated":"2026-09-03T10:47:23Z","file_size":223,"access_level":"open_access","checksum":"ba2d20babb1a8e437b41c513c4d226a4","relation":"main_file","file_id":"22779"},{"checksum":"59565d43eca072572e37c81d640b8450","relation":"main_file","access_level":"open_access","date_updated":"2026-09-03T10:53:55Z","file_size":1137586,"file_id":"22780","creator":"xtong","success":1,"date_created":"2026-09-03T10:53:55Z","file_name":"Movie S1_brightfield.avi","content_type":"video/avi"},{"content_type":"video/avi","file_name":"Movie S2_membrane.avi","date_created":"2026-09-03T10:58:05Z","success":1,"creator":"xtong","file_id":"22796","file_size":2400912,"date_updated":"2026-09-03T10:58:05Z","access_level":"open_access","relation":"main_file","checksum":"2c0740d4555b308e3248f1695042df7b"},{"access_level":"open_access","checksum":"79cd5fc64390332a64797e9b6a5cc8ba","relation":"main_file","date_updated":"2026-09-03T10:54:09Z","file_size":1881482,"file_id":"22781","success":1,"creator":"xtong","date_created":"2026-09-03T10:54:09Z","content_type":"video/avi","file_name":"Movie S3_furrow_geometry.avi"},{"file_id":"22782","date_updated":"2026-09-03T10:54:16Z","file_size":1613954,"relation":"main_file","checksum":"d67a958b90555207bd7282aa3ef3b26d","access_level":"open_access","file_name":"Movie S4_3D_reconstruction.avi","content_type":"video/avi","date_created":"2026-09-03T10:54:16Z","creator":"xtong","success":1},{"file_id":"22783","access_level":"open_access","checksum":"f41a1085575416d5a1d2fb2238a59c73","relation":"main_file","date_updated":"2026-09-03T10:54:25Z","file_size":2133352,"date_created":"2026-09-03T10:54:25Z","file_name":"Movie S5_Factin_low_mag.avi","content_type":"video/avi","success":1,"creator":"xtong"},{"date_updated":"2026-09-03T10:54:59Z","file_size":7393622,"access_level":"open_access","checksum":"17026cb264cb73e13d9d9ac8bea1cc8c","relation":"main_file","file_id":"22784","success":1,"creator":"xtong","content_type":"video/avi","file_name":"Movie S6_actin_in_furrow.avi","date_created":"2026-09-03T10:54:59Z"},{"creator":"xtong","success":1,"date_created":"2026-09-03T10:56:26Z","content_type":"video/avi","file_name":"Movie S7_Factin_myosin_high_res.avi","relation":"main_file","checksum":"010c876444b886d1387eb6a6048e0197","access_level":"open_access","file_size":39303510,"date_updated":"2026-09-03T10:56:26Z","file_id":"22785"},{"content_type":"video/avi","file_name":"Movie S8_wt-video_actin_flow_div_qxx_representative.avi","date_created":"2026-09-03T10:56:41Z","success":1,"creator":"xtong","file_id":"22786","file_size":53493338,"date_updated":"2026-09-03T10:56:41Z","access_level":"open_access","checksum":"bfafa5c1511c82c4add84de309bad1f8","relation":"main_file"},{"checksum":"9dc8da0bc297f10a3c2f1483c7193ab0","relation":"main_file","access_level":"open_access","date_updated":"2026-09-03T10:56:45Z","file_size":25447996,"file_id":"22787","creator":"xtong","success":1,"date_created":"2026-09-03T10:56:45Z","content_type":"video/avi","file_name":"Movie S9_double_ablation_image_qxx.avi"},{"date_updated":"2026-09-03T10:56:51Z","file_size":13258430,"access_level":"open_access","relation":"main_file","checksum":"a5092a927e0824f7b57ac38c7afce1be","file_id":"22788","success":1,"creator":"xtong","file_name":"Movie S10_laser_ablations.avi","content_type":"video/avi","date_created":"2026-09-03T10:56:51Z"},{"file_id":"22789","file_size":6224716,"date_updated":"2026-09-03T10:56:50Z","access_level":"open_access","checksum":"223717789c6c883b960d317da0bff8ec","relation":"main_file","file_name":"Movie S11_laser_ablation_flow_field.avi","content_type":"video/avi","date_created":"2026-09-03T10:56:50Z","success":1,"creator":"xtong"},{"date_created":"2026-09-03T10:56:58Z","file_name":"Movie S12_long_cut.avi","content_type":"video/avi","creator":"xtong","success":1,"file_id":"22790","relation":"main_file","checksum":"06287e939c40d9a6deef52c01b506491","access_level":"open_access","date_updated":"2026-09-03T10:56:58Z","file_size":11416868},{"content_type":"video/avi","file_name":"Movie S13_carhoa_phenotypes.avi","date_created":"2026-09-03T10:57:20Z","success":1,"creator":"xtong","file_id":"22791","date_updated":"2026-09-03T10:57:20Z","file_size":37334036,"access_level":"open_access","relation":"main_file","checksum":"6ddc1d526556e53fb2364e9c03135b6c"},{"file_id":"22792","access_level":"open_access","relation":"main_file","checksum":"34410ea9d4c79c8ce3cc6272d283f384","date_updated":"2026-09-03T10:57:17Z","file_size":24196604,"date_created":"2026-09-03T10:57:17Z","content_type":"video/avi","file_name":"Movie S14_carhoa-video_actin_flow_div_qxx_representative.avi","success":1,"creator":"xtong"},{"creator":"xtong","success":1,"date_created":"2026-09-03T10:57:20Z","content_type":"video/avi","file_name":"Movie S15_Cdh1_Factin.avi","relation":"main_file","checksum":"343f8d51cd1ff3f8bbdbbc0a86e7117f","access_level":"open_access","date_updated":"2026-09-03T10:57:20Z","file_size":3399188,"file_id":"22793"},{"file_id":"22794","date_updated":"2026-09-03T10:57:21Z","file_size":1253862,"relation":"main_file","checksum":"a48d888dc7994e54390c55deb0976f5a","access_level":"open_access","content_type":"video/avi","file_name":"Movie S16_cafree.avi","date_created":"2026-09-03T10:57:21Z","creator":"xtong","success":1},{"file_id":"22795","date_updated":"2026-09-03T10:57:22Z","file_size":2268762,"relation":"main_file","checksum":"ac4790a151352cc72534ec55468acebe","access_level":"open_access","content_type":"video/avi","file_name":"Movie S17_carhoa.avi","date_created":"2026-09-03T10:57:22Z","creator":"xtong","success":1}],"project":[{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"},{"name":"Design Principles of Branching Morphogenesis","call_identifier":"H2020","grant_number":"851288","_id":"05943252-7A3F-11EA-A408-12923DDC885E"}],"corr_author":"1","citation":{"apa":"Tong, X. (2026). Towards a deeper understanding of meroblastic cleavage - supplementary movies. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22777\">https://doi.org/10.15479/AT-ISTA-22777</a>","chicago":"Tong, Xin. “Towards a Deeper Understanding of Meroblastic Cleavage - Supplementary Movies.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22777\">https://doi.org/10.15479/AT-ISTA-22777</a>.","mla":"Tong, Xin. <i>Towards a Deeper Understanding of Meroblastic Cleavage - Supplementary Movies</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22777\">10.15479/AT-ISTA-22777</a>.","ieee":"X. Tong, “Towards a deeper understanding of meroblastic cleavage - supplementary movies.” Institute of Science and Technology Austria, 2026.","short":"X. Tong, (2026).","ama":"Tong X. Towards a deeper understanding of meroblastic cleavage - supplementary movies. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22777\">10.15479/AT-ISTA-22777</a>","ista":"Tong X. 2026. Towards a deeper understanding of meroblastic cleavage - supplementary movies, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-22777\">10.15479/AT-ISTA-22777</a>."},"status":"public","day":"4","doi":"10.15479/AT-ISTA-22777","ec_funded":1,"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"year":"2026","date_created":"2026-09-03T10:48:15Z"},{"language":[{"iso":"eng"}],"month":"06","date_published":"2026-06-01T00:00:00Z","publisher":"Cambridge University Press","department":[{"_id":"GradSch"},{"_id":"JaMa"}],"date_updated":"2026-09-04T22:31:07Z","isi":1,"oa":1,"DOAJ_listed":"1","file_date_updated":"2026-07-23T05:55:03Z","_id":"18706","scopus_import":"1","article_type":"original","intvolume":"        37","oa_version":"Published Version","type":"journal_article","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.","PlanS_conform":"1","citation":{"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.","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.","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>.","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>","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>."},"project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"status":"public","day":"01","OA_type":"gold","tmp":{"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)","short":"CC BY (4.0)"},"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"page":"614-642","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"}],"external_id":{"isi":["001381435800001"]},"publication_status":"published","related_material":{"record":[{"id":"20563","relation":"dissertation_contains","status":"public"}]},"author":[{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","first_name":"Lorenzo","last_name":"Portinale"},{"last_name":"Quattrocchi","first_name":"Filippo","full_name":"Quattrocchi, Filippo","orcid":"0009-0000-9773-1931","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":37,"OA_place":"publisher","has_accepted_license":"1","ddc":["500"],"supplementarymaterial":"no","quality_controlled":"1","file":[{"content_type":"application/pdf","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","date_created":"2026-07-23T05:55:03Z","success":1,"creator":"dernst","file_id":"22386","file_size":612317,"date_updated":"2026-07-23T05:55:03Z","access_level":"open_access","checksum":"d038f4d00cbfbde2672c17138eab21c9","relation":"main_file"}],"issue":"3","publication_identifier":{"issn":["0956-7925"],"eissn":["1469-4425"]},"doi":"10.1017/s0956792524000810","publication":"European Journal of Applied Mathematics","das_tickbox":"0","year":"2026","date_created":"2024-12-23T11:03:59Z","researchdata_availability":"no"},{"file_date_updated":"2026-06-22T08:54:32Z","oa":1,"date_published":"2025-09-08T00:00:00Z","month":"09","language":[{"iso":"eng"}],"date_updated":"2026-06-22T08:57:41Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrPi"}],"intvolume":"       343","oa_version":"Published Version","type":"conference","scopus_import":"1","_id":"22007","citation":{"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>","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>.","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>.","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara, CA, United States, 2025, vol. 343.","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."},"tmp":{"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)","short":"CC BY (4.0)"},"OA_type":"gold","alternative_title":["LIPIcs"],"day":"08","status":"public","article_processing_charge":"Yes","external_id":{"cryptoeprintid":["2025/723"]},"publication_status":"published","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."}],"keyword":["Time-Space Lower Bounds","Blockchains"],"title":"Time-space tradeoffs of truncation with preprocessing","cryptoeprintid":1,"author":[{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Wang, Pengxiang","first_name":"Pengxiang","last_name":"Wang"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","volume":343,"corr_author":"1","quality_controlled":"1","file":[{"content_type":"application/pdf","file_name":"2025_LIPIcs_Pietrzak.pdf","date_created":"2026-06-22T08:54:32Z","success":1,"creator":"dernst","file_id":"22118","date_updated":"2026-06-22T08:54:32Z","file_size":772046,"access_level":"open_access","checksum":"3f791b03df26853342855a9d9581cb58","relation":"main_file"}],"has_accepted_license":"1","ddc":["000"],"conference":{"location":"Santa Barbara, CA, United States","end_date":"2025-08-17","name":"ITC: Information Theoretic Cryptography","start_date":"2025-08-16"},"date_created":"2026-06-14T22:01:45Z","year":"2025","article_number":"4:1-4:10","doi":"10.4230/LIPIcs.ITC.2025.4","publication_identifier":{"isbn":["9783959773850"],"eissn":["1868-8969"]},"das_tickbox":"0","publication":"6th Conference on Information-Theoretic Cryptography"},{"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","type":"journal_article","oa_version":"Published Version","intvolume":"        37","article_type":"original","scopus_import":"1","_id":"12662","file_date_updated":"2025-12-30T06:39:11Z","oa":1,"date_updated":"2025-12-30T06:39:56Z","publisher":"Springer Nature","arxiv":1,"department":[{"_id":"ChLa"}],"date_published":"2025-10-01T00:00:00Z","month":"10","language":[{"iso":"eng"}],"tmp":{"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)","short":"CC BY (4.0)"},"OA_type":"hybrid","status":"public","day":"01","citation":{"ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 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.","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","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>.","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>.","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>"},"PlanS_conform":"1","OA_place":"publisher","volume":37,"author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter","first_name":"Peter","last_name":"Súkeník"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2208.13499"]},"publication_status":"published","abstract":[{"text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","page":"24669–24683","title":"Generalization in multi-objective machine learning","date_created":"2023-02-20T08:23:06Z","year":"2025","publication":"Neural Computing and Applications","doi":"10.1007/s00521-024-10616-1","publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"file":[{"file_name":"2025_NeuralCompApplic_Sukenik.pdf","content_type":"application/pdf","date_created":"2025-12-30T06:39:11Z","success":1,"creator":"dernst","file_id":"20877","file_size":500213,"date_updated":"2025-12-30T06:39:11Z","access_level":"open_access","checksum":"61ad4591aee16b1e02daf6c164321a42","relation":"main_file"}],"quality_controlled":"1","corr_author":"1","ddc":["004"],"has_accepted_license":"1"},{"has_accepted_license":"1","ddc":["000"],"conference":{"end_date":"2025-07-19","location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13"},"corr_author":"1","quality_controlled":"1","file":[{"creator":"dernst","success":1,"date_created":"2025-12-16T12:32:40Z","file_name":"2025_ICML_Sieberling.pdf","content_type":"application/pdf","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","relation":"main_file","access_level":"open_access","date_updated":"2025-12-16T12:32:40Z","file_size":908379,"file_id":"20828"}],"publication_identifier":{"eissn":["2640-3498"]},"publication":"42nd International Conference on Machine Learning","year":"2025","date_created":"2025-12-14T23:02:05Z","title":"EvoPress: Accurate dynamic model compression via evolutionary search","page":"55556-55590","article_processing_charge":"No","abstract":[{"lang":"eng","text":"The high computational costs of large language models (LLMs) have led to a flurry of research on LLM compression, via methods such as quantization, sparsification, or structured pruning. A new frontier in this area is given by dynamic, non-uniform compression methods, which adjust the compression levels (e.g., sparsity) per-block or even per-layer in order to minimize accuracy loss, while guaranteeing a global compression threshold. Yet, current methods rely on estimating the \"importance\" of a given layer, implicitly assuming that layers contribute independently to the overall compression error. We begin from the motivating observation that this independence assumption does not generally hold for LLM compression: pruning a model further may even significantly recover performance. To address this, we propose EvoPress, a novel evolutionary framework for dynamic LLM compression. By formulating dynamic compression as a general optimization problem, EvoPress identifies optimal compression profiles in a highly efficient manner, and generalizes across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art performance for dynamic compression of Llama, Mistral, and Phi models, setting new benchmarks for structural pruning (block/layer dropping), unstructured sparsity, and quantization with dynamic bitwidths."}],"external_id":{"arxiv":["2410.14649"]},"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Sieberling, Oliver","last_name":"Sieberling","first_name":"Oliver"},{"last_name":"Kuznedelev","first_name":"Denis","full_name":"Kuznedelev, Denis"},{"last_name":"Kurtic","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","full_name":"Kurtic, Eldar"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh"}],"OA_place":"publisher","volume":267,"citation":{"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.","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.","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.","short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.","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.","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.","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."},"alternative_title":["PMLR"],"status":"public","day":"01","OA_type":"gold","tmp":{"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)","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"month":"05","date_published":"2025-05-01T00:00:00Z","arxiv":1,"department":[{"_id":"DaAl"}],"publisher":"ML Research Press","date_updated":"2025-12-16T12:34:32Z","oa":1,"file_date_updated":"2025-12-16T12:32:40Z","_id":"20820","scopus_import":"1","oa_version":"Published Version","intvolume":"       267","type":"conference"},{"alternative_title":["PMLR"],"status":"public","day":"01","OA_type":"gold","tmp":{"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)","short":"CC BY (4.0)"},"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.","ista":"Nguyen AD, Markov I, Wu FZ, Ramezani-Kebrya A, Antonakopoulos K, Alistarh D-A, Cevher V. 2025. Layer-wise quantization for quantized optimistic dual averaging. 42nd International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 267, 46026–46072.","short":"A.D. Nguyen, I. Markov, F.Z. Wu, A. Ramezani-Kebrya, K. Antonakopoulos, D.-A. Alistarh, V. Cevher, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 46026–46072.","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.","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.","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.","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."},"project":[{"name":"FastML: Efficient and Cost-Effective Distributed Machine Learning","_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","grant_number":"101158077"}],"_id":"20821","scopus_import":"1","intvolume":"       267","oa_version":"Published Version","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).","type":"conference","language":[{"iso":"eng"}],"month":"05","date_published":"2025-05-01T00:00:00Z","arxiv":1,"department":[{"_id":"DaAl"}],"publisher":"ML Research Press","date_updated":"2025-12-16T12:46:54Z","oa":1,"file_date_updated":"2025-12-16T12:45:41Z","publication_identifier":{"eissn":["2640-3498"]},"publication":"42nd International Conference on Machine Learning","year":"2025","date_created":"2025-12-14T23:02:06Z","has_accepted_license":"1","ddc":["000"],"conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13","end_date":"2025-07-19","location":"Vancouver, Canada"},"quality_controlled":"1","file":[{"date_updated":"2025-12-16T12:45:41Z","file_size":756213,"access_level":"open_access","relation":"main_file","checksum":"a7edf0e4304171a3e035842b3aab1704","file_id":"20830","success":1,"creator":"dernst","file_name":"2025_ICML_Nguyen.pdf","content_type":"application/pdf","date_created":"2025-12-16T12:45:41Z"}],"author":[{"full_name":"Nguyen, Anh Duc","first_name":"Anh Duc","last_name":"Nguyen"},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","full_name":"Markov, Ilia","last_name":"Markov","first_name":"Ilia"},{"last_name":"Wu","first_name":"Frank Zhengqing","full_name":"Wu, Frank Zhengqing"},{"first_name":"Ali","last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali"},{"first_name":"Kimon","last_name":"Antonakopoulos","full_name":"Antonakopoulos, Kimon"},{"first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"},{"full_name":"Cevher, Volkan","last_name":"Cevher","first_name":"Volkan"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":267,"OA_place":"publisher","title":"Layer-wise quantization for quantized optimistic dual averaging","page":"46026-46072","article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"publication_status":"published","external_id":{"arxiv":["2505.14371"]}},{"language":[{"iso":"eng"}],"month":"11","date_published":"2025-11-07T00:00:00Z","publisher":"EMS Press","department":[{"_id":"VaKa"}],"date_updated":"2026-06-18T18:26:33Z","oa":1,"DOAJ_listed":"1","_id":"20839","scopus_import":"1","article_type":"original","oa_version":"Published Version","type":"journal_article","citation":{"ieee":"M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” <i>Journal of Fractal Geometry</i>. EMS Press, 2025.","short":"M. Helfter, Journal of Fractal Geometry (2025).","ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","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>","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>.","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>."},"status":"public","day":"07","OA_type":"gold","title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","article_processing_charge":"Yes","abstract":[{"lang":"eng","text":"For every couple of Hausdorff functions ψ and φ verifying some mild assumptions, there exists a compact subset K of the Baire space such that the φ-Hausdorff measure and the ψ-packing measure on K are both finite and positive. Such examples are then embedded in any infinite dimensional Banach space to answer positively a question of Fan on the existence of metric spaces with arbitrary scales."}],"publication_status":"epub_ahead","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57","full_name":"Helfter, Mathieu","last_name":"Helfter","first_name":"Mathieu"}],"OA_place":"publisher","main_file_link":[{"open_access":"1","url":"https://doi.org/10.4171/jfg/177"}],"ddc":["500"],"corr_author":"1","quality_controlled":"1","doi":"10.4171/jfg/177","publication_identifier":{"eissn":["2308-1317"],"issn":["2308-1309"]},"publication":"Journal of Fractal Geometry","year":"2025","date_created":"2025-12-19T10:15:37Z"},{"doi":"10.15479/AT-ISTA-20842","status":"public","day":"22","year":"2025","date_created":"2025-12-21T14:23:50Z","contributor":[{"last_name":"Rosello","first_name":"Pere"},{"last_name":"Mekonnen","first_name":"Manuel"},{"orcid":"0000-0002-2031-204X","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87","first_name":"Onur","contributor_type":"supervisor","last_name":"Hosten"}],"tmp":{"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)","short":"CC BY (4.0)"},"has_accepted_license":"1","corr_author":"1","citation":{"ieee":"S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface.’” Institute of Science and Technology Austria, 2025.","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>.","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>","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>.","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>."},"file":[{"creator":"sagafono","success":1,"date_created":"2025-12-22T13:45:30Z","file_name":"AllData.zip","content_type":"application/x-zip-compressed","relation":"main_file","checksum":"7af34e4226a00cdcb7f154272050e217","access_level":"open_access","file_size":146656591,"date_updated":"2025-12-22T13:45:30Z","file_id":"20854"},{"file_name":"SourceData.zip","content_type":"application/x-zip-compressed","date_created":"2025-12-22T13:45:33Z","success":1,"creator":"sagafono","file_id":"20855","date_updated":"2025-12-22T13:45:33Z","file_size":93470129,"access_level":"open_access","checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","relation":"main_file"},{"file_id":"20856","relation":"main_file","checksum":"08facd1b4a102f83e4d99d48a85b258d","access_level":"open_access","file_size":461,"date_updated":"2025-12-22T13:51:09Z","date_created":"2025-12-22T13:51:09Z","file_name":"readme.txt","content_type":"text/plain","creator":"sagafono","success":1}],"project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","grant_number":"101087907","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6"}],"_id":"20842","related_material":{"record":[{"status":"public","id":"20840","relation":"used_in_publication"}]},"oa_version":"Published Version","author":[{"full_name":"Agafonova, Sofya","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","orcid":"0000-0003-0582-2946","first_name":"Sofya","last_name":"Agafonova"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","type":"research_data","month":"12","title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","date_published":"2025-12-22T00:00:00Z","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"OnHo"}],"date_updated":"2026-06-10T08:36:07Z","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240~microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface."}],"oa":1,"file_date_updated":"2025-12-22T13:51:09Z"},{"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.","type":"conference","intvolume":"     16269","oa_version":"Preprint","_id":"20845","scopus_import":"1","oa":1,"publisher":"Springer Nature","department":[{"_id":"KrPi"}],"date_updated":"2025-12-29T11:51:13Z","month":"12","language":[{"iso":"eng"}],"date_published":"2025-12-05T00:00:00Z","OA_type":"green","status":"public","day":"05","alternative_title":["LNCS"],"citation":{"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>.","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>","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>.","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.","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>","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.","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290."},"volume":16269,"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Shweta","last_name":"Agrawal","full_name":"Agrawal, Shweta"},{"last_name":"Modi","first_name":"Anuja","full_name":"Modi, Anuja"},{"id":"dc8f1524-403e-11ee-bf07-9649ad996e21","full_name":"Yadav, Anshu","first_name":"Anshu","last_name":"Yadav"},{"first_name":"Shota","last_name":"Yamada","full_name":"Yamada, Shota"}],"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","page":"259-290","article_processing_charge":"No","title":"Zeroizing attacks against evasive and circular evasive LWE","year":"2025","date_created":"2025-12-21T23:01:33Z","publication":"23rd International Conference on Theory of Cryptography","doi":"10.1007/978-3-032-12293-3_9","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122926"]},"quality_controlled":"1","conference":{"location":"Aarhus, Denmark","end_date":"2025-12-05","start_date":"2025-12-01","name":"TCC: Theory of Cryptography"},"main_file_link":[{"url":"https://eprint.iacr.org/2025/375","open_access":"1"}]},{"abstract":[{"text":"CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.\r\nWe prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons.","lang":"eng"}],"publication_status":"published","page":"478-511","article_processing_charge":"No","title":"Constrained verifiable random functions without obfuscation and friends","volume":16271,"OA_place":"repository","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Brandt","first_name":"Nicholas","full_name":"Brandt, Nicholas"},{"full_name":"Cueto Noval, Miguel","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","first_name":"Miguel","last_name":"Cueto Noval"},{"full_name":"Günther, Christoph Ullrich","id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","first_name":"Christoph Ullrich","last_name":"Günther"},{"last_name":"Ünal","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","full_name":"Ünal, Akin"},{"first_name":"Stella","last_name":"Wohnig","full_name":"Wohnig, Stella"}],"quality_controlled":"1","corr_author":"1","conference":{"end_date":"2025-12-05","location":"Aarhus, Denmark","name":"TCC: Theory of Cryptography","start_date":"2025-12-01"},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1045"}],"year":"2025","date_created":"2025-12-21T23:01:34Z","publication":"23rd International Conference on Theory of Cryptography","doi":"10.1007/978-3-032-12290-2_16","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032122896"],"issn":["0302-9743"]},"oa":1,"department":[{"_id":"KrPi"}],"publisher":"Springer Nature","date_updated":"2025-12-29T11:11:29Z","language":[{"iso":"eng"}],"month":"12","date_published":"2025-12-05T00:00:00Z","type":"conference","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.","intvolume":"     16271","oa_version":"Preprint","_id":"20846","scopus_import":"1","project":[{"_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","grant_number":"F8509","name":"Security and Privacy by Design for Complex Systems"}],"citation":{"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>","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.","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.","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>.","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>.","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>"},"OA_type":"green","day":"05","status":"public","alternative_title":["LNCS"]},{"publication_status":"published","external_id":{"arxiv":["2508.05643"]},"abstract":[{"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.","lang":"eng"}],"article_processing_charge":"Yes (via OA deal)","title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","volume":112,"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Fitzgerald, Eavan","id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa","first_name":"Eavan","last_name":"Fitzgerald"},{"id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8","orcid":"0000-0002-1843-3803","full_name":"Clavaud, Cécile","first_name":"Cécile","last_name":"Clavaud"},{"first_name":"Debasish","last_name":"Das","full_name":"Das, Debasish"},{"last_name":"Lenton","first_name":"Isaac C","full_name":"Lenton, Isaac C","id":"a550210f-223c-11ec-8182-e2d45e817efb","orcid":"0000-0002-5010-6984"},{"full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R","last_name":"Waitukaitis"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"file":[{"file_id":"20862","relation":"main_file","checksum":"d593e933f976c3f3cde37ad66539d57d","access_level":"open_access","file_size":2131491,"date_updated":"2025-12-29T11:15:42Z","date_created":"2025-12-29T11:15:42Z","content_type":"application/pdf","file_name":"2025_PhysReviewE_Fitzgerald.pdf","creator":"dernst","success":1}],"quality_controlled":"1","corr_author":"1","ddc":["530"],"has_accepted_license":"1","article_number":"065418","date_created":"2025-12-21T23:01:34Z","year":"2025","publication":"Physical Review E","doi":"10.1103/1ss8-31rb","publication_identifier":{"eissn":["2470-0053"],"issn":["2470-0045"]},"issue":"6","file_date_updated":"2025-12-29T11:15:42Z","oa":1,"date_updated":"2025-12-29T11:19:34Z","arxiv":1,"department":[{"_id":"ScWa"}],"publisher":"American Physical Society","date_published":"2025-12-01T00:00:00Z","month":"12","language":[{"iso":"eng"}],"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. ","type":"journal_article","oa_version":"Published Version","intvolume":"       112","article_type":"original","scopus_import":"1","_id":"20847","project":[{"name":"MixQUIckR: Mixing with QUIncke Rollers","_id":"bd8eede5-d553-11ed-ba76-eaded0d13485","grant_number":"E 298"},{"call_identifier":"H2020","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","grant_number":"949120"}],"citation":{"short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","ieee":"E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter,” <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.","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>","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>."},"PlanS_conform":"1","tmp":{"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)","short":"CC BY (4.0)"},"OA_type":"hybrid","ec_funded":1,"status":"public","day":"01"},{"citation":{"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.","short":"J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (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>","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>.","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>","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>."},"day":"01","status":"public","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"OA_type":"hybrid","date_published":"2025-12-01T00:00:00Z","language":[{"iso":"eng"}],"month":"12","date_updated":"2025-12-29T11:29:16Z","publisher":"Oxford University Press","department":[{"_id":"NiBa"}],"file_date_updated":"2025-12-29T11:27:51Z","oa":1,"scopus_import":"1","_id":"20848","oa_version":"Published Version","intvolume":"       231","article_type":"original","type":"journal_article","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.","has_accepted_license":"1","ddc":["570"],"quality_controlled":"1","file":[{"date_created":"2025-12-29T11:27:51Z","file_name":"2025_Genetics_Berg.pdf","content_type":"application/pdf","creator":"dernst","success":1,"file_id":"20863","relation":"main_file","checksum":"b02eb6b78028b8bef435edc8435a8468","access_level":"open_access","date_updated":"2025-12-29T11:27:51Z","file_size":1182339}],"doi":"10.1093/genetics/iyaf220","publication_identifier":{"eissn":["1943-2631"],"issn":["0016-6731"]},"issue":"4","publication":"Genetics","date_created":"2025-12-21T23:01:34Z","year":"2025","article_number":"iyaf220","title":"Mutation–selection–drift balance models of complex diseases","article_processing_charge":"Yes (in subscription journal)","external_id":{"pmid":["41073879"]},"publication_status":"published","abstract":[{"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.","lang":"eng"}],"pmid":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Berg","first_name":"Jeremy J.","full_name":"Berg, Jeremy J."},{"full_name":"Li, Xinyi","last_name":"Li","first_name":"Xinyi"},{"full_name":"Riall, Kellen","last_name":"Riall","first_name":"Kellen"},{"first_name":"Laura","last_name":"Hayward","full_name":"Hayward, Laura","id":"fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b"},{"last_name":"Sella","first_name":"Guy","full_name":"Sella, Guy"}],"volume":231,"OA_place":"publisher"},{"oa":1,"file_date_updated":"2025-12-29T09:36:50Z","department":[{"_id":"KrCh"}],"publisher":"National Academy of Sciences","date_updated":"2026-05-20T08:13:17Z","month":"12","language":[{"iso":"eng"}],"date_published":"2025-12-15T00:00:00Z","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.","type":"journal_article","article_type":"original","oa_version":"Published Version","intvolume":"       122","_id":"20857","scopus_import":"1","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"}],"citation":{"short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences 122 (2025) e2524109122.","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>","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>.","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>."},"ec_funded":1,"OA_type":"hybrid","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"day":"15","status":"public","abstract":[{"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.","lang":"eng"}],"external_id":{"pmid":["41397136"]},"publication_status":"published","page":"e2524109122","article_processing_charge":"Yes (in subscription journal)","title":"Promoters of cooperation in evolutionary games","volume":122,"OA_place":"publisher","author":[{"first_name":"Jakub","last_name":"Svoboda","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1,"quality_controlled":"1","file":[{"date_created":"2025-12-29T09:36:50Z","file_name":"2025_PNAS_Svoboda.pdf","content_type":"application/pdf","success":1,"creator":"dernst","file_id":"20860","access_level":"open_access","checksum":"dd50b62a1efc28c0133fe9c11dbee53c","relation":"main_file","date_updated":"2025-12-29T09:36:50Z","file_size":2308124}],"corr_author":"1","ddc":["000"],"has_accepted_license":"1","year":"2025","date_created":"2025-12-28T23:01:26Z","publication":"Proceedings of the National Academy of Sciences","APC_amount":"3003,56 EUR","issue":"51","publication_identifier":{"eissn":["1091-6490"]},"doi":"10.1073/pnas.2524109122"},{"quality_controlled":"1","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.04843"}],"year":"2025","date_created":"2025-12-29T12:05:25Z","publication":"Contemporary Physics","issue":"1-4","publication_identifier":{"issn":["0010-7514"],"eissn":["1366-5812"]},"doi":"10.1080/00107514.2025.2586370","abstract":[{"lang":"eng","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."}],"publication_status":"published","external_id":{"arxiv":["2511.04843"]},"page":"116-151","article_processing_charge":"No","title":"JWST provides a new view of cosmic dawn: Latest developments in studies of early galaxies","OA_place":"repository","volume":66,"author":[{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","project":[{"_id":"bd9b2118-d553-11ed-ba76-db24564edfea","grant_number":"101076224","name":"Young galaxies as tracers and agents of cosmic reionization"}],"citation":{"short":"J.J. Matthee, Contemporary Physics 66 (2025) 116–151.","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.","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.","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>","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>","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>.","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>."},"OA_type":"green","day":"04","status":"public","oa":1,"publisher":"Taylor & Francis","arxiv":1,"department":[{"_id":"JoMa"}],"date_updated":"2026-04-07T08:44:00Z","language":[{"iso":"eng"}],"month":"12","date_published":"2025-12-04T00:00:00Z","type":"journal_article","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_version":"Preprint","intvolume":"        66","_id":"20864","scopus_import":"1"},{"citation":{"ista":"Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025. Hypernode automata. Acta Informatica. 62(4), 43.","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).","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>","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>."},"project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","grant_number":"F8502","name":"Interface Theory for Security and Privacy"}],"status":"public","day":"09","ec_funded":1,"OA_type":"hybrid","tmp":{"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)","short":"CC BY (4.0)"},"month":"12","language":[{"iso":"eng"}],"date_published":"2025-12-09T00:00:00Z","arxiv":1,"department":[{"_id":"ToHe"}],"publisher":"Springer Nature","date_updated":"2026-01-05T12:27:41Z","oa":1,"file_date_updated":"2026-01-05T12:26:43Z","_id":"20866","scopus_import":"1","article_type":"original","intvolume":"        62","oa_version":"Published Version","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).","type":"journal_article","has_accepted_license":"1","ddc":["000"],"corr_author":"1","quality_controlled":"1","file":[{"date_created":"2026-01-05T12:26:43Z","content_type":"application/pdf","file_name":"2025_ActaInformatica_Bartocci.pdf","creator":"dernst","success":1,"file_id":"20944","checksum":"06ed45a1218ad8464818803ae2968aaf","relation":"main_file","access_level":"open_access","date_updated":"2026-01-05T12:26:43Z","file_size":7117003}],"issue":"4","doi":"10.1007/s00236-025-00509-8","publication_identifier":{"issn":["0001-5903"],"eissn":["1432-0525"]},"publication":"Acta Informatica","year":"2025","date_created":"2025-12-29T12:07:12Z","article_number":"43","title":"Hypernode automata","article_processing_charge":"Yes (via OA deal)","abstract":[{"lang":"eng","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."}],"external_id":{"arxiv":["2305.02836"]},"publication_status":"published","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"14405"}]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Ezio","last_name":"Bartocci","full_name":"Bartocci, Ezio"},{"first_name":"Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek"},{"orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger"},{"first_name":"Dejan","last_name":"Nickovic","full_name":"Nickovic, Dejan","id":"41BCEE5C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ana","last_name":"Oliveira da Costa","full_name":"Oliveira da Costa, Ana","orcid":"0000-0002-8741-5799","id":"f347ec37-6676-11ee-b395-a888cb7b4fb4"}],"OA_place":"publisher","volume":62},{"quality_controlled":"1","file":[{"date_created":"2026-01-05T12:16:38Z","content_type":"application/pdf","file_name":"2025_AlgebraicGeomTopology_Zava.pdf","success":1,"creator":"dernst","file_id":"20943","access_level":"open_access","relation":"main_file","checksum":"1e05b4f17a44500ae1ae1e21bc636f6a","date_updated":"2026-01-05T12:16:38Z","file_size":574389}],"corr_author":"1","ddc":["500"],"has_accepted_license":"1","date_created":"2025-12-29T12:09:09Z","year":"2025","publication":"Algebraic & Geometric Topology","doi":"10.2140/agt.2025.25.5153","publication_identifier":{"issn":["1472-2747"],"eissn":["1472-2739"]},"issue":"8","external_id":{"arxiv":["2303.04730"]},"publication_status":"published","abstract":[{"text":"We discuss the embeddability of subspaces of the Gromov–Hausdorff space, which consists of isometry classes of compact metric spaces endowed with the Gromov–Hausdorff distance, into Hilbert spaces. These embeddings are particularly valuable for applications to topological data analysis. We prove that its subspace consisting of metric spaces with at most n points has asymptotic dimension n(n−1)∕2. Thus, there exists a coarse embedding of that space into a Hilbert space. On the contrary, if the number of points is not bounded, then the subspace cannot be coarsely embedded into any uniformly convex Banach space and so, in particular, into any Hilbert space. Furthermore, we prove that, even if we restrict to finite metric spaces whose diameter is bounded by some constant, the subspace still cannot be bi-Lipschitz embedded into any finite-dimensional Hilbert space. We obtain both nonembeddability results by finding obstructions to coarse and bi-Lipschitz embeddings in families of isometry classes of finite subsets of the real line endowed with the Euclidean–Hausdorff distance.","lang":"eng"}],"article_processing_charge":"No","page":"5153-5174","title":"Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces","OA_place":"publisher","volume":25,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Zava","first_name":"Nicolò","orcid":"0000-0001-8686-1888","id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","full_name":"Zava, Nicolò"}],"project":[{"name":"Algebraic Footprints of Geometric Features in Homology","call_identifier":"FWF","grant_number":"I04245","_id":"26AD5D90-B435-11E9-9278-68D0E5697425"}],"citation":{"short":"N. Zava, Algebraic &#38; Geometric Topology 25 (2025) 5153–5174.","ieee":"N. Zava, “Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces,” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8. Mathematical Sciences Publishers, pp. 5153–5174, 2025.","ama":"Zava N. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. 2025;25(8):5153-5174. doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>","ista":"Zava N. 2025. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. Algebraic &#38; Geometric Topology. 25(8), 5153–5174.","apa":"Zava, N. (2025). Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff space into Hilbert spaces. <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>","chicago":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>. Mathematical Sciences Publishers, 2025. <a href=\"https://doi.org/10.2140/agt.2025.25.5153\">https://doi.org/10.2140/agt.2025.25.5153</a>.","mla":"Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff Space into Hilbert Spaces.” <i>Algebraic &#38; Geometric Topology</i>, vol. 25, no. 8, Mathematical Sciences Publishers, 2025, pp. 5153–74, doi:<a href=\"https://doi.org/10.2140/agt.2025.25.5153\">10.2140/agt.2025.25.5153</a>."},"PlanS_conform":"1","tmp":{"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)","short":"CC BY (4.0)"},"OA_type":"diamond","day":"20","status":"public","file_date_updated":"2026-01-05T12:16:38Z","oa":1,"date_updated":"2026-01-05T12:19:09Z","department":[{"_id":"HeEd"}],"arxiv":1,"publisher":"Mathematical Sciences Publishers","date_published":"2025-11-20T00:00:00Z","language":[{"iso":"eng"}],"month":"11","acknowledgement":"The author was supported by the FWF Grant, Project number I4245-N35. The author would like to thank Thomas Weighill for the helpful discussions around Theorem 3.10, and Takamitsu Yamauchi for bringing to my attention the fundamental reference [35]. Furthermore, the author\r\nis thankful for the detailed and helpful comments of the reviewer of this manuscript.","type":"journal_article","intvolume":"        25","oa_version":"Published Version","article_type":"original","scopus_import":"1","_id":"20867"}]