[{"supplementarymaterial":"yes","date_created":"2026-08-03T13:19:31Z","_id":"22637","file_date_updated":"2026-08-04T05:40:41Z","quality_controlled":"1","title":"Distributing stationary qubit entanglement through a nonlocal squeezed reservoir","author":[{"first_name":"Alejandro","full_name":"Andres Juanes, Alejandro","last_name":"Andres Juanes","id":"7601fd3a-5355-11ee-ae5a-a20ca6f3cfb9"},{"last_name":"Agustí","full_name":"Agustí, J.","first_name":"J."},{"id":"2E6D040E-F248-11E8-B48F-1D18A9856A87","full_name":"Sett, Riya","last_name":"Sett","first_name":"Riya","orcid":"0000-0001-7641-8348"},{"first_name":"Elena","full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","last_name":"Redchenko"},{"first_name":"Lucky","orcid":"0000-0001-8319-2148","full_name":"Kapoor, Lucky","id":"84b9700b-15b2-11ec-abd3-831089e67615","last_name":"Kapoor"},{"last_name":"Hawaldar","full_name":"Hawaldar, Samarth","id":"221708e1-1ff6-11ee-9fa6-85146607433e","first_name":"Samarth","orcid":"0000-0002-1965-4309"},{"first_name":"P.","last_name":"Rabl","full_name":"Rabl, P."},{"last_name":"Fink","full_name":"Fink, Johannes M","id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","first_name":"Johannes M","orcid":"0000-0001-8112-028X"}],"DOAJ_listed":"1","article_type":"original","publisher":"American Physical Society","publication_identifier":{"eissn":["2160-3308"]},"scopus_import":"1","file":[{"file_size":5301241,"content_type":"application/pdf","date_created":"2026-08-04T05:40:41Z","date_updated":"2026-08-04T05:40:41Z","file_name":"2026_PhysicalReviewX_AndresJuanes.pdf","relation":"main_file","creator":"dernst","file_id":"22640","access_level":"open_access","success":1,"checksum":"2bab109f975545d096c21dd72c738b6e"}],"PlanS_conform":"1","day":"13","acknowledgement":"We thank A. Trioni and C. N. Borja for assistance in device fabrication, C. Siegele for fruitful discussions, IBM for donating the JPC used in this work, and the MIBA machine shop and the ISTA nanofabrication facility for technical support. This work was funded in part by the Austrian Science Fund (FWF) through the excellence cluster quantA 10.55776/COE1 and the SFB BeyondC 10.55776/F71, as well as the European Union—NextGenerationEU, and ISTA. J. F. and L. K. acknowledge support from the Horizon Europe Program HORIZON-CL4-2022-QUANTUM-01-SGA via Project No. 101113946 OpenSuperQPlus100, and J. F. from the European Research Council No. 101089099 (ERC CoG cQEO). J. A. acknowledges support from the QUANTERA project MOLAR with reference No. PCI2024-153449, funded by MICIU/AEI/10.13039/501100011033 and the European Union. This research is part of the Munich Quantum Valley, which is supported by the Bavarian state government with funds from the Hightech Agenda Bayern Plus.","publication":"Physical Review X","volume":16,"oa":1,"intvolume":" 16","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"year":"2026","language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","project":[{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"},{"grant_number":"101089099","name":"Cavity Quantum Electro Optics: Microwave photonics with nonclassical states","_id":"bdadfa0d-d553-11ed-ba76-fb85edbd456a"},{"_id":"92af0f81-16d5-11f0-9cad-924b22d6a876","grant_number":"COE01","name":"Quantum Science Austria (Fink)"}],"status":"public","doi":"10.1103/r4jt-j39w","dataavailabilitystatement":"The data that support the findings of this article are openly available https://zenodo.org/records/19099731.","OA_type":"gold","date_published":"2026-07-13T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"mla":"Andres Juanes, Alejandro, et al. “Distributing Stationary Qubit Entanglement through a Nonlocal Squeezed Reservoir.” Physical Review X, vol. 16, no. 3, 031005, American Physical Society, 2026, doi:10.1103/r4jt-j39w.","apa":"Andres Juanes, A., Agustí, J., Sett, R., Redchenko, E., Kapoor, L., Hawaldar, S., … Fink, J. M. (2026). Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. Physical Review X. American Physical Society. https://doi.org/10.1103/r4jt-j39w","ama":"Andres Juanes A, Agustí J, Sett R, et al. Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. Physical Review X. 2026;16(3). doi:10.1103/r4jt-j39w","chicago":"Andres Juanes, Alejandro, J. Agustí, Riya Sett, Elena Redchenko, Lucky Kapoor, Samarth Hawaldar, P. Rabl, and Johannes M Fink. “Distributing Stationary Qubit Entanglement through a Nonlocal Squeezed Reservoir.” Physical Review X. American Physical Society, 2026. https://doi.org/10.1103/r4jt-j39w.","ista":"Andres Juanes A, Agustí J, Sett R, Redchenko E, Kapoor L, Hawaldar S, Rabl P, Fink JM. 2026. Distributing stationary qubit entanglement through a nonlocal squeezed reservoir. Physical Review X. 16(3), 031005.","ieee":"A. Andres Juanes et al., “Distributing stationary qubit entanglement through a nonlocal squeezed reservoir,” Physical Review X, vol. 16, no. 3. American Physical Society, 2026.","short":"A. Andres Juanes, J. Agustí, R. Sett, E. Redchenko, L. Kapoor, S. Hawaldar, P. Rabl, J.M. Fink, Physical Review X 16 (2026)."},"ddc":["530"],"oa_version":"Published Version","das_tickbox":"1","type":"journal_article","month":"07","abstract":[{"text":"The distribution of entanglement across distant qubits is a central challenge for the operation of scalable quantum computers and large-scale quantum networks. Existing approaches rely on deterministic state transfer, or probabilistic protocols that require active control or measurements and postselection. Here, we demonstrate a fundamentally different, fully autonomous process, where two remote qubits are entangled through their coupling to a quantum-correlated photonic reservoir. In our experiment, a Josephson parametric converter produces a Gaussian, continuous-variable entangled state of propagating microwave fields that drives two spatially separated superconducting transmon qubits into a stationary, discrete-variable entangled state. We also show how qubit tomography unlocks a direct and sensitive verification of two-mode squeezing in the microwave domain. These results establish networks of qubits interfaced with distributed continuous-variable entangled states as a powerful platform for foundational studies and quantum-technology applications.","lang":"eng"}],"related_material":{"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/quantum-bath-syncs-distant-qubits/","description":"News on ISTA website"}]},"researchdata_availability":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-16T07:38:20Z","fulldoi":"https://doi.org/10.1103/r4jt-j39w","issue":"3","publication_status":"published","has_accepted_license":"1","article_processing_charge":"Yes","department":[{"_id":"JoFi"},{"_id":"GradSch"}],"article_number":"031005"},{"project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692"},{"grant_number":"101199096","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b"},{"_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","name":"Mechanisms of GABA release in hippocampal circuits","grant_number":"P36232"},{"_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e","grant_number":"PAT 4178023","name":"Synaptic networks of human brain"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"name":"Neuronal circuits in health and disease (Jonas)","grant_number":"COE16","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4"}],"status":"public","doi":"10.15479/AT-ISTA-22735","tmp":{"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","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"date_published":"2026-08-25T00:00:00Z","citation":{"mla":"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, doi:10.15479/AT-ISTA-22735.","apa":"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. https://doi.org/10.15479/AT-ISTA-22735","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.","ama":"Lin P. Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses. 2026. doi:10.15479/AT-ISTA-22735","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.","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. https://doi.org/10.15479/AT-ISTA-22735."},"ddc":["571","573"],"das_tickbox":"0","oa_version":"Published Version","type":"dissertation","month":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"researchdata_availability":"upon request","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-22735","date_updated":"2026-09-16T07:39:42Z","article_processing_charge":"No","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"PeJo"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","supplementarymaterial":"yes","file_date_updated":"2026-08-26T10:09:53Z","_id":"22735","date_created":"2026-08-18T15:23:41Z","page":"88","title":"Calibrating the teacher synapse: Mechanisms and functional significance of presynaptic inhibition at hippocampal mossy fiber synapses","author":[{"first_name":"Peipeng","full_name":"Lin, Peipeng","last_name":"Lin","id":"7E3060D0-A92C-11E9-A326-26C8E5697425"}],"publication_identifier":{"isbn":["978-3-99078-088-6"],"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","file":[{"access_level":"closed","file_id":"22765","relation":"main_file","creator":"plin","checksum":"13cc7ead72aad90a134f310b531c73cd","file_name":"2026_Lin_Peipeng_Thesis.pdf","date_updated":"2026-08-26T10:09:48Z","date_created":"2026-08-26T10:09:48Z","content_type":"application/pdf","embargo_to":"open_access","file_size":6376229,"embargo":"2027-09-01"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2026-08-26T10:09:53Z","file_name":"2026_Lin_Peipeng_Thesis.docx","date_updated":"2026-08-26T10:09:53Z","file_size":17681883,"checksum":"8c9c1445a7df284377be1a8c9dadd7c5","file_id":"22766","access_level":"closed","relation":"source_file","creator":"plin"}],"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.).","degree_awarded":"PhD","day":"25","supervisor":[{"first_name":"Peter M","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"PreCl"},{"_id":"Bio"}],"year":"2026","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}]},{"degree_awarded":"PhD","day":"03","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"LifeSc"}],"year":"2026","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Jonas","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","full_name":"Jonas, Peter M","orcid":"0000-0001-5001-4804","first_name":"Peter M"}],"file_date_updated":"2026-09-08T09:02:52Z","page":"153","_id":"22775","date_created":"2026-09-03T08:06:58Z","supplementarymaterial":"no","publication_identifier":{"isbn":["978-3-99078-085-5"],"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","file":[{"checksum":"d9a6fd39a0b6343c4473901f9323f127","creator":"cchlebak","relation":"main_file","access_level":"closed","file_id":"22850","embargo":"2028-03-08","file_size":8968078,"file_name":"2026_Jamrichova_Silvia_Thesis.pdf","date_updated":"2026-09-08T09:01:22Z","date_created":"2026-09-08T09:01:22Z","content_type":"application/pdf","embargo_to":"open_access"},{"file_size":17338630,"date_updated":"2026-09-08T09:02:52Z","date_created":"2026-09-08T09:02:52Z","file_name":"2026_Jamrichova_Silvia_Thesis.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"02b728c9157f88e392b69e94877889f0","relation":"source_file","creator":"cchlebak","access_level":"closed","file_id":"22851"}],"title":"Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans","author":[{"full_name":"Jamrichova, Silvia","id":"F0EA6804-AA27-11E9-8613-C0F7E5697425","last_name":"Jamrichova","first_name":"Silvia","orcid":"0009-0003-9929-8221"}],"ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","researchdata_availability":"upon request","publication_status":"published","date_updated":"2026-09-16T08:13:41Z","fulldoi":"https://doi.org/10.15479/AT-ISTA-22775","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"PeJo"}],"alternative_title":["ISTA Thesis"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2026-09-03T00:00:00Z","ddc":["570"],"citation":{"short":"S. Jamrichova, Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans, Institute of Science and Technology Austria, 2026.","ieee":"S. Jamrichova, “Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans,” Institute of Science and Technology Austria, 2026.","ista":"Jamrichova S. 2026. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria.","ama":"Jamrichova S. Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. 2026. doi:10.15479/AT-ISTA-22775","chicago":"Jamrichova, Silvia. “Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22775.","apa":"Jamrichova, S. (2026). Timing and strength of synaptic transmission at hippocampal mossy fiber synapses in mice and humans. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22775","mla":"Jamrichova, Silvia. Timing and Strength of Synaptic Transmission at Hippocampal Mossy Fiber Synapses in Mice and Humans. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22775."},"OA_embargo":"18","status":"public","project":[{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692"},{"_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","grant_number":"101199096"},{"_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5","name":"Mechanisms of GABA release in hippocampal circuits","grant_number":"P36232"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","name":"Synaptic communication in neuronal microcircuits"},{"grant_number":"COE16","name":"Neuronal circuits in health and disease (Jonas)","_id":"0a6c8641-b036-11f1-bacf-e4eec62b5bb4"}],"doi":"10.15479/AT-ISTA-22775","month":"09","oa_version":"Published Version","type":"dissertation"},{"volume":36,"publication":"Annals of Applied Probability","acknowledgement":"L. Erdős, J. Henheik and O. Kolupaiev were supported by the ERC Advanced Grant “RMTBeyond” No. 101020331. G. Cipolloni is partially supported by the MUR Excellence Department Project MatMod@TOV awarded to the Department of Mathematics, University of Rome Tor Vergata, CUP E83C18000100006.","day":"01","arxiv":1,"OA_place":"repository","corr_author":"1","language":[{"iso":"eng"}],"mathsc":["60B20","82C10"],"year":"2026","intvolume":" 36","oa":1,"_id":"22923","page":"3707-3756","date_created":"2026-09-13T22:01:54Z","supplementarymaterial":"yes","scopus_import":"1","publication_identifier":{"issn":["1050-5164"]},"publisher":"Institute of Mathematical Statistics","author":[{"orcid":"0000-0002-4901-7992","first_name":"Giorgio","last_name":"Cipolloni","full_name":"Cipolloni, Giorgio","id":"42198EFA-F248-11E8-B48F-1D18A9856A87"},{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László","orcid":"0000-0001-5366-9603","first_name":"László"},{"full_name":"Henheik, Sven Joscha","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","last_name":"Henheik","orcid":"0000-0003-1106-327X","first_name":"Sven Joscha"},{"first_name":"Oleksii","orcid":"0000-0003-1491-4623","id":"149b70d4-896a-11ed-bdf8-8c63fd44ca61","full_name":"Kolupaiev, Oleksii","last_name":"Kolupaiev"}],"article_type":"original","title":"Eigenvector decorrelation for random matrices","quality_controlled":"1","issue":"4","publication_status":"published","fulldoi":"https://doi.org/10.1214/26-AAP2318","date_updated":"2026-09-16T10:00:54Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"researchdata_availability":"no","keyword":["characteristic flow","Davis–Kahan theorem","Eigenstate thermalization","Eigenvector perturbation theory","Local law","zigzag strategy"],"department":[{"_id":"LaEr"},{"_id":"GradSch"}],"article_processing_charge":"No","citation":{"ieee":"G. Cipolloni, L. Erdös, S. J. Henheik, and O. Kolupaiev, “Eigenvector decorrelation for random matrices,” Annals of Applied Probability, vol. 36, no. 4. Institute of Mathematical Statistics, pp. 3707–3756, 2026.","short":"G. Cipolloni, L. Erdös, S.J. Henheik, O. Kolupaiev, Annals of Applied Probability 36 (2026) 3707–3756.","chicago":"Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Oleksii Kolupaiev. “Eigenvector Decorrelation for Random Matrices.” Annals of Applied Probability. Institute of Mathematical Statistics, 2026. https://doi.org/10.1214/26-AAP2318.","ama":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Eigenvector decorrelation for random matrices. Annals of Applied Probability. 2026;36(4):3707-3756. doi:10.1214/26-AAP2318","ista":"Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. 2026. Eigenvector decorrelation for random matrices. Annals of Applied Probability. 36(4), 3707–3756.","apa":"Cipolloni, G., Erdös, L., Henheik, S. J., & Kolupaiev, O. (2026). Eigenvector decorrelation for random matrices. Annals of Applied Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/26-AAP2318","mla":"Cipolloni, Giorgio, et al. “Eigenvector Decorrelation for Random Matrices.” Annals of Applied Probability, vol. 36, no. 4, Institute of Mathematical Statistics, 2026, pp. 3707–56, doi:10.1214/26-AAP2318."},"date_published":"2026-08-01T00:00:00Z","doi":"10.1214/26-AAP2318","OA_type":"green","project":[{"grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020"}],"status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.10718"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"19546"}]},"abstract":[{"lang":"eng","text":"We study the sensitivity of the eigenvectors of random matrices, showing that even small perturbations make the eigenvectors almost orthogonal. More precisely, we consider two deformed Wigner matrices 𝑊 +𝐷1, 𝑊 +𝐷2 and show that their bulk eigenvectors become asymptotically orthogonal as soon as Tr(𝐷1−𝐷2)2 ≫1, or their respective energies are separated on a scale much bigger than the local eigenvalue spacing. Furthermore, we show that quadratic forms of eigenvectors of 𝑊 +𝐷1, 𝑊 +𝐷2 with any deterministic matrix 𝐴 ∈𝐂𝑁×𝑁 in a specific subspace of codimension one are of size 𝑁−1/2. This proves a generalization of the eigenstate thermalization hypothesis to eigenvectors belonging to two different spectral families."}],"month":"08","type":"journal_article","external_id":{"arxiv":["2410.10718"]},"oa_version":"Preprint","das_tickbox":"0"},{"supplementarymaterial":"no","file_date_updated":"2026-09-17T07:28:53Z","_id":"22925","date_created":"2026-09-13T22:01:55Z","page":"245-259","title":"Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections","quality_controlled":"1","author":[{"first_name":"David","orcid":"0000-0002-5494-0941","last_name":"Vijatovic","id":"cf391e77-ec3c-11ea-a124-d69323410b58","full_name":"Vijatovic, David"},{"first_name":"Stavros","id":"40606b92-f128-11eb-9611-bf66a98cfa5c","last_name":"Papadopoulos","full_name":"Papadopoulos, Stavros"},{"first_name":"Marco","id":"02a7a869-ff06-11ed-a87f-86649d6077e5","last_name":"Dalla Vecchia","full_name":"Dalla Vecchia, Marco"},{"id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","last_name":"Sweeney","full_name":"Sweeney, Lora Beatrice Jaeger","first_name":"Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601"}],"publication_identifier":{"eissn":["1940-6029"]},"publisher":"Springer","file":[{"content_type":"application/pdf","file_name":"2026_MIMB_Vijatovic.pdf","date_updated":"2026-09-17T07:28:53Z","date_created":"2026-09-17T07:28:53Z","file_size":1004024,"file_id":"22938","access_level":"open_access","relation":"main_file","creator":"dernst","success":1,"checksum":"e7a075a9ee1b91d5824f8f2b9b1f3c9b"}],"scopus_import":"1","series_title":"MIMB","acknowledgement":"This work was supported by a Horizon Europe ERC Starting Grant\r\nNumber 101041551 (L.B.S., D.V., S.P.), Special Research Program\r\n(SFB) of the Austrian Science Fund (FWF) F7814-B (L.B.S., S.P.),\r\nAustrian Science Fund (FWF) 10.55776/COE16 (L.B.S.), FTI\r\nStrategy Lower Austria Dissertation Grant Number FT121-D-046\r\n(D.V.), and Austrian Academy of Sciences DOC Fellowship 27229\r\n(S.P.). We also thank the Imaging & Optics and Scientific Computing Facilities at ISTA for their support in developing the quantification pipeline.","day":"02","volume":3049,"publication":"Xenopus","oa":1,"editor":[{"first_name":"Caroline W.","last_name":"Beck","full_name":"Beck, Caroline W."}],"intvolume":" 3049","year":"2026","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"status":"public","project":[{"_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","grant_number":"101041551","name":"Development and Evolution of Tetrapod Motor Circuits"},{"_id":"8da85f50-16d5-11f0-9cad-eab8b0ff6c9e","name":"Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb transition: cell type to connection diversity","grant_number":"F7814"},{"_id":"cf428362-b037-11f1-b015-8277a8a2f63d","grant_number":"COE16","name":"Neuronal circuits in health and disease (Sweeney)"},{"grant_number":"FTI21-D-046","name":"Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis","_id":"bd73af52-d553-11ed-ba76-912049f0ac7a"},{"grant_number":"27229","name":"A Tale of Two Circuits: Rostrocaudal spinal cord patterning during the swim-to-limb transition of Xenopus metamorphosis","_id":"907b765e-16d5-11f0-9cad-fef108a945b1"}],"doi":"10.1007/978-1-0716-5360-9_11","OA_type":"hybrid","date_published":"2026-09-02T00:00:00Z","tmp":{"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","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"citation":{"apa":"Vijatovic, D., Papadopoulos, S., Dalla Vecchia, M., & Sweeney, L. B. (2026). Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In C. W. Beck (Ed.), Xenopus (Vol. 3049, pp. 245–259). Springer. https://doi.org/10.1007/978-1-0716-5360-9_11","mla":"Vijatovic, David, et al. “Fluorescent in Situ MRNA Hybridization (FISH) Using Hybridization Chain Reaction (HCR) in Xenopus Cryosections.” Xenopus, edited by Caroline W. Beck, vol. 3049, Springer, 2026, pp. 245–59, doi:10.1007/978-1-0716-5360-9_11.","short":"D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, L.B. Sweeney, in:, C.W. Beck (Ed.), Xenopus, Springer, 2026, pp. 245–259.","ieee":"D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, and L. B. Sweeney, “Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections,” in Xenopus, vol. 3049, C. W. Beck, Ed. Springer, 2026, pp. 245–259.","ama":"Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In: Beck CW, ed. Xenopus. Vol 3049. MIMB. Springer; 2026:245-259. doi:10.1007/978-1-0716-5360-9_11","ista":"Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. 2026.Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus cryosections. In: Xenopus. Methods in Molecular Biology, vol. 3049, 245–259.","chicago":"Vijatovic, David, Stavros Papadopoulos, Marco Dalla Vecchia, and Lora B. Sweeney. “Fluorescent in Situ MRNA Hybridization (FISH) Using Hybridization Chain Reaction (HCR) in Xenopus Cryosections.” In Xenopus, edited by Caroline W. Beck, 3049:245–59. MIMB. Springer, 2026. https://doi.org/10.1007/978-1-0716-5360-9_11."},"ddc":["570"],"das_tickbox":"0","oa_version":"Published Version","external_id":{"pmid":["42681228"]},"type":"book_chapter","month":"09","abstract":[{"text":"Hybridization Chain Reaction (HCR) enables highly sensitive and multiplexed detection of mRNA with subcellular spatial resolution. It employs fluorophore-tagged DNA hairpins that self-assemble on target-bound probe pairs, amplifying the signal without enzymatic reactions. Here, we describe a protocol for performing HCR fluorescence in situ hybridization (FISH) on Xenopus tissue sections. We also outline a semi-automated image analysis pipeline that enables per-cell quantification of probe expression and co-localization. This method provides a robust and quantitative approach for visualizing gene expression patterns in situ.","lang":"eng"}],"keyword":["mRNA FISH","Hybridization chain reaction","In situ hybridization","Fluorescence microscopy"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","researchdata_availability":"no","publication_status":"published","fulldoi":"https://doi.org/10.1007/978-1-0716-5360-9_11","date_updated":"2026-09-17T07:31:16Z","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"LoSw"},{"_id":"GradSch"},{"_id":"IAS"}],"alternative_title":["Methods in Molecular Biology"],"pmid":1},{"month":"08","abstract":[{"text":"Two-player games on graphs are a classical framework for analyzing strategic decision making. In turn-based games, two players move a token along the edges of the graph, and the right to move the token is determined by the current vertex. In traditional bidding games - referred to as pure bidding games - the right to move the token is determined at each step through bidding; here we consider Richman bidding, where the winning player of a bid pays the losing player. The winner is decided based on a temporal or quantitative specification evaluated over the resulting infinite play.\r\nIn this work, we combine turn-based games and pure bidding games into generalized bidding games, with player-1 vertices, player-2 vertices, and bidding vertices. This natural and simple generalization of bidding games has far-reaching consequences. First, we show that, as a model, generalized bidding games are more expressive than pure bidding games, and we provide several applications. Second, and most importantly, we show that generalized Richman bidding games are structurally equivalent to simple stochastic games, a well-studied model: they are linearly interreducible to each other. As was previously known, the special case of pure Richman bidding games corresponds to random-turn games. In other words, generalized bidding games extend pure bidding games in the same way that simple stochastic games extend random-turn games. We use this connection to solve generalized Richman bidding games for temporal (parity) and quantitative (mean-payoff and discounted-sum) specifications. From a computational perspective, we establish that generalized bidding games with parity and mean-payoff specifications retain the best known upper bounds for turn-based games and pure bidding games, namely NP∩coNP.\r\nFinally, we study a repair problem that asks whether bidding vertices can be assigned \"owners\" so as to bring the threshold budget required to win the game below a given target. This problem has direct applications in compositional policy synthesis for multi-objective settings, and we show it to be NP-complete.","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","type":"conference","external_id":{"arxiv":["2606.29420"]},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2026-08-24T00:00:00Z","ddc":["000"],"citation":{"mla":"Asadi, Ali, et al. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” 37th International Conference on Concurrency Theory, vol. 391, 13:1-13:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.13.","apa":"Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026). Generalized bidding games: Where bidding and stochastic games meet. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13","ama":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. Generalized bidding games: Where bidding and stochastic games meet. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.13","ista":"Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized bidding games: Where bidding and stochastic games meet. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 13:1-13:20.","chicago":"Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.","ieee":"A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized bidding games: Where bidding and stochastic games meet,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","short":"A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"status":"public","project":[{"_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)","grant_number":"COE12"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"OA_type":"gold","doi":"10.4230/LIPIcs.CONCUR.2026.13","article_number":"13:1-13:20","article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","researchdata_availability":"no","publication_status":"published","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.13","date_updated":"2026-09-17T09:44:41Z","keyword":["Bidding Games","Stochastic Games"],"publication_identifier":{"isbn":["9783959774475"],"eissn":["1868-8969"]},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file":[{"creator":"dernst","relation":"main_file","access_level":"open_access","file_id":"22946","checksum":"de9af748d78fa42c173f68a71cbbd8d9","success":1,"file_size":1175682,"date_updated":"2026-09-17T09:43:28Z","file_name":"2026_LIPIcsCONCUR_Asadi.pdf","date_created":"2026-09-17T09:43:28Z","content_type":"application/pdf"}],"scopus_import":"1","title":"Generalized bidding games: Where bidding and stochastic games meet","quality_controlled":"1","author":[{"full_name":"Asadi, Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","last_name":"Asadi","first_name":"Ali"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"first_name":"Ehsan","orcid":"0000-0002-8595-0587","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","full_name":"Kafshdar Goharshadi, Ehsan","last_name":"Kafshdar Goharshadi"},{"first_name":"Pavol","last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","full_name":"Kebis, Pavol"},{"orcid":"0000-0001-9864-7475","first_name":"Kaushik","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","full_name":"Mallik, Kaushik"}],"file_date_updated":"2026-09-17T09:43:28Z","date_created":"2026-09-13T22:01:53Z","_id":"22920","supplementarymaterial":"yes","year":"2026","OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"conference":{"end_date":"2026-09-04","start_date":"2026-09-01","location":"Liverpool, United Kingdom","name":"CONCUR: Conference on Concurrency Theory"},"oa":1,"intvolume":" 391","volume":391,"publication":"37th International Conference on Concurrency Theory","acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), ERC-2020-AdG 101020093\r\n(VAMOS), and the RYC2024-049116-I grant funded by MICIU/AEI/10.13039/501100011033 and\r\nESF+.\r\n","arxiv":1,"day":"24"},{"department":[{"_id":"GradSch"},{"_id":"KrCh"},{"_id":"ToHe"}],"alternative_title":["LIPIcs"],"has_accepted_license":"1","article_processing_charge":"Yes","article_number":"12:1-12:23","keyword":["formal methods","games and logic","logical aspects of AI","model checking"],"date_updated":"2026-09-17T09:51:25Z","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","publication_status":"published","researchdata_availability":"no","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2607.14877"]},"type":"conference","das_tickbox":"0","oa_version":"Published Version","abstract":[{"text":"Reachability is the most fundamental logical objective, yet it is notoriously difficult to learn in reinforcement learning settings: even for Markov decision processes, PAC learning of reachability is impossible without additional assumptions. This difficulty also holds in turn-based stochastic games (TBSGs), where two adversarial players interact on a finite state space. In this work, we consider turn-based stochastic games with reachability objectives. For such settings, adversarial learning, in which players are adversarial even in the learning phase, is impossible. Therefore, the goal is to consider learning, in which both players learn the unknown model together. In this spirit, previous literature on PAC learning in TBSGs considers (a) public information shared by both players; and (b) centralized learning, which means that players share the same learning algorithm. In this work, our contribution is two-fold. First, we relax these strong assumptions and ensure learning: (i) with private information not shared with the other player; and (ii) decentralized learning where the players do not share the same learning algorithm. To the best of our knowledge, this work is the first positive result for decentralized and private information learning of TBSGs with reachability objectives. Second, we introduce a game-theoretic generalization of the Expected Conditional Distance (ECD) parameter, which measures the expected length of reaching the target set. We establish a polynomial-sample complexity bound with respect to the number of states, actions, ECD parameter, and inverses of error tolerance and failure probability.","lang":"eng"}],"month":"08","doi":"10.4230/LIPIcs.CONCUR.2026.12","OA_type":"gold","project":[{"_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12","name":"Bilateral Artificial Intelligence (Chatterjee)"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"F8502","name":"Interface Theory for Security and Privacy","_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"status":"public","ddc":["000"],"citation":{"ama":"Asadi A, Chatterjee K, Kebis P. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.12","ista":"Asadi A, Chatterjee K, Kebis P. 2026. PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 12:1-12:23.","chicago":"Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.","short":"A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","ieee":"A. Asadi, K. Chatterjee, and P. Kebis, “PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","apa":"Asadi, A., Chatterjee, K., & Kebis, P. (2026). PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12","mla":"Asadi, Ali, et al. “PAC Learning in Turn-Based Stochastic Games with Reachability Objectives: A Decentralized Private Approach via Expected Conditional Distance.” 37th International Conference on Concurrency Theory, vol. 391, 12:1-12:23, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.12."},"date_published":"2026-08-24T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"intvolume":" 391","oa":1,"conference":{"end_date":"2026-09-04","start_date":"2026-09-01","location":"Liverpool, United Kingdom","name":"CONCUR: Conference on Concurrency Theory"},"language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","year":"2026","arxiv":1,"day":"24","acknowledgement":"The research was partially supported by Austrian Science Fund (FWF) 10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), and ERC-2020-AdG 101020093\r\n(VAMOS) grants.","publication":"37th International Conference on Concurrency Theory","volume":391,"author":[{"first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","full_name":"Asadi, Ali","last_name":"Asadi"},{"first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee"},{"full_name":"Kebis, Pavol","last_name":"Kebis","id":"2e0132b3-4e98-11ef-b275-cf7281c2802a","first_name":"Pavol"}],"quality_controlled":"1","title":"PAC learning in turn-based stochastic games with reachability objectives: A decentralized private approach via expected conditional distance","scopus_import":"1","file":[{"access_level":"open_access","file_id":"22947","relation":"main_file","creator":"dernst","checksum":"2e6c55b65d9d7ce436a6f59e81d7ba17","success":1,"file_name":"2026_LIPIcsCONCUR_Asadi2.pdf","date_updated":"2026-09-17T09:50:00Z","date_created":"2026-09-17T09:50:00Z","content_type":"application/pdf","file_size":959234}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"isbn":["9783959774475"],"eissn":["1868-8969"]},"supplementarymaterial":"yes","_id":"22919","date_created":"2026-09-13T22:01:53Z","file_date_updated":"2026-09-17T09:50:00Z"},{"oa":1,"intvolume":" 17","year":"2026","corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"PlanS_conform":"1","acknowledgement":"We acknowledge useful discussions with J.-S. Caux, E. Demler, J. Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter, F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. We acknowledge support by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI). This research was funded in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This research was supported in part by grant NSF PHY2309135 to the Kavli Institute for Theoretical Physics (KITP).","day":"21","publication":"Nature Communications","volume":17,"title":"Quasi-solitons in Rydberg atom chains","quality_controlled":"1","DOAJ_listed":"1","article_type":"original","author":[{"last_name":"Kerschbaumer","id":"ade85a9c-3200-11ee-973b-91c1eb240410","full_name":"Kerschbaumer, Aron","first_name":"Aron","orcid":"0009-0002-2370-8661"},{"orcid":"0000-0002-3749-6375","first_name":"Jean-Yves Marc","id":"6c292945-a610-11ed-9eec-c3be1ad62a80","last_name":"Desaules","full_name":"Desaules, Jean-Yves Marc"},{"id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","last_name":"Ljubotina","full_name":"Ljubotina, Marko","first_name":"Marko","orcid":"0000-0003-0038-7068"},{"first_name":"Maksym","orcid":"0000-0002-2399-5827","full_name":"Serbyn, Maksym","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","last_name":"Serbyn"}],"publication_identifier":{"eissn":["2041-1723"]},"publisher":"Springer Nature","file":[{"relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"22863","checksum":"2e12ade81e19b7eea099a2196217edff","success":1,"file_size":1337815,"date_created":"2026-09-09T07:04:48Z","file_name":"2026_NatureComm_Kerschbaumer.pdf","date_updated":"2026-09-09T07:04:48Z","content_type":"application/pdf"}],"scopus_import":"1","supplementarymaterial":"yes","file_date_updated":"2026-09-09T07:04:48Z","_id":"22408","date_created":"2026-07-27T07:26:27Z","article_processing_charge":"Yes","has_accepted_license":"1","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"pmid":1,"article_number":"8783","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"researchdata_availability":"yes","publication_status":"published","fulldoi":"https://doi.org/10.1038/s41467-026-75598-1","date_updated":"2026-09-17T10:54:09Z","oa_version":"Published Version","das_tickbox":"1","type":"journal_article","external_id":{"pmid":["42469244"]},"month":"08","related_material":{"record":[{"relation":"research_data","status":"public","id":"21960"}]},"abstract":[{"text":"Solitons—localized wave packets that travel without spreading—play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays.","lang":"eng"}],"status":"public","project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"},{"grant_number":"COE01","name":"Quantum Science Austria (Serbyn)","_id":"92c64506-16d5-11f0-9cad-87ce313ee832"}],"OA_type":"gold","doi":"10.1038/s41467-026-75598-1","dataavailabilitystatement":"The raw data used to generate the figures are available at ref54.The TEBD algorithm used in this work was implemented using the ITensor library48,49 and the integration of the classical differential equations was performed via SciPy’s Runge-Kutta RK45 integrator52,53. The code used in this study to produce the plots from the shared data is available at ref.54.","date_published":"2026-08-21T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"apa":"Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., & Serbyn, M. (2026). Quasi-solitons in Rydberg atom chains. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-75598-1","mla":"Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications, vol. 17, 8783, Springer Nature, 2026, doi:10.1038/s41467-026-75598-1.","short":"A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications 17 (2026).","ieee":"A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons in Rydberg atom chains,” Nature Communications, vol. 17. Springer Nature, 2026.","chicago":"Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75598-1.","ista":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons in Rydberg atom chains. Nature Communications. 17, 8783.","ama":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg atom chains. Nature Communications. 2026;17. doi:10.1038/s41467-026-75598-1"},"ddc":["530"]},{"day":"16","contributor":[{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","last_name":"Kerschbaumer","first_name":"Aron","contributor_type":"contact_person","orcid":"0009-0002-2370-8661"},{"last_name":"Serbyn","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2399-5827","contributor_type":"supervisor","first_name":"Maksym"},{"orcid":"0000-0002-3749-6375","contributor_type":"researcher","first_name":"Jean-Yves Marc","last_name":"Desaules","id":"6c292945-a610-11ed-9eec-c3be1ad62a80"},{"first_name":"Marko","contributor_type":"researcher","last_name":"Ljubotina"}],"oa":1,"year":"2026","corr_author":"1","OA_place":"repository","file_date_updated":"2026-06-15T22:02:07Z","_id":"21960","date_created":"2026-06-09T07:17:50Z","title":"Research Data: \"Quasi-solitons in Rydberg atom chains\"","author":[{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","last_name":"Kerschbaumer","full_name":"Kerschbaumer, Aron","orcid":"0009-0002-2370-8661","first_name":"Aron"}],"publisher":"Institute of Science and Technology Austria","file":[{"file_id":"22010","access_level":"open_access","relation":"main_file","creator":"akerschb","success":1,"checksum":"133269a105e996c6c44fdd56128259c7","content_type":"text/plain","date_updated":"2026-06-15T22:01:57Z","file_name":"README.txt","date_created":"2026-06-15T22:01:57Z","file_size":1940},{"file_id":"22011","access_level":"open_access","relation":"main_file","creator":"akerschb","success":1,"checksum":"759f9649c3919f4c4ad37a1d104ea32a","content_type":"application/zip","date_created":"2026-06-15T22:02:07Z","file_name":"Soliton_Data.zip","date_updated":"2026-06-15T22:02:07Z","file_size":13259747}],"ec_funded":1,"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","date_updated":"2026-09-17T10:54:08Z","fulldoi":"https://doi.org/10.15479/AT-ISTA-21960","article_processing_charge":"No","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"MaSe"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","status":"public","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"doi":"10.15479/AT-ISTA-21960","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"date_published":"2026-06-16T00:00:00Z","citation":{"chicago":"Kerschbaumer, Aron. “Research Data: ‘Quasi-Solitons in Rydberg Atom Chains.’” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21960.","ista":"Kerschbaumer A. 2026. Research Data: ‘Quasi-solitons in Rydberg atom chains’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21960.","ama":"Kerschbaumer A. Research Data: “Quasi-solitons in Rydberg atom chains.” 2026. doi:10.15479/AT-ISTA-21960","short":"A. Kerschbaumer, (2026).","ieee":"A. Kerschbaumer, “Research Data: ‘Quasi-solitons in Rydberg atom chains.’” Institute of Science and Technology Austria, 2026.","mla":"Kerschbaumer, Aron. Research Data: “Quasi-Solitons in Rydberg Atom Chains.” Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21960.","apa":"Kerschbaumer, A. (2026). Research Data: “Quasi-solitons in Rydberg atom chains.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21960"},"oa_version":"Published Version","type":"research_data","month":"06","abstract":[{"text":"Solitons - localized wave packets that travel without spreading - play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. \r\nThese localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays.","lang":"eng"}],"related_material":{"record":[{"id":"22408","status":"public","relation":"used_in_publication"}]}},{"doi":"10.15479/AT-ISTA-22808","status":"public","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"citation":{"mla":"Kueffner, Konstantin. Monitoring Algorithmic Fairness in Sequential Decision Making. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22808.","apa":"Kueffner, K. (2026). Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22808","short":"K. Kueffner, Monitoring Algorithmic Fairness in Sequential Decision Making, Institute of Science and Technology Austria, 2026.","ieee":"K. Kueffner, “Monitoring algorithmic fairness in sequential decision making,” Institute of Science and Technology Austria, 2026.","ama":"Kueffner K. Monitoring algorithmic fairness in sequential decision making. 2026. doi:10.15479/AT-ISTA-22808","chicago":"Kueffner, Konstantin. “Monitoring Algorithmic Fairness in Sequential Decision Making.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22808.","ista":"Kueffner K. 2026. Monitoring algorithmic fairness in sequential decision making. Institute of Science and Technology Austria."},"ddc":["000"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2026-09-07T00:00:00Z","type":"dissertation","oa_version":"Published Version","related_material":{"record":[{"id":"13310","status":"public","relation":"part_of_dissertation"},{"id":"14454","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"20292","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"21090"},{"relation":"part_of_dissertation","id":"13228","status":"public"}]},"abstract":[{"text":"As automated decision-makers have become ubiquitous in many domains of life,\r\ntheir decisions have become increasingly consequential. Recent years have shown\r\nthat such systems can exhibit discriminatory behaviour against individuals and\r\nsocial groups alike, thereby amplifying existing biases and entrenching\r\nsocio-economic disparities over time. Algorithmic fairness addresses this\r\nproblem by developing methods to quantify and mitigate unfair behaviour.\r\nHowever, much of the existing literature studies fairness in a static\r\npre-deployment setting and, therefore, neglects that automated decision-makers are\r\noften deployed in dynamic environments, where their behaviour and the\r\npopulations they affect may change over time.\r\n\r\nThis thesis addresses this gap through the lens of runtime verification.\r\nInstead of treating fairness as a property of a classifier together with a fixed\r\ninput distribution, it reframes fairness as a property of the interaction trace\r\nbetween the decision-maker and its deployment environment. To evaluate such\r\nsequential fairness properties, the thesis develops runtime monitors that\r\nobserve the evolving interaction between the system and the environment and\r\nissue verdicts after each new observation. Because, these monitors are designed to detect\r\nunfair behaviour during deployment, they complement fair training,\r\nauditing, verification, and enforcement by providing an additional layer of mathematically rigorous fairness assurance.\r\n\r\nIn summary, the thesis develops quantitative, trace-based analogues of\r\nclassical group and individual fairness measures and constructs monitors for\r\nthem. This includes monitors for long-run group fairness over Markovian traces,\r\nfor the time-varying welfare of a changing population in a dynamical system, and\r\nfor the individual fairness of an arbitrary system generating a trace of inputs\r\nand outputs. To achieve this, the monitors combine ideas from runtime\r\nverification, sequential statistics, and nearest-neighbour search. In the\r\ngroup-fairness settings, monitoring is primarily a sequential statistical\r\nestimation problem: the monitor must construct statistically sound interval\r\nestimates of fairness values from dependent and partially observed interactions.\r\nIn the individual-fairness setting, the main challenge is computational\r\nefficiency: the monitor must detect individual fairness violations by efficiently comparing the\r\ncurrent decision with all previously observed decisions.\r\n","lang":"eng"}],"month":"09","publication_status":"published","date_updated":"2026-09-18T07:41:29Z","fulldoi":"https://doi.org/10.15479/AT-ISTA-22808","ec_funded":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"alternative_title":["ISTA Thesis"],"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-09-11T07:32:17Z","page":"183","_id":"22808","date_created":"2026-09-05T15:59:19Z","author":[{"first_name":"Konstantin","orcid":"0000-0001-8974-2542","full_name":"Kueffner, Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515","last_name":"Kueffner"}],"title":"Monitoring algorithmic fairness in sequential decision making","doi_confirm":"1","file":[{"checksum":"716ce44a6ed9a727f231bdebdeecc741","access_level":"closed","file_id":"22903","creator":"kkueffne","relation":"source_file","date_created":"2026-09-11T07:32:13Z","file_name":"Thesis_Konstantin_Kueffner-3.zip","date_updated":"2026-09-11T07:32:13Z","content_type":"application/zip","file_size":26356903},{"checksum":"77082e90b8330fb46f585843840c5d5c","access_level":"open_access","file_id":"22904","relation":"main_file","creator":"kkueffne","file_name":"Thesis_Konstantin_Kueffner-2.pdf","date_created":"2026-09-11T07:32:17Z","date_updated":"2026-09-11T07:32:17Z","content_type":"application/pdf","file_size":10051715}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-089-3"]},"publisher":"Institute of Science and Technology Austria","degree_awarded":"PhD","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\n","day":"07","supervisor":[{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"oa":1,"OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"year":"2026"},{"language":[{"iso":"eng"}],"OA_place":"publisher","corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"},{"_id":"CampIT"}],"year":"2026","supervisor":[{"full_name":"Goodrich, Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074","first_name":"Carl Peter"},{"first_name":"Edouard B","orcid":"0000-0001-6005-1561","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","full_name":"Hannezo, Edouard B"}],"day":"04","degree_awarded":"PhD","acknowledgement":"I acknowledge funding by the Austrian Science Fund (FWF) [10.55776/PAT8537123].","doi_confirm":"1","file":[{"file_id":"22901","access_level":"closed","creator":"aehrmann","relation":"main_file","checksum":"a5e3d79e0e5f3f4fb3c414e48116dc9e","content_type":"application/pdf","embargo_to":"open_access","date_created":"2026-09-11T07:23:57Z","file_name":"2026_Ehrmann_Andreas_Thesis.pdf","date_updated":"2026-09-17T08:59:39Z","file_size":14782662,"embargo":"2027-01-15"},{"access_level":"closed","file_id":"22902","relation":"source_file","creator":"aehrmann","checksum":"0235b9c52fee0c97f402f1c3d4efc1eb","description":"All LaTeX files to compile my PhD Thesis.","file_name":"thesis_latex_files.zip","date_updated":"2026-09-11T07:24:14Z","date_created":"2026-09-11T07:24:14Z","content_type":"application/zip","file_size":155228}],"publisher":"Institute of Science and Technology Austria","publication_identifier":{"isbn":["978-3-99078-092-3"],"issn":["2663-337X"]},"author":[{"orcid":"0000-0002-0997-5678","first_name":"Andreas","last_name":"Ehrmann","id":"eaa689ed-f6e0-11ea-865d-bd98cbcf83c2","full_name":"Ehrmann, Andreas"}],"title":"Biological functionality without biochemistry: Designing nanomachines for target behavior","date_created":"2026-09-09T12:18:24Z","_id":"22873","page":"168","file_date_updated":"2026-09-17T08:59:39Z","supplementarymaterial":"not applicable","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","department":[{"_id":"GradSch"},{"_id":"CaGo"},{"_id":"EdHa"}],"alternative_title":["ISTA Thesis"],"has_accepted_license":"1","article_processing_charge":"No","fulldoi":"https://doi.org/10.15479/AT-ISTA-22873","date_updated":"2026-09-18T11:28:29Z","publication_status":"published","researchdata_availability":"upon request","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","keyword":["PhD Thesis","functional nanomachines","biological functionality","nanotechnology","energy delivery","target behavior","dynamics","design principles","optimization","differentiable statistical physics","machine learning"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"22893","status":"public"},{"id":"22892","status":"public","relation":"part_of_dissertation"}]},"month":"09","type":"dissertation","das_tickbox":"0","oa_version":"Published Version","ddc":["530","600","621","004","005"],"citation":{"ista":"Ehrmann A. 2026. Biological functionality without biochemistry: Designing nanomachines for target behavior. Institute of Science and Technology Austria.","ama":"Ehrmann A. Biological functionality without biochemistry: Designing nanomachines for target behavior. 2026. doi:10.15479/AT-ISTA-22873","chicago":"Ehrmann, Andreas. “Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22873.","ieee":"A. Ehrmann, “Biological functionality without biochemistry: Designing nanomachines for target behavior,” Institute of Science and Technology Austria, 2026.","short":"A. Ehrmann, Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior, Institute of Science and Technology Austria, 2026.","apa":"Ehrmann, A. (2026). Biological functionality without biochemistry: Designing nanomachines for target behavior. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22873","mla":"Ehrmann, Andreas. Biological Functionality without Biochemistry: Designing Nanomachines for Target Behavior. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22873."},"tmp":{"image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","short":"CC BY-NC-SA (4.0)"},"date_published":"2026-09-04T00:00:00Z","doi":"10.15479/AT-ISTA-22873","project":[{"grant_number":"PAT 8537123","name":"Functional bio-inspired nanomachines from sticky colloids","_id":"90a98bb5-16d5-11f0-9cad-9675f3f8015d"}],"status":"public"},{"year":"2026","language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","oa":1,"conference":{"location":"Rio de Janeiro, Brazil","name":"ICLR: International Conference on Learning Representations ","start_date":"2026-04-23","end_date":"2026-04-27"},"intvolume":" 2026","volume":2026,"publication":"14th International Conference on Learning Representations","arxiv":1,"day":"26","acknowledgement":"M.M. is funded by the European Union (ERC, INF2\r\n, project number 101161364). S.B. was supported\r\nby a Google PhD fellowship. L.I. acknowledges the grant received from the European Union NextGenerationEU (Piano Nazionale di Ripresa E Resilienza (PNRR)) DM 351 on Trustworthy AI. T.T. &\r\nL.I. acknowledge the EU project ELSA - European Lighthouse on Secure and Safe AI. This study was\r\ncarried out within the FAIR - Future Artificial Intelligence Research and received funding from the\r\nEuropean Union Next-GenerationEU (PIANO NAZIONALE DI RIPRESA E RESILIENZA (PNRR)\r\n– MISSIONE 4 COMPONENTE 2, INVESTIMENTO 1.3 – D.D. 1555 11/10/2022, PE00000013).\r\nThis manuscript reflects only the authors’ views and opinions, neither the European Union nor the\r\nEuropean Commission can be considered responsible for them. The authors would like to thank\r\nYizhe Zhu for helpful discussions.","publisher":"OpenReview","publication_identifier":{"isbn":["9798331339678"]},"file":[{"relation":"main_file","creator":"cchlebak","file_id":"22907","access_level":"open_access","success":1,"checksum":"a3dcba6649b7496124fa0ae68bf2c4cb","file_size":7869510,"content_type":"application/pdf","file_name":"2026_ICLR_Iurada.pdf","date_updated":"2026-09-11T12:07:48Z","date_created":"2026-09-11T12:07:48Z"}],"quality_controlled":"1","title":"A law of data reconstruction for random features (and beyond)","author":[{"full_name":"Iurada, Leonardo","last_name":"Iurada","first_name":"Leonardo"},{"id":"ca726dda-de17-11ea-bc14-f9da834f63aa","last_name":"Bombari","full_name":"Bombari, Simone","first_name":"Simone"},{"full_name":"Tommasi, Tatiana","last_name":"Tommasi","first_name":"Tatiana"},{"last_name":"Mondelli","full_name":"Mondelli, Marco","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020"}],"_id":"22894","page":"145275-145314","date_created":"2026-09-09T13:31:46Z","file_date_updated":"2026-09-11T12:07:48Z","has_accepted_license":"1","article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-09-21T13:07:01Z","publication_status":"published","month":"01","related_material":{"record":[{"relation":"dissertation_contains","id":"22857","status":"public"}]},"abstract":[{"text":"Large-scale deep learning models are known to memorize parts of the training\r\nset. In machine learning theory, memorization is often framed as interpolation or\r\nlabel fitting, and classical results show that this can be achieved when the number\r\nof parameters p in the model is larger than the number of training samples n. In\r\nthis work, we consider memorization from the perspective of data reconstruction,\r\ndemonstrating that this can be achieved when p is larger than dn, where d is\r\nthe dimensionality of the data. More specifically, we show that, in the random\r\nfeatures model, when p ≫ dn, the subspace spanned by the training samples in\r\nfeature space gives sufficient information to identify the individual samples in input\r\nspace. Our analysis suggests an optimization method to reconstruct the dataset\r\nfrom the model parameters, and we demonstrate that this method performs well on\r\nvarious architectures (random features, two-layer fully-connected and deep residual\r\nnetworks). Our results reveal a law of data reconstruction, according to which the\r\nentire training dataset can be recovered as p exceeds the threshold dn.\r\n","lang":"eng"}],"das_tickbox":"0","oa_version":"Published Version","external_id":{"arxiv":["2509.22214"]},"type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2026-01-26T00:00:00Z","citation":{"apa":"Iurada, L., Bombari, S., Tommasi, T., & Mondelli, M. (2026). A law of data reconstruction for random features (and beyond). In 14th International Conference on Learning Representations (Vol. 2026, pp. 145275–145314). Rio de Janeiro, Brazil: OpenReview.","mla":"Iurada, Leonardo, et al. “A Law of Data Reconstruction for Random Features (and Beyond).” 14th International Conference on Learning Representations, vol. 2026, OpenReview, 2026, pp. 145275–314.","ista":"Iurada L, Bombari S, Tommasi T, Mondelli M. 2026. A law of data reconstruction for random features (and beyond). 14th International Conference on Learning Representations. ICLR: International Conference on Learning Representations vol. 2026, 145275–145314.","chicago":"Iurada, Leonardo, Simone Bombari, Tatiana Tommasi, and Marco Mondelli. “A Law of Data Reconstruction for Random Features (and Beyond).” In 14th International Conference on Learning Representations, 2026:145275–314. OpenReview, 2026.","ama":"Iurada L, Bombari S, Tommasi T, Mondelli M. A law of data reconstruction for random features (and beyond). In: 14th International Conference on Learning Representations. Vol 2026. OpenReview; 2026:145275-145314.","short":"L. Iurada, S. Bombari, T. Tommasi, M. Mondelli, in:, 14th International Conference on Learning Representations, OpenReview, 2026, pp. 145275–145314.","ieee":"L. Iurada, S. Bombari, T. Tommasi, and M. Mondelli, “A law of data reconstruction for random features (and beyond),” in 14th International Conference on Learning Representations, Rio de Janeiro, Brazil, 2026, vol. 2026, pp. 145275–145314."},"ddc":["000"],"project":[{"name":"Inference in High Dimensions: Light-speed Algorithms and Information Limits","grant_number":"101161364","_id":"911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf"},{"name":"Trustworthy Deep Learning Theory: Private Over-Parameterized Models and Robust LLMs","_id":"92099302-16d5-11f0-9cad-f9a785f54fbd"}],"status":"public","OA_type":"gold"},{"supplementarymaterial":"no","date_created":"2026-09-13T22:01:54Z","_id":"22921","file_date_updated":"2026-09-22T05:59:03Z","quality_controlled":"1","title":"Monitoring discounted sum properties","author":[{"last_name":"Cano Cordoba","id":"708cad98-e86a-11ef-8098-bdae2d7c6af1","full_name":"Cano Cordoba, Filip","orcid":"0000-0002-0783-904X","first_name":"Filip"},{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger"},{"orcid":"0000-0001-8974-2542","first_name":"Konstantin","last_name":"Kueffner","full_name":"Kueffner, Konstantin","id":"8121a2d0-dc85-11ea-9058-af578f3b4515"},{"last_name":"Sarac","full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959774475"]},"scopus_import":"1","file":[{"checksum":"f7b2e22428344fd7972c54f099df6aba","success":1,"access_level":"open_access","file_id":"22978","creator":"dernst","relation":"main_file","date_updated":"2026-09-22T05:59:03Z","date_created":"2026-09-22T05:59:03Z","file_name":"2026_LIPIcsCONCUR_Cano.pdf","content_type":"application/pdf","file_size":997156}],"day":"24","arxiv":1,"acknowledgement":"This work has been supported by the European Research Council under Grant No.: ERC2020-AdG 101020093 and ERC-2021-AdG 101055412.\r\nFilip Cano: ERC-2020-AdG 101020093\r\nThomas A. Henzinger: ERC-2020-AdG 101020093\r\nKonstantin Kueffner: ERC-2020-AdG 101020093\r\nN. Ege Saraç: ERC-2021-AdG 101055412","publication":"37th International Conference on Concurrency Theory","volume":391,"oa":1,"conference":{"name":"CONCUR: Conference on Concurrency Theory","location":"Liverpool, United Kingdom","start_date":"2026-09-01","end_date":"2026-09-04"},"intvolume":" 391","year":"2026","language":[{"iso":"eng"}],"corr_author":"1","OA_place":"publisher","project":[{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"status":"public","OA_type":"gold","dataavailabilitystatement":"Software (Source Code): https://github.com/filipcano/monitoringdiscounted-sum-properties [10]\r\narchived at swh:1:dir:cb99396415f279c985cd05206b44320227f64245\r\n","doi":"10.4230/LIPIcs.CONCUR.2026.22","date_published":"2026-08-24T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"mla":"Cano Cordoba, Filip, et al. “Monitoring Discounted Sum Properties.” 37th International Conference on Concurrency Theory, vol. 391, 22:1-22:19, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.22.","apa":"Cano Cordoba, F., Henzinger, T. A., Kueffner, K., & Sarac, N. E. (2026). Monitoring discounted sum properties. In 37th International Conference on Concurrency Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.22","chicago":"Cano Cordoba, Filip, Thomas A Henzinger, Konstantin Kueffner, and Naci E Sarac. “Monitoring Discounted Sum Properties.” In 37th International Conference on Concurrency Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.22.","ista":"Cano Cordoba F, Henzinger TA, Kueffner K, Sarac NE. 2026. Monitoring discounted sum properties. 37th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 391, 22:1-22:19.","ama":"Cano Cordoba F, Henzinger TA, Kueffner K, Sarac NE. Monitoring discounted sum properties. In: 37th International Conference on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.22","ieee":"F. Cano Cordoba, T. A. Henzinger, K. Kueffner, and N. E. Sarac, “Monitoring discounted sum properties,” in 37th International Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.","short":"F. Cano Cordoba, T.A. Henzinger, K. Kueffner, N.E. Sarac, in:, 37th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"ddc":["000"],"das_tickbox":"1","oa_version":"Published Version","type":"conference","external_id":{"arxiv":["2606.25979"]},"month":"08","abstract":[{"lang":"eng","text":"Runtime monitoring of quantitative signals faces a fundamental trade-off between volatility and over-aggregation: instantaneous observations are noisy, while long-run averages obscure local structure. Localisation measures such as discounted averages offer a principled middle ground, yet remain poorly understood in runtime verification. This paper studies discounted sums from a monitoring perspective, in both deterministic and stochastic settings. We formalize the discounted monitoring problem and show that exact, sound monitoring of discounted sums cannot be achieved with finite memory. To overcome this impossibility, we introduce ε-approximately sound monitoring, deriving explicit bounds on memory and observation requirements. We then extend the framework to stochastic processes via expected discounted sums, defining pointwise and uniform (ε,δ)-soundness notions, establishing statistical optimality, and proving impossibility beyond a precision threshold. We also formalize the resource complexity of deterministic discounted monitoring via affine register machines and prove a tight worst-case lower bound. Finally, we present a specification language for arithmetic expressions over multiple discounted sums with synchronous and asynchronous semantics, and evaluate our approach on practical scenarios including algorithmic fairness."}],"keyword":["Runtime Verification","Probabilistic Systems","Quantitative Verification","Approximate Monitoring"],"researchdata_availability":"no","ec_funded":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-09-22T06:02:06Z","fulldoi":"https://doi.org/10.4230/LIPIcs.CONCUR.2026.22","publication_status":"published","has_accepted_license":"1","article_processing_charge":"Yes","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"alternative_title":["LIPIcs"],"article_number":"22:1-22:19"},{"year":"2026","language":[{"iso":"eng"}],"OA_place":"publisher","oa":1,"intvolume":" 6","publication":"Bioinformatics Advances","volume":6,"day":"06","acknowledgement":"We acknowledge the sponsors who made the SEH2Bioinfo possible, the organizers from the various Spanish-speaking RSGs, and\r\nthe collaborators who contributed to dissemination, logistics,\r\nand other essential tasks for its execution. G.J.O.-O. thanks the\r\nFONDECYT Postdoctoral Project No. 3250793 for financial support. G.J.O.-O. also expresses gratitude to Valentina Luza: “May\r\nher passion for science communication keep inspiring new generations, myself included, to infinity and beyond!” R.G.P.\r\nthanks the Argentinian public university education system as an\r\nelement of social ascendance and democratization of professional opportunities.","publisher":"Oxford University Press","publication_identifier":{"eissn":["2635-0041"]},"scopus_import":"1","file":[{"access_level":"open_access","file_id":"23016","relation":"main_file","creator":"dernst","checksum":"8885b0531a655103c46899b2f935b0db","success":1,"file_name":"2026_BioinformaticsAdvances_Franzotti.pdf","date_updated":"2026-10-01T08:55:00Z","date_created":"2026-10-01T08:55:00Z","content_type":"application/pdf","file_size":1359968}],"quality_controlled":"1","title":"Bioinformatics in Español: Expanding open, diverse, and collaborative science through SEH2Bioinfo","DOAJ_listed":"1","article_type":"original","author":[{"full_name":"Padilla Franzotti, Carla L","last_name":"Padilla Franzotti","first_name":"Carla L"},{"last_name":"Olguín-Orellana","full_name":"Olguín-Orellana, Gabriel J","first_name":"Gabriel J"},{"last_name":"Palopoli","full_name":"Palopoli, Nicolas","first_name":"Nicolas"},{"first_name":"Sebastián","last_name":"Urquiza-Zurich","full_name":"Urquiza-Zurich, Sebastián"},{"first_name":"Adrian","last_name":"Garcia-Moreno","full_name":"Garcia-Moreno, Adrian"},{"first_name":"Sara","last_name":"Monzón","full_name":"Monzón, Sara"},{"first_name":"Mónica","last_name":"Cabrera-Pasadas","full_name":"Cabrera-Pasadas, Mónica"},{"first_name":"Irene","last_name":"Soler Sáez","full_name":"Soler Sáez, Irene"},{"first_name":"Carla","full_name":"Perpiñá-Clérigues, Carla","last_name":"Perpiñá-Clérigues"},{"last_name":"Puche Quiñonez","full_name":"Puche Quiñonez, Rafael J","first_name":"Rafael J"},{"first_name":"Jennifer","last_name":"Vélez Segura","full_name":"Vélez Segura, Jennifer"},{"full_name":"Lovaco-Flores, Jose Abel","last_name":"Lovaco-Flores","first_name":"Jose Abel"},{"first_name":"Cleidy M","full_name":"Osorio Mogollón, Cleidy M","last_name":"Osorio Mogollón"},{"first_name":"Eva M","full_name":"Esquinas-Román, Eva M","last_name":"Esquinas-Román"},{"last_name":"Miserendino","full_name":"Miserendino, Maria C","id":"273e0cbd-72f0-11ef-b75a-f9f932e292fa","first_name":"Maria C"},{"full_name":"Eranti, Pradeep","last_name":"Eranti","first_name":"Pradeep"},{"first_name":"Ana","last_name":"Castillo-Orozco","full_name":"Castillo-Orozco, Ana"},{"last_name":"Cuesta-Astroz","full_name":"Cuesta-Astroz, Yesid","first_name":"Yesid"},{"full_name":"Parra, R Gonzalo","last_name":"Parra","first_name":"R Gonzalo"}],"date_created":"2026-09-17T11:06:17Z","_id":"22957","file_date_updated":"2026-10-01T08:55:00Z","supplementarymaterial":"no","pmid":1,"article_number":"vbag182","has_accepted_license":"1","article_processing_charge":"Yes","department":[{"_id":"PaSc"},{"_id":"GradSch"}],"researchdata_availability":"yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-01T08:59:32Z","fulldoi":"https://doi.org/10.1093/bioadv/vbag182","issue":"1","publication_status":"published","month":"08","related_material":{"link":[{"url":"https://doi.org/10.1093/bioadv/vbag271","relation":"erratum"}]},"abstract":[{"lang":"eng","text":"Linguistic inequality remains a silent barrier in contemporary science, particularly in rapidly evolving and interdisciplinary fields such as bioinformatics. This article examines how the Spanish-speaking community has responded to this gap through the creation of the Simposio de Estudiantes Hispanohablantes de Bioinformática y Biología Computacional (SEH2Bioinfo), a collective initiative that transforms language into a tool for inclusion and collaboration. Drawing on a historical review of the use of Spanish in scientific communication and an analysis of the two editions of SEH2Bioinfo (2022 and 2025), complemented by surveys of more than 1500 participants, we explore the effects of language on confidence, participation, and academic visibility. The findings show that Spanish can serve as a space for training and mentorship without compromising rigor, while simultaneously strengthening international networks and promoting open science. The growth of SEH2Bioinfo, its collaborative approach, and its intercontinental reach establish the symposium as a model for linguistic equity in scientific practice. Its experience demonstrates that expanding linguistic diversity in bioinformatics is not only possible but essential to building a global scientific community that is fairer, more connected, and representative."}],"das_tickbox":"1","oa_version":"Published Version","type":"journal_article","external_id":{"pmid":["42577783"]},"date_published":"2026-08-06T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"chicago":"Padilla Franzotti, Carla L, Gabriel J Olguín-Orellana, Nicolas Palopoli, Sebastián Urquiza-Zurich, Adrian Garcia-Moreno, Sara Monzón, Mónica Cabrera-Pasadas, et al. “Bioinformatics in Español: Expanding Open, Diverse, and Collaborative Science through SEH2Bioinfo.” Bioinformatics Advances. Oxford University Press, 2026. https://doi.org/10.1093/bioadv/vbag182.","ama":"Padilla Franzotti CL, Olguín-Orellana GJ, Palopoli N, et al. Bioinformatics in Español: Expanding open, diverse, and collaborative science through SEH2Bioinfo. Bioinformatics Advances. 2026;6(1). doi:10.1093/bioadv/vbag182","ista":"Padilla Franzotti CL, Olguín-Orellana GJ, Palopoli N, Urquiza-Zurich S, Garcia-Moreno A, Monzón S, Cabrera-Pasadas M, Soler Sáez I, Perpiñá-Clérigues C, Puche Quiñonez RJ, Vélez Segura J, Lovaco-Flores JA, Osorio Mogollón CM, Esquinas-Román EM, Miserendino MC, Eranti P, Castillo-Orozco A, Cuesta-Astroz Y, Parra RG. 2026. Bioinformatics in Español: Expanding open, diverse, and collaborative science through SEH2Bioinfo. Bioinformatics Advances. 6(1), vbag182.","short":"C.L. Padilla Franzotti, G.J. Olguín-Orellana, N. Palopoli, S. Urquiza-Zurich, A. Garcia-Moreno, S. Monzón, M. Cabrera-Pasadas, I. Soler Sáez, C. Perpiñá-Clérigues, R.J. Puche Quiñonez, J. Vélez Segura, J.A. Lovaco-Flores, C.M. Osorio Mogollón, E.M. Esquinas-Román, M.C. Miserendino, P. Eranti, A. Castillo-Orozco, Y. Cuesta-Astroz, R.G. Parra, Bioinformatics Advances 6 (2026).","ieee":"C. L. Padilla Franzotti et al., “Bioinformatics in Español: Expanding open, diverse, and collaborative science through SEH2Bioinfo,” Bioinformatics Advances, vol. 6, no. 1. Oxford University Press, 2026.","mla":"Padilla Franzotti, Carla L., et al. “Bioinformatics in Español: Expanding Open, Diverse, and Collaborative Science through SEH2Bioinfo.” Bioinformatics Advances, vol. 6, no. 1, vbag182, Oxford University Press, 2026, doi:10.1093/bioadv/vbag182.","apa":"Padilla Franzotti, C. L., Olguín-Orellana, G. J., Palopoli, N., Urquiza-Zurich, S., Garcia-Moreno, A., Monzón, S., … Parra, R. G. (2026). Bioinformatics in Español: Expanding open, diverse, and collaborative science through SEH2Bioinfo. Bioinformatics Advances. Oxford University Press. https://doi.org/10.1093/bioadv/vbag182"},"ddc":["570"],"status":"public","dataavailabilitystatement":"The data underlying this article, including the abstract books for\r\nthe first and second editions of the SEH2Bioinfo symposia, are\r\navailable in Zenodo at https://doi.org/10.5281/zenodo.6603621\r\nand https://doi.org/10.5281/zenodo.1,54,46,570, respectively.","doi":"10.1093/bioadv/vbag182","OA_type":"gold"},{"date_published":"2026-02-09T00:00:00Z","citation":{"ieee":"J. A. Scott, “Data heterogeneity and personalization in federated learning,” Institute of Science and Technology Austria, 2026.","short":"J.A. Scott, Data Heterogeneity and Personalization in Federated Learning, Institute of Science and Technology Austria, 2026.","ama":"Scott JA. Data heterogeneity and personalization in federated learning. 2026. doi:10.15479/AT-ISTA-21198","ista":"Scott JA. 2026. Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria.","chicago":"Scott, Jonathan A. “Data Heterogeneity and Personalization in Federated Learning.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21198.","apa":"Scott, J. A. (2026). Data heterogeneity and personalization in federated learning. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21198","mla":"Scott, Jonathan A. Data Heterogeneity and Personalization in Federated Learning. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21198."},"ddc":["005"],"project":[{"grant_number":"COE12","name":"Bilateral Artificial Intelligence (Lampert)","_id":"d8f03aaa-b035-11f1-8588-d5147fa879e0"}],"status":"public","doi":"10.15479/AT-ISTA-21198","month":"02","related_material":{"record":[{"id":"21207","status":"public","relation":"part_of_dissertation"},{"id":"20819","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"17411","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"18120"}]},"abstract":[{"lang":"eng","text":"In recent years there has been a massive increase in the amount of data generated in a\r\ndecentralized manner. Ever more powerful edge devices, such as smartphones, have become\r\nubiquitous in most societies on earth. Through text typed, photos taken and apps used,\r\nthese devices, which we refer to as clients, generate enormous amounts of high quality and\r\ncomplex data. Moreover, the nature of these devices means the data they generate is often\r\nsensitive and privacy concerns prevent it being gathered and stored in a central location. This\r\npresents a challenge to the modern machine learning paradigm that requires central access\r\nto large amounts of data. Federated learning (FL) has emerged as one of the answers to\r\nthis problem. Rather than bringing the data to the model, FL sends the model to the data.\r\nModel training takes place on device, with periodically synchronized updates, allowing data to\r\nremain locally stored. While this approach offers significant privacy advantages it comes with\r\nits own set of unique challenges. These include: data heterogeneity, the notion that different\r\ndevices generate data in distinct ways which can negatively impact training dynamics; systems\r\nheterogeneity, meaning that different devices may have differing hardware specifications; high\r\ncommunication costs, which are induced by the repeated transferring of models over the\r\nnetwork and low device computational power, which limits the use of larger models on device.\r\nIn this thesis we present a range of methods for federated learning. We focus primarily on\r\nthe challenge of data heterogeneity, though the methods presented are designed to be well\r\nadapted to the other challenges of a federated setting, such as the constraints of limited\r\ncompute and communication overhead. We first present a method for explicitly modeling client\r\ndata heterogeneity. The approach formulates clients as samples from a certain probability\r\ndistribution and infers the parameters of this distribution from the available training clients.\r\nThis learned distribution then represents the heterogeneity present among the clients and can\r\nbe sampled from in order to create new simulated clients that are similar to the real clients we\r\nhave observed so far. Following this we present two methods for directly dealing with data\r\nheterogeneity through personalization. Highly heterogeneous client data distributions can mean\r\nthat learning a single global model becomes suboptimal, and some form of personalization of\r\nmodels to each individual client is required. Our approaches are based around hypernetworks,\r\nwhich we use to generate personalized model parameters without the need for additional\r\ntraining or finetuning. In the first approach we focus on generating full parameterizations of\r\nclient models using learned embeddings of client data and labels, with a hypernetwork located\r\non the central server. In the second approach we address the more challenging scenario where\r\nwe want to generate a personalized model for a client without any label information. The\r\nhypernetwork is trained to generate a low dimensional representation of a client’s personalized\r\nmodel parameters, allowing it to be transferred to and run on the client devices. In our final\r\npresented method, we change our focus and rather than aim to directly address the challenge\r\nof data heterogeneity, we instead ensure we are unaffected by it. This is done in the context\r\nof k-means clustering and we present a method for federated clustering with a focus on added\r\nprivacy guarantees."}],"oa_version":"Published Version","type":"dissertation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-21198","date_updated":"2026-10-01T09:29:03Z","article_processing_charge":"No","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"ChLa"}],"file_date_updated":"2026-02-27T10:25:41Z","_id":"21198","page":"158","date_created":"2026-02-09T14:59:53Z","publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","doi_confirm":"1","file":[{"checksum":"121c1d968bd86f3630aa7e81d5bbbcb0","creator":"jscott","relation":"source_file","access_level":"closed","file_id":"21298","file_size":272379252,"file_name":"2026_Scott_Jonathan_Thesis_Source.zip","date_updated":"2026-02-17T11:46:22Z","date_created":"2026-02-17T11:46:22Z","content_type":"application/zip"},{"file_size":15220298,"content_type":"application/pdf","date_updated":"2026-02-27T10:25:41Z","date_created":"2026-02-27T10:25:41Z","file_name":"2026_Jonathan_Scott_Thesis.pdf","relation":"main_file","creator":"jscott","file_id":"21366","access_level":"open_access","success":1,"checksum":"6e3e08ba474bbee8511cc8a839ab2077"}],"title":"Data heterogeneity and personalization in federated learning","author":[{"full_name":"Scott, Jonathan A","last_name":"Scott","id":"e499926b-f6e0-11ea-865d-9c63db0031e8","first_name":"Jonathan A"}],"degree_awarded":"PhD","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF)\r\n[10.55776/COE12]. Furthermore, the candidate acknowledges the support from the Scientific\r\nService Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","day":"09","acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2026","corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"supervisor":[{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}]},{"article_processing_charge":"No","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-21854","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not endorse any of ISTA's products or services. Internal or personal use of this material is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional purposes or for creating new collective works for resale or redistribution, please go to http://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from RightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","date_updated":"2026-10-01T09:32:47Z","month":"05","abstract":[{"text":"As neural-network-based models grow both in size and popularity, interest has grown in making the models smaller and more efficient to train. To that end, many methods have been proposed to prune models by reducing their number of nonzero parameters. Additionally, parameter-efficient fine-tuning, in which a much smaller number of parameters than the total contained in the model is updated during training, has become very popular, especially in the space of Large Language Models. At the same time, the increasingly routine deployment of machine learning in real-world applications has spurred a drive to make them more trustworthy - in the sense of, among other things, being unbiased, interpretable, and editable. In this thesis, we examine the interplay between efficiency and trustworthiness.\r\n\r\nFirst, we analyze the effects of model pruning on bias in computer vision models, demonstrating that increased sparsity leads to greater bias, largely as a function of increased model uncertainty in marginal cases. Based on this observation, we propose several bias mitigation techniques. Then, we demonstrate that example-specific model pruning can improve model interpretation methods while improving pruning efficiency to make example-specific model pruning feasible in real time. Then, we investigate the effectiveness of parameter-efficient and data-efficient model personalization via fine-tuning, demonstrating that it is highly feasible with very small computational and data resources. Finally, we consider efficiency in editing model knowledge using a custom synthetic data framework, demonstrating that parameter-efficient, low-rank fine-tuning frequently outperforms full-rank fine-tuning, and, additionally, that restricting which model blocks are fine-tuned frequently improves results. Together, the results in this thesis provide new insights and techniques for combining trustworthiness and efficiency during neural network inference and training.\r\n\r\n","lang":"eng"}],"related_material":{"record":[{"id":"14771","status":"public","relation":"part_of_dissertation"},{"id":"21858","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"21859","status":"public"},{"status":"public","id":"21857","relation":"part_of_dissertation"},{"status":"public","id":"18121","relation":"part_of_dissertation"}]},"das_tickbox":"1","oa_version":"Published Version","type":"dissertation","date_published":"2026-05-11T00:00:00Z","ddc":["000"],"citation":{"mla":"Iofinova, Eugenia B. On the Utility and Effects of Efficiency in Artificial Neural Networks. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21854.","apa":"Iofinova, E. B. (2026). On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21854","chicago":"Iofinova, Eugenia B. “On the Utility and Effects of Efficiency in Artificial Neural Networks.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21854.","ama":"Iofinova EB. On the utility and effects of efficiency in artificial neural networks. 2026. doi:10.15479/AT-ISTA-21854","ista":"Iofinova EB. 2026. On the utility and effects of efficiency in artificial neural networks. Institute of Science and Technology Austria.","short":"E.B. Iofinova, On the Utility and Effects of Efficiency in Artificial Neural Networks, Institute of Science and Technology Austria, 2026.","ieee":"E. B. Iofinova, “On the utility and effects of efficiency in artificial neural networks,” Institute of Science and Technology Austria, 2026."},"status":"public","project":[{"_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A","name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35"}],"doi":"10.15479/AT-ISTA-21854","acknowledged_ssus":[{"_id":"ScienComp"}],"year":"2026","corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"oa":1,"degree_awarded":"PhD","acknowledgement":"The research in this Ph.D. was funded in whole\r\nor in part by the Austrian Science Fund (FWF) W1260-N35 (Vienna Graduate School for\r\nComputational Optimization). For open access purposes the author has applied a CC BY\r\npublic copyright license to any author accepted manuscript version arising from this submission\r\nwherever possible. Additionally, I am grateful to Alois Schlögl, Waleed Khalid, and the rest of\r\nthe ISTA Scientific Computing team for building and maintaining the infrastructure I used\r\nto run experiments. I’m also deeply grateful to the Alistarh group’s administrative assistant,\r\nChristine Francois, who always deals with our nonsense with common sense and a smile.\r\n","day":"11","publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","file":[{"file_size":28479571,"content_type":"application/zip","date_updated":"2026-05-11T08:36:01Z","file_name":"EIofinova_thesis_FinalVersion.zip","date_created":"2026-05-11T08:36:01Z","creator":"eiofinov","relation":"source_file","file_id":"21856","access_level":"closed","checksum":"2e148dad920e3f9b7c32796e0ba2e5f7"},{"relation":"main_file","creator":"eiofinov","file_id":"21877","access_level":"open_access","success":1,"checksum":"b10c2933f386f532b2dbf28b19c5525c","file_size":18137757,"content_type":"application/pdf","file_name":"2026_Iofinova_Eugenia_Thesis.pdf","date_created":"2026-05-13T13:10:48Z","date_updated":"2026-05-13T13:10:48Z"}],"doi_confirm":"1","title":"On the utility and effects of efficiency in artificial neural networks","author":[{"full_name":"Iofinova, Eugenia B","last_name":"Iofinova","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","orcid":"0000-0002-7778-3221","first_name":"Eugenia B"}],"file_date_updated":"2026-05-13T13:10:48Z","date_created":"2026-05-11T08:43:22Z","_id":"21854","page":"237"},{"article_type":"letter_note","author":[{"first_name":"Vicente L","full_name":"Diaz Melian, Vicente L","last_name":"Diaz Melian","id":"b6798902-eea0-11ea-9cbc-a8e14286c631"},{"id":"a550210f-223c-11ec-8182-e2d45e817efb","full_name":"Lenton, Isaac C","last_name":"Lenton","first_name":"Isaac C","orcid":"0000-0002-5010-6984"},{"last_name":"Binysh","full_name":"Binysh, Jack","first_name":"Jack"},{"first_name":"Anton","full_name":"Souslov, Anton","last_name":"Souslov"},{"last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","first_name":"Scott R"}],"title":"Geometry of the vapor layer under a Leidenfrost hydrogel sphere","quality_controlled":"1","file":[{"checksum":"902cc8d177c8d3ae9cfe07c30375c9a9","success":1,"relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"22014","file_size":3173197,"file_name":"2026_PhysicalReviewE_DiazMelian.pdf","date_updated":"2026-06-16T11:21:53Z","date_created":"2026-06-16T11:21:53Z","content_type":"application/pdf"}],"scopus_import":"1","publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"publisher":"American Physical Society","file_date_updated":"2026-06-16T11:21:53Z","date_created":"2026-06-10T07:36:41Z","_id":"21982","intvolume":" 113","oa":1,"OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"year":"2026","acknowledgement":"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 and the Scientific Computing Facility. J.B. acknowledges funding from the European Union's Horizon research and innovation programme under the Marie Sklodowska-Curie Grant Agreement No. 101106500.","day":"14","arxiv":1,"PlanS_conform":"1","publication":"Physical Review E","volume":113,"external_id":{"arxiv":["2507.04982"]},"type":"journal_article","oa_version":"Published Version","abstract":[{"lang":"eng","text":"A floating Leidenfrost droplet exhibits curvature inversion of its underside, due to the balance of vapor pressure and surface tension. Using interferometric imaging, we find different behavior for a levitated hydrogel sphere. Curvature inversion is observed briefly just after deposition, but quickly gives way to a steady state with no inversion. We show the essential role of vaporization in shaping the underbelly of the hydrogel, where changes due to direct mass loss are more significant than the balance of vapor pressure and elastic forces."}],"related_material":{"record":[{"id":"23005","status":"public","relation":"dissertation_contains"}]},"month":"05","doi":"10.1103/m7gr-2t6j","OA_type":"hybrid","status":"public","ddc":["530"],"citation":{"ama":"Diaz Melian VL, Lenton IC, Binysh J, Souslov A, Waitukaitis SR. Geometry of the vapor layer under a Leidenfrost hydrogel sphere. Physical Review E. 2026;113(5). doi:10.1103/m7gr-2t6j","chicago":"Diaz Melian, Vicente L, Isaac C Lenton, Jack Binysh, Anton Souslov, and Scott R Waitukaitis. “Geometry of the Vapor Layer under a Leidenfrost Hydrogel Sphere.” Physical Review E. American Physical Society, 2026. https://doi.org/10.1103/m7gr-2t6j.","ista":"Diaz Melian VL, Lenton IC, Binysh J, Souslov A, Waitukaitis SR. 2026. Geometry of the vapor layer under a Leidenfrost hydrogel sphere. Physical Review E. 113(5), L053502.","short":"V.L. Diaz Melian, I.C. Lenton, J. Binysh, A. Souslov, S.R. Waitukaitis, Physical Review E 113 (2026).","ieee":"V. L. Diaz Melian, I. C. Lenton, J. Binysh, A. Souslov, and S. R. Waitukaitis, “Geometry of the vapor layer under a Leidenfrost hydrogel sphere,” Physical Review E, vol. 113, no. 5. American Physical Society, 2026.","apa":"Diaz Melian, V. L., Lenton, I. C., Binysh, J., Souslov, A., & Waitukaitis, S. R. (2026). Geometry of the vapor layer under a Leidenfrost hydrogel sphere. Physical Review E. American Physical Society. https://doi.org/10.1103/m7gr-2t6j","mla":"Diaz Melian, Vicente L., et al. “Geometry of the Vapor Layer under a Leidenfrost Hydrogel Sphere.” Physical Review E, vol. 113, no. 5, L053502, American Physical Society, 2026, doi:10.1103/m7gr-2t6j."},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_published":"2026-05-14T00:00:00Z","department":[{"_id":"ScWa"},{"_id":"GradSch"}],"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","article_number":"L053502","issue":"5","publication_status":"published","fulldoi":"https://doi.org/10.1103/m7gr-2t6j","date_updated":"2026-10-02T08:44:47Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa":1,"supervisor":[{"first_name":"Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","full_name":"Waitukaitis, Scott R","last_name":"Waitukaitis"}],"OA_place":"publisher","corr_author":"1","language":[{"iso":"eng"}],"year":"2026","acknowledged_ssus":[{"_id":"M-Shop"}],"degree_awarded":"PhD","day":"29","author":[{"first_name":"Vicente L","full_name":"Diaz Melian, Vicente L","id":"b6798902-eea0-11ea-9cbc-a8e14286c631","last_name":"Diaz Melian"}],"title":"The morphology underneath a levitated hydrogel sphere","file":[{"access_level":"open_access","file_id":"23007","relation":"main_file","creator":"vdiazmel","checksum":"f339bdee0a6925573687de928ca525dc","date_created":"2026-09-29T09:22:27Z","date_updated":"2026-09-29T09:56:46Z","file_name":"2026_diaz-melian_vicente_Thesis.pdf","content_type":"application/pdf","file_size":8463804},{"access_level":"closed","file_id":"23008","creator":"vdiazmel","relation":"source_file","checksum":"5b17122895fc419bfb620e23bfe7780a","file_name":"2026_diaz-melian_vicente_Thesis.zip","date_updated":"2026-09-29T09:56:46Z","date_created":"2026-09-29T09:49:32Z","content_type":"application/zip","file_size":4028974886}],"doi_confirm":"1","publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","supplementarymaterial":"yes","file_date_updated":"2026-09-29T09:56:46Z","date_created":"2026-09-28T17:40:23Z","_id":"23005","page":"114","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"ScWa"}],"article_processing_charge":"No","has_accepted_license":"1","publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-23005","date_updated":"2026-10-02T08:44:47Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","researchdata_availability":"yes","type":"dissertation","oa_version":"Published Version","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"14514"},{"status":"public","id":"21982","relation":"part_of_dissertation"}]},"abstract":[{"lang":"eng","text":"When a Leidenfrost droplet floats on its own vapor layer, the interplay between vapor pressure, surface tension, and gravity determines its shape, and in the stable regime the underside of the droplet exhibits curvature inversion. Using interferometric imaging, we observe a different behavior for a levitated hydrogel sphere. Curvature inversion appears briefly after deposition, but the continuous vaporization process removes this feature, leading first to an oscillatory regime and eventually to a steady state without curvature inversion. We demonstrate the essential role of vaporization in shaping the hydrogel underbelly, where direct mass loss has a stronger influence than the balance between vapor pressure and elastic forces."}],"month":"09","doi":"10.15479/AT-ISTA-23005","status":"public","citation":{"ama":"Diaz Melian VL. The morphology underneath a levitated hydrogel sphere. 2026. doi:10.15479/AT-ISTA-23005","chicago":"Diaz Melian, Vicente L. “The Morphology underneath a Levitated Hydrogel Sphere.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-23005.","ista":"Diaz Melian VL. 2026. The morphology underneath a levitated hydrogel sphere. Institute of Science and Technology Austria.","short":"V.L. Diaz Melian, The Morphology underneath a Levitated Hydrogel Sphere, Institute of Science and Technology Austria, 2026.","ieee":"V. L. Diaz Melian, “The morphology underneath a levitated hydrogel sphere,” Institute of Science and Technology Austria, 2026.","mla":"Diaz Melian, Vicente L. The Morphology underneath a Levitated Hydrogel Sphere. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-23005.","apa":"Diaz Melian, V. L. (2026). The morphology underneath a levitated hydrogel sphere. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-23005"},"ddc":["530","530","530"],"date_published":"2026-09-29T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"}},{"has_accepted_license":"1","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"CaGu"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","fulldoi":"https://doi.org/10.15479/AT-ISTA-22981","date_updated":"2026-10-02T10:52:13Z","publication_status":"published","month":"09","oa_version":"Published Version","type":"dissertation","date_published":"2026-09-24T00:00:00Z","citation":{"mla":"Gruber, Nathalie. Genetic Strategies Enabling Bacterial Adaptation to Selective Pressures. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22981.","apa":"Gruber, N. (2026). Genetic strategies enabling bacterial adaptation to selective pressures. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22981","chicago":"Gruber, Nathalie. “Genetic Strategies Enabling Bacterial Adaptation to Selective Pressures.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22981.","ista":"Gruber N. 2026. Genetic strategies enabling bacterial adaptation to selective pressures. Institute of Science and Technology Austria.","ama":"Gruber N. Genetic strategies enabling bacterial adaptation to selective pressures. 2026. doi:10.15479/AT-ISTA-22981","short":"N. Gruber, Genetic Strategies Enabling Bacterial Adaptation to Selective Pressures, Institute of Science and Technology Austria, 2026.","ieee":"N. Gruber, “Genetic strategies enabling bacterial adaptation to selective pressures,” Institute of Science and Technology Austria, 2026."},"ddc":["570","576","579"],"status":"public","project":[{"name":"Uncovering the organisational principle of bacterial genomic islands in Anti-phage defense","grant_number":"26422","_id":"34cb8730-11ca-11ed-8bc3-8b3b3752a6f6"}],"doi":"10.15479/AT-ISTA-22981","year":"2026","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"language":[{"iso":"eng"}],"OA_place":"publisher","corr_author":"1","supervisor":[{"id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C","last_name":"Guet","first_name":"Calin C","orcid":"0000-0001-6220-2052"}],"day":"24","degree_awarded":"PhD","acknowledgement":"I want to acknowledge the Austrian Academy of Sciences for funding through the DOC \r\nFellowship program (fellowship number 26422) and for the honest and inspirational talk by \r\nAnton Zeilinger at the award ceremony about the PhD journey. ","publisher":"Institute of Science and Technology Austria","publication_identifier":{"issn":["2663-337X"]},"file":[{"file_size":48619027,"embargo_to":"open_access","content_type":"application/pdf","date_created":"2026-10-01T09:00:53Z","date_updated":"2026-10-01T12:34:18Z","file_name":"2026_Gruber_Nathalie_Thesis.pdf","embargo":"2027-10-01","creator":"ngruber","relation":"main_file","file_id":"23020","access_level":"closed","checksum":"64a61a8812cefaaeffc247a409d46a23"},{"creator":"ngruber","relation":"source_file","access_level":"closed","file_id":"23021","checksum":"942f6291750664d6d1adfb4f8b5a1735","file_size":55175414,"file_name":"2026_Gruber_Nathalie_Thesis.docx","date_updated":"2026-10-01T11:49:41Z","date_created":"2026-10-01T09:31:20Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"doi_confirm":"1","title":"Genetic strategies enabling bacterial adaptation to selective pressures","author":[{"first_name":"Nathalie","id":"2C9C8316-AA17-11E9-B5C2-8BC2E5697425","full_name":"Gruber, Nathalie","last_name":"Gruber"}],"date_created":"2026-09-23T12:25:43Z","_id":"22981","page":"102","file_date_updated":"2026-10-01T12:34:18Z"},{"PlanS_conform":"1","acknowledgement":"The authors are grateful to Boris Khesin for valuable comments on the MW symplectic structure and S. Ishida thanks Albert Chern for insightful discussions on space curves and Chris Wojtan for his continuous support. M. Bauer was partially supported by NSF grant DMS-1953244 and by the Binational Science Foundation (BSF). S. Ishida was partially supported by ERC Consolidator Grant 101045083 “CoDiNA” funded by the European Research Council. Some figures were generated by the software Houdini and its education license was provided by SideFX. Open access funding provided by University of Vienna.","arxiv":1,"day":"15","publication":"Journal of Nonlinear Science","volume":36,"oa":1,"intvolume":" 36","year":"2026","OA_place":"publisher","language":[{"iso":"eng"}],"file_date_updated":"2026-04-28T09:55:32Z","date_created":"2026-04-16T07:29:17Z","_id":"21743","title":"Symplectic structures on the space of space curves","quality_controlled":"1","article_type":"original","author":[{"last_name":"Bauer","full_name":"Bauer, Martin","first_name":"Martin"},{"first_name":"Sadashige","orcid":"0000-0002-3121-3100","last_name":"Ishida","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","full_name":"Ishida, Sadashige"},{"first_name":"Peter W.","full_name":"Michor, Peter W.","last_name":"Michor"}],"publication_identifier":{"eissn":["1432-1467"],"issn":["0938-8974"]},"publisher":"Springer Nature","file":[{"date_created":"2026-04-28T09:55:32Z","date_updated":"2026-04-28T09:55:32Z","file_name":"2026_JourNonlinearScience_Bauer.pdf","content_type":"application/pdf","file_size":1108518,"access_level":"open_access","file_id":"21770","relation":"main_file","creator":"dernst","checksum":"760de2631b6fd7d57bcd5115ed36c0a2","success":1}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","issue":"2","fulldoi":"https://doi.org/10.1007/s00332-026-10266-8","date_updated":"2026-10-02T11:16:45Z","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"article_number":"45","status":"public","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"doi":"10.1007/s00332-026-10266-8","OA_type":"hybrid","date_published":"2026-04-15T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png"},"ddc":["510"],"citation":{"ieee":"M. Bauer, S. Ishida, and P. W. Michor, “Symplectic structures on the space of space curves,” Journal of Nonlinear Science, vol. 36, no. 2. Springer Nature, 2026.","short":"M. Bauer, S. Ishida, P.W. Michor, Journal of Nonlinear Science 36 (2026).","chicago":"Bauer, Martin, Sadashige Ishida, and Peter W. Michor. “Symplectic Structures on the Space of Space Curves.” Journal of Nonlinear Science. Springer Nature, 2026. https://doi.org/10.1007/s00332-026-10266-8.","ista":"Bauer M, Ishida S, Michor PW. 2026. Symplectic structures on the space of space curves. Journal of Nonlinear Science. 36(2), 45.","ama":"Bauer M, Ishida S, Michor PW. Symplectic structures on the space of space curves. Journal of Nonlinear Science. 2026;36(2). doi:10.1007/s00332-026-10266-8","mla":"Bauer, Martin, et al. “Symplectic Structures on the Space of Space Curves.” Journal of Nonlinear Science, vol. 36, no. 2, 45, Springer Nature, 2026, doi:10.1007/s00332-026-10266-8.","apa":"Bauer, M., Ishida, S., & Michor, P. W. (2026). Symplectic structures on the space of space curves. Journal of Nonlinear Science. Springer Nature. https://doi.org/10.1007/s00332-026-10266-8"},"oa_version":"Published Version","external_id":{"arxiv":["2407.19908"]},"type":"journal_article","month":"04","abstract":[{"text":"We present symplectic structures on the shape space of unparameterized space curves that generalize the classical Marsden–Weinstein structure. Our method integrates the Liouville 1-form of the Marsden–Weinstein structure with Riemannian structures that have been introduced in mathematical shape analysis. We also derive Hamiltonian vector fields for several classical Hamiltonian functions with respect to these new symplectic structures.","lang":"eng"}],"related_material":{"record":[{"relation":"earlier_version","status":"public","id":"17361"}]}}]