[{"volume":25,"scopus_import":"1","department":[{"_id":"LaVe"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"E. York, I. Stone, W. Shi, X. Roy, L. Venkataraman, Nano Letters 25 (2025) 13697–13702.","chicago":"York, Emma, Ilana Stone, Wanzhuo Shi, Xavier Roy, and Latha Venkataraman. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” <i>Nano Letters</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">https://doi.org/10.1021/acs.nanolett.5c03764</a>.","ama":"York E, Stone I, Shi W, Roy X, Venkataraman L. Tuning conductance in BODIPY-based single-molecule junctions. <i>Nano Letters</i>. 2025;25(36):13697-13702. doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">10.1021/acs.nanolett.5c03764</a>","ista":"York E, Stone I, Shi W, Roy X, Venkataraman L. 2025. Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. 25(36), 13697–13702.","apa":"York, E., Stone, I., Shi, W., Roy, X., &#38; Venkataraman, L. (2025). Tuning conductance in BODIPY-based single-molecule junctions. <i>Nano Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">https://doi.org/10.1021/acs.nanolett.5c03764</a>","ieee":"E. York, I. Stone, W. Shi, X. Roy, and L. Venkataraman, “Tuning conductance in BODIPY-based single-molecule junctions,” <i>Nano Letters</i>, vol. 25, no. 36. American Chemical Society, pp. 13697–13702, 2025.","mla":"York, Emma, et al. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” <i>Nano Letters</i>, vol. 25, no. 36, American Chemical Society, 2025, pp. 13697–702, doi:<a href=\"https://doi.org/10.1021/acs.nanolett.5c03764\">10.1021/acs.nanolett.5c03764</a>."},"doi":"10.1021/acs.nanolett.5c03764","oa_version":"Published Version","quality_controlled":"1","_id":"20331","day":"25","article_type":"letter_note","publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"file_date_updated":"2025-12-30T09:39:44Z","acknowledgement":"We thank the National Science Foundation (No. NSF-DMR 2241180) for supporting this research. Synthetic work at Columbia was funded in part by the Air Force Office of Scientific Research (AFOSR), under Grant No. FA9550-22-1-0389. The cryoprobe on the 500 MHz NMR instrument used in this research at Columbia was purchased through the NIH Award No. S10OD026749. This work was supported in part by the Institute of Science and Technology Austria. HRMS sample preparation, analysis, and data evaluation were performed by Aikaterina Paraskevopoulou, Mass Spec Service, LSF, ISTA.","external_id":{"isi":["001557017200001"],"pmid":["40855728"]},"OA_place":"publisher","license":"https://creativecommons.org/licenses/by/4.0/","author":[{"full_name":"York, Emma","id":"08dde91e-8e0a-11f0-9d7d-9e8d80864f16","first_name":"Emma","last_name":"York"},{"full_name":"Stone, Ilana","last_name":"Stone","first_name":"Ilana"},{"id":"a3010425-87c8-11f0-8106-bec32bea74da","full_name":"Shi, Wanzhuo","last_name":"Shi","first_name":"Wanzhuo"},{"full_name":"Roy, Xavier","first_name":"Xavier","last_name":"Roy"},{"full_name":"Venkataraman, Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf","first_name":"Latha","last_name":"Venkataraman","orcid":"0000-0002-6957-6089"}],"title":"Tuning conductance in BODIPY-based single-molecule junctions","date_updated":"2026-07-28T09:53:54Z","publisher":"American Chemical Society","abstract":[{"text":"Here, we present a foundational investigation of charge transport through three BODIPY-based molecules using the scanning tunneling microscope–break junction (STM-BJ) technique. We demonstrate that molecular conductance through the BODIPY core can be measured by introducing aurophilic linkers at the 2,6-positions. By varying these linkers, we systematically modulate the frontier molecular orbital energies and fine-tune transport behavior. Our experimental results are supported by DFT-based calculations, which feature a new computationally efficient correction to standard PBE-level transmission predictions. Together, these findings establish the viability of BODIPY-based systems for molecular junction applications and lay the groundwork for future studies of their single-molecule optoelectronic properties.","lang":"eng"}],"has_accepted_license":"1","pmid":1,"date_created":"2025-09-10T05:48:29Z","intvolume":"        25","PlanS_conform":"1","language":[{"iso":"eng"}],"OA_type":"hybrid","issue":"36","ddc":["540"],"month":"08","publication":"Nano Letters","corr_author":"1","status":"public","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"MassSpec"}],"das_tickbox":"1","page":"13697-13702","oa":1,"isi":1,"type":"journal_article","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":3144989,"creator":"dernst","file_name":"2025_NanoLetters_York.pdf","checksum":"bac881601e1f33c3cf8f51d50b958e68","relation":"main_file","date_created":"2025-12-30T09:39:44Z","date_updated":"2025-12-30T09:39:44Z","file_id":"20910","success":1}],"publication_status":"published","article_processing_charge":"Yes (via OA deal)","year":"2025","date_published":"2025-08-25T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"OA_type":"gold","language":[{"iso":"eng"}],"intvolume":"        17","date_created":"2025-03-09T23:01:27Z","abstract":[{"lang":"eng","text":"Sex-linked and autosomal loci experience different selective pressures and evolutionary dynamics. X (or Z) chromosomes are often hemizygous in males (or females), as Y (or W) chromosomes often degenerate. Such hemizygous regions can be under greater efficacy of selection, as recessive mutations are immediately exposed to selection in the heterogametic sex leading to faster adaptation and faster divergence on the X chromosome (the so-called Faster-X or Faster-Z effect). However, in young nonrecombining regions, Y/W chromosomes often have many functional genes, and many X/Z-linked loci are therefore diploid. The sheltering of recessive mutations on the X/Z by the Y/W homolog is expected to drive slower adaptation for diploid X/Z loci, i.e. a reduction in the efficacy of selection. While the Faster-X effect has been studied extensively, much less is known empirically about the evolutionary dynamics of diploid X or Z chromosomes. Here, we took advantage of published population genomic data in the female-heterogametic human parasite Schistosoma japonicum to characterize the gene content and diversity levels of the diploid and hemizygous regions of the Z chromosome. We used different metrics of selective pressures acting on genes to test for differences in the efficacy of selection in hemizygous and diploid Z regions, relative to autosomes. We found consistent patterns suggesting reduced Ne, and reduced efficacy of purifying selection, on both hemizygous and diploid Z regions. Moreover, relaxed selection was particularly pronounced for female-biased genes on the diploid Z, as predicted by recent theoretical work."}],"has_accepted_license":"1","pmid":1,"publisher":"Oxford University Press","month":"02","ddc":["570"],"status":"public","corr_author":"1","publication":"Genome Biology and Evolution","issue":"2","type":"journal_article","isi":1,"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"evaf021","date_published":"2025-02-01T00:00:00Z","publication_status":"published","year":"2025","article_processing_charge":"Yes","file":[{"date_updated":"2025-03-10T08:25:59Z","success":1,"file_id":"19378","content_type":"application/pdf","access_level":"open_access","file_size":768371,"file_name":"2025_GBE_Mrnjavac.pdf","creator":"dernst","checksum":"e3aa993e3d6dad10cb806c243fa57408","relation":"main_file","date_created":"2025-03-10T08:25:59Z"}],"doi":"10.1093/gbe/evaf021","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"short":"A. Mrnjavac, B. Vicoso, Genome Biology and Evolution 17 (2025).","chicago":"Mrnjavac, Andrea, and Beatriz Vicoso. “Reduced Efficacy of Selection on a Young Z Chromosome Region of Schistosoma Japonicum.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2025. <a href=\"https://doi.org/10.1093/gbe/evaf021\">https://doi.org/10.1093/gbe/evaf021</a>.","ista":"Mrnjavac A, Vicoso B. 2025. Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum. Genome Biology and Evolution. 17(2), evaf021.","apa":"Mrnjavac, A., &#38; Vicoso, B. (2025). Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evaf021\">https://doi.org/10.1093/gbe/evaf021</a>","ama":"Mrnjavac A, Vicoso B. Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum. <i>Genome Biology and Evolution</i>. 2025;17(2). doi:<a href=\"https://doi.org/10.1093/gbe/evaf021\">10.1093/gbe/evaf021</a>","mla":"Mrnjavac, Andrea, and Beatriz Vicoso. “Reduced Efficacy of Selection on a Young Z Chromosome Region of Schistosoma Japonicum.” <i>Genome Biology and Evolution</i>, vol. 17, no. 2, evaf021, Oxford University Press, 2025, doi:<a href=\"https://doi.org/10.1093/gbe/evaf021\">10.1093/gbe/evaf021</a>.","ieee":"A. Mrnjavac and B. Vicoso, “Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum,” <i>Genome Biology and Evolution</i>, vol. 17, no. 2. Oxford University Press, 2025."},"scopus_import":"1","department":[{"_id":"BeVi"}],"volume":17,"_id":"19370","quality_controlled":"1","oa_version":"Published Version","OA_place":"publisher","external_id":{"isi":["001423671400001"],"pmid":["39913672"]},"day":"01","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"18549"}],"link":[{"url":"https://git.ista.ac.at/amrnjava/schistosomes_slower_z","relation":"software"}]},"article_type":"original","acknowledgement":"The authors would like to thank three anonymous reviewers for comments and suggestions. We are also grateful to Christelle Fraïsse, Marwan Elkrewi, and Filip Ruzicka for the help in this project.","publication_identifier":{"eissn":["1759-6653"]},"file_date_updated":"2025-03-10T08:25:59Z","title":"Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum","date_updated":"2026-07-29T08:36:27Z","author":[{"full_name":"Mrnjavac, Andrea","id":"353FAC84-AE61-11E9-8BFC-00D3E5697425","first_name":"Andrea","last_name":"Mrnjavac"},{"first_name":"Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Vicoso, Beatriz"}]},{"alternative_title":["ISTA Thesis"],"date_created":"2025-03-12T13:04:59Z","abstract":[{"text":"Rotations constitute one of the fundamental symmetries in physics, characterized by their intricate group structure and infinite dimensional representations. In contrast to classical rotations, quantum mechanics unveils the SO(3) symmetry group structure, manifesting in phenomena without classical counterparts, from angular momentum quantization to non-trivial addition of angular momenta.\r\nWhile most studies of topological physics have focused on two-band systems, the SO(3) symmetry group of quantum rotors offers an inherently more complex platform with unprecedented possibilities for exploring topological phenomena. Despite their ubiquity in nature– from molecules to nanorotors– their potential for hosting topological phases has remained largely unexamined.\r\nIn this thesis, we mainly focus on periodically driven linear molecules as a prototype for studying topological phenomena in quantum rotors. Recent technological advances in coherent control of molecules, particularly through precisely shaped laser pulses, have made it possible to investigate linear rotors in the context of topology. While planar rotors have received some attention in recent years, threedimensional rotors–particularly linear molecules–harbor substantially richer topological phenomena due to their non-abelian nature and their additional angular degrees of freedom. We demonstrate that these systems can host novel edge states and topological features fundamentally impossible in planar systems.\r\nWe begin by establishing a theoretical bridge between periodically kicked rotors and \"crystalline\" lattices in angular momentum space. Using non-interacting linear molecules as our primary example, we show how quantum interference and revival patterns lead to the possibility to simulate band models with arbitrary number of bands N. While our framework applies to various quantum rotors, including nanorotors and kicked Bose-Einstein condensates, linear\r\nmolecules provide an ideal experimental platform due to their abovementioned precise controllability.\r\nThe core of this work examines adiabatic dynamics of 3D quantum rotors, establishing a geometric framework based on the Euler class to characterize its non-abelian topology. The non-Hermitian nature of the system enables novel braiding behaviors and topological transitions impossible in static systems, leading to an anomalous Dirac string phase with edge states in each gap, even though the Berry phases are all zero. These features can be directly observed through\r\nmolecular alignment and rotational level populations.\r\nThese findings establish quantum rotors as an alternative platform for studying multi-band topological physics, while suggesting practical implementations for quantum computation where topological protection could offer natural resilience against decoherence. The rich structure of three-dimensional rotation groups, combined with the tunability of topological features through driving parameters, makes this platform particularly valuable for exploring fundamental\r\nphysics and developing quantum technologies.","lang":"eng"}],"has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","OA_type":"gold","language":[{"iso":"eng"}],"supervisor":[{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","full_name":"Lemeshko, Mikhail","first_name":"Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko"}],"degree_awarded":"PhD","month":"03","ddc":["530"],"status":"public","corr_author":"1","page":"192","type":"dissertation","oa":1,"year":"2025","article_processing_charge":"No","publication_status":"published","file":[{"date_created":"2025-03-12T12:56:46Z","relation":"main_file","checksum":"d3ab25782c7ea38ce9910e57d25f6733","creator":"vkarle","file_name":"thesis_final.pdf","file_size":10625143,"access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"19394","date_updated":"2025-03-12T12:56:46Z"},{"date_updated":"2025-03-20T08:02:35Z","file_id":"19400","content_type":"application/zip","access_level":"closed","file_size":23119202,"checksum":"3ccfb0aeba4d860d71e18347913034e4","file_name":"thesis.zip","creator":"vkarle","relation":"source_file","date_created":"2025-03-13T13:15:10Z"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_published":"2025-03-13T00:00:00Z","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"citation":{"chicago":"Karle, Volker. “Non-Equilibrium Topological Phases with Periodically Driven Molecules and Quantum Rotors.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19393\">https://doi.org/10.15479/AT-ISTA-19393</a>.","short":"V. Karle, Non-Equilibrium Topological Phases with Periodically Driven Molecules and Quantum Rotors, Institute of Science and Technology Austria, 2025.","ieee":"V. Karle, “Non-equilibrium topological phases with periodically driven molecules and quantum rotors,” Institute of Science and Technology Austria, 2025.","mla":"Karle, Volker. <i>Non-Equilibrium Topological Phases with Periodically Driven Molecules and Quantum Rotors</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19393\">10.15479/AT-ISTA-19393</a>.","apa":"Karle, V. (2025). <i>Non-equilibrium topological phases with periodically driven molecules and quantum rotors</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19393\">https://doi.org/10.15479/AT-ISTA-19393</a>","ista":"Karle V. 2025. Non-equilibrium topological phases with periodically driven molecules and quantum rotors. Institute of Science and Technology Austria.","ama":"Karle V. Non-equilibrium topological phases with periodically driven molecules and quantum rotors. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19393\">10.15479/AT-ISTA-19393</a>"},"doi":"10.15479/AT-ISTA-19393","_id":"19393","oa_version":"Published Version","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"14851"},{"status":"public","id":"12788","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"9903","status":"public"},{"status":"public","id":"15004","relation":"part_of_dissertation"},{"id":"19425","relation":"part_of_dissertation","status":"public"}]},"publication_identifier":{"eissn":["2663-337X"]},"file_date_updated":"2025-03-20T08:02:35Z","day":"13","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","OA_place":"publisher","author":[{"first_name":"Volker","last_name":"Karle","orcid":"0000-0002-6963-0129","full_name":"Karle, Volker","id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425"}],"date_updated":"2026-07-29T08:59:30Z","title":"Non-equilibrium topological phases with periodically driven molecules and quantum rotors"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2025-09-12T00:00:00Z","publication_status":"published","year":"2025","article_processing_charge":"No","type":"journal_article","isi":1,"page":"289-303","das_tickbox":"0","month":"09","corr_author":"1","publication":"Acta Arithmetica","status":"public","language":[{"iso":"eng"}],"OA_type":"closed access","intvolume":"       220","abstract":[{"lang":"eng","text":"We study the growth of sumsets A+B⊂S⊂G, where S does not contain an arithmetic progression of length 2k+1, and where G is a commutative group, in which every nonzero element has an order of at least 2k+1. More specifically, we show the following: if A,B⊂G are sets such that A+B does not contain an arithmetic progression of length 2k+1, then\r\n|A+B|≥|A|2k−13k−2|B|k3k−2.\r\nAs an application we derive upper bounds on the cardinality of the summands in sumsets A+B+C contained in the set of t-th powers, where t≥2 is an integer. In particular, we show that min(|A|,|B|,|C|)≪(logN)4/5 for t=2, and min(|A|,|B|,|C|)≪t(logN)1/2 for t≥3."}],"date_created":"2025-11-04T14:33:16Z","publisher":"Institute of Mathematics","supplementarymaterial":"no","researchdata_availability":"no","title":"Sumset growth in progression-free sets","date_updated":"2026-07-29T09:51:25Z","author":[{"first_name":"Christian","last_name":"Elsholtz","full_name":"Elsholtz, Christian"},{"full_name":"Ruzsa, Imre Z.","first_name":"Imre Z.","last_name":"Ruzsa"},{"last_name":"Wurzinger","orcid":"0009-0004-5360-0074","first_name":"Lena","full_name":"Wurzinger, Lena","id":"50c57d72-32a8-11ee-aeea-d652094d2ccd"}],"external_id":{"isi":["001570716800001"]},"day":"12","article_type":"original","acknowledgement":"The authors would like to thank the referee and Ilya Shkredov for comments on the manuscript.\r\nC. E. is supported by a joint FWF-ANR project ArithRand, grant numbers FWF I 4945-N and ANR-20-CE91-0006.\r\n","publication_identifier":{"issn":["0065-1036"],"eissn":["1730-6264"]},"_id":"20603","quality_controlled":"1","oa_version":"None","citation":{"short":"C. Elsholtz, I.Z. Ruzsa, L. Wurzinger, Acta Arithmetica 220 (2025) 289–303.","chicago":"Elsholtz, Christian, Imre Z. Ruzsa, and Lena Wurzinger. “Sumset Growth in Progression-Free Sets.” <i>Acta Arithmetica</i>. Institute of Mathematics, 2025. <a href=\"https://doi.org/10.4064/aa250115-14-7\">https://doi.org/10.4064/aa250115-14-7</a>.","ama":"Elsholtz C, Ruzsa IZ, Wurzinger L. Sumset growth in progression-free sets. <i>Acta Arithmetica</i>. 2025;220:289-303. doi:<a href=\"https://doi.org/10.4064/aa250115-14-7\">10.4064/aa250115-14-7</a>","ista":"Elsholtz C, Ruzsa IZ, Wurzinger L. 2025. Sumset growth in progression-free sets. Acta Arithmetica. 220, 289–303.","apa":"Elsholtz, C., Ruzsa, I. Z., &#38; Wurzinger, L. (2025). Sumset growth in progression-free sets. <i>Acta Arithmetica</i>. Institute of Mathematics. <a href=\"https://doi.org/10.4064/aa250115-14-7\">https://doi.org/10.4064/aa250115-14-7</a>","mla":"Elsholtz, Christian, et al. “Sumset Growth in Progression-Free Sets.” <i>Acta Arithmetica</i>, vol. 220, Institute of Mathematics, 2025, pp. 289–303, doi:<a href=\"https://doi.org/10.4064/aa250115-14-7\">10.4064/aa250115-14-7</a>.","ieee":"C. Elsholtz, I. Z. Ruzsa, and L. Wurzinger, “Sumset growth in progression-free sets,” <i>Acta Arithmetica</i>, vol. 220. Institute of Mathematics, pp. 289–303, 2025."},"doi":"10.4064/aa250115-14-7","department":[{"_id":"TiBr"}],"scopus_import":"1","volume":220},{"author":[{"first_name":"Suyash","orcid":"0000-0001-8421-5508","last_name":"Naik","id":"2C0B105C-F248-11E8-B48F-1D18A9856A87","full_name":"Naik, Suyash"},{"last_name":"Keta","first_name":"Yann-Edwin","full_name":"Keta, Yann-Edwin"},{"last_name":"Pranjic-Ferscha","first_name":"Kornelija","id":"4362B3C2-F248-11E8-B48F-1D18A9856A87","full_name":"Pranjic-Ferscha, Kornelija"},{"full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561"},{"last_name":"Henkes","first_name":"Silke","full_name":"Henkes, Silke"},{"last_name":"Heisenberg","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"publication_status":"draft","year":"2025","article_processing_charge":"No","title":"Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties","date_published":"2025-02-17T00:00:00Z","date_updated":"2026-07-29T10:33:31Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"17","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20441"},{"relation":"later_version","id":"22608","status":"public"}]},"oa":1,"OA_place":"repository","license":"https://creativecommons.org/licenses/by-nd/4.0/","type":"preprint","corr_author":"1","oa_version":"Preprint","month":"02","publication":"bioRxiv","status":"public","main_file_link":[{"url":"https://doi.org/10.1101/2025.02.14.638262","open_access":"1"}],"_id":"20465","das_tickbox":"1","department":[{"_id":"CaHe"},{"_id":"EdHa"}],"abstract":[{"lang":"eng","text":"For tissues to spread, they must be deformable while maintaining their structural integrity. How these opposing requirements are balanced within spreading tissues is not yet well understood. Here, we show that keratin intermediate filaments function in epithelial spreading by adapting tissue mechanical resilience to the stresses arising in the tissue during the spreading process. By analysing the expansion of the enveloping cell layer (EVL) over the large yolk cell in early zebrafish embryos in vivo, we found that keratin network maturation in EVL cells is promoted by stresses building up within the spreading tissue. Through genetic interference and tissue rheology experiments, complemented by a vertex model with mechanochemical feedback, we demonstrate that stress-induced keratin network maturation in the EVL increases tissue viscosity, which is essential for preventing tissue rupture. Interestingly, keratins are also required in the yolk cell for mechanosensitive actomyosin network contraction and flow, the force-generating processes pulling the EVL. These dual mechanosensitive functions of keratins enable a balance between pulling force production in the yolk cell and the mechanical resilience of the EVL against stresses generated by these pulling forces, thereby ensuring uniform and robust tissue spreading."}],"date_created":"2025-10-14T07:25:27Z","tmp":{"image":"/image/cc_by_nd.png","short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"citation":{"short":"S. Naik, Y.-E. Keta, K. Pranjic-Ferscha, E.B. Hannezo, S. Henkes, C.-P.J. Heisenberg, BioRxiv (n.d.).","chicago":"Naik, Suyash, Yann-Edwin Keta, Kornelija Pranjic-Ferscha, Edouard B Hannezo, Silke Henkes, and Carl-Philipp J Heisenberg. “Keratins Coordinate Tissue Spreading by Balancing Spreading Forces with Tissue Material Properties.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2025.02.14.638262\">https://doi.org/10.1101/2025.02.14.638262</a>.","ista":"Naik S, Keta Y-E, Pranjic-Ferscha K, Hannezo EB, Henkes S, Heisenberg C-PJ. Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. bioRxiv, <a href=\"https://doi.org/10.1101/2025.02.14.638262\">10.1101/2025.02.14.638262</a>.","ama":"Naik S, Keta Y-E, Pranjic-Ferscha K, Hannezo EB, Henkes S, Heisenberg C-PJ. Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2025.02.14.638262\">10.1101/2025.02.14.638262</a>","apa":"Naik, S., Keta, Y.-E., Pranjic-Ferscha, K., Hannezo, E. B., Henkes, S., &#38; Heisenberg, C.-P. J. (n.d.). Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.02.14.638262\">https://doi.org/10.1101/2025.02.14.638262</a>","ieee":"S. Naik, Y.-E. Keta, K. Pranjic-Ferscha, E. B. Hannezo, S. Henkes, and C.-P. J. Heisenberg, “Keratins coordinate tissue spreading by balancing spreading forces with tissue material properties,” <i>bioRxiv</i>. .","mla":"Naik, Suyash, et al. “Keratins Coordinate Tissue Spreading by Balancing Spreading Forces with Tissue Material Properties.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2025.02.14.638262\">10.1101/2025.02.14.638262</a>."},"doi":"10.1101/2025.02.14.638262","language":[{"iso":"eng"}]},{"month":"12","publication":"Communications Biology","status":"public","ddc":["570"],"date_created":"2025-11-23T23:01:38Z","pmid":1,"has_accepted_license":"1","abstract":[{"text":"Task-based functional magnetic resonance imaging (fMRI) reveals individual differences in neural correlates of cognition but faces scalability challenges due to cognitive demands, protocol variability, and limited task coverage in large datasets. Here, we propose DeepTaskGen, a deep-learning approach that synthesizes non-acquired task-based contrast maps from resting-state (rs-) fMRI. We validate this approach using the Human Connectome Project lifespan data, then generate 47 contrast maps from 7 different cognitive tasks for over 20,000 individuals from UK Biobank. DeepTaskGen outperforms several benchmarks in generating synthetic task-contrast maps, achieving superior reconstruction performance while retaining inter-individual variation essential for biomarker development. We further show comparable or superior predictive performance of synthetic maps relative to actual maps and rs-connectomes across diverse demographic, cognitive, and clinical variables. This approach facilitates the study of individual differences and the generation of task-related biomarkers by enabling the generation of arbitrary functional cognitive tasks from readily available rs-fMRI data.","lang":"eng"}],"publisher":"Springer Nature","OA_type":"gold","language":[{"iso":"eng"}],"intvolume":"         8","PlanS_conform":"1","publication_status":"published","article_processing_charge":"Yes","year":"2025","file":[{"access_level":"open_access","content_type":"application/pdf","file_size":1588155,"checksum":"b8b3c1abe7048a09b920082a37e786a5","file_name":"2025_CommunicationsBiology_Serin.pdf","creator":"dernst","date_created":"2025-11-24T09:12:19Z","relation":"main_file","date_updated":"2025-11-24T09:12:19Z","file_id":"20675","success":1}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_number":"1572","date_published":"2025-12-01T00:00:00Z","type":"journal_article","isi":1,"oa":1,"_id":"20662","oa_version":"Published Version","quality_controlled":"1","department":[{"_id":"GaNo"}],"scopus_import":"1","volume":8,"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1038/s42003-025-09158-6","citation":{"apa":"Serin, E., Ritter, K., Schumann, G., Banaschewski, T., Marquand, A., Walter, H., … Schumann, G. (2025). Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>","ama":"Serin E, Ritter K, Schumann G, et al. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. 2025;8. doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>","ista":"Serin E, Ritter K, Schumann G, Banaschewski T, Marquand A, Walter H, Ogoh G, Stahl BC, Brandlistuen R, Schikowski T, Young AH, Xinyang Y, Zhang Z, Agunbiade K, Chen D, Desrivières S, Clinton N, Thompson P, Köhler V, Schwalber A, Calhoun VD, Chang X, Zhang Y, Li Y, Dai Y, Yuan J, Xia Y, Jia T, Renner P, Hese S, Spanlang B, Pearmund C, Athanasiadis AP, Petkoski S, Jirsa V, Schmitt K, Wilbertz JH, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM, Miller AJ, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Itatani R, Eiroa-Orosa F, Feixas G, Slater M, Novarino G, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Nees F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann N, Janson K, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz A, Schumann G. 2025. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 8, 1572.","ieee":"E. Serin <i>et al.</i>, “Generating synthetic task-based brain fingerprints for population neuroscience using deep learning,” <i>Communications Biology</i>, vol. 8. Springer Nature, 2025.","mla":"Serin, Emin, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>, vol. 8, 1572, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>.","short":"E. Serin, K. Ritter, G. Schumann, T. Banaschewski, A. Marquand, H. Walter, G. Ogoh, B.C. Stahl, R. Brandlistuen, T. Schikowski, A.H. Young, Y. Xinyang, Z. Zhang, K. Agunbiade, D. Chen, S. Desrivières, N. Clinton, P. Thompson, V. Köhler, A. Schwalber, V.D. Calhoun, X. Chang, Y. Zhang, Y. Li, Y. Dai, J. Yuan, Y. Xia, T. Jia, P. Renner, S. Hese, B. Spanlang, C. Pearmund, A.P. Athanasiadis, S. Petkoski, V. Jirsa, K. Schmitt, J.H. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A.J. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, R. Itatani, F. Eiroa-Orosa, G. Feixas, M. Slater, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, F. Nees, M. Neidhart, A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann, K. Janson, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, G. Schumann, Communications Biology 8 (2025).","chicago":"Serin, Emin, Kerstin Ritter, Gunter Schumann, Tobias Banaschewski, Andre Marquand, Henrik Walter, George Ogoh, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>."},"author":[{"full_name":"Serin, Emin","last_name":"Serin","first_name":"Emin"},{"full_name":"Ritter, Kerstin","first_name":"Kerstin","last_name":"Ritter"},{"full_name":"Schumann, Gunter","last_name":"Schumann","first_name":"Gunter"},{"full_name":"Banaschewski, Tobias","last_name":"Banaschewski","first_name":"Tobias"},{"full_name":"Marquand, Andre","last_name":"Marquand","first_name":"Andre"},{"first_name":"Henrik","last_name":"Walter","full_name":"Walter, Henrik"},{"full_name":"Ogoh, George","first_name":"George","last_name":"Ogoh"},{"last_name":"Stahl","first_name":"Bernd Carsten","full_name":"Stahl, Bernd Carsten"},{"full_name":"Brandlistuen, Ragnhild","first_name":"Ragnhild","last_name":"Brandlistuen"},{"last_name":"Schikowski","first_name":"Tamara","full_name":"Schikowski, Tamara"},{"full_name":"Young, Allan H.","last_name":"Young","first_name":"Allan H."},{"last_name":"Xinyang","first_name":"Yu","full_name":"Xinyang, Yu"},{"full_name":"Zhang, Zuo","last_name":"Zhang","first_name":"Zuo"},{"full_name":"Agunbiade, Kofoworola","last_name":"Agunbiade","first_name":"Kofoworola"},{"full_name":"Chen, Di","first_name":"Di","last_name":"Chen"},{"full_name":"Desrivières, Sylvane","first_name":"Sylvane","last_name":"Desrivières"},{"last_name":"Clinton","first_name":"Nicholas","full_name":"Clinton, Nicholas"},{"first_name":"Paul","last_name":"Thompson","full_name":"Thompson, Paul"},{"full_name":"Köhler, Venessa","first_name":"Venessa","last_name":"Köhler"},{"full_name":"Schwalber, Ameli","first_name":"Ameli","last_name":"Schwalber"},{"last_name":"Calhoun","first_name":"Vince D.","full_name":"Calhoun, Vince D."},{"last_name":"Chang","first_name":"Xiao","full_name":"Chang, Xiao"},{"full_name":"Zhang, Yanqing","last_name":"Zhang","first_name":"Yanqing"},{"full_name":"Li, Yuzhu","first_name":"Yuzhu","last_name":"Li"},{"first_name":"Yuxiang","last_name":"Dai","full_name":"Dai, Yuxiang"},{"full_name":"Yuan, Jiacan","first_name":"Jiacan","last_name":"Yuan"},{"full_name":"Xia, Yunman","first_name":"Yunman","last_name":"Xia"},{"last_name":"Jia","first_name":"Tianye","full_name":"Jia, Tianye"},{"full_name":"Renner, Paul","first_name":"Paul","last_name":"Renner"},{"full_name":"Hese, Sören","first_name":"Sören","last_name":"Hese"},{"first_name":"Bernhard","last_name":"Spanlang","full_name":"Spanlang, Bernhard"},{"last_name":"Pearmund","first_name":"Charlie","full_name":"Pearmund, Charlie"},{"full_name":"Athanasiadis, Anastasios Polykarpos","last_name":"Athanasiadis","first_name":"Anastasios Polykarpos"},{"first_name":"Spase","last_name":"Petkoski","full_name":"Petkoski, Spase"},{"full_name":"Jirsa, Viktor","first_name":"Viktor","last_name":"Jirsa"},{"full_name":"Schmitt, Karen","first_name":"Karen","last_name":"Schmitt"},{"full_name":"Wilbertz, Johannes H.","first_name":"Johannes H.","last_name":"Wilbertz"},{"last_name":"Patraskaki","first_name":"Myrto","full_name":"Patraskaki, Myrto"},{"last_name":"Sommer","first_name":"Peter","full_name":"Sommer, Peter"},{"last_name":"Heilmann-Heimbach","first_name":"Stefanie","full_name":"Heilmann-Heimbach, Stefanie"},{"full_name":"Mathey, Carina M.","last_name":"Mathey","first_name":"Carina M."},{"full_name":"Miller, Abigail J.","first_name":"Abigail J.","last_name":"Miller"},{"full_name":"Claus, Isabelle","last_name":"Claus","first_name":"Isabelle"},{"first_name":"Markus M.","last_name":"Nöthen","full_name":"Nöthen, Markus M."},{"full_name":"Hoffmann, Per","first_name":"Per","last_name":"Hoffmann"},{"first_name":"Andreas J.","last_name":"Forstner","full_name":"Forstner, Andreas J."},{"full_name":"Pastor, Alvaro","last_name":"Pastor","first_name":"Alvaro"},{"full_name":"Gallego, Jaime","last_name":"Gallego","first_name":"Jaime"},{"full_name":"Itatani, Reiya","first_name":"Reiya","last_name":"Itatani"},{"last_name":"Eiroa-Orosa","first_name":"Francisco","full_name":"Eiroa-Orosa, Francisco"},{"full_name":"Feixas, Guillem","first_name":"Guillem","last_name":"Feixas"},{"full_name":"Slater, Mel","last_name":"Slater","first_name":"Mel"},{"first_name":"Gaia","orcid":"0000-0002-7673-7178","last_name":"Novarino","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","full_name":"Novarino, Gaia"},{"first_name":"Sarah Jane","last_name":"Böttger","full_name":"Böttger, Sarah Jane"},{"full_name":"Tschorn, Mira","first_name":"Mira","last_name":"Tschorn"},{"first_name":"Michael","last_name":"Rapp","full_name":"Rapp, Michael"},{"first_name":"Helga","last_name":"Ask","full_name":"Ask, Helga"},{"first_name":"Rikka","last_name":"Kjelkenes","full_name":"Kjelkenes, Rikka"},{"first_name":"Sara","last_name":"Fernandez","full_name":"Fernandez, Sara"},{"full_name":"Van Der Meer, Dennis","last_name":"Van Der Meer","first_name":"Dennis"},{"first_name":"Lars T.","last_name":"Westlye","full_name":"Westlye, Lars T."},{"first_name":"Ole A.","last_name":"Andreassen","full_name":"Andreassen, Ole A."},{"full_name":"Aden, Rieke","first_name":"Rieke","last_name":"Aden"},{"full_name":"Seefried, Beke","first_name":"Beke","last_name":"Seefried"},{"last_name":"Nees","first_name":"Frauke","full_name":"Nees, Frauke"},{"first_name":"Maja","last_name":"Neidhart","full_name":"Neidhart, Maja"},{"last_name":"Stringaris","first_name":"Argyris","full_name":"Stringaris, Argyris"},{"last_name":"Schwarz","first_name":"Emanuel","full_name":"Schwarz, Emanuel"},{"full_name":"Holz, Nathalie","first_name":"Nathalie","last_name":"Holz"},{"first_name":"Heike","last_name":"Tost","full_name":"Tost, Heike"},{"full_name":"Meyer-Lindenberg, Andreas","first_name":"Andreas","last_name":"Meyer-Lindenberg"},{"full_name":"Christmann, Nina","first_name":"Nina","last_name":"Christmann"},{"full_name":"Janson, Karina","last_name":"Janson","first_name":"Karina"},{"first_name":"Kerstin","last_name":"Schepanski","full_name":"Schepanski, Kerstin"},{"first_name":"Tatjana","last_name":"Schütz","full_name":"Schütz, Tatjana"},{"last_name":"Taron","first_name":"Ulrike Helene","full_name":"Taron, Ulrike Helene"},{"last_name":"Eils","first_name":"Roland","full_name":"Eils, Roland"},{"last_name":"Roy","first_name":"Jean Charles","full_name":"Roy, Jean Charles"},{"full_name":"Lett, Tristram A.","last_name":"Lett","first_name":"Tristram A."},{"last_name":"Kebir","first_name":"Hedi","full_name":"Kebir, Hedi"},{"full_name":"Polemiti, Elli","last_name":"Polemiti","first_name":"Elli"},{"full_name":"Hitchen, Esther","last_name":"Hitchen","first_name":"Esther"},{"full_name":"Jentsch, Marcel","first_name":"Marcel","last_name":"Jentsch"},{"first_name":"Emin","last_name":"Serin","full_name":"Serin, Emin"},{"last_name":"Bernas","first_name":"Antoine","full_name":"Bernas, Antoine"},{"full_name":"Vaidya, Nilakshi","last_name":"Vaidya","first_name":"Nilakshi"},{"full_name":"Twardziok, Sven","last_name":"Twardziok","first_name":"Sven"},{"full_name":"Ralser, Markus","last_name":"Ralser","first_name":"Markus"},{"full_name":"Heinz, Andreas","last_name":"Heinz","first_name":"Andreas"},{"full_name":"Schumann, Gunter","last_name":"Schumann","first_name":"Gunter"}],"title":"Generating synthetic task-based brain fingerprints for population neuroscience using deep learning","date_updated":"2026-07-29T11:13:56Z","day":"01","article_type":"original","file_date_updated":"2025-11-24T09:12:19Z","publication_identifier":{"eissn":["2399-3642"]},"acknowledgement":"Funded by the European Union (Grant agreement No 101057429). Complementary funding was received by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding guarantee (10131373 and 10038599) and the National Key R&D Program of Ministry of Science and Technology of China (MOST 2023YFE0199700). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union, the European Health and Digital Executive Agency (HADEA), UKRI or MOST. Neither the European Union nor HADEA nor UKRI nor MOST can be held responsible for them. This work has also been supported by a Grant from the German Research Foundation to the ENIGMA task-based fMRI Working Group (DFG ER 724/4–1, WA 1539/11–1). Data used in this study were provided in part by the Human Connectome Project, WU-Minn Consortium (principal investigators: D. Van Essen and K. Ugurbil; grant number 1U54MH091657), funded by the 16 National Institutes of Health (NIH) institutes and centers supporting the NIH Blueprint for Neuroscience Research, and by the McDonnell Center for Systems Neuroscience at Washington University. Additionally, this research utilized data obtained from UK Biobank, a large-scale biomedical database. Open Access funding enabled and organized by Projekt DEAL.","DOAJ_listed":"1","OA_place":"publisher","external_id":{"pmid":["41238730"],"isi":["001614464000001"]}},{"month":"12","ddc":["570","596","005"],"corr_author":"1","status":"public","degree_awarded":"MS","supervisor":[{"first_name":"Tim P","orcid":"0000-0003-3295-6181","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","full_name":"Vogels, Tim P"},{"first_name":"Lora Beatrice Jaeger","last_name":"Sweeney","orcid":"0000-0001-9242-5601","full_name":"Sweeney, Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"lang":"eng","text":"Left–right alternation is a defining feature of spinal locomotor circuits, yet the level of neuronal\r\ndetail required to generate and maintain this pattern remains unclear. This thesis investigates how\r\nmodels spanning multiple levels of abstraction—from biophysically detailed Hodgkin–Huxley (HH)\r\nneurons to adaptive integrate–and–fire (I&F) formulations and synfire-chain modules—can account\r\nfor the generation of fictive swimming in the spinal cord of the Xenopus laevis tadpole. The guiding\r\nhypothesis is that a small set of neuronal mechanisms is sufficient to reproduce the essential features\r\nof rhythmic alternation, and that moving between modeling scales helps distinguish core principles\r\nfrom biological detail.\r\nA minimal bilateral HH network comprising only four canonical neuron classes—excitatory\r\ndescending interneurons (dINs), inhibitory commissural interneurons (cINs), ipsilateral inhibitory\r\ninterneurons (aINs) and motoneurons—served as a biophysical proof of concept. Tuned to reproduce\r\nexperimentally observed firing modes, the model demonstrated that rebound-prone dIN excitability,\r\ncontralateral inhibition and modest electrical coupling are sufficient to generate stable alternating\r\nactivity, even in very small networks. These results motivated the transition to simpler models\r\ncapable of efficient analysis and scaling.\r\nAdaptive exponential I&F (AdEx) neurons were calibrated to physiological recordings using\r\nsimulation-based inference, yielding tonic and phasic/rebound templates that preserved the key\r\ndynamical signatures of the HH model. Phase-plane analysis clarified the mechanisms underlying\r\nsingle-spike responses and rebound firing in dINs. At network level, the I&F models robustly\r\nreproduced left–right alternation, while highlighting constraints on synaptic kinetics and adaptation\r\nneeded to avoid multi-spike responses.\r\nFinally, a synfire-chain framework provided a complementary, timing-centric perspective, demonstrating how precise spike synchrony, synaptic delays and minimal inhibitory coupling can generate\r\nalternating left–right sequences in a feedforward setting. Together, these approaches converge on a\r\ncommon conclusion: rebound-prone ipsilateral excitation combined with precisely timed contralateral inhibition constitutes a sufficient substrate for alternating spinal rhythms.\r\nBy integrating bottom-up and top-down modeling strategies, this thesis provides a unified, extensible framework for studying spinal pattern generation. The results show that essential locomotor\r\ndynamics can be captured across multiple abstraction levels, offering both mechanistic insight and\r\npractical tools for future data-driven investigations of spinal circuit development, robustness and\r\nmodulation."}],"has_accepted_license":"1","date_created":"2025-12-08T09:49:41Z","alternative_title":["ISTA Master's Thesis"],"date_published":"2025-12-09T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_id":"20919","date_updated":"2026-01-02T13:05:07Z","relation":"source_file","date_created":"2026-01-01T17:26:30Z","creator":"awilson","file_name":"tadpoleAdEx.zip","checksum":"9e3b6b73f8cbec2c3687d17fe8e30410","file_size":566072368,"content_type":"application/zip","access_level":"closed"},{"access_level":"open_access","content_type":"application/pdf","file_size":7170097,"file_name":"Masters_Thesis_Alexia_Wilson_FINAL_pdfA.pdf","checksum":"13f4c0d33923e9d5c9d56731345cf21d","creator":"awilson","date_created":"2026-01-04T12:58:49Z","relation":"main_file","date_updated":"2026-01-04T12:58:49Z","success":1,"file_id":"20923"}],"publication_status":"published","article_processing_charge":"No","year":"2025","oa":1,"type":"dissertation","page":"110","oa_version":"Published Version","doi_confirm":"1","_id":"20735","citation":{"chicago":"Wilson, Alexia C. “Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20735\">https://doi.org/10.15479/AT-ISTA-20735</a>.","short":"A.C. Wilson, Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog, Institute of Science and Technology Austria, 2025.","ieee":"A. C. Wilson, “Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog,” Institute of Science and Technology Austria, 2025.","mla":"Wilson, Alexia C. <i>Modelling the Spinal Cord of a Tadpole: Exploring Different Ways to Model the Spinal Cord in the Xenopus Frog</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20735\">10.15479/AT-ISTA-20735</a>.","ama":"Wilson AC. Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20735\">10.15479/AT-ISTA-20735</a>","ista":"Wilson AC. 2025. Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog. Institute of Science and Technology Austria.","apa":"Wilson, A. C. (2025). <i>Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20735\">https://doi.org/10.15479/AT-ISTA-20735</a>"},"doi":"10.15479/AT-ISTA-20735","department":[{"_id":"GradSch"},{"_id":"TiVo"},{"_id":"LoSw"}],"title":"Modelling the spinal cord of a tadpole: Exploring different ways to model the spinal cord in the Xenopus frog","date_updated":"2026-07-29T12:55:12Z","author":[{"first_name":"Alexia C","orcid":"0000-0001-6191-1367","last_name":"Wilson","id":"5230e794-15b2-11ec-abd3-e2d5335ebd1d","full_name":"Wilson, Alexia C"}],"OA_place":"publisher","day":"09","publication_identifier":{"issn":["2791-4585"]},"related_material":{"record":[{"status":"public","id":"13097","relation":"part_of_dissertation"}]},"file_date_updated":"2026-01-04T12:58:49Z"},{"_id":"20607","oa_version":"Published Version","doi_confirm":"1","project":[{"_id":"8df062be-16d5-11f0-9cad-f559b6612c7e","grant_number":"P37169","name":"Singlet oxygen in non-aqueous oxygen redox chemistry"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.15479/AT-ISTA-20607","citation":{"mla":"Mondal, Soumyadip. <i>Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20607\">10.15479/AT-ISTA-20607</a>.","ieee":"S. Mondal, “Oxygen and sulfur redox: Conversion kinetics and phase equilibria,” Institute of Science and Technology Austria, 2025.","ista":"Mondal S. 2025. Oxygen and sulfur redox: Conversion kinetics and phase equilibria. Institute of Science and Technology Austria.","apa":"Mondal, S. (2025). <i>Oxygen and sulfur redox: Conversion kinetics and phase equilibria</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20607\">https://doi.org/10.15479/AT-ISTA-20607</a>","ama":"Mondal S. Oxygen and sulfur redox: Conversion kinetics and phase equilibria. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20607\">10.15479/AT-ISTA-20607</a>","chicago":"Mondal, Soumyadip. “Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20607\">https://doi.org/10.15479/AT-ISTA-20607</a>.","short":"S. Mondal, Oxygen and Sulfur Redox: Conversion Kinetics and Phase Equilibria, Institute of Science and Technology Austria, 2025."},"department":[{"_id":"GradSch"},{"_id":"StFr"}],"title":"Oxygen and sulfur redox: Conversion kinetics and phase equilibria","date_updated":"2026-07-29T12:57:15Z","author":[{"id":"d25d21ef-dc8d-11ea-abe3-ec4576307f48","full_name":"Mondal, Soumyadip","last_name":"Mondal","first_name":"Soumyadip"}],"OA_place":"publisher","day":"19","acknowledgement":"I gratefully acknowledge the support of the ISTA Graduate School and the Scientific Service Units of\r\nISTA, whose resources made this work possible—especially the Imaging & Optics Facility, the Lab\r\nSupport Facility, and the Miba Machine Shop. I would like to thank two staff scientists in particular:\r\nRobert Hauschild (Imaging & Optics Facility) and Daniel Balazs (Lab Support Facility), for their\r\nassistance and advice. My PhD was partially funded by the Austrian Science Fund (FWF)\r\n(10.55776/P37169 and 10.55776/COE5).","file_date_updated":"2025-11-13T16:47:47Z","related_material":{"record":[{"id":"12065","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"13044","status":"public"},{"status":"deleted","relation":"part_of_dissertation","id":"20437"},{"id":"14687","relation":"part_of_dissertation","status":"public"}]},"publication_identifier":{"isbn":["978-3-99078-071-8"],"issn":["2663-337X"]},"das_tickbox":"1","ddc":["541","543","542"],"corr_author":"1","month":"09","status":"public","acknowledged_ssus":[{"_id":"Bio"},{"_id":"SSU"},{"_id":"LifeSc"},{"_id":"M-Shop"}],"degree_awarded":"PhD","supervisor":[{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander","orcid":"0000-0003-2902-5319","last_name":"Freunberger"}],"language":[{"iso":"eng"}],"date_created":"2025-11-07T12:40:54Z","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2025-09-19T00:00:00Z","publication_status":"published","year":"2025","article_processing_charge":"No","file":[{"file_id":"20644","date_updated":"2025-11-13T16:47:47Z","checksum":"b5eed6a3dccb83cd2a8a22e11fd7d867","creator":"smondal","file_name":"2025_Mondal_Soumyadip_Thesis.docx","date_created":"2025-11-13T16:47:47Z","relation":"source_file","access_level":"closed","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_size":32589295},{"creator":"smondal","file_name":"2025_Mondal_Soumyadip_Thesis.pdf","checksum":"89b1529e0a7b524f46624d73ecadf8cb","date_created":"2025-11-13T16:47:46Z","relation":"main_file","access_level":"closed","content_type":"application/pdf","file_size":5007370,"file_id":"20645","embargo":"2026-11-13","date_updated":"2025-11-13T16:47:46Z","embargo_to":"open_access"}],"type":"dissertation","page":"71"},{"type":"preprint","oa":1,"article_processing_charge":"No","year":"2025","publication_status":"draft","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-09-23T00:00:00Z","article_number":"2509.20539","date_created":"2026-03-04T11:56:29Z","abstract":[{"text":"Seymour's decomposition theorem is a hallmark result in matroid theory presenting a structural characterization of the class of regular matroids. Formalization of matroid theory faces many challenges, most importantly that only a limited number of notions and results have been implemented so far. In this work, we formalize the proof of the forward (composition) direction of Seymour's theorem for regular matroids. To this end, we develop a library in Lean 4 that implements definitions and results about totally unimodular matrices, vector matroids, their standard representations, regular matroids, and 1-, 2-, and 3-sums of matrices and binary matroids given by their standard representations. Using this framework, we formally state Seymour's decomposition theorem and implement a formally verified proof of the composition direction in the setting where the matroids have finite rank and may have infinite ground sets.","lang":"eng"}],"language":[{"iso":"eng"}],"OA_type":"green","das_tickbox":"1","status":"public","month":"09","publication":"arXiv","corr_author":"1","acknowledgement":"We would like to dedicate the paper to the memory of Klaus Truemper, whose monograph Matroid Decomposition [12]\r\nlaid the foundation for our entire work.","related_material":{"record":[{"id":"21393","relation":"dissertation_contains","status":"public"}]},"day":"23","arxiv":1,"OA_place":"repository","external_id":{"arxiv":["2509.20539"]},"author":[{"full_name":"Dvorak, Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","orcid":"0000-0001-5293-214X","first_name":"Martin"},{"first_name":"Tristan","last_name":"Figueroa-Reid","full_name":"Figueroa-Reid, Tristan"},{"full_name":"Hamadani, Rida","first_name":"Rida","last_name":"Hamadani"},{"full_name":"Hwang, Byung-Hak","first_name":"Byung-Hak","last_name":"Hwang"},{"last_name":"Karunus","first_name":"Evgenia","full_name":"Karunus, Evgenia"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"},{"first_name":"Alexander","last_name":"Meiburg","full_name":"Meiburg, Alexander"},{"full_name":"Nelson, Alexander","first_name":"Alexander","last_name":"Nelson"},{"full_name":"Nelson, Peter","first_name":"Peter","last_name":"Nelson"},{"last_name":"Sandey","first_name":"Mark","full_name":"Sandey, Mark"},{"first_name":"Ivan","last_name":"Sergeev","orcid":"0009-0004-9145-8785","full_name":"Sergeev, Ivan","id":"ca3c9187-9a72-11ee-a009-8af825d896b0"}],"date_updated":"2026-07-29T12:56:51Z","title":"Composition direction of Seymour's theorem for regular matroids — Formally verified","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"citation":{"apa":"Dvorak, M., Figueroa-Reid, T., Hamadani, R., Hwang, B.-H., Karunus, E., Kolmogorov, V., … Sergeev, I. (n.d.). Composition direction of Seymour’s theorem for regular matroids — Formally verified. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2509.20539\">https://doi.org/10.48550/arXiv.2509.20539</a>","ista":"Dvorak M, Figueroa-Reid T, Hamadani R, Hwang B-H, Karunus E, Kolmogorov V, Meiburg A, Nelson A, Nelson P, Sandey M, Sergeev I. Composition direction of Seymour’s theorem for regular matroids — Formally verified. arXiv, 2509.20539.","ama":"Dvorak M, Figueroa-Reid T, Hamadani R, et al. Composition direction of Seymour’s theorem for regular matroids — Formally verified. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2509.20539\">10.48550/arXiv.2509.20539</a>","mla":"Dvorak, Martin, et al. “Composition Direction of Seymour’s Theorem for Regular Matroids — Formally Verified.” <i>ArXiv</i>, 2509.20539, doi:<a href=\"https://doi.org/10.48550/arXiv.2509.20539\">10.48550/arXiv.2509.20539</a>.","ieee":"M. Dvorak <i>et al.</i>, “Composition direction of Seymour’s theorem for regular matroids — Formally verified,” <i>arXiv</i>. .","short":"M. Dvorak, T. Figueroa-Reid, R. Hamadani, B.-H. Hwang, E. Karunus, V. Kolmogorov, A. Meiburg, A. Nelson, P. Nelson, M. Sandey, I. Sergeev, ArXiv (n.d.).","chicago":"Dvorak, Martin, Tristan Figueroa-Reid, Rida Hamadani, Byung-Hak Hwang, Evgenia Karunus, Vladimir Kolmogorov, Alexander Meiburg, et al. “Composition Direction of Seymour’s Theorem for Regular Matroids — Formally Verified.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2509.20539\">https://doi.org/10.48550/arXiv.2509.20539</a>."},"doi":"10.48550/arXiv.2509.20539","_id":"21398","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2509.20539"}],"oa_version":"Preprint"},{"doi_confirm":"1","oa_version":"Published Version","_id":"20811","tmp":{"image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)"},"doi":"10.15479/AT-ISTA-20811","citation":{"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>","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.","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>","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>.","ieee":"S. Rella, “Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation,” Institute of Science and Technology Austria, 2025.","short":"S. Rella, Adaptive Processes in Biology and Culture: Models of Evolving Vaccine Resistance and the Record Statistics of Innovation, Institute of Science and Technology Austria, 2025.","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>."},"department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"FyKo"}],"date_updated":"2026-07-29T12:57:49Z","title":"Adaptive processes in biology and culture: Models of evolving vaccine resistance and the record statistics of innovation","author":[{"last_name":"Rella","first_name":"Simon","full_name":"Rella, Simon","id":"B4765ACA-AA38-11E9-AC9A-0930E6697425"}],"OA_place":"publisher","related_material":{"record":[{"id":"18307","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"9905"}]},"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2025-12-16T21:52:19Z","day":"15","corr_author":"1","month":"12","ddc":["616","576","614","519"],"status":"public","degree_awarded":"PhD","supervisor":[{"full_name":"Tkačik, Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gašper","last_name":"Tkačik","orcid":"0000-0002-6699-1455"},{"orcid":"0000-0001-8243-4694","last_name":"Kondrashov","first_name":"Fyodor","id":"44FDEF62-F248-11E8-B48F-1D18A9856A87","full_name":"Kondrashov, Fyodor"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"date_created":"2025-12-12T14:39:56Z","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"}],"has_accepted_license":"1","date_published":"2025-12-15T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"file_size":29019662,"access_level":"open_access","content_type":"application/pdf","date_created":"2025-12-16T21:49:52Z","relation":"main_file","file_name":"2025_Rella_Simon_Thesis.pdf","creator":"srella","checksum":"a0bd7a585720e60df284101b8afdf6bb","date_updated":"2025-12-16T21:49:52Z","success":1,"file_id":"20831"},{"file_id":"20832","date_updated":"2025-12-16T21:52:19Z","date_created":"2025-12-16T21:52:19Z","relation":"source_file","creator":"srella","checksum":"b8b3a90932ae1d96d307838710f46e32","file_name":"2025_Rella_Simon_Thesis_Sourcefiles.zip","file_size":42094025,"access_level":"open_access","content_type":"application/zip"}],"article_processing_charge":"No","year":"2025","publication_status":"published","oa":1,"type":"dissertation","page":"95"},{"doi_confirm":"1","oa_version":"Published Version","_id":"20276","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"citation":{"short":"M. Bhargava, Design and Control of Deformable Structures: From PCB Lighting Displays to Elastomer Robots, Institute of Science and Technology Austria, 2025.","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>.","ista":"Bhargava M. 2025. Design and control of deformable structures: From PCB lighting displays to elastomer robots. Institute of Science and Technology Austria.","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>","ieee":"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>."},"doi":"10.15479/AT-ISTA-20276","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"GradSch"},{"_id":"BeBi"}],"title":"Design and control of deformable structures: From PCB lighting displays to elastomer robots","date_updated":"2026-07-29T13:03:31Z","author":[{"full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","first_name":"Manas","last_name":"Bhargava","orcid":"0009-0007-6138-6890"}],"OA_place":"publisher","license":"https://creativecommons.org/licenses/by-nc/4.0/","day":"02","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","related_material":{"record":[{"relation":"part_of_dissertation","id":"13049","status":"public"},{"id":"18565","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"20286"}]},"file_date_updated":"2025-09-04T09:22:29Z","publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-065-7"]},"corr_author":"1","ddc":["000"],"month":"09","status":"public","degree_awarded":"PhD","language":[{"iso":"eng"}],"supervisor":[{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","abstract":[{"text":"Complex 3D shapes can be created by morphing flat 2D configurations. Such deformations\r\neither preserve the intrinsic material geometry (e.g., folding paper) or modify it through\r\nlocalized contraction. Once transformed, the 3D shape can be further controlled to achieve a\r\ntarget functionality. A key challenge is to take the material specifications and the actuation\r\nprocess as input to automatically design the target 3D shape and its functionality. This thesis\r\npresents two novel computational pipelines for the design and control of shape-morphing\r\nstructures used to create functional prototypes.\r\nThe first pipeline borrows from the art of origami to fold paper into intricate shapes and\r\napplies this principle to make 3D lighting displays. We introduce, PCBend a computational\r\ndesign approach that covers a surface with individually addressable RGB LEDs, effectively\r\nforming a low-resolution surface by folding rigid printed circuit boards (PCBs). We optimize\r\ncut patterns on PCBs to act as hinges and co-design LED placement, circuit routing, and\r\nfabrication constraints to produce PCB blueprints. The PCBs are fabricated using automated\r\nstandard manufacturing services with LEDs embedded on them. Finally, the fabricated PCBs\r\nare cut along the contour and folded onto a 3D-printed support. The 3D lighting display is\r\nthen controlled to display complex surface light patterns.\r\nCreating 3D shapes through folding is only possible if their planar configuration, called ”unfolding” exists without any distortion or overlap. Existing methods often permit distortion\r\nor require multiple patches, which are unsuitable for fabrication pipelines that rely on folding\r\nnon-stretchable materials. We reinforce such fabrication pipelines by providing a geometric\r\nrelaxation to the problem, where the input shape is modified to admit overlap-free unfolding.\r\nThe second fabrication pipeline extends shape morphing to soft robotics by emulating nature’s\r\nblueprint of distributed actuation. Inspired by vertebrates, we build musculoskeletal robots\r\nusing modular active actuators, employing Liquid Crystal Elastomers (LCEs) as shrinkable\r\nartificial muscles integrated with 3D-printed bones. The chemical composition of LCEs is\r\naltered to enable untethered actuation through infrared radiation, allowing active control of\r\nindividual muscles and their corresponding bones. The combined motion of individual bones\r\ndefines the robot’s overall shape and functionality. Our proposed system significantly expands\r\nboth the design and control spaces of soft robots, which we harness using our computational\r\ndesign tools. We build several physical robots that exhibit complex shape morphing and varied\r\nterrain navigation, showcasing the versatility of our pipeline.\r\nThis thesis explores applications ranging from intricate light patterns displayed on 3D shapes\r\nformed by folding rigid PCBs to untethered robots that use contractile muscles to exhibit\r\nshape morphing and locomotion. Through these examples, the thesis highlights how computational design and distributed actuation, integrated with novel materials, can transform\r\npassive structures into functional prototypes.","lang":"eng"}],"date_created":"2025-09-02T14:48:39Z","has_accepted_license":"1","alternative_title":["ISTA Thesis"],"date_published":"2025-09-02T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"date_created":"2025-09-03T10:40:52Z","relation":"main_file","creator":"mbhargav","file_name":"2025-Bhargava-Manas-Thesis.pdf","checksum":"5baf8ca46c86a94fc8380ff1007aabd4","file_size":161436245,"access_level":"open_access","content_type":"application/pdf","file_id":"20284","success":1,"date_updated":"2025-09-03T10:40:52Z"},{"date_created":"2025-09-03T13:18:05Z","relation":"source_file","file_name":"manas_phd_thesis_source_files.zip","creator":"mbhargav","checksum":"66878fafbc0074f88ddd18f24a9fc647","file_size":198831315,"access_level":"closed","content_type":"application/x-zip-compressed","file_id":"20285","date_updated":"2025-09-04T09:22:29Z"}],"publication_status":"published","year":"2025","article_processing_charge":"No","oa":1,"ec_funded":1,"type":"dissertation","page":"96"},{"_id":"20203","doi_confirm":"1","oa_version":"Published Version","project":[{"name":"Tribocharge: a multi-scale approach to an enduring problem in physics","grant_number":"949120","call_identifier":"H2020","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa"}],"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"chicago":"Sobarzo Ponce, Juan Carlos A. “Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20203\">https://doi.org/10.15479/AT-ISTA-20203</a>.","short":"J.C.A. Sobarzo Ponce, Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges, Institute of Science and Technology Austria, 2025.","ieee":"J. C. A. Sobarzo Ponce, “Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges,” Institute of Science and Technology Austria, 2025.","mla":"Sobarzo Ponce, Juan Carlos A. <i>Tribocharging of Identical Insulators: Triboelectric Series, Triboelectric Cycles and Surface Charges</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20203\">10.15479/AT-ISTA-20203</a>.","apa":"Sobarzo Ponce, J. C. A. (2025). <i>Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20203\">https://doi.org/10.15479/AT-ISTA-20203</a>","ama":"Sobarzo Ponce JCA. Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20203\">10.15479/AT-ISTA-20203</a>","ista":"Sobarzo Ponce JCA. 2025. Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges. Institute of Science and Technology Austria."},"doi":"10.15479/AT-ISTA-20203","department":[{"_id":"GradSch"},{"_id":"ScWa"}],"title":"Tribocharging of identical insulators: Triboelectric series, triboelectric cycles and surface charges","date_updated":"2026-07-29T13:11:25Z","author":[{"last_name":"Sobarzo Ponce","first_name":"Juan Carlos A","id":"4B807D68-AE37-11E9-AC72-31CAE5697425","full_name":"Sobarzo Ponce, Juan Carlos A"}],"OA_place":"publisher","day":"27","file_date_updated":"2025-08-28T08:19:07Z","publication_identifier":{"isbn":["978-3-99078-062-6"],"issn":["2663-337X"]},"related_material":{"record":[{"relation":"part_of_dissertation","id":"12109","status":"public"},{"id":"15322","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"19278","status":"public"}]},"acknowledgement":"The project in Chapter 2 has received funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 949120).\r\nThe project in Chapter 3 has received funding from the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation programme (Grant Agreement\r\nNo. 949120).\r\nThe project in Chapter 4 has received financing from the European Research Council grant\r\nagreement No. 949120 under the European Union’s Horizon 2020 research and innovation\r\nprogramme. The Analytical Instrumentation Center of the TU Wien acknowledges support by\r\nthe FFG project ‘ELSA’ under grant no. 884672. C.M.P. and M.O. acknowledge the state\r\nof Lower Austria and the European Regional Development Fund under grant no. WST3-F542638/004-2021.\r\n","month":"08","status":"public","ddc":["530"],"corr_author":"1","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"degree_awarded":"PhD","language":[{"iso":"eng"}],"supervisor":[{"first_name":"Scott R","last_name":"Waitukaitis","orcid":"0000-0002-2299-3176","full_name":"Waitukaitis, Scott R","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2025-08-21T11:42:59Z","has_accepted_license":"1","abstract":[{"text":"Tribocharging, or contact electrification, is the phenomenon in which two initially neutral materials exchange electric charge through contact and subsequent separation. While it is widely observed in everyday life and crucial to numerous natural processes, even the most basic aspects of tribocharging are still a mystery—what are the charge carriers involved and what drives their exchange? This work spans three separate projects that address different aspects of tribocharging. First, we introduce a novel strategy combining Finite Element Method (FEM) simulations with Kelvin Probe Force Microscopy (KPFM) to quantitatively extract surface charge density from surface voltage maps. Second, we present a simple theoretical model that allows for the existence of triboelectric cycles, under the assumption that multiple charge carrying species are involved. Third, we present experimental evidence that identical materials can spontaneously evolve into a triboelectric series, driven by contact history. Modeling this behavior enables the replication of experimental results with simulations, and even experimentally forcing the appearance of a pre-designed series by manipulating contact history. Together, the findings from these projects challenge traditional views on tribocharging, provide new tools for probing it, and open up new avenues of research—all with the hopes of bringing us closer to understanding this puzzling phenomenon.","lang":"eng"}],"alternative_title":["ISTA Thesis"],"publisher":"Institute of Science and Technology Austria","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2025-08-27T00:00:00Z","publication_status":"published","article_processing_charge":"No","year":"2025","file":[{"date_updated":"2025-08-27T14:50:32Z","file_id":"20237","success":1,"file_size":12667200,"content_type":"application/pdf","access_level":"open_access","relation":"main_file","date_created":"2025-08-27T14:50:32Z","file_name":"2025_Sobarzo_JuanCarlos_Thesis.pdf","creator":"jsobarzo","checksum":"661b9d3786cfc985be811befc3262bf5"},{"file_id":"20238","date_updated":"2025-08-28T08:19:07Z","checksum":"ca2f24e6c3b55912982521707552a0f5","file_name":"2025_Sobarzo_JuanCarlos_Thesis.zip","creator":"jsobarzo","date_created":"2025-08-27T14:50:32Z","relation":"source_file","access_level":"closed","content_type":"application/x-zip-compressed","file_size":18940521}],"ec_funded":1,"type":"dissertation","oa":1,"page":"96"},{"_id":"18565","quality_controlled":"1","oa_version":"Published Version","doi":"10.1111/cgf.15269","tmp":{"image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","short":"CC BY-NC (4.0)"},"citation":{"short":"M. Bhargava, C. Schreck, M. Freire, P.A. Hugron, S. Lefebvre, S. Sellán, B. Bickel, Computer Graphics Forum 44 (2025).","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>.","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>","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.","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>","ieee":"M. Bhargava <i>et al.</i>, “Mesh simplification for unfolding,” <i>Computer Graphics Forum</i>, vol. 44, no. 1. Wiley, 2025.","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>."},"department":[{"_id":"GradSch"},{"_id":"BeBi"}],"scopus_import":"1","volume":44,"title":"Mesh simplification for unfolding","date_updated":"2026-07-29T13:03:30Z","author":[{"id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","full_name":"Bhargava, Manas","orcid":"0009-0007-6138-6890","last_name":"Bhargava","first_name":"Manas"},{"first_name":"Camille","last_name":"Schreck","full_name":"Schreck, Camille","id":"2B14B676-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Freire","first_name":"M.","full_name":"Freire, M."},{"first_name":"P. A.","last_name":"Hugron","full_name":"Hugron, P. A."},{"last_name":"Lefebvre","first_name":"S.","full_name":"Lefebvre, S."},{"full_name":"Sellán, S.","first_name":"S.","last_name":"Sellán"},{"first_name":"Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"OA_place":"publisher","external_id":{"arxiv":["2408.06944"],"isi":["001357046100001"]},"day":"01","file_date_updated":"2025-04-16T09:06:45Z","article_type":"original","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.","related_material":{"record":[{"relation":"dissertation_contains","id":"20276","status":"public"}]},"publication_identifier":{"issn":["0167-7055"],"eissn":["1467-8659"]},"arxiv":1,"publication":"Computer Graphics Forum","month":"02","status":"public","ddc":["006"],"corr_author":"1","issue":"1","language":[{"iso":"eng"}],"OA_type":"hybrid","intvolume":"        44","date_created":"2024-11-19T09:14:32Z","has_accepted_license":"1","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."}],"publisher":"Wiley","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-02-01T00:00:00Z","article_number":"e15269","publication_status":"published","article_processing_charge":"Yes (via OA deal)","keyword":["fabrication","single patch unfolding","mesh simplification"],"year":"2025","file":[{"success":1,"file_id":"18567","date_updated":"2024-11-19T09:23:20Z","date_created":"2024-11-19T09:23:20Z","relation":"main_file","file_name":"Mesh_Simplification_For_Unfolding_cgf_submission_supplemental_video.mp4","creator":"mbhargav","checksum":"34acdd9bfbe43f00eb6c7656afef3ac6","file_size":36999751,"access_level":"open_access","content_type":"video/mp4"},{"success":1,"file_id":"19576","date_updated":"2025-04-16T09:06:45Z","relation":"main_file","date_created":"2025-04-16T09:06:45Z","checksum":"efb06b01bae37f470954601bc004374d","file_name":"2025_CompGraphicsForum_Bhargava.pdf","creator":"dernst","file_size":5188265,"content_type":"application/pdf","access_level":"open_access"}],"isi":1,"type":"journal_article","oa":1},{"language":[{"iso":"eng"}],"abstract":[{"text":"Natural organisms utilize distributed actuation through their musculoskeletal\r\nsystems to adapt their gait for traversing diverse terrains or to morph their\r\nbodies for varied tasks. A longstanding challenge in robotics is to emulate\r\nthis capability of natural organisms, which has motivated the development of\r\nnumerous soft robotic systems. However, such systems are generally optimized\r\nfor a single functionality, lack the ability to change form or function on\r\ndemand, or remain tethered to bulky control systems. To address these\r\nlimitations, we present a framework for designing and controlling robots that\r\nutilize distributed actuation. We propose a novel building block that\r\nintegrates 3D-printed bones with liquid crystal elastomer (LCE) muscles as\r\nlightweight actuators, enabling the modular assembly of musculoskeletal robots.\r\nWe developed LCE rods that contract in response to infrared radiation, thereby\r\nproviding localized, untethered control over the distributed skeletal network\r\nand producing global deformations of the robot. To fully capitalize on the\r\nextensive design space, we introduce two computational tools: one for\r\noptimizing the robot's skeletal graph to achieve multiple target deformations,\r\nand another for co-optimizing skeletal designs and control gaits to realize\r\ndesired locomotion. We validate our framework by constructing several robots\r\nthat demonstrate complex shape morphing, diverse control schemes, and\r\nenvironmental adaptability. Our system integrates advances in modular material\r\nbuilding, untethered and distributed control, and computational design to\r\nintroduce a new generation of robots that brings us closer to the capabilities\r\nof living organisms.","lang":"eng"}],"date_created":"2025-09-04T09:14:11Z","corr_author":"1","publication":"arXiv","month":"08","status":"public","type":"preprint","ec_funded":1,"oa":1,"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2025-08-31T00:00:00Z","publication_status":"draft","article_processing_charge":"No","year":"2025","project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","grant_number":"715767","call_identifier":"H2020","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"doi":"10.48550/arXiv.2508.05410","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"apa":"Bhargava, M., Hiraki, T., Strugaru, I.-M., Zhang, Y., Piovarci, M., Daraio, C., … Bickel, B. (n.d.). Computational design and fabrication of modular robots with untethered control. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2508.05410\">https://doi.org/10.48550/arXiv.2508.05410</a>","ama":"Bhargava M, Hiraki T, Strugaru I-M, et al. Computational design and fabrication of modular robots with untethered control. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2508.05410\">10.48550/arXiv.2508.05410</a>","ista":"Bhargava M, Hiraki T, Strugaru I-M, Zhang Y, Piovarci M, Daraio C, Iwai D, Bickel B. Computational design and fabrication of modular robots with untethered control. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2508.05410\">10.48550/arXiv.2508.05410</a>.","ieee":"M. Bhargava <i>et al.</i>, “Computational design and fabrication of modular robots with untethered control,” <i>arXiv</i>. .","mla":"Bhargava, Manas, et al. “Computational Design and Fabrication of Modular Robots with Untethered Control.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2508.05410\">10.48550/arXiv.2508.05410</a>.","short":"M. Bhargava, T. Hiraki, I.-M. Strugaru, Y. Zhang, M. Piovarci, C. Daraio, D. Iwai, B. Bickel, ArXiv (n.d.).","chicago":"Bhargava, Manas, Takefumi Hiraki, Irina-Malina Strugaru, Yuhan Zhang, Michael Piovarci, Chiara Daraio, Daisuke Iwai, and Bernd Bickel. “Computational Design and Fabrication of Modular Robots with Untethered Control.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2508.05410\">https://doi.org/10.48550/arXiv.2508.05410</a>."},"department":[{"_id":"BeBi"}],"_id":"20286","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2508.05410","open_access":"1"}],"OA_place":"repository","external_id":{"arxiv":["2508.05410"]},"day":"31","acknowledgement":"The authors express gratitude to Magali Lorion for assisting in the initial fabrication of LCEs,\r\nPengbin Tang for providing the code for simulating discrete elastic rods, the Imaging and\r\nOptics Facility at ISTA for assisting with the spectrometry measurements, and the MIBA\r\nmachine shop at ISTA for their support in manufacturing various devices.\r\nFunding: This project was supported by the European Research Council (ERC) under\r\nthe European Union’s Horizon 2020 research and innovation program (Grant Agreement No.\r\n715767 -– MATERIALIZABLE).","related_material":{"record":[{"relation":"dissertation_contains","id":"20276","status":"public"}]},"arxiv":1,"title":"Computational design and fabrication of modular robots with untethered control","date_updated":"2026-07-29T13:03:30Z","author":[{"full_name":"Bhargava, Manas","id":"FF8FA64C-AA6A-11E9-99AD-50D4E5697425","first_name":"Manas","last_name":"Bhargava","orcid":"0009-0007-6138-6890"},{"last_name":"Hiraki","first_name":"Takefumi","full_name":"Hiraki, Takefumi"},{"full_name":"Strugaru, Irina-Malina","id":"2afc607f-f128-11eb-9611-8f2a0dfcf074","last_name":"Strugaru","first_name":"Irina-Malina"},{"full_name":"Zhang, Yuhan","first_name":"Yuhan","last_name":"Zhang"},{"id":"62E473F4-5C99-11EA-A40E-AF823DDC885E","full_name":"Piovarci, Michael","first_name":"Michael","orcid":"0000-0002-5062-4474","last_name":"Piovarci"},{"last_name":"Daraio","first_name":"Chiara","full_name":"Daraio, Chiara"},{"full_name":"Iwai, Daisuke","last_name":"Iwai","first_name":"Daisuke"},{"full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"}]},{"department":[{"_id":"GradSch"},{"_id":"JoFi"}],"project":[{"name":"Protected states of quantum matter","_id":"eb9b30ac-77a9-11ec-83b8-871f581d53d2"},{"name":"QUANTUM INFORMATION SYSTEMS BEYOND CLASSICAL CAPABILITIES / P5- Integration of Superconducting Quantum Circuits","grant_number":"F07105","_id":"bdb108fd-d553-11ed-ba76-83dc74a9864f"},{"name":"International IST Doctoral Program","grant_number":"665385","call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"}],"doi":"10.15479/AT-ISTA-20371","citation":{"short":"A. Trioni, High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains, Institute of Science and Technology Austria, 2025.","chicago":"Trioni, Andrea. “High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20371\">https://doi.org/10.15479/AT-ISTA-20371</a>.","ama":"Trioni A. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20371\">10.15479/AT-ISTA-20371</a>","apa":"Trioni, A. (2025). <i>High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20371\">https://doi.org/10.15479/AT-ISTA-20371</a>","ista":"Trioni A. 2025. High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains. Institute of Science and Technology Austria.","mla":"Trioni, Andrea. <i>High-Impedance Quantum Circuits for Mesoscopic Physics: Geometric Superinductors and Insulating Josephson Chains</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20371\">10.15479/AT-ISTA-20371</a>.","ieee":"A. Trioni, “High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains,” Institute of Science and Technology Austria, 2025."},"_id":"20371","oa_version":"Published Version","doi_confirm":"1","file_date_updated":"2025-09-26T07:20:48Z","related_material":{"record":[{"status":"public","id":"8755","relation":"part_of_dissertation"}]},"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-067-1"]},"acknowledgement":"I also gratefully acknowledge the generous support of the NOMIS Foundation Project \"Protected\r\nStates of Quantum Matter\" and the grant from the Beyond-C consortium. Their funding\r\nmade this research possible and gave me the freedom to ask ambitious questions, and try to\r\nanswer them.\r\n","day":"23","OA_place":"publisher","author":[{"id":"42F71B44-F248-11E8-B48F-1D18A9856A87","full_name":"Trioni, Andrea","last_name":"Trioni","first_name":"Andrea"}],"date_updated":"2026-07-29T13:12:10Z","title":"High-impedance quantum circuits for mesoscopic physics: Geometric superinductors and insulating Josephson Chains","alternative_title":["ISTA Thesis"],"abstract":[{"lang":"eng","text":"Quantum mechanics reveals a world that defies classical determinism, where uncertainty, superposition, and fluctuations are fundamental aspects. Engineering devices that harness these quantum features requires not only precision, but also a deep understanding of how they interact with their surrounding environment. Superconducting circuits, which exploit\r\nmacroscopic quantum coherence in low-loss superconducting materials, provide a scalable platform for implementing such systems. Among the critical elements in these circuits, superinductors—high-impedance, dissipation-free inductive components—play a central role by suppressing charge fluctuations. They allow quantum states to be delocalized in phase space, protect qubits from environmental noise, and facilitate access to phenomena such as dual Josephson physics and ultra-strong coupling regimes. \r\nThis thesis explores two complementary implementations of high-impedance circuits: geometric superinductors, demonstrating that high impedance can be achieved beyond kinetic inductance,\r\nand Josephson junction chains, used to investigate both microwave mode properties and DC transport across the superconductor-to-insulator transition. \r\nPart I addresses geometric superinductors. Contrary to the common belief that high-impedance superconducting circuits require kinetic inductance, we demonstrate that purely geometric designs can achieve characteristic impedance exceeding the resistance quantum. By exploiting mutual coupling between adjacent turns, coil-based inductors achieve enhanced self-inductance, creating a reliable platform for qubits and resonators. Modeling, simulation, fabrication, and\r\ncharacterization confirm that these elements behave as superinductor. With low loss, high linearity, and minimal stray capacitance, these elements are reproducible, free of uncontrolled tunneling events, and capable of strong magnetic coupling. This establishes geometric superinductors as robust, single-wave-function superconducting devices suitable for hardware protected qubits and hybrid systems.\r\nPart II presents classical numerical simulations of a Quantum Phase Slip circuit to study dual Shapiro steps. The circuit consists of an ideal Quantum Phase Slip element embedded in a resistive-inductive environment with a parasitic capacitance.\r\nPart III extends the investigation of high characteristic-impedance circuit elements to one-dimensional Josephson junction chains, which act as a quantum simulator for many-body physics and the superconductor–insulator transition. Different devices are realized on both sides of the DC phase transition, showing either a supercurrent branch or Coulomb blockade at zero bias. The effect of the crossover on microwave modes, however, remains insufficiently investigated. Studying these modes provides insight into the interplay between disorder and phase-slip events. Small differences in circuit component sizes determine which side of the transition a device falls on, making these results relevant not only for fundamental understanding but also for the design of quantum devices, emphasizing the crucial role of the\r\nelectromagnetic environment in stabilizing and controlling fragile quantum states. \r\nTogether, these results illustrate how carefully engineered high characteristic-impedance elements provide a link between macroscopic circuits and the inherently uncertain quantum world, enabling experiments that probe, control, and ultimately exploit quantum fluctuations for applications in quantum information, metrology, solid state physics and beyond.\r\n\r\n"}],"date_created":"2025-09-23T09:57:57Z","has_accepted_license":"1","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"supervisor":[{"id":"4B591CBA-F248-11E8-B48F-1D18A9856A87","full_name":"Fink, Johannes M","orcid":"0000-0001-8112-028X","last_name":"Fink","first_name":"Johannes M"}],"degree_awarded":"PhD","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"corr_author":"1","ddc":["539"],"status":"public","month":"09","page":"202","ec_funded":1,"type":"dissertation","oa":1,"year":"2025","article_processing_charge":"No","publication_status":"published","file":[{"file_id":"20392","date_updated":"2025-09-25T14:25:31Z","date_created":"2025-09-25T07:15:05Z","relation":"main_file","file_name":"2025_Trioni_Andrea_Thesis.pdf","checksum":"6fb925648dfa5f4384814c552ee2f099","creator":"atrioni","file_size":22351676,"access_level":"open_access","content_type":"application/pdf"},{"file_size":60079009,"access_level":"closed","content_type":"application/x-zip-compressed","date_created":"2025-09-25T14:45:43Z","relation":"source_file","checksum":"619dc614bdfbf3999b76ac8890b2cebd","file_name":"2025_Trioni_Andrea_Thesis.zip","creator":"atrioni","date_updated":"2025-09-26T07:20:48Z","file_id":"20396"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_published":"2025-09-23T00:00:00Z"},{"oa_version":"Published Version","quality_controlled":"1","_id":"20008","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"citation":{"apa":"Avvakumov, S., Filakovský, M., Opršal, J., Tasinato, G., &#38; Wagner, U. (2025). Hardness of 4-colouring G-colourable graphs. In <i>Proceedings of the 57th Annual ACM Symposium on Theory of Computing</i> (pp. 72–83). Prague, Czechia: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3717823.3718154\">https://doi.org/10.1145/3717823.3718154</a>","ama":"Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. Hardness of 4-colouring G-colourable graphs. In: <i>Proceedings of the 57th Annual ACM Symposium on Theory of Computing</i>. Association for Computing Machinery; 2025:72-83. doi:<a href=\"https://doi.org/10.1145/3717823.3718154\">10.1145/3717823.3718154</a>","ista":"Avvakumov S, Filakovský M, Opršal J, Tasinato G, Wagner U. 2025. Hardness of 4-colouring G-colourable graphs. Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 72–83.","ieee":"S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, and U. Wagner, “Hardness of 4-colouring G-colourable graphs,” in <i>Proceedings of the 57th Annual ACM Symposium on Theory of Computing</i>, Prague, Czechia, 2025, pp. 72–83.","mla":"Avvakumov, Sergey, et al. “Hardness of 4-Colouring G-Colourable Graphs.” <i>Proceedings of the 57th Annual ACM Symposium on Theory of Computing</i>, Association for Computing Machinery, 2025, pp. 72–83, doi:<a href=\"https://doi.org/10.1145/3717823.3718154\">10.1145/3717823.3718154</a>.","short":"S. Avvakumov, M. Filakovský, J. Opršal, G. Tasinato, U. Wagner, in:, Proceedings of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp. 72–83.","chicago":"Avvakumov, Sergey, Marek Filakovský, Jakub Opršal, Gianluca Tasinato, and Uli Wagner. “Hardness of 4-Colouring G-Colourable Graphs.” In <i>Proceedings of the 57th Annual ACM Symposium on Theory of Computing</i>, 72–83. Association for Computing Machinery, 2025. <a href=\"https://doi.org/10.1145/3717823.3718154\">https://doi.org/10.1145/3717823.3718154</a>."},"doi":"10.1145/3717823.3718154","project":[{"call_identifier":"FWF","_id":"26611F5C-B435-11E9-9278-68D0E5697425","name":"Algorithms for Embeddings and Homotopy Theory","grant_number":"P31312"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"}],"scopus_import":"1","department":[{"_id":"UlWa"}],"date_updated":"2026-07-29T13:13:17Z","title":"Hardness of 4-colouring G-colourable graphs","author":[{"last_name":"Avvakumov","orcid":"0000-0002-7840-5062","first_name":"Sergey","full_name":"Avvakumov, Sergey","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marek","last_name":"Filakovský","id":"3E8AF77E-F248-11E8-B48F-1D18A9856A87","full_name":"Filakovský, Marek"},{"first_name":"Jakub","last_name":"Opršal","orcid":"0000-0003-1245-3456","full_name":"Opršal, Jakub","id":"ec596741-c539-11ec-b829-c79322a91242"},{"last_name":"Tasinato","first_name":"Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","full_name":"Tasinato, Gianluca"},{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","orcid":"0000-0002-1494-0568","first_name":"Uli"}],"conference":{"name":"STOC: Symposium on Theory of Computing","location":"Prague, Czechia","start_date":"2025-06-23","end_date":"2025-06-27"},"OA_place":"publisher","file_date_updated":"2025-07-14T06:42:58Z","publication_identifier":{"issn":["0737-8017"],"isbn":["9798400715105"]},"acknowledgement":"This research was supported by the Austrian Science Fund (FWF project P31312-N35) and by project MSCAfellow5_MUNI (CZ.02.01.01/00/22_010/0003229) financed by the Ministry of Education, Youth and Sports of the Czech Republic. This project has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No 101034413.","related_material":{"record":[{"id":"20339","relation":"dissertation_contains","status":"public"}]},"day":"15","ddc":["000"],"month":"06","status":"public","corr_author":"1","publication":"Proceedings of the 57th Annual ACM Symposium on Theory of Computing","OA_type":"hybrid","language":[{"iso":"eng"}],"publisher":"Association for Computing Machinery","date_created":"2025-07-13T22:01:23Z","abstract":[{"lang":"eng","text":"We study the complexity of a class of promise graph homomorphism problems. For a fixed graph H, the H-colouring problem is to decide whether a given graph has a homomorphism to H. By a result of Hell and Nešetřil, this problem is NP-hard for any non-bipartite loop-less graph H. Brakensiek and Guruswami [SODA 2018] conjectured the hardness extends to promise graph homomorphism problems as follows: fix a pair of non-bipartite loop-less graphs G, H such that there is a homomorphism from G to H, it is NP-hard to distinguish between graphs that are G-colourable and those that are not H-colourable. We confirm this conjecture in the cases when both G and H are 4-colourable. This is a common generalisation of previous results of Khanna, Linial, and Safra [Comb. 20(3): 393-415 (2000)] and of Krokhin and Opršal [FOCS 2019]. The result is obtained by combining the algebraic approach to promise constraint satisfaction with methods of topological combinatorics and equivariant obstruction theory."}],"has_accepted_license":"1","date_published":"2025-06-15T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"content_type":"application/pdf","access_level":"open_access","file_size":940827,"checksum":"2c9ae7ad0102c41124976f4cb5182760","file_name":"2025_STOC_Avvakumov.pdf","creator":"dernst","relation":"main_file","date_created":"2025-07-14T06:42:58Z","date_updated":"2025-07-14T06:42:58Z","file_id":"20013","success":1}],"article_processing_charge":"Yes (in subscription journal)","year":"2025","publication_status":"published","oa":1,"type":"conference","ec_funded":1,"page":"72-83"},{"publication_identifier":{"issn":["2663-337X"]},"file_date_updated":"2025-09-11T12:26:14Z","related_material":{"record":[{"id":"20008","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"15168"},{"id":"19860","relation":"part_of_dissertation","status":"public"}]},"day":"10","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","OA_place":"publisher","author":[{"last_name":"Tasinato","first_name":"Gianluca","full_name":"Tasinato, Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425"}],"date_updated":"2026-07-29T13:13:18Z","title":"Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems","department":[{"_id":"GradSch"},{"_id":"UlWa"}],"tmp":{"short":"CC BY-NC-SA (4.0)","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","image":"/images/cc_by_nc_sa.png"},"doi":"10.15479/AT-ISTA-20339","citation":{"ieee":"G. Tasinato, “Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems,” Institute of Science and Technology Austria, 2025.","mla":"Tasinato, Gianluca. <i>Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20339\">10.15479/AT-ISTA-20339</a>.","ama":"Tasinato G. Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20339\">10.15479/AT-ISTA-20339</a>","ista":"Tasinato G. 2025. Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems. Institute of Science and Technology Austria.","apa":"Tasinato, G. (2025). <i>Topological methods in discrete geometry and theoretical computer science: Measure partitioning and constraint satisfaction problems</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20339\">https://doi.org/10.15479/AT-ISTA-20339</a>","chicago":"Tasinato, Gianluca. “Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20339\">https://doi.org/10.15479/AT-ISTA-20339</a>.","short":"G. Tasinato, Topological Methods in Discrete Geometry and Theoretical Computer Science: Measure Partitioning and Constraint Satisfaction Problems, Institute of Science and Technology Austria, 2025."},"doi_confirm":"1","oa_version":"Published Version","_id":"20339","page":"106","oa":1,"type":"dissertation","file":[{"file_size":2218562,"access_level":"closed","content_type":"application/x-zip-compressed","date_created":"2025-09-11T12:24:12Z","relation":"source_file","creator":"gtasinat","file_name":"thesis-source.zip","checksum":"ae097a515b9bb4d4b025ca854ae2ed76","date_updated":"2025-09-11T12:24:12Z","file_id":"20344"},{"date_created":"2025-09-11T12:26:14Z","relation":"main_file","file_name":"2025_Tasinato_Gianluca_Thesis.pdf","creator":"gtasinat","checksum":"04b2e016409e52167ce42b0eef839fbf","file_size":10071982,"access_level":"open_access","content_type":"application/pdf","file_id":"20345","success":1,"date_updated":"2025-09-11T12:26:14Z"}],"article_processing_charge":"No","year":"2025","publication_status":"published","date_published":"2025-09-10T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","publisher":"Institute of Science and Technology Austria","alternative_title":["ISTA Thesis"],"has_accepted_license":"1","abstract":[{"lang":"eng","text":"This thesis investigates the interplay between algebraic and topological methods and combinatorial problems, focusing on approximate graph colourings and mass partitioning. The unifying theme throughout the dissertation is the use of continuous maps and symmetry constraints to extract combinatorial insights.\r\n\r\nWe first explore approximate graph colouring problems and more generally promise constraint satisfaction problems. Using tools from equivariant topology in combination with the general theory of polymorphism of a promise constraint satisfaction problem, we establish hardness for specific types of approximations.\r\n\r\nIn the second part, we address mass partitioning problems, where one seeks to divide geometric objects or measures in Euclidean space into parts of equal size using hyperplanes. Employing techniques from topological combinatorics (configuration space/test map setup and Borsuk–Ulam type theorems), we both obtain a new equipartitioning result in the and provide a fast algorithm for computing equipartitioning of point sets in 3D.\r\n"}],"date_created":"2025-09-10T12:17:55Z","supervisor":[{"full_name":"Wagner, Uli","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","first_name":"Uli","last_name":"Wagner","orcid":"0000-0002-1494-0568"}],"language":[{"iso":"eng"}],"degree_awarded":"PhD","ddc":["516"],"month":"09","status":"public","corr_author":"1"},{"OA_place":"publisher","day":"27","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"9311"},{"id":"18266","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"19508","status":"public"},{"status":"public","id":"17037","relation":"part_of_dissertation"}]},"file_date_updated":"2025-08-28T14:47:12Z","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","publication_identifier":{"issn":["2663-337X"]},"title":"Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games","date_updated":"2026-07-29T13:14:37Z","author":[{"first_name":"Raimundo J","orcid":"0000-0001-5103-038X","last_name":"Saona Urmeneta","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J"}],"citation":{"chicago":"Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>.","short":"R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.","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>.","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.","ista":"Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.","apa":"Saona Urmeneta, R. J. (2025). <i>Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>","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>"},"doi":"10.15479/AT-ISTA-20234","project":[{"grant_number":"S11407","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"oa_version":"Published Version","doi_confirm":"1","_id":"20234","oa":1,"ec_funded":1,"type":"dissertation","page":"125","date_published":"2025-08-27T00:00:00Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file":[{"success":1,"file_id":"20240","date_updated":"2025-08-28T14:47:07Z","file_name":"2025_Saona_Raimundo_Thesis.pdf","checksum":"394a651f7de7085e509ef856ffe7bd97","creator":"rsaonaur","relation":"main_file","date_created":"2025-08-28T14:47:07Z","content_type":"application/pdf","access_level":"open_access","file_size":1503623},{"date_updated":"2025-08-28T14:47:12Z","file_id":"20241","file_size":622747,"access_level":"closed","content_type":"application/zip","date_created":"2025-08-28T14:47:12Z","relation":"source_file","creator":"rsaonaur","file_name":"2025_Saona_Raimundo_Thesis.zip","checksum":"09fb2633e66aac80433d373f4180c5b4"}],"publication_status":"published","article_processing_charge":"No","year":"2025","supervisor":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X"}],"language":[{"iso":"eng"}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","date_created":"2025-08-27T14:00:13Z","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."}],"alternative_title":["ISTA Thesis"],"ddc":["519"],"corr_author":"1","month":"08","status":"public","degree_awarded":"PhD"},{"_id":"19508","quality_controlled":"1","oa_version":"Published Version","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"citation":{"chicago":"Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and Bruno Ziliotto. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” <i>Dynamic Games and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s13235-025-00636-4\">https://doi.org/10.1007/s13235-025-00636-4</a>.","short":"L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic Games and Applications 15 (2025) 1517–1535.","mla":"Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” <i>Dynamic Games and Applications</i>, vol. 15, Springer Nature, 2025, pp. 1517–35, doi:<a href=\"https://doi.org/10.1007/s13235-025-00636-4\">10.1007/s13235-025-00636-4</a>.","ieee":"L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Random zero-sum dynamic games on infinite directed graphs,” <i>Dynamic Games and Applications</i>, vol. 15. Springer Nature, pp. 1517–1535, 2025.","apa":"Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., &#38; Ziliotto, B. (2025). Random zero-sum dynamic games on infinite directed graphs. <i>Dynamic Games and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s13235-025-00636-4\">https://doi.org/10.1007/s13235-025-00636-4</a>","ista":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. 2025. Random zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications. 15, 1517–1535.","ama":"Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum dynamic games on infinite directed graphs. <i>Dynamic Games and Applications</i>. 2025;15:1517-1535. doi:<a href=\"https://doi.org/10.1007/s13235-025-00636-4\">10.1007/s13235-025-00636-4</a>"},"tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"doi":"10.1007/s13235-025-00636-4","scopus_import":"1","department":[{"_id":"MaKw"},{"_id":"KrCh"}],"volume":15,"date_updated":"2026-07-29T13:14:36Z","title":"Random zero-sum dynamic games on infinite directed graphs","author":[{"first_name":"Luc","last_name":"Attia","full_name":"Attia, Luc"},{"id":"9aa8388e-d003-11ee-8458-c4c1d7447977","full_name":"Lichev, Lyuben","first_name":"Lyuben","last_name":"Lichev"},{"full_name":"Mitsche, Dieter","last_name":"Mitsche","first_name":"Dieter"},{"first_name":"Raimundo J","last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"},{"last_name":"Ziliotto","first_name":"Bruno","full_name":"Ziliotto, Bruno"}],"OA_place":"publisher","external_id":{"isi":["001449708900001"]},"publication_identifier":{"eissn":["2153-0793"],"issn":["2153-0785"]},"article_type":"original","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20234"}]},"file_date_updated":"2025-12-30T08:13:04Z","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). This work was supported by the French Agence Nationale de la Recherche (ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002 (GrHyDy), by Fondecyt grant 1220174, by ANID Chile grant ACT210005, and by the ERC CoG 863818 (ForM-SMArt) grant. This collaboration was mainly conducted during a 1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at University of Chile in 2023, under the IRL program of CNRS. This work was supported by Fondation CFM pour la Recherche. This paper has also been funded by the Agence Nationale de la Recherche under grant ANR-17-EURE-0010 (Investissements d’Avenir program).","day":"01","corr_author":"1","publication":"Dynamic Games and Applications","ddc":["000"],"month":"11","status":"public","OA_type":"hybrid","language":[{"iso":"eng"}],"PlanS_conform":"1","intvolume":"        15","abstract":[{"text":"We consider random two-player zero-sum dynamic games with perfect information on a class of infinite directed graphs. Starting from a fixed vertex, the players take turns to move a token along the edges of the graph. Every vertex is assigned a payoff known in advance by both players. Every time the token visits a vertex, Player 2 pays Player 1 the corresponding payoff. We consider a distribution over such games by assigning i.i.d. payoffs to the vertices. On the one hand, for acyclic directed graphs of bounded degree and sub-exponential expansion, we show that, when the duration of the game tends to infinity, the value converges almost surely to a constant at an exponential rate dominated in terms of the expansion. On the other hand, for the infinite d-ary tree (that does not fall into the previous class of graphs), we show convergence at a double-exponential rate.","lang":"eng"}],"has_accepted_license":"1","date_created":"2025-04-06T22:01:32Z","publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-11-01T00:00:00Z","year":"2025","article_processing_charge":"Yes (via OA deal)","publication_status":"published","file":[{"date_updated":"2025-12-30T08:13:04Z","file_id":"20891","success":1,"content_type":"application/pdf","access_level":"open_access","file_size":570994,"checksum":"b3a1b7eef40c9ac2acf3fef563081694","creator":"dernst","file_name":"2025_DynGamesAppl_Attia.pdf","relation":"main_file","date_created":"2025-12-30T08:13:04Z"}],"type":"journal_article","isi":1,"ec_funded":1,"oa":1,"page":"1517-1535"},{"volume":50,"scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"citation":{"short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505.","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>.","ama":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. 2025;50(1):482-505. doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>","ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","apa":"Attia, L., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>","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>.","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."},"doi":"10.1287/moor.2023.0297","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"oa_version":"None","quality_controlled":"1","_id":"17037","article_type":"original","publication_identifier":{"issn":["0364-765X"],"eissn":["1526-5471"]},"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].","related_material":{"record":[{"id":"20234","relation":"dissertation_contains","status":"public"}]},"day":"01","external_id":{"isi":["001184648000001"]},"author":[{"first_name":"Luc","last_name":"Attia","full_name":"Attia, Luc"},{"first_name":"Miquel","last_name":"Oliu-Barton","full_name":"Oliu-Barton, Miquel"},{"last_name":"Saona Urmeneta","orcid":"0000-0001-5103-038X","first_name":"Raimundo J","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425"}],"date_updated":"2026-07-29T13:14:36Z","title":"Marginal values of a stochastic game","publisher":"Institute for Operations Research and the Management Sciences","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."}],"date_created":"2024-05-22T11:41:14Z","intvolume":"        50","OA_type":"closed access","language":[{"iso":"eng"}],"issue":"1","month":"02","publication":"Mathematics of Operations Research","status":"public","das_tickbox":"1","page":"482-505","type":"journal_article","ec_funded":1,"isi":1,"article_processing_charge":"No","year":"2025","publication_status":"published","date_published":"2025-02-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"}]