[{"researchdata_availability":"yes","publisher":"Neural Information Processing Systems Foundation","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2502.06343","open_access":"1"}],"status":"public","author":[{"id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","last_name":"Cadei","full_name":"Cadei, Riccardo","first_name":"Riccardo"},{"first_name":"Ilker","full_name":"Demirel, Ilker","last_name":"Demirel"},{"full_name":"De Bartolomeis, Piersilvio","last_name":"De Bartolomeis","first_name":"Piersilvio"},{"first_name":"Lukas","full_name":"Lindorfer, Lukas","last_name":"Lindorfer","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455"},{"orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","last_name":"Cremer","first_name":"Sylvia"},{"last_name":"Schmid","full_name":"Schmid, Cordelia","first_name":"Cordelia"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco","first_name":"Francesco"}],"date_created":"2026-09-06T22:02:01Z","date_updated":"2026-09-17T06:56:40Z","department":[{"_id":"FrLo"},{"_id":"GradSch"},{"_id":"SyCr"}],"corr_author":"1","intvolume":"        38","OA_place":"repository","external_id":{"arxiv":["2502.06343"]},"doi":"10.52202/085713-2479","quality_controlled":"1","day":"01","publication_identifier":{"isbn":["9798331338275"],"issn":["1049-5258"]},"oa_version":"Preprint","volume":38,"citation":{"ista":"Cadei R, Demirel I, De Bartolomeis P, Lindorfer L, Cremer S, Schmid C, Locatello F. 2025. Prediction-Powered Causal Inferences. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 82200–82229.","ama":"Cadei R, Demirel I, De Bartolomeis P, et al. Prediction-Powered Causal Inferences. In: <i>39th Conference on Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025:82200-82229. doi:<a href=\"https://doi.org/10.52202/085713-2479\">10.52202/085713-2479</a>","chicago":"Cadei, Riccardo, Ilker Demirel, Piersilvio De Bartolomeis, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Prediction-Powered Causal Inferences.” In <i>39th Conference on Neural Information Processing Systems</i>, 38:82200–229. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-2479\">https://doi.org/10.52202/085713-2479</a>.","ieee":"R. Cadei <i>et al.</i>, “Prediction-Powered Causal Inferences,” in <i>39th Conference on Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38, pp. 82200–82229.","short":"R. Cadei, I. Demirel, P. De Bartolomeis, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 82200–82229.","mla":"Cadei, Riccardo, et al. “Prediction-Powered Causal Inferences.” <i>39th Conference on Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 82200–29, doi:<a href=\"https://doi.org/10.52202/085713-2479\">10.52202/085713-2479</a>.","apa":"Cadei, R., Demirel, I., De Bartolomeis, P., Lindorfer, L., Cremer, S., Schmid, C., &#38; Locatello, F. (2025). Prediction-Powered Causal Inferences. In <i>39th Conference on Neural Information Processing Systems</i> (Vol. 38, pp. 82200–82229). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-2479\">https://doi.org/10.52202/085713-2479</a>"},"alternative_title":["Advances in Neural Information Processing Systems"],"conference":{"start_date":"2025-12-02","location":"San Diego, CA, United States","name":"NeurIPS: Neural Information Processing Systems","end_date":"2025-12-07"},"language":[{"iso":"eng"}],"das_tickbox":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"In many scientific experiments, the data annotating cost constraints the pace\r\nfor testing novel hypotheses. Yet, modern machine learning pipelines offer a\r\npromising solution—provided their predictions yield correct conclusions. We\r\nfocus on Prediction-Powered Causal Inferences (PPCI), i.e., estimating the\r\ntreatment effect in an unlabeled target experiment, relying on training data with\r\nthe same outcome annotated but potentially different treatment or effect modifiers.\r\nWe first show that conditional calibration guarantees valid PPCI at population\r\nlevel. Then, we introduce a sufficient representation constraint transferring validity\r\nacross experiments, which we propose to enforce in practice in Deconfounded\r\nEmpirical Risk Minimization, our new model-agnostic training objective. We\r\nvalidate our method on synthetic and real-world scientific data, solving impossible\r\nproblem instances for Empirical Risk Minimization even with standard invariance\r\nconstraints. In particular, for the first time, we achieve valid causal inference\r\non a scientific experiment with complex recording and no human annotations,\r\nfine-tuning a foundational model on our similar annotated experiment."}],"title":"Prediction-Powered Causal Inferences","supplementarymaterial":"yes","OA_type":"green","acknowledgement":"We thank the Causal Learning and Artificial Intelligence group at ISTA for the continuous feedback\r\non the project and valuable discussions. We thank the Social Immunity group at ISTA, particularly\r\nJinook Oh, for the annotation program and Michaela Hoenigsberger for supporting our ecological\r\nexperiment. Riccardo Cadei is supported by a Google Research Scholar Award and a Google Initiated\r\nGift to Francesco Locatello. This research was funded in part by the Austrian Science Fund (FWF)\r\n10.55776/COE12). It was further partially supported by the ISTA Interdisciplinary Project Committee\r\nfor the collaborative project “ALED” between Francesco Locatello and Sylvia Cremer. For open\r\naccess purposes, the author has applied a CC BY public copyright license to any author accepted\r\nmanuscript version arising from this submission.\r\n","publication_status":"published","date_published":"2025-12-01T00:00:00Z","page":"82200-82229","type":"conference","publication":"39th Conference on Neural Information Processing Systems","arxiv":1,"fulldoi":"https://doi.org/10.52202/085713-2479","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","_id":"22832","dataavailabilitystatement":"We share all the code implementation in the supplementary material.\r\nOur new experimental ecology dataset preview is anonymously shared on Figshare at\r\nhttps://figshare.com/s/9a490b6f6eeebd73350b. We further rely on ISTAnt dataset publicly\r\navailable at https://doi.org/10.6084/m9.figshare.26484934.v2. The synthetic experiments\r\non CausalMNIST relies on MNIST dataset LeCun [1998], publicly available. Additional\r\nexperimental details are reported in Section 5 and Appendices B-C.","project":[{"name":"Bilateral Artificial Intelligence (Locatello)","_id":"a392d8f0-b034-11f1-b88e-d3025c6734f6","grant_number":"COE12"}],"scopus_import":"1","month":"12"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"fulldoi":"https://doi.org/10.1103/qvls-7s3q","has_accepted_license":"1","publication":"Physical Review Applied","arxiv":1,"publication_status":"published","date_published":"2025-07-17T00:00:00Z","type":"journal_article","ddc":["530"],"article_type":"original","scopus_import":"1","PlanS_conform":"1","month":"07","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"P33692","_id":"0aa3608a-070f-11eb-9043-e9cd8a2bd931","name":"Cavity electromechanics across a quantum phase transition"},{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2","name":"Protected states of quantum matter"}],"_id":"20324","year":"2025","article_number":"014035","department":[{"_id":"GradSch"},{"_id":"AnHi"}],"corr_author":"1","intvolume":"        24","OA_place":"publisher","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"external_id":{"isi":["001537333100001"],"arxiv":["2408.07829 "]},"doi":"10.1103/qvls-7s3q","quality_controlled":"1","date_created":"2025-09-10T05:41:30Z","date_updated":"2026-09-24T10:13:38Z","author":[{"orcid":"0000-0001-5263-5559","first_name":"Soham","id":"FDE60288-A89D-11E9-947F-1AF6E5697425","last_name":"Mukhopadhyay","full_name":"Mukhopadhyay, Soham"},{"first_name":"Diego A","last_name":"Lancheros Naranjo","full_name":"Lancheros Naranjo, Diego A","id":"6c55e976-15b2-11ec-abd3-d790e8937fde"},{"full_name":"Senior, Jorden L","id":"5479D234-2D30-11EA-89CC-40953DDC885E","last_name":"Senior","first_name":"Jorden L","orcid":"0000-0002-0672-9295"},{"orcid":"0000-0003-2607-2363","first_name":"Andrew P","full_name":"Higginbotham, Andrew P","last_name":"Higginbotham","id":"4AD6785A-F248-11E8-B48F-1D18A9856A87"}],"ec_funded":1,"status":"public","publisher":"American Physical Society","abstract":[{"text":"We report relaxation oscillations in a one-dimensional array of Josephson junctions, wherein the array dynamically switches between low-current and high-current states. The oscillations are current-voltage dual to those ordinarily observed in single junctions. The current-voltage dual circuit quantitatively accounts for temporal dynamics of the array, including the dependence on biasing conditions. Injection locking of the oscillations results in well-developed current plateaux. A thermal model explains the self-consistent reduction of the superconducting gap due to overheating of the array in the high-current state. Our work suggests that overheating determines the switching from the high-current state to the low-current state.","lang":"eng"}],"file":[{"relation":"main_file","file_size":1370466,"date_updated":"2025-09-10T07:29:06Z","date_created":"2025-09-10T07:29:06Z","file_name":"2025_PhysReviewAppl_Mukhopadhyay.pdf","creator":"dernst","access_level":"open_access","checksum":"6cc3c9beeb7c0a88ee0a072c9a32b78b","file_id":"20335","success":1,"content_type":"application/pdf"}],"title":"Dual relaxation oscillations in a Josephson-junction array","acknowledgement":"We gratefully acknowledge support from the Miba Machine Shop and the Nanofabrictation Facility at IST Austria. This work was supported by the Austrian FWF under Grant No. P33692-N (S.M., J.S., and A.P.H.), the European Union’s Horizon 2020 research and innovation program under Marie Skłodowska-Curie Grant Agreement No. 754411 (J.S.), and a NOMIS Foundation research grant (A.P.H.).","OA_type":"hybrid","related_material":{"record":[{"relation":"earlier_version","id":"18057","status":"public"}]},"article_processing_charge":"Yes (via OA deal)","volume":24,"citation":{"chicago":"Mukhopadhyay, Soham, Diego A Lancheros Naranjo, Jorden L Senior, and Andrew P Higginbotham. “Dual Relaxation Oscillations in a Josephson-Junction Array.” <i>Physical Review Applied</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/qvls-7s3q\">https://doi.org/10.1103/qvls-7s3q</a>.","ieee":"S. Mukhopadhyay, D. A. Lancheros Naranjo, J. L. Senior, and A. P. Higginbotham, “Dual relaxation oscillations in a Josephson-junction array,” <i>Physical Review Applied</i>, vol. 24. American Physical Society, 2025.","ama":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. Dual relaxation oscillations in a Josephson-junction array. <i>Physical Review Applied</i>. 2025;24. doi:<a href=\"https://doi.org/10.1103/qvls-7s3q\">10.1103/qvls-7s3q</a>","apa":"Mukhopadhyay, S., Lancheros Naranjo, D. A., Senior, J. L., &#38; Higginbotham, A. P. (2025). Dual relaxation oscillations in a Josephson-junction array. <i>Physical Review Applied</i>. American Physical Society. <a href=\"https://doi.org/10.1103/qvls-7s3q\">https://doi.org/10.1103/qvls-7s3q</a>","mla":"Mukhopadhyay, Soham, et al. “Dual Relaxation Oscillations in a Josephson-Junction Array.” <i>Physical Review Applied</i>, vol. 24, 014035, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/qvls-7s3q\">10.1103/qvls-7s3q</a>.","short":"S. Mukhopadhyay, D.A. Lancheros Naranjo, J.L. Senior, A.P. Higginbotham, Physical Review Applied 24 (2025).","ista":"Mukhopadhyay S, Lancheros Naranjo DA, Senior JL, Higginbotham AP. 2025. Dual relaxation oscillations in a Josephson-junction array. Physical Review Applied. 24, 014035."},"language":[{"iso":"eng"}],"file_date_updated":"2025-09-10T07:29:06Z","day":"17","publication_identifier":{"issn":["2331-7019"]},"oa_version":"Published Version"},{"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).","related_material":{"record":[{"relation":"research_data","status":"public","id":"18697"},{"id":"18677","status":"public","relation":"earlier_version"}],"link":[{"relation":"press_release","url":"https://ista.ac.at/en/news/piecing-together-the-brain-puzzle/","description":"News on ISTA website"}]},"OA_type":"hybrid","title":"Light-microscopy-based connectomic reconstruction of mammalian brain tissue","file":[{"checksum":"ebc99d7108e728f46db0a009292675ef","file_id":"19959","success":1,"content_type":"application/pdf","file_size":133201290,"relation":"main_file","date_updated":"2025-07-03T06:55:20Z","date_created":"2025-07-03T06:55:20Z","file_name":"2025_Nature_Tavakoli.pdf","creator":"dernst","access_level":"open_access"}],"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."}],"article_processing_charge":"Yes (via OA deal)","language":[{"iso":"eng"}],"file_date_updated":"2025-07-03T06:55:20Z","citation":{"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>.","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.","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>","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>","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.","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."},"volume":642,"oa_version":"Published Version","publication_identifier":{"eissn":["1476-4687"],"issn":["0028-0836"]},"day":"12","quality_controlled":"1","doi":"10.1038/s41586-025-08985-1","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"ScienComp"},{"_id":"PreCl"},{"_id":"M-Shop"},{"_id":"E-Lib"}],"external_id":{"isi":["001483477000001"],"pmid":["40335689"]},"intvolume":"       642","OA_place":"publisher","corr_author":"1","department":[{"_id":"JoDa"},{"_id":"GradSch"},{"_id":"Bio"},{"_id":"GaNo"}],"ec_funded":1,"date_created":"2025-05-18T22:02:51Z","author":[{"id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","full_name":"Tavakoli, Mojtaba","last_name":"Tavakoli","first_name":"Mojtaba","orcid":"0000-0002-7667-6854"},{"first_name":"Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","last_name":"Lyudchik","full_name":"Lyudchik, Julia"},{"first_name":"Michał","last_name":"Januszewski","full_name":"Januszewski, Michał"},{"id":"7e146587-8972-11ed-ae7b-d7a32ea86a81","full_name":"Vistunou, Vitali","last_name":"Vistunou","first_name":"Vitali"},{"first_name":"Nathalie","id":"40E7F008-F248-11E8-B48F-1D18A9856A87","last_name":"Agudelo Duenas","full_name":"Agudelo Duenas, Nathalie"},{"orcid":"0009-0000-7590-3501","first_name":"Jakob","last_name":"Vorlaufer","id":"937696FA-C996-11E9-8C7C-CF13E6697425","full_name":"Vorlaufer, Jakob"},{"orcid":"0000-0003-1216-9105","first_name":"Christoph M","last_name":"Sommer","full_name":"Sommer, Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kreuzinger","full_name":"Kreuzinger, Caroline"},{"last_name":"Oliveira","id":"3B03AA1A-F248-11E8-B48F-1D18A9856A87","full_name":"Oliveira, Bárbara","first_name":"Bárbara"},{"first_name":"Alban","id":"9ac8f577-2357-11eb-997a-e566c5550886","last_name":"Cenameri","full_name":"Cenameri, Alban"},{"orcid":"0000-0002-7673-7178","first_name":"Gaia","full_name":"Novarino, Gaia","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Jain","full_name":"Jain, Viren","first_name":"Viren"},{"orcid":"0000-0001-8559-3973","first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","full_name":"Danzl, Johann G"}],"date_updated":"2026-10-02T09:59:44Z","status":"public","publisher":"Springer Nature","month":"06","isi":1,"PlanS_conform":"1","scopus_import":"1","article_type":"original","project":[{"grant_number":"26137","name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5"},{"grant_number":"665385","name":"International IST Doctoral Program","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"101044865","_id":"34ba8964-11ca-11ed-8bc3-e15864e7e9a6","name":"Toward an understanding of the brain interstitial system and the extracellular proteome in health and autism spectrum disorders"},{"name":"Molecular Drug Targets","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"W1232-B24"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"19704","pmid":1,"year":"2025","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","oa":1,"fulldoi":"https://doi.org/10.1038/s41586-025-08985-1","has_accepted_license":"1","publication":"Nature","type":"journal_article","ddc":["570"],"page":"398-410","date_published":"2025-06-12T00:00:00Z","publication_status":"published"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","fulldoi":"https://doi.org/10.15479/AT-ISTA-20811","oa":1,"has_accepted_license":"1","page":"95","ddc":["616","576","614","519"],"type":"dissertation","publication_status":"published","date_published":"2025-12-15T00:00:00Z","month":"12","tmp":{"short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png"},"_id":"20811","year":"2025","degree_awarded":"PhD","doi":"10.15479/AT-ISTA-20811","department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"FyKo"}],"corr_author":"1","OA_place":"publisher","date_created":"2025-12-12T14:39:56Z","author":[{"first_name":"Simon","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425","last_name":"Rella","full_name":"Rella, Simon"}],"date_updated":"2026-10-02T10:12:19Z","status":"public","publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"id":"9905","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"18307","status":"public"}]},"abstract":[{"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. ","lang":"eng"}],"file":[{"content_type":"application/pdf","success":1,"file_id":"20831","checksum":"a0bd7a585720e60df284101b8afdf6bb","access_level":"open_access","creator":"srella","date_created":"2025-12-16T21:49:52Z","date_updated":"2025-12-16T21:49:52Z","file_name":"2025_Rella_Simon_Thesis.pdf","file_size":29019662,"relation":"main_file"},{"relation":"source_file","file_size":42094025,"date_updated":"2025-12-16T21:52:19Z","file_name":"2025_Rella_Simon_Thesis_Sourcefiles.zip","creator":"srella","date_created":"2025-12-16T21:52:19Z","access_level":"open_access","file_id":"20832","checksum":"b8b3a90932ae1d96d307838710f46e32","content_type":"application/zip"}],"title":"Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation","doi_confirm":"1","supervisor":[{"orcid":"0000-0002-6699-1455","first_name":"Gašper","last_name":"Tkačik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"first_name":"Fyodor","last_name":"Kondrashov","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor","orcid":"0000-0001-8243-4694"}],"article_processing_charge":"No","alternative_title":["ISTA Thesis"],"file_date_updated":"2025-12-16T21:52:19Z","language":[{"iso":"eng"}],"citation":{"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>.","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>","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.","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>.","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."},"day":"15","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version"},{"status":"public","publisher":"Institute of Science and Technology Austria","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"doi":"10.15479/AT:ISTA:18886","department":[{"_id":"GeKa"},{"_id":"GradSch"}],"corr_author":"1","OA_place":"repository","date_updated":"2026-10-02T11:05:09Z","author":[{"orcid":"0009-0003-9037-8831","first_name":"Marian","id":"396A1950-F248-11E8-B48F-1D18A9856A87","last_name":"Janik","full_name":"Janik, Marian"}],"date_created":"2025-01-27T09:48:44Z","file_date_updated":"2025-01-27T11:27:35Z","citation":{"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>.","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>","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>.","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.","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>.","short":"M. Janik, (2025).","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>"},"day":"27","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"19401","relation":"used_in_publication"},{"status":"public","id":"18144","relation":"used_in_publication"}]},"OA_type":"gold","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.","abstract":[{"lang":"eng","text":"Research Data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'"}],"file":[{"relation":"main_file","file_size":1017,"date_created":"2025-01-27T11:27:30Z","creator":"arashid","date_updated":"2025-01-27T11:27:30Z","file_name":"readme.txt","access_level":"open_access","file_id":"18893","checksum":"977dffed4bec3c7d6315aa1cbd19e8a7","success":1,"content_type":"text/plain"},{"date_updated":"2025-01-27T11:27:35Z","creator":"arashid","date_created":"2025-01-27T11:27:35Z","file_name":"research_data.zip","access_level":"open_access","relation":"main_file","file_size":33815056,"success":1,"content_type":"application/zip","file_id":"18894","checksum":"7ab5e3e65ddf59bbf3622ace8a0cda1c"}],"title":"Research data for publication 'Strong charge-photon coupling in planar germanium enabled by granular aluminium superinductors'","article_processing_charge":"No","has_accepted_license":"1","type":"research_data","ddc":["530"],"date_published":"2025-01-27T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.15479/AT:ISTA:18886","oa":1,"contributor":[{"first_name":"Kevin Etienne Robert","last_name":"Roux","id":"53f93ea2-803f-11ed-ab7e-b283135794ef","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Carla N","last_name":"Borja Espinosa","id":"18777c01-896a-11ed-bdf8-e4851dc07d16"},{"contributor_type":"researcher","first_name":"Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","last_name":"Sagi"},{"contributor_type":"researcher","first_name":"Abdulhamid","last_name":"Baghdadi","id":"160D87FA-96B5-11E9-BF77-7626E6697425"},{"first_name":"Thomas","last_name":"Adletzberger","id":"38756BB2-F248-11E8-B48F-1D18A9856A87","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Stefano","last_name":"Calcaterra"},{"last_name":"Botifoll","first_name":"Marc","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Alba Garzón","last_name":"Manjón"},{"last_name":"Arbiol","first_name":"Jordi","contributor_type":"researcher"},{"last_name":"Chrastina","first_name":"Daniel","contributor_type":"researcher"},{"contributor_type":"researcher","first_name":"Giovanni","last_name":"Isella"},{"contributor_type":"researcher","last_name":"Pop","first_name":"Ioan M."},{"contributor_type":"researcher","orcid":"0000-0001-8342-202X","last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios"}],"_id":"18886","year":"2025","month":"01","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452","name":"Integrated Germanium Quantum Technology","grant_number":"101069515"},{"grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","name":"Towards scalable hut wire quantum devices","call_identifier":"FWF"},{"grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a"},{"grant_number":"I05060","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","name":"High impedance circuit quantum electrodynamics with hole spins"}]},{"article_processing_charge":"No","supervisor":[{"id":"49876194-F248-11E8-B48F-1D18A9856A87","last_name":"Bickel","full_name":"Bickel, Bernd","first_name":"Bernd","orcid":"0000-0001-6511-9385"}],"related_material":{"record":[{"id":"13049","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"20286","status":"public"},{"id":"18565","status":"public","relation":"part_of_dissertation"}]},"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","title":"Design and control of deformable structures: From PCB lighting displays to elastomer robots","doi_confirm":"1","file":[{"file_size":161436245,"relation":"main_file","date_created":"2025-09-03T10:40:52Z","creator":"mbhargav","date_updated":"2025-09-03T10:40:52Z","file_name":"2025-Bhargava-Manas-Thesis.pdf","access_level":"open_access","checksum":"5baf8ca46c86a94fc8380ff1007aabd4","file_id":"20284","success":1,"content_type":"application/pdf"},{"file_size":198831315,"relation":"source_file","date_updated":"2025-09-04T09:22:29Z","file_name":"manas_phd_thesis_source_files.zip","date_created":"2025-09-03T13:18:05Z","creator":"mbhargav","access_level":"closed","checksum":"66878fafbc0074f88ddd18f24a9fc647","file_id":"20285","content_type":"application/x-zip-compressed"}],"abstract":[{"lang":"eng","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."}],"publication_identifier":{"isbn":["978-3-99078-065-7"],"issn":["2663-337X"]},"oa_version":"Published Version","day":"02","file_date_updated":"2025-09-04T09:22:29Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"citation":{"ista":"Bhargava M. 2025. Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.","short":"M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.","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>.","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>","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>","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>.","ieee":"M. Bhargava, “Design and control of deformable structures: From PCB lighting displays to elastomer robots,” Institute of Science and Technology Austria, 2025."},"date_created":"2025-09-02T14:48:39Z","date_updated":"2026-10-02T11:13:08Z","ec_funded":1,"author":[{"first_name":"Manas","full_name":"Bhargava, Manas","last_name":"Bhargava","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","orcid":"0009-0007-6138-6890"}],"doi":"10.15479/AT-ISTA-20276","OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"corr_author":"1","publisher":"Institute of Science and Technology Austria","status":"public","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767"}],"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"month":"09","year":"2025","degree_awarded":"PhD","_id":"20276","fulldoi":"https://doi.org/10.15479/AT-ISTA-20276","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","ddc":["000"],"type":"dissertation","page":"96","date_published":"2025-09-02T00:00:00Z","publication_status":"published","has_accepted_license":"1"},{"has_accepted_license":"1","publication":"Computer Graphics Forum","arxiv":1,"publication_status":"published","date_published":"2025-02-01T00:00:00Z","type":"journal_article","ddc":["006"],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"fulldoi":"https://doi.org/10.1111/cgf.15269","issue":"1","_id":"18565","year":"2025","article_number":"e15269","article_type":"original","scopus_import":"1","isi":1,"month":"02","keyword":["fabrication","single patch unfolding","mesh simplification"],"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"status":"public","researchdata_availability":"no","publisher":"Wiley","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"BeBi"}],"intvolume":"        44","OA_place":"publisher","external_id":{"arxiv":["2408.06944"],"isi":["001357046100001"]},"doi":"10.1111/cgf.15269","quality_controlled":"1","date_updated":"2026-10-02T11:13:08Z","author":[{"first_name":"Manas","full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","last_name":"Bhargava","orcid":"0009-0007-6138-6890"},{"first_name":"Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87","full_name":"Schreck, Camille","last_name":"Schreck"},{"first_name":"M.","full_name":"Freire, M.","last_name":"Freire"},{"full_name":"Hugron, P. A.","last_name":"Hugron","first_name":"P. A."},{"full_name":"Lefebvre, S.","last_name":"Lefebvre","first_name":"S."},{"full_name":"Sellán, S.","last_name":"Sellán","first_name":"S."},{"orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2024-11-19T09:14:32Z","volume":44,"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.","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>.","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025.","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>","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>.","short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025)."},"language":[{"iso":"eng"}],"file_date_updated":"2025-04-16T09:06:45Z","day":"01","oa_version":"Published Version","publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"abstract":[{"lang":"eng","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."}],"file":[{"content_type":"video/mp4","success":1,"checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","file_id":"18567","access_level":"open_access","creator":"mbhargav","date_updated":"2024-11-19T09:23:20Z","file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","date_created":"2024-11-19T09:23:20Z","file_size":36999751,"relation":"main_file"},{"checksum":"efb06b01bae37f470954601bc004374d","file_id":"19576","success":1,"content_type":"application/pdf","file_size":5188265,"relation":"main_file","date_created":"2025-04-16T09:06:45Z","file_name":"2025_CompGraphicsForum_Bhargava.pdf","date_updated":"2025-04-16T09:06:45Z","creator":"dernst","access_level":"open_access"}],"title":"Mesh simplification for unfolding","supplementarymaterial":"yes","OA_type":"hybrid","related_material":{"record":[{"relation":"dissertation_contains","id":"20276","status":"public"}]},"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.","das_tickbox":"0","article_processing_charge":"Yes (via OA deal)"},{"date_updated":"2026-10-02T11:16:04Z","date_created":"2025-05-28T16:20:48Z","author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach","first_name":"Bernd"}],"doi":"10.15479/10.15479/at-ista-19759","OA_place":"publisher","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.","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publisher":"Institute of Science and Technology Austria","status":"public","article_processing_charge":"No","supervisor":[{"orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert"}],"related_material":{"record":[{"id":"15039","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"11839"},{"relation":"part_of_dissertation","id":"18874","status":"public"},{"status":"public","id":"17426","relation":"part_of_dissertation"}]},"title":"Robust image classification with 1-Lipschitz networks","doi_confirm":"1","abstract":[{"lang":"eng","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"}],"file":[{"content_type":"application/pdf","file_id":"19829","checksum":"e5108e759014e2a9020c973c778fafc9","date_created":"2025-06-10T18:11:05Z","date_updated":"2025-06-10T18:11:05Z","file_name":"ThesisFinal.pdf","creator":"bprach","access_level":"open_access","file_size":3578077,"relation":"main_file"},{"checksum":"51bf6c11fb6d8a9f8010b458c600a83f","file_id":"19830","content_type":"application/x-zip-compressed","file_size":74894357,"relation":"source_file","access_level":"closed","date_created":"2025-06-10T18:14:03Z","file_name":"ThesisFinal.zip","creator":"bprach","date_updated":"2025-06-10T18:14:03Z"}],"oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"day":"30","file_date_updated":"2025-06-10T18:14:03Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"citation":{"ista":"Prach B. 2025. Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria.","ieee":"B. Prach, “Robust image classification with 1-Lipschitz networks,” Institute of Science and Technology Austria, 2025.","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>.","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>","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>","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>.","short":"B. Prach, Robust Image Classification with 1-Lipschitz Networks, Institute of Science and Technology Austria, 2025."},"fulldoi":"https://doi.org/10.15479/10.15479/at-ista-19759","oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","type":"dissertation","ddc":["000"],"page":"84","date_published":"2025-05-30T00:00:00Z","publication_status":"published","has_accepted_license":"1","month":"05","year":"2025","degree_awarded":"PhD","_id":"19759"},{"oa":1,"fulldoi":"https://doi.org/10.15479/AT-ISTA-19630","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publication_status":"published","date_published":"2025-04-29T00:00:00Z","page":"106","ddc":["519","006"],"type":"dissertation","has_accepted_license":"1","project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"},{"grant_number":"101045083","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088"},{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"638176"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","grant_number":"I02979-N35"}],"month":"04","degree_awarded":"PhD","year":"2025","_id":"19630","ec_funded":1,"date_created":"2025-04-29T09:39:34Z","author":[{"first_name":"Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","full_name":"Synak, Peter","last_name":"Synak"}],"date_updated":"2026-10-02T11:19:03Z","corr_author":"1","department":[{"_id":"ChWo"},{"_id":"GradSch"}],"OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"doi":"10.15479/AT-ISTA-19630","publisher":"Institute of Science and Technology Austria","status":"public","supervisor":[{"orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","abstract":[{"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.","lang":"eng"}],"file":[{"relation":"source_file","file_size":60670543,"access_level":"closed","creator":"cchlebak","date_updated":"2025-04-30T14:02:25Z","file_name":"Thesis_source_Heiss_Synak.zip","date_created":"2025-04-30T14:02:25Z","file_id":"19633","checksum":"f00b519c27529daa0c3b2d4102b4fa7b","content_type":"application/x-zip-compressed"},{"access_level":"open_access","date_updated":"2025-04-30T15:49:16Z","file_name":"Thesis_PDFA_Heiss_Synak.pdf","date_created":"2025-04-30T14:02:42Z","creator":"cchlebak","relation":"main_file","file_size":21319043,"content_type":"application/pdf","checksum":"6e40a2fd3b1b881af1385670854a682e","file_id":"19634"}],"title":"Methods for fluid simulation, surface tracking, and statistics of non-manifold structures","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.","related_material":{"record":[{"id":"8135","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"8384"},{"relation":"part_of_dissertation","id":"17219","status":"public"}]},"day":"29","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","citation":{"ista":"Synak P. 2025. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria.","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>","short":"P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025.","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>.","ieee":"P. Synak, “Methods for fluid simulation, surface tracking, and statistics of non-manifold structures,” Institute of Science and Technology Austria, 2025.","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>.","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>"},"alternative_title":["ISTA Thesis"],"file_date_updated":"2025-04-30T15:49:16Z","language":[{"iso":"eng"}]},{"publisher":"Institute of Science and Technology Austria","status":"public","date_created":"2025-10-27T10:28:52Z","date_updated":"2026-10-02T11:17:04Z","author":[{"orcid":"0000-0002-3121-3100","first_name":"Sadashige","last_name":"Ishida","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425"}],"ec_funded":1,"corr_author":"1","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"OA_place":"publisher","acknowledged_ssus":[{"_id":"CampIT"}],"doi":"10.15479/AT-ISTA-20551","day":"31","publication_identifier":{"isbn":["978-3-99078-070-1"],"issn":["2663-337X"]},"oa_version":"Published Version","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>","ieee":"S. Ishida, “Symplectic-prequantum structures and dynamics on the codimension-2 shape space,” Institute of Science and Technology Austria, 2025.","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.","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>"},"alternative_title":["ISTA Thesis"],"file_date_updated":"2025-11-10T08:45:05Z","language":[{"iso":"eng"}],"supervisor":[{"orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","last_name":"Wojtan","first_name":"Christopher J"},{"first_name":"Albert","last_name":"Chern","full_name":"Chern, Albert"}],"article_processing_charge":"No","abstract":[{"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. ","lang":"eng"}],"file":[{"content_type":"application/zip","checksum":"4eef80afcb67691cbb6549c4756fa534","file_id":"20583","file_name":"Thesis_tex.zip","creator":"sishida","date_updated":"2025-11-01T18:26:14Z","date_created":"2025-11-01T18:26:14Z","access_level":"open_access","relation":"source_file","file_size":72487812},{"access_level":"open_access","date_created":"2025-11-10T08:45:05Z","date_updated":"2025-11-10T08:45:05Z","creator":"sishida","file_name":"Thesis_Sadashige_Ishida_PDFA.pdf","relation":"main_file","file_size":8945141,"content_type":"application/pdf","success":1,"checksum":"1e5a557900bf2dce01966b211b15d0fe","file_id":"20623"}],"title":"Symplectic-prequantum structures and dynamics on the codimension-2 shape space","related_material":{"record":[{"id":"12431","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"20580","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"17361"},{"status":"public","id":"12846","relation":"part_of_dissertation"}]},"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.","publication_status":"published","date_published":"2025-10-31T00:00:00Z","page":"141","type":"dissertation","ddc":["516"],"has_accepted_license":"1","oa":1,"fulldoi":"https://doi.org/10.15479/AT-ISTA-20551","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","year":"2025","_id":"20551","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"638176","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","call_identifier":"H2020"},{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"month":"10"},{"date_updated":"2026-10-02T11:30:08Z","date_created":"2025-08-27T14:00:13Z","ec_funded":1,"author":[{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta"}],"doi":"10.15479/AT-ISTA-20234","OA_place":"publisher","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"publisher":"Institute of Science and Technology Austria","status":"public","article_processing_charge":"No","supervisor":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"9311"},{"status":"public","id":"19508","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"17037","status":"public"},{"relation":"part_of_dissertation","id":"18266","status":"public"}]},"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","title":"Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games","doi_confirm":"1","file":[{"date_created":"2025-08-28T14:47:07Z","date_updated":"2025-08-28T14:47:07Z","creator":"rsaonaur","file_name":"2025_Saona_Raimundo_Thesis.pdf","access_level":"open_access","file_size":1503623,"relation":"main_file","success":1,"content_type":"application/pdf","file_id":"20240","checksum":"394a651f7de7085e509ef856ffe7bd97"},{"content_type":"application/zip","file_id":"20241","checksum":"09fb2633e66aac80433d373f4180c5b4","date_created":"2025-08-28T14:47:12Z","creator":"rsaonaur","file_name":"2025_Saona_Raimundo_Thesis.zip","date_updated":"2025-08-28T14:47:12Z","access_level":"closed","relation":"source_file","file_size":622747}],"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."}],"oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"day":"27","file_date_updated":"2025-08-28T14:47:12Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"citation":{"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>.","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.","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>","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>","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.","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>.","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."},"fulldoi":"https://doi.org/10.15479/AT-ISTA-20234","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["519"],"type":"dissertation","page":"125","date_published":"2025-08-27T00:00:00Z","publication_status":"published","has_accepted_license":"1","project":[{"grant_number":"S11407","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"month":"08","year":"2025","degree_awarded":"PhD","_id":"20234"},{"fulldoi":"https://doi.org/10.1287/moor.2023.0297","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"482-505","type":"journal_article","publication_status":"published","date_published":"2025-02-01T00:00:00Z","publication":"Mathematics of Operations Research","project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"month":"02","isi":1,"article_type":"original","scopus_import":"1","year":"2025","_id":"17037","issue":"1","date_created":"2024-05-22T11:41:14Z","ec_funded":1,"date_updated":"2026-10-02T11:29:44Z","author":[{"last_name":"Attia","full_name":"Attia, Luc","first_name":"Luc"},{"first_name":"Miquel","full_name":"Oliu-Barton, Miquel","last_name":"Oliu-Barton"},{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J"}],"external_id":{"isi":["001184648000001"]},"quality_controlled":"1","doi":"10.1287/moor.2023.0297","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"intvolume":"        50","publisher":"Institute for Operations Research and the Management Sciences","researchdata_availability":"unclear","status":"public","article_processing_charge":"No","das_tickbox":"0","supplementarymaterial":"unclear","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20234"}]},"OA_type":"closed access","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].","abstract":[{"lang":"eng","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."}],"title":"Marginal values of a stochastic game","day":"01","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"oa_version":"None","language":[{"iso":"eng"}],"volume":50,"citation":{"ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","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>","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.","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>.","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>.","short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 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>"}},{"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","fulldoi":"https://doi.org/10.15479/at:ista:19048","oa":1,"has_accepted_license":"1","ddc":["539","535","541"],"type":"dissertation","page":"86","date_published":"2025-02-18T00:00:00Z","publication_status":"published","month":"02","project":[{"name":"Angulon: physics and applications of a new quasiparticle","_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"801770"},{"grant_number":"F100403","_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions"}],"tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"_id":"19048","year":"2025","degree_awarded":"PhD","doi":"10.15479/at:ista:19048","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"E-Lib"},{"_id":"SSU"}],"OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"corr_author":"1","date_created":"2025-02-18T01:41:27Z","author":[{"orcid":"0000-0003-4074-2570","last_name":"Maslov","full_name":"Maslov, Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"ec_funded":1,"date_updated":"2026-10-02T11:36:24Z","status":"public","publisher":"Institute of Science and Technology Austria","related_material":{"record":[{"relation":"part_of_dissertation","id":"10845","status":"public"},{"id":"7933","status":"public","relation":"part_of_dissertation"},{"id":"18087","status":"public","relation":"part_of_dissertation"}]},"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.","title":"Emergent physics of rotating quantum impurities in many-body environments","file":[{"file_size":7779825,"relation":"main_file","creator":"mmaslov","date_created":"2025-02-18T14:25:59Z","file_name":"thesis_Maslov.pdf","date_updated":"2025-02-18T14:25:59Z","access_level":"open_access","file_id":"19061","checksum":"5822a4dd31724c512b37c658af1787ab","content_type":"application/pdf"},{"content_type":"application/zip","checksum":"89bdce4774406d26ceca88a8bbcd6a9a","file_id":"19062","file_name":"thesis_Maslov_source.zip","date_updated":"2025-02-18T14:25:59Z","date_created":"2025-02-18T14:25:59Z","creator":"mmaslov","access_level":"open_access","relation":"source_file","file_size":14453726}],"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"}],"article_processing_charge":"No","supervisor":[{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","orcid":"0000-0002-6990-7802"}],"language":[{"iso":"eng"}],"file_date_updated":"2025-02-18T14:25:59Z","alternative_title":["ISTA Thesis"],"citation":{"ista":"Maslov M. 2025. Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria.","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>","ieee":"M. Maslov, “Emergent physics of rotating quantum impurities in many-body environments,” Institute of Science and Technology Austria, 2025.","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>.","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>.","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>"},"publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","day":"18"},{"doi":"10.15479/AT-ISTA-20147","OA_place":"publisher","corr_author":"1","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.","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"date_created":"2025-08-07T15:57:57Z","ec_funded":1,"date_updated":"2026-10-02T11:44:51Z","author":[{"first_name":"Naci E","full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"status":"public","publisher":"Institute of Science and Technology Austria","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","related_material":{"record":[{"id":"11775","status":"public","relation":"part_of_dissertation"},{"status":"deleted","id":"13140","relation":"part_of_dissertation"},{"status":"public","id":"19741","relation":"part_of_dissertation"},{"id":"19643","status":"deleted","relation":"part_of_dissertation"},{"id":"13221","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"9356","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20342"},{"relation":"part_of_dissertation","status":"public","id":"17634"}]},"title":"A monitoring-oriented theory and classification of quantitative specifications","doi_confirm":"1","file":[{"content_type":"application/x-zip-compressed","file_id":"20200","checksum":"0f3015f1db36576a23d8d669afb60b41","date_updated":"2025-09-10T08:19:51Z","date_created":"2025-08-21T09:40:28Z","creator":"esarac","file_name":"2025_Sarac_NaciEge_Thesis.zip","access_level":"closed","relation":"source_file","file_size":8884801},{"creator":"esarac","file_name":"2025_Sarac_NaciEge_Thesis.pdf","date_updated":"2025-08-21T09:40:34Z","date_created":"2025-08-21T09:40:34Z","access_level":"open_access","file_size":2955584,"relation":"main_file","success":1,"content_type":"application/pdf","checksum":"332ed2fe61f580641664ec3f05d30f14","file_id":"20201"}],"abstract":[{"lang":"eng","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"}],"article_processing_charge":"No","supervisor":[{"orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A"}],"file_date_updated":"2025-09-10T08:19:51Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"citation":{"ista":"Sarac NE. 2025. A monitoring-oriented theory and classification of quantitative specifications. Institute of Science and Technology Austria.","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>.","short":"N.E. Sarac, A Monitoring-Oriented Theory and Classification of Quantitative Specifications, Institute of Science and Technology Austria, 2025.","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>","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>","ieee":"N. E. Sarac, “A monitoring-oriented theory and classification of quantitative specifications,” Institute of Science and Technology Austria, 2025.","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>."},"oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"day":"07","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","oa":1,"fulldoi":"https://doi.org/10.15479/AT-ISTA-20147","has_accepted_license":"1","ddc":["000"],"type":"dissertation","page":"149","date_published":"2025-08-07T00:00:00Z","publication_status":"published","month":"08","project":[{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"},{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"_id":"20147","year":"2025","degree_awarded":"PhD"},{"publication":"Mathematical Programming","has_accepted_license":"1","arxiv":1,"publication_status":"published","date_published":"2025-01-01T00:00:00Z","page":"279-322","ddc":["004"],"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"fulldoi":"https://doi.org/10.1007/s10107-024-02064-5","_id":"10045","year":"2025","scopus_import":"1","article_type":"original","month":"01","isi":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"],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","publisher":"Springer Nature","researchdata_availability":"no","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"corr_author":"1","OA_place":"publisher","intvolume":"       209","external_id":{"isi":["001176563300001"],"arxiv":["2109.10203"]},"quality_controlled":"1","doi":"10.1007/s10107-024-02064-5","author":[{"first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X"},{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2026-10-02T11:45:16Z","date_created":"2021-09-27T10:48:23Z","volume":209,"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>.","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>","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>","short":"M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322.","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>.","ista":"Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 209, 279–322."},"file_date_updated":"2025-04-16T09:36:08Z","language":[{"iso":"eng"}],"day":"01","oa_version":"Published Version","publication_identifier":{"eissn":["1436-4646"],"issn":["0025-5610"]},"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"}],"file":[{"checksum":"25d9bd490719b45eca84f4d93a06c69f","file_id":"19578","content_type":"application/pdf","success":1,"relation":"main_file","file_size":839510,"access_level":"open_access","date_updated":"2025-04-16T09:36:08Z","creator":"dernst","date_created":"2025-04-16T09:36:08Z","file_name":"2025_MathProgramming_Dvorak.pdf"}],"title":"Generalized minimum 0-extension problem and discrete convexity","supplementarymaterial":"no","OA_type":"hybrid","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).","das_tickbox":"0","article_processing_charge":"Yes (via OA deal)"},{"date_published":"2025-02-03T00:00:00Z","publication_status":"published","type":"dissertation","ddc":["514","004"],"page":"140","has_accepted_license":"1","oa":1,"fulldoi":"https://doi.org/10.15479/at:ista:18979","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","year":"2025","_id":"18979","keyword":["topological data analysis","chromatic point set","alpha complex","persistent homology","six pack","sheaf","microlocal discrete Morse","injective resolution","collapse","knot","discrete Morse theory"],"project":[{"grant_number":"I02979-N35","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"call_identifier":"FWF","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342"}],"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"month":"02","publisher":"Institute of Science and Technology Austria","status":"public","author":[{"first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","full_name":"Draganov, Ondrej","last_name":"Draganov","orcid":"0000-0003-0464-3823"}],"date_updated":"2026-10-02T11:57:00Z","date_created":"2025-01-31T17:04:40Z","OA_place":"publisher","corr_author":"1","department":[{"_id":"GradSch"},{"_id":"HeEd"}],"doi":"10.15479/at:ista:18979","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","day":"03","citation":{"ista":"Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria.","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>.","short":"O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025.","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>","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>","ieee":"O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025.","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>."},"file_date_updated":"2025-02-04T16:22:07Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"article_processing_charge":"No","supervisor":[{"last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833"}],"title":"Structures and computations in topological data analysis","file":[{"content_type":"application/zip","file_id":"18983","checksum":"af6567e5d35e5eb330b8925ae37f1998","file_name":"Thesis.zip","date_updated":"2025-01-31T16:58:30Z","creator":"odragano","date_created":"2025-01-31T16:58:30Z","access_level":"closed","file_size":11899491,"relation":"source_file"},{"file_id":"19000","checksum":"c3fef68e35b9dc2020b2ca6006da6343","content_type":"application/pdf","file_size":8857514,"relation":"main_file","access_level":"open_access","date_updated":"2025-02-04T16:22:07Z","creator":"odragano","file_name":"Thesis.pdf","date_created":"2025-02-04T16:22:07Z"}],"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"}],"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","related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"15091"},{"relation":"part_of_dissertation","status":"public","id":"18981"}]}},{"day":"09","oa_version":"Published Version","publication_identifier":{"isbn":["9783959774062"]},"conference":{"name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","end_date":"2025-12-19","location":"Pilani, India","start_date":"2025-12-17"},"alternative_title":["LIPIcs"],"language":[{"iso":"eng"}],"file_date_updated":"2026-02-18T09:13:25Z","volume":360,"citation":{"ista":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria in multi-player stochastic graph games. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 9:1-9:17.","apa":"Asadi, A., Brice, L., Chatterjee, K., &#38; Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>","mla":"Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>.","short":"A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.","chicago":"Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>.","ieee":"A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 9:1-9:17.","ama":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>"},"article_processing_charge":"Yes","acknowledgement":"This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"23079"}]},"OA_type":"gold","file":[{"file_id":"21316","checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","content_type":"application/pdf","success":1,"file_size":1054007,"relation":"main_file","access_level":"open_access","file_name":"2025_FSTTCS_Asadi.pdf","date_updated":"2026-02-18T09:13:25Z","date_created":"2026-02-18T09:13:25Z","creator":"dernst"}],"abstract":[{"lang":"eng","text":"A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.\r\nThe problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. \r\nWe further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small."}],"title":"ε-stationary Nash equilibria in multi-player stochastic graph games","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","status":"public","author":[{"full_name":"Asadi, Ali","last_name":"Asadi","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","first_name":"Ali"},{"last_name":"Brice","full_name":"Brice, Leonard","first_name":"Leonard"},{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","full_name":"Thejaswini, K. S.","last_name":"Thejaswini","first_name":"K. S."}],"date_created":"2026-02-17T08:27:14Z","date_updated":"2026-10-12T13:38:13Z","ec_funded":1,"external_id":{"arxiv":["2508.15356"]},"doi":"10.4230/lipics.fsttcs.2025.9","quality_controlled":"1","corr_author":"1","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"OA_place":"publisher","intvolume":"       360","year":"2025","_id":"21281","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"month":"12","page":"9:1-9:17","ddc":["000"],"type":"conference","publication_status":"published","date_published":"2025-12-09T00:00:00Z","has_accepted_license":"1","publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","arxiv":1,"fulldoi":"https://doi.org/10.4230/lipics.fsttcs.2025.9","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"month":"03","_id":"19395","degree_awarded":"PhD","year":"2025","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","fulldoi":"https://doi.org/10.15479/AT-ISTA-19395","oa":1,"has_accepted_license":"1","date_published":"2025-03-13T00:00:00Z","publication_status":"published","ddc":["580"],"type":"dissertation","page":"160","title":"Cell-surface auxin signaling: Linking molecular pathways to plant development","doi_confirm":"1","file":[{"access_level":"open_access","creator":"amonzer","file_name":"Final Thesis Aline Monzer.pdf","date_created":"2025-03-12T14:14:49Z","date_updated":"2025-03-12T14:14:49Z","relation":"main_file","file_size":13119670,"content_type":"application/pdf","success":1,"checksum":"9a3dd03bb4ec6b9907a325c3c4e8a1d7","file_id":"19396"},{"relation":"source_file","file_size":13774837,"access_level":"closed","file_name":"Thesis Aline.docx","date_updated":"2025-04-01T07:55:27Z","date_created":"2025-03-12T14:15:19Z","creator":"amonzer","checksum":"a353ce1ee2eabce37bca35499e76dbf1","file_id":"19397","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document"}],"abstract":[{"lang":"eng","text":"Plant growth and development rely significantly on phytohormones, with auxin serving as a master regulator, orchestrating processes from embryogenesis to organogenesis, vascular patterning, and environmental adaptation. Since its conceptual proposition by Charles Darwin in 1880 as an endogenous chemical signal influencing phototropism in grass, auxin has captivated scientists seeking to understand how such a small molecule exerts a profound influence on plant development.\r\nOne particularly fascinating aspect of auxin function is its ability to self-organize its transport. Through a feedback mechanism between auxin perception and directional transport—primarily mediated by PIN auxin transporters—auxin establishes narrow transport channels. This phenomenon, known as auxin canalization, is fundamental to vascular formation, regeneration, and other key developmental processes. Despite advances in our understanding, driven by experimental studies and computational models, auxin canalization remains an enigma, with many unanswered questions.\r\nLike other hormones, auxin functions through intricate signaling pathways. It operates through at least two distinct signaling mechanisms: the well-characterized canonical pathway and the less understood non-canonical pathway. While significant progress has been made in elucidating the canonical pathway, the non-canonical mechanisms remain less defined and require further investigation.\r\nIn this study, we revisit the non-canonical auxin signaling pathway mediated by the cell-surface complex Auxin Binding Protein 1-Transmembrane Kinase 1 (ABP1-TMK1), with a particular focus on its downstream phosphorylation events. We reveal that this auxin-mediated phosphorylation is conserved across the green lineage, underscoring its fundamental role in plant development. We explore key phosphorylation targets, particularly PIN2, which is essential for root gravitropism. To further understand TMK1’s role in diverse developmental processes, we identified and investigated its interactors as potential co-receptors or regulatory components within its signaling network.\r\nGiven the previously established role of ABP1-TMK1 in auxin canalization, we sought to further investigate this process and identified several TMK1 interactors also involved in this intricate mechanism.\r\nThese findings provide new insights into the complex regulation of auxin canalization, highlighting a broader and more interconnected signaling framework than previously understood."}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"12291"},{"relation":"part_of_dissertation","id":"19399","status":"public"},{"id":"19398","status":"public","relation":"part_of_dissertation"},{"status":"public","id":"14826","relation":"part_of_dissertation"}]},"acknowledgement":"I would like to acknowledge the facilities at ISTA, particularly LSF, IOF, and, of course, the plant facility, for providing the necessary resources for my research.","article_processing_charge":"No","supervisor":[{"full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"}],"citation":{"ista":"Monzer A. 2025. Cell-surface auxin signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria.","chicago":"Monzer, Aline. “Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19395\">https://doi.org/10.15479/AT-ISTA-19395</a>.","ieee":"A. Monzer, “Cell-surface auxin signaling: Linking molecular pathways to plant development,” Institute of Science and Technology Austria, 2025.","ama":"Monzer A. Cell-surface auxin signaling: Linking molecular pathways to plant development. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19395\">10.15479/AT-ISTA-19395</a>","apa":"Monzer, A. (2025). <i>Cell-surface auxin signaling: Linking molecular pathways to plant development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19395\">https://doi.org/10.15479/AT-ISTA-19395</a>","mla":"Monzer, Aline. <i>Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19395\">10.15479/AT-ISTA-19395</a>.","short":"A. Monzer, Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development, Institute of Science and Technology Austria, 2025."},"language":[{"iso":"eng"}],"file_date_updated":"2025-04-01T07:55:27Z","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","publication_identifier":{"eissn":["2663-337X"],"eisbn":["978-3-99078-054-1"]},"day":"13","OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"corr_author":"1","doi":"10.15479/AT-ISTA-19395","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"author":[{"first_name":"Aline","id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","full_name":"Monzer, Aline","last_name":"Monzer"}],"date_created":"2025-03-12T14:25:42Z","date_updated":"2026-10-15T08:06:16Z","status":"public","publisher":"Institute of Science and Technology Austria"},{"date_created":"2025-06-25T13:50:10Z","author":[{"orcid":"0009-0001-5009-4987","first_name":"Valentin","last_name":"Hübner","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","full_name":"Hübner, Valentin"}],"date_updated":"2026-10-15T10:10:25Z","ec_funded":1,"OA_place":"publisher","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"corr_author":"1","doi":"10.15479/AT-ISTA-19903","publisher":"Institute of Science and Technology Austria","status":"public","article_processing_charge":"No","supervisor":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"}],"doi_confirm":"1","title":"Reciprocity and inequality in social dilemmas","file":[{"file_size":6192760,"relation":"source_file","access_level":"closed","date_created":"2025-06-25T13:38:07Z","creator":"vhuebner","date_updated":"2025-06-25T13:38:07Z","file_name":"Thesis Valentin Hübner source.tar.xz","file_id":"19905","checksum":"794c02f8c82ca59ba6dda3bd7eed871a","content_type":"application/x-xz"},{"relation":"main_file","file_size":4837864,"date_created":"2025-07-09T13:37:00Z","file_name":"Thesis Valentin Hübner.pdf","creator":"vhuebner","date_updated":"2025-07-09T13:37:00Z","access_level":"open_access","file_id":"19976","checksum":"ac56063d81c81e40322b6ff5a8c4912e","content_type":"application/pdf"}],"abstract":[{"lang":"eng","text":"Cooperation, that is, one person paying a cost for another's benefit, is a fundamental principle without which no form of society could exist. The extent to which humans cooperate with each other is also an essential feature that differentiates them from other animals. Cooperation occurs even in the absence of altruistic motivations, when it is selfishly incentivised by the expectation of a future reward. For example, many economic interactions are well described that way. This kind of cooperation requires that people exhibit reciprocal behaviour that acts as a mechanism that rewards cooperation.\r\nWith game-theoretic models, it is possible to formally study potential such mechanisms and under what conditions they can exist. This thesis contributes to this effort by analysing recently introduced models of cooperation that advance on previous work by taking into account the potential for pre-existing inequality among cooperating individuals as well as the different forms that reciprocity can take.\r\nIndividuals may differ both intrinsically, in their abilities, as well as extrinsically, in the amount of resources they have available. Allowing for such differences in a model of cooperation helps to understand how inequality affects the potential for, and outcomes of, cooperation among unequals. In this thesis, it is shown that in the presence of intrinsic inequality, a similar unequal distribution of resources can increase the potential for cooperation. This effect is stronger the smaller the group is in which cooperation takes place. It is also shown that under particular assumptions, if the unequal members of a group vary the size of their contributions to a cooperative effort over time, they can thereby increase their efficiency and improve the collective outcome.\r\nCooperative behaviour in a two-person interaction can be rewarded either by direct reciprocation whenever the same two people interact again, or indirectly by a third party who observed the interaction. In the latter case of indirect reciprocity, individuals are proximally rewarded by a good reputation, which ultimately translates to being rewarded with cooperative behaviour by others. This mechanism can enable selfishly motivated cooperation even in circumstances where individuals are unlikely to meet again, akin to how money facilitates trade. While these two forms of reciprocity have mostly been studied in isolation, this thesis analyses both direct and indirect reciprocity in a general model in order to compare their relative effectiveness under different circumstances. The contribution of this thesis is an extension of previous work regarding a specific kind of interaction, whose parameters allow for convenient mathematical analysis, to the most general set of possible interactions."}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"19843","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"19074"},{"relation":"part_of_dissertation","id":"15083","status":"public"}]},"acknowledgement":"The research for this thesis was supported by the European Research Council\r\n(grant agreements No. 863818 and No. 850529), the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie grant agreement No. 754411),\r\nthe Austrian Science Fund (grant DOI 10.55776/COE12), the French Agence Nationale\r\nde la Recherche under the Programme d’investissements d’avenir (project reference 17-\r\nEURE-0010) and the Australian Government through the Australian Research Council\r\n(grant No. SR200100005, “Securing Antarctica’s Environmental Future”).","oa_version":"Published Version","publication_identifier":{"issn":["2663-337X"]},"day":"25","citation":{"ama":"Hübner V. Reciprocity and inequality in social dilemmas. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19903\">10.15479/AT-ISTA-19903</a>","chicago":"Hübner, Valentin. “Reciprocity and Inequality in Social Dilemmas.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19903\">https://doi.org/10.15479/AT-ISTA-19903</a>.","ieee":"V. Hübner, “Reciprocity and inequality in social dilemmas,” Institute of Science and Technology Austria, 2025.","mla":"Hübner, Valentin. <i>Reciprocity and Inequality in Social Dilemmas</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19903\">10.15479/AT-ISTA-19903</a>.","short":"V. Hübner, Reciprocity and Inequality in Social Dilemmas, Institute of Science and Technology Austria, 2025.","apa":"Hübner, V. (2025). <i>Reciprocity and inequality in social dilemmas</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19903\">https://doi.org/10.15479/AT-ISTA-19903</a>","ista":"Hübner V. 2025. Reciprocity and inequality in social dilemmas. Institute of Science and Technology Austria."},"file_date_updated":"2025-07-09T13:37:00Z","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"oa":1,"fulldoi":"https://doi.org/10.15479/AT-ISTA-19903","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-06-25T00:00:00Z","publication_status":"published","type":"dissertation","ddc":["519"],"page":"157","has_accepted_license":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"},{"grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)"}],"tmp":{"image":"/images/cc_by_nc.png","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"month":"06","degree_awarded":"PhD","year":"2025","_id":"19903"},{"citation":{"ista":"Svoboda J. 2025. Structural properties of games on graphs. Institute of Science and Technology Austria.","apa":"Svoboda, J. (2025). <i>Structural properties of games on graphs</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20138\">https://doi.org/10.15479/AT-ISTA-20138</a>","short":"J. Svoboda, Structural Properties of Games on Graphs, Institute of Science and Technology Austria, 2025.","mla":"Svoboda, Jakub. <i>Structural Properties of Games on Graphs</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20138\">10.15479/AT-ISTA-20138</a>.","ieee":"J. Svoboda, “Structural properties of games on graphs,” Institute of Science and Technology Austria, 2025.","chicago":"Svoboda, Jakub. “Structural Properties of Games on Graphs.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20138\">https://doi.org/10.15479/AT-ISTA-20138</a>.","ama":"Svoboda J. Structural properties of games on graphs. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20138\">10.15479/AT-ISTA-20138</a>"},"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"file_date_updated":"2025-08-21T11:48:39Z","day":"05","publication_identifier":{"issn":["2663-337X"]},"oa_version":"Published Version","abstract":[{"text":"The evolution shapes the world around us.\r\nNot only in biology, where the fittest individuals spread their genes but also in physics and social dynamics, the evolutionary forces determine the development of a state of matter or public opinions.\r\nMany models describe these dynamics.\r\nThis thesis examines the role of the structure in the models of selection.\r\nThe population structure is represented as a graph or a network, and each vertex is occupied by one individual.\r\nEvery individual has a type and fitness that represents the reproductive potential and depends on the type, occupied vertex, and the arrangement of the neighbors.\r\nThe evolution is modeled in discrete steps; in one step, one individual is replaced by a neighbor selected randomly with the influence of fitness.\r\n\r\n\r\n\r\nThe role of the networks is widely examined in the literature.\r\nThe structures that promote the spread of the desired type compared to the structureless case are called amplifiers.\r\nThe existence of amplifiers in various settings is an intensively studied topic, and in some settings, the amplifiers have been identified.\r\nMoreover, there are other important questions about the number of steps until one type spreads over the whole network (fixation time), the computational complexity, and the questions about the robustness of these processes.\r\n\r\n\r\nThis thesis explores the role of structure in evolution from many perspectives.\r\nFirst, it introduces different models and various choices that can be made in the models of evolution.\r\nIt highlights the role of the structure in the real world and how this is reflected in these models.\r\nThen, it describes the previous results and open problems.\r\nSecond, the thesis describes an amplifier for two variants of the Moran process: one with a constant birth rate and the other with a constant death rate.\r\nThis is an important contribution to the robustness of the amplification.\r\nThird, the thesis determines the complexity of spatial games.\r\nThese are processes where the fitness comes from a game, and the strength of selection is high.\r\nIt shows that determining the fate of cooperation in these games is a PSPACE-complete problem.\r\nFourth, the thesis describes the amplifier of cooperation for spatial games.\r\nThis is the first amplifier in this setting.\r\nFifth, the thesis examines the coexistence in the Moran process with environmental heterogeneity.\r\nIn this setting, the fitness depends not only on the type of the individual but also on the occupied vertex.\r\nThe chapter determines the relationship between the interactions of vertices of different types and the coexistence time.\r\nSixth, the thesis examines the social balance on networks and proposes a stochastic dynamic partially aware of the state of the graph, which reaches a balanced position quickly.\r\nFinally, the thesis presents conclusions and outlines the directions for future work.\r\n\r\n\r\n","lang":"eng"}],"file":[{"access_level":"open_access","creator":"jsvoboda","date_created":"2025-08-14T09:54:43Z","file_name":"2025_Svoboda_Jakub_Thesis.pdf","date_updated":"2025-08-14T09:54:43Z","relation":"main_file","file_size":5927291,"content_type":"application/pdf","success":1,"checksum":"c6c4df9777f4537940de7ab392ad57e2","file_id":"20177"},{"content_type":"application/zip","file_id":"20178","checksum":"485e9f9822821bc03666d245d80aaa08","access_level":"closed","file_name":"2025_Svoboda_Jakub_Thesis.zip","date_updated":"2025-08-21T11:48:39Z","creator":"jsvoboda","date_created":"2025-08-14T09:55:20Z","file_size":6731815,"relation":"source_file"}],"doi_confirm":"1","title":"Structural properties of games on graphs","related_material":{"record":[{"id":"12787","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"12101","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"12257"},{"id":"15297","status":"public","relation":"part_of_dissertation"},{"id":"18703","status":"public","relation":"part_of_dissertation"}]},"acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForMSMArt) and Austrian Science Fund 10.55776/COE12.\r\n","das_tickbox":"1","supervisor":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"article_processing_charge":"No","status":"public","publisher":"Institute of Science and Technology Austria","corr_author":"1","publisher_comment":"Chapter 4 is copyrighted by CC BY-NC-ND\r\n4.0, which prohibits derivatives. Chapter 6 is copyrighted: Copyright (2025) by the American\r\nPhysical Society. For a copy, redistribution, or modification needs to be permitted by the\r\nAmerican Physical Society.\r\n","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"OA_place":"publisher","doi":"10.15479/AT-ISTA-20138","date_created":"2025-08-05T14:33:59Z","date_updated":"2026-10-16T08:00:05Z","author":[{"orcid":"0000-0002-1419-3267","first_name":"Jakub","last_name":"Svoboda","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","full_name":"Svoboda, Jakub"}],"ec_funded":1,"_id":"20138","degree_awarded":"PhD","year":"2025","month":"08","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","short":"CC BY-NC-SA (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode"},"project":[{"grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications"},{"grant_number":"COE12","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","name":"Bilateral Artificial Intelligence (Chatterjee)"}],"has_accepted_license":"1","publication_status":"published","date_published":"2025-08-05T00:00:00Z","page":"167","ddc":["000","519"],"type":"dissertation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","fulldoi":"https://doi.org/10.15479/AT-ISTA-20138","oa":1}]