[{"day":"15","citation":{"ista":"Prach B, Lampert C. 2025. Intriguing properties of robust classification. 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops. CVPR: Conference on Computer Vision and Pattern Recognition, 660–669.","short":"B. Prach, C. Lampert, in:, 2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops, IEEE, 2025, pp. 660–669.","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, 660–69. IEEE, 2025. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>.","mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, IEEE, 2025, pp. 660–69, doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>.","apa":"Prach, B., &#38; Lampert, C. (2025). Intriguing properties of robust classification. In <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i> (pp. 660–669). Nashville, TN, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">https://doi.org/10.1109/CVPRW67362.2025.00071</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” in <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>, Nashville, TN, United States, 2025, pp. 660–669.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. In: <i>2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops</i>. IEEE; 2025:660-669. doi:<a href=\"https://doi.org/10.1109/CVPRW67362.2025.00071\">10.1109/CVPRW67362.2025.00071</a>"},"quality_controlled":"1","publication":"2025 IEEE/CVF Conference on Computer Vision and Pattern Recognition Workshops","_id":"20455","publication_status":"published","title":"Intriguing properties of robust classification","status":"public","corr_author":"1","year":"2025","abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial examples 10 years ago, we still do not know how to train high-accuracy classifiers that are guaranteed to be robust to small perturbations of their inputs. Previous works often argued that this might be because no classifier exists that is robust and accurate at the same time. However, in computer vision this assumption does not match reality where humans are usually accurate and robust on most tasks of interest. We offer an alternative explanation and show that in certain settings robust generalization is only possible with unrealistically large amounts of data. Specifically, we find a setting where a robust classifier exists, it is easy to learn an accurate classifier, yet it requires an exponential amount of data to learn a robust classifier. Based on this theoretical result, we evaluate the influence of the amount of training data on datasets such as CIFAR10. Our findings indicate that the the amount of training data is the main factor determining the robust performance. Furthermore we show that that there are low magnitude directions in the data which are useful for non-robust generalization but are not available for robust classifiers. This implies that robust classification is a strictly harder tasks than normal classification, thereby providing an explanation why robust classification requires more data."}],"conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2025-06-12","start_date":"2025-06-11","location":"Nashville, TN, United States"},"OA_place":"repository","page":"660-669","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2412.04245"}],"type":"conference","month":"06","arxiv":1,"date_published":"2025-06-15T00:00:00Z","doi":"10.1109/CVPRW67362.2025.00071","publication_identifier":{"isbn":["9798331599942"],"issn":["2160-7508"],"eissn":["2160-7516"]},"external_id":{"arxiv":["2412.04245"]},"publisher":"IEEE","oa_version":"Preprint","date_created":"2025-10-12T22:01:26Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-02T11:15:42Z","related_material":{"record":[{"relation":"earlier_version","id":"18874","status":"public"}]},"fulldoi":"https://doi.org/10.1109/CVPRW67362.2025.00071","language":[{"iso":"eng"}],"department":[{"_id":"ChLa"}],"OA_type":"green","article_processing_charge":"No","author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd","last_name":"Prach"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"oa":1,"scopus_import":"1"},{"citation":{"apa":"Synak, P. (2025). <i>Methods for fluid simulation, surface tracking, and statistics of non-manifold structures</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>","ama":"Synak P. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>","ieee":"P. Synak, “Methods for fluid simulation, surface tracking, and statistics of non-manifold structures,” Institute of Science and Technology Austria, 2025.","short":"P. Synak, Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures, Institute of Science and Technology Austria, 2025.","ista":"Synak P. 2025. Methods for fluid simulation, surface tracking, and statistics of non-manifold structures. Institute of Science and Technology Austria.","mla":"Synak, Peter. <i>Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19630\">10.15479/AT-ISTA-19630</a>.","chicago":"Synak, Peter. “Methods for Fluid Simulation, Surface Tracking, and Statistics of Non-Manifold Structures.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19630\">https://doi.org/10.15479/AT-ISTA-19630</a>."},"alternative_title":["ISTA Thesis"],"day":"29","_id":"19630","file":[{"file_size":60670543,"date_updated":"2025-04-30T14:02:25Z","content_type":"application/x-zip-compressed","creator":"cchlebak","access_level":"closed","date_created":"2025-04-30T14:02:25Z","relation":"source_file","checksum":"f00b519c27529daa0c3b2d4102b4fa7b","file_name":"Thesis_source_Heiss_Synak.zip","file_id":"19633"},{"content_type":"application/pdf","creator":"cchlebak","date_created":"2025-04-30T14:02:42Z","access_level":"open_access","date_updated":"2025-04-30T15:49:16Z","file_size":21319043,"file_name":"Thesis_PDFA_Heiss_Synak.pdf","file_id":"19634","checksum":"6e40a2fd3b1b881af1385670854a682e","relation":"main_file"}],"publication_status":"published","has_accepted_license":"1","status":"public","title":"Methods for fluid simulation, surface tracking, and statistics of non-manifold structures","corr_author":"1","year":"2025","abstract":[{"text":"This thesis consists of three chapters, each corresponding to one publication. While each of these projects tackles a topic in a different area of research, they all share a common thread in the type of topological structure they handle - a partition of space into volumes separated by interfaces that meet in non-manifold junctions.\r\n\r\nIn Chapter 2, we study clusters of soap bubbles from a simulation perspective. In particular, we develop a surface-only algorithm that couples large scale motion and shape deformation of soap bubble clusters with the small scale evolution of the thin film's thickness, which is responsible for visual phenomena like surface vortices, Newton's interference patterns, capillary waves, and deformation-dependent rupturing of films in a foam. We model film thickness as a reduced degree of freedom in the Navier-Stokes equations and from them derive three sets of equations governing normal and tangential motion of the soap film surface, as well as the evolution of the thin film thickness. We discretize these equations on a non-manifold triangle mesh, extending and adapting operators to handle complex topology. We also present an incompressible fluid solver for 2.5D films and an advection algorithm for convecting fields across non-manifold surface junctions. Our simulations enhance bubble solvers with additional effects caused by convection, rippling, draining, and evaporation of the thin film.\r\n\r\nIn Chapter 3, we introduce a multi-material non-manifold mesh-based surface tracking algorithm that converts mesh defects, such as overlaps, self-intersections, and inversions into topological changes. Our algorithm generalizes prior work on manifold surface tracking with topological changes: it preserves surface features like mesh-based methods, and it robustly handles topological changes like level set methods. Our method also offers improved efficiency and robustness over the state of the art. We demonstrate the effectiveness of the approach on a range of examples, including complex soap film simulations, such as those presented in Chapter 2, but with an order of magnitude more interacting bubbles than what we could achieve before, and Boolean unions of non-manifold meshes consisting of millions of triangles.\r\n\r\nLastly, in Chapter 4, we utilize developments in the theory of random geometric complexes facilitated by observations from Discrete Morse theory. We survey the methods and results obtained with this new approach, and discuss some of its shortcomings. We use simulations to illustrate the results and to form conjectures, getting numerical estimates for combinatorial, topological, and geometric properties of weighted and unweighted Delaunay mosaics, their dual Voronoi tessellations, and the Alpha and Wrap complexes contained in the mosaics.","lang":"eng"}],"acknowledgement":"The project in Chapter 2 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme under grant agreement No. 638176. The project in Chapter 3 was funded in part by the European Union (ERC-2021-COG 101045083 CoDiNA). The project in Chapter 4 has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation programme (grant agreements No 78818 Alpha and No 638176). It was also partially supported by the DFG Collaborative Research Center TRR 109, 'Discretization in Geometry and Dynamics', through grant no. I02979-N35 of the Austrian Science Fund (FWF). Thank you for providing funds to support my work.","OA_place":"publisher","ec_funded":1,"page":"106","type":"dissertation","month":"04","doi":"10.15479/AT-ISTA-19630","date_published":"2025-04-29T00:00:00Z","publication_identifier":{"issn":["2663-337X"]},"ddc":["519","006"],"file_date_updated":"2025-04-30T15:49:16Z","publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","date_created":"2025-04-29T09:39:34Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","date_updated":"2026-10-02T11:19:03Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"8135"},{"relation":"part_of_dissertation","id":"8384","status":"public"},{"status":"public","id":"17219","relation":"part_of_dissertation"}]},"project":[{"grant_number":"638176","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","_id":"2533E772-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"},{"grant_number":"788183","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended"},{"call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-19630","language":[{"iso":"eng"}],"article_processing_charge":"No","department":[{"_id":"ChWo"},{"_id":"GradSch"}],"author":[{"last_name":"Synak","full_name":"Synak, Peter","id":"331776E2-F248-11E8-B48F-1D18A9856A87","first_name":"Peter"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"supervisor":[{"full_name":"Wojtan, Christopher J","last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}]},{"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-070-1"]},"date_published":"2025-10-31T00:00:00Z","doi":"10.15479/AT-ISTA-20551","month":"10","page":"141","ec_funded":1,"type":"dissertation","OA_place":"publisher","acknowledgement":"Projects contained in this thesis were financially supported in part by the\r\nEuropean Research Council with grants 1. ERC Consolidator Grant 101045083 CoDiNA,\r\nand 2. the European Union’s Horizon 2020 research and innovation programme under grant\r\nagreement No. 638176.","corr_author":"1","title":"Symplectic-prequantum structures and dynamics on the codimension-2 shape space","status":"public","year":"2025","abstract":[{"text":"The space of codimension-2 shapes, such as curves in 3D and surfaces in 4D, is an infinite-dimensional manifold. This thesis explores geometric structures and dynamics on this space, with emphasis on their implications for physics, particularly hydrodynamics.\r\n\r\nOur investigation ranges from theoretical studies of infinite-dimensional symplectic and prequantum geometry to numerical computation of the time evolution of shapes. The thesis presents four main contributions.\r\n\r\nIn the first part, we introduce implicit representations of codimension-2 shapes using a class of complex-valued functions, and prove that the space of these implicit representations forms a prequantum bundle over the codimension-2 shape space. This reveals a new geometric interpretation of the canonical symplectic structure on the codimension-2 shape space.\r\n\r\nIn the second part, we use implicit representations to develop a simulation method for the dynamics of space curves. To handle chaotic systems such as vortex filaments in hydrodynamics, we exploit the infinite degrees of freedom, hidden in both the configuration and dynamics of implicit representations.\r\n\r\nIn the third part, we introduce new symplectic structures on the space of space curves, which generalize the only previously known symplectic structure on this space, allowing for new Hamiltonian dynamics of space curves.\r\n\r\nIn the fourth part, we apply a symplectic viewpoint to a differential geometric problem with practical applications. We derive a new area formula for spherical polygons via prequantization. ","lang":"eng"}],"file":[{"file_id":"20583","file_name":"Thesis_tex.zip","relation":"source_file","checksum":"4eef80afcb67691cbb6549c4756fa534","access_level":"open_access","date_created":"2025-11-01T18:26:14Z","creator":"sishida","content_type":"application/zip","file_size":72487812,"date_updated":"2025-11-01T18:26:14Z"},{"success":1,"file_id":"20623","file_name":"Thesis_Sadashige_Ishida_PDFA.pdf","relation":"main_file","checksum":"1e5a557900bf2dce01966b211b15d0fe","access_level":"open_access","date_created":"2025-11-10T08:45:05Z","creator":"sishida","content_type":"application/pdf","file_size":8945141,"date_updated":"2025-11-10T08:45:05Z"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","publication_status":"published","citation":{"apa":"Ishida, S. (2025). <i>Symplectic-prequantum structures and dynamics on the codimension-2 shape space</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>","ama":"Ishida S. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>","ieee":"S. Ishida, “Symplectic-prequantum structures and dynamics on the codimension-2 shape space,” Institute of Science and Technology Austria, 2025.","short":"S. Ishida, Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space, Institute of Science and Technology Austria, 2025.","ista":"Ishida S. 2025. Symplectic-prequantum structures and dynamics on the codimension-2 shape space. Institute of Science and Technology Austria.","chicago":"Ishida, Sadashige. “Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20551\">https://doi.org/10.15479/AT-ISTA-20551</a>.","mla":"Ishida, Sadashige. <i>Symplectic-Prequantum Structures and Dynamics on the Codimension-2 Shape Space</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20551\">10.15479/AT-ISTA-20551</a>."},"day":"31","alternative_title":["ISTA Thesis"],"_id":"20551","supervisor":[{"first_name":"Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6646-5546","full_name":"Wojtan, Christopher J","last_name":"Wojtan"},{"full_name":"Chern, Albert","last_name":"Chern","first_name":"Albert"}],"acknowledged_ssus":[{"_id":"CampIT"}],"department":[{"_id":"GradSch"},{"_id":"ChWo"}],"author":[{"id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige","orcid":"0000-0002-3121-3100","last_name":"Ishida","full_name":"Ishida, Sadashige"}],"article_processing_charge":"No","oa":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-20551","project":[{"grant_number":"638176","call_identifier":"H2020","_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales"},{"name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","grant_number":"101045083"}],"date_updated":"2026-10-02T11:17:04Z","related_material":{"record":[{"status":"public","id":"12431","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"20580","status":"public"},{"id":"17361","relation":"part_of_dissertation","status":"public"},{"status":"public","id":"12846","relation":"part_of_dissertation"}]},"date_created":"2025-10-27T10:28:52Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","file_date_updated":"2025-11-10T08:45:05Z","ddc":["516"]},{"fulldoi":"https://doi.org/10.15479/AT-ISTA-20234","project":[{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"name":"Bilateral Artificial Intelligence (Chatterjee)","_id":"4029cfc7-b034-11f1-9e55-88ab2ff3b6ee","grant_number":"COE12"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","author":[{"orcid":"0000-0001-5103-038X","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J"}],"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"oa":1,"supervisor":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"}],"ddc":["519"],"file_date_updated":"2025-08-28T14:47:12Z","publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","date_created":"2025-08-27T14:00:13Z","degree_awarded":"PhD","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-02T11:30:08Z","related_material":{"record":[{"status":"public","id":"9311","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","id":"19508","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"17037"},{"status":"public","id":"18266","relation":"part_of_dissertation"}]},"ec_funded":1,"page":"125","type":"dissertation","month":"08","doi_confirm":"1","date_published":"2025-08-27T00:00:00Z","doi":"10.15479/AT-ISTA-20234","publication_identifier":{"issn":["2663-337X"]},"day":"27","alternative_title":["ISTA Thesis"],"citation":{"mla":"Saona Urmeneta, Raimundo J. <i>Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>.","chicago":"Saona Urmeneta, Raimundo J. “Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>.","ista":"Saona Urmeneta RJ. 2025. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. Institute of Science and Technology Austria.","short":"R.J. Saona Urmeneta, Robustness of Solutions in Game Theory: Values and Strategies in Partially Observable, Perturbed, Stochastic, and Infinite Games, Institute of Science and Technology Austria, 2025.","ama":"Saona Urmeneta RJ. Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20234\">10.15479/AT-ISTA-20234</a>","ieee":"R. J. Saona Urmeneta, “Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games,” Institute of Science and Technology Austria, 2025.","apa":"Saona Urmeneta, R. J. (2025). <i>Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20234\">https://doi.org/10.15479/AT-ISTA-20234</a>"},"_id":"20234","file":[{"date_created":"2025-08-28T14:47:07Z","access_level":"open_access","content_type":"application/pdf","creator":"rsaonaur","date_updated":"2025-08-28T14:47:07Z","file_size":1503623,"file_id":"20240","success":1,"file_name":"2025_Saona_Raimundo_Thesis.pdf","checksum":"394a651f7de7085e509ef856ffe7bd97","relation":"main_file"},{"file_name":"2025_Saona_Raimundo_Thesis.zip","file_id":"20241","relation":"source_file","checksum":"09fb2633e66aac80433d373f4180c5b4","creator":"rsaonaur","content_type":"application/zip","access_level":"closed","date_created":"2025-08-28T14:47:12Z","file_size":622747,"date_updated":"2025-08-28T14:47:12Z"}],"has_accepted_license":"1","publication_status":"published","status":"public","title":"Robustness of solutions in game theory: Values and strategies in partially observable, perturbed, stochastic, and infinite games","corr_author":"1","abstract":[{"text":"Game Theory is the mathematical formalization of social dynamics - systems where agents interact over time and the evolution of the state of the system depends on the decisions of every player. \r\nThis thesis takes the perspective of a single player and focuses on what they can guarantee in the worst case over the behavior of other players.\r\nIn other words, we consider that the objective of every other player in the game is exactly the opposite to the player.\r\nWe focus on sustained interactions over time, where the players repeatedly obtain quantitative rewards over time, and they are interested in maximizing their long-term performance.\t\r\nFormally, this thesis focuses on zero-sum games with the liminf average objective.\r\nTwo fundamental questions that Game Theory aims to answer are the following.\r\n\r\n1. How much can a player guarantee to obtain after the interaction?\r\n\r\n2. How to act in order to obtain the previously mentioned guarantee?\r\n\r\nThese questions are formalized by the concepts of \"value\" and \"optimal strategies\". \t\r\nWe study their properties on games that exhibit one or more of the following properties. \r\n\r\n1. Partial Observation: \r\nthe players can not perfectly observe the current state of the system during the game. We consider the model of (finite) Partially Observable Markov Decision Processes and prove that finite-memory strategies are sufficient to approximately guarantee the value.\r\n\r\n2. Perturbed Description: \r\nthe formal description of the game is perturbed by a small parameter.\r\nWe consider the model of (finite) Perturbed Matrix Games, and provide algorithms to check various robustness properties and to compute the parameterized value and optimal strategies.\r\n\r\n3. Stochastic Transitions: \r\nthe actions of the players determine the behavior of the evolution of the system, described as a probability distribution over the next state.\r\nWe consider the model of (finite) Perturbed Stochastic Games and provide formulas for the marginal value.\r\n\r\n4. Infinite States: \r\nthe system can be in infinitely many states.\r\nWe consider the model of Random Dynamic Games on a class of infinite graphs, prove the existence of the value, and quantify the concentration of finite-horizon values.","lang":"eng"}],"year":"2025","OA_place":"publisher","acknowledgement":"Funding sources The works included in this thesis were partially supported by:\r\n• Austrian Science Fund (FWF), grants 10.55776/COE12 and No RiSE/SHiNE S11407,\r\n• French Agence Nationale de la Recherche (ANR), grants ANR-21-CE40-0020 (CONVERGENCE) and ANR-20-CE40-0002 (GrHyDy),\r\n• Fondation Mathématique Jaques Hadamard, grant PGMO RSG 2018-0031H,\r\n• European Research Council (ERC), Consolidator grant 863818 (ForM-SMArt),\r\n• Agencia Nacional de Investigación y Desarrollo (ANID Chile), grant ACT210005,\r\n• Fondo Nacional de Desarrollo Científico y Tecnológico (Fondecyt Chile), grant 1220174,\r\n• Comisión Nacional de Investigación Científica y Tecnológica (CONICYT Chile), grant\r\nPII 20150140,\r\n• Evaluation-orientation de la Coopération Scientifique and Comisión Nacional de Investigación Científica y Tecnológica (ECOS-CONICYT), grant C15E03,\r\n• European Cooperation in Science and Technology (E-COST), grants CA16228 - European\r\nNetwork for Game Theory (GAMENET) and E-COST-GRANT-CA16228-c5a69859.\r\n"},{"date_created":"2024-05-22T11:41:14Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_updated":"2026-10-02T11:29:44Z","related_material":{"record":[{"relation":"dissertation_contains","id":"20234","status":"public"}]},"volume":50,"publisher":"Institute for Operations Research and the Management Sciences","oa_version":"None","article_type":"original","OA_type":"closed access","author":[{"last_name":"Attia","full_name":"Attia, Luc","first_name":"Luc"},{"first_name":"Miquel","full_name":"Oliu-Barton, Miquel","last_name":"Oliu-Barton"},{"orcid":"0000-0001-5103-038X","first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","full_name":"Saona Urmeneta, Raimundo J","last_name":"Saona Urmeneta"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"scopus_import":"1","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"fulldoi":"https://doi.org/10.1287/moor.2023.0297","issue":"1","intvolume":"        50","language":[{"iso":"eng"}],"status":"public","title":"Marginal values of a stochastic game","abstract":[{"text":"Zero-sum stochastic games are parameterized by payoffs, transitions, and possibly a discount rate. In this article, we study how the main solution concepts, the discounted and undiscounted values, vary when these parameters are perturbed. We focus on the marginal values, introduced by Mills in 1956 in the context of matrix games—that is, the directional derivatives of the value along any fixed perturbation. We provide a formula for the marginal values of a discounted stochastic game. Further, under mild assumptions on the perturbation, we provide a formula for their limit as the discount rate vanishes and for the marginal values of an undiscounted stochastic game. We also show, via an example, that the two latter differ in general.","lang":"eng"}],"year":"2025","supplementarymaterial":"unclear","acknowledgement":"This work was supported by Fondation CFM pour la Recherche; the European Research Council [Grant ERC-CoG-863818 (ForM-SMArt)]; and Agence Nationale de la Recherche [Grant ANR-21-CE40-0020].","day":"01","citation":{"mla":"Attia, Luc, et al. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>, vol. 50, no. 1, Institute for Operations Research and the Management Sciences, 2025, pp. 482–505, doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>.","chicago":"Attia, Luc, Miquel Oliu-Barton, and Raimundo J Saona Urmeneta. “Marginal Values of a Stochastic Game.” <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences, 2025. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>.","ista":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. 2025. Marginal values of a stochastic game. Mathematics of Operations Research. 50(1), 482–505.","short":"L. Attia, M. Oliu-Barton, R.J. Saona Urmeneta, Mathematics of Operations Research 50 (2025) 482–505.","ama":"Attia L, Oliu-Barton M, Saona Urmeneta RJ. Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. 2025;50(1):482-505. doi:<a href=\"https://doi.org/10.1287/moor.2023.0297\">10.1287/moor.2023.0297</a>","ieee":"L. Attia, M. Oliu-Barton, and R. J. Saona Urmeneta, “Marginal values of a stochastic game,” <i>Mathematics of Operations Research</i>, vol. 50, no. 1. Institute for Operations Research and the Management Sciences, pp. 482–505, 2025.","apa":"Attia, L., Oliu-Barton, M., &#38; Saona Urmeneta, R. J. (2025). Marginal values of a stochastic game. <i>Mathematics of Operations Research</i>. Institute for Operations Research and the Management Sciences. <a href=\"https://doi.org/10.1287/moor.2023.0297\">https://doi.org/10.1287/moor.2023.0297</a>"},"das_tickbox":"0","quality_controlled":"1","publication":"Mathematics of Operations Research","_id":"17037","publication_status":"published","doi":"10.1287/moor.2023.0297","date_published":"2025-02-01T00:00:00Z","researchdata_availability":"unclear","publication_identifier":{"eissn":["1526-5471"],"issn":["0364-765X"]},"external_id":{"isi":["001184648000001"]},"ec_funded":1,"page":"482-505","type":"journal_article","isi":1,"month":"02"},{"publication_identifier":{"issn":["2663-337X"]},"date_published":"2025-02-18T00:00:00Z","doi":"10.15479/at:ista:19048","month":"02","type":"dissertation","ec_funded":1,"page":"86","OA_place":"publisher","acknowledgement":"I am grateful to the European Research Council (ERC) [10.3030/801770] and Austrian\r\nScience Fund (FWF) [10.55776/F1004] for funding my research and to the Physical\r\nReview journals for publishing it. I also want to thank the VCQ (previously CoQuS) and\r\nIQOQI for organizing wonderful networking events for the physics community in Vienna\r\nand Innsbruck, respectively. Moreover, I thank Austrian Science Fund (FWF) for the\r\ncontinuous support for quantum research.","abstract":[{"lang":"eng","text":"Rotations are found in physics problems at all scales: from spatial motion of celestial bodies, to transitions between quantum states of atoms and molecules. Mathematically, they represent a fundamental class of transformations and symmetries. Unlike spatial displacements, rotational transformations in three-dimensional space  are non-commutative: the result of applying a sequence of rotations depends on the order of these operations. This feature makes the emergent physics that involves rotations rather intricate, but instrumental for studies of highly-interconnected many-body systems. In the presence of an environment, rotational properties of an object change, due to the interaction with particles of the environment. Owing to the complexity of this interaction, it can be engineered to exhibit certain properties of interest. In this Thesis, we examine several scenarios of how the rotational behavior of an impurity can be modified by interactions with its environment."}],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","year":"2025","status":"public","title":"Emergent physics of rotating quantum impurities in many-body environments","corr_author":"1","has_accepted_license":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","image":"/images/cc_by_nc_sa.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"file":[{"file_name":"thesis_Maslov.pdf","file_id":"19061","checksum":"5822a4dd31724c512b37c658af1787ab","relation":"main_file","creator":"mmaslov","content_type":"application/pdf","date_created":"2025-02-18T14:25:59Z","access_level":"open_access","date_updated":"2025-02-18T14:25:59Z","file_size":7779825},{"file_size":14453726,"date_updated":"2025-02-18T14:25:59Z","access_level":"open_access","date_created":"2025-02-18T14:25:59Z","content_type":"application/zip","creator":"mmaslov","relation":"source_file","checksum":"89bdce4774406d26ceca88a8bbcd6a9a","file_id":"19062","file_name":"thesis_Maslov_source.zip"}],"_id":"19048","citation":{"ama":"Maslov M. Emergent physics of rotating quantum impurities in many-body environments. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>","ieee":"M. Maslov, “Emergent physics of rotating quantum impurities in many-body environments,” Institute of Science and Technology Austria, 2025.","apa":"Maslov, M. (2025). <i>Emergent physics of rotating quantum impurities in many-body environments</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>","mla":"Maslov, Mikhail. <i>Emergent Physics of Rotating Quantum Impurities in Many-Body Environments</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:19048\">10.15479/at:ista:19048</a>.","chicago":"Maslov, Mikhail. “Emergent Physics of Rotating Quantum Impurities in Many-Body Environments.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:19048\">https://doi.org/10.15479/at:ista:19048</a>.","short":"M. Maslov, Emergent Physics of Rotating Quantum Impurities in Many-Body Environments, Institute of Science and Technology Austria, 2025.","ista":"Maslov M. 2025. Emergent physics of rotating quantum impurities in many-body environments. Institute of Science and Technology Austria."},"alternative_title":["ISTA Thesis"],"day":"18","supervisor":[{"last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","orcid":"0000-0002-6990-7802","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail"}],"oa":1,"department":[{"_id":"GradSch"},{"_id":"MiLe"}],"author":[{"full_name":"Maslov, Mikhail","last_name":"Maslov","orcid":"0000-0003-4074-2570","first_name":"Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","acknowledged_ssus":[{"_id":"CampIT"},{"_id":"E-Lib"},{"_id":"SSU"}],"language":[{"iso":"eng"}],"project":[{"grant_number":"801770","call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle"},{"name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","grant_number":"F100403"}],"fulldoi":"https://doi.org/10.15479/at:ista:19048","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"10845"},{"status":"public","id":"7933","relation":"part_of_dissertation"},{"status":"public","id":"18087","relation":"part_of_dissertation"}]},"date_updated":"2026-10-02T11:36:24Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","degree_awarded":"PhD","date_created":"2025-02-18T01:41:27Z","oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","ddc":["539","535","541"],"file_date_updated":"2025-02-18T14:25:59Z"},{"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","degree_awarded":"PhD","date_created":"2025-08-07T15:57:57Z","related_material":{"record":[{"status":"public","id":"11775","relation":"part_of_dissertation"},{"status":"deleted","relation":"part_of_dissertation","id":"13140"},{"id":"19741","relation":"part_of_dissertation","status":"public"},{"relation":"part_of_dissertation","id":"19643","status":"deleted"},{"status":"public","id":"13221","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"9356"},{"status":"public","relation":"part_of_dissertation","id":"20342"},{"status":"public","id":"17634","relation":"part_of_dissertation"}]},"date_updated":"2026-10-02T11:44:51Z","file_date_updated":"2025-09-10T08:19:51Z","ddc":["000"],"oa_version":"Published Version","publisher":"Institute of Science and Technology Austria","oa":1,"article_processing_charge":"No","author":[{"full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"}],"department":[{"_id":"GradSch"},{"_id":"ToHe"}],"supervisor":[{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000-0002-2985-7724"}],"project":[{"grant_number":"Z211","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems"},{"call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-20147","language":[{"iso":"eng"}],"abstract":[{"text":"Quantitative properties offer a framework for specifying and verifying system behaviors beyond the traditional boolean perspective. For example, while a boolean property may specify whether a server eventually grants every request it receives, a quantitative one may map each server execution to its average response time. This quantitative view is relatively well-studied in the context of static verification. However, although such properties often appear in practice as performance or robustness measures in a dynamic verification context, a general theoretical framework for their analysis and classification from a monitoring perspective is still missing.\r\n\r\nIn this thesis, we aim to develop such a framework that takes resource-precision tradeoffs of monitors as a central consideration. We present the first theory of monitorability for quantitative properties where monitors can be naturally approximate and compared regarding their precision and resource use. In particular, we show that additional monitor resources such as registers or states lead to strictly better approximations for some properties. To enable such analyses in a machine-model independent way, we describe an abstract notion of monitors that can be instantiated with concrete models of monitors. Within this framework, we study how abstract monitors behave and identify classes of properties amenable to approximate monitoring with resource-precision considerations. We then extend the boolean safety-liveness dichotomy and safety-progress hierarchy to the quantitative setting with a monitoring perspective. In particular, we prove that every property is the pointwise minimum of a safety property and a liveness property, and properties that are both safe and co-safe can be approximately monitored arbitrarily precisely using only finitely many states. We also study the classes of quantitative properties definable by finite-state quantitative automata and provide algorithms for deciding their safety or liveness as well as their safety-liveness decompositions. Finally, we present the first general-purpose tool for automating the analysis, verification, and monitoring of quantitative automata.\r\n\r\n\r\n","lang":"eng"}],"year":"2025","title":"A monitoring-oriented theory and classification of quantitative specifications","status":"public","corr_author":"1","acknowledgement":"This work was supported in part by the Austrian Science Fund (FWF)\r\nunder grant Z211-N23 (Wittgenstein Award) and the ERC-2020-AdG 101020093.\r\n","OA_place":"publisher","publisher_comment":"In reference to IEEE copyrighted material which is used with permission in this thesis, the IEEE does not\r\nendorse any of ISTA's products or services. Internal or personal use of this\r\nmaterial is permitted. If interested in reprinting/republishing IEEE copyrighted material for advertising or promotional\r\npurposes or for creating new collective works for resale or redistribution, please go to\r\nhttp://www.ieee.org/publications_standards/publications/rights/rights_link.html to learn how to obtain a License from\r\nRightsLink.  If applicable, University Microfilms and/or ProQuest Library, or the Archives of Canada may supply single copies of the dissertation.","_id":"20147","citation":{"apa":"Sarac, N. E. (2025). <i>A monitoring-oriented theory and classification of quantitative specifications</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>","ieee":"N. E. Sarac, “A monitoring-oriented theory and classification of quantitative specifications,” Institute of Science and Technology Austria, 2025.","ama":"Sarac NE. A monitoring-oriented theory and classification of quantitative specifications. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>","short":"N.E. Sarac, A Monitoring-Oriented Theory and Classification of Quantitative Specifications, Institute of Science and Technology Austria, 2025.","ista":"Sarac NE. 2025. A monitoring-oriented theory and classification of quantitative specifications. Institute of Science and Technology Austria.","chicago":"Sarac, Naci E. “A Monitoring-Oriented Theory and Classification of Quantitative Specifications.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20147\">https://doi.org/10.15479/AT-ISTA-20147</a>.","mla":"Sarac, Naci E. <i>A Monitoring-Oriented Theory and Classification of Quantitative Specifications</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20147\">10.15479/AT-ISTA-20147</a>."},"alternative_title":["ISTA Thesis"],"day":"07","publication_status":"published","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"closed","date_created":"2025-08-21T09:40:28Z","creator":"esarac","content_type":"application/x-zip-compressed","file_size":8884801,"date_updated":"2025-09-10T08:19:51Z","file_id":"20200","file_name":"2025_Sarac_NaciEge_Thesis.zip","relation":"source_file","checksum":"0f3015f1db36576a23d8d669afb60b41"},{"checksum":"332ed2fe61f580641664ec3f05d30f14","relation":"main_file","file_name":"2025_Sarac_NaciEge_Thesis.pdf","file_id":"20201","success":1,"date_updated":"2025-08-21T09:40:34Z","file_size":2955584,"content_type":"application/pdf","creator":"esarac","date_created":"2025-08-21T09:40:34Z","access_level":"open_access"}],"doi":"10.15479/AT-ISTA-20147","date_published":"2025-08-07T00:00:00Z","doi_confirm":"1","publication_identifier":{"issn":["2663-337X"]},"type":"dissertation","ec_funded":1,"page":"149","month":"08"},{"file":[{"file_size":839510,"date_updated":"2025-04-16T09:36:08Z","content_type":"application/pdf","creator":"dernst","access_level":"open_access","date_created":"2025-04-16T09:36:08Z","relation":"main_file","checksum":"25d9bd490719b45eca84f4d93a06c69f","file_name":"2025_MathProgramming_Dvorak.pdf","success":1,"file_id":"19578"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","has_accepted_license":"1","publication":"Mathematical Programming","das_tickbox":"0","quality_controlled":"1","day":"01","citation":{"ieee":"M. Dvorak and V. Kolmogorov, “Generalized minimum 0-extension problem and discrete convexity,” <i>Mathematical Programming</i>, vol. 209. Springer Nature, pp. 279–322, 2025.","ama":"Dvorak M, Kolmogorov V. Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. 2025;209:279-322. doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>","apa":"Dvorak, M., &#38; Kolmogorov, V. (2025). Generalized minimum 0-extension problem and discrete convexity. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>","mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>, vol. 209, Springer Nature, 2025, pp. 279–322, doi:<a href=\"https://doi.org/10.1007/s10107-024-02064-5\">10.1007/s10107-024-02064-5</a>.","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Generalized Minimum 0-Extension Problem and Discrete Convexity.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02064-5\">https://doi.org/10.1007/s10107-024-02064-5</a>.","short":"M. Dvorak, V. Kolmogorov, Mathematical Programming 209 (2025) 279–322.","ista":"Dvorak M, Kolmogorov V. 2025. Generalized minimum 0-extension problem and discrete convexity. Mathematical Programming. 209, 279–322."},"_id":"10045","supplementarymaterial":"no","acknowledgement":"We thank the anonymous reviewers for their careful reading of our manuscript and their many insightful comments and suggestions. Open access funding provided by Institute of Science and Technology (IST Austria).","OA_place":"publisher","corr_author":"1","title":"Generalized minimum 0-extension problem and discrete convexity","status":"public","abstract":[{"lang":"eng","text":"Given a fixed finite metric space (V,μ), the {\\em minimum 0-extension problem}, denoted as 0-Ext[μ], is equivalent to the following optimization problem: minimize function of the form minx∈Vn∑ifi(xi)+∑ijcijμ(xi,xj) where cij,cvi are given nonnegative costs and fi:V→R are functions given by fi(xi)=∑v∈Vcviμ(xi,v). The computational complexity of 0-Ext[μ] has been recently established by Karzanov and by Hirai: if metric μ is {\\em orientable modular} then 0-Ext[μ] can be solved in polynomial time, otherwise 0-Ext[μ] is NP-hard. To prove the tractability part, Hirai developed a theory of discrete convex functions on orientable modular graphs generalizing several known classes of functions in discrete convex analysis, such as L♮-convex functions. We consider a more general version of the problem in which unary functions fi(xi) can additionally have terms of the form cuv;iμ(xi,{u,v}) for {u,v}∈F, where set F⊆(V2) is fixed. We extend the complexity classification above by providing an explicit condition on (μ,F) for the problem to be tractable. In order to prove the tractability part, we generalize Hirai's theory and define a larger class of discrete convex functions. It covers, in particular, another well-known class of functions, namely submodular functions on an integer lattice. Finally, we improve the complexity of Hirai's algorithm for solving 0-Ext on orientable modular graphs.\r\n"}],"year":"2025","month":"01","isi":1,"page":"279-322","type":"journal_article","researchdata_availability":"no","publication_identifier":{"issn":["0025-5610"],"eissn":["1436-4646"]},"external_id":{"isi":["001176563300001"],"arxiv":["2109.10203"]},"keyword":["minimum 0-extension problem","metric labeling problem","discrete metric spaces","metric extensions","computational complexity","valued constraint satisfaction problems","discrete convex analysis","L-convex functions"],"arxiv":1,"date_published":"2025-01-01T00:00:00Z","doi":"10.1007/s10107-024-02064-5","publisher":"Springer Nature","article_type":"original","oa_version":"Published Version","volume":209,"file_date_updated":"2025-04-16T09:36:08Z","ddc":["004"],"date_updated":"2026-10-02T11:45:16Z","date_created":"2021-09-27T10:48:23Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/s10107-024-02064-5","intvolume":"       209","OA_type":"hybrid","author":[{"orcid":"0000-0001-5293-214X","first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","full_name":"Dvorak, Martin","last_name":"Dvorak"},{"last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"article_processing_charge":"Yes (via OA deal)","oa":1,"scopus_import":"1"},{"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/s00454-024-00660-y","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Mathematics, Computer Science"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"intvolume":"        73","department":[{"_id":"HeEd"}],"article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","author":[{"orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"last_name":"Nikitenko","full_name":"Nikitenko, Anton","orcid":"0000-0002-0659-3201","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton"}],"scopus_import":"1","oa":1,"publisher":"Springer Nature","pmid":1,"oa_version":"Published Version","article_type":"original","volume":73,"file_date_updated":"2025-04-23T07:31:32Z","ddc":["510"],"date_updated":"2026-10-02T11:48:46Z","date_created":"2024-06-16T22:01:07Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","isi":1,"month":"03","ec_funded":1,"page":"490-499","type":"journal_article","publication_identifier":{"issn":["0179-5376"],"eissn":["1432-0444"]},"researchdata_availability":"no","external_id":{"pmid":["39974750"],"isi":["001238566200004"],"arxiv":["2012.03350"]},"arxiv":1,"doi":"10.1007/s00454-024-00660-y","date_published":"2025-03-01T00:00:00Z","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"file_id":"19610","file_name":"2025_DiscreteComputGeom_EdelsbrunnerHe.pdf","relation":"main_file","checksum":"ffb0c818222138f9f113f4bbea41e834","access_level":"open_access","date_created":"2025-04-23T07:31:32Z","content_type":"application/pdf","creator":"dernst","file_size":283443,"date_updated":"2025-04-23T07:31:32Z"}],"publication_status":"published","has_accepted_license":"1","citation":{"ista":"Edelsbrunner H, Nikitenko A. 2025. Average and expected distortion of Voronoi paths and scapes. Discrete &#38; Computational Geometry. 73, 490–499.","short":"H. Edelsbrunner, A. Nikitenko, Discrete &#38; Computational Geometry 73 (2025) 490–499.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>.","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Average and Expected Distortion of Voronoi Paths and Scapes.” <i>Discrete &#38; Computational Geometry</i>, vol. 73, Springer Nature, 2025, pp. 490–99, doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2025). Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-024-00660-y\">https://doi.org/10.1007/s00454-024-00660-y</a>","ieee":"H. Edelsbrunner and A. Nikitenko, “Average and expected distortion of Voronoi paths and scapes,” <i>Discrete &#38; Computational Geometry</i>, vol. 73. Springer Nature, pp. 490–499, 2025.","ama":"Edelsbrunner H, Nikitenko A. Average and expected distortion of Voronoi paths and scapes. <i>Discrete &#38; Computational Geometry</i>. 2025;73:490-499. doi:<a href=\"https://doi.org/10.1007/s00454-024-00660-y\">10.1007/s00454-024-00660-y</a>"},"day":"01","das_tickbox":"0","quality_controlled":"1","publication":"Discrete & Computational Geometry","_id":"17149","supplementarymaterial":"no","acknowledgement":"The authors thank Ranita Biswas and Tatiana Ezubova for the collaboration on computational experiments that motivated the work reported in this paper. The authors also thank Daniel Bonnema for proofreading and noticing an issue with the original proof of Lemma 4.3.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria).\r\nThis project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, Grant No. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), Grant No. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), Grant No. I 02979-N35.","OA_place":"publisher","title":"Average and expected distortion of Voronoi paths and scapes","status":"public","corr_author":"1","year":"2025","abstract":[{"text":"The approximation of a circle with the edges of a fine square grid distorts the perimeter by a factor about 4/Pi. We prove that this factor is the same on average (in the ergodic sense) for approximations of any rectifiable curve by the edges of any non-exotic Delaunay mosaic (known as Voronoi path), and extend the results to all dimensions, generalizing Voronoi paths to Voronoi scapes.","lang":"eng"}]},{"type":"journal_article","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.13201","open_access":"1"}],"month":"12","date_published":"2025-12-01T00:00:00Z","doi":"10.1016/j.comgeo.2025.102186","arxiv":1,"external_id":{"arxiv":["2306.13201"]},"publication_identifier":{"issn":["0925-7721"]},"_id":"21253","publication":"Computational Geometry","quality_controlled":"1","citation":{"apa":"Pach, J., Saghafian, M., &#38; Schnider, P. (2025). Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>","ieee":"J. Pach, M. Saghafian, and P. Schnider, “Decomposition of geometric graphs into star-forests,” <i>Computational Geometry</i>, vol. 129. Elsevier, 2025.","ama":"Pach J, Saghafian M, Schnider P. Decomposition of geometric graphs into star-forests. <i>Computational Geometry</i>. 2025;129. doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>","short":"J. Pach, M. Saghafian, P. Schnider, Computational Geometry 129 (2025).","ista":"Pach J, Saghafian M, Schnider P. 2025. Decomposition of geometric graphs into star-forests. Computational Geometry. 129, 102186.","mla":"Pach, János, et al. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>, vol. 129, 102186, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">10.1016/j.comgeo.2025.102186</a>.","chicago":"Pach, János, Morteza Saghafian, and Patrick Schnider. “Decomposition of Geometric Graphs into Star-Forests.” <i>Computational Geometry</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.comgeo.2025.102186\">https://doi.org/10.1016/j.comgeo.2025.102186</a>."},"day":"01","publication_status":"published","abstract":[{"text":"We solve a problem of Dujmović and Wood (2007) by showing that a complete convex geometric graph on n vertices cannot be decomposed into fewer than n - 1 star-forests, each consisting of noncrossing edges. This bound is clearly tight. We also discuss similar questions for abstract graphs.","lang":"eng"}],"year":"2025","corr_author":"1","title":"Decomposition of geometric graphs into star-forests","status":"public","acknowledgement":"A preliminary version of this note has been published in the proceedings of the 31st International Symposium on Graph Drawing and Network Visualization, Palermo, 2023. The authors would like to thank the anonymous referees for their valuable comments.","OA_place":"repository","intvolume":"       129","fulldoi":"https://doi.org/10.1016/j.comgeo.2025.102186","language":[{"iso":"eng"}],"oa":1,"department":[{"_id":"HeEd"}],"article_processing_charge":"No","OA_type":"green","author":[{"first_name":"János","last_name":"Pach","full_name":"Pach, János"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza","id":"f86f7148-b140-11ec-9577-95435b8df824"},{"full_name":"Schnider, Patrick","last_name":"Schnider","first_name":"Patrick"}],"article_number":"102186","volume":129,"article_type":"original","oa_version":"Preprint","publisher":"Elsevier","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-02-16T15:48:42Z","related_material":{"record":[{"status":"public","id":"15012","relation":"earlier_version"}]},"date_updated":"2026-10-02T11:50:58Z"},{"publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","ddc":["514","004"],"file_date_updated":"2025-02-04T16:22:07Z","date_updated":"2026-10-02T11:57:00Z","related_material":{"record":[{"status":"public","relation":"part_of_dissertation","id":"15091"},{"status":"public","relation":"part_of_dissertation","id":"18981"}]},"date_created":"2025-01-31T17:04:40Z","degree_awarded":"PhD","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","language":[{"iso":"eng"}],"project":[{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","call_identifier":"FWF","_id":"2561EBF4-B435-11E9-9278-68D0E5697425"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"}],"fulldoi":"https://doi.org/10.15479/at:ista:18979","supervisor":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"}],"department":[{"_id":"GradSch"},{"_id":"HeEd"}],"article_processing_charge":"No","author":[{"first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","last_name":"Draganov"}],"oa":1,"file":[{"date_created":"2025-01-31T16:58:30Z","access_level":"closed","creator":"odragano","content_type":"application/zip","date_updated":"2025-01-31T16:58:30Z","file_size":11899491,"file_id":"18983","file_name":"Thesis.zip","checksum":"af6567e5d35e5eb330b8925ae37f1998","relation":"source_file"},{"file_id":"19000","file_name":"Thesis.pdf","checksum":"c3fef68e35b9dc2020b2ca6006da6343","relation":"main_file","date_created":"2025-02-04T16:22:07Z","access_level":"open_access","creator":"odragano","content_type":"application/pdf","date_updated":"2025-02-04T16:22:07Z","file_size":8857514}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"has_accepted_license":"1","publication_status":"published","citation":{"ama":"Draganov O. Structures and computations in topological data analysis. 2025. doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>","ieee":"O. Draganov, “Structures and computations in topological data analysis,” Institute of Science and Technology Austria, 2025.","apa":"Draganov, O. (2025). <i>Structures and computations in topological data analysis</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>","chicago":"Draganov, Ondrej. “Structures and Computations in Topological Data Analysis.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/at:ista:18979\">https://doi.org/10.15479/at:ista:18979</a>.","mla":"Draganov, Ondrej. <i>Structures and Computations in Topological Data Analysis</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/at:ista:18979\">10.15479/at:ista:18979</a>.","ista":"Draganov O. 2025. Structures and computations in topological data analysis. Institute of Science and Technology Austria.","short":"O. Draganov, Structures and Computations in Topological Data Analysis, Institute of Science and Technology Austria, 2025."},"day":"03","alternative_title":["ISTA Thesis"],"_id":"18979","acknowledgement":"The research presented in this thesis was funded with the Wittgenstein Prize,\r\nAustrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.\r\n","OA_place":"publisher","corr_author":"1","status":"public","title":"Structures and computations in topological data analysis","abstract":[{"lang":"eng","text":"Topological Data Analysis (TDA) is a discipline utilizing the mathematical field of topology to study data, most prominently collections of point sets. This thesis summarizes three projects related to computations in TDA.\r\n\r\nThe first one establishes a variant of TDA for chromatic point sets, where each point is given a color. For example, we are given positions of cells within a tumor microenvironment, and color the cancerous cells red, and the immune cells blue.\r\n\r\nThe aim is then to give a quantitative description of how the two or more sets of points spatially interact. Building on image, kernel and cokernel variants of persistent homology, we suggest six-packs of persistent diagrams as such a descriptor.\r\n\r\nWe describe a construction of a chromatic alpha complex, which enables  efficient computation of several variants of the six-packs. We give topological descriptions of natural subcomplexes of the chromatic alpha complex, and show that the radii of the simplices form a discrete Morse function. Finally, we provide an implementation of the presented chromatic TDA pipeline.\r\n\r\nThe second part aims to translate a powerful tool of sheaf theory to elementary terms using labeled matrices. The goal is to enable their use in computational settings. We show that derived categories of sheaves over finite posets have, up to isomorphism, unique objects---minimal injective resolutions---and give a concrete algorithm to compute them. We further describe simple algorithms to compute derived pushforwards and pullbacks for monotonic maps, and their proper variants for inclusions, and demonstrate their tractability by providing an implementation. Finally, we suggest a discrete definition of microsupport and show desirable properties inspired by discrete Morse theory.\r\n\r\nIn the last part, we present a collection of observations about collapses. We give a characterization of collapsibility in terms of unitriangular submatrices of the boundary matrix, a cotree-tree decomposition, and the optimal solution to a variant of the Procrustes problem. We establish relation between dual collapses and relative Morse theory and pose several open questions. Finally, focusing on complexes embedded in the three-dimensional Euclidean space, we describe a relation between the collapsibility and the triviality of a polygonal knot."}],"year":"2025","month":"02","page":"140","type":"dissertation","publication_identifier":{"issn":["2663-337X"]},"keyword":["topological data analysis","chromatic point set","alpha complex","persistent homology","six pack","sheaf","microlocal discrete Morse","injective resolution","collapse","knot","discrete Morse theory"],"doi":"10.15479/at:ista:18979","date_published":"2025-02-03T00:00:00Z"},{"volume":229,"ddc":["510"],"file_date_updated":"2025-12-30T07:55:08Z","publisher":"Elsevier","oa_version":"Published Version","article_type":"original","date_created":"2025-09-10T05:40:09Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-02T11:57:00Z","related_material":{"record":[{"relation":"earlier_version","id":"18981","status":"public"}]},"PlanS_conform":"1","fulldoi":"https://doi.org/10.1016/j.jpaa.2025.108068","project":[{"name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"788183"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z00342"},{"_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35"}],"issue":"10","intvolume":"       229","language":[{"iso":"eng"}],"author":[{"id":"70B7FDF6-608D-11E9-9333-8535E6697425","first_name":"Adam","last_name":"Brown","full_name":"Brown, Adam"},{"first_name":"Ondrej","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","full_name":"Draganov, Ondrej","last_name":"Draganov"}],"article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","department":[{"_id":"HeEd"}],"scopus_import":"1","oa":1,"article_number":"108068","day":"01","citation":{"mla":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10, 108068, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>.","chicago":"Brown, Adam, and Ondrej Draganov. “Discrete Microlocal Morse Theory.” <i>Journal of Pure and Applied Algebra</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>.","short":"A. Brown, O. Draganov, Journal of Pure and Applied Algebra 229 (2025).","ista":"Brown A, Draganov O. 2025. Discrete microlocal Morse theory. Journal of Pure and Applied Algebra. 229(10), 108068.","ama":"Brown A, Draganov O. Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. 2025;229(10). doi:<a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">10.1016/j.jpaa.2025.108068</a>","ieee":"A. Brown and O. Draganov, “Discrete microlocal Morse theory,” <i>Journal of Pure and Applied Algebra</i>, vol. 229, no. 10. Elsevier, 2025.","apa":"Brown, A., &#38; Draganov, O. (2025). Discrete microlocal Morse theory. <i>Journal of Pure and Applied Algebra</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jpaa.2025.108068\">https://doi.org/10.1016/j.jpaa.2025.108068</a>"},"quality_controlled":"1","publication":"Journal of Pure and Applied Algebra","_id":"20323","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","date_created":"2025-12-30T07:55:08Z","content_type":"application/pdf","creator":"dernst","file_size":3090836,"date_updated":"2025-12-30T07:55:08Z","success":1,"file_id":"20886","file_name":"2025_JourPureAppliedAlgebra_Brown.pdf","relation":"main_file","checksum":"39bcad462278c9322ef810af7db67f56"}],"publication_status":"published","has_accepted_license":"1","title":"Discrete microlocal Morse theory","status":"public","corr_author":"1","abstract":[{"text":"We establish several results combining discrete Morse theory and microlocal sheaf theory in the setting of finite posets and simplicial complexes. Our primary tool is a computationally tractable description of the bounded derived category of sheaves on a poset with the Alexandrov topology. We prove that each bounded complex of sheaves on a finite poset admits a unique (up to isomorphism of complexes) minimal injective resolution, and we provide algorithms for computing minimal injective resolution of an injective complex, as well as several useful functors between derived categories of sheaves. For the constant sheaf on a simplicial complex, we give asymptotically tight bounds on the complexity of computing the minimal injective resolution using those algorithms. Our main result is a novel definition of the discrete microsupport of a bounded complex of sheaves on a finite poset. We detail several foundational properties of the discrete microsupport, as well as a microlocal generalization of the discrete homological Morse theorem and Morse inequalities.","lang":"eng"}],"year":"2025","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35","OA_place":"publisher","ec_funded":1,"type":"journal_article","month":"10","arxiv":1,"date_published":"2025-10-01T00:00:00Z","doi":"10.1016/j.jpaa.2025.108068","publication_identifier":{"issn":["0022-4049"]},"external_id":{"arxiv":["2209.14993"]}},{"publication_identifier":{"eissn":["1083-589X"]},"external_id":{"arxiv":["2404.15205"],"isi":["001611557000018"]},"arxiv":1,"date_published":"2025-09-25T00:00:00Z","doi":"10.1214/25-ECP717","isi":1,"month":"09","ec_funded":1,"type":"journal_article","DOAJ_listed":"1","OA_place":"publisher","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 and by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No 101034413. The authors thank Professors Jean Dolbeault, Jan Maas, and Nikita Simonov for many useful comments, and Professors Kazuhiro Ishige, Asuka Takatsu, and Yair Shenfeld for inspiring interactions.","status":"public","title":"Heat flow, log-concavity, and Lipschitz transport maps","corr_author":"1","year":"2025","abstract":[{"lang":"eng","text":"In this paper we derive estimates for the Hessian of the logarithm (log-Hessian) for solutions to the heat equation. For initial data in the form of log-Lipschitz perturbation of strongly log-concave measures, the log-Hessian admits an explicit, uniform (in space) lower bound. This yields a new estimate for the Lipschitz constant of a transport map pushing forward the standard Gaussian to a measure in this class. On the other hand, we show that assuming only fast decay of the tails of the initial datum does not suffice to guarantee uniform log-Hessian upper bounds."}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"file_id":"20596","file_name":"2025_ElectronJourProbab_Brigati.pdf","relation":"main_file","checksum":"67858edbd74658fe38955fa1216f2f18","access_level":"open_access","date_created":"2025-11-04T07:34:05Z","content_type":"application/pdf","creator":"dernst","file_size":278078,"date_updated":"2025-11-04T07:34:05Z"}],"has_accepted_license":"1","publication_status":"published","citation":{"ieee":"G. Brigati and F. Pedrotti, “Heat flow, log-concavity, and Lipschitz transport maps,” <i>Electronic Communications in Probability</i>, vol. 30. Institute of Mathematical Statistics, 2025.","ama":"Brigati G, Pedrotti F. Heat flow, log-concavity, and Lipschitz transport maps. <i>Electronic Communications in Probability</i>. 2025;30. doi:<a href=\"https://doi.org/10.1214/25-ECP717\">10.1214/25-ECP717</a>","apa":"Brigati, G., &#38; Pedrotti, F. (2025). Heat flow, log-concavity, and Lipschitz transport maps. <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-ECP717\">https://doi.org/10.1214/25-ECP717</a>","mla":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>Electronic Communications in Probability</i>, vol. 30, 71, Institute of Mathematical Statistics, 2025, doi:<a href=\"https://doi.org/10.1214/25-ECP717\">10.1214/25-ECP717</a>.","chicago":"Brigati, Giovanni, and Francesco Pedrotti. “Heat Flow, Log-Concavity, and Lipschitz Transport Maps.” <i>Electronic Communications in Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-ECP717\">https://doi.org/10.1214/25-ECP717</a>.","ista":"Brigati G, Pedrotti F. 2025. Heat flow, log-concavity, and Lipschitz transport maps. Electronic Communications in Probability. 30, 71.","short":"G. Brigati, F. Pedrotti, Electronic Communications in Probability 30 (2025)."},"day":"25","quality_controlled":"1","publication":"Electronic Communications in Probability","_id":"20591","article_number":"71","author":[{"last_name":"Brigati","full_name":"Brigati, Giovanni","id":"63ff57e8-1fbb-11ee-88f2-f558ffc59cf1","first_name":"Giovanni"},{"id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco","last_name":"Pedrotti","full_name":"Pedrotti, Francesco"}],"article_processing_charge":"Yes","OA_type":"gold","department":[{"_id":"JaMa"}],"oa":1,"scopus_import":"1","language":[{"iso":"eng"}],"project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"fulldoi":"https://doi.org/10.1214/25-ECP717","intvolume":"        30","date_updated":"2026-10-02T12:20:37Z","PlanS_conform":"1","related_material":{"record":[{"relation":"earlier_version","id":"17353","status":"public"}]},"date_created":"2025-11-02T23:01:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Institute of Mathematical Statistics","oa_version":"Published Version","article_type":"original","volume":30,"file_date_updated":"2025-11-04T07:34:05Z","ddc":["500"]},{"publication_status":"published","publication":"The Annals of Applied Probability","quality_controlled":"1","citation":{"ieee":"K. Khudiakova, J. Maas, and F. Pedrotti, “L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model,” <i>The Annals of Applied Probability</i>, vol. 35, no. 3. Institute of Mathematical Statistics, pp. 1913–1940, 2025.","ama":"Khudiakova K, Maas J, Pedrotti F. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>The Annals of Applied Probability</i>. 2025;35(3):1913-1940. doi:<a href=\"https://doi.org/10.1214/25-aap2162\">10.1214/25-aap2162</a>","apa":"Khudiakova, K., Maas, J., &#38; Pedrotti, F. (2025). L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/25-aap2162\">https://doi.org/10.1214/25-aap2162</a>","chicago":"Khudiakova, Kseniia, Jan Maas, and Francesco Pedrotti. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>The Annals of Applied Probability</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/25-aap2162\">https://doi.org/10.1214/25-aap2162</a>.","mla":"Khudiakova, Kseniia, et al. “L∞-Optimal Transport of Anisotropic Log-Concave Measures and Exponential Convergence in Fisher’s Infinitesimal Model.” <i>The Annals of Applied Probability</i>, vol. 35, no. 3, Institute of Mathematical Statistics, 2025, pp. 1913–40, doi:<a href=\"https://doi.org/10.1214/25-aap2162\">10.1214/25-aap2162</a>.","ista":"Khudiakova K, Maas J, Pedrotti F. 2025. L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model. The Annals of Applied Probability. 35(3), 1913–1940.","short":"K. Khudiakova, J. Maas, F. Pedrotti, The Annals of Applied Probability 35 (2025) 1913–1940."},"day":"01","_id":"20050","acknowledgement":"This research was funded in part by the Austrian Science Fund (FWF) project 10.55776/F65 and the Austrian Academy of Science, DOC fellowship nr. 26293.","OA_place":"repository","corr_author":"1","status":"public","title":"L∞-optimal transport of anisotropic log-concave measures and exponential convergence in Fisher’s infinitesimal model","abstract":[{"text":"We prove upper bounds on the L∞-Wasserstein distance from optimal transport between strongly log-concave probability densities and log-Lipschitz perturbations. In the simplest setting, such a bound amounts to a transport-information inequality involving the L∞-Wasserstein metric and the relative L∞-Fisher information. We show that this inequality can be sharpened significantly in situations where the involved densities are anisotropic. Our proof is based on probabilistic techniques using Langevin dynamics. As an application of these results, we obtain sharp exponential rates of convergence in Fisher’s infinitesimal model from quantitative genetics, generalising recent results by Calvez, Poyato, and Santambrogio in dimension 1 to arbitrary dimensions.","lang":"eng"}],"year":"2025","month":"06","isi":1,"page":"1913-1940","type":"journal_article","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2402.04151"}],"publication_identifier":{"issn":["1050-5164"]},"external_id":{"arxiv":["2402.04151"],"isi":["001523520000012"]},"arxiv":1,"doi":"10.1214/25-aap2162","date_published":"2025-06-01T00:00:00Z","publisher":"Institute of Mathematical Statistics","article_type":"original","oa_version":"Preprint","volume":35,"date_updated":"2026-10-02T12:20:10Z","related_material":{"record":[{"status":"public","id":"17352","relation":"earlier_version"}]},"date_created":"2025-07-21T08:13:54Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1214/25-aap2162","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"},{"grant_number":"26293","_id":"34d33d68-11ca-11ed-8bc3-ec13763c0ca8","name":"The impact of deleterious mutations on small populations"}],"issue":"3","intvolume":"        35","department":[{"_id":"JaMa"}],"author":[{"first_name":"Kseniia","id":"4E6DC800-AE37-11E9-AC72-31CAE5697425","orcid":"0000-0002-6246-1465","full_name":"Khudiakova, Kseniia","last_name":"Khudiakova"},{"orcid":"0000-0002-0845-1338","first_name":"Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","full_name":"Maas, Jan","last_name":"Maas"},{"id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","first_name":"Francesco","last_name":"Pedrotti","full_name":"Pedrotti, Francesco"}],"OA_type":"green","article_processing_charge":"No","oa":1,"scopus_import":"1"},{"title":"Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination","status":"public","biorxivid":1,"corr_author":"1","license":"https://creativecommons.org/licenses/by-nc/4.0/","abstract":[{"lang":"eng","text":"Cleavage - the series of rapid cell divisions that follow fertilization - marks the onset of metazoan development and represents a deeply conserved evolutionary process. Across animals, two principal modes exist: complete (holoblastic) and incomplete (meroblastic) cleavage. While holoblastic cleavage resembles conventional cytokinesis both in vitro and in vivo, the mechanisms underlying meroblastic cleavage have remained poorly understood. Using zebrafish embryos as a model, we show that meroblastic cleavage proceeds through a distinct two-step mechanism. The process begins with the assembly and contraction of a large, arc-shaped actomyosin cable. However, this contractile event alone is insufficient to complete division. A second phase, driven by cadherin-mediated membrane adhesion, is required to invaginate the furrow ridge. Strikingly, this transition depends on mechanical uncoupling of the contractile cable from the surrounding cortex. We demonstrate that such uncoupling arises from an active nematic instability, which both enhances contractility along the cable and generates actin depletion zones that relieve lateral connections. Together, these findings reveal that meroblastic cleavage is governed not by a single actomyosin-based event but by a sequential interplay between cytoskeletal contraction and cadherin-dependent adhesion, highlighting a mechanism fundamentally distinct from canonical cytokinesis."}],"year":"2025","OA_place":"repository","acknowledgement":"We are grateful to the members of the Hannezo and Heisenberg groups for discussions and technical advice. We also thank the Imaging and Optics Facility and the Lab Support Facility at ISTA for their continuous support. Y.I.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skodowska-Curie Grant Agreement No. 101034413. The research was supported by funding to C.-P.H. from the NOMIS Foundation (Project ID 1.844) and to E.H. from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 851288).","day":"15","citation":{"apa":"Tong, X., Li, Y. I., Schelle, J., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (n.d.). Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.10.15.682552\">https://doi.org/10.1101/2025.10.15.682552</a>","ama":"Tong X, Li YI, Schelle J, Hannezo EB, Heisenberg C-PJ. Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>","ieee":"X. Tong, Y. I. Li, J. Schelle, E. B. Hannezo, and C.-P. J. Heisenberg, “Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination,” <i>bioRxiv</i>. .","ista":"Tong X, Li YI, Schelle J, Hannezo EB, Heisenberg C-PJ. Non-canonical cytokinesis driven by mechanical uncoupling via nematic flows and adhesion-based invagination. bioRxiv, <a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>.","short":"X. Tong, Y.I. Li, J. Schelle, E.B. Hannezo, C.-P.J. Heisenberg, BioRxiv (n.d.).","chicago":"Tong, Xin, Yuting I Li, Joséphine Schelle, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Non-Canonical Cytokinesis Driven by Mechanical Uncoupling via Nematic Flows and Adhesion-Based Invagination.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2025.10.15.682552\">https://doi.org/10.1101/2025.10.15.682552</a>.","mla":"Tong, Xin, et al. “Non-Canonical Cytokinesis Driven by Mechanical Uncoupling via Nematic Flows and Adhesion-Based Invagination.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2025.10.15.682552\">10.1101/2025.10.15.682552</a>."},"publication":"bioRxiv","_id":"22807","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"publication_status":"draft","date_published":"2025-10-15T00:00:00Z","doi":"10.1101/2025.10.15.682552","external_id":{"biorxivid":["2025.10.15.682552"]},"ec_funded":1,"main_file_link":[{"url":"https://doi.org/10.1101/2025.10.15.682552","open_access":"1"}],"type":"preprint","month":"10","date_created":"2026-09-04T12:32:21Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-10-05T08:56:09Z","related_material":{"record":[{"relation":"dissertation_contains","id":"22804","status":"public"}]},"oa_version":"Preprint","article_processing_charge":"No","department":[{"_id":"EdHa"},{"_id":"CaHe"}],"author":[{"last_name":"Tong","full_name":"Tong, Xin","id":"50F65CDC-AA30-11E9-A72B-8A12E6697425","first_name":"Xin"},{"last_name":"Li","full_name":"Li, Yuting I","id":"ee7a5ca8-8b71-11ed-b662-b3341c05b7eb","first_name":"Yuting I"},{"last_name":"Schelle","full_name":"Schelle, Joséphine","first_name":"Joséphine"},{"full_name":"Hannezo, Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg"}],"OA_type":"green","oa":1,"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"grant_number":"851288","_id":"05943252-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Design Principles of Branching Morphogenesis"},{"name":"NOMIS Fellowship Program","_id":"9B861AAC-BA93-11EA-9121-9846C619BF3A"}],"fulldoi":"https://doi.org/10.1101/2025.10.15.682552","language":[{"iso":"eng"}]},{"article_number":"218202","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"ScienComp"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","author":[{"orcid":"0000-0002-0464-8440","first_name":"Andrea","id":"4bdcf7f6-eb97-11eb-a6c2-9981bbdc3bed","full_name":"Stöllner, Andrea","last_name":"Stöllner"},{"last_name":"Lenton","full_name":"Lenton, Isaac C","orcid":"0000-0002-5010-6984","id":"a550210f-223c-11ec-8182-e2d45e817efb","first_name":"Isaac C"},{"full_name":"Volosniev, Artem","last_name":"Volosniev","orcid":"0000-0003-0393-5525","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87"},{"first_name":"James","last_name":"Millen","full_name":"Millen, James"},{"first_name":"Renjiro","full_name":"Shibuya, Renjiro","last_name":"Shibuya"},{"last_name":"Ishii","full_name":"Ishii, Hisao","first_name":"Hisao"},{"full_name":"Rak, Dmytro","last_name":"Rak","first_name":"Dmytro","id":"70313b46-47c2-11ec-9e88-cd79101918fe"},{"last_name":"Alpichshev","full_name":"Alpichshev, Zhanybek","id":"45E67A2A-F248-11E8-B48F-1D18A9856A87","first_name":"Zhanybek","orcid":"0000-0002-7183-5203"},{"first_name":"Grégory","full_name":"David, Grégory","last_name":"David"},{"full_name":"Signorell, Ruth","last_name":"Signorell","first_name":"Ruth"},{"full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"},{"last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","first_name":"Scott R"}],"department":[{"_id":"ZhAl"},{"_id":"CaMu"},{"_id":"ScWa"}],"scopus_import":"1","oa":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1103/5xd9-4tjj","project":[{"call_identifier":"H2020","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","grant_number":"949120"},{"grant_number":"805041","_id":"629205d8-2b32-11ec-9570-e1356ff73576","call_identifier":"H2020","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate"}],"intvolume":"       135","issue":"21","date_updated":"2026-10-09T11:09:09Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"23033"}],"link":[{"url":"https://ista.ac.at/en/news/trapping-particles-to-explain-lightning/","relation":"press_release","description":"News on ISTA website"}]},"PlanS_conform":"1","date_created":"2025-11-30T23:02:07Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"American Physical Society","article_type":"original","oa_version":"Published Version","volume":135,"ddc":["530","550"],"file_date_updated":"2025-12-01T08:19:46Z","publication_identifier":{"issn":["0031-9007"],"eissn":["1079-7114"]},"external_id":{"arxiv":["2507.17591"]},"arxiv":1,"doi":"10.1103/5xd9-4tjj","date_published":"2025-11-21T00:00:00Z","month":"11","ec_funded":1,"type":"journal_article","OA_place":"publisher","acknowledgement":"We thank Todor Asenov and Abdulhamid Baghdadi for their outstanding technical support and Dr. Michael Gleichweit and Mercede Azizbaig Mohajer for the helpful discussions. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant Agreements No. 949120 and No. 805041) and the Swiss National Science Foundation (SNSF, Project No. 200021-236446). This research was supported by the Scientific Service Units of the Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop and the Scientific Computing service unit.","corr_author":"1","status":"public","title":"Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air","year":"2025","abstract":[{"lang":"eng","text":"Optical tweezers are widely used as a highly sensitive tool to measure forces on micron-scale particles. One such application is the measurement of the electric charge of a particle, which can be done with high precision in liquids, air, or vacuum. We experimentally investigate how the trapping laser itself can electrically charge such a particle, in our case a ∼1  μ⁢m SiO2 sphere in air. We model the charging mechanism as a two-photon process which reproduces the experimental data with high fidelity."}],"file":[{"date_created":"2025-12-01T08:19:46Z","access_level":"open_access","creator":"dernst","content_type":"application/pdf","date_updated":"2025-12-01T08:19:46Z","file_size":1761373,"file_id":"20717","success":1,"file_name":"2025_PhysReviewLetters_Stoellner.pdf","checksum":"a5f76b1230cc7b039ecd0dbd6f99e775","relation":"main_file"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","has_accepted_license":"1","publication":"Physical Review Letters","quality_controlled":"1","citation":{"mla":"Stöllner, Andrea, et al. “Using Optical Tweezers to Simultaneously Trap, Charge, and Measure the Charge of a Microparticle in Air.” <i>Physical Review Letters</i>, vol. 135, no. 21, 218202, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/5xd9-4tjj\">10.1103/5xd9-4tjj</a>.","chicago":"Stöllner, Andrea, Isaac C Lenton, Artem Volosniev, James Millen, Renjiro Shibuya, Hisao Ishii, Dmytro Rak, et al. “Using Optical Tweezers to Simultaneously Trap, Charge, and Measure the Charge of a Microparticle in Air.” <i>Physical Review Letters</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/5xd9-4tjj\">https://doi.org/10.1103/5xd9-4tjj</a>.","short":"A. Stöllner, I.C. Lenton, A. Volosniev, J. Millen, R. Shibuya, H. Ishii, D. Rak, Z. Alpichshev, G. David, R. Signorell, C.J. Muller, S.R. Waitukaitis, Physical Review Letters 135 (2025).","ista":"Stöllner A, Lenton IC, Volosniev A, Millen J, Shibuya R, Ishii H, Rak D, Alpichshev Z, David G, Signorell R, Muller CJ, Waitukaitis SR. 2025. Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. Physical Review Letters. 135(21), 218202.","ama":"Stöllner A, Lenton IC, Volosniev A, et al. Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. <i>Physical Review Letters</i>. 2025;135(21). doi:<a href=\"https://doi.org/10.1103/5xd9-4tjj\">10.1103/5xd9-4tjj</a>","ieee":"A. Stöllner <i>et al.</i>, “Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air,” <i>Physical Review Letters</i>, vol. 135, no. 21. American Physical Society, 2025.","apa":"Stöllner, A., Lenton, I. C., Volosniev, A., Millen, J., Shibuya, R., Ishii, H., … Waitukaitis, S. R. (2025). Using optical tweezers to simultaneously trap, charge, and measure the charge of a microparticle in air. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/5xd9-4tjj\">https://doi.org/10.1103/5xd9-4tjj</a>"},"day":"21","_id":"20705"},{"month":"12","isi":1,"type":"journal_article","external_id":{"isi":["001614464000001"],"pmid":["41238730"]},"publication_identifier":{"eissn":["2399-3642"]},"date_published":"2025-12-01T00:00:00Z","doi":"10.1038/s42003-025-09158-6","publication_status":"published","has_accepted_license":"1","file":[{"date_created":"2025-11-24T09:12:19Z","access_level":"open_access","content_type":"application/pdf","creator":"dernst","date_updated":"2025-11-24T09:12:19Z","file_size":1588155,"file_id":"20675","success":1,"file_name":"2025_CommunicationsBiology_Serin.pdf","checksum":"b8b3c1abe7048a09b920082a37e786a5","relation":"main_file"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"_id":"20662","publication":"Communications Biology","quality_controlled":"1","day":"01","citation":{"ista":"Serin E, Ritter K, Schumann G, Banaschewski T, Marquand A, Walter H, Ogoh G, Stahl BC, Brandlistuen R, Schikowski T, Young AH, Xinyang Y, Zhang Z, Agunbiade K, Chen D, Desrivières S, Clinton N, Thompson P, Köhler V, Schwalber A, Calhoun VD, Chang X, Zhang Y, Li Y, Dai Y, Yuan J, Xia Y, Jia T, Renner P, Hese S, Spanlang B, Pearmund C, Athanasiadis AP, Petkoski S, Jirsa V, Schmitt K, Wilbertz JH, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM, Miller AJ, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Itatani R, Eiroa-Orosa F, Feixas G, Slater M, Novarino G, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Nees F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann N, Janson K, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz A, Schumann G. 2025. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. Communications Biology. 8, 1572.","short":"E. Serin, K. Ritter, G. Schumann, T. Banaschewski, A. Marquand, H. Walter, G. Ogoh, B.C. Stahl, R. Brandlistuen, T. Schikowski, A.H. Young, Y. Xinyang, Z. Zhang, K. Agunbiade, D. Chen, S. Desrivières, N. Clinton, P. Thompson, V. Köhler, A. Schwalber, V.D. Calhoun, X. Chang, Y. Zhang, Y. Li, Y. Dai, J. Yuan, Y. Xia, T. Jia, P. Renner, S. Hese, B. Spanlang, C. Pearmund, A.P. Athanasiadis, S. Petkoski, V. Jirsa, K. Schmitt, J.H. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A.J. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, R. Itatani, F. Eiroa-Orosa, G. Feixas, M. Slater, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, F. Nees, M. Neidhart, A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann, K. Janson, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, G. Schumann, Communications Biology 8 (2025).","chicago":"Serin, Emin, Kerstin Ritter, Gunter Schumann, Tobias Banaschewski, Andre Marquand, Henrik Walter, George Ogoh, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>.","mla":"Serin, Emin, et al. “Generating Synthetic Task-Based Brain Fingerprints for Population Neuroscience Using Deep Learning.” <i>Communications Biology</i>, vol. 8, 1572, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>.","apa":"Serin, E., Ritter, K., Schumann, G., Banaschewski, T., Marquand, A., Walter, H., … Schumann, G. (2025). Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-025-09158-6\">https://doi.org/10.1038/s42003-025-09158-6</a>","ieee":"E. Serin <i>et al.</i>, “Generating synthetic task-based brain fingerprints for population neuroscience using deep learning,” <i>Communications Biology</i>, vol. 8. Springer Nature, 2025.","ama":"Serin E, Ritter K, Schumann G, et al. Generating synthetic task-based brain fingerprints for population neuroscience using deep learning. <i>Communications Biology</i>. 2025;8. doi:<a href=\"https://doi.org/10.1038/s42003-025-09158-6\">10.1038/s42003-025-09158-6</a>"},"acknowledgement":"Funded by the European Union (Grant agreement No 101057429). Complementary funding was received by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding guarantee (10131373 and 10038599) and the National Key R&D Program of Ministry of Science and Technology of China (MOST 2023YFE0199700). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union, the European Health and Digital Executive Agency (HADEA), UKRI or MOST. Neither the European Union nor HADEA nor UKRI nor MOST can be held responsible for them. This work has also been supported by a Grant from the German Research Foundation to the ENIGMA task-based fMRI Working Group (DFG ER 724/4–1, WA 1539/11–1). Data used in this study were provided in part by the Human Connectome Project, WU-Minn Consortium (principal investigators: D. Van Essen and K. Ugurbil; grant number 1U54MH091657), funded by the 16 National Institutes of Health (NIH) institutes and centers supporting the NIH Blueprint for Neuroscience Research, and by the McDonnell Center for Systems Neuroscience at Washington University. Additionally, this research utilized data obtained from UK Biobank, a large-scale biomedical database. Open Access funding enabled and organized by Projekt DEAL.","DOAJ_listed":"1","OA_place":"publisher","abstract":[{"text":"Task-based functional magnetic resonance imaging (fMRI) reveals individual differences in neural correlates of cognition but faces scalability challenges due to cognitive demands, protocol variability, and limited task coverage in large datasets. Here, we propose DeepTaskGen, a deep-learning approach that synthesizes non-acquired task-based contrast maps from resting-state (rs-) fMRI. We validate this approach using the Human Connectome Project lifespan data, then generate 47 contrast maps from 7 different cognitive tasks for over 20,000 individuals from UK Biobank. DeepTaskGen outperforms several benchmarks in generating synthetic task-contrast maps, achieving superior reconstruction performance while retaining inter-individual variation essential for biomarker development. We further show comparable or superior predictive performance of synthetic maps relative to actual maps and rs-connectomes across diverse demographic, cognitive, and clinical variables. This approach facilitates the study of individual differences and the generation of task-related biomarkers by enabling the generation of arbitrary functional cognitive tasks from readily available rs-fMRI data.","lang":"eng"}],"year":"2025","title":"Generating synthetic task-based brain fingerprints for population neuroscience using deep learning","status":"public","language":[{"iso":"eng"}],"intvolume":"         8","fulldoi":"https://doi.org/10.1038/s42003-025-09158-6","article_number":"1572","scopus_import":"1","oa":1,"author":[{"last_name":"Serin","full_name":"Serin, Emin","first_name":"Emin"},{"first_name":"Kerstin","full_name":"Ritter, Kerstin","last_name":"Ritter"},{"first_name":"Gunter","full_name":"Schumann, Gunter","last_name":"Schumann"},{"first_name":"Tobias","full_name":"Banaschewski, Tobias","last_name":"Banaschewski"},{"last_name":"Marquand","full_name":"Marquand, Andre","first_name":"Andre"},{"full_name":"Walter, Henrik","last_name":"Walter","first_name":"Henrik"},{"last_name":"Ogoh","full_name":"Ogoh, George","first_name":"George"},{"first_name":"Bernd Carsten","last_name":"Stahl","full_name":"Stahl, Bernd Carsten"},{"first_name":"Ragnhild","last_name":"Brandlistuen","full_name":"Brandlistuen, Ragnhild"},{"first_name":"Tamara","last_name":"Schikowski","full_name":"Schikowski, Tamara"},{"full_name":"Young, Allan H.","last_name":"Young","first_name":"Allan H."},{"first_name":"Yu","last_name":"Xinyang","full_name":"Xinyang, Yu"},{"first_name":"Zuo","last_name":"Zhang","full_name":"Zhang, Zuo"},{"first_name":"Kofoworola","last_name":"Agunbiade","full_name":"Agunbiade, Kofoworola"},{"last_name":"Chen","full_name":"Chen, Di","first_name":"Di"},{"first_name":"Sylvane","last_name":"Desrivières","full_name":"Desrivières, Sylvane"},{"last_name":"Clinton","full_name":"Clinton, Nicholas","first_name":"Nicholas"},{"last_name":"Thompson","full_name":"Thompson, Paul","first_name":"Paul"},{"first_name":"Venessa","last_name":"Köhler","full_name":"Köhler, Venessa"},{"last_name":"Schwalber","full_name":"Schwalber, Ameli","first_name":"Ameli"},{"first_name":"Vince D.","last_name":"Calhoun","full_name":"Calhoun, Vince D."},{"first_name":"Xiao","last_name":"Chang","full_name":"Chang, Xiao"},{"full_name":"Zhang, Yanqing","last_name":"Zhang","first_name":"Yanqing"},{"first_name":"Yuzhu","last_name":"Li","full_name":"Li, Yuzhu"},{"last_name":"Dai","full_name":"Dai, Yuxiang","first_name":"Yuxiang"},{"last_name":"Yuan","full_name":"Yuan, Jiacan","first_name":"Jiacan"},{"first_name":"Yunman","full_name":"Xia, Yunman","last_name":"Xia"},{"last_name":"Jia","full_name":"Jia, Tianye","first_name":"Tianye"},{"first_name":"Paul","full_name":"Renner, Paul","last_name":"Renner"},{"first_name":"Sören","full_name":"Hese, Sören","last_name":"Hese"},{"last_name":"Spanlang","full_name":"Spanlang, Bernhard","first_name":"Bernhard"},{"last_name":"Pearmund","full_name":"Pearmund, Charlie","first_name":"Charlie"},{"full_name":"Athanasiadis, Anastasios Polykarpos","last_name":"Athanasiadis","first_name":"Anastasios Polykarpos"},{"full_name":"Petkoski, Spase","last_name":"Petkoski","first_name":"Spase"},{"first_name":"Viktor","full_name":"Jirsa, Viktor","last_name":"Jirsa"},{"first_name":"Karen","last_name":"Schmitt","full_name":"Schmitt, Karen"},{"last_name":"Wilbertz","full_name":"Wilbertz, Johannes H.","first_name":"Johannes H."},{"first_name":"Myrto","full_name":"Patraskaki, Myrto","last_name":"Patraskaki"},{"full_name":"Sommer, Peter","last_name":"Sommer","first_name":"Peter"},{"last_name":"Heilmann-Heimbach","full_name":"Heilmann-Heimbach, Stefanie","first_name":"Stefanie"},{"full_name":"Mathey, Carina M.","last_name":"Mathey","first_name":"Carina M."},{"first_name":"Abigail J.","full_name":"Miller, Abigail J.","last_name":"Miller"},{"first_name":"Isabelle","last_name":"Claus","full_name":"Claus, Isabelle"},{"last_name":"Nöthen","full_name":"Nöthen, Markus M.","first_name":"Markus M."},{"first_name":"Per","last_name":"Hoffmann","full_name":"Hoffmann, Per"},{"last_name":"Forstner","full_name":"Forstner, Andreas J.","first_name":"Andreas J."},{"first_name":"Alvaro","last_name":"Pastor","full_name":"Pastor, Alvaro"},{"first_name":"Jaime","last_name":"Gallego","full_name":"Gallego, Jaime"},{"last_name":"Itatani","full_name":"Itatani, Reiya","first_name":"Reiya"},{"last_name":"Eiroa-Orosa","full_name":"Eiroa-Orosa, Francisco","first_name":"Francisco"},{"last_name":"Feixas","full_name":"Feixas, Guillem","first_name":"Guillem"},{"first_name":"Mel","full_name":"Slater, Mel","last_name":"Slater"},{"full_name":"Novarino, Gaia","last_name":"Novarino","orcid":"0000-0002-7673-7178","first_name":"Gaia","id":"3E57A680-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Sarah Jane","full_name":"Böttger, Sarah Jane","last_name":"Böttger"},{"full_name":"Tschorn, Mira","last_name":"Tschorn","first_name":"Mira"},{"last_name":"Rapp","full_name":"Rapp, Michael","first_name":"Michael"},{"first_name":"Helga","full_name":"Ask, Helga","last_name":"Ask"},{"first_name":"Rikka","last_name":"Kjelkenes","full_name":"Kjelkenes, Rikka"},{"first_name":"Sara","last_name":"Fernandez","full_name":"Fernandez, Sara"},{"full_name":"Van Der Meer, Dennis","last_name":"Van Der Meer","first_name":"Dennis"},{"first_name":"Lars T.","last_name":"Westlye","full_name":"Westlye, Lars T."},{"full_name":"Andreassen, Ole A.","last_name":"Andreassen","first_name":"Ole A."},{"full_name":"Aden, Rieke","last_name":"Aden","first_name":"Rieke"},{"last_name":"Seefried","full_name":"Seefried, Beke","first_name":"Beke"},{"first_name":"Frauke","full_name":"Nees, Frauke","last_name":"Nees"},{"full_name":"Neidhart, Maja","last_name":"Neidhart","first_name":"Maja"},{"first_name":"Argyris","last_name":"Stringaris","full_name":"Stringaris, Argyris"},{"last_name":"Schwarz","full_name":"Schwarz, Emanuel","first_name":"Emanuel"},{"first_name":"Nathalie","full_name":"Holz, Nathalie","last_name":"Holz"},{"last_name":"Tost","full_name":"Tost, Heike","first_name":"Heike"},{"full_name":"Meyer-Lindenberg, Andreas","last_name":"Meyer-Lindenberg","first_name":"Andreas"},{"full_name":"Christmann, Nina","last_name":"Christmann","first_name":"Nina"},{"last_name":"Janson","full_name":"Janson, Karina","first_name":"Karina"},{"first_name":"Kerstin","full_name":"Schepanski, Kerstin","last_name":"Schepanski"},{"first_name":"Tatjana","last_name":"Schütz","full_name":"Schütz, Tatjana"},{"first_name":"Ulrike Helene","last_name":"Taron","full_name":"Taron, Ulrike Helene"},{"last_name":"Eils","full_name":"Eils, Roland","first_name":"Roland"},{"first_name":"Jean Charles","full_name":"Roy, Jean Charles","last_name":"Roy"},{"first_name":"Tristram A.","full_name":"Lett, Tristram A.","last_name":"Lett"},{"first_name":"Hedi","full_name":"Kebir, Hedi","last_name":"Kebir"},{"first_name":"Elli","full_name":"Polemiti, Elli","last_name":"Polemiti"},{"first_name":"Esther","last_name":"Hitchen","full_name":"Hitchen, Esther"},{"first_name":"Marcel","full_name":"Jentsch, Marcel","last_name":"Jentsch"},{"full_name":"Serin, Emin","last_name":"Serin","first_name":"Emin"},{"last_name":"Bernas","full_name":"Bernas, Antoine","first_name":"Antoine"},{"last_name":"Vaidya","full_name":"Vaidya, Nilakshi","first_name":"Nilakshi"},{"first_name":"Sven","last_name":"Twardziok","full_name":"Twardziok, Sven"},{"first_name":"Markus","last_name":"Ralser","full_name":"Ralser, Markus"},{"full_name":"Heinz, Andreas","last_name":"Heinz","first_name":"Andreas"},{"first_name":"Gunter","full_name":"Schumann, Gunter","last_name":"Schumann"}],"article_processing_charge":"Yes","OA_type":"gold","department":[{"_id":"GaNo"}],"article_type":"original","oa_version":"Published Version","pmid":1,"publisher":"Springer Nature","file_date_updated":"2025-11-24T09:12:19Z","ddc":["570"],"volume":8,"related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1038/s42003-026-10937-y"}]},"PlanS_conform":"1","date_updated":"2026-10-12T11:59:45Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2025-11-23T23:01:38Z"},{"citation":{"mla":"Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17, doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>.","chicago":"Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini. “ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>.","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.","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.","ama":"Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria in multi-player stochastic graph games. In: <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>. Vol 360. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:<a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">10.4230/lipics.fsttcs.2025.9</a>","ieee":"A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash equilibria in multi-player stochastic graph games,” in <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i>, Pilani, India, 2025, vol. 360, p. 9:1-9:17.","apa":"Asadi, A., Brice, L., Chatterjee, K., &#38; Thejaswini, K. S. (2025). ε-stationary Nash equilibria in multi-player stochastic graph games. In <i>45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science</i> (Vol. 360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/lipics.fsttcs.2025.9\">https://doi.org/10.4230/lipics.fsttcs.2025.9</a>"},"day":"09","alternative_title":["LIPIcs"],"publication":"45th Annual Conference on Foundations of Software Technology and Theoretical Computer Science","quality_controlled":"1","_id":"21281","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2026-02-18T09:13:25Z","file_size":1054007,"creator":"dernst","content_type":"application/pdf","date_created":"2026-02-18T09:13:25Z","access_level":"open_access","checksum":"a66343e3ccc4a9cc5bc699c03d5764ff","relation":"main_file","file_name":"2025_FSTTCS_Asadi.pdf","file_id":"21316","success":1}],"has_accepted_license":"1","publication_status":"published","status":"public","title":"ε-stationary Nash equilibria in multi-player stochastic graph games","corr_author":"1","year":"2025","abstract":[{"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.","lang":"eng"}],"conference":{"location":"Pilani, India","start_date":"2025-12-17","name":"FSTTCS: Conference on Foundations of Software Technology and Theoretical Computer Science","end_date":"2025-12-19"},"OA_place":"publisher","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","ec_funded":1,"page":"9:1-9:17","type":"conference","month":"12","arxiv":1,"date_published":"2025-12-09T00:00:00Z","doi":"10.4230/lipics.fsttcs.2025.9","publication_identifier":{"isbn":["9783959774062"]},"external_id":{"arxiv":["2508.15356"]},"volume":360,"file_date_updated":"2026-02-18T09:13:25Z","ddc":["000"],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","oa_version":"Published Version","date_created":"2026-02-17T08:27:14Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-12T13:38:13Z","related_material":{"record":[{"id":"23079","relation":"dissertation_contains","status":"public"}]},"project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093"}],"fulldoi":"https://doi.org/10.4230/lipics.fsttcs.2025.9","intvolume":"       360","language":[{"iso":"eng"}],"article_processing_charge":"Yes","department":[{"_id":"KrCh"},{"_id":"GradSch"}],"author":[{"first_name":"Ali","id":"02d96aae-000e-11ec-b801-cadd0a5eefbb","full_name":"Asadi, Ali","last_name":"Asadi"},{"first_name":"Leonard","full_name":"Brice, Leonard","last_name":"Brice"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Thejaswini","full_name":"Thejaswini, K. S.","id":"3807fb92-fdc1-11ee-bb4a-b4d8a431c753","first_name":"K. S."}],"OA_type":"gold","oa":1},{"publication_identifier":{"eisbn":["978-3-99078-054-1"],"eissn":["2663-337X"]},"doi_confirm":"1","date_published":"2025-03-13T00:00:00Z","doi":"10.15479/AT-ISTA-19395","month":"03","page":"160","type":"dissertation","acknowledgement":"I would like to acknowledge the facilities at ISTA, particularly LSF, IOF, and, of course, the plant facility, for providing the necessary resources for my research.","OA_place":"publisher","status":"public","title":"Cell-surface auxin signaling: Linking molecular pathways to plant development","corr_author":"1","year":"2025","abstract":[{"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.","lang":"eng"}],"file":[{"relation":"main_file","checksum":"9a3dd03bb4ec6b9907a325c3c4e8a1d7","success":1,"file_id":"19396","file_name":"Final Thesis Aline Monzer.pdf","file_size":13119670,"date_updated":"2025-03-12T14:14:49Z","access_level":"open_access","date_created":"2025-03-12T14:14:49Z","creator":"amonzer","content_type":"application/pdf"},{"file_id":"19397","file_name":"Thesis Aline.docx","relation":"source_file","checksum":"a353ce1ee2eabce37bca35499e76dbf1","access_level":"closed","date_created":"2025-03-12T14:15:19Z","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"amonzer","file_size":13774837,"date_updated":"2025-04-01T07:55:27Z"}],"has_accepted_license":"1","publication_status":"published","citation":{"apa":"Monzer, A. (2025). <i>Cell-surface auxin signaling: Linking molecular pathways to plant development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-19395\">https://doi.org/10.15479/AT-ISTA-19395</a>","ieee":"A. Monzer, “Cell-surface auxin signaling: Linking molecular pathways to plant development,” Institute of Science and Technology Austria, 2025.","ama":"Monzer A. Cell-surface auxin signaling: Linking molecular pathways to plant development. 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19395\">10.15479/AT-ISTA-19395</a>","ista":"Monzer A. 2025. Cell-surface auxin signaling: Linking molecular pathways to plant development. Institute of Science and Technology Austria.","short":"A. Monzer, Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development, Institute of Science and Technology Austria, 2025.","chicago":"Monzer, Aline. “Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development.” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-19395\">https://doi.org/10.15479/AT-ISTA-19395</a>.","mla":"Monzer, Aline. <i>Cell-Surface Auxin Signaling: Linking Molecular Pathways to Plant Development</i>. Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-19395\">10.15479/AT-ISTA-19395</a>."},"day":"13","alternative_title":["ISTA Thesis"],"_id":"19395","supervisor":[{"last_name":"Friml","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596"}],"author":[{"first_name":"Aline","id":"2DB5D88C-D7B3-11E9-B8FD-7907E6697425","full_name":"Monzer, Aline","last_name":"Monzer"}],"article_processing_charge":"No","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}],"oa":1,"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.15479/AT-ISTA-19395","date_updated":"2026-10-15T08:06:16Z","related_material":{"record":[{"relation":"part_of_dissertation","id":"12291","status":"public"},{"status":"public","id":"19399","relation":"part_of_dissertation"},{"id":"19398","relation":"part_of_dissertation","status":"public"},{"status":"public","relation":"part_of_dissertation","id":"14826"}]},"date_created":"2025-03-12T14:25:42Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","degree_awarded":"PhD","publisher":"Institute of Science and Technology Austria","oa_version":"Published Version","ddc":["580"],"file_date_updated":"2025-04-01T07:55:27Z"},{"author":[{"full_name":"Yu, Hanlin","last_name":"Yu","first_name":"Hanlin"},{"full_name":"Inal, Befrin","last_name":"Inal","first_name":"Befrin"},{"first_name":"Georgios","last_name":"Arvanitidis","full_name":"Arvanitidis, Georgios"},{"last_name":"Hauberg","full_name":"Hauberg, Soren","first_name":"Soren"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","full_name":"Locatello, Francesco"},{"first_name":"Marco","id":"1c1593eb-393f-11ef-bb8e-ab4f1e979650","full_name":"Fumero, Marco","last_name":"Fumero"}],"article_processing_charge":"No","department":[{"_id":"FrLo"}],"OA_type":"free access","oa":1,"fulldoi":"https://doi.org/10.52202/085713-3769","project":[{"grant_number":"101034413","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"intvolume":"        38","language":[{"iso":"eng"}],"date_created":"2026-01-29T14:31:52Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-10-15T09:17:34Z","volume":38,"file_date_updated":"2026-01-29T14:31:42Z","ddc":["000"],"publisher":"Neural Information Processing Systems Foundation","oa_version":"Published Version","arxiv":1,"date_published":"2025-12-15T00:00:00Z","doi":"10.52202/085713-3769","publication_identifier":{"issn":["1049-5258"]},"external_id":{"arxiv":["2506.01599"]},"ec_funded":1,"type":"conference","month":"12","status":"public","title":"Connecting neural models latent geometries with relative geodesic representations","corr_author":"1","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."}],"year":"2025","conference":{"end_date":"2025-12-07","name":"NeurIPS: Neural Information Processing Systems","start_date":"2025-12-02","location":"San Diego, CA, United States"},"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.","OA_place":"publisher","day":"15","citation":{"ieee":"H. Yu, B. Inal, G. Arvanitidis, S. Hauberg, F. Locatello, and M. Fumero, “Connecting neural models latent geometries with relative geodesic representations,” in <i>39th Annual Conference on Neural Information Processing Systems</i>, San Diego, CA, United States, 2025, vol. 38.","ama":"Yu H, Inal B, Arvanitidis G, Hauberg S, Locatello F, Fumero M. Connecting neural models latent geometries with relative geodesic representations. In: <i>39th Annual Conference on Neural Information Processing Systems</i>. Vol 38. Neural Information Processing Systems Foundation; 2025. doi:<a href=\"https://doi.org/10.52202/085713-3769\">10.52202/085713-3769</a>","apa":"Yu, H., Inal, B., Arvanitidis, G., Hauberg, S., Locatello, F., &#38; Fumero, M. (2025). Connecting neural models latent geometries with relative geodesic representations. In <i>39th Annual Conference on Neural Information Processing Systems</i> (Vol. 38). San Diego, CA, United States: Neural Information Processing Systems Foundation. <a href=\"https://doi.org/10.52202/085713-3769\">https://doi.org/10.52202/085713-3769</a>","chicago":"Yu, Hanlin, Befrin Inal, Georgios Arvanitidis, Soren Hauberg, Francesco Locatello, and Marco Fumero. “Connecting Neural Models Latent Geometries with Relative Geodesic Representations.” In <i>39th Annual Conference on Neural Information Processing Systems</i>, Vol. 38. Neural Information Processing Systems Foundation, 2025. <a href=\"https://doi.org/10.52202/085713-3769\">https://doi.org/10.52202/085713-3769</a>.","mla":"Yu, Hanlin, et al. “Connecting Neural Models Latent Geometries with Relative Geodesic Representations.” <i>39th Annual Conference on Neural Information Processing Systems</i>, vol. 38, Neural Information Processing Systems Foundation, 2025, doi:<a href=\"https://doi.org/10.52202/085713-3769\">10.52202/085713-3769</a>.","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.","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."},"alternative_title":["Advances in Neural Information Processing Systems"],"publication":"39th Annual Conference on Neural Information Processing Systems","das_tickbox":"1","quality_controlled":"1","_id":"21074","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"date_updated":"2026-01-29T14:31:42Z","file_size":7749349,"date_created":"2026-01-29T14:31:42Z","access_level":"open_access","content_type":"application/pdf","creator":"flocatel","checksum":"b1a645418025f46394764cd16d0cb089","relation":"main_file","file_id":"21075","success":1,"file_name":"2506.01599v2.pdf"}],"has_accepted_license":"1","publication_status":"published"}]