[{"status":"public","publisher":"Fundació de la comunitat valenciana SCITO","doi":"10.29363/nanoge.matsusspring.2025.220","date_updated":"2026-07-22T06:54:55Z","day":"03","title":"Solid state diffusion in metal-semiconductors core-shell nanoparticle","date_published":"2025-03-03T00:00:00Z","month":"03","department":[{"_id":"MaIb"}],"conference":{"start_date":"2025-03-03","end_date":"2025-03-07","name":"MATSUS: Materials for Sustainable Development Conference","location":"Sevilla, Spain"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” In Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO, 2025. https://doi.org/10.29363/nanoge.matsusspring.2025.220.","ama":"Horta S. Solid state diffusion in metal-semiconductors core-shell nanoparticle. In: Proceedings of the MATSUS Spring 2025 Conference. Fundació de la comunitat valenciana SCITO; 2025. doi:10.29363/nanoge.matsusspring.2025.220","ieee":"S. Horta, “Solid state diffusion in metal-semiconductors core-shell nanoparticle,” in Proceedings of the MATSUS Spring 2025 Conference, Sevilla, Spain, 2025.","apa":"Horta, S. (2025). Solid state diffusion in metal-semiconductors core-shell nanoparticle. In Proceedings of the MATSUS Spring 2025 Conference. Sevilla, Spain: Fundació de la comunitat valenciana SCITO. https://doi.org/10.29363/nanoge.matsusspring.2025.220","ista":"Horta S. 2025. Solid state diffusion in metal-semiconductors core-shell nanoparticle. Proceedings of the MATSUS Spring 2025 Conference. MATSUS: Materials for Sustainable Development Conference, 220.","mla":"Horta, Sharona. “Solid State Diffusion in Metal-Semiconductors Core-Shell Nanoparticle.” Proceedings of the MATSUS Spring 2025 Conference, 220, Fundació de la comunitat valenciana SCITO, 2025, doi:10.29363/nanoge.matsusspring.2025.220.","short":"S. Horta, in:, Proceedings of the MATSUS Spring 2025 Conference, Fundació de la comunitat valenciana SCITO, 2025."},"publication_status":"published","publication":"Proceedings of the MATSUS Spring 2025 Conference","language":[{"iso":"eng"}],"date_created":"2025-07-21T08:22:29Z","type":"conference_abstract","article_processing_charge":"No","author":[{"id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","full_name":"Horta, Sharona","first_name":"Sharona","last_name":"Horta"}],"_id":"20054","corr_author":"1","quality_controlled":"1","OA_type":"closed access","year":"2025","article_number":"220","oa_version":"None"},{"abstract":[{"lang":"eng","text":"We establish an isomorphism of complex K-theory of the moduli space M of “SL n​ ”-Higgs bundles of degree d and rank n (in the sense of Hausel–Thaddeus) and twisted complex K-theory of the orbifold M of PGL n​ -Higgs bundles of degree e, where (n,d)=(n,e)=1. Along the way, we prove the vanishing of torsion for H ∗ ( M ) and certain twisted complex K-theory groups of M . We also extend Arinkin’s autoduality of compactified Jacobian to a derived equivalence between SL n​ - and PGL n​ -Hitchin systems over the elliptic locus. In the appendix, we develop a formalism of G-sheaves of spectra, generalising equivariant homotopy theory to a relative setting."}],"title":"Complex K-theory of moduli spaces of Higgs bundles","date_published":"2025-03-20T00:00:00Z","date_updated":"2026-07-23T11:16:00Z","publication_identifier":{"issn":["1435-9855"],"eissn":["1435-9863"]},"doi":"10.4171/jems/1601","OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"publication":"Journal of the European Mathematical Society","publication_status":"epub_ahead","DOAJ_listed":"1","main_file_link":[{"url":"https://doi.org/10.4171/JEMS/1601","open_access":"1"}],"acknowledgement":"It is a pleasure to thank Tom Baird for sharing his insights about vanishing of torsion for H.M{1\r\n2/. Furthermore, we would like to thank him for bringing [25] to our attention. We also thank Alexander Kupers for enlightening conversations about the Atiyah–Hirzebruch spectral sequence and for pointing out a reference. We are grateful to Victoria Hoskins and Simon Pepin-Lehalleur for sharing a preprint of their recent paper on a motivic version of topological mirror symmetry and for useful remarks on Section 6. Anne Larsen pointed out that our previous proof Lemma 4.5 was incomplete, we thank her for bringing this to our attention. We are grateful to the anonymous referee for many valuable comments that have improved the paper tremendously. The report we received was one of the most detailed referee report either of us has ever seen. We thank them for their hard work and the resulting contribution to this paper. Michael Groechenig was supported by an NSERC discovery grant and an Alfred P. Sloan\r\nfellowship. Shiyu Shen has received funding from the European Union’s Horizon 2020 research\r\nand innovation program under the Marie Skłodowska-Curie grant agreement No. 101034413.","das_tickbox":"1","_id":"20043","ddc":["510"],"article_processing_charge":"Yes","arxiv":1,"type":"journal_article","date_created":"2025-07-21T07:54:50Z","corr_author":"1","article_type":"original","day":"20","status":"public","ec_funded":1,"publisher":"EMS Press","mathsc":["14H60","19L50"],"citation":{"mla":"Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society, EMS Press, 2025, doi:10.4171/jems/1601.","short":"M. Groechenig, S. Shen, Journal of the European Mathematical Society (2025).","apa":"Groechenig, M., & Shen, S. (2025). Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. EMS Press. https://doi.org/10.4171/jems/1601","ieee":"M. Groechenig and S. Shen, “Complex K-theory of moduli spaces of Higgs bundles,” Journal of the European Mathematical Society. EMS Press, 2025.","chicago":"Groechenig, Michael, and Shiyu Shen. “Complex K-Theory of Moduli Spaces of Higgs Bundles.” Journal of the European Mathematical Society. EMS Press, 2025. https://doi.org/10.4171/jems/1601.","ama":"Groechenig M, Shen S. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1601","ista":"Groechenig M, Shen S. 2025. Complex K-theory of moduli spaces of Higgs bundles. Journal of the European Mathematical Society."},"external_id":{"isi":["001608254800001"],"arxiv":["2212.10695"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"03","department":[{"_id":"TaHa"}],"project":[{"call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"author":[{"last_name":"Groechenig","first_name":"Michael","full_name":"Groechenig, Michael"},{"id":"544cccd3-9005-11ec-87bc-94aef1c5b814","full_name":"Shen, Shiyu","first_name":"Shiyu","orcid":"0000-0002-4444-8718","last_name":"Shen"}],"isi":1,"oa_version":"Published Version","OA_type":"gold","year":"2025","quality_controlled":"1"},{"_id":"20051","ddc":["000"],"article_processing_charge":"Yes (via OA deal)","arxiv":1,"type":"conference","date_created":"2025-07-21T08:16:15Z","corr_author":"1","license":"https://creativecommons.org/licenses/by/4.0/","abstract":[{"text":"We revisit the majority problem in the population protocol communication model, as first studied by Angluin et al. (Distributed Computing 2008). We consider a more general version of this problem known as plurality consensus, which has already been studied intensively in the literature. In this problem, each node in a system of n nodes, has initially one of k different opinions, and they need to agree on the (relative) majority opinion. In particular, we consider the important and intensively studied model of Undecided State Dynamics.\r\nOur main contribution is an almost tight lower bound on the stabilization time: we prove that there exists an initial configuration, even with bias \\Delta = \\omega(\\sqrt{n\\log n}), where stabilization requires \\Omega(kn\\log \\frac {\\sqrt n} {k \\log n}) interactions, or equivalently, \\Omega(k\\log \\frac {\\sqrt n} {k \\log n}) parallel time for any k = o\\left(\\frac {\\sqrt n}{\\log n}\\right). This bound is tight for any k \\le n^{\\frac 1 2 - \\epsilon}, where \\epsilon >0 can be any small constant, as Amir et al.~(PODC'23) gave a O(k\\log n) parallel time upper bound for k = O\\left(\\frac {\\sqrt n} {\\log ^2 n}\\right).","lang":"eng"}],"title":"An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model","date_published":"2025-06-13T00:00:00Z","date_updated":"2026-07-24T12:48:28Z","publication_identifier":{"isbn":[" 9798400718854"]},"doi":"10.1145/3732772.3733505","OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"publication":"Proceedings of the ACM Symposium on Principles of Distributed Computing","publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/I5862,grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with\r\nadditional funding from the netidee SCIENCE Stiftung, 2020–2024\r\nand the German Research Foundation (DFG), grant 470029389\r\n(FlexNets).","author":[{"last_name":"El-Hayek","orcid":"0000-0003-4268-7368","first_name":"Antoine","full_name":"El-Hayek, Antoine","id":"888a098e-fcac-11ee-aff7-d347be57b725"},{"first_name":"Robert","last_name":"Elsässer","full_name":"Elsässer, Robert"},{"full_name":"Schmid, Stefan","first_name":"Stefan","last_name":"Schmid"}],"project":[{"call_identifier":"H2020","name":"The design and evaluation of modern fully dynamic data structures","grant_number":"101019564","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"isi":1,"oa_version":"Published Version","file_date_updated":"2025-08-04T09:10:55Z","OA_type":"hybrid","year":"2025","quality_controlled":"1","day":"13","has_accepted_license":"1","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_created":"2025-08-04T09:10:55Z","date_updated":"2025-08-04T09:10:55Z","file_name":"2025_PODC_ElHayek.pdf","creator":"dernst","file_id":"20115","checksum":"52976d226f3f691aa519d71c1c718fa5","file_size":2200347,"access_level":"open_access"}],"ec_funded":1,"publisher":"Association for Computing Machinery","status":"public","tmp":{"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","image":"/images/cc_by.png"},"related_material":{"record":[{"relation":"dissertation_contains","id":"22281","status":"public"}]},"citation":{"ama":"El-Hayek A, Elsässer R, Schmid S. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In: Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery; 2025. doi:10.1145/3732772.3733505","chicago":"El-Hayek, Antoine, Robert Elsässer, and Stefan Schmid. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” In Proceedings of the ACM Symposium on Principles of Distributed Computing. Association for Computing Machinery, 2025. https://doi.org/10.1145/3732772.3733505.","ieee":"A. El-Hayek, R. Elsässer, and S. Schmid, “An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model,” in Proceedings of the ACM Symposium on Principles of Distributed Computing, Huatulco, Mexico, 2025.","apa":"El-Hayek, A., Elsässer, R., & Schmid, S. (2025). An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. In Proceedings of the ACM Symposium on Principles of Distributed Computing. Huatulco, Mexico: Association for Computing Machinery. https://doi.org/10.1145/3732772.3733505","ista":"El-Hayek A, Elsässer R, Schmid S. 2025. An almost tight lower bound for plurality consensus with undecided state dynamics in the population protocol model. Proceedings of the ACM Symposium on Principles of Distributed Computing. PODC: Symposium on Principles of Distributed Computing.","mla":"El-Hayek, Antoine, et al. “An Almost Tight Lower Bound for Plurality Consensus with Undecided State Dynamics in the Population Protocol Model.” Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025, doi:10.1145/3732772.3733505.","short":"A. El-Hayek, R. Elsässer, S. Schmid, in:, Proceedings of the ACM Symposium on Principles of Distributed Computing, Association for Computing Machinery, 2025."},"conference":{"end_date":"2025-06-20","start_date":"2025-06-16","location":"Huatulco, Mexico","name":"PODC: Symposium on Principles of Distributed Computing"},"external_id":{"isi":["001525534800066"],"arxiv":["2505.02765"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","department":[{"_id":"MoHe"}]},{"corr_author":"1","_id":"19982","article_processing_charge":"No","arxiv":1,"type":"conference","page":"750-784","date_created":"2025-07-10T13:08:57Z","OA_place":"repository","language":[{"iso":"eng"}],"oa":1,"publication_status":"published","publication":"Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.15069"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’sHorizon 2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian Science Fund(FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","abstract":[{"lang":"eng","text":"Dynamically maintaining the minimum cut in a graph G under edge insertions and deletion is a fundamental problem in dynamic graph algorithms for which no conditional lower bound on the time per operation exists. In an n-node graph the best known (1 + o (1))-approximate algorithm takes update time [14]. If the minimum cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n o (1) update time exists [8].\r\nWe present the first fully dynamic algorithm for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical contribution is to show that it suffices to consider small-volume cuts in suitably contracted graphs."}],"title":"Fully dynamic approximate minimum cut in subpolynomial time per operation","date_published":"2025-01-07T00:00:00Z","date_updated":"2026-07-24T12:48:28Z","publication_identifier":{"eisbn":["9781611978322"]},"doi":"10.1137/1.9781611978322.22","oa_version":"Preprint","OA_type":"green","year":"2025","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422","name":"Efficient algorithms"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"},{"_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775"}],"author":[{"id":"888a098e-fcac-11ee-aff7-d347be57b725","full_name":"El-Hayek, Antoine","first_name":"Antoine","orcid":"0000-0003-4268-7368","last_name":"El-Hayek"},{"first_name":"Monika H","orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Li, Jason","last_name":"Li","first_name":"Jason"}],"citation":{"short":"A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–784.","mla":"El-Hayek, Antoine, et al. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–84, doi:10.1137/1.9781611978322.22.","ista":"El-Hayek A, Henzinger M, Li J. 2025. Fully dynamic approximate minimum cut in subpolynomial time per operation. Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 750–784.","ama":"El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784. doi:10.1137/1.9781611978322.22","chicago":"El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.","ieee":"A. El-Hayek, M. Henzinger, and J. Li, “Fully dynamic approximate minimum cut in subpolynomial time per operation,” in Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms, New Orleans, LA, United States, 2025, pp. 750–784.","apa":"El-Hayek, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate minimum cut in subpolynomial time per operation. In Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans, LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978322.22"},"conference":{"location":"New Orleans, LA, United States","name":"SODA: Symposium on Discrete Algorithms","end_date":"2025-01-15","start_date":"2025-01-12"},"external_id":{"arxiv":["2412.15069"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","department":[{"_id":"MoHe"}],"day":"07","status":"public","publisher":"Society for Industrial and Applied Mathematics","ec_funded":1,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"22281"}]}},{"author":[{"first_name":"Zhen","last_name":"He","full_name":"He, Zhen"},{"full_name":"Westoby, Matthew","first_name":"Matthew","last_name":"Westoby"},{"last_name":"Ren","first_name":"Shaoting","full_name":"Ren, Shaoting","id":"2066b6dd-2d54-11ef-8f8c-c94731161817"},{"full_name":"Zhao, Chuanxi","first_name":"Chuanxi","last_name":"Zhao"},{"first_name":"Yifei","last_name":"He","full_name":"He, Yifei"},{"full_name":"Zhang, Tianzhao","last_name":"Zhang","first_name":"Tianzhao"},{"full_name":"Yang, Wei","first_name":"Wei","last_name":"Yang"}],"quality_controlled":"1","file_date_updated":"2026-07-27T08:19:34Z","oa_version":"Published Version","article_number":"e129","year":"2025","OA_type":"gold","has_accepted_license":"1","tmp":{"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","image":"/images/cc_by.png"},"status":"public","publisher":"Cambridge University Press","scopus_import":"1","file":[{"relation":"main_file","success":1,"file_name":"2026_JournalGlaciology_He.pdf","creator":"dernst","file_id":"22411","checksum":"6b50f39880c70b2e58baaa7713848ab5","file_size":6023889,"access_level":"open_access","content_type":"application/pdf","date_created":"2026-07-27T08:19:34Z","date_updated":"2026-07-27T08:19:34Z"}],"day":"10","article_type":"original","volume":71,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"FrPe"}],"month":"11","citation":{"ista":"He Z, Westoby M, REN S, Zhao C, He Y, Zhang T, Yang W. 2025. Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. 71, e129.","ieee":"Z. He et al., “Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier,” Journal of Glaciology, vol. 71. Cambridge University Press, 2025.","chicago":"He, Zhen, Matthew Westoby, SHAOTING REN, Chuanxi Zhao, Yifei He, Tianzhao Zhang, and Wei Yang. “Quantifying the Seasonal Dynamics of a Transitional Ice Cliff-Pond System on a Debris-Covered Glacier.” Journal of Glaciology. Cambridge University Press, 2025. https://doi.org/10.1017/jog.2025.10104.","ama":"He Z, Westoby M, REN S, et al. Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. 2025;71. doi:10.1017/jog.2025.10104","apa":"He, Z., Westoby, M., REN, S., Zhao, C., He, Y., Zhang, T., & Yang, W. (2025). Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier. Journal of Glaciology. Cambridge University Press. https://doi.org/10.1017/jog.2025.10104","short":"Z. He, M. Westoby, S. REN, C. Zhao, Y. He, T. Zhang, W. Yang, Journal of Glaciology 71 (2025).","mla":"He, Zhen, et al. “Quantifying the Seasonal Dynamics of a Transitional Ice Cliff-Pond System on a Debris-Covered Glacier.” Journal of Glaciology, vol. 71, e129, Cambridge University Press, 2025, doi:10.1017/jog.2025.10104."},"type":"journal_article","supplementarymaterial":"no","date_created":"2025-11-23T23:01:40Z","_id":"20669","ddc":["550"],"das_tickbox":"1","article_processing_charge":"Yes","intvolume":" 71","PlanS_conform":"1","researchdata_availability":"yes","date_updated":"2026-07-27T08:21:14Z","doi":"10.1017/jog.2025.10104","publication_identifier":{"eissn":["1727-5652"],"issn":["0022-1430"]},"abstract":[{"text":"Ice cliffs and supraglacial ponds are key drivers of mass loss on debris-covered glaciers. However, the relationship between melt ponds and adjacent ice cliffs has not been fully explored. We investigated the seasonal drainage patterns of a melt pond on the debris-covered Zhuxi Glacier in southeast Tibet and estimated the mass loss of its adjacent ice cliff during 2023-2024. Using hourly time-lapse photogrammetry we built a series of high-resolution point clouds to quantify the evolution of the ice cliff-pond system. Our findings indicate that subaerial melting and undercutting were the primary mechanisms of ice cliff mass loss during summer. In winter when the pond water level dropped, ice cliff calving became the dominant mode of ice loss. As the water level rose in spring, calving and subaerial melting occurred simultaneously and ice loss from calving accounted for approximately 19.5 % of total ice loss from February to July 2024. Our results reveal the transitional state of this ice cliff-pond system, exhibiting characteristics of both melt hotspots and lake-terminating calving fronts, and highlight the interplay between seasonal drainage-refill pond and differing modes of ice loss on adjacent ice cliff. Future research should focus on additional high-resolution monitoring of similar systems and incorporation of ice cliff-pond dynamics in glacier-scale numerical models. ","lang":"eng"}],"date_published":"2025-11-10T00:00:00Z","title":"Quantifying the seasonal dynamics of a transitional ice cliff-pond system on a debris-covered glacier","acknowledgement":"This study was supported by the National Natural Science Foundation of China (grant nos. 42271138, 42201144), Lhasa Science and Technology Plan Project (LSKJ202406), the National Key R&D Program of China (grant nos. 2024YFF0808601), and the Science and Technology Plan Projects of Tibet Autonomous Region (Grants XZ202501ZY0081 and XZ202401ZY0003). ZH additionally acknowledges mobility funding provided by China Scholarship Council (CSC), supporting an extended research stay at the University of Plymouth, where much of this research was completed.","language":[{"iso":"eng"}],"OA_place":"publisher","publication_status":"published","publication":"Journal of Glaciology","DOAJ_listed":"1","dataavailabilitystatement":"The Python scripts to processing of the time-lapse photos to point clouds, as well as ICP registration, are available on Zenodo (https://doi.org/10.5281/zenodo.16272541).","oa":1},{"doi_confirm":"1","corr_author":"1","article_processing_charge":"No","ddc":["000"],"_id":"19759","page":"84","date_created":"2025-05-28T16:20:48Z","type":"dissertation","oa":1,"alternative_title":["ISTA Thesis"],"publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"title":"Robust image classification with 1-Lipschitz networks","date_published":"2025-05-30T00:00:00Z","abstract":[{"text":"Despite generating remarkable results in various computer vision tasks, deep learning comes\r\nwith some surprising shortcomings. For example, tiny perturbations, often imperceptible to\r\nthe human eye, can completely change the predictions of image classifiers. Despite a decade\r\nof research, the field has made limited progress in developing image classifiers that are both\r\naccurate and robust. This thesis aims to address this gap.\r\nAs our first contribution, we aim to simplify the process of training certifiably robust image\r\nclassifiers. We do this by designing a convolutional layer that does not require executing an\r\niterative procedure in every forward pass, but relies on an explicit bound instead. We also\r\npropose a loss function that allows optimizing for a particular margin more precisely.\r\nNext, we provide an overview and comparison of various methods that create robust image\r\nclassifiers by constraining the Lipschitz constant. This is important since generally longer\r\ntraining times and more parameters improve the performance of robust classifiers, making it\r\nchallenging to determine the most practical and effective methods from existing literature.\r\nIn 1-Lipschitz classification, the performance of current methods is still much worse than what\r\nwe expect on the simple tasks we consider. Therefore, we next investigate potential causes of\r\nthis shortcoming. We first consider the role of the activation function. We prove a theoretical\r\nshortcoming of the commonly used activation function, and provide an alternative without it.\r\nHowever this theoretical improvement does barely translate to the empirical performance of\r\nrobust classifiers, suggesting a different bottleneck.\r\nTherefore, in the final chapter, we study how the performance depends on the amount of\r\ntraining data. We prove that in the worst case, we might require far more data to train a\r\nrobust classifier compared to a normal one. We furthermore find that the amount of training\r\ndata is a key determinant of the performance current methods achieve on popular datasets.\r\nAdditionally, we show that linear subspaces exist with tiny data variance, and yet we can\r\nstill train very accurate classifiers after projecting into those subspaces. This shows that on\r\nthe datasets considered, enforcing robustness in classification makes the task strictly more\r\nchallenging.\r\n\r\n","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/10.15479/at-ista-19759","date_updated":"2026-07-27T12:47:44Z","year":"2025","oa_version":"Published Version","file_date_updated":"2025-06-10T18:14:03Z","supervisor":[{"first_name":"Christoph","orcid":"0000-0001-8622-7887","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph"}],"author":[{"id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","first_name":"Bernd","last_name":"Prach"}],"publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink. If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","citation":{"ista":"Prach B. 2025. Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria.","apa":"Prach, B. (2025). Robust image classification with 1-Lipschitz networks. Institute of Science and Technology Austria. https://doi.org/10.15479/10.15479/at-ista-19759","ieee":"B. Prach, “Robust image classification with 1-Lipschitz networks,” Institute of Science and Technology Austria, 2025.","chicago":"Prach, Bernd. “Robust Image Classification with 1-Lipschitz Networks.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/10.15479/at-ista-19759.","ama":"Prach B. Robust image classification with 1-Lipschitz networks. 2025. doi:10.15479/10.15479/at-ista-19759","short":"B. Prach, Robust Image Classification with 1-Lipschitz Networks, Institute of Science and Technology Austria, 2025.","mla":"Prach, Bernd. Robust Image Classification with 1-Lipschitz Networks. Institute of Science and Technology Austria, 2025, doi:10.15479/10.15479/at-ista-19759."},"degree_awarded":"PhD","month":"05","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","day":"30","publisher":"Institute of Science and Technology Austria","status":"public","file":[{"relation":"main_file","content_type":"application/pdf","date_created":"2025-06-10T18:11:05Z","date_updated":"2025-06-10T18:11:05Z","file_name":"ThesisFinal.pdf","creator":"bprach","file_id":"19829","checksum":"e5108e759014e2a9020c973c778fafc9","access_level":"open_access","file_size":3578077},{"relation":"source_file","file_name":"ThesisFinal.zip","creator":"bprach","access_level":"closed","file_size":74894357,"checksum":"51bf6c11fb6d8a9f8010b458c600a83f","file_id":"19830","date_created":"2025-06-10T18:14:03Z","content_type":"application/x-zip-compressed","date_updated":"2025-06-10T18:14:03Z"}],"related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"15039"},{"status":"public","relation":"part_of_dissertation","id":"18874"},{"relation":"part_of_dissertation","id":"17426","status":"public"},{"id":"11839","relation":"part_of_dissertation","status":"public"}]},"has_accepted_license":"1"},{"author":[{"last_name":"Chalupa","first_name":"Marek","full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"id":"b26baa86-3308-11ec-87b0-8990f34baa85","full_name":"Mazzocchi, Nicolas Adrien","first_name":"Nicolas Adrien","last_name":"Mazzocchi"},{"first_name":"Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","full_name":"Sarac, Naci E"}],"project":[{"call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"quality_controlled":"1","oa_version":"Published Version","file_date_updated":"2025-06-02T08:13:11Z","OA_type":"hybrid","year":"2025","has_accepted_license":"1","file":[{"date_updated":"2025-06-02T08:13:11Z","content_type":"application/pdf","date_created":"2025-06-02T08:13:11Z","file_id":"19768","checksum":"a27fa245be8d83421e9127b48a09c8af","file_size":420669,"access_level":"open_access","file_name":"2025_TACAS_ChalupaMarek.pdf","creator":"dernst","relation":"main_file","success":1}],"scopus_import":"1","ec_funded":1,"status":"public","publisher":"Springer Nature","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20147"}]},"tmp":{"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","image":"/images/cc_by.png"},"day":"01","external_id":{"arxiv":["2501.16088"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":15696,"month":"05","department":[{"_id":"ToHe"}],"citation":{"apa":"Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2025). Automating the analysis of quantitative automata with QuAK. In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 15696, pp. 303–312). Springer Nature. https://doi.org/10.1007/978-3-031-90643-5_16","chicago":"Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Automating the Analysis of Quantitative Automata with QuAK.” In 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 15696:303–12. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90643-5_16.","ama":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. Automating the analysis of quantitative automata with QuAK. In: 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 15696. Springer Nature; 2025:303-312. doi:10.1007/978-3-031-90643-5_16","ieee":"M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Automating the analysis of quantitative automata with QuAK,” in 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 2025, vol. 15696, pp. 303–312.","ista":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. 2025. Automating the analysis of quantitative automata with QuAK. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. , LNCS, vol. 15696, 303–312.","mla":"Chalupa, Marek, et al. “Automating the Analysis of Quantitative Automata with QuAK.” 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 15696, Springer Nature, 2025, pp. 303–12, doi:10.1007/978-3-031-90643-5_16.","short":"M. Chalupa, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 303–312."},"type":"conference","page":"303-312","date_created":"2025-05-25T22:17:07Z","ddc":["000"],"_id":"19741","article_processing_charge":"No","arxiv":1,"intvolume":" 15696","corr_author":"1","date_updated":"2026-07-27T12:48:18Z","publication_identifier":{"isbn":["9783031906428"],"issn":["0302-9743"],"eissn":["1611-3349"]},"doi":"10.1007/978-3-031-90643-5_16","abstract":[{"text":"Quantitative automata model beyond-boolean aspects of systems: every execution is mapped to a real number by incorporating weighted transitions and value functions that generalize acceptance conditions of boolean w-automata. Despite the theoretical advances in systems analysis through quantitative automata, the first comprehensive software tool for quantitative automata (Quantitative Automata Kit, or QuAK) was developed only recently. QuAK implements algorithms for solving standard decision problems, e.g., emptiness and universality, as well as constructions for safety and liveness of quantitative automata. We present the architecture of QuAK, which reflects that all of these problems reduce to either checking inclusion between two quantitative automata or computing the highest value achievable by an automaton—its so-called top value. We improve QuAK by extending these two algorithms with an option to return, alongside their results, an ultimately periodic word witnessing the algorithm’s output, as well as implementing a new safety-liveness decomposition algorithm that can handle nondeterministic automata, making QuAK more informative and capable.","lang":"eng"}],"title":"Automating the analysis of quantitative automata with QuAK","date_published":"2025-05-01T00:00:00Z","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093.","OA_place":"publisher","language":[{"iso":"eng"}],"alternative_title":["LNCS"],"oa":1,"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","publication_status":"published"},{"year":"2025","OA_type":"green","oa_version":"Preprint","author":[{"orcid":"0000-0002-7778-3221","first_name":"Eugenia B","last_name":"Iofinova","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B"},{"full_name":"Jovanovic, Andrej","first_name":"Andrej","last_name":"Jovanovic"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"}],"project":[{"_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","grant_number":"101158077","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning"},{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"citation":{"apa":"Iofinova, E. B., Jovanovic, A., & Alistarh, D.-A. (n.d.). Position: It’s time to act on the risk of efficient personalized text generation. arXiv. https://doi.org/10.48550/arXiv.2502.06560","ama":"Iofinova EB, Jovanovic A, Alistarh D-A. Position: It’s time to act on the risk of efficient personalized text generation. arXiv. doi:10.48550/arXiv.2502.06560","chicago":"Iofinova, Eugenia B, Andrej Jovanovic, and Dan-Adrian Alistarh. “Position: It’s Time to Act on the Risk of Efficient Personalized Text Generation.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2502.06560.","ieee":"E. B. Iofinova, A. Jovanovic, and D.-A. Alistarh, “Position: It’s time to act on the risk of efficient personalized text generation,” arXiv. .","ista":"Iofinova EB, Jovanovic A, Alistarh D-A. Position: It’s time to act on the risk of efficient personalized text generation. arXiv, 10.48550/arXiv.2502.06560.","mla":"Iofinova, Eugenia B., et al. “Position: It’s Time to Act on the Risk of Efficient Personalized Text Generation.” ArXiv, doi:10.48550/arXiv.2502.06560.","short":"E.B. Iofinova, A. Jovanovic, D.-A. Alistarh, ArXiv (n.d.)."},"department":[{"_id":"GradSch"},{"_id":"DaAl"}],"month":"06","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","external_id":{"arxiv":["2502.06560"]},"day":"02","related_material":{"record":[{"relation":"dissertation_contains","id":"21854","status":"public"}]},"status":"public","corr_author":"1","arxiv":1,"article_processing_charge":"No","_id":"21858","date_created":"2026-05-11T08:55:23Z","type":"preprint","publication":"arXiv","publication_status":"draft","oa":1,"language":[{"iso":"eng"}],"OA_place":"repository","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST Austria through resources\r\nprovided by Scientific Computing (SciComp). EI was supported in part by the FWF DK VGSCO,\r\ngrant agreement number W1260-N35. AJ was supported in part by ERC Proof-of-Concept Grant\r\nFastML, grant agreement 101158077.","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2502.06560"}],"date_published":"2025-06-02T00:00:00Z","title":"Position: It's time to act on the risk of efficient personalized text generation","abstract":[{"text":"The recent surge in high-quality open-source Generative AI text models (colloquially: LLMs), as well as efficient finetuning techniques, have opened the possibility of creating high-quality personalized models that generate text attuned to a specific individual’s needs and are capable of credibly imitating their writing style by refining an open-source model with that person’s own data. The technology to create such models is accessible to private individuals, and training and running such models can be done cheaply on consumer-grade hardware. While these advancements are a huge gain for usability and privacy, this position paper argues that the practical feasibility of impersonating specific individuals also introduces novel safety risks. For instance, this technology enables the creation of phishing emails\r\nor fraudulent social media accounts, based on small amounts of publicly available text, or by the individuals themselves to escape AI text detection. We further argue that these risks are complementary to—and distinct from—the much-discussed risks of other impersonation attacks such as image, voice, or video deepfakes, and are not adequately addressed by the larger research community, or the current generation of open- and closed-source models.","lang":"eng"}],"doi":"10.48550/arXiv.2502.06560","date_updated":"2026-07-27T12:50:03Z"},{"_id":"20138","ddc":["000","519"],"das_tickbox":"1","article_processing_charge":"No","type":"dissertation","page":"167","date_created":"2025-08-05T14:33:59Z","doi_confirm":"1","corr_author":"1","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","abstract":[{"text":"The evolution shapes the world around us.\r\nNot only in biology, where the fittest individuals spread their genes but also in physics and social dynamics, the evolutionary forces determine the development of a state of matter or public opinions.\r\nMany models describe these dynamics.\r\nThis thesis examines the role of the structure in the models of selection.\r\nThe population structure is represented as a graph or a network, and each vertex is occupied by one individual.\r\nEvery individual has a type and fitness that represents the reproductive potential and depends on the type, occupied vertex, and the arrangement of the neighbors.\r\nThe evolution is modeled in discrete steps; in one step, one individual is replaced by a neighbor selected randomly with the influence of fitness.\r\n\r\n\r\n\r\nThe role of the networks is widely examined in the literature.\r\nThe structures that promote the spread of the desired type compared to the structureless case are called amplifiers.\r\nThe existence of amplifiers in various settings is an intensively studied topic, and in some settings, the amplifiers have been identified.\r\nMoreover, there are other important questions about the number of steps until one type spreads over the whole network (fixation time), the computational complexity, and the questions about the robustness of these processes.\r\n\r\n\r\nThis thesis explores the role of structure in evolution from many perspectives.\r\nFirst, it introduces different models and various choices that can be made in the models of evolution.\r\nIt highlights the role of the structure in the real world and how this is reflected in these models.\r\nThen, it describes the previous results and open problems.\r\nSecond, the thesis describes an amplifier for two variants of the Moran process: one with a constant birth rate and the other with a constant death rate.\r\nThis is an important contribution to the robustness of the amplification.\r\nThird, the thesis determines the complexity of spatial games.\r\nThese are processes where the fitness comes from a game, and the strength of selection is high.\r\nIt shows that determining the fate of cooperation in these games is a PSPACE-complete problem.\r\nFourth, the thesis describes the amplifier of cooperation for spatial games.\r\nThis is the first amplifier in this setting.\r\nFifth, the thesis examines the coexistence in the Moran process with environmental heterogeneity.\r\nIn this setting, the fitness depends not only on the type of the individual but also on the occupied vertex.\r\nThe chapter determines the relationship between the interactions of vertices of different types and the coexistence time.\r\nSixth, the thesis examines the social balance on networks and proposes a stochastic dynamic partially aware of the state of the graph, which reaches a balanced position quickly.\r\nFinally, the thesis presents conclusions and outlines the directions for future work.\r\n\r\n\r\n","lang":"eng"}],"title":"Structural properties of games on graphs","date_published":"2025-08-05T00:00:00Z","date_updated":"2026-07-27T12:52:04Z","publication_identifier":{"issn":["2663-337X"]},"doi":"10.15479/AT-ISTA-20138","OA_place":"publisher","language":[{"iso":"eng"}],"alternative_title":["ISTA Thesis"],"oa":1,"publication_status":"published","acknowledgement":"This work was supported by the European Research Council CoG 863818 (ForMSMArt) and Austrian Science Fund 10.55776/COE12.\r\n","author":[{"last_name":"Svoboda","orcid":"0000-0002-1419-3267","first_name":"Jakub","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425"}],"project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"publisher_comment":"Chapter 4 is copyrighted by CC BY-NC-ND\r\n4.0, which prohibits derivatives. Chapter 6 is copyrighted: Copyright (2025) by the American\r\nPhysical Society. For a copy, redistribution, or modification needs to be permitted by the\r\nAmerican Physical Society.\r\n","oa_version":"Published Version","file_date_updated":"2025-08-21T11:48:39Z","year":"2025","supervisor":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu"}],"day":"05","has_accepted_license":"1","file":[{"date_updated":"2025-08-14T09:54:43Z","date_created":"2025-08-14T09:54:43Z","content_type":"application/pdf","access_level":"open_access","file_size":5927291,"file_id":"20177","checksum":"c6c4df9777f4537940de7ab392ad57e2","creator":"jsvoboda","file_name":"2025_Svoboda_Jakub_Thesis.pdf","success":1,"relation":"main_file"},{"date_updated":"2025-08-21T11:48:39Z","content_type":"application/zip","date_created":"2025-08-14T09:55:20Z","file_id":"20178","checksum":"485e9f9822821bc03666d245d80aaa08","access_level":"closed","file_size":6731815,"file_name":"2025_Svoboda_Jakub_Thesis.zip","creator":"jsvoboda","relation":"source_file"}],"publisher":"Institute of Science and Technology Austria","ec_funded":1,"status":"public","related_material":{"record":[{"relation":"part_of_dissertation","id":"12787","status":"public"},{"status":"public","id":"12101","relation":"part_of_dissertation"},{"status":"public","id":"12257","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"15297"},{"status":"public","relation":"part_of_dissertation","id":"18703"}]},"tmp":{"short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","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"},"degree_awarded":"PhD","citation":{"mla":"Svoboda, Jakub. Structural Properties of Games on Graphs. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20138.","short":"J. Svoboda, Structural Properties of Games on Graphs, Institute of Science and Technology Austria, 2025.","apa":"Svoboda, J. (2025). Structural properties of games on graphs. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20138","chicago":"Svoboda, Jakub. “Structural Properties of Games on Graphs.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20138.","ama":"Svoboda J. Structural properties of games on graphs. 2025. doi:10.15479/AT-ISTA-20138","ieee":"J. Svoboda, “Structural properties of games on graphs,” Institute of Science and Technology Austria, 2025.","ista":"Svoboda J. 2025. Structural properties of games on graphs. Institute of Science and Technology Austria."},"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","month":"08","department":[{"_id":"GradSch"},{"_id":"KrCh"}]},{"_id":"21144","article_processing_charge":"No","arxiv":1,"type":"journal_article","page":"1630-1654","date_created":"2026-02-05T13:33:05Z","issue":"3","intvolume":" 35","abstract":[{"lang":"eng","text":"This paper deals with the algorithmic aspects of solving feasibility problems of semidefinite programming (SDP), aka linear matrix inequalities (LMIs). Since in some SDP instances all feasible solutions have irrational entries, numerical solvers that work with rational numbers can only find an approximate solution. We study the following question: Is it possible to certify feasibility of a given SDP using an approximate solution that is sufficiently close to some exact solution? Existing approaches make the assumption that there exist rational feasible solutions (and use techniques such as rounding and lattice reduction algorithms). We propose an alternative approach that does not need this assumption. More specifically, we show how to construct a system of polynomial equations whose set of real solutions is guaranteed to have an isolated correct solution (assuming that the target exact solution is maximum-rank). This allows, in particular, for us to use algorithms from real algebraic geometry for solving systems of polynomial equations, yielding a hybrid (or symbolic-numerical) method for SDPs. We experimentally compare it with a pure symbolic method in [D. Henrion, S. Naldi, and M. Safey El Din, SIAM J. Optim., 26 (2016), pp. 2512–2539]; the hybrid method was able to certify feasibility of many SDP instances on which the aforementioned paper failed. Our approach may have further applications, such as refining an approximate solution using methods of numerical algebraic geometry for systems of polynomial equations."}],"title":"Certifying solutions of degenerate semidefinite programs","date_published":"2025-09-01T00:00:00Z","date_updated":"2026-07-27T14:30:41Z","publication_identifier":{"issn":["1052-6234"],"eissn":["1095-7189"]},"doi":"10.1137/24m1664691","OA_place":"repository","language":[{"iso":"eng"}],"oa":1,"publication_status":"published","publication":"SIAM Journal on Optimization","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.13625","open_access":"1"}],"author":[{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Naldi, Simone","first_name":"Simone","last_name":"Naldi"},{"last_name":"Zapata","first_name":"Jeferson","full_name":"Zapata, Jeferson","id":"00223538-AF8F-11E9-A4C7-F729E6697425"}],"oa_version":"Preprint","OA_type":"green","year":"2025","quality_controlled":"1","article_type":"original","day":"01","status":"public","publisher":"Society for Industrial and Applied Mathematics","related_material":{"record":[{"status":"public","id":"21957","relation":"dissertation_contains"}]},"citation":{"ista":"Kolmogorov V, Naldi S, Zapata J. 2025. Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. 35(3), 1630–1654.","apa":"Kolmogorov, V., Naldi, S., & Zapata, J. (2025). Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. Society for Industrial and Applied Mathematics. https://doi.org/10.1137/24m1664691","ieee":"V. Kolmogorov, S. Naldi, and J. Zapata, “Certifying solutions of degenerate semidefinite programs,” SIAM Journal on Optimization, vol. 35, no. 3. Society for Industrial and Applied Mathematics, pp. 1630–1654, 2025.","ama":"Kolmogorov V, Naldi S, Zapata J. Certifying solutions of degenerate semidefinite programs. SIAM Journal on Optimization. 2025;35(3):1630-1654. doi:10.1137/24m1664691","chicago":"Kolmogorov, Vladimir, Simone Naldi, and Jeferson Zapata. “Certifying Solutions of Degenerate Semidefinite Programs.” SIAM Journal on Optimization. Society for Industrial and Applied Mathematics, 2025. https://doi.org/10.1137/24m1664691.","short":"V. Kolmogorov, S. Naldi, J. Zapata, SIAM Journal on Optimization 35 (2025) 1630–1654.","mla":"Kolmogorov, Vladimir, et al. “Certifying Solutions of Degenerate Semidefinite Programs.” SIAM Journal on Optimization, vol. 35, no. 3, Society for Industrial and Applied Mathematics, 2025, pp. 1630–54, doi:10.1137/24m1664691."},"volume":35,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2405.13625"]},"month":"09","department":[{"_id":"VlKo"},{"_id":"GradSch"}]},{"file_date_updated":"2026-01-29T14:31:42Z","oa_version":"Published Version","year":"2025","OA_type":"gold","quality_controlled":"1","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"author":[{"full_name":"Yu, Hanlin","first_name":"Hanlin","last_name":"Yu"},{"first_name":"Befrin","last_name":"Inal","full_name":"Inal, Befrin"},{"last_name":"Arvanitidis","first_name":"Georgios","full_name":"Arvanitidis, Georgios"},{"full_name":"Hauberg, Soren","first_name":"Soren","last_name":"Hauberg"},{"first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"},{"first_name":"Marco","last_name":"Fumero","id":"1c1593eb-393f-11ef-bb8e-ab4f1e979650","full_name":"Fumero, Marco"}],"citation":{"ista":"Yu H, Inal B, Arvanitidis G, Hauberg S, Locatello F, Fumero M. 2025. Connecting neural models latent geometries with relative geodesic representations. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38.","apa":"Yu, H., Inal, B., Arvanitidis, G., Hauberg, S., Locatello, F., & Fumero, M. (2025). Connecting neural models latent geometries with relative geodesic representations. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation.","ama":"Yu H, Inal B, Arvanitidis G, Hauberg S, Locatello F, Fumero M. Connecting neural models latent geometries with relative geodesic representations. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025.","chicago":"Yu, Hanlin, Befrin Inal, Georgios Arvanitidis, Soren Hauberg, Francesco Locatello, and Marco Fumero. “Connecting Neural Models Latent Geometries with Relative Geodesic Representations.” In 39th Annual Conference on Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 2025.","ieee":"H. Yu, B. Inal, G. Arvanitidis, S. Hauberg, F. Locatello, and M. Fumero, “Connecting neural models latent geometries with relative geodesic representations,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38.","short":"H. Yu, B. Inal, G. Arvanitidis, S. Hauberg, F. Locatello, M. Fumero, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025.","mla":"Yu, Hanlin, et al. “Connecting Neural Models Latent Geometries with Relative Geodesic Representations.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025."},"volume":38,"external_id":{"arxiv":["2506.01599"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"end_date":"2025-12-07","start_date":"2025-12-02","location":"San Diego, CA, United States","name":"NeurIPS: Neural Information Processing Systems"},"department":[{"_id":"FrLo"}],"month":"12","day":"15","has_accepted_license":"1","tmp":{"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","image":"/images/cc_by.png"},"status":"public","ec_funded":1,"publisher":"Neural Information Processing Systems Foundation","file":[{"content_type":"application/pdf","date_created":"2026-01-29T14:31:42Z","date_updated":"2026-01-29T14:31:42Z","file_name":"2506.01599v2.pdf","creator":"flocatel","checksum":"b1a645418025f46394764cd16d0cb089","file_id":"21075","access_level":"open_access","file_size":7749349,"relation":"main_file","success":1}],"intvolume":" 38","corr_author":"1","das_tickbox":"1","_id":"21074","ddc":["000"],"arxiv":1,"article_processing_charge":"No","type":"conference","date_created":"2026-01-29T14:31:52Z","language":[{"iso":"eng"}],"OA_place":"publisher","publication":"39th Annual Conference on Neural Information Processing Systems","publication_status":"published","oa":1,"alternative_title":["Advances in Neural Information Processing Systems"],"acknowledgement":"We thank Gregor Krzmanc, German Magai, Vital Fernandez for insightful discussions in the early stages of the project. HY was supported by the Research Council of Finland Flagship programme: Finnish Center for Artificial Intelligence FCAI. HY wishes to acknowledge CSC - IT Center for Science, Finland, for computational resources. GA was supported by the DFF Sapere Aude Starting Grant “GADL”. SH was supported by a research grant (42062) from VILLUM FONDEN and partly funded by the Novo Nordisk Foundation through the Center for Basic Research in Life Science (NNF20OC0062606). SH received funding from the European Research Council (ERC) under the European Union’s Horizon Programme (grant agreement 101125003). MF is supported by the MSCA IST-Bridge fellowship which has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant agreement No 101034413.","abstract":[{"text":"Neural models learn representations of high-dimensional data on low-dimensional manifolds. Multiple factors, including stochasticities in the training process, model architectures, and additional inductive biases, may induce different representations, even when learning the same task on the same data. However, it has recently been shown that when a latent structure is shared between distinct latent spaces, relative distances between representations can be preserved, up to distortions. Building on this idea, we demonstrate that exploiting the differential-geometric structure of latent spaces of neural models, it is possible to capture precisely the transformations between representational spaces trained on similar data distributions. Specifically, we assume that distinct neural models parametrize approximately the same underlying manifold, and introduce a representation based on the pullback metric that captures the intrinsic structure of the latent space, while scaling efficiently to large models. We validate experimentally our method on model stitching and retrieval tasks, covering autoencoders and vision foundation discriminative models, across diverse architectures, datasets, pretraining schemes and modalities. Code is available at the following link.","lang":"eng"}],"date_published":"2025-12-15T00:00:00Z","title":"Connecting neural models latent geometries with relative geodesic representations","date_updated":"2026-07-28T07:19:01Z","publication_identifier":{"issn":["1049-5258"]}},{"conference":{"location":"San Diego, CA, United States","name":"NeurIPS: Neural Information Processing Systems","end_date":"2025-12-07","start_date":"2025-12-02"},"volume":38,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","department":[{"_id":"FrLo"},{"_id":"SyCr"}],"citation":{"short":"R. Cadei, I. Demirel, P. De Bartolomeis, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025.","mla":"Cadei, Riccardo, et al. “Prediction-Powered Causal Inferences.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025.","ista":"Cadei R, Demirel I, De Bartolomeis P, Lindorfer L, Cremer S, Schmid C, Locatello F. 2025. Prediction-powered causal inferences. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38.","chicago":"Cadei, Riccardo, Ilker Demirel, Piersilvio De Bartolomeis, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Prediction-Powered Causal Inferences.” In 39th Annual Conference on Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 2025.","ieee":"R. Cadei et al., “Prediction-powered causal inferences,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38.","ama":"Cadei R, Demirel I, De Bartolomeis P, et al. Prediction-powered causal inferences. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025.","apa":"Cadei, R., Demirel, I., De Bartolomeis, P., Lindorfer, L., Cremer, S., Schmid, C., & Locatello, F. (2025). Prediction-powered causal inferences. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation."},"has_accepted_license":"1","status":"public","file":[{"date_updated":"2026-01-29T14:35:02Z","content_type":"application/pdf","date_created":"2026-01-29T14:35:02Z","checksum":"92467fa566cd36671a6a3b9e71ae0f71","file_id":"21077","file_size":8489023,"access_level":"open_access","file_name":"17546_Prediction_Powered_Causa.pdf","creator":"flocatel","relation":"main_file","success":1}],"publisher":"Neural Information Processing Systems Foundation","tmp":{"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","image":"/images/cc_by.png"},"day":"15","quality_controlled":"1","oa_version":"Published Version","file_date_updated":"2026-01-29T14:35:02Z","OA_type":"gold","year":"2025","author":[{"last_name":"Cadei","first_name":"Riccardo","full_name":"Cadei, Riccardo","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b"},{"first_name":"Ilker","last_name":"Demirel","full_name":"Demirel, Ilker"},{"full_name":"De Bartolomeis, Piersilvio","first_name":"Piersilvio","last_name":"De Bartolomeis"},{"full_name":"Lindorfer, Lukas","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","last_name":"Lindorfer","first_name":"Lukas"},{"id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","first_name":"Sylvia","orcid":"0000-0002-2193-3868","last_name":"Cremer"},{"first_name":"Cordelia","last_name":"Schmid","full_name":"Schmid, Cordelia"},{"orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco"}],"acknowledgement":"We thank the Causal Learning and Artificial Intelligence group at ISTA for the continuous feedback on the project and valuable discussions. We thank the Social Immunity group at ISTA, particularly Jinook Oh, for the annotation program and Michaela Hoenigsberger for supporting our ecological experiment. Riccardo Cadei is supported by a Google Research Scholar Award and a Google Initiated Gift to Francesco Locatello. This research was funded in part by the Austrian Science Fund (FWF) 10.55776/COE12). It was further partially supported by the ISTA Interdisciplinary Project Committee for the collaborative project “ALED” between Francesco Locatello and Sylvia Cremer. For open access purposes, the author has applied a CC BY public copyright license to any author accepted manuscript version arising from this submission.","OA_place":"publisher","language":[{"iso":"eng"}],"alternative_title":["Advances in Neural Information Processing Systems"],"oa":1,"publication_status":"published","publication":"39th Annual Conference on Neural Information Processing Systems","date_updated":"2026-07-28T07:20:10Z","publication_identifier":{"issn":["1049-5258"]},"abstract":[{"lang":"eng","text":"In many scientific experiments, the data annotating cost constraints the pace for testing novel hypotheses. Yet, modern machine learning pipelines offer a promising solution—provided their predictions yield correct conclusions. We focus on Prediction-Powered Causal Inferences (PPCI), i.e., estimating the treatment effect in an unlabeled target experiment, relying on training data with the same outcome annotated but potentially different treatment or effect modifiers. We first show that conditional calibration guarantees valid PPCI at population level. Then, we introduce a sufficient representation constraint transferring validity across experiments, which we propose to enforce in practice in Deconfounded Empirical Risk Minimization, our new model-agnostic training objective. We validate our method on synthetic and real-world scientific data, solving impossible problem instances for Empirical Risk Minimization even with standard invariance constraints. In particular, for the first time, we achieve valid causal inference on a scientific experiment with complex recording and no human annotations, fine-tuning a foundational model on our similar annotated experiment."}],"title":"Prediction-powered causal inferences","date_published":"2025-12-15T00:00:00Z","intvolume":" 38","type":"conference","date_created":"2026-01-29T14:35:11Z","_id":"21076","das_tickbox":"1","ddc":["000"],"article_processing_charge":"No"},{"type":"conference","date_created":"2026-01-29T14:29:23Z","das_tickbox":"1","_id":"21072","ddc":["000"],"article_processing_charge":"No","arxiv":1,"intvolume":" 38","date_updated":"2026-07-28T07:18:12Z","publication_identifier":{"issn":["1049-5258"]},"abstract":[{"lang":"eng","text":"Language and vision-language models have shown impressive performance across a wide range of tasks, but their internal mechanisms remain only partly understood. In this work, we study how individual attention heads in text-generative models specialize in specific semantic or visual attributes. Building on an established interpretability method, we reinterpret the practice of probing intermediate activations with the final decoding layer through the lens of signal processing. This lets us analyze multiple samples in a principled way and rank attention heads based on their relevance to target concepts. Our results show consistent patterns of specialization at the head level across both unimodal and multimodal transformers. Remarkably, we find that editing as few as 1% of the heads, selected using our method, can reliably suppress or enhance targeted concepts in the model output. We validate our approach on language tasks such as question answering and toxicity mitigation, as well as vision-language tasks including image classification and captioning. Our findings highlight an interpretable and controllable structure within attention layers, offering simple tools for understanding and editing large-scale generative models."}],"title":"Head pursuit: Probing attention specialization in multimodal transformers","date_published":"2025-12-15T00:00:00Z","acknowledgement":"The authors acknowledge the Area Science Park supercomputing platform ORFEO made available for conducting the research reported in this paper, and the technical support of the Laboratory of Data Engineering staff. LB, DD and AC were supported by the project “Supporto alla diagnosi di malattie rare tramite l’intelligenza artificiale\" CUP: F53C22001770002 and “Valutazione automatica delle immagini diagnostiche tramite l’intelligenza artificiale\", CUP: F53C22001780002. LB was supported by the European Union – NextGenerationEU within the project PNRR “Finanziamento di progetti presentati da giovani ricercatori\" - Mission 4 Component 2 Investment 1.2, CUP: J93C25000440001. AC was supported by the European Union – NextGenerationEU within the project PNRR “PRP@CERIC\" IR0000028 - Mission 4 Component 2 Investment 3.1 Action 3.1.1. ","OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"publication_status":"published","publication":"39th Annual Conference on Neural Information Processing Systems","author":[{"full_name":"Basile, Lorenzo","first_name":"Lorenzo","last_name":"Basile"},{"first_name":"Valentino","last_name":"Maiorca","full_name":"Maiorca, Valentino"},{"last_name":"Doimo","first_name":"Diego","full_name":"Doimo, Diego"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello"},{"full_name":"Cazzaniga, Alberto","last_name":"Cazzaniga","first_name":"Alberto"}],"quality_controlled":"1","oa_version":"Preprint","file_date_updated":"2026-01-29T14:29:14Z","OA_type":"gold","year":"2025","has_accepted_license":"1","publisher":"Neural Information Processing Systems Foundation","status":"public","file":[{"success":1,"relation":"main_file","date_created":"2026-01-29T14:29:14Z","content_type":"application/pdf","date_updated":"2026-01-29T14:29:14Z","file_name":"2510.21518v2.pdf","creator":"flocatel","file_size":4271547,"access_level":"open_access","checksum":"85be3f98663e2595cf37001852b477cb","file_id":"21073"}],"tmp":{"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","image":"/images/cc_by.png"},"day":"15","conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"San Diego, CA, United States","start_date":"2025-12-02","end_date":"2025-12-07"},"external_id":{"arxiv":["2510.21518"]},"volume":38,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"12","department":[{"_id":"FrLo"}],"citation":{"short":"L. Basile, V. Maiorca, D. Doimo, F. Locatello, A. Cazzaniga, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025.","mla":"Basile, Lorenzo, et al. “Head Pursuit: Probing Attention Specialization in Multimodal Transformers.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025.","ista":"Basile L, Maiorca V, Doimo D, Locatello F, Cazzaniga A. 2025. Head pursuit: Probing attention specialization in multimodal transformers. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 38.","apa":"Basile, L., Maiorca, V., Doimo, D., Locatello, F., & Cazzaniga, A. (2025). Head pursuit: Probing attention specialization in multimodal transformers. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation.","chicago":"Basile, Lorenzo, Valentino Maiorca, Diego Doimo, Francesco Locatello, and Alberto Cazzaniga. “Head Pursuit: Probing Attention Specialization in Multimodal Transformers.” In 39th Annual Conference on Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 2025.","ama":"Basile L, Maiorca V, Doimo D, Locatello F, Cazzaniga A. Head pursuit: Probing attention specialization in multimodal transformers. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025.","ieee":"L. Basile, V. Maiorca, D. Doimo, F. Locatello, and A. Cazzaniga, “Head pursuit: Probing attention specialization in multimodal transformers,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38."}},{"month":"12","department":[{"_id":"FrLo"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"San Diego, CA, United States","start_date":"2025-12-02","end_date":"2025-12-07"},"volume":38,"external_id":{"arxiv":["2505.17708"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"apa":"Yao, D., Huang, S., Cadei, R., Zhang, K., & Locatello, F. (2025). The third pillar of causal analysis? A measurement perspective on causal representations. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation.","ama":"Yao D, Huang S, Cadei R, Zhang K, Locatello F. The third pillar of causal analysis? A measurement perspective on causal representations. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025.","chicago":"Yao, Dingling, Shimeng Huang, Riccardo Cadei, Kun Zhang, and Francesco Locatello. “The Third Pillar of Causal Analysis? A Measurement Perspective on Causal Representations.” In 39th Annual Conference on Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 2025.","ieee":"D. Yao, S. Huang, R. Cadei, K. Zhang, and F. Locatello, “The third pillar of causal analysis? A measurement perspective on causal representations,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38.","ista":"Yao D, Huang S, Cadei R, Zhang K, Locatello F. 2025. The third pillar of causal analysis? A measurement perspective on causal representations. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38.","mla":"Yao, Dingling, et al. “The Third Pillar of Causal Analysis? A Measurement Perspective on Causal Representations.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025.","short":"D. Yao, S. Huang, R. Cadei, K. Zhang, F. Locatello, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025."},"publisher":"Neural Information Processing Systems Foundation","status":"public","tmp":{"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","image":"/images/cc_by.png"},"related_material":{"link":[{"relation":"software","url":"https://github.com/shimenghuang/a-measurement-perspective-of-crl"}]},"has_accepted_license":"1","day":"15","quality_controlled":"1","OA_type":"green","year":"2025","oa_version":"Preprint","author":[{"last_name":"Yao","first_name":"Dingling","full_name":"Yao, Dingling","id":"d3e02e50-48a8-11ee-8f62-c108061797fa"},{"first_name":"Shimeng","orcid":"0000-0001-6919-821X","last_name":"Huang","id":"989c2a06-fb4e-11ef-a992-ab766442255b","full_name":"Huang, Shimeng"},{"id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","full_name":"Cadei, Riccardo","first_name":"Riccardo","last_name":"Cadei"},{"full_name":"Zhang, Kun","last_name":"Zhang","first_name":"Kun"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello"}],"acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For open access purposes, the author has applied a CC BY public copyright license to any accepted manuscript version arising from this submission.\r\n","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2505.17708"}],"alternative_title":["Advances in Neural Information Processing Systems"],"oa":1,"publication_status":"published","publication":"39th Annual Conference on Neural Information Processing Systems","OA_place":"repository","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1049-5258"]},"date_updated":"2026-07-28T07:14:27Z","title":"The third pillar of causal analysis? A measurement perspective on causal representations","date_published":"2025-12-15T00:00:00Z","abstract":[{"lang":"eng","text":"Causal reasoning and discovery, two fundamental tasks of causal analysis,\r\noften face challenges in applications due to the complexity, noisiness, and highdimensionality of real-world data. Despite recent progress in identifying latent\r\ncausal structures using causal representation learning (CRL), what makes learned\r\nrepresentations useful for causal downstream tasks and how to evaluate them are\r\nstill not well understood. In this paper, we reinterpret CRL using a measurement\r\nmodel framework, where the learned representations are viewed as proxy measurements of the latent causal variables. Our approach clarifies the conditions under\r\nwhich learned representations support downstream causal reasoning and provides\r\na principled basis for quantitatively assessing the quality of representations using\r\na new Test-based Measurement EXclusivity (T-MEX) score. We validate T-MEX\r\nacross diverse causal inference scenarios, including numerical simulations and\r\nreal-world ecological video analysis, demonstrating that the proposed framework\r\nand corresponding score effectively assess the identification of learned representations and their usefulness for causal downstream tasks. Reproducible code can\r\nbe found at https://github.com/shimenghuang/a-measurement-perspective-of-crl."}],"corr_author":"1","intvolume":" 38","date_created":"2026-01-29T14:24:56Z","type":"conference","article_processing_charge":"No","arxiv":1,"_id":"21068","das_tickbox":"1","ddc":["000"]},{"das_tickbox":"1","_id":"21070","ddc":["000"],"arxiv":1,"article_processing_charge":"No","type":"conference","date_created":"2026-01-29T14:26:47Z","intvolume":" 38","corr_author":"1","abstract":[{"lang":"eng","text":"Deep learning systems deployed in real-world applications often encounter data that is different from their in-distribution (ID). A reliable model should ideally abstain from making decisions in this out-of-distribution (OOD) setting. Existing state-of-the-art methods primarily focus on feature distances, such as k-th nearest neighbors and distances to decision boundaries, either overlooking or ineffectively using in-distribution statistics. In this work, we propose a novel angle-based metric for OOD detection that is computed relative to the in-distribution structure. We demonstrate that the angles between feature representations and decision boundaries, viewed from the mean of in-distribution features, serve as an effective discriminative factor between ID and OOD data. We evaluate our method on nine ImageNet-pretrained models. Our approach achieves the lowest FPR in 5 out of 9 ImageNet models, obtains the best average FPR overall, and consistently ranking among the top 3 across all evaluated models. Furthermore, we highlight the benefits of contrastive representations by showing strong performance with ResNet SCL and CLIP architectures. Finally, we demonstrate that the scale-invariant nature of our score enables an ensemble strategy via simple score summation. "}],"date_published":"2025-12-01T00:00:00Z","title":"Out-of-Distribution detection with relative angles","date_updated":"2026-07-28T07:15:44Z","publication_identifier":{"issn":["1049-5258"]},"language":[{"iso":"eng"}],"OA_place":"repository","publication_status":"published","publication":"39th Annual Conference on Neural Information Processing Systems","oa":1,"alternative_title":["Advances in Neural Information Processing Systems"],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2410.04525"}],"acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/COE12. For open access purposes, the author has applied a CC BY public copyright license to any accepted manuscript version arising from this submission.\r\n","author":[{"last_name":"Demirel","first_name":"Berker","full_name":"Demirel, Berker","id":"8b4bc47f-3200-11ee-973b-8f0e7be21a9f"},{"full_name":"Fumero, Marco ","first_name":"Marco ","last_name":"Fumero"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco"}],"oa_version":"Preprint","year":"2025","OA_type":"green","quality_controlled":"1","day":"01","has_accepted_license":"1","tmp":{"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","image":"/images/cc_by.png"},"related_material":{"link":[{"relation":"software","url":"https://github.com/berkerdemirel/ORA-OOD-Detection-with-Relative-Angles"}]},"publisher":"Neural Information Processing Systems Foundation","status":"public","citation":{"apa":"Demirel, B., Fumero, M., & Locatello, F. (2025). Out-of-Distribution detection with relative angles. In 39th Annual Conference on Neural Information Processing Systems (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation.","ieee":"B. Demirel, M. Fumero, and F. Locatello, “Out-of-Distribution detection with relative angles,” in 39th Annual Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38.","chicago":"Demirel, Berker, Marco Fumero, and Francesco Locatello. “Out-of-Distribution Detection with Relative Angles.” In 39th Annual Conference on Neural Information Processing Systems, Vol. 38. Neural Information Processing Systems Foundation, 2025.","ama":"Demirel B, Fumero M, Locatello F. Out-of-Distribution detection with relative angles. In: 39th Annual Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025.","ista":"Demirel B, Fumero M, Locatello F. 2025. Out-of-Distribution detection with relative angles. 39th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38.","mla":"Demirel, Berker, et al. “Out-of-Distribution Detection with Relative Angles.” 39th Annual Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025.","short":"B. Demirel, M. Fumero, F. Locatello, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025."},"volume":38,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["2410.04525"]},"conference":{"start_date":"2025-12-02","end_date":"2025-12-07","name":"NeurIPS: Neural Information Processing Systems","location":"San Diego, CA, United States"},"department":[{"_id":"FrLo"}],"month":"12"},{"date_created":"2025-09-10T05:44:03Z","page":"32199-32208","type":"journal_article","article_processing_charge":"Yes (via OA deal)","ddc":["540"],"_id":"20326","corr_author":"1","PlanS_conform":"1","intvolume":" 147","issue":"35","doi":"10.1021/jacs.5c11435","publication_identifier":{"issn":["0002-7863"],"eissn":["1520-5126"]},"date_updated":"2026-07-28T09:55:14Z","date_published":"2025-08-22T00:00:00Z","title":"Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se","abstract":[{"text":"Ag2Se is a promising n-type thermoelectric material, but its performance is limited by excessive carrier concentration, compositional inhomogeneity, and phase instability, challenges rooted in a narrow homogeneity range and uncontrolled Ag+ diffusion in the superionic phase. Here, we address these issues by exploiting liquid–solid interface reactions using CdSe complexes that remove surface excess Ag to yield stoichiometric Ag2Se and generate CdSe nanodomains that inhibit Ag+ diffusion and constrain grain growth. The resulting Ag2Se-CdSe nanocomposites exhibit a reproducible, stable figure of merit (zT) of 1.04 between 300 and 390 K. Beyond demonstrating high performance, we elucidate the interfacial chemical reactions that give rise to the observed microstructure and transport properties, providing a foundation for rationally engineering interfacial chemistry to tailor transport properties across diverse thermoelectric material systems.","lang":"eng"}],"acknowledgement":"M.I. acknowledges financial support from ISTA and the Werner Siemens Foundation. The Scientific Service Units (SSU) of ISTA supported this work through resources provided by the Electron Microscopy Facility (EMF), the Lab Support Facility (LSF) and the Nanofabrication Facility (NNF) and the LSF Mass Spectrometry Service. The members of the Ibáñez research group are acknowledged, especially Christine Fiedler for scientific illustration and Ihor Cherniukh for valuable discussions. Y.L. acknowledges funding from the National Natural Science Foundation of China (NSFC) (Grants No. 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grant No. 2022LCX002) and the Fundamental Research Funds for the Central Universities (JZ2024HGTB0239). K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant No. 22208293). ICN2 acknowledges funding from Generalitat de Catalunya 2021SGR00457. Authors acknowledge the Advanced Materials programme by the Spanish Government with funding from European Union NextGenerationEU (PRTR-C17.I1) and by Generalitat de Catalunya (Project In-CAEM). The authors thank support from the project AMaDE (PID2023-149158OB-C43), funded by MCIN/AEI/10.13039/501100011033/and by “ERDF Away of making Europe”, by the “European Union”. ICN2 is supported by the Severo Ochoa program from Spanish MCIN/AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Programme/Generalitat de Catalunya. ICN2 is founding member of e-DREAM. (68) M.H. acknowledges the funding from the Australian Research Council (FT230100316 and IH200100035). M.H. acknowledges the computational support from the National Computational Infrastructure (NCI) and Pawsey Supercomputing Centre, Australia.","publication_status":"published","publication":"Journal of the American Chemical Society","oa":1,"language":[{"iso":"eng"}],"OA_place":"publisher","isi":1,"author":[{"first_name":"Yu","orcid":"0000-0001-7313-6740","last_name":"Liu","id":"2A70014E-F248-11E8-B48F-1D18A9856A87","full_name":"Liu, Yu"},{"last_name":"Kleinhanns","orcid":"0000-0003-1537-7436","first_name":"Tobias","full_name":"Kleinhanns, Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425"},{"full_name":"Horta, Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","last_name":"Horta","first_name":"Sharona"},{"first_name":"Ewelina","last_name":"Dutkiewicz","id":"0601cc46-c082-11ec-9b07-bb29641d1de9","full_name":"Dutkiewicz, Ewelina"},{"full_name":"Lu, Shaoqing","last_name":"Lu","first_name":"Shaoqing"},{"full_name":"Spadaro, Maria Chiara","last_name":"Spadaro","first_name":"Maria Chiara"},{"first_name":"Aziz","last_name":"Genç","full_name":"Genç, Aziz"},{"full_name":"Chen, Lei","last_name":"Chen","first_name":"Lei"},{"last_name":"Lim","first_name":"Khak Ho","full_name":"Lim, Khak Ho"},{"full_name":"Hong, Min","first_name":"Min","last_name":"Hong"},{"first_name":"Jordi","last_name":"Arbiol","full_name":"Arbiol, Jordi"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843"}],"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"quality_controlled":"1","year":"2025","OA_type":"hybrid","file_date_updated":"2025-09-10T06:55:17Z","oa_version":"Published Version","related_material":{"record":[{"status":"public","id":"22017","relation":"dissertation_contains"}]},"tmp":{"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","image":"/images/cc_by.png"},"scopus_import":"1","status":"public","file":[{"relation":"main_file","success":1,"content_type":"application/pdf","date_created":"2025-09-10T06:55:17Z","date_updated":"2025-09-10T06:55:17Z","file_name":"2025_JACS_Liu.pdf","creator":"dernst","file_id":"20334","checksum":"52892fa91adadd39a1c42da9e01139a5","access_level":"open_access","file_size":9997327}],"publisher":"American Chemical Society","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"NanoFab"},{"_id":"MassSpec"}],"has_accepted_license":"1","article_type":"original","day":"22","department":[{"_id":"MaIb"},{"_id":"MassSpec"}],"month":"08","external_id":{"isi":["001558320100001"]},"volume":147,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Liu Y, Kleinhanns T, Horta S, Dutkiewicz E, Lu S, Spadaro MC, Genç A, Chen L, Lim KH, Hong M, Arbiol J, Ibáñez M. 2025. Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. 147(35), 32199–32208.","chicago":"Liu, Yu, Tobias Kleinhanns, Sharona Horta, Ewelina Dutkiewicz, Shaoqing Lu, Maria Chiara Spadaro, Aziz Genç, et al. “Liquid-Solid Interface Reactions Drive Enhanced Thermoelectric Performance in Ag2Se.” Journal of the American Chemical Society. American Chemical Society, 2025. https://doi.org/10.1021/jacs.5c11435.","ieee":"Y. Liu et al., “Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se,” Journal of the American Chemical Society, vol. 147, no. 35. American Chemical Society, pp. 32199–32208, 2025.","ama":"Liu Y, Kleinhanns T, Horta S, et al. Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. 2025;147(35):32199-32208. doi:10.1021/jacs.5c11435","apa":"Liu, Y., Kleinhanns, T., Horta, S., Dutkiewicz, E., Lu, S., Spadaro, M. C., … Ibáñez, M. (2025). Liquid-solid interface reactions drive enhanced thermoelectric performance in Ag2Se. Journal of the American Chemical Society. American Chemical Society. https://doi.org/10.1021/jacs.5c11435","short":"Y. Liu, T. Kleinhanns, S. Horta, E. Dutkiewicz, S. Lu, M.C. Spadaro, A. Genç, L. Chen, K.H. Lim, M. Hong, J. Arbiol, M. Ibáñez, Journal of the American Chemical Society 147 (2025) 32199–32208.","mla":"Liu, Yu, et al. “Liquid-Solid Interface Reactions Drive Enhanced Thermoelectric Performance in Ag2Se.” Journal of the American Chemical Society, vol. 147, no. 35, American Chemical Society, 2025, pp. 32199–208, doi:10.1021/jacs.5c11435."}},{"month":"08","department":[{"_id":"LaVe"}],"volume":25,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"isi":["001557017200001"],"pmid":["40855728"]},"citation":{"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.","ama":"York E, Stone I, Shi W, Roy X, Venkataraman L. Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. 2025;25(36):13697-13702. doi:10.1021/acs.nanolett.5c03764","chicago":"York, Emma, Ilana Stone, Wanzhuo Shi, Xavier Roy, and Latha Venkataraman. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” Nano Letters. American Chemical Society, 2025. https://doi.org/10.1021/acs.nanolett.5c03764.","ieee":"E. York, I. Stone, W. Shi, X. Roy, and L. Venkataraman, “Tuning conductance in BODIPY-based single-molecule junctions,” Nano Letters, vol. 25, no. 36. American Chemical Society, pp. 13697–13702, 2025.","apa":"York, E., Stone, I., Shi, W., Roy, X., & Venkataraman, L. (2025). Tuning conductance in BODIPY-based single-molecule junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.5c03764","short":"E. York, I. Stone, W. Shi, X. Roy, L. Venkataraman, Nano Letters 25 (2025) 13697–13702.","mla":"York, Emma, et al. “Tuning Conductance in BODIPY-Based Single-Molecule Junctions.” Nano Letters, vol. 25, no. 36, American Chemical Society, 2025, pp. 13697–702, doi:10.1021/acs.nanolett.5c03764."},"publisher":"American Chemical Society","scopus_import":"1","file":[{"file_name":"2025_NanoLetters_York.pdf","creator":"dernst","access_level":"open_access","file_size":3144989,"checksum":"bac881601e1f33c3cf8f51d50b958e68","file_id":"20910","date_created":"2025-12-30T09:39:44Z","content_type":"application/pdf","date_updated":"2025-12-30T09:39:44Z","success":1,"relation":"main_file"}],"status":"public","tmp":{"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","image":"/images/cc_by.png"},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"MassSpec"}],"day":"25","article_type":"letter_note","quality_controlled":"1","OA_type":"hybrid","year":"2025","oa_version":"Published Version","file_date_updated":"2025-12-30T09:39:44Z","isi":1,"author":[{"last_name":"York","first_name":"Emma","full_name":"York, Emma","id":"08dde91e-8e0a-11f0-9d7d-9e8d80864f16"},{"full_name":"Stone, Ilana","last_name":"Stone","first_name":"Ilana"},{"first_name":"Wanzhuo","last_name":"Shi","id":"a3010425-87c8-11f0-8106-bec32bea74da","full_name":"Shi, Wanzhuo"},{"full_name":"Roy, Xavier","first_name":"Xavier","last_name":"Roy"},{"last_name":"Venkataraman","first_name":"Latha","orcid":"0000-0002-6957-6089","full_name":"Venkataraman, Latha","id":"9ebb78a5-cc0d-11ee-8322-fae086a32caf"}],"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.","pmid":1,"oa":1,"publication":"Nano Letters","publication_status":"published","OA_place":"publisher","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1530-6984"],"eissn":["1530-6992"]},"doi":"10.1021/acs.nanolett.5c03764","date_updated":"2026-07-28T09:53:54Z","title":"Tuning conductance in BODIPY-based single-molecule junctions","date_published":"2025-08-25T00:00:00Z","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"}],"PlanS_conform":"1","corr_author":"1","intvolume":" 25","issue":"36","page":"13697-13702","date_created":"2025-09-10T05:48:29Z","type":"journal_article","article_processing_charge":"Yes (via OA deal)","_id":"20331","das_tickbox":"1","ddc":["540"]},{"citation":{"mla":"Mrnjavac, Andrea, and Beatriz Vicoso. “Reduced Efficacy of Selection on a Young Z Chromosome Region of Schistosoma Japonicum.” Genome Biology and Evolution, vol. 17, no. 2, evaf021, Oxford University Press, 2025, doi:10.1093/gbe/evaf021.","short":"A. Mrnjavac, B. Vicoso, Genome Biology and Evolution 17 (2025).","apa":"Mrnjavac, A., & Vicoso, B. (2025). Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum. Genome Biology and Evolution. Oxford University Press. https://doi.org/10.1093/gbe/evaf021","ieee":"A. Mrnjavac and B. Vicoso, “Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum,” Genome Biology and Evolution, vol. 17, no. 2. Oxford University Press, 2025.","chicago":"Mrnjavac, Andrea, and Beatriz Vicoso. “Reduced Efficacy of Selection on a Young Z Chromosome Region of Schistosoma Japonicum.” Genome Biology and Evolution. Oxford University Press, 2025. https://doi.org/10.1093/gbe/evaf021.","ama":"Mrnjavac A, Vicoso B. Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum. Genome Biology and Evolution. 2025;17(2). doi:10.1093/gbe/evaf021","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."},"external_id":{"pmid":["39913672"],"isi":["001423671400001"]},"volume":17,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"02","department":[{"_id":"BeVi"}],"day":"01","article_type":"original","has_accepted_license":"1","publisher":"Oxford University Press","status":"public","file":[{"relation":"main_file","success":1,"date_updated":"2025-03-10T08:25:59Z","content_type":"application/pdf","date_created":"2025-03-10T08:25:59Z","checksum":"e3aa993e3d6dad10cb806c243fa57408","file_id":"19378","access_level":"open_access","file_size":768371,"creator":"dernst","file_name":"2025_GBE_Mrnjavac.pdf"}],"scopus_import":"1","related_material":{"link":[{"relation":"software","url":"https://git.ista.ac.at/amrnjava/schistosomes_slower_z"}],"record":[{"status":"public","relation":"earlier_version","id":"18549"}]},"tmp":{"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","image":"/images/cc_by.png"},"article_number":"evaf021","oa_version":"Published Version","file_date_updated":"2025-03-10T08:25:59Z","OA_type":"gold","year":"2025","quality_controlled":"1","author":[{"last_name":"Mrnjavac","first_name":"Andrea","full_name":"Mrnjavac, Andrea","id":"353FAC84-AE61-11E9-8BFC-00D3E5697425"},{"full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","orcid":"0000-0002-4579-8306","first_name":"Beatriz"}],"isi":1,"OA_place":"publisher","language":[{"iso":"eng"}],"oa":1,"publication_status":"published","publication":"Genome Biology and Evolution","pmid":1,"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.","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."}],"title":"Reduced efficacy of selection on a young Z chromosome region of schistosoma japonicum","date_published":"2025-02-01T00:00:00Z","date_updated":"2026-07-29T08:36:27Z","publication_identifier":{"eissn":["1759-6653"]},"doi":"10.1093/gbe/evaf021","issue":"2","intvolume":" 17","corr_author":"1","_id":"19370","ddc":["570"],"article_processing_charge":"Yes","type":"journal_article","date_created":"2025-03-09T23:01:27Z"},{"day":"13","related_material":{"record":[{"relation":"part_of_dissertation","id":"14851","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"12788"},{"status":"public","relation":"part_of_dissertation","id":"9903"},{"relation":"part_of_dissertation","id":"15004","status":"public"},{"id":"19425","relation":"part_of_dissertation","status":"public"}]},"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)"},"status":"public","file":[{"success":1,"relation":"main_file","date_created":"2025-03-12T12:56:46Z","content_type":"application/pdf","date_updated":"2025-03-12T12:56:46Z","creator":"vkarle","file_name":"thesis_final.pdf","access_level":"open_access","file_size":10625143,"file_id":"19394","checksum":"d3ab25782c7ea38ce9910e57d25f6733"},{"relation":"source_file","content_type":"application/zip","date_created":"2025-03-13T13:15:10Z","date_updated":"2025-03-20T08:02:35Z","creator":"vkarle","file_name":"thesis.zip","file_id":"19400","checksum":"3ccfb0aeba4d860d71e18347913034e4","access_level":"closed","file_size":23119202}],"publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","citation":{"mla":"Karle, Volker. Non-Equilibrium Topological Phases with Periodically Driven Molecules and Quantum Rotors. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19393.","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.","ama":"Karle V. Non-equilibrium topological phases with periodically driven molecules and quantum rotors. 2025. doi:10.15479/AT-ISTA-19393","chicago":"Karle, Volker. “Non-Equilibrium Topological Phases with Periodically Driven Molecules and Quantum Rotors.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19393.","apa":"Karle, V. (2025). Non-equilibrium topological phases with periodically driven molecules and quantum rotors. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19393","ista":"Karle V. 2025. Non-equilibrium topological phases with periodically driven molecules and quantum rotors. Institute of Science and Technology Austria."},"degree_awarded":"PhD","department":[{"_id":"GradSch"},{"_id":"MiLe"}],"month":"03","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","author":[{"id":"D7C012AE-D7ED-11E9-95E8-1EC5E5697425","full_name":"Karle, Volker","first_name":"Volker","orcid":"0000-0002-6963-0129","last_name":"Karle"}],"year":"2025","OA_type":"gold","file_date_updated":"2025-03-20T08:02:35Z","oa_version":"Published Version","supervisor":[{"last_name":"Lemeshko","orcid":"0000-0002-6990-7802","first_name":"Mikhail","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2025-03-13T00:00:00Z","title":"Non-equilibrium topological phases with periodically driven molecules and quantum rotors","abstract":[{"lang":"eng","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."}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","doi":"10.15479/AT-ISTA-19393","publication_identifier":{"eissn":["2663-337X"]},"date_updated":"2026-07-29T08:59:30Z","publication_status":"published","oa":1,"alternative_title":["ISTA Thesis"],"language":[{"iso":"eng"}],"OA_place":"publisher","article_processing_charge":"No","_id":"19393","ddc":["530"],"date_created":"2025-03-12T13:04:59Z","page":"192","type":"dissertation","corr_author":"1"},{"oa_version":"None","year":"2025","OA_type":"closed access","quality_controlled":"1","author":[{"full_name":"Elsholtz, Christian","first_name":"Christian","last_name":"Elsholtz"},{"full_name":"Ruzsa, Imre Z.","first_name":"Imre Z.","last_name":"Ruzsa"},{"full_name":"Wurzinger, Lena","id":"50c57d72-32a8-11ee-aeea-d652094d2ccd","last_name":"Wurzinger","first_name":"Lena","orcid":"0009-0004-5360-0074"}],"isi":1,"citation":{"chicago":"Elsholtz, Christian, Imre Z. Ruzsa, and Lena Wurzinger. “Sumset Growth in Progression-Free Sets.” Acta Arithmetica. Institute of Mathematics, 2025. https://doi.org/10.4064/aa250115-14-7.","ieee":"C. Elsholtz, I. Z. Ruzsa, and L. Wurzinger, “Sumset growth in progression-free sets,” Acta Arithmetica, vol. 220. Institute of Mathematics, pp. 289–303, 2025.","ama":"Elsholtz C, Ruzsa IZ, Wurzinger L. Sumset growth in progression-free sets. Acta Arithmetica. 2025;220:289-303. doi:10.4064/aa250115-14-7","apa":"Elsholtz, C., Ruzsa, I. Z., & Wurzinger, L. (2025). Sumset growth in progression-free sets. Acta Arithmetica. Institute of Mathematics. https://doi.org/10.4064/aa250115-14-7","ista":"Elsholtz C, Ruzsa IZ, Wurzinger L. 2025. Sumset growth in progression-free sets. Acta Arithmetica. 220, 289–303.","mla":"Elsholtz, Christian, et al. “Sumset Growth in Progression-Free Sets.” Acta Arithmetica, vol. 220, Institute of Mathematics, 2025, pp. 289–303, doi:10.4064/aa250115-14-7.","short":"C. Elsholtz, I.Z. Ruzsa, L. Wurzinger, Acta Arithmetica 220 (2025) 289–303."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","external_id":{"isi":["001570716800001"]},"volume":220,"department":[{"_id":"TiBr"}],"month":"09","article_type":"original","day":"12","status":"public","publisher":"Institute of Mathematics","scopus_import":"1","researchdata_availability":"no","intvolume":" 220","corr_author":"1","das_tickbox":"0","_id":"20603","article_processing_charge":"No","type":"journal_article","supplementarymaterial":"no","date_created":"2025-11-04T14:33:16Z","page":"289-303","language":[{"iso":"eng"}],"publication":"Acta Arithmetica","publication_status":"published","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","abstract":[{"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.","lang":"eng"}],"date_published":"2025-09-12T00:00:00Z","title":"Sumset growth in progression-free sets","date_updated":"2026-07-29T09:51:25Z","doi":"10.4064/aa250115-14-7","publication_identifier":{"issn":["0065-1036"],"eissn":["1730-6264"]}}]