--- OA_place: publisher OA_type: gold _id: '21281' abstract: - lang: eng text: "A strategy profile in a multi-player game is a Nash equilibrium if no player can unilaterally deviate to achieve a strictly better payoff. A profile is an ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating from their strategy. In this work, we use ε-Nash equilibria to approximate the computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer stochastic games played on graphs, where players are restricted to stationary strategies - strategies that use randomness but not memory.\r\nThe problem of deciding the constrained existence of stationary Nash equilibria - where each player’s payoff must lie within a given interval - is known to be ∃ℝ-complete in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to stationary ε-Nash equilibria and present an algorithm that solves the following promise problem: given a game with a Nash equilibrium satisfying the constraints, compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo achieve this, we first show that if a constrained Nash equilibrium exists, then one exists where the non-zero probabilities are at least an inverse of a double-exponential in the input. We further prove that such a strategy can be encoded using floating-point representations, as in the work of Frederiksen and Miltersen (2013), which finally gives us our FNP^NP algorithm. \r\nWe further show that the decision version of the promise problem is NP-hard. Finally, we show a partial tightness result by proving a lower bound for such techniques: if a constrained Nash equilibrium exists, then there must be one where the probabilities in the strategies are double-exponentially small." acknowledgement: "This work is a part of project VAMOS that has received funding from the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n" alternative_title: - LIPIcs article_processing_charge: Yes arxiv: 1 author: - first_name: Ali full_name: Asadi, Ali id: 02d96aae-000e-11ec-b801-cadd0a5eefbb last_name: Asadi - first_name: Leonard full_name: Brice, Leonard last_name: Brice - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X - first_name: K. S. full_name: Thejaswini, K. S. id: 3807fb92-fdc1-11ee-bb4a-b4d8a431c753 last_name: Thejaswini citation: ama: 'Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:10.4230/lipics.fsttcs.2025.9' apa: 'Asadi, A., Brice, L., Chatterjee, K., & Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/lipics.fsttcs.2025.9' chicago: Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.fsttcs.2025.9. ieee: A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Pilani, India, 2025, vol. 360, p. 9:1-9:17. ista: 'Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria in multi-player stochastic graph games. 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science. FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol. 360, 9:1-9:17.' mla: Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:10.4230/lipics.fsttcs.2025.9. short: A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17. conference: end_date: 2025-12-19 location: Pilani, India name: 'FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science' start_date: 2025-12-17 corr_author: '1' date_created: 2026-02-17T08:27:14Z date_published: 2025-12-09T00:00:00Z date_updated: 2026-10-12T13:38:13Z day: '09' ddc: - '000' department: - _id: KrCh - _id: GradSch doi: 10.4230/lipics.fsttcs.2025.9 ec_funded: 1 external_id: arxiv: - '2508.15356' file: - access_level: open_access checksum: a66343e3ccc4a9cc5bc699c03d5764ff content_type: application/pdf creator: dernst date_created: 2026-02-18T09:13:25Z date_updated: 2026-02-18T09:13:25Z file_id: '21316' file_name: 2025_FSTTCS_Asadi.pdf file_size: 1054007 relation: main_file success: 1 file_date_updated: 2026-02-18T09:13:25Z fulldoi: https://doi.org/10.4230/lipics.fsttcs.2025.9 has_accepted_license: '1' intvolume: ' 360' language: - iso: eng month: '12' oa: 1 oa_version: Published Version page: 9:1-9:17 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: 45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science publication_identifier: isbn: - '9783959774062' publication_status: published publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik quality_controlled: '1' related_material: record: - id: '23079' relation: dissertation_contains status: public status: public title: ε-stationary Nash equilibria in multi-player stochastic graph games tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 360 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '23129' abstract: - lang: eng text: "Abstract\r\n The Arabidopsis root apical meristem is an excellent model for studying plant organ growth. This involves a coordinated process of cell division, elongation, and differentiation, with each tissue type developing according to its own schedule. Among these tissues, the protophloem is particularly important, differentiating early to supply nutrients and signalling molecules to the growing root tip. The OCTOPUS (OPS) protein and its homologue OPS-LIKE 2 (OPL2) are essential for proper root protophloem differentiation and, probably through this role, indirectly promote root growth. Here, we explored the roles of the other three OPS homologues in Arabidopsis, OPL1, OPL3, and OPL4. OPS/OPL genes exhibited overlapping expression patterns and functions, with a high degree of redundancy among them. Although higher order mutants did not display more severe phloem defects, they exhibited significantly reduced root growth compared with the ops opl2 mutant. These results indicate a direct contribution of the investigated OPL genes to meristematic activity. While our focus was on root growth, the OPS/OPL gene family also plays a positive role in regulating shoot growth, emphasizing its broader impact on plant development. Furthermore, our analyses reiterate the central role of OPS and the phloem domain in controlling overall plant growth." article_processing_charge: Yes (in subscription journal) article_type: original author: - first_name: Simona full_name: Crivelli, Simona last_name: Crivelli - first_name: Kai full_name: Bartusch, Kai id: 0c51b9f5-90c8-11f1-b4ef-9ad5d3d9a34a last_name: Bartusch orcid: 0000-0003-2708-5545 - first_name: M Aguila full_name: Ruiz-Sola, M Aguila last_name: Ruiz-Sola - first_name: Mario full_name: Coiro, Mario last_name: Coiro - first_name: Signe full_name: Schmidt Kjølner Hansen, Signe last_name: Schmidt Kjølner Hansen - first_name: Elisabeth full_name: Truernit, Elisabeth last_name: Truernit citation: ama: Crivelli S, Bartusch K, Ruiz-Sola MA, Coiro M, Schmidt Kjølner Hansen S, Truernit E. Distinct and redundant roles of the Arabidopsis OCTOPUS gene family in plant growth beyond phloem development. Journal of Experimental Botany. 2025;76(6):1752-1766. doi:10.1093/jxb/eraf010 apa: Crivelli, S., Bartusch, K., Ruiz-Sola, M. A., Coiro, M., Schmidt Kjølner Hansen, S., & Truernit, E. (2025). Distinct and redundant roles of the Arabidopsis OCTOPUS gene family in plant growth beyond phloem development. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/eraf010 chicago: Crivelli, Simona, Kai Bartusch, M Aguila Ruiz-Sola, Mario Coiro, Signe Schmidt Kjølner Hansen, and Elisabeth Truernit. “Distinct and Redundant Roles of the Arabidopsis OCTOPUS Gene Family in Plant Growth beyond Phloem Development.” Journal of Experimental Botany. Oxford University Press, 2025. https://doi.org/10.1093/jxb/eraf010. ieee: S. Crivelli, K. Bartusch, M. A. Ruiz-Sola, M. Coiro, S. Schmidt Kjølner Hansen, and E. Truernit, “Distinct and redundant roles of the Arabidopsis OCTOPUS gene family in plant growth beyond phloem development,” Journal of Experimental Botany, vol. 76, no. 6. Oxford University Press, pp. 1752–1766, 2025. ista: Crivelli S, Bartusch K, Ruiz-Sola MA, Coiro M, Schmidt Kjølner Hansen S, Truernit E. 2025. Distinct and redundant roles of the Arabidopsis OCTOPUS gene family in plant growth beyond phloem development. Journal of Experimental Botany. 76(6), 1752–1766. mla: Crivelli, Simona, et al. “Distinct and Redundant Roles of the Arabidopsis OCTOPUS Gene Family in Plant Growth beyond Phloem Development.” Journal of Experimental Botany, vol. 76, no. 6, Oxford University Press, 2025, pp. 1752–66, doi:10.1093/jxb/eraf010. short: S. Crivelli, K. Bartusch, M.A. Ruiz-Sola, M. Coiro, S. Schmidt Kjølner Hansen, E. Truernit, Journal of Experimental Botany 76 (2025) 1752–1766. date_created: 2026-10-13T11:14:54Z date_published: 2025-04-09T00:00:00Z date_updated: 2026-10-14T09:05:24Z day: '09' ddc: - '580' doi: 10.1093/jxb/eraf010 extern: '1' external_id: pmid: - '39798141' fulldoi: https://doi.org/10.1093/jxb/eraf010 has_accepted_license: '1' intvolume: ' 76' issue: '6' language: - iso: eng month: '04' oa_version: Published Version page: 1752-1766 pmid: 1 publication: Journal of Experimental Botany publication_identifier: eissn: - 1460-2431 issn: - 0022-0957 publication_status: published publisher: Oxford University Press quality_controlled: '1' scopus_import: '1' status: public title: Distinct and redundant roles of the Arabidopsis OCTOPUS gene family in plant growth beyond phloem development tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 76 year: '2025' ... --- OA_place: publisher _id: '19395' abstract: - lang: eng text: "Plant growth and development rely significantly on phytohormones, with auxin serving as a master regulator, orchestrating processes from embryogenesis to organogenesis, vascular patterning, and environmental adaptation. Since its conceptual proposition by Charles Darwin in 1880 as an endogenous chemical signal influencing phototropism in grass, auxin has captivated scientists seeking to understand how such a small molecule exerts a profound influence on plant development.\r\nOne particularly fascinating aspect of auxin function is its ability to self-organize its transport. Through a feedback mechanism between auxin perception and directional transport—primarily mediated by PIN auxin transporters—auxin establishes narrow transport channels. This phenomenon, known as auxin canalization, is fundamental to vascular formation, regeneration, and other key developmental processes. Despite advances in our understanding, driven by experimental studies and computational models, auxin canalization remains an enigma, with many unanswered questions.\r\nLike other hormones, auxin functions through intricate signaling pathways. It operates through at least two distinct signaling mechanisms: the well-characterized canonical pathway and the less understood non-canonical pathway. While significant progress has been made in elucidating the canonical pathway, the non-canonical mechanisms remain less defined and require further investigation.\r\nIn this study, we revisit the non-canonical auxin signaling pathway mediated by the cell-surface complex Auxin Binding Protein 1-Transmembrane Kinase 1 (ABP1-TMK1), with a particular focus on its downstream phosphorylation events. We reveal that this auxin-mediated phosphorylation is conserved across the green lineage, underscoring its fundamental role in plant development. We explore key phosphorylation targets, particularly PIN2, which is essential for root gravitropism. To further understand TMK1’s role in diverse developmental processes, we identified and investigated its interactors as potential co-receptors or regulatory components within its signaling network.\r\nGiven the previously established role of ABP1-TMK1 in auxin canalization, we sought to further investigate this process and identified several TMK1 interactors also involved in this intricate mechanism.\r\nThese findings provide new insights into the complex regulation of auxin canalization, highlighting a broader and more interconnected signaling framework than previously understood." acknowledged_ssus: - _id: LifeSc - _id: Bio acknowledgement: I would like to acknowledge the facilities at ISTA, particularly LSF, IOF, and, of course, the plant facility, for providing the necessary resources for my research. alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Aline full_name: Monzer, Aline id: 2DB5D88C-D7B3-11E9-B8FD-7907E6697425 last_name: Monzer citation: ama: 'Monzer A. Cell-surface auxin signaling: Linking molecular pathways to plant development. 2025. doi:10.15479/AT-ISTA-19395' apa: 'Monzer, A. (2025). Cell-surface auxin signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19395' chicago: 'Monzer, Aline. “Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19395.' ieee: 'A. Monzer, “Cell-surface auxin signaling: Linking molecular pathways to plant development,” Institute of Science and Technology Austria, 2025.' ista: 'Monzer A. 2025. Cell-surface auxin signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria.' mla: 'Monzer, Aline. Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19395.' short: 'A. Monzer, Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-03-12T14:25:42Z date_published: 2025-03-13T00:00:00Z date_updated: 2026-10-15T08:06:16Z day: '13' ddc: - '580' degree_awarded: PhD department: - _id: GradSch - _id: JiFr doi: 10.15479/AT-ISTA-19395 doi_confirm: '1' file: - access_level: open_access checksum: 9a3dd03bb4ec6b9907a325c3c4e8a1d7 content_type: application/pdf creator: amonzer date_created: 2025-03-12T14:14:49Z date_updated: 2025-03-12T14:14:49Z file_id: '19396' file_name: Final Thesis Aline Monzer.pdf file_size: 13119670 relation: main_file success: 1 - access_level: closed checksum: a353ce1ee2eabce37bca35499e76dbf1 content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document creator: amonzer date_created: 2025-03-12T14:15:19Z date_updated: 2025-04-01T07:55:27Z file_id: '19397' file_name: Thesis Aline.docx file_size: 13774837 relation: source_file file_date_updated: 2025-04-01T07:55:27Z fulldoi: https://doi.org/10.15479/AT-ISTA-19395 has_accepted_license: '1' language: - iso: eng month: '03' oa: 1 oa_version: Published Version page: '160' publication_identifier: eisbn: - 978-3-99078-054-1 eissn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '12291' relation: part_of_dissertation status: public - id: '19399' relation: part_of_dissertation status: public - id: '19398' relation: part_of_dissertation status: public - id: '14826' relation: part_of_dissertation status: public status: public supervisor: - first_name: Jiří full_name: Friml, Jiří id: 4159519E-F248-11E8-B48F-1D18A9856A87 last_name: Friml orcid: 0000-0002-8302-7596 title: 'Cell-surface auxin signaling: Linking molecular pathways to plant development' type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '21074' abstract: - lang: eng 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. 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.' alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Hanlin full_name: Yu, Hanlin last_name: Yu - first_name: Befrin full_name: Inal, Befrin last_name: Inal - first_name: Georgios full_name: Arvanitidis, Georgios last_name: Arvanitidis - first_name: Soren full_name: Hauberg, Soren last_name: Hauberg - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Marco full_name: Fumero, Marco id: 1c1593eb-393f-11ef-bb8e-ab4f1e979650 last_name: Fumero citation: 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. doi:10.52202/085713-3769' 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. https://doi.org/10.52202/085713-3769' 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. https://doi.org/10.52202/085713-3769. 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. 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.' 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, doi:10.52202/085713-3769. 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. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '1' date_created: 2026-01-29T14:31:52Z date_published: 2025-12-15T00:00:00Z date_updated: 2026-10-15T09:17:34Z day: '15' ddc: - '000' department: - _id: FrLo doi: 10.52202/085713-3769 ec_funded: 1 external_id: arxiv: - '2506.01599' file: - access_level: open_access checksum: b1a645418025f46394764cd16d0cb089 content_type: application/pdf creator: flocatel date_created: 2026-01-29T14:31:42Z date_updated: 2026-01-29T14:31:42Z file_id: '21075' file_name: 2506.01599v2.pdf file_size: 7749349 relation: main_file success: 1 file_date_updated: 2026-01-29T14:31:42Z fulldoi: https://doi.org/10.52202/085713-3769 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: issn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' status: public title: Connecting neural models latent geometries with relative geodesic representations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '21076' 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. 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. alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No author: - first_name: Riccardo full_name: Cadei, Riccardo id: 0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b last_name: Cadei - first_name: Ilker full_name: Demirel, Ilker last_name: Demirel - first_name: Piersilvio full_name: De Bartolomeis, Piersilvio last_name: De Bartolomeis - first_name: Lukas full_name: Lindorfer, Lukas id: 85f0e6d3-06b3-11ec-8982-8c5049fa4455 last_name: Lindorfer - first_name: Sylvia full_name: Cremer, Sylvia id: 2F64EC8C-F248-11E8-B48F-1D18A9856A87 last_name: Cremer orcid: 0000-0002-2193-3868 - first_name: Cordelia full_name: Schmid, Cordelia last_name: Schmid - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 citation: 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. doi:10.52202/085713-2479' 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. https://doi.org/10.52202/085713-2479' 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. https://doi.org/10.52202/085713-2479. 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. 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.' 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, doi:10.52202/085713-2479. 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. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 das_tickbox: '1' date_created: 2026-01-29T14:35:11Z date_published: 2025-12-15T00:00:00Z date_updated: 2026-10-15T09:29:52Z day: '15' ddc: - '000' department: - _id: FrLo - _id: SyCr doi: 10.52202/085713-2479 file: - access_level: open_access checksum: 92467fa566cd36671a6a3b9e71ae0f71 content_type: application/pdf creator: flocatel date_created: 2026-01-29T14:35:02Z date_updated: 2026-01-29T14:35:02Z file_id: '21077' file_name: 17546_Prediction_Powered_Causa.pdf file_size: 8489023 relation: main_file success: 1 file_date_updated: 2026-01-29T14:35:02Z fulldoi: https://doi.org/10.52202/085713-2479 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng month: '12' oa: 1 oa_version: Published Version project: - _id: a392d8f0-b034-11f1-b88e-d3025c6734f6 grant_number: COE12 name: Bilateral Artificial Intelligence (Locatello) publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' status: public title: Prediction-powered causal inferences tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '21072' 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. 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. ' article_processing_charge: No arxiv: 1 author: - first_name: Lorenzo full_name: Basile, Lorenzo last_name: Basile - first_name: Valentino full_name: Maiorca, Valentino last_name: Maiorca - first_name: Diego full_name: Doimo, Diego last_name: Doimo - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 - first_name: Alberto full_name: Cazzaniga, Alberto last_name: Cazzaniga citation: 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. doi:10.52202/085713-3752' 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. https://doi.org/10.52202/085713-3752' 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. https://doi.org/10.52202/085713-3752.' 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.' 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.' 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, doi:10.52202/085713-3752.' 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. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 das_tickbox: '1' date_created: 2026-01-29T14:29:23Z date_published: 2025-12-15T00:00:00Z date_updated: 2026-10-15T09:26:57Z day: '15' ddc: - '000' department: - _id: FrLo doi: 10.52202/085713-3752 external_id: arxiv: - '2510.21518' file: - access_level: open_access checksum: 85be3f98663e2595cf37001852b477cb content_type: application/pdf creator: flocatel date_created: 2026-01-29T14:29:14Z date_updated: 2026-01-29T14:29:14Z file_id: '21073' file_name: 2510.21518v2.pdf file_size: 4271547 relation: main_file success: 1 file_date_updated: 2026-01-29T14:29:14Z fulldoi: https://doi.org/10.52202/085713-3752 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng month: '12' oa: 1 oa_version: Preprint publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' status: public title: 'Head pursuit: Probing attention specialization in multimodal transformers' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: repository OA_type: green _id: '21068' 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." 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" alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Dingling full_name: Yao, Dingling id: d3e02e50-48a8-11ee-8f62-c108061797fa last_name: Yao - first_name: Shimeng full_name: Huang, Shimeng id: 989c2a06-fb4e-11ef-a992-ab766442255b last_name: Huang orcid: 0000-0001-6919-821X - first_name: Riccardo full_name: Cadei, Riccardo id: 0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b last_name: Cadei - first_name: Kun full_name: Zhang, Kun last_name: Zhang - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 citation: 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. doi:10.52202/085713-1444' 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. https://doi.org/10.52202/085713-1444' 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. https://doi.org/10.52202/085713-1444. 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, doi:10.52202/085713-1444. 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. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '1' date_created: 2026-01-29T14:24:56Z date_published: 2025-12-15T00:00:00Z date_updated: 2026-10-15T09:31:39Z day: '15' ddc: - '000' department: - _id: FrLo doi: 10.52202/085713-1444 external_id: arxiv: - '2505.17708' fulldoi: https://doi.org/10.52202/085713-1444 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2505.17708 month: '12' oa: 1 oa_version: Preprint project: - _id: a392d8f0-b034-11f1-b88e-d3025c6734f6 grant_number: COE12 name: Bilateral Artificial Intelligence (Locatello) publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' related_material: link: - relation: software url: https://github.com/shimenghuang/a-measurement-perspective-of-crl status: public title: The third pillar of causal analysis? A measurement perspective on causal representations tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18631' abstract: - lang: eng text: Within the established framework of structure formation, galaxies start as systems of low stellar mass and gradually grow into far more massive galaxies. The existence of massive galaxies in the first billion years of the Universe, as suggested by recent observations, seems to challenge this model, as such galaxies would require highly efficient conversion of baryons into stars. An even greater challenge in this epoch is the existence of massive galaxies that have already ceased forming stars. However, robust detections of early massive quiescent galaxies have been challenging due to the coarse wavelength sampling of photometric surveys. Here we report the spectroscopic confirmation with the James Webb Space Telescope of the quiescent galaxy RUBIES-EGS-QG-1 at redshift z = 4.90, 1.2 billion years after the Big Bang. Deep stellar absorption features in the spectrum reveal that the stellar mass of the galaxy of 1011 M⊙ formed in a short 200 Myr burst of star formation, after which star formation activity dropped rapidly and persistently. According to current galaxy formation models, systems with such rapid stellar mass growth and early quenching are too rare to plausibly occur in the small area probed spectroscopically with JWST. Instead, the discovery of RUBIES-EGS-QG-1 implies that early massive quiescent galaxies can be quenched earlier or exhaust gas available for star formation more efficiently than assumed at present. acknowledgement: We thank V. Buat, D. Burgarella and J. Zavala for sharing their NOEMA data and constraints on the dust-obscured star formation of RUBIES-EGS-QG-1. This work is partially based on observations carried out under project number W20CK with the IRAM NOEMA Interferometer. IRAM is supported by INSU/CNRS (France), MPG (Germany) and IGN (Spain). We thank C. Lagos for providing measurements from the SHARK simulation. This research was supported by the International Space Science Institute (ISSI) in Bern, through ISSI International Team Project No. 562. M.V.M., J.L. and B.W. acknowledge funding support from NASA through JWST-GO-4233. The Cosmic Dawn Center is funded by the Danish National Research Foundation (Grant No. DNRF140 to G.B., P.A.O. and K.E.W.). This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (Contract No. MB22.00072) and the Swiss National Science Foundation (Project Grant No. 200020_207349 to P.A.O.). Support for this work was provided by the Brinson Foundation through a Brinson Prize Fellowship grant (D.J.S.). K.A.S. is a NHFP Hubble Fellow. Support for this work was provided by NASA through the NASA Hubble Fellowship Grant No. HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Incorporated, under NASA contract NAS 5-26555 (R.P.N.). This work is based on observations made with the NASA/ESA/CSA JWST. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. The observations in this work are associated with programmes ERS-1345, GO-2234, DDT-2750 and GO-4233. We gratefully acknowledge the CEERS and DDT-2750 teams for developing their observing programme with a zero-exclusive-access period. Open access funding provided by Max Planck Society. article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Anna full_name: De Graaff, Anna last_name: De Graaff - first_name: David J. full_name: Setton, David J. last_name: Setton - first_name: Gabriel full_name: Brammer, Gabriel last_name: Brammer - first_name: Sam full_name: Cutler, Sam last_name: Cutler - first_name: Katherine A. full_name: Suess, Katherine A. last_name: Suess - first_name: Ivo full_name: Labbé, Ivo last_name: Labbé - first_name: Joel full_name: Leja, Joel last_name: Leja - first_name: Andrea full_name: Weibel, Andrea last_name: Weibel - first_name: Michael V. full_name: Maseda, Michael V. last_name: Maseda - first_name: Katherine E. full_name: Whitaker, Katherine E. last_name: Whitaker - first_name: Rachel full_name: Bezanson, Rachel last_name: Bezanson - first_name: Leindert A. full_name: Boogaard, Leindert A. last_name: Boogaard - first_name: Nikko J. full_name: Cleri, Nikko J. last_name: Cleri - first_name: Gabriella full_name: De Lucia, Gabriella last_name: De Lucia - first_name: Marijn full_name: Franx, Marijn last_name: Franx - first_name: Jenny E. full_name: Greene, Jenny E. last_name: Greene - first_name: Michaela full_name: Hirschmann, Michaela last_name: Hirschmann - first_name: Jorryt J full_name: Matthee, Jorryt J id: 7439a258-f3c0-11ec-9501-9df22fe06720 last_name: Matthee orcid: 0000-0003-2871-127X - first_name: Ian full_name: Mcconachie, Ian last_name: Mcconachie - first_name: Rohan P. full_name: Naidu, Rohan P. last_name: Naidu - first_name: Pascal A. full_name: Oesch, Pascal A. last_name: Oesch - first_name: Sedona H. full_name: Price, Sedona H. last_name: Price - first_name: Hans Walter full_name: Rix, Hans Walter last_name: Rix - first_name: Francesco full_name: Valentino, Francesco last_name: Valentino - first_name: Bingjie full_name: Wang, Bingjie last_name: Wang - first_name: Christina C. full_name: Williams, Christina C. last_name: Williams citation: ama: De Graaff A, Setton DJ, Brammer G, et al. Efficient formation of a massive quiescent galaxy at redshift 4.9. Nature Astronomy. 2025;9:280-292. doi:10.1038/s41550-024-02424-3 apa: De Graaff, A., Setton, D. J., Brammer, G., Cutler, S., Suess, K. A., Labbé, I., … Williams, C. C. (2025). Efficient formation of a massive quiescent galaxy at redshift 4.9. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-024-02424-3 chicago: De Graaff, Anna, David J. Setton, Gabriel Brammer, Sam Cutler, Katherine A. Suess, Ivo Labbé, Joel Leja, et al. “Efficient Formation of a Massive Quiescent Galaxy at Redshift 4.9.” Nature Astronomy. Springer Nature, 2025. https://doi.org/10.1038/s41550-024-02424-3. ieee: A. De Graaff et al., “Efficient formation of a massive quiescent galaxy at redshift 4.9,” Nature Astronomy, vol. 9. Springer Nature, pp. 280–292, 2025. ista: De Graaff A, Setton DJ, Brammer G, Cutler S, Suess KA, Labbé I, Leja J, Weibel A, Maseda MV, Whitaker KE, Bezanson R, Boogaard LA, Cleri NJ, De Lucia G, Franx M, Greene JE, Hirschmann M, Matthee JJ, Mcconachie I, Naidu RP, Oesch PA, Price SH, Rix HW, Valentino F, Wang B, Williams CC. 2025. Efficient formation of a massive quiescent galaxy at redshift 4.9. Nature Astronomy. 9, 280–292. mla: De Graaff, Anna, et al. “Efficient Formation of a Massive Quiescent Galaxy at Redshift 4.9.” Nature Astronomy, vol. 9, Springer Nature, 2025, pp. 280–92, doi:10.1038/s41550-024-02424-3. short: A. De Graaff, D.J. Setton, G. Brammer, S. Cutler, K.A. Suess, I. Labbé, J. Leja, A. Weibel, M.V. Maseda, K.E. Whitaker, R. Bezanson, L.A. Boogaard, N.J. Cleri, G. De Lucia, M. Franx, J.E. Greene, M. Hirschmann, J.J. Matthee, I. Mcconachie, R.P. Naidu, P.A. Oesch, S.H. Price, H.W. Rix, F. Valentino, B. Wang, C.C. Williams, Nature Astronomy 9 (2025) 280–292. das_tickbox: '1' dataavailabilitystatement: The unprocessed JWST data are available through the Mikulski Archive for Space Telescopes. Reduced data from JWST underlying this work are publicly available in the DJA (https://dawn-cph.github.io/dja/), as described in refs. 9,46. date_created: 2024-12-08T23:01:56Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-10-15T09:40:28Z day: '01' ddc: - '520' department: - _id: JoMa doi: 10.1038/s41550-024-02424-3 external_id: isi: - '001420347200001' pmid: - '39990236' file: - access_level: open_access checksum: fb9109951dfe72f08c04c72cd7cfba69 content_type: application/pdf creator: dernst date_created: 2025-04-16T08:53:59Z date_updated: 2025-04-16T08:53:59Z file_id: '19574' file_name: 2025_NatureAstronomy_deGraaff.pdf file_size: 2034513 relation: main_file success: 1 file_date_updated: 2025-04-16T08:53:59Z fulldoi: https://doi.org/10.1038/s41550-024-02424-3 has_accepted_license: '1' intvolume: ' 9' isi: 1 language: - iso: eng month: '02' oa: 1 oa_version: Published Version page: 280-292 pmid: 1 publication: Nature Astronomy publication_identifier: eissn: - 2397-3366 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Efficient formation of a massive quiescent galaxy at redshift 4.9 tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 9 year: '2025' ... --- OA_place: repository OA_type: green _id: '21070' 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. ' 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" alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No arxiv: 1 author: - first_name: Berker full_name: Demirel, Berker id: 8b4bc47f-3200-11ee-973b-8f0e7be21a9f last_name: Demirel - first_name: 'Marco ' full_name: 'Fumero, Marco ' last_name: Fumero - first_name: Francesco full_name: Locatello, Francesco id: 26cfd52f-2483-11ee-8040-88983bcc06d4 last_name: Locatello orcid: 0000-0002-4850-0683 citation: 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. doi:10.52202/085713-3125' 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. https://doi.org/10.52202/085713-3125' 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. https://doi.org/10.52202/085713-3125. 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. 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, doi:10.52202/085713-3125. short: B. Demirel, M. Fumero, F. Locatello, in:, 39th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '1' date_created: 2026-01-29T14:26:47Z date_published: 2025-12-01T00:00:00Z date_updated: 2026-10-15T09:32:34Z day: '01' ddc: - '000' department: - _id: FrLo doi: 10.52202/085713-3125 external_id: arxiv: - '2410.04525' fulldoi: https://doi.org/10.52202/085713-3125 has_accepted_license: '1' intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.48550/arXiv.2410.04525 month: '12' oa: 1 oa_version: Preprint project: - _id: a392d8f0-b034-11f1-b88e-d3025c6734f6 grant_number: COE12 name: Bilateral Artificial Intelligence (Locatello) publication: 39th Annual Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' related_material: link: - relation: software url: https://github.com/berkerdemirel/ORA-OOD-Detection-with-Relative-Angles status: public title: Out-of-Distribution detection with relative angles tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher OA_type: free access _id: '22823' abstract: - lang: eng text: This position paper argues that setting the privacy budget in differential privacy should not be viewed as an important limitation of differential privacy compared to alternative methods for privacy-preserving machine learning. The so-called problem of interpreting the privacy budget is often presented as a major hindrance to the wider adoption of differential privacy in real-world deployments and is sometimes used to promote alternative mitigation techniques for data protection. We believe this misleads decision-makers into choosing unsafe methods. We argue that the difficulty in interpreting privacy budgets does not stem from the definition of differential privacy itself, but from the intrinsic difficulty of estimating privacy risks in context, a challenge that any rigorous method for privacy risk assessment face. Moreover, we claim that any sound method for estimating privacy risks should, given the current state of research, be expressible within the differential privacy framework or justify why it cannot. acknowledgement: "This research was funded in whole by the Austrian Science Fund (FWF) 10.55776/COE12. I thank\r\nAlberto Naibo for the discussion and his invitation to \"Logique, droit, IA : penser les algorithmes\"\r\ncolloquium. I thank Simone Bombari for the discussions. I thank EurIPS for the active poster session." alternative_title: - Advances in Neural Information Processing Systems article_processing_charge: No author: - first_name: Edwige Audrey Lucienne full_name: Cyffers, Edwige Audrey Lucienne id: 20d4c299-977a-11ef-ae55-98b15ac64a57 last_name: Cyffers citation: ama: 'Cyffers EAL. Setting ε is not the issue in differential privacy. In: 39th Conference on Neural Information Processing Systems. Vol 38. Neural Information Processing Systems Foundation; 2025:159016-159028. doi:10.52202/085713-4798' apa: 'Cyffers, E. A. L. (2025). Setting ε is not the issue in differential privacy. In 39th Conference on Neural Information Processing Systems (Vol. 38, pp. 159016–159028). San Diego, CA, United States: Neural Information Processing Systems Foundation. https://doi.org/10.52202/085713-4798' chicago: Cyffers, Edwige Audrey Lucienne. “Setting ε Is Not the Issue in Differential Privacy.” In 39th Conference on Neural Information Processing Systems, 38:159016–28. Neural Information Processing Systems Foundation, 2025. https://doi.org/10.52202/085713-4798. ieee: E. A. L. Cyffers, “Setting ε is not the issue in differential privacy,” in 39th Conference on Neural Information Processing Systems, San Diego, CA, United States, 2025, vol. 38, pp. 159016–159028. ista: 'Cyffers EAL. 2025. Setting ε is not the issue in differential privacy. 39th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 38, 159016–159028.' mla: Cyffers, Edwige Audrey Lucienne. “Setting ε Is Not the Issue in Differential Privacy.” 39th Conference on Neural Information Processing Systems, vol. 38, Neural Information Processing Systems Foundation, 2025, pp. 159016–28, doi:10.52202/085713-4798. short: E.A.L. Cyffers, in:, 39th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2025, pp. 159016–159028. conference: end_date: 2025-12-07 location: San Diego, CA, United States name: 'NeurIPS: Neural Information Processing Systems' start_date: 2025-12-02 corr_author: '1' das_tickbox: '0' date_created: 2026-09-06T22:01:59Z date_published: 2025-12-02T00:00:00Z date_updated: 2026-10-15T09:34:50Z day: '02' department: - _id: ChLa doi: 10.52202/085713-4798 fulldoi: https://doi.org/10.52202/085713-4798 intvolume: ' 38' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.52202/085713-4798 month: '12' oa: 1 oa_version: Published Version page: 159016-159028 project: - _id: d8f03aaa-b035-11f1-8588-d5147fa879e0 grant_number: COE12 name: Bilateral Artificial Intelligence (Lampert) publication: 39th Conference on Neural Information Processing Systems publication_identifier: eissn: - 1049-5258 isbn: - '9798331338275' publication_status: published publisher: Neural Information Processing Systems Foundation quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Setting ε is not the issue in differential privacy type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 38 year: '2025' ... --- OA_place: publisher _id: '19903' abstract: - lang: eng text: "Cooperation, that is, one person paying a cost for another's benefit, is a fundamental principle without which no form of society could exist. The extent to which humans cooperate with each other is also an essential feature that differentiates them from other animals. Cooperation occurs even in the absence of altruistic motivations, when it is selfishly incentivised by the expectation of a future reward. For example, many economic interactions are well described that way. This kind of cooperation requires that people exhibit reciprocal behaviour that acts as a mechanism that rewards cooperation.\r\nWith game-theoretic models, it is possible to formally study potential such mechanisms and under what conditions they can exist. This thesis contributes to this effort by analysing recently introduced models of cooperation that advance on previous work by taking into account the potential for pre-existing inequality among cooperating individuals as well as the different forms that reciprocity can take.\r\nIndividuals may differ both intrinsically, in their abilities, as well as extrinsically, in the amount of resources they have available. Allowing for such differences in a model of cooperation helps to understand how inequality affects the potential for, and outcomes of, cooperation among unequals. In this thesis, it is shown that in the presence of intrinsic inequality, a similar unequal distribution of resources can increase the potential for cooperation. This effect is stronger the smaller the group is in which cooperation takes place. It is also shown that under particular assumptions, if the unequal members of a group vary the size of their contributions to a cooperative effort over time, they can thereby increase their efficiency and improve the collective outcome.\r\nCooperative behaviour in a two-person interaction can be rewarded either by direct reciprocation whenever the same two people interact again, or indirectly by a third party who observed the interaction. In the latter case of indirect reciprocity, individuals are proximally rewarded by a good reputation, which ultimately translates to being rewarded with cooperative behaviour by others. This mechanism can enable selfishly motivated cooperation even in circumstances where individuals are unlikely to meet again, akin to how money facilitates trade. While these two forms of reciprocity have mostly been studied in isolation, this thesis analyses both direct and indirect reciprocity in a general model in order to compare their relative effectiveness under different circumstances. The contribution of this thesis is an extension of previous work regarding a specific kind of interaction, whose parameters allow for convenient mathematical analysis, to the most general set of possible interactions." acknowledgement: "The research for this thesis was supported by the European Research Council\r\n(grant agreements No. 863818 and No. 850529), the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie grant agreement No. 754411),\r\nthe Austrian Science Fund (grant DOI 10.55776/COE12), the French Agence Nationale\r\nde la Recherche under the Programme d’investissements d’avenir (project reference 17-\r\nEURE-0010) and the Australian Government through the Australian Research Council\r\n(grant No. SR200100005, “Securing Antarctica’s Environmental Future”)." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Valentin full_name: Hübner, Valentin id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910 last_name: Hübner orcid: 0009-0001-5009-4987 citation: ama: Hübner V. Reciprocity and inequality in social dilemmas. 2025. doi:10.15479/AT-ISTA-19903 apa: Hübner, V. (2025). Reciprocity and inequality in social dilemmas. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19903 chicago: Hübner, Valentin. “Reciprocity and Inequality in Social Dilemmas.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19903. ieee: V. Hübner, “Reciprocity and inequality in social dilemmas,” Institute of Science and Technology Austria, 2025. ista: Hübner V. 2025. Reciprocity and inequality in social dilemmas. Institute of Science and Technology Austria. mla: Hübner, Valentin. Reciprocity and Inequality in Social Dilemmas. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19903. short: V. Hübner, Reciprocity and Inequality in Social Dilemmas, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-06-25T13:50:10Z date_published: 2025-06-25T00:00:00Z date_updated: 2026-10-15T10:10:25Z day: '25' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/AT-ISTA-19903 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: 794c02f8c82ca59ba6dda3bd7eed871a content_type: application/x-xz creator: vhuebner date_created: 2025-06-25T13:38:07Z date_updated: 2025-06-25T13:38:07Z file_id: '19905' file_name: Thesis Valentin Hübner source.tar.xz file_size: 6192760 relation: source_file - access_level: open_access checksum: ac56063d81c81e40322b6ff5a8c4912e content_type: application/pdf creator: vhuebner date_created: 2025-07-09T13:37:00Z date_updated: 2025-07-09T13:37:00Z file_id: '19976' file_name: Thesis Valentin Hübner.pdf file_size: 4837864 relation: main_file file_date_updated: 2025-07-09T13:37:00Z fulldoi: https://doi.org/10.15479/AT-ISTA-19903 has_accepted_license: '1' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: '157' project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 260C2330-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '754411' name: ISTplus - Postdoctoral Fellowships - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '19843' relation: part_of_dissertation status: public - id: '19074' relation: part_of_dissertation status: public - id: '15083' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: Reciprocity and inequality in social dilemmas tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '20138' abstract: - lang: eng 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" acknowledgement: "This work was supported by the European Research Council CoG 863818 (ForMSMArt) and Austrian Science Fund 10.55776/COE12.\r\n" alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 citation: ama: Svoboda J. Structural properties of games on graphs. 2025. doi:10.15479/AT-ISTA-20138 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. 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. 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. corr_author: '1' das_tickbox: '1' date_created: 2025-08-05T14:33:59Z date_published: 2025-08-05T00:00:00Z date_updated: 2026-10-16T08:00:05Z day: '05' ddc: - '000' - '519' degree_awarded: PhD department: - _id: GradSch - _id: KrCh doi: 10.15479/AT-ISTA-20138 doi_confirm: '1' ec_funded: 1 file: - access_level: open_access checksum: c6c4df9777f4537940de7ab392ad57e2 content_type: application/pdf creator: jsvoboda date_created: 2025-08-14T09:54:43Z date_updated: 2025-08-14T09:54:43Z file_id: '20177' file_name: 2025_Svoboda_Jakub_Thesis.pdf file_size: 5927291 relation: main_file success: 1 - access_level: closed checksum: 485e9f9822821bc03666d245d80aaa08 content_type: application/zip creator: jsvoboda date_created: 2025-08-14T09:55:20Z date_updated: 2025-08-21T11:48:39Z file_id: '20178' file_name: 2025_Svoboda_Jakub_Thesis.zip file_size: 6731815 relation: source_file file_date_updated: 2025-08-21T11:48:39Z fulldoi: https://doi.org/10.15479/AT-ISTA-20138 has_accepted_license: '1' language: - iso: eng month: '08' oa: 1 oa_version: Published Version page: '167' project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' - _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee grant_number: COE12 name: Bilateral Artificial Intelligence (Chatterjee) publication_identifier: issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria 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" related_material: record: - id: '12787' relation: part_of_dissertation status: public - id: '12101' relation: part_of_dissertation status: public - id: '12257' relation: part_of_dissertation status: public - id: '15297' relation: part_of_dissertation status: public - id: '18703' relation: part_of_dissertation status: public status: public supervisor: - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X title: Structural properties of games on graphs tmp: image: /images/cc_by_nc_sa.png legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0) short: CC BY-NC-SA (4.0) type: dissertation user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2025' ... --- OA_place: publisher _id: '20575' abstract: - lang: eng text: "This thesis deals with eigenvalue and eigenvector universality results for random matrix ensembles equipped with non-trivial spatial structure. We consider both mean-field models with a general variance profile (Wigner-type matrices) and correlation structure (correlated matrices) among the entries, as well as non-mean-field random band matrices with bandwidth W >> N^(1/2).\r\n\r\nTo extract the universal properties of random matrix spectra and eigenvectors, we obtain concentration estimates for their resolvent, the local laws, which generalize the celebrated Wigner semicircle law for a broad class of random matrices to much finer spectral scales. The local laws hold for both a single resolvent as well as for products of multiple resolvents, known as resolvent chains, and express the remarkable approximately-deterministic behavior of these objects down to the microscopic scale.\r\n\r\nOur primary tool for establishing the local laws is the dynamical Zigzag strategy, which we develop in the setting of spatially-inhomogeneous random matrices. Our proof method systematically addresses the challenges arising from non-trivial spatial structures and is robust to all types of singularities in the spectrum, as we demonstrate in the correlated setting. Furthermore, we incorporate the analysis of the deterministic resolvent chain approximations into the dynamical framework of the Zigzag strategy, synthesizing a unified toolkit for establishing multi-resolvent local laws.\r\n\r\nUsing these methods, we prove complete eigenvector delocalization, the Eigenstate Thermalization Hypothesis, and Wigner-Dyson universality in the bulk for random band matrices down to the optimal bandwidth W >> N^(1/2). For mean-field ensembles, we establish universality of local eigenvalue statistics at the cups for random matrices with correlated entries, and the Eigenstate Thermalization Hypothesis for Wigner-type matrices in the bulk of the spectrum.\r\n\r\nFinally, this thesis also contains other applications of the multi-resolvent local laws to spatially-inhomogeneous random matrices, obtained prior to the development of the Zigzag strategy. In particular, we provide a complete analysis of mesoscopic linear-eigenvalue statistics of Wigner-type matrices in all spectral regimes, including the novel cusps, and rigorously establish the prethermalization phenomenon for deformed Wigner matrices.\r\n\r\nThe main body of this thesis consists of seven research papers (listed on page xi), each presented in a separate chapter with its own introduction and all relevant context, suitable to be read independently. We ask the reader’s indulgence for the repetitions in the historical overviews and other minor redundancies that remain among the chapters as a result. The overall Introduction, preceding the chapters, provides a condensed, informal summary of the main ideas and concepts at the core of these works.\r\n" acknowledgement: "The work comprising this thesis was supported by the ERC Advanced Grant \"RMTBeyond\"\r\nNo.101020331 awarded to my advisor." alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Volodymyr full_name: Riabov, Volodymyr id: 1949f904-edfb-11eb-afb5-e2dfddabb93b last_name: Riabov citation: ama: Riabov V. Universality in random matrices with spatial structure. 2025. doi:10.15479/AT-ISTA-20575 apa: Riabov, V. (2025). Universality in random matrices with spatial structure. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20575 chicago: Riabov, Volodymyr. “Universality in Random Matrices with Spatial Structure.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20575. ieee: V. Riabov, “Universality in random matrices with spatial structure,” Institute of Science and Technology Austria, 2025. ista: Riabov V. 2025. Universality in random matrices with spatial structure. Institute of Science and Technology Austria. mla: Riabov, Volodymyr. Universality in Random Matrices with Spatial Structure. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20575. short: V. Riabov, Universality in Random Matrices with Spatial Structure, Institute of Science and Technology Austria, 2025. corr_author: '1' date_created: 2025-10-29T19:12:24Z date_published: 2025-11-03T00:00:00Z date_updated: 2026-10-16T08:41:47Z day: '3' ddc: - '515' - '519' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT-ISTA-20575 ec_funded: 1 file: - access_level: open_access checksum: 6a0487b2b66bb35d44b394756d44b8b4 content_type: application/pdf creator: vriabov date_created: 2025-10-29T18:53:59Z date_updated: 2025-10-29T18:53:59Z file_id: '20577' file_name: riabov_thesis-pdfa.pdf file_size: 7536583 relation: main_file success: 1 - access_level: closed checksum: 224efda6bf9864d296a1e5e0124c1e8f content_type: application/x-zip-compressed creator: vriabov date_created: 2025-10-29T18:54:53Z date_updated: 2025-10-29T18:54:53Z file_id: '20578' file_name: manuscript.zip file_size: 17841612 relation: source_file file_date_updated: 2025-10-29T18:54:53Z fulldoi: https://doi.org/10.15479/AT-ISTA-20575 has_accepted_license: '1' language: - iso: eng month: '11' oa: 1 oa_version: Published Version page: '436' project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication_identifier: isbn: - 978-3-99078-064-0 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '20322' relation: part_of_dissertation status: public - id: '13317' relation: part_of_dissertation status: public - id: '19368' relation: part_of_dissertation status: deleted - id: '20576' relation: part_of_dissertation status: public - id: '17174' relation: part_of_dissertation status: public - id: '19547' relation: part_of_dissertation status: public - id: '19598' relation: part_of_dissertation status: public - id: '18554' relation: part_of_dissertation status: public - id: '18764' relation: part_of_dissertation status: public status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: Universality in random matrices with spatial structure tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd year: '2025' ... --- OA_place: publisher _id: '19540' abstract: - lang: eng text: "This thesis deals with several different models for complex quantum mechanical systems and is structured in three main parts. \r\n\t\r\nIn Part I, we study mean field random matrices as models for quantum Hamiltonians. Our focus lies on proving concentration estimates for resolvents of random matrices, so-called local laws, mostly in the setting of multiple resolvents. These estimates have profound consequences for eigenvector overlaps and thermalization problems. More concretely, we obtain, e.g., the optimal eigenstate thermalization hypothesis (ETH) uniformly in the spectrum for Wigner matrices, an optimal lower bound on non-Hermitian eigenvector overlaps, and prethermalization for deformed Wigner matrices.\tIn order to prove our novel multi-resolvent local laws, we develop and devise two main methods, the static Psi-method and the dynamical Zigzag strategy. \r\n\t\r\nIn Part II, we study Bardeen-Cooper-Schrieffer (BCS) theory, the standard mean field microscopic theory of superconductivity. We focus on asymptotic formulas for the characteristic critical temperature and energy gap of a superconductor and prove universality of their ratio in various physical regimes. Additionally, we investigate multi-band superconductors and show that inter-band coupling effects can only enhance the critical temperature. \r\n\t\r\nIn Part III, we study quantum lattice systems. On the one hand, we show a strong version of the local-perturbations-perturb-locally (LPPL) principle for the ground state of weakly interacting quantum spin systems with a uniform on-site gap. On the other hand, we introduce a notion of a local gap and rigorously justify response theory and the Kubo formula under the weakened assumption of a local gap. \r\n\t\r\nAdditionally, we discuss two classes of problems which do not fit into the three main parts of the thesis. These are deformational rigidity of Liouville metrics on the torus and relativistic toy models of particle creation via interior-boundary-conditions (IBCs). " alternative_title: - ISTA Thesis article_processing_charge: No author: - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X citation: ama: 'Henheik SJ. Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. 2025. doi:10.15479/AT-ISTA-19540' apa: 'Henheik, S. J. (2025). Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19540' chicago: 'Henheik, Sven Joscha. “Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems.” Institute of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19540.' ieee: 'S. J. Henheik, “Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems,” Institute of Science and Technology Austria, 2025.' ista: 'Henheik SJ. 2025. Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems. Institute of Science and Technology Austria.' mla: 'Henheik, Sven Joscha. Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems. Institute of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19540.' short: 'S.J. Henheik, Modeling Complex Quantum Systems: Random Matrices, BCS Theory, and Quantum Lattice Systems, Institute of Science and Technology Austria, 2025.' corr_author: '1' date_created: 2025-04-10T21:21:18Z date_published: 2025-04-10T00:00:00Z date_updated: 2026-10-16T08:41:47Z day: '10' ddc: - '519' degree_awarded: PhD department: - _id: GradSch - _id: LaEr doi: 10.15479/AT-ISTA-19540 doi_confirm: '1' ec_funded: 1 file: - access_level: closed checksum: b8477ae5578436c72c3bb4193ad34ac5 content_type: application/zip creator: shenheik date_created: 2025-04-10T21:14:18Z date_updated: 2025-04-10T21:14:18Z file_id: '19542' file_name: Henheik-Thesis_source_final.zip file_size: 4107587 relation: source_file - access_level: open_access checksum: e9fc0ea12ec46c9f71110c33217c4140 content_type: application/pdf creator: shenheik date_created: 2025-04-11T13:16:05Z date_updated: 2025-04-11T13:16:05Z file_id: '19553' file_name: Henheik-Thesis-pdfa_FINAL.pdf file_size: 9999492 relation: main_file success: 1 - access_level: closed checksum: f94580f86c785e7108eb116cd189e225 content_type: application/pdf creator: cchlebak date_created: 2025-04-23T14:10:27Z date_updated: 2025-04-23T14:10:27Z file_id: '19615' file_name: Henheik-Thesis-Volume1_print.pdf file_size: 13276442 relation: other - access_level: closed checksum: b927ead3c78020ffb32918911deedb74 content_type: application/pdf creator: cchlebak date_created: 2025-04-23T14:11:05Z date_updated: 2025-04-23T14:11:05Z file_id: '19616' file_name: Henheik-Thesis-Volume2_print.pdf file_size: 7628767 relation: other file_date_updated: 2025-04-23T14:11:05Z fulldoi: https://doi.org/10.15479/AT-ISTA-19540 has_accepted_license: '1' language: - iso: eng month: '04' oa: 1 oa_version: Published Version page: '720' project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication_identifier: isbn: - 978-3-99078-057-2 issn: - 2663-337X publication_status: published publisher: Institute of Science and Technology Austria related_material: record: - id: '14343' relation: part_of_dissertation status: public - id: '13317' relation: part_of_dissertation status: public - id: '11732' relation: part_of_dissertation status: public - id: '12184' relation: part_of_dissertation status: public - id: '14421' relation: part_of_dissertation status: public - id: '10623' relation: part_of_dissertation status: public - id: '18112' relation: part_of_dissertation status: public - id: '19001' relation: part_of_dissertation status: public - id: '10642' relation: part_of_dissertation status: public - id: '19545' relation: part_of_dissertation status: public - id: '19546' relation: part_of_dissertation status: public - id: '19550' relation: part_of_dissertation status: public - id: '19551' relation: part_of_dissertation status: public - id: '19552' relation: part_of_dissertation status: public - id: '19547' relation: part_of_dissertation status: public - id: '19548' relation: part_of_dissertation status: public - id: '14542' relation: part_of_dissertation status: public - id: '18656' relation: part_of_dissertation status: public - id: '17049' relation: part_of_dissertation status: public - id: '18764' relation: part_of_dissertation status: public status: public supervisor: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 title: 'Modeling complex quantum systems: Random matrices, BCS theory, and quantum lattice systems' tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: dissertation user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18764' abstract: - lang: eng text: We prove that a class of weakly perturbed Hamiltonians of the form H_λ= H_0 + λW, with W being a Wigner matrix, exhibits prethermalization. That is, the time evolution generated by H_λ relaxes to its ultimate thermal state via an intermediate prethermal state with a lifetime of order λ^{-2}. Moreover, we obtain a general relaxation formula, expressing the perturbed dynamics via the unperturbed dynamics and the ultimate thermal state. The proof relies on a two-resolvent law for the deformed Wigner matrix H_λ. acknowledgement: "All authors were supported by the ERC Advanced Grant “RMTBeyond” No. 101020331.\r\nJ.R. was additionally supported by the ERC Advanced Grant “LDRaM” No. 884584.\r\nWe thank Peter Reimann and Lennart Dabelow for helpful comments. Open access funding provided by Institute of Science and Technology (IST Austria)." article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Sven Joscha full_name: Henheik, Sven Joscha id: 31d731d7-d235-11ea-ad11-b50331c8d7fb last_name: Henheik orcid: 0000-0003-1106-327X - first_name: Jana full_name: Reker, Jana id: e796e4f9-dc8d-11ea-abe3-97e26a0323e9 last_name: Reker - first_name: Volodymyr full_name: Riabov, Volodymyr id: 1949f904-edfb-11eb-afb5-e2dfddabb93b last_name: Riabov citation: ama: Erdös L, Henheik SJ, Reker J, Riabov V. Prethermalization for deformed Wigner matrices. Annales Henri Poincare. 2025;26:1991-2033. doi:10.1007/s00023-024-01518-y apa: Erdös, L., Henheik, S. J., Reker, J., & Riabov, V. (2025). Prethermalization for deformed Wigner matrices. Annales Henri Poincare. Springer Nature. https://doi.org/10.1007/s00023-024-01518-y chicago: Erdös, László, Sven Joscha Henheik, Jana Reker, and Volodymyr Riabov. “Prethermalization for Deformed Wigner Matrices.” Annales Henri Poincare. Springer Nature, 2025. https://doi.org/10.1007/s00023-024-01518-y. ieee: L. Erdös, S. J. Henheik, J. Reker, and V. Riabov, “Prethermalization for deformed Wigner matrices,” Annales Henri Poincare, vol. 26. Springer Nature, pp. 1991–2033, 2025. ista: Erdös L, Henheik SJ, Reker J, Riabov V. 2025. Prethermalization for deformed Wigner matrices. Annales Henri Poincare. 26, 1991–2033. mla: Erdös, László, et al. “Prethermalization for Deformed Wigner Matrices.” Annales Henri Poincare, vol. 26, Springer Nature, 2025, pp. 1991–2033, doi:10.1007/s00023-024-01518-y. short: L. Erdös, S.J. Henheik, J. Reker, V. Riabov, Annales Henri Poincare 26 (2025) 1991–2033. corr_author: '1' das_tickbox: '0' date_created: 2025-01-05T23:01:59Z date_published: 2025-06-01T00:00:00Z date_updated: 2026-10-16T08:41:47Z day: '01' ddc: - '510' department: - _id: LaEr doi: 10.1007/s00023-024-01518-y ec_funded: 1 external_id: arxiv: - '2310.06677' isi: - '001385326500001' file: - access_level: open_access checksum: 49e6a934db540206f7eaa0c798553ded content_type: application/pdf creator: dernst date_created: 2025-06-25T05:38:34Z date_updated: 2025-06-25T05:38:34Z file_id: '19895' file_name: 2025_AnnalesHenriPoincare_Erdoes.pdf file_size: 977773 relation: main_file success: 1 file_date_updated: 2025-06-25T05:38:34Z fulldoi: https://doi.org/10.1007/s00023-024-01518-y has_accepted_license: '1' intvolume: ' 26' isi: 1 language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 1991-2033 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Annales Henri Poincare publication_identifier: issn: - 1424-0637 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '17174' relation: earlier_version status: public - id: '20575' relation: dissertation_contains status: public - id: '19540' relation: dissertation_contains status: public researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: Prethermalization for deformed Wigner matrices tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 26 year: '2025' ... --- OA_type: closed access _id: '18707' abstract: - lang: eng text: Lead Sulfide (PbS) has garnered attention as a promising thermoelectric (TE) material due to its natural abundance and cost-effectiveness. However, its practical application is hindered by inherently high lattice thermal conductivity and low electrical conductivity. In this study, we address these challenges by surface functionalization of PbS nanocrystals using Cu2S molecular complexes-based ligand displacement. The molecular complexes facilitate the incorporation of Cu into the PbS matrix and leads to the formation of nanoscale defects, dislocations, and strain fields while optimizing the charge carrier transport. The structural modulations enhance the phonon scattering and lead to a significant reduction in lattice thermal conductivity of 0.60 W m−1K−1 at 867 K in the PbS-Cu2S system. Simultaneously, the Cu incorporation improves electrical conductivity by increasing both carrier concentration and mobility with carefully optimized the content of Cu2S molecular complexes. These synergistic modifications yield a peak figure-of-merit (zT) of 1.05 at 867 K for the PbS-1.0 %Cu2S sample, representing an almost twofold enhancement in TE performance compared to pristine PbS. This work highlights the effectiveness of surface treatment in overcoming the intrinsic limitations of PbS-based materials and presents a promising strategy for the development of high-efficiency TE systems. acknowledgement: 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). M.I. acknowledges financial support from ISTA and the Werner Siemens Foundation. K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant No. 22208293). M.H acknowledges funding from Australian Research Council (FT230100316 and IH200100035) and iLAuNCH, Trailblazer Universities Program. L. H. and S. W. acknowledge the Fundamental Research Funds for the Central Universities (JZ2023HGTA0179, JZ2024HGTA0170). article_processing_charge: No article_type: original author: - first_name: Haibo full_name: Shu, Haibo last_name: Shu - first_name: Mingjun full_name: Zhao, Mingjun last_name: Zhao - first_name: Shaoqing full_name: Lu, Shaoqing last_name: Lu - first_name: Shanhong full_name: Wan, Shanhong last_name: Wan - first_name: Aziz full_name: Genç, Aziz last_name: Genç - first_name: Lulu full_name: Huang, Lulu last_name: Huang - first_name: Maria full_name: Ibáñez, Maria id: 43C61214-F248-11E8-B48F-1D18A9856A87 last_name: Ibáñez orcid: 0000-0001-5013-2843 - first_name: Khak Ho full_name: Lim, Khak Ho last_name: Lim - first_name: Min full_name: Hong, Min last_name: Hong - first_name: Yu full_name: Liu, Yu id: 2A70014E-F248-11E8-B48F-1D18A9856A87 last_name: Liu orcid: 0000-0001-7313-6740 citation: ama: Shu H, Zhao M, Lu S, et al. Influence of surface engineering on the transport properties of lead sulfide nanomaterials. Journal of Colloid and Interface Science. 2025;683:703-712. doi:10.1016/j.jcis.2024.12.067 apa: Shu, H., Zhao, M., Lu, S., Wan, S., Genç, A., Huang, L., … Liu, Y. (2025). Influence of surface engineering on the transport properties of lead sulfide nanomaterials. Journal of Colloid and Interface Science. Elsevier. https://doi.org/10.1016/j.jcis.2024.12.067 chicago: Shu, Haibo, Mingjun Zhao, Shaoqing Lu, Shanhong Wan, Aziz Genç, Lulu Huang, Maria Ibáñez, Khak Ho Lim, Min Hong, and Yu Liu. “Influence of Surface Engineering on the Transport Properties of Lead Sulfide Nanomaterials.” Journal of Colloid and Interface Science. Elsevier, 2025. https://doi.org/10.1016/j.jcis.2024.12.067. ieee: H. Shu et al., “Influence of surface engineering on the transport properties of lead sulfide nanomaterials,” Journal of Colloid and Interface Science, vol. 683. Elsevier, pp. 703–712, 2025. ista: Shu H, Zhao M, Lu S, Wan S, Genç A, Huang L, Ibáñez M, Lim KH, Hong M, Liu Y. 2025. Influence of surface engineering on the transport properties of lead sulfide nanomaterials. Journal of Colloid and Interface Science. 683, 703–712. mla: Shu, Haibo, et al. “Influence of Surface Engineering on the Transport Properties of Lead Sulfide Nanomaterials.” Journal of Colloid and Interface Science, vol. 683, Elsevier, 2025, pp. 703–12, doi:10.1016/j.jcis.2024.12.067. short: H. Shu, M. Zhao, S. Lu, S. Wan, A. Genç, L. Huang, M. Ibáñez, K.H. Lim, M. Hong, Y. Liu, Journal of Colloid and Interface Science 683 (2025) 703–712. das_tickbox: '1' dataavailabilitystatement: Data will be made available on request. date_created: 2024-12-29T23:01:56Z date_published: 2025-04-01T00:00:00Z date_updated: 2026-10-16T09:22:32Z day: '01' department: - _id: MaIb doi: 10.1016/j.jcis.2024.12.067 external_id: isi: - '001393340800001' pmid: - '39706089' fulldoi: https://doi.org/10.1016/j.jcis.2024.12.067 intvolume: ' 683' isi: 1 language: - iso: eng month: '04' oa_version: None page: 703-712 pmid: 1 project: - _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery' publication: Journal of Colloid and Interface Science publication_identifier: eissn: - 1095-7103 issn: - 0021-9797 publication_status: published publisher: Elsevier quality_controlled: '1' researchdata_availability: upon request scopus_import: '1' status: public supplementarymaterial: yes title: Influence of surface engineering on the transport properties of lead sulfide nanomaterials type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 683 year: '2025' ... --- OA_type: closed access _id: '18558' abstract: - lang: eng text: The current investigation presents a facile and cost-effective sol-gel approach for the synthesis of phase-pure multiferroic bismuth ferrite (BiFeO3) nanoparticles (BFO NPs) by using propylene glycol as a complexing agent, intended for use as a photocatalyst to efficiently degrade organic dyes in aqueous solutions under natural sunlight. Characterization techniques, including thermogravimetric analysis (TGA), Fourier transform infrared spectroscopy (FT-IR), and X-ray diffraction (XRD), elucidated a plausible reaction pathway for the formation of phase-pure BFO NPs. Rietveld refinement of the XRD data, in conjunction with transmission electron microscopy (TEM) and Raman spectroscopy, confirmed the synthesis of single-phase BFO NPs at 400 °C, displaying a space group of R3c and an average crystallite size of 25 nm. UV–visible diffuse reflectance spectroscopy revealed an absorption cut-off wavelength near 590 nm, corresponding to a band gap of 2.08 eV, indicating the capability of BFO NPs to absorb visible light within the 400–590 nm range. BFO NPs have shown efficient and rapid photocatalytic degradation of methylene blue (MB) in acidic, neutral, and basic pH conditions under natural sunlight. This is attributed to the intrinsic ferroelectric and ferromagnetic ordering present in synthesized BFO NPs which facilitates the separation and migration of photoinduced charges through band bending phenomena at the interface. acknowledgement: "Simant Kumar Srivastav greatly acknowledges the University Grant Commission (UGC), New Delhi, India for providing BSR start-up grant to carry out this research work.\r\nThis research was supported by start-up grant of the University Grant Commission (UGC), New Delhi, India through project no F-30-500/2019 (BSR)." article_processing_charge: No article_type: original author: - first_name: Madhu full_name: Verma, Madhu last_name: Verma - first_name: Ajay full_name: Kumar, Ajay last_name: Kumar - first_name: Vijay Kumar full_name: Thakur, Vijay Kumar last_name: Thakur - first_name: Akanksha full_name: Maurya, Akanksha last_name: Maurya - first_name: Sachin full_name: Kumar, Sachin last_name: Kumar - first_name: Saurabh full_name: Singh, Saurabh id: 12d625da-9cb3-11ed-9667-af09d37d3f0a last_name: Singh orcid: 0000-0003-2209-5269 - first_name: Simant Kumar full_name: Srivastav, Simant Kumar last_name: Srivastav citation: ama: Verma M, Kumar A, Thakur VK, et al. Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. Journal of Sol-Gel Science and Technology. 2025;113:356-373. doi:10.1007/s10971-024-06607-2 apa: Verma, M., Kumar, A., Thakur, V. K., Maurya, A., Kumar, S., Singh, S., & Srivastav, S. K. (2025). Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. Journal of Sol-Gel Science and Technology. Springer Nature. https://doi.org/10.1007/s10971-024-06607-2 chicago: Verma, Madhu, Ajay Kumar, Vijay Kumar Thakur, Akanksha Maurya, Sachin Kumar, Saurabh Singh, and Simant Kumar Srivastav. “Efficient and Rapid Sunlight-Driven Photocatalytic Degradation of Methylene Blue Dye Using Multiferroic BiFeO3 Nanoparticles.” Journal of Sol-Gel Science and Technology. Springer Nature, 2025. https://doi.org/10.1007/s10971-024-06607-2. ieee: M. Verma et al., “Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles,” Journal of Sol-Gel Science and Technology, vol. 113. Springer Nature, pp. 356–373, 2025. ista: Verma M, Kumar A, Thakur VK, Maurya A, Kumar S, Singh S, Srivastav SK. 2025. Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles. Journal of Sol-Gel Science and Technology. 113, 356–373. mla: Verma, Madhu, et al. “Efficient and Rapid Sunlight-Driven Photocatalytic Degradation of Methylene Blue Dye Using Multiferroic BiFeO3 Nanoparticles.” Journal of Sol-Gel Science and Technology, vol. 113, Springer Nature, 2025, pp. 356–73, doi:10.1007/s10971-024-06607-2. short: M. Verma, A. Kumar, V.K. Thakur, A. Maurya, S. Kumar, S. Singh, S.K. Srivastav, Journal of Sol-Gel Science and Technology 113 (2025) 356–373. das_tickbox: '1' dataavailabilitystatement: No datasets were generated or analyzed during the current study. date_created: 2024-11-17T23:01:47Z date_published: 2025-02-01T00:00:00Z date_updated: 2026-10-16T09:21:57Z day: '01' department: - _id: MaIb doi: 10.1007/s10971-024-06607-2 external_id: isi: - '001348590700001' fulldoi: https://doi.org/10.1007/s10971-024-06607-2 intvolume: ' 113' isi: 1 language: - iso: eng month: '02' oa_version: None page: 356-373 publication: Journal of Sol-Gel Science and Technology publication_identifier: eissn: - 1573-4846 issn: - 0928-0707 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: not applicable scopus_import: '1' status: public supplementarymaterial: yes title: Efficient and rapid sunlight-driven photocatalytic degradation of methylene blue dye using multiferroic BiFeO3 nanoparticles type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 113 year: '2025' ... --- OA_type: closed access _id: '18701' abstract: - lang: eng text: We developed in-situ engineered polycrystalline polythiophene (PTh) and its composite with reduced graphene oxide (PTh-rGO) via a simple chemical synthesis. The PTh-rGO-based electrodes in a symmetrical device with xanthan gum in 1 M aq. Na2SO4 as an electrolyte, delivers a specific capacitance (Csp) of 114.7 F g–1 (electrode) and 28.7 F g–1 (cell) at an applied current density of 0.2 A g−1. The maximum energy and power densities recorded from the device were 588.0 mWh kg−1 and 1.1 kW kg−1 at 1.5 A g−1. The device exhibited a remarkable retention of Csp of 98.9 % over 10,000 continuous galvanostatic charge–discharge cycles highlighting an excellent performance. Electrochemical impedance spectroscopy analysis emphasizes material’s excellent structural integrity. This is attributed to the crystalline phases present in the matrix. acknowledgement: This work was partly supported by the Institute of Information & Communications Technology Planning & Evaluation (IITP) grant funded by the Korea government (MSIT) (No.RS-2021-II210077) and Korea Institute of Energy Technology Evaluation and Planning (KETEP) grant funded by the Korea government (MOTIE)(RS-2024-00398346, ESS BigData-Based O&M and Asset Management Technical Manpower Training). article_number: '137869' article_processing_charge: No article_type: original author: - first_name: Neelima full_name: Mahato, Neelima last_name: Mahato - first_name: Saurabh full_name: Singh, Saurabh id: 12d625da-9cb3-11ed-9667-af09d37d3f0a last_name: Singh orcid: 0000-0003-2209-5269 - first_name: T. V.M. full_name: Sreekanth, T. V.M. last_name: Sreekanth - first_name: Kisoo full_name: Yoo, Kisoo last_name: Yoo - first_name: Jonghoon full_name: Kim, Jonghoon last_name: Kim citation: ama: 'Mahato N, Singh S, Sreekanth TVM, Yoo K, Kim J. In-situ engineered highly-crystalline Polythiophene empowered electrochemical capacitor-II: Anomalous electrochemical charge storage behavior of Polythiophene-rGO composite. Materials Letters. 2025;382. doi:10.1016/j.matlet.2024.137869' apa: 'Mahato, N., Singh, S., Sreekanth, T. V. M., Yoo, K., & Kim, J. (2025). In-situ engineered highly-crystalline Polythiophene empowered electrochemical capacitor-II: Anomalous electrochemical charge storage behavior of Polythiophene-rGO composite. Materials Letters. Elsevier. https://doi.org/10.1016/j.matlet.2024.137869' chicago: 'Mahato, Neelima, Saurabh Singh, T. V.M. Sreekanth, Kisoo Yoo, and Jonghoon Kim. “In-Situ Engineered Highly-Crystalline Polythiophene Empowered Electrochemical Capacitor-II: Anomalous Electrochemical Charge Storage Behavior of Polythiophene-RGO Composite.” Materials Letters. Elsevier, 2025. https://doi.org/10.1016/j.matlet.2024.137869.' ieee: 'N. Mahato, S. Singh, T. V. M. Sreekanth, K. Yoo, and J. Kim, “In-situ engineered highly-crystalline Polythiophene empowered electrochemical capacitor-II: Anomalous electrochemical charge storage behavior of Polythiophene-rGO composite,” Materials Letters, vol. 382. Elsevier, 2025.' ista: 'Mahato N, Singh S, Sreekanth TVM, Yoo K, Kim J. 2025. In-situ engineered highly-crystalline Polythiophene empowered electrochemical capacitor-II: Anomalous electrochemical charge storage behavior of Polythiophene-rGO composite. Materials Letters. 382, 137869.' mla: 'Mahato, Neelima, et al. “In-Situ Engineered Highly-Crystalline Polythiophene Empowered Electrochemical Capacitor-II: Anomalous Electrochemical Charge Storage Behavior of Polythiophene-RGO Composite.” Materials Letters, vol. 382, 137869, Elsevier, 2025, doi:10.1016/j.matlet.2024.137869.' short: N. Mahato, S. Singh, T.V.M. Sreekanth, K. Yoo, J. Kim, Materials Letters 382 (2025). das_tickbox: '1' dataavailabilitystatement: Data will be made available on request. date_created: 2024-12-22T23:01:47Z date_published: 2025-03-01T00:00:00Z date_updated: 2026-10-16T10:00:45Z day: '01' department: - _id: MaIb doi: 10.1016/j.matlet.2024.137869 external_id: isi: - '001433664000001' fulldoi: https://doi.org/10.1016/j.matlet.2024.137869 intvolume: ' 382' isi: 1 language: - iso: eng month: '03' oa_version: None publication: Materials Letters publication_identifier: eissn: - 1873-4979 issn: - 0167-577X publication_status: published publisher: Elsevier quality_controlled: '1' researchdata_availability: upon request scopus_import: '1' status: public supplementarymaterial: yes title: 'In-situ engineered highly-crystalline Polythiophene empowered electrochemical capacitor-II: Anomalous electrochemical charge storage behavior of Polythiophene-rGO composite' type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 382 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '18753' abstract: - lang: eng text: "We continue a line of research which studies which hereditary families of digraphs have bounded dichromatic number. For a class of digraphs C, a hero in \ C is any digraph H\r\n such that H -free digraphs in C have bounded dichromatic number. We show that if F\r\n is an oriented star of degree at least five, the only heroes for the class of F -free digraphs are transitive tournaments. For oriented stars F of degree exactly four, we show the only heroes in F -free digraphs are transitive tournaments, or possibly special joins of transitive tournaments. Aboulker et al. characterized the set of heroes of {H,K1+P2→} -free digraphs almost completely, and we show the same characterization for the class of {H,rK1+P3→} -free digraphs. Lastly, we show that if we forbid two \"valid\" orientations of brooms, then every transitive tournament is a hero for this class of digraphs." acknowledgement: "We thank the anonymous referees for their careful proofreading which helped improve the presentation of this paper. We also thank one of the anonymous referees for pointing out our construction implies Theorem 1.7!\r\nBenjamin Moore finished this project while a postdoctoral researcher at Charles University, and was supported by project 22-17398S (Flows and cycles in graphs on surfaces) of the Czech Science Foundation. Benjamin Moore is currently funded by RANDSTRUCT No. 101076777, and appreciates the gracious support. We acknowledge the support of the Natural Sciences and Engineering Research Council of Canada (NSERC), [funding reference number RGPIN-2020-03912]. Cette recherche a été financée par le Conseil de recherches en sciences naturelles et en génie du Canada (CRSNG), [numéro de référence RGPIN-2020-03912]. This project was funded in part by the Government of Ontario ." article_number: '104104' article_processing_charge: Yes (in subscription journal) article_type: original arxiv: 1 author: - first_name: Alvaro full_name: Carbonero, Alvaro last_name: Carbonero - first_name: Hidde full_name: Koerts, Hidde last_name: Koerts - first_name: Benjamin full_name: Moore, Benjamin id: 6dc1a1be-bf1c-11ed-8d2b-d044840f49d6 last_name: Moore - first_name: Sophie full_name: Spirkl, Sophie last_name: Spirkl citation: ama: Carbonero A, Koerts H, Moore B, Spirkl S. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 2025;125. doi:10.1016/j.ejc.2024.104104 apa: Carbonero, A., Koerts, H., Moore, B., & Spirkl, S. (2025). On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2024.104104 chicago: Carbonero, Alvaro, Hidde Koerts, Benjamin Moore, and Sophie Spirkl. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics. Elsevier, 2025. https://doi.org/10.1016/j.ejc.2024.104104. ieee: A. Carbonero, H. Koerts, B. Moore, and S. Spirkl, “On heroes in digraphs with forbidden induced forests,” European Journal of Combinatorics, vol. 125. Elsevier, 2025. ista: Carbonero A, Koerts H, Moore B, Spirkl S. 2025. On heroes in digraphs with forbidden induced forests. European Journal of Combinatorics. 125, 104104. mla: Carbonero, Alvaro, et al. “On Heroes in Digraphs with Forbidden Induced Forests.” European Journal of Combinatorics, vol. 125, 104104, Elsevier, 2025, doi:10.1016/j.ejc.2024.104104. short: A. Carbonero, H. Koerts, B. Moore, S. Spirkl, European Journal of Combinatorics 125 (2025). corr_author: '1' das_tickbox: '0' date_created: 2025-01-05T23:01:55Z date_published: 2025-03-01T00:00:00Z date_updated: 2026-10-16T10:13:50Z day: '01' ddc: - '510' department: - _id: MaKw doi: 10.1016/j.ejc.2024.104104 external_id: arxiv: - '2306.04710' isi: - '001400113700001' file: - access_level: open_access checksum: 2c75f78f40ebb93d16fe3765bda2905a content_type: application/pdf creator: dernst date_created: 2025-04-16T09:16:25Z date_updated: 2025-04-16T09:16:25Z file_id: '19577' file_name: 2025_EuropJournCombinatorics_Carbonero.pdf file_size: 1110657 relation: main_file success: 1 file_date_updated: 2025-04-16T09:16:25Z fulldoi: https://doi.org/10.1016/j.ejc.2024.104104 has_accepted_license: '1' intvolume: ' 125' isi: 1 language: - iso: eng month: '03' oa: 1 oa_version: Published Version project: - _id: bd95085b-d553-11ed-ba76-e55d3349be45 grant_number: '101076777' name: Randomness and structure in combinatorics publication: European Journal of Combinatorics publication_identifier: issn: - 0195-6698 publication_status: published publisher: Elsevier quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: On heroes in digraphs with forbidden induced forests tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345 volume: 125 year: '2025' ... --- OA_place: publisher OA_type: hybrid _id: '19603' abstract: - lang: eng text: "MaxCut is a classical NP-complete problem and a crucial building block in many\r\ncombinatorial algorithms. The famousEdwards-Erdös bound states that any connected\r\ngraph on n vertices with m edges contains a cut of size at least m/2 + n−1/4 . Crowston,\r\nJones and Mnich [Algorithmica, 2015] showed that the MaxCut problem on simple\r\nconnected graphs admits an FPT algorithm, where the parameter k is the difference\r\nbetween the desired cut size c and the lower bound given by the Edwards-Erdös\r\nbound. This was later improved by Etscheid and Mnich [Algorithmica, 2017] to run\r\nin parameterized linear time, i.e., f (k) · O(m). We improve upon this result in two\r\nways: Firstly, we extend the algorithm to work also for multigraphs (alternatively,\r\ngraphs with positive integer weights). Secondly, we change the parameter; instead of\r\nthe difference to the Edwards-Erdös bound, we use the difference to the Poljak-Turzík\r\nbound. The Poljak-Turzík bound states that any weighted graph G has a cut of weight\r\nat least w(G)/2 + wMSF (G)/4 , where w(G) denotes the total weight of G, and wMSF (G)\r\ndenotes the weight of its minimum spanning forest. In connected simple graphs the\r\ntwo bounds are equivalent, but for multigraphs the Poljak-Turzík bound can be larger\r\nand thus yield a smaller parameter k. Our algorithm also runs in parameterized linear\r\ntime, i.e., f (k) · O(m + n)." acknowledgement: "Kalina Petrova is supported by the Swiss National Science Foundation, grant no. CRSII5 173721, and also receives funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. Simon Weber is supported by the Swiss National Science Foundation under project no. 204320.\r\nOpen access funding provided by Swiss Federal Institute of Technology Zurich." article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Jonas full_name: Lill, Jonas last_name: Lill - first_name: Kalina H full_name: Petrova, Kalina H id: 554ff4e4-f325-11ee-b0c4-a10dbd523381 last_name: Petrova - first_name: Simon full_name: Weber, Simon last_name: Weber citation: ama: Lill J, Petrova KH, Weber S. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 2025;87:983-1007. doi:10.1007/s00453-025-01306-y apa: Lill, J., Petrova, K. H., & Weber, S. (2025). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. Springer Nature. https://doi.org/10.1007/s00453-025-01306-y chicago: Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica. Springer Nature, 2025. https://doi.org/10.1007/s00453-025-01306-y. ieee: J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” Algorithmica, vol. 87. Springer Nature, pp. 983–1007, 2025. ista: Lill J, Petrova KH, Weber S. 2025. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. Algorithmica. 87, 983–1007. mla: Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” Algorithmica, vol. 87, Springer Nature, 2025, pp. 983–1007, doi:10.1007/s00453-025-01306-y. short: J. Lill, K.H. Petrova, S. Weber, Algorithmica 87 (2025) 983–1007. date_created: 2025-04-20T22:01:28Z date_published: 2025-07-01T00:00:00Z date_updated: 2026-10-16T10:13:33Z day: '01' ddc: - '510' department: - _id: MaKw doi: 10.1007/s00453-025-01306-y ec_funded: 1 external_id: isi: - '001463103800001' file: - access_level: open_access checksum: eab3f1834b0ba347b05ae9897729c0ad content_type: application/pdf creator: dernst date_created: 2026-01-05T13:45:57Z date_updated: 2026-01-05T13:45:57Z file_id: '20957' file_name: 2025_Algorithmica_Lill.pdf file_size: 448554 relation: main_file success: 1 file_date_updated: 2026-01-05T13:45:57Z fulldoi: https://doi.org/10.1007/s00453-025-01306-y has_accepted_license: '1' intvolume: ' 87' isi: 1 language: - iso: eng month: '07' oa: 1 oa_version: Published Version page: 983-1007 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Algorithmica publication_identifier: eissn: - 1432-0541 issn: - 0178-4617 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '18758' relation: earlier_version status: public scopus_import: '1' status: public title: Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 87 year: '2025' ...