[{"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2026-01-27T12:43:25Z","corr_author":"1","OA_place":"publisher","supplementarymaterial":"no","ddc":["000"],"type":"conference","OA_type":"gold","status":"public","arxiv":1,"publication_status":"published","title":"Unifying causal representation learning with the invariance principle","file":[{"relation":"main_file","date_updated":"2026-01-27T12:43:25Z","success":1,"date_created":"2026-01-27T12:43:25Z","content_type":"application/pdf","file_name":"4356_Unifying_Causal_Represent (1).pdf","access_level":"open_access","file_id":"21048","file_size":877014,"creator":"flocatel","checksum":"c4b5a4a644228c6d1b0283e1368bce9e"}],"acknowledgement":"We thank Jiaqi Zhang, Francesco Montagna, David Lopez-Paz, Kartik Ahuja, Thomas Kipf, Sara\r\nMagliacane, Julius von Kügelgen, Kun Zhang, and Bernhard Schölkopf for extremely helpful discussion. Riccardo Cadei was supported by a Google Research Scholar Award to Francesco Locatello. We acknowledge the Third Bellairs Workshop on Causal Representation Learning held at the Bellairs Research Institute, February 9/16, 2024, and a debate on the difference between interventions and counterfactuals in disentanglement and CRL that took place during Dhanya Sridhar’s lecture, which motivated us to significantly broaden the scope of the paper. We thank Dhanya and all participants of the workshop.","department":[{"_id":"FrLo"}],"_id":"19010","publisher":"ICLR","oa_version":"Published Version","month":"01","external_id":{"arxiv":["2409.02772"]},"conference":{"location":"Singapore","start_date":"2025-04-24","end_date":"2025-04-28","name":"ICLR: International Conference on Learning Representations"},"researchdata_availability":"no","quality_controlled":"1","citation":{"ama":"Yao D, Rancati D, Cadei R, Fumero M, Locatello F. Unifying causal representation learning with the invariance principle. In: <i>13th International Conference on Learning Representations</i>. ICLR; 2025.","ista":"Yao D, Rancati D, Cadei R, Fumero M, Locatello F. 2025. Unifying causal representation learning with the invariance principle. 13th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","apa":"Yao, D., Rancati, D., Cadei, R., Fumero, M., &#38; Locatello, F. (2025). Unifying causal representation learning with the invariance principle. In <i>13th International Conference on Learning Representations</i>. Singapore: ICLR.","chicago":"Yao, Dingling, Dario Rancati, Riccardo Cadei, Marco Fumero, and Francesco Locatello. “Unifying Causal Representation Learning with the Invariance Principle.” In <i>13th International Conference on Learning Representations</i>. ICLR, 2025.","mla":"Yao, Dingling, et al. “Unifying Causal Representation Learning with the Invariance Principle.” <i>13th International Conference on Learning Representations</i>, ICLR, 2025.","ieee":"D. Yao, D. Rancati, R. Cadei, M. Fumero, and F. Locatello, “Unifying causal representation learning with the invariance principle,” in <i>13th International Conference on Learning Representations</i>, Singapore, 2025.","short":"D. Yao, D. Rancati, R. Cadei, M. Fumero, F. Locatello, in:, 13th International Conference on Learning Representations, ICLR, 2025."},"year":"2025","date_created":"2025-02-05T09:23:25Z","publication":"13th International Conference on Learning Representations","author":[{"last_name":"Yao","id":"d3e02e50-48a8-11ee-8f62-c108061797fa","first_name":"Dingling","full_name":"Yao, Dingling"},{"id":"feb58f2e-72ef-11ef-b75a-8f0894539cd0","first_name":"Dario","last_name":"Rancati","full_name":"Rancati, Dario"},{"full_name":"Cadei, Riccardo","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","first_name":"Riccardo","last_name":"Cadei"},{"last_name":"Fumero","first_name":"Marco","id":"1c1593eb-393f-11ef-bb8e-ab4f1e979650","full_name":"Fumero, Marco"},{"last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"}],"date_updated":"2026-10-02T08:49:53Z","das_tickbox":"0","abstract":[{"text":"Causal representation learning aims at recovering latent causal variables from high-dimensional observations to solve causal downstream tasks, such as predicting the effect of new interventions or more robust classification. A plethora of methods have been developed, each tackling carefully crafted problem settings that lead to different types of identifiability. The folklore is that these different settings are important, as they are often linked to different rungs of Pearl's causal hierarchy, although not all neatly fit. Our main contribution is to show that many existing causal representation learning approaches methodologically align the representation to known data symmetries. Identification of the variables is guided by equivalence classes across different \"data pockets\" that are not necessarily causal. This result suggests important implications, allowing us to unify many existing approaches in a single method that can mix and match different assumptions, including non-causal ones, based on the invariances relevant to our application. It also significantly benefits applicability, which we demonstrate by improving treatment effect estimation on real-world high-dimensional ecological data. Overall, this paper clarifies the role of causality assumptions in the discovery of causal variables and shifts the focus to preserving data symmetries.","lang":"eng"}],"scopus_import":"1","date_published":"2025-01-22T00:00:00Z","day":"22"},{"ec_funded":1,"ddc":["570"],"type":"journal_article","OA_type":"hybrid","status":"public","isi":1,"fulldoi":"https://doi.org/10.1038/s41586-025-08985-1","publication_status":"published","file":[{"file_size":133201290,"file_id":"19959","creator":"dernst","checksum":"ebc99d7108e728f46db0a009292675ef","success":1,"relation":"main_file","date_updated":"2025-07-03T06:55:20Z","content_type":"application/pdf","date_created":"2025-07-03T06:55:20Z","access_level":"open_access","file_name":"2025_Nature_Tavakoli.pdf"}],"project":[{"name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5","grant_number":"26137"},{"call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program"},{"name":"Toward an understanding of the brain interstitial system and the extracellular proteome in health and autism spectrum disorders","grant_number":"101044865","_id":"34ba8964-11ca-11ed-8bc3-e15864e7e9a6"},{"call_identifier":"FWF","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets"}],"title":"Light-microscopy-based connectomic reconstruction of mammalian brain tissue","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"398-410","related_material":{"link":[{"description":"News on ISTA website","relation":"press_release","url":"https://ista.ac.at/en/news/piecing-together-the-brain-puzzle/"}],"record":[{"relation":"research_data","status":"public","id":"18697"},{"relation":"earlier_version","id":"18677","status":"public"}]},"oa":1,"has_accepted_license":"1","file_date_updated":"2025-07-03T06:55:20Z","article_processing_charge":"Yes (via OA deal)","corr_author":"1","OA_place":"publisher","PlanS_conform":"1","citation":{"ama":"Tavakoli M, Lyudchik J, Januszewski M, et al. Light-microscopy-based connectomic reconstruction of mammalian brain tissue. <i>Nature</i>. 2025;642:398-410. doi:<a href=\"https://doi.org/10.1038/s41586-025-08985-1\">10.1038/s41586-025-08985-1</a>","ista":"Tavakoli M, Lyudchik J, Januszewski M, Vistunou V, Agudelo Duenas N, Vorlaufer J, Sommer CM, Kreuzinger C, Oliveira B, Cenameri A, Novarino G, Jain V, Danzl JG. 2025. Light-microscopy-based connectomic reconstruction of mammalian brain tissue. Nature. 642, 398–410.","apa":"Tavakoli, M., Lyudchik, J., Januszewski, M., Vistunou, V., Agudelo Duenas, N., Vorlaufer, J., … Danzl, J. G. (2025). Light-microscopy-based connectomic reconstruction of mammalian brain tissue. <i>Nature</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41586-025-08985-1\">https://doi.org/10.1038/s41586-025-08985-1</a>","chicago":"Tavakoli, Mojtaba, Julia Lyudchik, Michał Januszewski, Vitali Vistunou, Nathalie Agudelo Duenas, Jakob Vorlaufer, Christoph M Sommer, et al. “Light-Microscopy-Based Connectomic Reconstruction of Mammalian Brain Tissue.” <i>Nature</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41586-025-08985-1\">https://doi.org/10.1038/s41586-025-08985-1</a>.","ieee":"M. Tavakoli <i>et al.</i>, “Light-microscopy-based connectomic reconstruction of mammalian brain tissue,” <i>Nature</i>, vol. 642. Springer Nature, pp. 398–410, 2025.","short":"M. Tavakoli, J. Lyudchik, M. Januszewski, V. Vistunou, N. Agudelo Duenas, J. Vorlaufer, C.M. Sommer, C. Kreuzinger, B. Oliveira, A. Cenameri, G. Novarino, V. Jain, J.G. Danzl, Nature 642 (2025) 398–410.","mla":"Tavakoli, Mojtaba, et al. “Light-Microscopy-Based Connectomic Reconstruction of Mammalian Brain Tissue.” <i>Nature</i>, vol. 642, Springer Nature, 2025, pp. 398–410, doi:<a href=\"https://doi.org/10.1038/s41586-025-08985-1\">10.1038/s41586-025-08985-1</a>."},"year":"2025","date_created":"2025-05-18T22:02:51Z","publication":"Nature","author":[{"first_name":"Mojtaba","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","last_name":"Tavakoli","full_name":"Tavakoli, Mojtaba","orcid":"0000-0002-7667-6854"},{"full_name":"Lyudchik, Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","first_name":"Julia","last_name":"Lyudchik"},{"full_name":"Januszewski, Michał","first_name":"Michał","last_name":"Januszewski"},{"id":"7e146587-8972-11ed-ae7b-d7a32ea86a81","first_name":"Vitali","last_name":"Vistunou","full_name":"Vistunou, Vitali"},{"last_name":"Agudelo Duenas","id":"40E7F008-F248-11E8-B48F-1D18A9856A87","first_name":"Nathalie","full_name":"Agudelo Duenas, Nathalie"},{"last_name":"Vorlaufer","id":"937696FA-C996-11E9-8C7C-CF13E6697425","first_name":"Jakob","orcid":"0009-0000-7590-3501","full_name":"Vorlaufer, Jakob"},{"last_name":"Sommer","first_name":"Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105","full_name":"Sommer, Christoph M"},{"full_name":"Kreuzinger, Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Kreuzinger"},{"first_name":"Bárbara","id":"3B03AA1A-F248-11E8-B48F-1D18A9856A87","last_name":"Oliveira","full_name":"Oliveira, Bárbara"},{"last_name":"Cenameri","first_name":"Alban","id":"9ac8f577-2357-11eb-997a-e566c5550886","full_name":"Cenameri, Alban"},{"last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","first_name":"Gaia","orcid":"0000-0002-7673-7178","full_name":"Novarino, Gaia"},{"last_name":"Jain","first_name":"Viren","full_name":"Jain, Viren"},{"last_name":"Danzl","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G"}],"date_updated":"2026-10-02T09:59:44Z","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"ScienComp"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"E-Lib"}],"abstract":[{"lang":"eng","text":"The information-processing capability of the brain’s cellular network depends on the physical wiring pattern between neurons and their molecular and functional characteristics. Mapping neurons and resolving their individual synaptic connections can be achieved by volumetric imaging at nanoscale resolution1,2 with dense cellular labelling. Light microscopy is uniquely positioned to visualize specific molecules, but dense, synapse-level circuit reconstruction by light microscopy has been out of reach, owing to limitations in resolution, contrast and volumetric imaging capability. Here we describe light-microscopy-based connectomics (LICONN). We integrated specifically engineered hydrogel embedding and expansion with comprehensive deep-learning-based segmentation and analysis of connectivity, thereby directly incorporating molecular information into synapse-level reconstructions of brain tissue. LICONN will allow synapse-level phenotyping of brain tissue in biological experiments in a readily adoptable manner."}],"scopus_import":"1","date_published":"2025-06-12T00:00:00Z","day":"12","doi":"10.1038/s41586-025-08985-1","acknowledgement":"We thank S. Dorkenwald and P. Li for critical reading of the manuscript, S. Loomba for discussions and E. Miguel for support with data handling. We acknowledge support from ISTA’s scientific service units: Imaging and Optics, Lab Support, Scientific Computing, the preclinical facility, the Miba Machine Shop and the library. We acknowledge funding from the following sources: Austrian Science Fund (FWF) grant DK W1232 (J.G.D. and M.R.T.); Austrian Academy of Sciences DOC fellowship 26137 (M.R.T.); Gesellschaft für Forschungsförderung NÖ (NFB) grant LSC18-022 (J.G.D.); the European Union’s Horizon 2020 research and innovation programme and Marie Skłodowska-Curie Actions Fellowship 665385 (J.L.); and the European Union’s Horizon 2020 research and innovation programme and European Research Council (ERC) grant 101044865 ‘SecretAutism’ (G.N.).Open access funding provided by Institute of Science and Technology (IST Austria).","department":[{"_id":"JoDa"},{"_id":"GradSch"},{"_id":"Bio"},{"_id":"GaNo"}],"_id":"19704","publisher":"Springer Nature","oa_version":"Published Version","month":"06","external_id":{"isi":["001483477000001"],"pmid":["40335689"]},"intvolume":"       642","article_type":"original","publication_identifier":{"issn":["0028-0836"],"eissn":["1476-4687"]},"volume":642,"quality_controlled":"1","pmid":1},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"95","language":[{"iso":"eng"}],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2025-12-16T21:52:19Z","oa":1,"related_material":{"record":[{"relation":"part_of_dissertation","id":"9905","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18307"}]},"OA_place":"publisher","corr_author":"1","type":"dissertation","ddc":["616","576","614","519"],"degree_awarded":"PhD","status":"public","fulldoi":"https://doi.org/10.15479/AT-ISTA-20811","doi_confirm":"1","file":[{"success":1,"date_updated":"2025-12-16T21:49:52Z","relation":"main_file","date_created":"2025-12-16T21:49:52Z","content_type":"application/pdf","access_level":"open_access","file_name":"2025_Rella_Simon_Thesis.pdf","file_size":29019662,"file_id":"20831","creator":"srella","checksum":"a0bd7a585720e60df284101b8afdf6bb"},{"checksum":"b8b3a90932ae1d96d307838710f46e32","creator":"srella","file_id":"20832","file_size":42094025,"access_level":"open_access","file_name":"2025_Rella_Simon_Thesis_Sourcefiles.zip","content_type":"application/zip","date_created":"2025-12-16T21:52:19Z","relation":"source_file","date_updated":"2025-12-16T21:52:19Z"}],"title":"Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation","publication_status":"published","_id":"20811","department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"FyKo"}],"alternative_title":["ISTA Thesis"],"oa_version":"Published Version","month":"12","publisher":"Institute of Science and Technology Austria","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"last_name":"Tkačik","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper"},{"last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","first_name":"Fyodor","orcid":"0000-0001-8243-4694","full_name":"Kondrashov, Fyodor"}],"date_created":"2025-12-12T14:39:56Z","year":"2025","citation":{"ieee":"S. Rella, “Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation,” Institute of Science and Technology Austria, 2025.","short":"S. Rella, Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation, Institute of Science and Technology Austria, 2025.","mla":"Rella, Simon. <i>Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20811\">10.15479/AT-ISTA-20811</a>.","chicago":"Rella, Simon. “Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20811\">https://doi.org/10.15479/AT-ISTA-20811</a>.","apa":"Rella, S. (2025). <i>Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20811\">https://doi.org/10.15479/AT-ISTA-20811</a>","ama":"Rella S. Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20811\">10.15479/AT-ISTA-20811</a>","ista":"Rella S. 2025. Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation. Institute of Science and Technology Austria."},"date_updated":"2026-10-02T10:12:19Z","author":[{"last_name":"Rella","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425","first_name":"Simon","full_name":"Rella, Simon"}],"doi":"10.15479/AT-ISTA-20811","date_published":"2025-12-15T00:00:00Z","day":"15","abstract":[{"lang":"eng","text":"\tThis thesis is organized into two parts, each comprising two chapters: Chapter 1 and 2 offer models for the evolution of vaccine resistance in response to diverse vaccination strategies. Chapter 3 and 4 review the statistics of records, their connection to models of innovation and an application to the cultural evolution of sports.\r\n\tIn chapter 1 we present a modelling study from 2021 on the evolution of SARS-CoV-2. At that time the vaccine-resistant Omicron variant had not yet evolved. In our model we consider a population that is becoming vaccinated over time, while a pathogen is spreading in the population and eventually becoming resistant to the vaccine. We explore effective pharmaceutical and non-pharmaceutical interventions to prevent the emergence of vaccine resistance. \r\n\tIn chapter 2 we model a particular set of complex vaccination strategies, mosaic and pyramid vaccination, where an immunologically diverse portfolio of vaccines is considered. We find that a bet-hatching strategy, in which vaccine types are distributed in the population, is effective at hindering the evolution of vaccine resistance if mutation rates are high. \r\n\tIn chapter 3 we switch gears and present a review on the statistics of records. We highlight similarities and analogies to other models in the fields of statistical physics, evolution and innovation. This offers interesting complimentary perspectives on well-known models. \r\n\tIn chapter 4 we apply models of record statistics and innovation to study cultural evolution in sport. We propose a model of sport evolution that combines deterministic improvements in performance and stochastic bursts of improvements due to innovation. "}]},{"corr_author":"1","OA_place":"publisher","related_material":{"record":[{"relation":"research_data","id":"18886","status":"public"},{"relation":"earlier_version","status":"public","id":"18144"}]},"oa":1,"article_processing_charge":"Yes","has_accepted_license":"1","file_date_updated":"2025-03-17T10:53:32Z","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","title":"Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors","file":[{"relation":"main_file","success":1,"date_updated":"2025-03-17T10:53:32Z","file_name":"2025_NatureComm_Janik.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2025-03-17T10:53:32Z","file_id":"19415","file_size":6364878,"checksum":"a9383dd978ca2c50b7dded6c0bb2cd49","creator":"dernst"}],"project":[{"name":"Integrated Germanium Quantum Technology","_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452","grant_number":"101069515"},{"call_identifier":"FWF","name":"Towards scalable hut wire quantum devices","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","grant_number":"P32235"},{"name":"High impedance circuit quantum electrodynamics with hole spins","grant_number":"I05060","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1"},{"_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge"},{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413"},{"name":"FWF Open Access Fund","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","call_identifier":"FWF"}],"isi":1,"arxiv":1,"fulldoi":"https://doi.org/10.1038/s41467-025-57252-4","status":"public","ec_funded":1,"ddc":["530"],"type":"journal_article","APC_amount":"7068 EUR","OA_type":"gold","quality_controlled":"1","article_number":"2103","pmid":1,"intvolume":"        16","publication_identifier":{"eissn":["2041-1723"]},"article_type":"original","volume":16,"publisher":"Springer Nature","month":"03","oa_version":"Published Version","external_id":{"pmid":["40025007"],"isi":["001434774800001"],"arxiv":["2407.03079"]},"acknowledgement":"We acknowledge Franco De Palma, Mahya Khorramshahi, Fabian Oppliger, Thomas Reisinger, Pasquale Scarlino and Xiao Xue for helpful discussions. We thank Simon Robson for proofreading the manuscript. This research was supported by the Scientific Service Units of ISTA through resources provided by the MIBA Machine Shop and the Nanofabrication facility. This research and related results were made possible with the support of the NOMIS Foundation and the HORIZON-RIA 101069515 project. This research was funded in whole or in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/P32235, https://doi.org/10.55776/I5060 and https://doi.org/10.55776/P36507. For Open Access purposes, the author has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission. M.J. acknowledges funding from FellowQUTE 2024-01. K.R. acknowledges funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 101034413. I.M.P. acknowledges funding from the Deutsche Forschungsgemeinschaft (DFG - German Research Foundation) under project number 450396347 (GeHoldeQED). ICN2 acknowledges funding from Generalitat de Catalunya 2021SGR00457. We acknowledge support from CSIC Interdisciplinary Thematic Platform (PTI+) on Quantum Technologies (PTI-QTEP+). This research work has been funded by the European Commission - NextGenerationEU (Regulation EU 2020/2094), through CSIC’s Quantum Technologies Platform (QTEP). ICN2 is supported by the Severo Ochoa programme from Spanish MCIN/AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD programme. AGM has received funding from Grant RYC2021-033479-I funded by MCIN/AEI/10.13039/501100011033 and by European Union NextGenerationEU/PRTR. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. The authors acknowledge the use of instrumentation and the technical advice provided by the Joint Electron Microscopy Centre at ALBA (JEMCA). ICN2 acknowledges funding from Grant IU16-014206 (METCAM-FIB) funded by the European Union through the European Regional Development Fund (ERDF), with the support of the Ministry of Research and Universities, Generalitat de Catalunya. ICN2 is a founding member of e-DREAM60.","department":[{"_id":"GeKa"},{"_id":"JoFi"},{"_id":"M-Shop"}],"_id":"19401","scopus_import":"1","abstract":[{"lang":"eng","text":"High kinetic inductance superconductors are gaining increasing interest for the realisation of qubits, amplifiers and detectors. Moreover, thanks to their high impedance, quantum buses made of such materials enable large zero-point fluctuations of the voltage, boosting the coupling rates to spin and charge qubits. However, fully exploiting the potential of disordered or granular superconductors is challenging, as their inductance and, therefore, impedance at high values are difficult to control. Here, we report a reproducible fabrication of granular aluminium resonators by developing a wireless ohmmeter, which allows in situ measurements during film deposition and, therefore, control of the kinetic inductance of granular aluminium films. Reproducible fabrication of circuits with impedances (inductances) exceeding 13 kΩ (1 nH per square) is now possible. By integrating a 7.9 kΩ resonator with a germanium double quantum dot, we demonstrate strong charge-photon coupling with a rate of gc/2π = 566 ± 2 MHz. This broadly applicable method opens the path for novel qubits and high-fidelity, long-distance two-qubit gates."}],"date_published":"2025-03-01T00:00:00Z","day":"01","DOAJ_listed":"1","doi":"10.1038/s41467-025-57252-4","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"author":[{"last_name":"Janik","first_name":"Marian","id":"396A1950-F248-11E8-B48F-1D18A9856A87","orcid":"0009-0003-9037-8831","full_name":"Janik, Marian"},{"full_name":"Roux, Kevin Etienne Robert","id":"53f93ea2-803f-11ed-ab7e-b283135794ef","first_name":"Kevin Etienne Robert","last_name":"Roux"},{"full_name":"Borja Espinosa, Carla N","id":"18777c01-896a-11ed-bdf8-e4851dc07d16","first_name":"Carla N","last_name":"Borja Espinosa"},{"full_name":"Sagi, Oliver","first_name":"Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","last_name":"Sagi"},{"full_name":"Baghdadi, Abdulhamid","last_name":"Baghdadi","id":"160D87FA-96B5-11E9-BF77-7626E6697425","first_name":"Abdulhamid"},{"full_name":"Adletzberger, Thomas","last_name":"Adletzberger","first_name":"Thomas","id":"38756BB2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Stefano","last_name":"Calcaterra","full_name":"Calcaterra, Stefano"},{"last_name":"Botifoll","first_name":"Marc","full_name":"Botifoll, Marc"},{"full_name":"Garzón Manjón, Alba","last_name":"Garzón Manjón","first_name":"Alba"},{"full_name":"Arbiol, Jordi","last_name":"Arbiol","first_name":"Jordi"},{"full_name":"Chrastina, Daniel","last_name":"Chrastina","first_name":"Daniel"},{"first_name":"Giovanni","last_name":"Isella","full_name":"Isella, Giovanni"},{"full_name":"Pop, Ioan M.","last_name":"Pop","first_name":"Ioan M."},{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"date_updated":"2026-10-02T11:05:09Z","citation":{"ieee":"M. Janik <i>et al.</i>, “Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors,” <i>Nature Communications</i>, vol. 16. Springer Nature, 2025.","short":"M. Janik, K.E.R. Roux, C.N. Borja Espinosa, O. Sagi, A. Baghdadi, T. Adletzberger, S. Calcaterra, M. Botifoll, A. Garzón Manjón, J. Arbiol, D. Chrastina, G. Isella, I.M. Pop, G. Katsaros, Nature Communications 16 (2025).","mla":"Janik, Marian, et al. “Strong Charge-Photon Coupling in Planar Germanium Enabled by Granular Aluminium Superinductors.” <i>Nature Communications</i>, vol. 16, 2103, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41467-025-57252-4\">10.1038/s41467-025-57252-4</a>.","chicago":"Janik, Marian, Kevin Etienne Robert Roux, Carla N Borja Espinosa, Oliver Sagi, Abdulhamid Baghdadi, Thomas Adletzberger, Stefano Calcaterra, et al. “Strong Charge-Photon Coupling in Planar Germanium Enabled by Granular Aluminium Superinductors.” <i>Nature Communications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41467-025-57252-4\">https://doi.org/10.1038/s41467-025-57252-4</a>.","apa":"Janik, M., Roux, K. E. R., Borja Espinosa, C. N., Sagi, O., Baghdadi, A., Adletzberger, T., … Katsaros, G. (2025). Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-025-57252-4\">https://doi.org/10.1038/s41467-025-57252-4</a>","ama":"Janik M, Roux KER, Borja Espinosa CN, et al. Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors. <i>Nature Communications</i>. 2025;16. doi:<a href=\"https://doi.org/10.1038/s41467-025-57252-4\">10.1038/s41467-025-57252-4</a>","ista":"Janik M, Roux KER, Borja Espinosa CN, Sagi O, Baghdadi A, Adletzberger T, Calcaterra S, Botifoll M, Garzón Manjón A, Arbiol J, Chrastina D, Isella G, Pop IM, Katsaros G. 2025. Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors. Nature Communications. 16, 2103."},"year":"2025","date_created":"2025-03-16T23:01:23Z","publication":"Nature Communications"},{"OA_place":"repository","corr_author":"1","oa":1,"related_material":{"record":[{"relation":"used_in_publication","id":"19401","status":"public"},{"id":"18144","status":"public","relation":"used_in_publication"}]},"has_accepted_license":"1","file_date_updated":"2025-01-27T11:27:35Z","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"title":"Research data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'","project":[{"_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452","grant_number":"101069515","name":"Integrated Germanium Quantum Technology"},{"call_identifier":"FWF","grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","name":"Towards scalable hut wire quantum devices"},{"name":"Merging spin and superconducting qubits in planar Ge","grant_number":"P36507","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a"},{"name":"High impedance circuit quantum electrodynamics with hole spins","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","grant_number":"I05060"}],"file":[{"creator":"arashid","checksum":"977dffed4bec3c7d6315aa1cbd19e8a7","file_id":"18893","file_size":1017,"content_type":"text/plain","date_created":"2025-01-27T11:27:30Z","file_name":"readme.txt","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2025-01-27T11:27:30Z"},{"file_id":"18894","file_size":33815056,"checksum":"7ab5e3e65ddf59bbf3622ace8a0cda1c","creator":"arashid","date_updated":"2025-01-27T11:27:35Z","relation":"main_file","success":1,"file_name":"research_data.zip","access_level":"open_access","date_created":"2025-01-27T11:27:35Z","content_type":"application/zip"}],"fulldoi":"https://doi.org/10.15479/AT:ISTA:18886","status":"public","contributor":[{"contributor_type":"researcher","first_name":"Kevin Etienne Robert","id":"53f93ea2-803f-11ed-ab7e-b283135794ef","last_name":"Roux"},{"id":"18777c01-896a-11ed-bdf8-e4851dc07d16","first_name":"Carla N","contributor_type":"researcher","last_name":"Borja Espinosa"},{"last_name":"Sagi","first_name":"Oliver","contributor_type":"researcher","id":"71616374-A8E9-11E9-A7CA-09ECE5697425"},{"contributor_type":"researcher","first_name":"Abdulhamid","id":"160D87FA-96B5-11E9-BF77-7626E6697425","last_name":"Baghdadi"},{"last_name":"Adletzberger","id":"38756BB2-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Thomas"},{"last_name":"Calcaterra","contributor_type":"researcher","first_name":"Stefano"},{"first_name":"Marc","contributor_type":"researcher","last_name":"Botifoll"},{"contributor_type":"researcher","first_name":"Alba Garzón","last_name":"Manjón"},{"contributor_type":"researcher","first_name":"Jordi","last_name":"Arbiol"},{"last_name":"Chrastina","contributor_type":"researcher","first_name":"Daniel"},{"first_name":"Giovanni","contributor_type":"researcher","last_name":"Isella"},{"first_name":"Ioan M.","contributor_type":"researcher","last_name":"Pop"},{"orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher","first_name":"Georgios","last_name":"Katsaros"}],"ddc":["530"],"OA_type":"gold","type":"research_data","oa_version":"Published Version","month":"01","publisher":"Institute of Science and Technology Austria","acknowledgement":"We acknowledge Franco De Palma, Mahya Khorramshahi, Fabian Oppliger, Thomas Reisinger, Pasquale Scarlino and Xiao Xue for helpful discussions. We thank Simon Robson for proofreading the manuscript. This research was supported by the Scientific Service Units of ISTA through resources provided by the MIBA Machine Shop and the Nanofabrication facility. This research and related results were made possible with the support of the NOMIS Foundation and the HORIZON-RIA 101069515 project. This research was funded in whole or in part by the Austrian Science Fund (FWF) DOI:10.55776/P32235, DOI:10.55776/I5060 and DOI:10.55776/P36507. For Open Access purposes, the author has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission. M.J. acknowledges funding from FellowQUTE 2024-01. I.M.P. acknowledges funding from the Deutsche Forschungsgemeinschaft (DFG – German Research Foundation) under project number 450396347 (GeHoldeQED). ICN2 acknowledges funding from Generalitat de Catalunya 2021SGR00457. We acknowledge support from CSIC Interdisciplinary Thematic Platform (PTI+) on Quantum Technologies (PTI-QTEP+). This research work has been funded by the European Commission – NextGenerationEU (Regulation EU 2020/2094), through CSIC's Quantum Technologies Platform (QTEP). ICN2 is supported by the Severo Ochoa program from Spanish MCIN/AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Programme/Generalitat de Catalunya. Part of the present work has been performed in the framework of Universitat Autònoma de Barcelona Materials Science PhD program. AGM has received funding from Grant RYC2021-033479-I funded by MCIN/AEI/10.13039/501100011033 and by European Union NextGenerationEU/PRTR. M.B. acknowledges support from SUR Generalitat de Catalunya and the EU Social Fund; project ref. 2020 FI 00103. The authors acknowledge the use of instrumentation and the technical advice provided by the Joint Electron Microscopy Center at ALBA (JEMCA). ICN2 acknowledges funding from Grant IU16-014206 (METCAM-FIB) funded by the European Union through the European Regional Development Fund (ERDF), with the support of the Ministry of Research and Universities, Generalitat de Catalunya. ICN2 is a founding member of e-DREAM.","_id":"18886","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"abstract":[{"text":"Research Data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'","lang":"eng"}],"doi":"10.15479/AT:ISTA:18886","date_published":"2025-01-27T00:00:00Z","day":"27","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"author":[{"orcid":"0009-0003-9037-8831","full_name":"Janik, Marian","last_name":"Janik","id":"396A1950-F248-11E8-B48F-1D18A9856A87","first_name":"Marian"}],"date_updated":"2026-10-02T11:05:09Z","date_created":"2025-01-27T09:48:44Z","year":"2025","citation":{"ama":"Janik M. Research data for publication “Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors.” 2025. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18886\">10.15479/AT:ISTA:18886</a>","ista":"Janik M. 2025. Research data for publication ‘Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT:ISTA:18886\">10.15479/AT:ISTA:18886</a>.","apa":"Janik, M. (2025). Research data for publication “Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:18886\">https://doi.org/10.15479/AT:ISTA:18886</a>","chicago":"Janik, Marian. “Research Data for Publication ‘Strong Charge-Photon Coupling in Planar Germanium Enabled by Granular Aluminium Superinductors.’” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT:ISTA:18886\">https://doi.org/10.15479/AT:ISTA:18886</a>.","mla":"Janik, Marian. <i>Research Data for Publication “Strong Charge-Photon Coupling in Planar Germanium Enabled by Granular Aluminium Superinductors.”</i> Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:18886\">10.15479/AT:ISTA:18886</a>.","ieee":"M. Janik, “Research data for publication ‘Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors.’” Institute of Science and Technology Austria, 2025.","short":"M. Janik, (2025)."}},{"acknowledgement":"Financial support was provided by the European Research Council (ERC) under grant agreement No 715767 - MATERIALIZABLE: Intelligent fabrication-oriented Computational Design\r\nand Modeling that I gratefully acknowledge.\r\n","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"alternative_title":["ISTA Thesis"],"_id":"20276","publisher":"Institute of Science and Technology Austria","month":"09","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-065-7"]},"citation":{"ista":"Bhargava M. 2025. Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.","ama":"Bhargava M. Design and control of deformable structures: From PCB lighting displays to elastomer robots. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20276\">10.15479/AT-ISTA-20276</a>","apa":"Bhargava, M. (2025). <i>Design and control of deformable structures: From PCB lighting displays to elastomer robots</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20276\">https://doi.org/10.15479/AT-ISTA-20276</a>","chicago":"Bhargava, Manas. “Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20276\">https://doi.org/10.15479/AT-ISTA-20276</a>.","mla":"Bhargava, Manas. <i>Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20276\">10.15479/AT-ISTA-20276</a>.","short":"M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.","ieee":"M. Bhargava, “Design and control of deformable structures: From PCB lighting displays to elastomer robots,” Institute of Science and Technology Austria, 2025."},"year":"2025","date_created":"2025-09-02T14:48:39Z","supervisor":[{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel"}],"author":[{"orcid":"0009-0007-6138-6890","full_name":"Bhargava, Manas","last_name":"Bhargava","first_name":"Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425"}],"date_updated":"2026-10-02T11:13:08Z","abstract":[{"text":"Complex 3D shapes can be created by morphing flat 2D configurations. Such deformations\r\neither preserve the intrinsic material geometry (e.g., folding paper) or modify it through\r\nlocalized contraction. Once transformed, the 3D shape can be further controlled to achieve a\r\ntarget functionality. A key challenge is to take the material specifications and the actuation\r\nprocess as input to automatically design the target 3D shape and its functionality. This thesis\r\npresents two novel computational pipelines for the design and control of shape-morphing\r\nstructures used to create functional prototypes.\r\nThe first pipeline borrows from the art of origami to fold paper into intricate shapes and\r\napplies this principle to make 3D lighting displays. We introduce, PCBend a computational\r\ndesign approach that covers a surface with individually addressable RGB LEDs, effectively\r\nforming a low-resolution surface by folding rigid printed circuit boards (PCBs). We optimize\r\ncut patterns on PCBs to act as hinges and co-design LED placement, circuit routing, and\r\nfabrication constraints to produce PCB blueprints. The PCBs are fabricated using automated\r\nstandard manufacturing services with LEDs embedded on them. Finally, the fabricated PCBs\r\nare cut along the contour and folded onto a 3D-printed support. The 3D lighting display is\r\nthen controlled to display complex surface light patterns.\r\nCreating 3D shapes through folding is only possible if their planar configuration, called ”unfolding” exists without any distortion or overlap. Existing methods often permit distortion\r\nor require multiple patches, which are unsuitable for fabrication pipelines that rely on folding\r\nnon-stretchable materials. We reinforce such fabrication pipelines by providing a geometric\r\nrelaxation to the problem, where the input shape is modified to admit overlap-free unfolding.\r\nThe second fabrication pipeline extends shape morphing to soft robotics by emulating nature’s\r\nblueprint of distributed actuation. Inspired by vertebrates, we build musculoskeletal robots\r\nusing modular active actuators, employing Liquid Crystal Elastomers (LCEs) as shrinkable\r\nartificial muscles integrated with 3D-printed bones. The chemical composition of LCEs is\r\naltered to enable untethered actuation through infrared radiation, allowing active control of\r\nindividual muscles and their corresponding bones. The combined motion of individual bones\r\ndefines the robot’s overall shape and functionality. Our proposed system significantly expands\r\nboth the design and control spaces of soft robots, which we harness using our computational\r\ndesign tools. We build several physical robots that exhibit complex shape morphing and varied\r\nterrain navigation, showcasing the versatility of our pipeline.\r\nThis thesis explores applications ranging from intricate light patterns displayed on 3D shapes\r\nformed by folding rigid PCBs to untethered robots that use contractile muscles to exhibit\r\nshape morphing and locomotion. Through these examples, the thesis highlights how computational design and distributed actuation, integrated with novel materials, can transform\r\npassive structures into functional prototypes.","lang":"eng"}],"date_published":"2025-09-02T00:00:00Z","day":"02","doi":"10.15479/AT-ISTA-20276","language":[{"iso":"eng"}],"tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"96","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"13049"},{"id":"20286","status":"public","relation":"part_of_dissertation"},{"id":"18565","status":"public","relation":"part_of_dissertation"}]},"oa":1,"has_accepted_license":"1","file_date_updated":"2025-09-04T09:22:29Z","article_processing_charge":"No","corr_author":"1","OA_place":"publisher","license":"https://creativecommons.org/licenses/by-nc/4.0/","degree_awarded":"PhD","ddc":["000"],"ec_funded":1,"type":"dissertation","status":"public","fulldoi":"https://doi.org/10.15479/AT-ISTA-20276","publication_status":"published","file":[{"file_name":"2025-Bhargava-Manas-Thesis.pdf","access_level":"open_access","content_type":"application/pdf","date_created":"2025-09-03T10:40:52Z","success":1,"relation":"main_file","date_updated":"2025-09-03T10:40:52Z","checksum":"5baf8ca46c86a94fc8380ff1007aabd4","creator":"mbhargav","file_size":161436245,"file_id":"20284"},{"access_level":"closed","file_name":"manas_phd_thesis_source_files.zip","content_type":"application/x-zip-compressed","date_created":"2025-09-03T13:18:05Z","date_updated":"2025-09-04T09:22:29Z","relation":"source_file","checksum":"66878fafbc0074f88ddd18f24a9fc647","creator":"mbhargav","file_size":198831315,"file_id":"20285"}],"title":"Design and control of deformable structures: From PCB lighting displays to elastomer robots","project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"}],"doi_confirm":"1"},{"das_tickbox":"0","scopus_import":"1","abstract":[{"text":"We present a computational approach for unfolding 3D shapes isometrically into the plane as a single patch without overlapping triangles. This is a hard, sometimes impossible, problem, which existing methods are forced to soften by allowing for map distortions or multiple patches. Instead, we propose a geometric relaxation of the problem: We modify the input shape until it admits an overlap‐free unfolding. We achieve this by locally displacing vertices and collapsing edges, guided by the unfolding process. We validate our algorithm quantitatively and qualitatively on a large dataset of complex shapes and show its proficiency by fabricating real shapes from paper.","lang":"eng"}],"date_published":"2025-02-01T00:00:00Z","day":"01","doi":"10.1111/cgf.15269","citation":{"ista":"Bhargava M, Schreck C, Freire M, Hugron PA, Lefebvre S, Sellán S, Bickel B. 2025. Mesh simplification for unfolding. Computer Graphics Forum. 44(1), e15269.","ama":"Bhargava M, Schreck C, Freire M, et al. Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. 2025;44(1). doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>","apa":"Bhargava, M., Schreck, C., Freire, M., Hugron, P. A., Lefebvre, S., Sellán, S., &#38; Bickel, B. (2025). Mesh simplification for unfolding. <i>Computer Graphics Forum</i>. Wiley. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>","chicago":"Bhargava, Manas, Camille Schreck, M. Freire, P. A. Hugron, S. Lefebvre, S. Sellán, and Bernd Bickel. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>. Wiley, 2025. <a href=\"https://doi.org/10.1111/cgf.15269\">https://doi.org/10.1111/cgf.15269</a>.","mla":"Bhargava, Manas, et al. “Mesh Simplification for Unfolding.” <i>Computer Graphics Forum</i>, vol. 44, no. 1, e15269, Wiley, 2025, doi:<a href=\"https://doi.org/10.1111/cgf.15269\">10.1111/cgf.15269</a>.","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025.","short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025)."},"year":"2025","date_created":"2024-11-19T09:14:32Z","publication":"Computer Graphics Forum","author":[{"orcid":"0009-0007-6138-6890","full_name":"Bhargava, Manas","last_name":"Bhargava","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","first_name":"Manas"},{"full_name":"Schreck, Camille","last_name":"Schreck","first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Freire, M.","last_name":"Freire","first_name":"M."},{"first_name":"P. A.","last_name":"Hugron","full_name":"Hugron, P. A."},{"full_name":"Lefebvre, S.","last_name":"Lefebvre","first_name":"S."},{"last_name":"Sellán","first_name":"S.","full_name":"Sellán, S."},{"last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385","full_name":"Bickel, Bernd"}],"date_updated":"2026-10-02T11:13:08Z","intvolume":"        44","article_type":"original","publication_identifier":{"eissn":["1467-8659"],"issn":["0167-7055"]},"researchdata_availability":"no","volume":44,"quality_controlled":"1","article_number":"e15269","issue":"1","acknowledgement":"Researchers from INRIA received support from the DORNELL Inria Challenge. Silvia Sellán acknowledges support from NSERC Vanier Doctoral Scholarship and an MIT SoE Postdoctoral Fellowship for Engineering Excellence.","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"_id":"18565","publisher":"Wiley","oa_version":"Published Version","month":"02","external_id":{"arxiv":["2408.06944"],"isi":["001357046100001"]},"isi":1,"arxiv":1,"fulldoi":"https://doi.org/10.1111/cgf.15269","publication_status":"published","title":"Mesh simplification for unfolding","file":[{"creator":"mbhargav","checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","file_size":36999751,"file_id":"18567","date_created":"2024-11-19T09:23:20Z","content_type":"video/mp4","access_level":"open_access","file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","success":1,"date_updated":"2024-11-19T09:23:20Z","relation":"main_file"},{"date_created":"2025-04-16T09:06:45Z","content_type":"application/pdf","file_name":"2025_CompGraphicsForum_Bhargava.pdf","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2025-04-16T09:06:45Z","creator":"dernst","checksum":"efb06b01bae37f470954601bc004374d","file_size":5188265,"file_id":"19576"}],"ddc":["006"],"type":"journal_article","OA_type":"hybrid","status":"public","keyword":["fabrication","single patch unfolding","mesh simplification"],"corr_author":"1","OA_place":"publisher","supplementarymaterial":"yes","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","related_material":{"record":[{"status":"public","id":"20276","relation":"dissertation_contains"}]},"oa":1,"file_date_updated":"2025-04-16T09:06:45Z","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)"},{"abstract":[{"text":"Despite generating remarkable results in various computer vision tasks, deep learning comes\r\nwith some surprising shortcomings. For example, tiny perturbations, often imperceptible to\r\nthe human eye, can completely change the predictions of image classifiers. Despite a decade\r\nof research, the field has made limited progress in developing image classifiers that are both\r\naccurate and robust. This thesis aims to address this gap.\r\nAs our first contribution, we aim to simplify the process of training certifiably robust image\r\nclassifiers. We do this by designing a convolutional layer that does not require executing an\r\niterative procedure in every forward pass, but relies on an explicit bound instead. We also\r\npropose a loss function that allows optimizing for a particular margin more precisely.\r\nNext, we provide an overview and comparison of various methods that create robust image\r\nclassifiers by constraining the Lipschitz constant. This is important since generally longer\r\ntraining times and more parameters improve the performance of robust classifiers, making it\r\nchallenging to determine the most practical and effective methods from existing literature.\r\nIn 1-Lipschitz classification, the performance of current methods is still much worse than what\r\nwe expect on the simple tasks we consider. Therefore, we next investigate potential causes of\r\nthis shortcoming. We first consider the role of the activation function. We prove a theoretical\r\nshortcoming of the commonly used activation function, and provide an alternative without it.\r\nHowever this theoretical improvement does barely translate to the empirical performance of\r\nrobust classifiers, suggesting a different bottleneck.\r\nTherefore, in the final chapter, we study how the performance depends on the amount of\r\ntraining data. We prove that in the worst case, we might require far more data to train a\r\nrobust classifier compared to a normal one. We furthermore find that the amount of training\r\ndata is a key determinant of the performance current methods achieve on popular datasets.\r\nAdditionally, we show that linear subspaces exist with tiny data variance, and yet we can\r\nstill train very accurate classifiers after projecting into those subspaces. This shows that on\r\nthe datasets considered, enforcing robustness in classification makes the task strictly more\r\nchallenging.\r\n\r\n","lang":"eng"}],"doi":"10.15479/10.15479/at-ista-19759","date_published":"2025-05-30T00:00:00Z","day":"30","author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","full_name":"Prach, Bernd"}],"date_updated":"2026-10-02T11:16:04Z","date_created":"2025-05-28T16:20:48Z","year":"2025","citation":{"ama":"Prach B. Robust image classification with 1-Lipschitz networks. 2025. doi:<a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">10.15479/10.15479/at-ista-19759</a>","ista":"Prach B. 2025. Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria.","apa":"Prach, B. (2025). <i>Robust image classification with 1-Lipschitz networks</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">https://doi.org/10.15479/10.15479/at-ista-19759</a>","chicago":"Prach, Bernd. “Robust Image Classification with 1-Lipschitz Networks.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">https://doi.org/10.15479/10.15479/at-ista-19759</a>.","ieee":"B. Prach, “Robust image classification with 1-Lipschitz networks,” Institute of Science and Technology Austria, 2025.","short":"B. Prach, Robust Image Classification with 1-Lipschitz Networks, Institute of Science and Technology Austria, 2025.","mla":"Prach, Bernd. <i>Robust Image Classification with 1-Lipschitz Networks</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/10.15479/at-ista-19759\">10.15479/10.15479/at-ista-19759</a>."},"supervisor":[{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"publication_identifier":{"issn":["2663-337X"]},"month":"05","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink.  If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","_id":"19759","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"alternative_title":["ISTA Thesis"],"file":[{"relation":"main_file","date_updated":"2025-06-10T18:11:05Z","content_type":"application/pdf","date_created":"2025-06-10T18:11:05Z","file_name":"ThesisFinal.pdf","access_level":"open_access","file_size":3578077,"file_id":"19829","creator":"bprach","checksum":"e5108e759014e2a9020c973c778fafc9"},{"relation":"source_file","date_updated":"2025-06-10T18:14:03Z","access_level":"closed","file_name":"ThesisFinal.zip","date_created":"2025-06-10T18:14:03Z","content_type":"application/x-zip-compressed","file_size":74894357,"file_id":"19830","checksum":"51bf6c11fb6d8a9f8010b458c600a83f","creator":"bprach"}],"title":"Robust image classification with 1-Lipschitz networks","publication_status":"published","doi_confirm":"1","fulldoi":"https://doi.org/10.15479/10.15479/at-ista-19759","status":"public","ddc":["000"],"degree_awarded":"PhD","type":"dissertation","OA_place":"publisher","corr_author":"1","oa":1,"related_material":{"record":[{"status":"public","id":"15039","relation":"part_of_dissertation"},{"id":"11839","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"18874","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"17426","status":"public"}]},"file_date_updated":"2025-06-10T18:14:03Z","has_accepted_license":"1","article_processing_charge":"No","page":"84","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}]},{"date_updated":"2026-10-02T11:15:42Z","author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","first_name":"Bernd","last_name":"Prach","full_name":"Prach, Bernd"},{"orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph"}],"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.04245","open_access":"1"}],"publication":"2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops","citation":{"ista":"Prach B, Lampert C. 2025. Intriguing properties of robust classification. 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. CVPR: Conference on Computer Vision and Pattern Recognition, 660–669.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. In: <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE; 2025:660-669. doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>","apa":"Prach, B., &#38; Lampert, C. (2025). Intriguing properties of robust classification. In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i> (pp. 660–669). Nashville, TN, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, 660–69. IEEE, 2025. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>.","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, IEEE, 2025, pp. 660–69, doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>.","short":"B. Prach, C. Lampert, in:, 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–669.","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” in <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, Nashville, TN, United States, 2025, pp. 660–669."},"year":"2025","date_created":"2025-10-12T22:01:26Z","date_published":"2025-06-15T00:00:00Z","day":"15","doi":"10.1109/CVPRW67362.2025.00071","scopus_import":"1","abstract":[{"text":"Despite extensive research since the community learned about adversarial examples 10 years ago, we still do not know how to train high-accuracy classifiers that are guaranteed to be robust to small perturbations of their inputs. Previous works often argued that this might be because no classifier exists that is robust and accurate at the same time. However, in computer vision this assumption does not match reality where humans are usually accurate and robust on most tasks of interest. We offer an alternative explanation and show that in certain settings robust generalization is only possible with unrealistically large amounts of data. Specifically, we find a setting where a robust classifier exists, it is easy to learn an accurate classifier, yet it requires an exponential amount of data to learn a robust classifier. Based on this theoretical result, we evaluate the influence of the amount of training data on datasets such as CIFAR10. Our findings indicate that the the amount of training data is the main factor determining the robust performance. Furthermore we show that that there are low magnitude directions in the data which are useful for non-robust generalization but are not available for robust classifiers. This implies that robust classification is a strictly harder tasks than normal classification, thereby providing an explanation why robust classification requires more data.","lang":"eng"}],"external_id":{"arxiv":["2412.04245"]},"conference":{"location":"Nashville, TN, United States","end_date":"2025-06-12","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2025-06-11"},"publisher":"IEEE","month":"06","oa_version":"Preprint","department":[{"_id":"ChLa"}],"_id":"20455","quality_controlled":"1","publication_identifier":{"eissn":["2160-7516"],"isbn":["9798331599942"],"issn":["2160-7508"]},"status":"public","type":"conference","OA_type":"green","publication_status":"published","title":"Intriguing properties of robust classification","arxiv":1,"fulldoi":"https://doi.org/10.1109/CVPRW67362.2025.00071","article_processing_charge":"No","related_material":{"record":[{"relation":"earlier_version","id":"18874","status":"public"}]},"oa":1,"language":[{"iso":"eng"}],"page":"660-669","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","corr_author":"1","OA_place":"repository"},{"corr_author":"1","OA_place":"publisher","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2025-04-30T15:49:16Z","related_material":{"record":[{"id":"8135","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"8384","relation":"part_of_dissertation"},{"status":"public","id":"17219","relation":"part_of_dissertation"}]},"oa":1,"language":[{"iso":"eng"}],"page":"106","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","file":[{"date_updated":"2025-04-30T14:02:25Z","relation":"source_file","file_name":"Thesis_source_Heiss_Synak.zip","access_level":"closed","content_type":"application/x-zip-compressed","date_created":"2025-04-30T14:02:25Z","file_id":"19633","file_size":60670543,"checksum":"f00b519c27529daa0c3b2d4102b4fa7b","creator":"cchlebak"},{"date_created":"2025-04-30T14:02:42Z","content_type":"application/pdf","access_level":"open_access","file_name":"Thesis_PDFA_Heiss_Synak.pdf","relation":"main_file","date_updated":"2025-04-30T15:49:16Z","creator":"cchlebak","checksum":"6e40a2fd3b1b881af1385670854a682e","file_size":21319043,"file_id":"19634"}],"project":[{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176","call_identifier":"H2020"},{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"},{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"title":"Methods for fluid simulation, surface tracking, and statistics of non-manifold structures","fulldoi":"https://doi.org/10.15479/AT-ISTA-19630","status":"public","type":"dissertation","degree_awarded":"PhD","ec_funded":1,"ddc":["519","006"],"publication_identifier":{"issn":["2663-337X"]},"publisher":"Institute of Science and Technology Austria","month":"04","oa_version":"Published Version","department":[{"_id":"ChWo"},{"_id":"GradSch"}],"alternative_title":["ISTA Thesis"],"_id":"19630","acknowledgement":"The project in Chapter 2 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176. The project in Chapter 3 was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA). The project in Chapter 4 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It was also partially supported by the DFG Collaborative Research Center TRR 109, 'Discretization in Geometry and Dynamics', through grant no. I02979-N35 of the Austrian Science Fund (FWF). Thank you for providing funds to support my work.","day":"29","date_published":"2025-04-29T00:00:00Z","doi":"10.15479/AT-ISTA-19630","abstract":[{"lang":"eng","text":"This thesis consists of three chapters, each corresponding to one publication. While each of these projects tackles a topic in a different area of research, they all share a common thread in the type of topological structure they handle - a partition of space into volumes separated by interfaces that meet in non-manifold junctions.\r\n\r\nIn Chapter 2, we study clusters of soap bubbles from a simulation perspective. In particular, we develop a surface-only algorithm that couples large scale motion and shape deformation of soap bubble clusters with the small scale evolution of the thin film's thickness, which is responsible for visual phenomena like surface vortices, Newton's interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. We model film thickness as a reduced degree of freedom in the Navier-Stokes equations and from them derive three sets of equations governing normal and tangential motion of the soap film surface, as well as the evolution of the thin film thickness. We discretize these equations on a non-manifold triangle mesh, extending and adapting operators to handle complex topology. We also present an incompressible fluid solver for 2.5D films and an advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.\r\n\r\nIn Chapter 3, we introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts mesh defects, such as overlaps, self-intersections, and inversions into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations, such as those presented in Chapter 2, but with an order of magnitude more interacting bubbles than what we could achieve before, and Boolean unions of non-manifold meshes consisting of millions of triangles.\r\n\r\nLastly, in Chapter 4, we utilize developments in the theory of random geometric complexes facilitated by observations from Discrete Morse theory. We survey the methods and results obtained with this new approach, and discuss some of its shortcomings. We use simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics."}],"acknowledged_ssus":[{"_id":"ScienComp"}],"date_updated":"2026-10-02T11:19:03Z","author":[{"full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Synak"}],"supervisor":[{"full_name":"Wojtan, Christopher J","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan"}],"citation":{"ista":"Synak P. 2025. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria.","ama":"Synak P. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>","apa":"Synak, P. (2025). <i>Methods for fluid simulation, surface tracking, and statistics of non-manifold structures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>","chicago":"Synak, Peter. “Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>.","mla":"Synak, Peter. <i>Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>.","short":"P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025.","ieee":"P. Synak, “Methods for fluid simulation, surface tracking, and statistics of non-manifold structures,” Institute of Science and Technology Austria, 2025."},"year":"2025","date_created":"2025-04-29T09:39:34Z"},{"supervisor":[{"last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","first_name":"Christopher J","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J"},{"full_name":"Chern, Albert","last_name":"Chern","first_name":"Albert"}],"citation":{"ista":"Ishida S. 2025. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. Institute of Science and Technology Austria.","ama":"Ishida S. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>","apa":"Ishida, S. (2025). <i>Symplectic-prequantum structures and dynamics on the codimension-2 shape space</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>","chicago":"Ishida, Sadashige. “Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>.","mla":"Ishida, Sadashige. <i>Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>.","short":"S. Ishida, Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space, Institute of Science and Technology Austria, 2025.","ieee":"S. Ishida, “Symplectic-prequantum structures and dynamics on the codimension-2 shape space,” Institute of Science and Technology Austria, 2025."},"date_created":"2025-10-27T10:28:52Z","year":"2025","date_updated":"2026-10-02T11:17:04Z","author":[{"full_name":"Ishida, Sadashige","orcid":"0000-0002-3121-3100","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","last_name":"Ishida"}],"acknowledged_ssus":[{"_id":"CampIT"}],"day":"31","date_published":"2025-10-31T00:00:00Z","doi":"10.15479/AT-ISTA-20551","abstract":[{"lang":"eng","text":"The space of codimension-2 shapes, such as curves in 3D and surfaces in 4D, is an infinite-dimensional manifold. This thesis explores geometric structures and dynamics on this space, with emphasis on their implications for physics, particularly hydrodynamics.\r\n\r\nOur investigation ranges from theoretical studies of infinite-dimensional symplectic and prequantum geometry to numerical computation of the time evolution of shapes. The thesis presents four main contributions.\r\n\r\nIn the first part, we introduce implicit representations of codimension-2 shapes using a class of complex-valued functions, and prove that the space of these implicit representations forms a prequantum bundle over the codimension-2 shape space. This reveals a new geometric interpretation of the canonical symplectic structure on the codimension-2 shape space.\r\n\r\nIn the second part, we use implicit representations to develop a simulation method for the dynamics of space curves. To handle chaotic systems such as vortex filaments in hydrodynamics, we exploit the infinite degrees of freedom, hidden in both the configuration and dynamics of implicit representations.\r\n\r\nIn the third part, we introduce new symplectic structures on the space of space curves, which generalize the only previously known symplectic structure on this space, allowing for new Hamiltonian dynamics of space curves.\r\n\r\nIn the fourth part, we apply a symplectic viewpoint to a differential geometric problem with practical applications. We derive a new area formula for spherical polygons via prequantization. "}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"alternative_title":["ISTA Thesis"],"_id":"20551","acknowledgement":"Projects contained in this thesis were financially supported in part by the\r\nEuropean Research Council with grants 1. ERC Consolidator Grant 101045083 CoDiNA,\r\nand 2. the European Union’s Horizon 2020 research and innovation programme under grant\r\nagreement No. 638176.","publisher":"Institute of Science and Technology Austria","month":"10","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-070-1"]},"type":"dissertation","degree_awarded":"PhD","ddc":["516"],"ec_funded":1,"status":"public","fulldoi":"https://doi.org/10.15479/AT-ISTA-20551","publication_status":"published","file":[{"file_name":"Thesis_tex.zip","access_level":"open_access","date_created":"2025-11-01T18:26:14Z","content_type":"application/zip","relation":"source_file","date_updated":"2025-11-01T18:26:14Z","checksum":"4eef80afcb67691cbb6549c4756fa534","creator":"sishida","file_id":"20583","file_size":72487812},{"creator":"sishida","checksum":"1e5a557900bf2dce01966b211b15d0fe","file_id":"20623","file_size":8945141,"date_created":"2025-11-10T08:45:05Z","content_type":"application/pdf","file_name":"Thesis_Sadashige_Ishida_PDFA.pdf","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2025-11-10T08:45:05Z"}],"title":"Symplectic-prequantum structures and dynamics on the codimension-2 shape space","project":[{"call_identifier":"H2020","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","grant_number":"638176"},{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"page":"141","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2025-11-10T08:45:05Z","related_material":{"record":[{"status":"public","id":"12431","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20580"},{"relation":"part_of_dissertation","id":"17361","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"12846"}]},"oa":1,"corr_author":"1","OA_place":"publisher"},{"doi":"10.15479/AT-ISTA-20234","date_published":"2025-08-27T00:00:00Z","day":"27","abstract":[{"lang":"eng","text":"Game Theory is the mathematical formalization of social dynamics - systems where agents interact over time and the evolution of the state of the system depends on the decisions of every player. \r\nThis thesis takes the perspective of a single player and focuses on what they can guarantee in the worst case over the behavior of other players.\r\nIn other words, we consider that the objective of every other player in the game is exactly the opposite to the player.\r\nWe focus on sustained interactions over time, where the players repeatedly obtain quantitative rewards over time, and they are interested in maximizing their long-term performance.\t\r\nFormally, this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1. How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe study their properties on games that exhibit one or more of the following properties. \r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the current state of the system during the game. We consider the model of (finite) Partially Observable Markov Decision Processes and prove that finite-memory strategies are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description: \r\nthe formal description of the game is perturbed by a small parameter.\r\nWe consider the model of (finite) Perturbed Matrix Games, and provide algorithms to check various robustness properties and to compute the parameterized value and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the players determine the behavior of the evolution of the system, described as a probability distribution over the next state.\r\nWe consider the model of (finite) Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4. Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider the model of Random Dynamic Games on a class of infinite graphs, prove the existence of the value, and quantify the concentration of finite-horizon values."}],"date_updated":"2026-10-02T11:30:08Z","author":[{"first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"}],"supervisor":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"year":"2025","date_created":"2025-08-27T14:00:13Z","citation":{"ama":"Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>","ista":"Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.","apa":"Saona Urmeneta, R. J. (2025). <i>Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>","chicago":"Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>.","short":"R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.","ieee":"R. J. Saona Urmeneta, “Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games,” Institute of Science and Technology Austria, 2025.","mla":"Saona Urmeneta, Raimundo J. <i>Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>."},"publication_identifier":{"issn":["2663-337X"]},"month":"08","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","_id":"20234","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"alternative_title":["ISTA Thesis"],"acknowledgement":"Funding sources The works included in this thesis were partially supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020 (CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation de la Coopération Scientifique and Comisión Nacional de Investigación Científica y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET) and E-COST-GRANT-CA16228-c5a69859.\r\n","doi_confirm":"1","project":[{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"},{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"title":"Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games","file":[{"file_name":"2025_Saona_Raimundo_Thesis.pdf","access_level":"open_access","date_created":"2025-08-28T14:47:07Z","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2025-08-28T14:47:07Z","checksum":"394a651f7de7085e509ef856ffe7bd97","creator":"rsaonaur","file_id":"20240","file_size":1503623},{"file_id":"20241","file_size":622747,"checksum":"09fb2633e66aac80433d373f4180c5b4","creator":"rsaonaur","relation":"source_file","date_updated":"2025-08-28T14:47:12Z","file_name":"2025_Saona_Raimundo_Thesis.zip","access_level":"closed","date_created":"2025-08-28T14:47:12Z","content_type":"application/zip"}],"publication_status":"published","fulldoi":"https://doi.org/10.15479/AT-ISTA-20234","status":"public","type":"dissertation","ddc":["519"],"ec_funded":1,"degree_awarded":"PhD","OA_place":"publisher","corr_author":"1","has_accepted_license":"1","file_date_updated":"2025-08-28T14:47:12Z","article_processing_charge":"No","oa":1,"related_material":{"record":[{"status":"public","id":"9311","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"19508"},{"id":"17037","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"18266"}]},"page":"125","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}]},{"fulldoi":"https://doi.org/10.1287/moor.2023.0297","isi":1,"publication_status":"published","title":"Marginal values of a stochastic game","project":[{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"type":"journal_article","OA_type":"closed access","ec_funded":1,"status":"public","supplementarymaterial":"unclear","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"482-505","article_processing_charge":"No","related_material":{"record":[{"relation":"dissertation_contains","id":"20234","status":"public"}]},"das_tickbox":"0","date_published":"2025-02-01T00:00:00Z","day":"01","doi":"10.1287/moor.2023.0297","scopus_import":"1","abstract":[{"text":"Zero-sum stochastic games are parameterized by payoffs, transitions, and possibly a discount rate. In this article, we study how the main solution concepts, the discounted and undiscounted values, vary when these parameters are perturbed. We focus on the marginal values, introduced by Mills in 1956 in the context of matrix games—that is, the directional derivatives of the value along any fixed perturbation. We provide a formula for the marginal values of a discounted stochastic game. Further, under mild assumptions on the perturbation, we provide a formula for their limit as the discount rate vanishes and for the marginal values of an undiscounted stochastic game. We also show, via an example, that the two latter differ in general.","lang":"eng"}],"publication":"Mathematics of Operations Research","citation":{"ama":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. 2025;50(1):482-505. doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>","ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","apa":"Attia, L., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>","chicago":"Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2025. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>.","short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505.","ieee":"L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” <i>Mathematics of Operations Research</i>, vol. 50, no. 1. Institute for Operations Research and the Management Sciences, pp. 482–505, 2025.","mla":"Attia, Luc, et al. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>."},"date_created":"2024-05-22T11:41:14Z","year":"2025","date_updated":"2026-10-02T11:29:44Z","author":[{"first_name":"Luc","last_name":"Attia","full_name":"Attia, Luc"},{"last_name":"Oliu-Barton","first_name":"Miquel","full_name":"Oliu-Barton, Miquel"},{"orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"article_type":"original","volume":50,"researchdata_availability":"unclear","intvolume":"        50","issue":"1","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"_id":"17037","acknowledgement":"This work was supported by Fondation CFM pour la Recherche; the European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)]; and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","external_id":{"isi":["001184648000001"]},"publisher":"Institute for Operations Research and the Management Sciences","oa_version":"None","month":"02"},{"corr_author":"1","OA_place":"publisher","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)"},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"86","article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2025-02-18T14:25:59Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"10845","status":"public"},{"relation":"part_of_dissertation","id":"7933","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18087"}]},"oa":1,"fulldoi":"https://doi.org/10.15479/at:ista:19048","publication_status":"published","project":[{"name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","grant_number":"F100403","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions"}],"file":[{"file_name":"thesis_Maslov.pdf","access_level":"open_access","date_created":"2025-02-18T14:25:59Z","content_type":"application/pdf","relation":"main_file","date_updated":"2025-02-18T14:25:59Z","checksum":"5822a4dd31724c512b37c658af1787ab","creator":"mmaslov","file_size":7779825,"file_id":"19061"},{"file_size":14453726,"file_id":"19062","creator":"mmaslov","checksum":"89bdce4774406d26ceca88a8bbcd6a9a","relation":"source_file","date_updated":"2025-02-18T14:25:59Z","content_type":"application/zip","date_created":"2025-02-18T14:25:59Z","file_name":"thesis_Maslov_source.zip","access_level":"open_access"}],"title":"Emergent physics of rotating quantum impurities in many-body environments","type":"dissertation","degree_awarded":"PhD","ec_funded":1,"ddc":["539","535","541"],"status":"public","publication_identifier":{"issn":["2663-337X"]},"department":[{"_id":"GradSch"},{"_id":"MiLe"}],"alternative_title":["ISTA Thesis"],"_id":"19048","acknowledgement":"I am grateful to the European Research Council (ERC) [10.3030/801770] and Austrian\r\nScience Fund (FWF) [10.55776/F1004] for funding my research and to the Physical\r\nReview journals for publishing it. I also want to thank the VCQ (previously CoQuS) and\r\nIQOQI for organizing wonderful networking events for the physics community in Vienna\r\nand Innsbruck, respectively. Moreover, I thank Austrian Science Fund (FWF) for the\r\ncontinuous support for quantum research.","publisher":"Institute of Science and Technology Austria","month":"02","oa_version":"Published Version","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"E-Lib"},{"_id":"SSU"}],"date_published":"2025-02-18T00:00:00Z","day":"18","doi":"10.15479/at:ista:19048","abstract":[{"text":"Rotations are found in physics problems at all scales: from spatial motion of celestial bodies, to transitions between quantum states of atoms and molecules. Mathematically, they represent a fundamental class of transformations and symmetries. Unlike spatial displacements, rotational transformations in three-dimensional space  are non-commutative: the result of applying a sequence of rotations depends on the order of these operations. This feature makes the emergent physics that involves rotations rather intricate, but instrumental for studies of highly-interconnected many-body systems. In the presence of an environment, rotational properties of an object change, due to the interaction with particles of the environment. Owing to the complexity of this interaction, it can be engineered to exhibit certain properties of interest. In this Thesis, we examine several scenarios of how the rotational behavior of an impurity can be modified by interactions with its environment.","lang":"eng"}],"supervisor":[{"full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko"}],"citation":{"chicago":"Maslov, Mikhail. “Emergent Physics of Rotating Quantum Impurities in Many-Body Environments.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>.","ieee":"M. Maslov, “Emergent physics of rotating quantum impurities in many-body environments,” Institute of Science and Technology Austria, 2025.","short":"M. Maslov, Emergent Physics of Rotating Quantum Impurities in Many-Body Environments, Institute of Science and Technology Austria, 2025.","mla":"Maslov, Mikhail. <i>Emergent Physics of Rotating Quantum Impurities in Many-Body Environments</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>.","ama":"Maslov M. Emergent physics of rotating quantum impurities in many-body environments. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>","ista":"Maslov M. 2025. Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria.","apa":"Maslov, M. (2025). <i>Emergent physics of rotating quantum impurities in many-body environments</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>"},"year":"2025","date_created":"2025-02-18T01:41:27Z","date_updated":"2026-10-02T11:36:24Z","author":[{"first_name":"Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","last_name":"Maslov","full_name":"Maslov, Mikhail","orcid":"0000-0003-4074-2570"}]},{"publication_identifier":{"issn":["2663-337X"]},"_id":"20147","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF)\r\nunder grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093.\r\n","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink.  If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","month":"08","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","doi":"10.15479/AT-ISTA-20147","date_published":"2025-08-07T00:00:00Z","day":"07","abstract":[{"text":"Quantitative properties offer a framework for specifying and verifying system behaviors beyond the traditional boolean perspective. For example, while a boolean property may specify whether a server eventually grants every request it receives, a quantitative one may map each server execution to its average response time. This quantitative view is relatively well-studied in the context of static verification. However, although such properties often appear in practice as performance or robustness measures in a dynamic verification context, a general theoretical framework for their analysis and classification from a monitoring perspective is still missing.\r\n\r\nIn this thesis, we aim to develop such a framework that takes resource-precision tradeoffs of monitors as a central consideration. We present the first theory of monitorability for quantitative properties where monitors can be naturally approximate and compared regarding their precision and resource use. In particular, we show that additional monitor resources such as registers or states lead to strictly better approximations for some properties. To enable such analyses in a machine-model independent way, we describe an abstract notion of monitors that can be instantiated with concrete models of monitors. Within this framework, we study how abstract monitors behave and identify classes of properties amenable to approximate monitoring with resource-precision considerations. We then extend the boolean safety-liveness dichotomy and safety-progress hierarchy to the quantitative setting with a monitoring perspective. In particular, we prove that every property is the pointwise minimum of a safety property and a liveness property, and properties that are both safe and co-safe can be approximately monitored arbitrarily precisely using only finitely many states. We also study the classes of quantitative properties definable by finite-state quantitative automata and provide algorithms for deciding their safety or liveness as well as their safety-liveness decompositions. Finally, we present the first general-purpose tool for automating the analysis, verification, and monitoring of quantitative automata.\r\n\r\n\r\n","lang":"eng"}],"supervisor":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724"}],"date_created":"2025-08-07T15:57:57Z","year":"2025","citation":{"chicago":"Sarac, Naci E. “A Monitoring-Oriented Theory and Classification of Quantitative Specifications.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>.","mla":"Sarac, Naci E. <i>A Monitoring-Oriented Theory and Classification of Quantitative Specifications</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>.","ieee":"N. E. Sarac, “A monitoring-oriented theory and classification of quantitative specifications,” Institute of Science and Technology Austria, 2025.","short":"N.E. Sarac, A Monitoring-Oriented Theory and Classification of Quantitative Specifications, Institute of Science and Technology Austria, 2025.","ista":"Sarac NE. 2025. A monitoring-oriented theory and classification of quantitative specifications. Institute of Science and Technology Austria.","ama":"Sarac NE. A monitoring-oriented theory and classification of quantitative specifications. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>","apa":"Sarac, N. E. (2025). <i>A monitoring-oriented theory and classification of quantitative specifications</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>"},"date_updated":"2026-10-02T11:44:51Z","author":[{"full_name":"Sarac, Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac"}],"OA_place":"publisher","corr_author":"1","page":"149","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2025-09-10T08:19:51Z","oa":1,"related_material":{"record":[{"id":"11775","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"deleted","id":"13140"},{"id":"19741","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"deleted","id":"19643"},{"id":"13221","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"9356"},{"status":"public","id":"20342","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"17634","status":"public"}]},"fulldoi":"https://doi.org/10.15479/AT-ISTA-20147","doi_confirm":"1","file":[{"content_type":"application/x-zip-compressed","date_created":"2025-08-21T09:40:28Z","access_level":"closed","file_name":"2025_Sarac_NaciEge_Thesis.zip","date_updated":"2025-09-10T08:19:51Z","relation":"source_file","creator":"esarac","checksum":"0f3015f1db36576a23d8d669afb60b41","file_id":"20200","file_size":8884801},{"creator":"esarac","checksum":"332ed2fe61f580641664ec3f05d30f14","file_size":2955584,"file_id":"20201","content_type":"application/pdf","date_created":"2025-08-21T09:40:34Z","access_level":"open_access","file_name":"2025_Sarac_NaciEge_Thesis.pdf","relation":"main_file","success":1,"date_updated":"2025-08-21T09:40:34Z"}],"title":"A monitoring-oriented theory and classification of quantitative specifications","project":[{"grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF"},{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"}],"publication_status":"published","type":"dissertation","ec_funded":1,"ddc":["000"],"degree_awarded":"PhD","status":"public"},{"das_tickbox":"0","date_published":"2025-01-01T00:00:00Z","day":"01","doi":"10.1007/s10107-024-02064-5","abstract":[{"lang":"eng","text":"Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"}],"scopus_import":"1","publication":"Mathematical Programming","citation":{"chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>.","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>, vol. 209, Springer Nature, 2025, pp. 279–322, doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>.","short":"M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322.","ieee":"M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” <i>Mathematical Programming</i>, vol. 209. Springer Nature, pp. 279–322, 2025.","ama":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. 2025;209:279-322. doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>","ista":"Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 209, 279–322.","apa":"Dvorak, M., &#38; Kolmogorov, V. (2025). Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>"},"year":"2025","date_created":"2021-09-27T10:48:23Z","date_updated":"2026-10-02T11:45:16Z","author":[{"full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","first_name":"Martin","last_name":"Dvorak"},{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"article_type":"original","publication_identifier":{"eissn":["1436-4646"],"issn":["0025-5610"]},"researchdata_availability":"no","volume":209,"intvolume":"       209","quality_controlled":"1","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"_id":"10045","acknowledgement":"We thank the anonymous reviewers for their careful reading of our manuscript and their many insightful comments and suggestions. Open access funding provided by Institute of Science and Technology (IST Austria).","external_id":{"arxiv":["2109.10203"],"isi":["001176563300001"]},"publisher":"Springer Nature","month":"01","oa_version":"Published Version","arxiv":1,"fulldoi":"https://doi.org/10.1007/s10107-024-02064-5","isi":1,"publication_status":"published","title":"Generalized minimum 0-extension problem and discrete convexity","file":[{"creator":"dernst","checksum":"25d9bd490719b45eca84f4d93a06c69f","file_id":"19578","file_size":839510,"content_type":"application/pdf","date_created":"2025-04-16T09:36:08Z","access_level":"open_access","file_name":"2025_MathProgramming_Dvorak.pdf","success":1,"date_updated":"2025-04-16T09:36:08Z","relation":"main_file"}],"type":"journal_article","OA_type":"hybrid","ddc":["004"],"status":"public","corr_author":"1","keyword":["minimum 0-extension problem","metric labeling problem","discrete metric spaces","metric extensions","computational complexity","valued constraint satisfaction problems","discrete convex analysis","L-convex functions"],"OA_place":"publisher","supplementarymaterial":"no","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"page":"279-322","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","file_date_updated":"2025-04-16T09:36:08Z","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","oa":1},{"status":"public","ddc":["510"],"ec_funded":1,"OA_type":"hybrid","type":"journal_article","file":[{"date_created":"2025-04-23T07:31:32Z","content_type":"application/pdf","file_name":"2025_DiscreteComputGeom_EdelsbrunnerHe.pdf","access_level":"open_access","success":1,"relation":"main_file","date_updated":"2025-04-23T07:31:32Z","creator":"dernst","checksum":"ffb0c818222138f9f113f4bbea41e834","file_size":283443,"file_id":"19610"}],"title":"Average and expected distortion of Voronoi paths and scapes","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science"},{"call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes"}],"publication_status":"published","isi":1,"fulldoi":"https://doi.org/10.1007/s00454-024-00660-y","arxiv":1,"oa":1,"has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","file_date_updated":"2025-04-23T07:31:32Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"490-499","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"supplementarymaterial":"no","OA_place":"publisher","corr_author":"1","author":[{"last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert"},{"full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","last_name":"Nikitenko"}],"date_updated":"2026-10-02T11:48:46Z","year":"2025","date_created":"2024-06-16T22:01:07Z","citation":{"chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>, vol. 73, Springer Nature, 2025, pp. 490–99, doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete &#38; Computational Geometry 73 (2025) 490–499.","ieee":"H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” <i>Discrete &#38; Computational Geometry</i>, vol. 73. Springer Nature, pp. 490–499, 2025.","ista":"Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete &#38; Computational Geometry. 73, 490–499.","ama":"Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. 2025;73:490-499. doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>"},"publication":"Discrete & Computational Geometry","abstract":[{"text":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about 4/Pi. We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.","lang":"eng"}],"scopus_import":"1","doi":"10.1007/s00454-024-00660-y","day":"01","date_published":"2025-03-01T00:00:00Z","das_tickbox":"0","month":"03","oa_version":"Published Version","publisher":"Springer Nature","external_id":{"pmid":["39974750"],"arxiv":["2012.03350"],"isi":["001238566200004"]},"acknowledgement":"The authors thank Ranita Biswas and Tatiana Ezubova for the collaboration on computational experiments that motivated the work reported in this paper. The authors also thank Daniel Bonnema for proofreading and noticing an issue with the original proof of Lemma 4.3.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","_id":"17149","department":[{"_id":"HeEd"}],"quality_controlled":"1","pmid":1,"intvolume":"        73","researchdata_availability":"no","volume":73,"article_type":"original","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]}},{"oa_version":"Preprint","month":"12","publisher":"Elsevier","external_id":{"arxiv":["2306.13201"]},"acknowledgement":"A preliminary version of this note has been published in the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, Palermo, 2023. The authors would like to thank the anonymous referees for their valuable comments.","_id":"21253","department":[{"_id":"HeEd"}],"quality_controlled":"1","article_number":"102186","intvolume":"       129","volume":129,"publication_identifier":{"issn":["0925-7721"]},"article_type":"original","author":[{"full_name":"Pach, János","last_name":"Pach","first_name":"János"},{"full_name":"Saghafian, Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824","first_name":"Morteza","last_name":"Saghafian"},{"last_name":"Schnider","first_name":"Patrick","full_name":"Schnider, Patrick"}],"date_updated":"2026-10-02T11:50:58Z","date_created":"2026-02-16T15:48:42Z","year":"2025","citation":{"chicago":"Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>.","mla":"Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>, vol. 129, 102186, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>.","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","short":"J. Pach, M. Saghafian, P. Schnider, Computational Geometry 129 (2025).","ista":"Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186.","ama":"Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. 2025;129. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>","apa":"Pach, J., Saghafian, M., &#38; Schnider, P. (2025). Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>"},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.13201","open_access":"1"}],"publication":"Computational Geometry","abstract":[{"text":"We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n - 1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.","lang":"eng"}],"doi":"10.1016/j.comgeo.2025.102186","date_published":"2025-12-01T00:00:00Z","day":"01","oa":1,"related_material":{"record":[{"relation":"earlier_version","id":"15012","status":"public"}]},"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"OA_place":"repository","corr_author":"1","status":"public","OA_type":"green","type":"journal_article","title":"Decomposition of geometric graphs into star-forests","publication_status":"published","fulldoi":"https://doi.org/10.1016/j.comgeo.2025.102186","arxiv":1},{"page":"140","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"file_date_updated":"2025-02-04T16:22:07Z","article_processing_charge":"No","has_accepted_license":"1","oa":1,"related_material":{"record":[{"id":"15091","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"18981","relation":"part_of_dissertation"}]},"OA_place":"publisher","keyword":["topological data analysis","chromatic point set","alpha complex","persistent homology","six pack","sheaf","microlocal discrete Morse","injective resolution","collapse","knot","discrete Morse theory"],"corr_author":"1","type":"dissertation","ddc":["514","004"],"degree_awarded":"PhD","status":"public","fulldoi":"https://doi.org/10.15479/at:ista:18979","file":[{"checksum":"af6567e5d35e5eb330b8925ae37f1998","creator":"odragano","file_size":11899491,"file_id":"18983","file_name":"Thesis.zip","access_level":"closed","date_created":"2025-01-31T16:58:30Z","content_type":"application/zip","relation":"source_file","date_updated":"2025-01-31T16:58:30Z"},{"file_id":"19000","file_size":8857514,"checksum":"c3fef68e35b9dc2020b2ca6006da6343","creator":"odragano","date_updated":"2025-02-04T16:22:07Z","relation":"main_file","access_level":"open_access","file_name":"Thesis.pdf","content_type":"application/pdf","date_created":"2025-02-04T16:22:07Z"}],"title":"Structures and computations in topological data analysis","project":[{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science"}],"publication_status":"published","_id":"18979","alternative_title":["ISTA Thesis"],"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"acknowledgement":"The research presented in this thesis was funded with the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n","oa_version":"Published Version","month":"02","publisher":"Institute of Science and Technology Austria","publication_identifier":{"issn":["2663-337X"]},"supervisor":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833"}],"year":"2025","date_created":"2025-01-31T17:04:40Z","citation":{"chicago":"Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>.","short":"O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025.","ieee":"O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025.","mla":"Draganov, Ondrej. <i>Structures and Computations in Topological Data Analysis</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>.","ama":"Draganov O. Structures and computations in topological data analysis. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>","ista":"Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria.","apa":"Draganov, O. (2025). <i>Structures and computations in topological data analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>"},"date_updated":"2026-10-02T11:57:00Z","author":[{"full_name":"Draganov, Ondrej","orcid":"0000-0003-0464-3823","first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","last_name":"Draganov"}],"doi":"10.15479/at:ista:18979","day":"03","date_published":"2025-02-03T00:00:00Z","abstract":[{"text":"Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe describe a construction of a chromatic alpha complex, which enables  efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot.","lang":"eng"}]},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"article_processing_charge":"Yes (via OA deal)","file_date_updated":"2025-12-30T07:55:08Z","has_accepted_license":"1","oa":1,"related_material":{"record":[{"relation":"earlier_version","id":"18981","status":"public"}]},"OA_place":"publisher","corr_author":"1","PlanS_conform":"1","OA_type":"hybrid","type":"journal_article","ec_funded":1,"ddc":["510"],"status":"public","fulldoi":"https://doi.org/10.1016/j.jpaa.2025.108068","arxiv":1,"file":[{"checksum":"39bcad462278c9322ef810af7db67f56","creator":"dernst","file_size":3090836,"file_id":"20886","access_level":"open_access","file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","date_created":"2025-12-30T07:55:08Z","content_type":"application/pdf","success":1,"relation":"main_file","date_updated":"2025-12-30T07:55:08Z"}],"project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"}],"title":"Discrete microlocal Morse theory","publication_status":"published","_id":"20323","department":[{"_id":"HeEd"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35","external_id":{"arxiv":["2209.14993"]},"month":"10","oa_version":"Published Version","publisher":"Elsevier","volume":229,"article_type":"original","publication_identifier":{"issn":["0022-4049"]},"intvolume":"       229","issue":"10","article_number":"108068","quality_controlled":"1","publication":"Journal of Pure and Applied Algebra","year":"2025","date_created":"2025-09-10T05:40:09Z","citation":{"chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>.","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10. Elsevier, 2025.","short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10, 108068, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>.","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068.","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. 2025;229(10). doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>","apa":"Brown, A., &#38; Draganov, O. (2025). Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>"},"date_updated":"2026-10-02T11:57:00Z","author":[{"full_name":"Brown, Adam","last_name":"Brown","id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam"},{"last_name":"Draganov","first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej"}],"doi":"10.1016/j.jpaa.2025.108068","date_published":"2025-10-01T00:00:00Z","day":"01","scopus_import":"1","abstract":[{"text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities.","lang":"eng"}]}]