[{"article_number":"72:1-72:17","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2603.16416"]},"publication_status":"published","acknowledgement":"Jakub Leśkiewicz wants to thank his supervisor, Prof. Marian Mrozek, forscientific guidance, patience, and opportunity to delay the rest of his duties while writing this work.\r\nThe author also extends thanks to his entire family, to Zuzanna Świątek, and to Mikołaj Kardyś,\r\nBEng, MSc, for providing meals during the most intensive periods of work. Jakub Leśkiewicz: The research was partially funded by the Polish National Science Center under Opus Grant No. 2019/35/B/ST1/00874 and Opus Grant 2025/57/B/ST1/00550. Bartosz Furmanek: The research was partially funded by the Polish National Science Center under Opus Grant No. 2019/35/B/ST1/00874 and Opus Grant 2025/57/B/ST1/00550. Michał Lipiński: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. \r\nDmitriy Morozov: This work was supported in part by the U.S. Department of Energy, Office\r\nof Science, Office of Advanced Scientific Computing Research, under Contract No. DE-AC02-\r\n05CH11231.","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2026-06-22T07:39:21Z","OA_place":"publisher","title":"Topological simplification guided by forbidden regions","citation":{"ama":"Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. Topological simplification guided by forbidden regions. In: <i>42nd International Symposium on Computational Geometry</i>. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.72\">10.4230/LIPIcs.SoCG.2026.72</a>","apa":"Leśkiewicz, J., Furmanek, B., Lipiński, M., &#38; Morozov, D. (2026). Topological simplification guided by forbidden regions. In <i>42nd International Symposium on Computational Geometry</i> (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.72\">https://doi.org/10.4230/LIPIcs.SoCG.2026.72</a>","short":"J. Leśkiewicz, B. Furmanek, M. Lipiński, D. Morozov, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","mla":"Leśkiewicz, Jakub, et al. “Topological Simplification Guided by Forbidden Regions.” <i>42nd International Symposium on Computational Geometry</i>, vol. 367, 72:1-72:17, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.72\">10.4230/LIPIcs.SoCG.2026.72</a>.","ista":"Leśkiewicz J, Furmanek B, Lipiński M, Morozov D. 2026. Topological simplification guided by forbidden regions. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 72:1-72:17.","ieee":"J. Leśkiewicz, B. Furmanek, M. Lipiński, and D. Morozov, “Topological simplification guided by forbidden regions,” in <i>42nd International Symposium on Computational Geometry</i>, New Brunswick, NJ, United States, 2026, vol. 367.","chicago":"Leśkiewicz, Jakub, Bartosz Furmanek, Michał Lipiński, and Dmitriy Morozov. “Topological Simplification Guided by Forbidden Regions.” In <i>42nd International Symposium on Computational Geometry</i>, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.72\">https://doi.org/10.4230/LIPIcs.SoCG.2026.72</a>."},"_id":"22002","oa_version":"Published Version","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"}],"oa":1,"date_updated":"2026-06-22T07:45:36Z","doi":"10.4230/LIPIcs.SoCG.2026.72","volume":367,"article_processing_charge":"No","date_published":"2026-05-27T00:00:00Z","publication":"42nd International Symposium on Computational Geometry","ddc":["500"],"intvolume":"       367","corr_author":"1","type":"conference","arxiv":1,"OA_type":"gold","scopus_import":"1","conference":{"end_date":"2026-06-05","name":"SoCG: Symposium on Computational Geometry","start_date":"2026-06-02","location":"New Brunswick, NJ, United States"},"abstract":[{"lang":"eng","text":"Topological simplification is the process of reducing complexity of a function while maintaining its essential features. Its goal is to find a new filter function, which reorders cells of the input complex in a way which eliminates some persistent homological features, without affecting the rest. We present a new approach to simplification based on the concept of forbidden regions and combinatorial dynamics. It allows us to reorder and cancel critical values, whose cancellation is not possible using existing methods because they are not consecutive in the total order. Each such cancellation takes O(c⋅n) time in the worst case, where c is the number of birth-death pairs and n is the size of the input complex."}],"ec_funded":1,"quality_controlled":"1","alternative_title":["LIPIcs"],"publication_identifier":{"isbn":["9783959774185"],"eissn":["1868-8969"]},"year":"2026","file":[{"success":1,"content_type":"application/pdf","file_size":2052749,"creator":"dernst","checksum":"3be91c06fdf716c8735b6af64a09a921","date_created":"2026-06-22T07:39:21Z","relation":"main_file","file_name":"2026_LIPIcSSoCG_Leskiewicz.pdf","date_updated":"2026-06-22T07:39:21Z","access_level":"open_access","file_id":"22110"}],"author":[{"first_name":"Jakub","last_name":"Leśkiewicz","full_name":"Leśkiewicz, Jakub"},{"first_name":"Bartosz","full_name":"Furmanek, Bartosz","last_name":"Furmanek"},{"orcid":"0000-0001-9789-9750","last_name":"Lipiński","full_name":"Lipiński, Michał","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e","first_name":"Michał"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"}],"department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"date_created":"2026-06-14T22:01:43Z","das_tickbox":"0","keyword":["persistent homology","topological simplification","depth posets"],"month":"05"},{"date_updated":"2026-06-22T08:49:17Z","oa":1,"doi":"10.4230/LIPIcs.SoCG.2026.3","volume":367,"date_published":"2026-05-27T00:00:00Z","article_processing_charge":"Yes","corr_author":"1","intvolume":"       367","ddc":["500"],"publication":"42nd International Symposium on Computational Geometry","scopus_import":"1","OA_type":"gold","type":"conference","arxiv":1,"conference":{"location":"New Brunswick, NJ, United States","start_date":"2026-06-02","name":"SoCG: Symposium on Computational Geometry","end_date":"2026-06-05"},"quality_controlled":"1","abstract":[{"lang":"eng","text":"Let G be a finite, connected metric graph and let X be a subset of G. If X is sufficiently dense in G, we show that the Gromov-Hausdorff distance matches the Hausdorff distance, namely d_GH(G,X) = d_H(G,X). When the metric graph is the circle G = S¹ with circumference 2π, a recent study established the equality d_GH(S¹,X) = d_H(S¹,X) whenever d_GH(S¹,X) < π/6. Our results relax this hypothesis to d_GH(S¹,X) < π/3, and furthermore, we show that the constant π/3 is the best possible. We lower bound the Gromov-Hausdorff distance d_GH(G,X) by the Hausdorff distance d_H(G,X) via a simple topological obstruction: the existence of a possibly discontinuous function f: G → X with too small distortion contradicts the connectedness of G."}],"publication_identifier":{"isbn":["9783959774185"],"eissn":["1868-8969"]},"alternative_title":["LIPIcs"],"year":"2026","file":[{"date_created":"2026-06-22T08:43:47Z","checksum":"25d27c016409563196b8aecfe5bfdf41","creator":"dernst","success":1,"file_size":1091310,"content_type":"application/pdf","file_id":"22115","access_level":"open_access","date_updated":"2026-06-22T08:43:47Z","file_name":"2026_LIPIcSSoCG_Adams.pdf","relation":"main_file"}],"department":[{"_id":"HeEd"}],"date_created":"2026-06-14T22:01:44Z","language":[{"iso":"eng"}],"author":[{"first_name":"Henry","last_name":"Adams","full_name":"Adams, Henry"},{"first_name":"Sushovan","full_name":"Majhi, Sushovan","last_name":"Majhi"},{"last_name":"Manin","full_name":"Manin, Fedor","first_name":"Fedor"},{"first_name":"Ziga","id":"2E36B656-F248-11E8-B48F-1D18A9856A87","full_name":"Virk, Ziga","last_name":"Virk"},{"first_name":"Nicolò","id":"c8b3499c-7a77-11eb-b046-aa368cbbf2ad","full_name":"Zava, Nicolò","orcid":"0000-0001-8686-1888","last_name":"Zava"}],"das_tickbox":"0","keyword":["Gromov–Hausdorff distance","distortion","connectedness","Borsuk–Ulam theorem"],"month":"05","article_number":"3:1-3:16","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","has_accepted_license":"1","status":"public","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2411.09182"]},"publication_status":"published","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Funding Henry Adams: Simons Foundation Travel Support for Mathematicians.\r\nŽiga Virk: Slovene research agency grant P1-0292.\r\nNicolò Zava: FWF Grant, Project number I4245-N35.\r\n","OA_place":"publisher","file_date_updated":"2026-06-22T08:43:47Z","title":"Lower bounding the Gromov–Hausdorff distance in metric graphs","citation":{"mla":"Adams, Henry, et al. “Lower Bounding the Gromov–Hausdorff Distance in Metric Graphs.” <i>42nd International Symposium on Computational Geometry</i>, vol. 367, 3:1-3:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.3\">10.4230/LIPIcs.SoCG.2026.3</a>.","short":"H. Adams, S. Majhi, F. Manin, Z. Virk, N. Zava, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.","chicago":"Adams, Henry, Sushovan Majhi, Fedor Manin, Ziga Virk, and Nicolò Zava. “Lower Bounding the Gromov–Hausdorff Distance in Metric Graphs.” In <i>42nd International Symposium on Computational Geometry</i>, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.3\">https://doi.org/10.4230/LIPIcs.SoCG.2026.3</a>.","ista":"Adams H, Majhi S, Manin F, Virk Z, Zava N. 2026. Lower bounding the Gromov–Hausdorff distance in metric graphs. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 3:1-3:16.","ieee":"H. Adams, S. Majhi, F. Manin, Z. Virk, and N. Zava, “Lower bounding the Gromov–Hausdorff distance in metric graphs,” in <i>42nd International Symposium on Computational Geometry</i>, New Brunswick, NJ, United States, 2026, vol. 367.","ama":"Adams H, Majhi S, Manin F, Virk Z, Zava N. Lower bounding the Gromov–Hausdorff distance in metric graphs. In: <i>42nd International Symposium on Computational Geometry</i>. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.3\">10.4230/LIPIcs.SoCG.2026.3</a>","apa":"Adams, H., Majhi, S., Manin, F., Virk, Z., &#38; Zava, N. (2026). Lower bounding the Gromov–Hausdorff distance in metric graphs. In <i>42nd International Symposium on Computational Geometry</i> (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.3\">https://doi.org/10.4230/LIPIcs.SoCG.2026.3</a>"},"_id":"22003","oa_version":"Published Version","project":[{"call_identifier":"FWF","_id":"26AD5D90-B435-11E9-9278-68D0E5697425","grant_number":"I04245","name":"Algebraic Footprints of Geometric Features in Homology"}]},{"department":[{"_id":"MoHe"}],"language":[{"iso":"eng"}],"date_created":"2026-06-14T22:01:44Z","author":[{"first_name":"Timothy M.","full_name":"Chan, Timothy M.","last_name":"Chan"},{"first_name":"Hsien Chih","last_name":"Chang","full_name":"Chang, Hsien Chih"},{"last_name":"Gao","full_name":"Gao, Jie","first_name":"Jie"},{"full_name":"Kisfaludi-Bak, Sándor","last_name":"Kisfaludi-Bak","first_name":"Sándor"},{"full_name":"Le, Hung","last_name":"Le","first_name":"Hung"},{"last_name":"Zheng","full_name":"Zheng, Da Wei","id":"af77956b-e859-11ef-8dc9-d301b898e32f","first_name":"Da Wei"}],"file":[{"file_id":"22114","access_level":"open_access","date_updated":"2026-06-22T08:34:11Z","file_name":"2026_LIPIcSSoCG_Chan.pdf","relation":"main_file","date_created":"2026-06-22T08:34:11Z","checksum":"ffff03934cc182757d6db82d88f896e6","creator":"dernst","content_type":"application/pdf","file_size":918197,"success":1}],"keyword":["Graph Diameter","Geometric Intersection Graphs","Unit Ball Graphs"],"month":"05","das_tickbox":"0","publication_identifier":{"isbn":["9783959774185"],"eissn":["1868-8969"]},"alternative_title":["LIPIcs"],"year":"2026","scopus_import":"1","OA_type":"gold","type":"conference","arxiv":1,"intvolume":"       367","corr_author":"1","ddc":["000"],"publication":"42nd International Symposium on Computational Geometry","quality_controlled":"1","abstract":[{"text":"Recent research on computing the diameter of geometric intersection graphs has made significant strides, primarily focusing on the 2D case [Duraj et al., 2024; Hsien-Chih Chang et al., 2024; Chan et al., 2025] where truly subquadratic-time algorithms were given for simple objects such as unit-disks and (axis-aligned) squares. However, in three or higher dimensions, there is no known truly subquadratic-time algorithm for any intersection graph of non-trivial objects, even basic ones such as unit balls or (axis-aligned) unit cubes. This was partially explained by the pioneering work of Bringmann et al. [Karl Bringmann et al., 2022] which gave several truly subquadratic lower bounds, notably for unit balls or unit cubes in 3D when the graph diameter Δ is at least Ω(log n), hinting at a pessimistic outlook for the complexity of the diameter problem in higher dimensions. In this paper, we substantially extend the landscape of diameter computation for objects in three and higher dimensions, giving a few positive results. Our highlighted findings include:  \r\n1) A truly subquadratic-time algorithm for deciding if the diameter of unit cubes in 3D is at most 3 (Diameter-3 hereafter), the first algorithm of its kind for objects in 3D or higher dimensions. Our algorithm is based on a novel connection to pseudolines, which is of independent interest. \r\n2) A truly subquadratic time lower bound for Diameter-3 of unit balls in 3D under the Orthogonal Vector (OV) hypothesis, giving the first separation between unit balls and unit cubes in the small diameter regime. Previously, computing the diameter for both objects was known to be quadratic hard when the diameter is Ω(log n) [Karl Bringmann et al., 2022]. \r\n3) A near-linear-time algorithm for Diameter-2 of unit cubes in 3D, generalizing the previous result for unit squares in 2D [Karl Bringmann et al., 2022]. \r\n4) A truly subquadratic-time algorithm and lower bound for Diameter-2 and Diameter-3 of rectangular boxes (of arbitrary dimension and sizes), respectively.","lang":"eng"}],"conference":{"location":"New Brunswick, NJ, United States","start_date":"2026-06-02","name":"SoCG: Symposium on Computational Geometry","end_date":"2026-06-05"},"volume":367,"doi":"10.4230/LIPIcs.SoCG.2026.29","date_updated":"2026-06-22T08:37:44Z","oa":1,"date_published":"2026-05-27T00:00:00Z","article_processing_charge":"Yes","citation":{"apa":"Chan, T. M., Chang, H. C., Gao, J., Kisfaludi-Bak, S., Le, H., &#38; Zheng, D. W. (2026). Charting the diameter computation landscape of intersection graphs in 3D and above. In <i>42nd International Symposium on Computational Geometry</i> (Vol. 367). New Brunswick, NJ, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.29\">https://doi.org/10.4230/LIPIcs.SoCG.2026.29</a>","ama":"Chan TM, Chang HC, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. Charting the diameter computation landscape of intersection graphs in 3D and above. In: <i>42nd International Symposium on Computational Geometry</i>. Vol 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.29\">10.4230/LIPIcs.SoCG.2026.29</a>","ista":"Chan TM, Chang HC, Gao J, Kisfaludi-Bak S, Le H, Zheng DW. 2026. Charting the diameter computation landscape of intersection graphs in 3D and above. 42nd International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 367, 29:1-29:15.","chicago":"Chan, Timothy M., Hsien Chih Chang, Jie Gao, Sándor Kisfaludi-Bak, Hung Le, and Da Wei Zheng. “Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above.” In <i>42nd International Symposium on Computational Geometry</i>, Vol. 367. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.29\">https://doi.org/10.4230/LIPIcs.SoCG.2026.29</a>.","ieee":"T. M. Chan, H. C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, and D. W. Zheng, “Charting the diameter computation landscape of intersection graphs in 3D and above,” in <i>42nd International Symposium on Computational Geometry</i>, New Brunswick, NJ, United States, 2026, vol. 367.","mla":"Chan, Timothy M., et al. “Charting the Diameter Computation Landscape of Intersection Graphs in 3D and Above.” <i>42nd International Symposium on Computational Geometry</i>, vol. 367, 29:1-29:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2026.29\">10.4230/LIPIcs.SoCG.2026.29</a>.","short":"T.M. Chan, H.C. Chang, J. Gao, S. Kisfaludi-Bak, H. Le, D.W. Zheng, in:, 42nd International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"project":[{"name":"Static and Dynamic Hierarchical Graph Decompositions","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","grant_number":"I05982"}],"oa_version":"Published Version","_id":"22004","title":"Charting the diameter computation landscape of intersection graphs in 3D and above","OA_place":"publisher","file_date_updated":"2026-06-22T08:34:11Z","publication_status":"published","day":"27","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"Timothy M. Chan: Supported by NSF grant CCF-2224271.\r\nHsien-Chih Chang: Supported by NSF CAREER award CCF-2443017.\r\nJie Gao: Supported by NSF DMS-2220271, DMS-2311064, IIS-2229876, CCF-2118953, CNS-2515159.\r\nSándor Kisfaludi-Bak: Supported by the Research Council of Finland, Grant 363444.\r\nHung Le: Supported by an NSF grant CCF-2517033 and an NSF CAREER Award CCF-2237288. Da Wei Zheng: This project has received funding from the Austrian Science Fund (FWF) grant\r\nDOI 10.55776/I5982. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","status":"public","has_accepted_license":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","article_number":"29:1-29:15","external_id":{"arxiv":["2603.21790"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"}},{"das_tickbox":"0","month":"05","keyword":["Signal first-order logic","Robustness-based quantitative semantics","Online runtime monitoring"],"file":[{"date_updated":"2026-06-22T08:18:41Z","access_level":"open_access","file_id":"22113","relation":"main_file","file_name":"2026_LNCS_Chalupa.pdf","creator":"dernst","checksum":"7055199ecb985e9e2e272f4988827067","date_created":"2026-06-22T08:18:41Z","file_size":849237,"success":1,"content_type":"application/pdf"}],"page":"214-233","date_created":"2026-06-14T22:01:44Z","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"full_name":"Sarac, Naci E","last_name":"Sarac","first_name":"Naci E","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425"},{"first_name":"Zhengqi","id":"20aa2ae8-f2f1-11ed-bbfa-8205053f1342","full_name":"Yu, Zhengqi","orcid":"0000-0002-4993-773X","last_name":"Yu"}],"year":"2026","publication_identifier":{"isbn":["9783032262196"],"eissn":["1611-3349"],"issn":["0302-9743"]},"alternative_title":["LNCS"],"conference":{"start_date":"2026-05-18","location":"Tokyo, Japan","end_date":"2026-05-22","name":"FM: Formal Methods"},"quality_controlled":"1","ec_funded":1,"abstract":[{"text":"Runtime monitoring checks, during execution, whether a partial signal produced by a hybrid system satisfies its specification. Signal First-Order Logic (SFO) offers expressive real-time specifications over such signals, but currently comes only with Boolean semantics and has no tool support. We provide the first robustness-based quantitative semantics for SFO, enabling the expression and evaluation of rich real-time properties beyond the scope of existing formalisms such as Signal Temporal Logic. To enable online monitoring, we identify a past-time fragment of SFO and give a pastification procedure that transforms bounded-response SFO formulas into equisatisfiable formulas in this fragment. We then develop an efficient runtime monitoring algorithm for this past-time fragment and evaluate its performance on a set of benchmarks, demonstrating the practicality and effectiveness of our approach. To the best of our knowledge, this is the first publicly available prototype for online quantitative monitoring of full SFO.","lang":"eng"}],"intvolume":"     16557","publication":"27th International Symposium on Formal Methods","ddc":["000"],"OA_type":"hybrid","type":"conference","arxiv":1,"scopus_import":"1","date_published":"2026-05-18T00:00:00Z","article_processing_charge":"No","date_updated":"2026-06-22T08:21:09Z","oa":1,"doi":"10.1007/978-3-032-26220-2_11","volume":16557,"oa_version":"Published Version","_id":"22006","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"citation":{"apa":"Chalupa, M., Henzinger, T. A., Sarac, N. E., &#38; Yu, E. (2026). Quantitative monitoring of Signal First-Order logic. In <i>27th International Symposium on Formal Methods</i> (Vol. 16557, pp. 214–233). Tokyo, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>","ama":"Chalupa M, Henzinger TA, Sarac NE, Yu E. Quantitative monitoring of Signal First-Order logic. In: <i>27th International Symposium on Formal Methods</i>. Vol 16557. Springer Nature; 2026:214-233. doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>","ista":"Chalupa M, Henzinger TA, Sarac NE, Yu E. 2026. Quantitative monitoring of Signal First-Order logic. 27th International Symposium on Formal Methods. FM: Formal Methods, LNCS, vol. 16557, 214–233.","ieee":"M. Chalupa, T. A. Henzinger, N. E. Sarac, and E. Yu, “Quantitative monitoring of Signal First-Order logic,” in <i>27th International Symposium on Formal Methods</i>, Tokyo, Japan, 2026, vol. 16557, pp. 214–233.","chicago":"Chalupa, Marek, Thomas A Henzinger, Naci E Sarac, and Emily Yu. “Quantitative Monitoring of Signal First-Order Logic.” In <i>27th International Symposium on Formal Methods</i>, 16557:214–33. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">https://doi.org/10.1007/978-3-032-26220-2_11</a>.","short":"M. Chalupa, T.A. Henzinger, N.E. Sarac, E. Yu, in:, 27th International Symposium on Formal Methods, Springer Nature, 2026, pp. 214–233.","mla":"Chalupa, Marek, et al. “Quantitative Monitoring of Signal First-Order Logic.” <i>27th International Symposium on Formal Methods</i>, vol. 16557, Springer Nature, 2026, pp. 214–33, doi:<a href=\"https://doi.org/10.1007/978-3-032-26220-2_11\">10.1007/978-3-032-26220-2_11</a>."},"OA_place":"publisher","file_date_updated":"2026-06-22T08:18:41Z","title":"Quantitative monitoring of Signal First-Order logic","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"18","acknowledgement":"We thank the anonymous reviewers for their helpful comments. This work was supported by the European Research Council (ERC) Grants VAMOS (No. 101020093) and HYPER (No. 101055412), and by the Advanced Research and Invention Agency under the Safeguarded AI programme (MSAI-PR01-P047).","publication_status":"published","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2603.00728"]},"publisher":"Springer Nature","has_accepted_license":"1","status":"public"},{"status":"public","has_accepted_license":"1","article_number":"201","publisher":"Springer Nature","external_id":{"arxiv":["2506.23318"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_status":"published","day":"14","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"J.-L.Li thanks Gaoren Wang for valuable discussions on the absorbing boundary condition. G.M.K. thanks P. Giannakeas for fruitful discussions during the initial stages of this study. G.M.K. was funded by the Austrian Science Fund (FWF) [10.55776/F1004]. R.A. received funding from the Austrian Academy of Science ÖAW grant No. PR1029OEAW03. A.S. acknowledges funding from the European Union’s Horizon Europe research and innovation programme under grant agreement No. 101219560.","title":"Tunable field-linked s-wave interactions in dipolar fermi mixtures","OA_place":"publisher","PlanS_conform":"1","file_date_updated":"2026-06-24T06:09:35Z","citation":{"ieee":"J. Li, G. Koutentakis, M. Hrast, M. Lemeshko, A. Schindewolf, and R. Al Hyder, “Tunable field-linked s-wave interactions in dipolar fermi mixtures,” <i>Communications Physics</i>, vol. 9. Springer Nature, 2026.","chicago":"Li, Jinglun, Georgios Koutentakis, Mateja Hrast, Mikhail Lemeshko, Andreas Schindewolf, and Ragheed Al Hyder. “Tunable Field-Linked s-Wave Interactions in Dipolar Fermi Mixtures.” <i>Communications Physics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s42005-026-02578-8\">https://doi.org/10.1038/s42005-026-02578-8</a>.","ista":"Li J, Koutentakis G, Hrast M, Lemeshko M, Schindewolf A, Al Hyder R. 2026. Tunable field-linked s-wave interactions in dipolar fermi mixtures. Communications Physics. 9, 201.","short":"J. Li, G. Koutentakis, M. Hrast, M. Lemeshko, A. Schindewolf, R. Al Hyder, Communications Physics 9 (2026).","mla":"Li, Jinglun, et al. “Tunable Field-Linked s-Wave Interactions in Dipolar Fermi Mixtures.” <i>Communications Physics</i>, vol. 9, 201, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s42005-026-02578-8\">10.1038/s42005-026-02578-8</a>.","apa":"Li, J., Koutentakis, G., Hrast, M., Lemeshko, M., Schindewolf, A., &#38; Al Hyder, R. (2026). Tunable field-linked s-wave interactions in dipolar fermi mixtures. <i>Communications Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42005-026-02578-8\">https://doi.org/10.1038/s42005-026-02578-8</a>","ama":"Li J, Koutentakis G, Hrast M, Lemeshko M, Schindewolf A, Al Hyder R. Tunable field-linked s-wave interactions in dipolar fermi mixtures. <i>Communications Physics</i>. 2026;9. doi:<a href=\"https://doi.org/10.1038/s42005-026-02578-8\">10.1038/s42005-026-02578-8</a>"},"project":[{"_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","grant_number":"F100403","name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions"},{"grant_number":"12078","_id":"8fa7db46-16d5-11f0-9cad-917600954daf","name":"Polarons in Lead Halide Perovskites"}],"_id":"22100","oa_version":"Published Version","volume":9,"doi":"10.1038/s42005-026-02578-8","date_updated":"2026-06-24T06:10:44Z","oa":1,"date_published":"2026-04-14T00:00:00Z","article_processing_charge":"Yes","OA_type":"gold","type":"journal_article","scopus_import":"1","arxiv":1,"DOAJ_listed":"1","intvolume":"         9","corr_author":"1","ddc":["530"],"publication":"Communications Physics","quality_controlled":"1","abstract":[{"lang":"eng","text":"Spin mixtures of degenerate fermions are a cornerstone of quantum many-body physics, enabling superfluidity, polarons, and rich spin dynamics through s-wave scattering resonances. Combining them with strong, long-range dipolar interactions provides highly flexible control schemes promising even more exotic quantum phases. Recently, microwave shielding gave access to spin-polarized degenerate samples of dipolar fermionic molecules, where tunable p-wave interactions were enabled by field-linked resonances available only by compromising the shielding (due to experimental limitations). Here, we study the scattering properties of a fermionic dipolar spin mixture and show that a universal s-wave resonance is readily accessible without compromising the shielding. We develop a universal description of the tunable s-wave interaction and weakly bound tetratomic states based on the microwave-field parameters. The s-wave resonance paves the way to stable, controllable and strongly-interacting dipolar spin mixtures of deeply degenerate fermions and supports favorable conditions to reach this regime via evaporative cooling."}],"article_type":"original","publication_identifier":{"eissn":["2399-3650"]},"year":"2026","department":[{"_id":"MiLe"}],"date_created":"2026-06-21T22:02:58Z","language":[{"iso":"eng"}],"researchdata_availability":"upon request","author":[{"last_name":"Li","full_name":"Li, Jinglun","id":"ff19510a-0d2c-11ef-b018-c338ad2f4325","first_name":"Jinglun"},{"first_name":"Georgios","id":"d7b23d3a-9e21-11ec-b482-f76739596b95","full_name":"Koutentakis, Georgios","last_name":"Koutentakis"},{"full_name":"Hrast, Mateja","last_name":"Hrast","first_name":"Mateja","id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"},{"first_name":"Andreas","full_name":"Schindewolf, Andreas","last_name":"Schindewolf"},{"id":"d1c405be-ae15-11ed-8510-ccf53278162e","first_name":"Ragheed","last_name":"Al Hyder","full_name":"Al Hyder, Ragheed"}],"file":[{"date_created":"2026-06-24T06:09:35Z","checksum":"3bf5852b54b9f13ec1679056a5f58c3a","creator":"dernst","success":1,"content_type":"application/pdf","file_size":1161879,"file_id":"22133","access_level":"open_access","date_updated":"2026-06-24T06:09:35Z","file_name":"2026_CommunicationsPhysics_Li.pdf","relation":"main_file"}],"supplementarymaterial":"yes","month":"04","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding authors upon request. The computational codes that were used to generate the figures presented in this study are available from the corresponding authors upon request.","das_tickbox":"1"},{"_id":"22102","oa_version":"Published Version","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"citation":{"mla":"Chatterjee, Krishnendu, et al. “SuperDP: Differential Privacy Refutation via Supermartingales.” <i>Proceedings of the ACM on Programming Languages</i>, vol. 10, no. PLDI, 218, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3808296\">10.1145/3808296</a>.","short":"K. Chatterjee, E. Goharshady, D. Zikelic, Proceedings of the ACM on Programming Languages 10 (2026).","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3808296\">https://doi.org/10.1145/3808296</a>.","ista":"Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential privacy refutation via supermartingales. Proceedings of the ACM on Programming Languages. 10(PLDI), 218.","ieee":"K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential privacy refutation via supermartingales,” <i>Proceedings of the ACM on Programming Languages</i>, vol. 10, no. PLDI. Association for Computing Machinery, 2026.","ama":"Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential privacy refutation via supermartingales. <i>Proceedings of the ACM on Programming Languages</i>. 2026;10(PLDI). doi:<a href=\"https://doi.org/10.1145/3808296\">10.1145/3808296</a>","apa":"Chatterjee, K., Goharshady, E., &#38; Zikelic, D. (2026). SuperDP: Differential privacy refutation via supermartingales. <i>Proceedings of the ACM on Programming Languages</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3808296\">https://doi.org/10.1145/3808296</a>"},"related_material":{"record":[{"relation":"research_data","status":"public","id":"22134"}]},"PlanS_conform":"1","file_date_updated":"2026-06-24T06:19:56Z","OA_place":"publisher","title":"SuperDP: Differential privacy refutation via supermartingales","acknowledgement":"The authors would like to thank Petr Novotný for valuable discussions that helped shape this work.\r\nThis research was supported by the Singapore Ministry of Education (MOE) Academic Research\r\nFund (AcRF) Tier 1 grant (Proposal ID: 25-SIS-SMU-009), Vienna Science and Technology Fund\r\n(WWTF), State of Lower Austria [Grant ID 10.47379/ICT25017], ERC CoG 863818 (ForM-SMArt),\r\nand Austrian Science Fund (FWF) 10.55776/COE12.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","publication_status":"published","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2603.26215"]},"publisher":"Association for Computing Machinery","article_number":"218","has_accepted_license":"1","status":"public","issue":"PLDI","das_tickbox":"1","dataavailabilitystatement":"The artifact supporting the findings of this study, which includes the underlying datasets, software\r\ncode, and experiments, is publicly available in Zenodo https://zenodo.org/records/19399862.","month":"06","keyword":["Static Program Analysis","Differential Privacy","Probabilistic Programming","Martingales"],"supplementarymaterial":"no","file":[{"relation":"main_file","file_name":"2026_ProcACMProgrammingLanguages_Chatterjee.pdf","date_updated":"2026-06-24T06:19:56Z","access_level":"open_access","file_id":"22135","file_size":858595,"success":1,"content_type":"application/pdf","creator":"dernst","checksum":"994bf21d6269dabccf1e1091e02962c5","date_created":"2026-06-24T06:19:56Z"}],"author":[{"last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Kafshdar Goharshadi, Ehsan","last_name":"Kafshdar Goharshadi","orcid":"0000-0002-8595-0587","first_name":"Ehsan","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d"},{"full_name":"Zikelic, Dorde","last_name":"Zikelic","orcid":"0000-0002-4681-1699","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"researchdata_availability":"yes","department":[{"_id":"KrCh"}],"date_created":"2026-06-21T22:02:59Z","year":"2026","publication_identifier":{"eissn":["2475-1421"]},"article_type":"original","abstract":[{"lang":"eng","text":"Differential privacy (DP) has established itself as one of the standards for ensuring privacy of individual data. However, reasoning about DP is a challenging and error-prone task, hence methods for formal verification and refutation of DP properties have received significant interest in recent years. In this work, we present a novel method for automated formal refutation of є-DP. Our method refutes є-DP by searching for a pair of inputs together with a non-negative function over outputs whose expected value on these two inputs differs by a significant amount. The two inputs and the non-negative function over outputs are computed simultaneously, by utilizing upper expectation supermartingales and lower expectation submartingales from probabilistic program analysis, which we leverage to introduce a sound and complete proof rule for є-DP refutation. To the best of our knowledge, our method is the first method for є-DP refutation to offer the following four desirable features: (1) it is fully automated, (2) it is applicable to stochastic mechanisms with sampling instructions from both discrete and continuous distributions, (3) it provides soundness guarantees, and (4) it provides semi-completeness guarantees. Our experiments show that our prototype tool SuperDP achieves superior performance compared to the state of the art and manages to refute є-DP for a number of challenging examples collected from the literature, including ones that were out of the reach of prior methods."}],"ec_funded":1,"quality_controlled":"1","ddc":["000"],"publication":"Proceedings of the ACM on Programming Languages","corr_author":"1","intvolume":"        10","type":"journal_article","arxiv":1,"scopus_import":"1","OA_type":"gold","article_processing_charge":"Yes","date_published":"2026-06-08T00:00:00Z","oa":1,"date_updated":"2026-06-24T06:39:37Z","volume":10,"doi":"10.1145/3808296"},{"citation":{"apa":"Chatterjee, K., Goharshady, E., &#38; Zikelic, D. (2026). SuperDP: Differential Privacy Refutation via Supermartingales. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.18930113\">https://doi.org/10.5281/ZENODO.18930113</a>","ama":"Chatterjee K, Goharshady E, Zikelic D. SuperDP: Differential Privacy Refutation via Supermartingales. 2026. doi:<a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>","ista":"Chatterjee K, Goharshady E, Zikelic D. 2026. SuperDP: Differential Privacy Refutation via Supermartingales, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, and Dorde Zikelic. “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026. <a href=\"https://doi.org/10.5281/ZENODO.18930113\">https://doi.org/10.5281/ZENODO.18930113</a>.","ieee":"K. Chatterjee, E. Goharshady, and D. Zikelic, “SuperDP: Differential Privacy Refutation via Supermartingales.” Zenodo, 2026.","short":"K. Chatterjee, E. Goharshady, D. Zikelic, (2026).","mla":"Chatterjee, Krishnendu, et al. <i>SuperDP: Differential Privacy Refutation via Supermartingales</i>. Zenodo, 2026, doi:<a href=\"https://doi.org/10.5281/ZENODO.18930113\">10.5281/ZENODO.18930113</a>."},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","first_name":"Ehsan","last_name":"Kafshdar Goharshadi","orcid":"0000-0002-8595-0587","full_name":"Kafshdar Goharshadi, Ehsan"},{"id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","first_name":"Dorde","orcid":"0000-0002-4681-1699","last_name":"Zikelic","full_name":"Zikelic, Dorde"}],"department":[{"_id":"KrCh"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"22102"}]},"date_created":"2026-06-24T06:25:29Z","main_file_link":[{"url":"https://doi.org/10.5281/ZENODO.18930113","open_access":"1"}],"month":"03","_id":"22134","oa_version":"Published Version","title":"SuperDP: Differential Privacy Refutation via Supermartingales","OA_place":"repository","year":"2026","type":"research_data_reference","OA_type":"green","ddc":["000"],"corr_author":"1","abstract":[{"lang":"eng","text":"This artifact provides the source code, benchmarks, and scripts necessary to build and reproduce the experimental results for `SuperDP` (Accepted at PLDI 2026). It also includes instructions for running the tool on user-provided inputs."}],"day":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","has_accepted_license":"1","doi":"10.5281/ZENODO.18930113","oa":1,"publisher":"Zenodo","date_updated":"2026-06-24T06:39:38Z","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"date_published":"2026-03-09T00:00:00Z"},{"date_published":"2026-01-08T00:00:00Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"article_processing_charge":"No","date_updated":"2026-06-10T09:21:49Z","publisher":"Institute of Science and Technology Austria","oa":1,"has_accepted_license":"1","doi":"10.15479/AT-ISTA-20833","status":"public","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","day":"8","abstract":[{"lang":"eng","text":"Sex-chromosome systems are highly variable across animals, but how they transition from one to another is not well understood. Diptera have undergone multiple sex-chromosome turnovers and expansions while maintaining their general chromosomal content, which makes them an ideal clade to study such transitions. We analysed more than 100 dipteran whole-genome assemblies and identified 4 new lineages that underwent sex-chromosome turnover (in addition to the 5 previously reported). We find the majority of turnovers happened in the group Schizophora, which tend to have fewer genes on the F element (the chromosome homologous to the ancestral insect X chromosome) than lower dipterans, a factor previously hypothesized to facilitate turnover. Most derived X chromosomes have higher GC content than autosomes, consistent with a high prevalence of male-achiasmy in Diptera. In addition, an excess of gene movement out of the X is detected for most of these new X chromosomes, and many of these moved genes have high testis expression in Drosophila, suggesting that out-of-X gene movement contributes to the long-term demasculinization of X chromosomes."}],"corr_author":"1","type":"research_data","year":"2026","file_date_updated":"2026-01-08T01:35:08Z","title":"Research Data for 'Causes and consequences of sex-chromosome turnovers in Diptera'","oa_version":"Published Version","_id":"20833","month":"01","keyword":["Schizophora","sex chromosomes","sex-chromosome turnover","Diptera","genomic features","out-of-X movement."],"file":[{"file_size":1201,"success":1,"content_type":"text/plain","checksum":"0b79be6229f2ad9ac117ef00fc4f5c0e","creator":"llayanaf","date_created":"2025-12-17T10:09:25Z","file_name":"README.txt","relation":"main_file","date_updated":"2025-12-17T10:09:25Z","file_id":"20834","access_level":"open_access"},{"creator":"llayanaf","checksum":"daf1c03149dd170b14e5c8e109ee3c77","date_created":"2025-12-17T10:10:11Z","success":1,"file_size":19052849,"content_type":"application/zip","date_updated":"2025-12-17T10:10:11Z","access_level":"open_access","file_id":"20835","relation":"main_file","file_name":"Supplementary_Datasets.zip"},{"access_level":"open_access","file_id":"20837","date_updated":"2025-12-17T10:12:05Z","relation":"main_file","file_name":"Perl_scripts.zip","date_created":"2025-12-17T10:12:05Z","creator":"llayanaf","checksum":"251e7aab01917c2ad2fbccf465492ea1","content_type":"application/zip","success":1,"file_size":4575},{"file_size":572362,"content_type":"application/zip","success":1,"checksum":"3cabf143b8cd286eae48c598da2b03bd","creator":"llayanaf","date_created":"2026-01-08T01:35:08Z","file_name":"Supplementary_Tables.zip","relation":"main_file","date_updated":"2026-01-08T01:35:08Z","file_id":"20959","access_level":"open_access"}],"date_created":"2025-12-17T10:10:57Z","department":[{"_id":"BeVi"}],"author":[{"last_name":"Layana Franco","orcid":"0000-0002-1253-6297","full_name":"Layana Franco, Lorena Alexandra","id":"02814589-eb8f-11eb-b029-a70074f3f18f","first_name":"Lorena Alexandra"},{"id":"4E099E4E-F248-11E8-B48F-1D18A9856A87","first_name":"Melissa A","orcid":"0000-0002-9752-7380","last_name":"Toups","full_name":"Toups, Melissa A"},{"last_name":"Vicoso","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz"}],"citation":{"short":"L.A. Layana Franco, M.A. Toups, B. Vicoso, (2026).","mla":"Layana Franco, Lorena Alexandra, et al. <i>Research Data for “Causes and Consequences of Sex-Chromosome Turnovers in Diptera.”</i> Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20833\">10.15479/AT-ISTA-20833</a>.","ieee":"L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Research Data for ‘Causes and consequences of sex-chromosome turnovers in Diptera.’” Institute of Science and Technology Austria, 2026.","ista":"Layana Franco LA, Toups MA, Vicoso B. 2026. Research Data for ‘Causes and consequences of sex-chromosome turnovers in Diptera’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-20833\">10.15479/AT-ISTA-20833</a>.","chicago":"Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Research Data for ‘Causes and Consequences of Sex-Chromosome Turnovers in Diptera.’” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-20833\">https://doi.org/10.15479/AT-ISTA-20833</a>.","ama":"Layana Franco LA, Toups MA, Vicoso B. Research Data for “Causes and consequences of sex-chromosome turnovers in Diptera.” 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20833\">10.15479/AT-ISTA-20833</a>","apa":"Layana Franco, L. A., Toups, M. A., &#38; Vicoso, B. (2026). Research Data for “Causes and consequences of sex-chromosome turnovers in Diptera.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20833\">https://doi.org/10.15479/AT-ISTA-20833</a>"}},{"acknowledgement":"We thank Gerard Higgins, Andrei Militaru, Nikolai Kiesel, and Markus Aspelmeyer for useful discussions on the topic of the figure-of-merit. We thank Teodor Strömberg for helping with the additional characterizations of the optical lever noise. We thank Johannes Fink and Scott Waitukaitis for their helpful feedback on the manuscript. This work was supported by Institute of Science and Technology Austria and the European Research Council under Grant No. 101087907 (ERC CoG QuHAMP).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"04","publication_status":"published","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2408.09445"]},"publisher":"Springer Nature","article_number":"80","has_accepted_license":"1","status":"public","oa_version":"Published Version","_id":"20840","project":[{"name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","grant_number":"101087907"}],"citation":{"apa":"Agafonova, S., Rosello, P., Mekonnen, M., &#38; Hosten, O. (2026). One-milligram torsional pendulum toward experiments at the quantum-gravity interface. <i>Communications Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42005-026-02514-w\">https://doi.org/10.1038/s42005-026-02514-w</a>","ama":"Agafonova S, Rosello P, Mekonnen M, Hosten O. One-milligram torsional pendulum toward experiments at the quantum-gravity interface. <i>Communications Physics</i>. 2026;9. doi:<a href=\"https://doi.org/10.1038/s42005-026-02514-w\">10.1038/s42005-026-02514-w</a>","ista":"Agafonova S, Rosello P, Mekonnen M, Hosten O. 2026. One-milligram torsional pendulum toward experiments at the quantum-gravity interface. Communications Physics. 9, 80.","ieee":"S. Agafonova, P. Rosello, M. Mekonnen, and O. Hosten, “One-milligram torsional pendulum toward experiments at the quantum-gravity interface,” <i>Communications Physics</i>, vol. 9. Springer Nature, 2026.","chicago":"Agafonova, Sofia, Pere Rosello, Manuel Mekonnen, and Onur Hosten. “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.” <i>Communications Physics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s42005-026-02514-w\">https://doi.org/10.1038/s42005-026-02514-w</a>.","short":"S. Agafonova, P. Rosello, M. Mekonnen, O. Hosten, Communications Physics 9 (2026).","mla":"Agafonova, Sofia, et al. “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.” <i>Communications Physics</i>, vol. 9, 80, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s42005-026-02514-w\">10.1038/s42005-026-02514-w</a>."},"related_material":{"record":[{"status":"public","id":"20842","relation":"research_data"}]},"file_date_updated":"2026-03-16T10:07:46Z","PlanS_conform":"1","OA_place":"publisher","title":"One-milligram torsional pendulum toward experiments at the quantum-gravity interface","article_type":"original","abstract":[{"text":"Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240 microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface.","lang":"eng"}],"quality_controlled":"1","publication":"Communications Physics","ddc":["530"],"corr_author":"1","intvolume":"         9","type":"journal_article","arxiv":1,"scopus_import":"1","DOAJ_listed":"1","OA_type":"gold","article_processing_charge":"Yes","date_published":"2026-03-04T00:00:00Z","oa":1,"date_updated":"2026-06-10T08:36:06Z","doi":"10.1038/s42005-026-02514-w","volume":9,"month":"03","file":[{"file_name":"2026_CommunicationsPhysics_Agafonova.pdf","relation":"main_file","date_updated":"2026-03-16T10:07:46Z","file_id":"21457","access_level":"open_access","content_type":"application/pdf","file_size":1901772,"success":1,"checksum":"62e2175e7e3ad49260ae6a7b4e0860a2","creator":"dernst","date_created":"2026-03-16T10:07:46Z"}],"author":[{"full_name":"Agafonova, Sofya","orcid":"0000-0003-0582-2946","last_name":"Agafonova","first_name":"Sofya","id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80"},{"first_name":"Pere","full_name":"Rosello, Pere","last_name":"Rosello"},{"first_name":"Manuel","full_name":"Mekonnen, Manuel","last_name":"Mekonnen"},{"full_name":"Hosten, Onur","last_name":"Hosten","orcid":"0000-0002-2031-204X","first_name":"Onur","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"date_created":"2025-12-21T11:39:04Z","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"OnHo"}],"year":"2026","publication_identifier":{"eissn":["2399-3650"]}},{"external_id":{"arxiv":["2403.07803"]},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","has_accepted_license":"1","article_number":"23","publisher":"Springer Nature","day":"01","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","acknowledgement":"The author would like to thank Jan Maas for suggesting this project and for many helpful comments, Antonio Agresti, Lorenzo Dello Schiavo and Julian Fischer for several fruitful discussions, Oliver Tse for pointing out the reference [10], and the anonymous reviewer for carefully reading this manuscript and providing valuable suggestions. He also gratefully acknowledges support from the Austrian Science Fund (FWF) project 10.55776/F65.Open access funding provided by Institute of Science and Technology (IST Austria).","publication_status":"published","title":"Variational structures for the Fokker-Planck equation with general Dirichlet boundary conditions","OA_place":"publisher","PlanS_conform":"1","file_date_updated":"2026-01-05T12:36:39Z","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"_id":"20865","oa_version":"Published Version","related_material":{"record":[{"relation":"earlier_version","status":"public","id":"20571"}]},"citation":{"apa":"Quattrocchi, F. (2026). Variational structures for the Fokker-Planck equation with general Dirichlet boundary conditions. <i>Calculus of Variations and Partial Differential Equations</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00526-025-03193-1\">https://doi.org/10.1007/s00526-025-03193-1</a>","ama":"Quattrocchi F. Variational structures for the Fokker-Planck equation with general Dirichlet boundary conditions. <i>Calculus of Variations and Partial Differential Equations</i>. 2026;65(1). doi:<a href=\"https://doi.org/10.1007/s00526-025-03193-1\">10.1007/s00526-025-03193-1</a>","ieee":"F. Quattrocchi, “Variational structures for the Fokker-Planck equation with general Dirichlet boundary conditions,” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 65, no. 1. Springer Nature, 2026.","chicago":"Quattrocchi, Filippo. “Variational Structures for the Fokker-Planck Equation with General Dirichlet Boundary Conditions.” <i>Calculus of Variations and Partial Differential Equations</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00526-025-03193-1\">https://doi.org/10.1007/s00526-025-03193-1</a>.","ista":"Quattrocchi F. 2026. Variational structures for the Fokker-Planck equation with general Dirichlet boundary conditions. Calculus of Variations and Partial Differential Equations. 65(1), 23.","short":"F. Quattrocchi, Calculus of Variations and Partial Differential Equations 65 (2026).","mla":"Quattrocchi, Filippo. “Variational Structures for the Fokker-Planck Equation with General Dirichlet Boundary Conditions.” <i>Calculus of Variations and Partial Differential Equations</i>, vol. 65, no. 1, 23, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s00526-025-03193-1\">10.1007/s00526-025-03193-1</a>."},"date_published":"2026-01-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","volume":65,"doi":"10.1007/s00526-025-03193-1","date_updated":"2026-04-07T08:37:46Z","oa":1,"quality_controlled":"1","abstract":[{"text":"We prove the convergence of a modified Jordan–Kinderlehrer–Otto scheme to a solution\r\nto the Fokker–Planck equation in Ω e R^d with general—strictly positive and temporally\r\nconstant—Dirichlet boundary conditions. We work under mild assumptions on the domain,\r\nthe drift, and the initial datum. In the special case where Ω is an interval in R1, we prove\r\nthat such a solution is a gradient flow—curve of maximal slope—within a suitable space of\r\nmeasures, endowed with a modified Wasserstein distance. Our discrete scheme and modified\r\ndistance draw inspiration from contributions by A. Figalli and N. Gigli [J. Math. Pures\r\nAppl. 94, (2010), pp. 107–130], and J. Morales [J. Math. Pures Appl. 112, (2018), pp. 41–88]\r\non an optimal-transport approach to evolution equations with Dirichlet boundary conditions.\r\nSimilarly to these works, we allow the mass to flow from/to the boundary ∂Ω throughout\r\nthe evolution. However, our leading idea is to also keep track of the mass at the boundary\r\nby working with measures defined on the whole closure Ω . The driving functional is a\r\nmodification of the classical relative entropy that also makes use of the information at the\r\nboundary. As an intermediate result, when Ω is an interval in R1, we find a formula for the\r\ndescending slope of this geodesically nonconvex functional.","lang":"eng"}],"article_type":"original","scopus_import":"1","OA_type":"hybrid","arxiv":1,"type":"journal_article","intvolume":"        65","corr_author":"1","ddc":["510"],"publication":"Calculus of Variations and Partial Differential Equations","year":"2026","publication_identifier":{"eissn":["1432-0835"],"issn":["0944-2669"]},"month":"01","issue":"1","date_created":"2025-12-29T12:06:26Z","department":[{"_id":"JaMa"}],"language":[{"iso":"eng"}],"author":[{"first_name":"Filippo","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","full_name":"Quattrocchi, Filippo","last_name":"Quattrocchi","orcid":"0009-0000-9773-1931"}],"file":[{"success":1,"file_size":958382,"content_type":"application/pdf","date_created":"2026-01-05T12:36:39Z","checksum":"635370d64abaf444f50f5cca60bba1be","creator":"dernst","file_name":"2026_CalculusVariations_Quattrocchi.pdf","relation":"main_file","file_id":"20945","access_level":"open_access","date_updated":"2026-01-05T12:36:39Z"}]},{"corr_author":"1","ddc":["570"],"type":"dissertation","date_updated":"2026-04-07T11:41:44Z","doi":"10.15479/AT-ISTA-20964","date_published":"2026-01-14T00:00:00Z","article_processing_charge":"No","file":[{"embargo":"2027-01-01","date_updated":"2026-01-21T14:12:13Z","file_id":"21033","access_level":"closed","file_name":"2026_Vladimirtsev_Dmitrii_Thesis.pdf","relation":"main_file","embargo_to":"open_access","checksum":"812857b2fbe3f6113bef22fd04bccd3e","creator":"dvladimi","date_created":"2026-01-21T14:12:13Z","file_size":2867531,"content_type":"application/pdf"},{"access_level":"closed","file_id":"21034","date_updated":"2026-01-28T12:38:19Z","relation":"source_file","file_name":"Source Files.zip","date_created":"2026-01-21T14:41:58Z","creator":"dvladimi","checksum":"2b969f97f8d7461bea3d255f48c2219c","content_type":"application/x-zip-compressed","file_size":25023066}],"page":"22","department":[{"_id":"GradSch"},{"_id":"JiFr"}],"date_created":"2026-01-09T09:22:48Z","language":[{"iso":"eng"}],"author":[{"id":"60466724-5355-11ee-ae5a-fa55e8f99c3d","first_name":"Dmitrii","last_name":"Vladimirtsev","full_name":"Vladimirtsev, Dmitrii"}],"supervisor":[{"last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"}],"month":"01","publication_identifier":{"issn":["2791-4585"]},"alternative_title":["ISTA Master’s Thesis"],"year":"2026","publication_status":"published","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"14","publisher":"Institute of Science and Technology Austria","has_accepted_license":"1","status":"public","related_material":{"record":[{"relation":"part_of_dissertation","id":"20982","status":"public"}]},"citation":{"ieee":"D. Vladimirtsev, “Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels,” Institute of Science and Technology Austria, 2026.","ista":"Vladimirtsev D. 2026. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. Institute of Science and Technology Austria.","chicago":"Vladimirtsev, Dmitrii. “Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-20964\">https://doi.org/10.15479/AT-ISTA-20964</a>.","mla":"Vladimirtsev, Dmitrii. <i>Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20964\">10.15479/AT-ISTA-20964</a>.","short":"D. Vladimirtsev, Armadillo Repeat Only Proteins Are Master Regulators of Plant Cyclic-Nucleotide Gated Channels, Institute of Science and Technology Austria, 2026.","apa":"Vladimirtsev, D. (2026). <i>Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20964\">https://doi.org/10.15479/AT-ISTA-20964</a>","ama":"Vladimirtsev D. Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20964\">10.15479/AT-ISTA-20964</a>"},"_id":"20964","oa_version":"Published Version","project":[{"name":"Cyclic nucleotides as second messengers in plants","_id":"8f347782-16d5-11f0-9cad-8c19706ee739","grant_number":"101142681"}],"OA_place":"publisher","file_date_updated":"2026-01-28T12:38:19Z","title":"Armadillo repeat only proteins are master regulators of plant cyclic-nucleotide gated channels","degree_awarded":"MS","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"Bio"}]},{"day":"05","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Elsevier","external_id":{"pmid":["41494523"]},"citation":{"ieee":"H. Kücükdereli and A. M. Douglass, “Neuroscience: What doesn’t kill you makes you stronger,” <i>Current Biology</i>, vol. 36, no. 1. Elsevier, pp. R27–R29, 2026.","ista":"Kücükdereli H, Douglass AM. 2026. Neuroscience: What doesn’t kill you makes you stronger. Current Biology. 36(1), R27–R29.","chicago":"Kücükdereli, Hakan, and Amelia M. Douglass. “Neuroscience: What Doesn’t Kill You Makes You Stronger.” <i>Current Biology</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.cub.2025.11.056\">https://doi.org/10.1016/j.cub.2025.11.056</a>.","mla":"Kücükdereli, Hakan, and Amelia M. Douglass. “Neuroscience: What Doesn’t Kill You Makes You Stronger.” <i>Current Biology</i>, vol. 36, no. 1, Elsevier, 2026, pp. R27–29, doi:<a href=\"https://doi.org/10.1016/j.cub.2025.11.056\">10.1016/j.cub.2025.11.056</a>.","short":"H. Kücükdereli, A.M. Douglass, Current Biology 36 (2026) R27–R29.","apa":"Kücükdereli, H., &#38; Douglass, A. M. (2026). Neuroscience: What doesn’t kill you makes you stronger. <i>Current Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cub.2025.11.056\">https://doi.org/10.1016/j.cub.2025.11.056</a>","ama":"Kücükdereli H, Douglass AM. Neuroscience: What doesn’t kill you makes you stronger. <i>Current Biology</i>. 2026;36(1):R27-R29. doi:<a href=\"https://doi.org/10.1016/j.cub.2025.11.056\">10.1016/j.cub.2025.11.056</a>"},"pmid":1,"oa_version":"None","_id":"20972","title":"Neuroscience: What doesn’t kill you makes you stronger","type":"journal_article","scopus_import":"1","OA_type":"closed access","intvolume":"        36","corr_author":"1","publication":"Current Biology","quality_controlled":"1","abstract":[{"text":"Small amounts of stress are thought to have beneficial effects. A new study reports a mechanism by which the psychedelic drug, psilocybin, causes acute release of stress hormones, despite its known long-term anti-anxiety effects.","lang":"eng"}],"article_type":"letter_note","doi":"10.1016/j.cub.2025.11.056","volume":36,"date_updated":"2026-01-12T10:09:13Z","date_published":"2026-01-05T00:00:00Z","article_processing_charge":"No","department":[{"_id":"AmDo"},{"_id":"SiHi"}],"date_created":"2026-01-11T23:01:33Z","language":[{"iso":"eng"}],"author":[{"first_name":"Hakan","id":"5d5f6ea4-ef9e-11f0-a10a-85e12a3552af","full_name":"Kücükdereli, Hakan","last_name":"Kücükdereli"},{"first_name":"Amelia May Barnett","id":"de5f6fda-80fb-11ef-996f-a8c4ecd8e289","full_name":"Douglass, Amelia May Barnett","orcid":"0000-0001-5398-6473","last_name":"Douglass"}],"page":"R27-R29","month":"01","issue":"1","publication_identifier":{"eissn":["1879-0445"],"issn":["0960-9822"]},"year":"2026"},{"article_type":"original","quality_controlled":"1","abstract":[{"lang":"eng","text":"Thus far, Lyman-α damping wings towards quasars have been used to probe the global ionization state of the foreground intergalactic medium (IGM). A new parametrization has demonstrated that the damping wing signature also carries local information about the distribution of neutral hydrogen (H I) in front of the quasar before it started shining. Leveraging a recently introduced Bayesian JAX-based Hamiltonian Monte Carlo inference framework, we derive constraints on the Lorentzian-weighted H I column density NDW H I , the quasar’s distance rpatch to the first neutral patch, and its lifetime tQ based on James Webb Space\r\nTelescope (JWST) Near Infrared Spectrograph (NIRSpec) spectra of the two z ∼ 7.5 quasars J1007+2115 and J1342+0928. After folding in model-dependent topology information, we find that J1007+2115 (and J1342+0928) is most likely to reside in a (xH1)= 0.32+0.22 −0.20 (0.58+0.23 −0.23) neutral IGM while shining for a remarkably short lifetime of log10 tQ/yr = 4.14+0.74 −0.18 (an intermediate lifetime of 5.64+0.25 −0.43) along a sightline with log10 NDW\r\nH I /cm−2 = 19.70+0.35 −0.86 (20.24+0.25 −0.22) and rpatch = 28.9+54.0 −14.4 cMpc\r\n(10.9+5.6−5.9 cMpc). In light of the potential presence of local absorbers in the foreground of J1342+0928 as has been recently suggested, we also demonstrate how the Lorentzian-weighted column density NDW H I provides a natural means for quantifying their contribution to the observed damping wing signal."}],"intvolume":"       545","publication":"Monthly Notices of the Royal Astronomical Society","ddc":["520"],"type":"journal_article","DOAJ_listed":"1","OA_type":"gold","arxiv":1,"scopus_import":"1","date_published":"2026-01-01T00:00:00Z","article_processing_charge":"Yes","date_updated":"2026-01-12T09:45:54Z","oa":1,"doi":"10.1093/mnras/staf2219","volume":545,"issue":"3","month":"01","file":[{"success":1,"file_size":2174272,"content_type":"application/pdf","creator":"dernst","checksum":"68f04ab0fdcee4f12341d116c5f794cd","date_created":"2026-01-12T09:43:07Z","relation":"main_file","file_name":"2026_MonthNoticesRAS_Kist.pdf","date_updated":"2026-01-12T09:43:07Z","access_level":"open_access","file_id":"20979"}],"date_created":"2026-01-11T23:01:34Z","language":[{"iso":"eng"}],"department":[{"_id":"ZoHa"}],"author":[{"full_name":"Kist, Timo","last_name":"Kist","first_name":"Timo"},{"first_name":"Joseph F.","last_name":"Hennawi","full_name":"Hennawi, Joseph F."},{"first_name":"Frederick B.","last_name":"Davies","full_name":"Davies, Frederick B."},{"last_name":"Bañados","full_name":"Bañados, Eduardo","first_name":"Eduardo"},{"first_name":"Sarah E.I.","last_name":"Bosman","full_name":"Bosman, Sarah E.I."},{"full_name":"Cai, Zheng","last_name":"Cai","first_name":"Zheng"},{"first_name":"Anna Christina","last_name":"Eilers","full_name":"Eilers, Anna Christina"},{"first_name":"Xiaohui","full_name":"Fan, Xiaohui","last_name":"Fan"},{"first_name":"Zoltán","id":"7c006e8c-cc0d-11ee-8322-cb904ef76f36","full_name":"Haiman, Zoltán","last_name":"Haiman","orcid":"0000-0003-3633-5403"},{"full_name":"Jun, Hyunsung D.","last_name":"Jun","first_name":"Hyunsung D."},{"first_name":"Yichen","last_name":"Liu","full_name":"Liu, Yichen"},{"last_name":"Yang","full_name":"Yang, Jinyi","first_name":"Jinyi"},{"full_name":"Wang, Feige","last_name":"Wang","first_name":"Feige"}],"year":"2026","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We acknowledge helpful conversations with the ENIGMA group at UC Santa Barbara and Leiden University. This work is based on observations made with the NASA/ESA/CSA JWST. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with programmes #1219 and #1764. This work made use of numpy (C. R. Harris et al. 2020), scipy (P. Virtanen et al. 2020), jax (J. Bradbury et al. 2018), numpyro (E. Bingham et al. 2018; D. Phan, N. Pradhan & M. Jankowiak 2019), sklearn (F. Pedregosa et al. 2011), astropy (Astropy Collaboration 2013, 2018, 2022), PypeIt (J. Prochaska et al. 2020), skycalc_ipy (K. Leschinski 2021), h5py (A. Collette 2013), matplotlib (J. D. Hunter 2007), corner.py (D. Foreman-Mackey 2016), and IPython (F. Pérez & B. E. Granger 2007). TK and JFH acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no. 885301). JFH acknowledges support from NSF grant no. 2307180. SEIB was supported by the Deutsche Forschungsgemeinschaft (DFG) under Emmy Noether grant number BO 5771/1-1. FW acknowledges support from NSF award AST-2513040.","publication_status":"published","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2508.21818"]},"article_number":"staf2219","publisher":"Oxford University Press","has_accepted_license":"1","status":"public","_id":"20974","oa_version":"Published Version","citation":{"chicago":"Kist, Timo, Joseph F. Hennawi, Frederick B. Davies, Eduardo Bañados, Sarah E.I. Bosman, Zheng Cai, Anna Christina Eilers, et al. “First Constraints on the Local Ionization Topology in Front of Two Quasars at z ∼ 7.5.” <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press, 2026. <a href=\"https://doi.org/10.1093/mnras/staf2219\">https://doi.org/10.1093/mnras/staf2219</a>.","ista":"Kist T, Hennawi JF, Davies FB, Bañados E, Bosman SEI, Cai Z, Eilers AC, Fan X, Haiman Z, Jun HD, Liu Y, Yang J, Wang F. 2026. First constraints on the local ionization topology in front of two quasars at z ∼ 7.5. Monthly Notices of the Royal Astronomical Society. 545(3), staf2219.","ieee":"T. Kist <i>et al.</i>, “First constraints on the local ionization topology in front of two quasars at z ∼ 7.5,” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 545, no. 3. Oxford University Press, 2026.","short":"T. Kist, J.F. Hennawi, F.B. Davies, E. Bañados, S.E.I. Bosman, Z. Cai, A.C. Eilers, X. Fan, Z. Haiman, H.D. Jun, Y. Liu, J. Yang, F. Wang, Monthly Notices of the Royal Astronomical Society 545 (2026).","mla":"Kist, Timo, et al. “First Constraints on the Local Ionization Topology in Front of Two Quasars at z ∼ 7.5.” <i>Monthly Notices of the Royal Astronomical Society</i>, vol. 545, no. 3, staf2219, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/mnras/staf2219\">10.1093/mnras/staf2219</a>.","apa":"Kist, T., Hennawi, J. F., Davies, F. B., Bañados, E., Bosman, S. E. I., Cai, Z., … Wang, F. (2026). First constraints on the local ionization topology in front of two quasars at z ∼ 7.5. <i>Monthly Notices of the Royal Astronomical Society</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/mnras/staf2219\">https://doi.org/10.1093/mnras/staf2219</a>","ama":"Kist T, Hennawi JF, Davies FB, et al. First constraints on the local ionization topology in front of two quasars at z ∼ 7.5. <i>Monthly Notices of the Royal Astronomical Society</i>. 2026;545(3). doi:<a href=\"https://doi.org/10.1093/mnras/staf2219\">10.1093/mnras/staf2219</a>"},"OA_place":"publisher","file_date_updated":"2026-01-12T09:43:07Z","PlanS_conform":"1","title":"First constraints on the local ionization topology in front of two quasars at z ∼ 7.5"},{"acknowledgement":"This research was supported by NSF grants DMS-2301360 and CCF-2437030 as well as from the European Union's Horizon 2020 research and innovation programme under Marie Sk\\lodowska-Curie grant 101034413.\r\n","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","publication_status":"published","external_id":{"arxiv":["2502.19369"]},"status":"public","publisher":"Society for Industrial & Applied Mathematics","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"_id":"20980","oa_version":"Preprint","citation":{"apa":"Dey, T. K., Haas, A., &#38; Lipiński, M. (2026). Computing a connection matrix and persistence efficiently from a morse decomposition. <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial &#38; Applied Mathematics. <a href=\"https://doi.org/10.1137/25m1739406\">https://doi.org/10.1137/25m1739406</a>","ama":"Dey TK, Haas A, Lipiński M. Computing a connection matrix and persistence efficiently from a morse decomposition. <i>SIAM Journal on Applied Dynamical Systems</i>. 2026;25(1):108-130. doi:<a href=\"https://doi.org/10.1137/25m1739406\">10.1137/25m1739406</a>","ista":"Dey TK, Haas A, Lipiński M. 2026. Computing a connection matrix and persistence efficiently from a morse decomposition. SIAM Journal on Applied Dynamical Systems. 25(1), 108–130.","chicago":"Dey, Tamal K., Andrew Haas, and Michał Lipiński. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” <i>SIAM Journal on Applied Dynamical Systems</i>. Society for Industrial &#38; Applied Mathematics, 2026. <a href=\"https://doi.org/10.1137/25m1739406\">https://doi.org/10.1137/25m1739406</a>.","ieee":"T. K. Dey, A. Haas, and M. Lipiński, “Computing a connection matrix and persistence efficiently from a morse decomposition,” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 25, no. 1. Society for Industrial &#38; Applied Mathematics, pp. 108–130, 2026.","mla":"Dey, Tamal K., et al. “Computing a Connection Matrix and Persistence Efficiently from a Morse Decomposition.” <i>SIAM Journal on Applied Dynamical Systems</i>, vol. 25, no. 1, Society for Industrial &#38; Applied Mathematics, 2026, pp. 108–30, doi:<a href=\"https://doi.org/10.1137/25m1739406\">10.1137/25m1739406</a>.","short":"T.K. Dey, A. Haas, M. Lipiński, SIAM Journal on Applied Dynamical Systems 25 (2026) 108–130."},"title":"Computing a connection matrix and persistence efficiently from a morse decomposition","OA_place":"repository","ec_funded":1,"abstract":[{"lang":"eng","text":"Morse decompositions partition the flows in a vector field into equivalent structures. Given such a decomposition, one can define a further summary of its flow structure by what is called a connection matrix. These matrices, a generalization of Morse boundary operators from classical Morse theory, capture the connections made by the flows among the critical structures—such as attractors, repellers, and orbits—in a vector field. Recently, in the context of combinatorial dynamics, an efficient persistence-like algorithm to compute connection matrices has been proposed in Dey, Lipiński, Mrozek, and Slechta [SIAM J. Appl. Dyn. Syst., 23 (2024), pp. 81–97]. We show that, actually, the classical persistence algorithm with exhaustive reduction retrieves connection matrices, both simplifying the algorithm of Dey et al. and bringing the theory of persistence closer to combinatorial dynamical systems. We supplement this main result with an observation: the concept of persistence as defined for scalar fields naturally adapts to Morse decompositions whose Morse sets are filtered with a Lyapunov function. We conclude by presenting preliminary experimental results."}],"quality_controlled":"1","article_type":"original","OA_type":"green","arxiv":1,"scopus_import":"1","type":"journal_article","ddc":["510"],"publication":"SIAM Journal on Applied Dynamical Systems","intvolume":"        25","article_processing_charge":"No","date_published":"2026-01-01T00:00:00Z","doi":"10.1137/25m1739406","volume":25,"oa":1,"date_updated":"2026-01-20T07:40:39Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2502.19369"}],"month":"01","issue":"1","author":[{"first_name":"Tamal K.","full_name":"Dey, Tamal K.","last_name":"Dey"},{"first_name":"Andrew","full_name":"Haas, Andrew","last_name":"Haas"},{"full_name":"Lipiński, Michał","last_name":"Lipiński","orcid":"0000-0001-9789-9750","first_name":"Michał","id":"dfffb474-4317-11ee-8f5c-fe3fc95a425e"}],"date_created":"2026-01-12T11:17:06Z","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"page":"108-130","year":"2026","publication_identifier":{"issn":["1536-0040"]}},{"has_accepted_license":"1","status":"public","publisher":"Institute of Science and Technology Austria","license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","tmp":{"image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)"},"publication_status":"published","day":"16","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","acknowledgement":"I acknowledge the funding agencies 1Norwegian Research Council RCN project 315287.\r\n2The FIASCO project \"Illuminating range shifts through evolutionary FIASCO: contrasting\r\nFaIling And Successful ColOnizations in replicated wild populations\", funded by the\r\nEuropean Union - Next Generation EU (Piano Nazionale di Ripresa e Resilienza - MUR\r\ncode: P202229JBC, CUP: C53D23007100001). 3Ecotypic formation in Littorina saxatilis\r\nin the Western Atlantic and comparisons across the North Atlantic. University of\r\nGothenburg Research Travel Grant, Tjarno Marine Laboratory, Sweden. $3023 (2018).\r\n4JIN project (Young Researchers, Spanish Ministry of Science, RTI2018-101274-J-I00)","title":"The genomic architecture of local adaptation in introduced populations","OA_place":"publisher","file_date_updated":"2026-01-16T13:08:59Z","degree_awarded":"PhD","related_material":{"record":[{"relation":"research_data","id":"18498","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"18491"}]},"citation":{"apa":"Garcia Castillo, D. F. (2026). <i>The genomic architecture of local adaptation in introduced populations</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20991\">https://doi.org/10.15479/AT-ISTA-20991</a>","ama":"Garcia Castillo DF. The genomic architecture of local adaptation in introduced populations. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20991\">10.15479/AT-ISTA-20991</a>","ieee":"D. F. Garcia Castillo, “The genomic architecture of local adaptation in introduced populations,” Institute of Science and Technology Austria, 2026.","ista":"Garcia Castillo DF. 2026. The genomic architecture of local adaptation in introduced populations. Institute of Science and Technology Austria.","chicago":"Garcia Castillo, Diego Fernando. “The Genomic Architecture of Local Adaptation in Introduced Populations.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-20991\">https://doi.org/10.15479/AT-ISTA-20991</a>.","short":"D.F. Garcia Castillo, The Genomic Architecture of Local Adaptation in Introduced Populations, Institute of Science and Technology Austria, 2026.","mla":"Garcia Castillo, Diego Fernando. <i>The Genomic Architecture of Local Adaptation in Introduced Populations</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20991\">10.15479/AT-ISTA-20991</a>."},"_id":"20991","oa_version":"Published Version","doi":"10.15479/AT-ISTA-20991","date_updated":"2026-04-16T12:20:37Z","oa":1,"date_published":"2026-01-16T00:00:00Z","article_processing_charge":"No","type":"dissertation","corr_author":"1","ddc":["576"],"abstract":[{"text":"Rapid local adaptation to new environments is critical for species persistence, especially in introduced populations. The evolutionary success of these populations is fundamentally dictated by the organization of genetic variation—the genomic architecture—in the face of severe demographic constraints, such as the founder effects and genetic bottlenecks that frequently accompany colonization. A central question in evolutionary biology is whether rapid adaptation relies on major-effect loci, such as chromosomal inversions, or on many small-effect loci dispersed across the genome. Furthermore, the genomic architecture strongly influences the extent to which evolutionary outcomes are predictable. Using introduced populations of the marine snail, Littorina saxatilis, as a model, this thesis investigates how genetic variation and genomic structure drive adaptation following introduction. We employed a population genomics approach on experimentally and accidentally introduced populations to dissect the specific genomic features that underpin divergence in newly colonized environments.\r\n\r\nIn Chapter 2, we tested the predictability of local adaptation through an uncommon 30-year transplant experiment in nature. By distinguishing allele and chromosomal inversion frequency changes from neutral expectations, we found that evolutionary change was highly predictable at the macro-scale (phenotypes and chromosomal inversions), but less robust at the level of individual collinear loci. This result demonstrates that evolution can be predictable when a population possesses sufficient standing genetic variation (SGV), with chromosomal inversions acting as key integrated units that facilitate a rapid response to selection. Building on this, Chapter 3 applied whole-genome sequencing to three accidentally introduced populations (Venice, San Francisco, and Redwood City) to investigate their likely source and genomic patterns of divergence. We identified genomic regions of remarkable divergence potentially associated with local adaptation, and likely fuelled by SGV, while explicitly acknowledging the difficulty in disentangling selection signals from the genome-wide effects of demographic processes. Furthermore, we found that the divergence patterns relied extensively on the collinear genome in these introduced populations, and less clearly on the chromosomal inversions. This observation contrasts with local adaptation observed in the experimental system that relied on both collinear loci and highly selected chromosomal inversions, highlighting how demographic history and genomic architecture influence the detectable signature of local adaptation.\r\n\r\nA major limitation to conducting large-scale comparative evolutionary studies is the lack of data standardization, which prevents the integration of community knowledge and high-resolution environmental and genetic data. Chapter 4 addresses this by developing a community database for the Littorina system. This platform implements standardized protocols for the integration of diverse phenotypic and environmental data from multiple Littorina species. Likewise, the platform also centralizes the availability of associated genomic data through links to external repositories. This database represents a crucial tool to test complex, large-scale evolutionary hypotheses.\r\n\r\nCollectively, this thesis strongly reinforces the fundamental importance of SGV as the raw material for successful local adaptation, a conclusion supported by evidence in both experimental and accidental introductions. Furthermore, this work highlights the critical role of the genomic architecture—specifically chromosomal inversions—in driving the predictability and effectiveness of adaptive responses. Our findings underscore how the interplay between SGV and genomic architecture dictates the trajectory and detectability of evolution in colonizing populations, while simultaneously providing a necessary tool to advance comparative evolutionary genomics in emerging model organisms.","lang":"eng"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-077-0"]},"alternative_title":["ISTA Thesis"],"year":"2026","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"NiBa"}],"date_created":"2026-01-16T09:47:59Z","author":[{"first_name":"Diego Fernando","id":"ae681a14-dc74-11ea-a0a7-c6ef18161701","full_name":"Garcia Castillo, Diego Fernando","last_name":"Garcia Castillo"}],"file":[{"file_size":22456421,"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","creator":"dgarciac","checksum":"841f1bc073d667125729b2a017f8c37a","date_created":"2026-01-16T12:25:13Z","relation":"source_file","file_name":"2026_Garcia_Diego_Thesis.docx","date_updated":"2026-01-16T12:25:13Z","access_level":"closed","file_id":"20996"},{"file_name":"2026_Garcia_Diego_Thesis.pdf","relation":"main_file","date_updated":"2026-01-16T12:25:13Z","file_id":"20997","access_level":"open_access","content_type":"application/pdf","file_size":9556719,"success":1,"checksum":"a1f33d4f183ce7072eee42a6ccf5340b","creator":"dgarciac","date_created":"2026-01-16T12:25:13Z"},{"date_created":"2026-01-16T13:08:14Z","creator":"dgarciac","checksum":"98a80691067174c30fe53f38ce7344e6","file_size":54491433,"content_type":"application/x-compressed","access_level":"closed","file_id":"20998","date_updated":"2026-01-16T13:08:14Z","description":"Source code of the PostgreSQL database, front-end and back-end of the LittorinaDB web application developed as a product of the 4th chapter of the thesis.","relation":"supplementary_material","file_name":"2026_DiegoGarcia_LittorinaDB Source Code and Protocols.rar"},{"relation":"supplementary_material","file_name":"2026_DiegoGarcia_Thesis-Supplementary_Material.rar","access_level":"open_access","file_id":"20999","date_updated":"2026-01-16T13:08:14Z","content_type":"application/x-compressed","file_size":7982811,"date_created":"2026-01-16T13:08:14Z","creator":"dgarciac","checksum":"99a3cab2fa36666b9a92eefc27d586da"},{"content_type":"text/plain","file_size":732,"creator":"dgarciac","checksum":"255fdf56b2932c46bf27c63aa6106a4f","date_created":"2026-01-16T13:08:59Z","relation":"supplementary_material","file_name":"README.txt","date_updated":"2026-01-16T13:08:59Z","access_level":"open_access","file_id":"21000"}],"page":"199","month":"01","supervisor":[{"full_name":"Barton, Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","first_name":"Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Anja M","id":"3C147470-F248-11E8-B48F-1D18A9856A87","full_name":"Westram, Anja M","last_name":"Westram","orcid":"0000-0003-1050-4969"}]},{"year":"2026","publication_identifier":{"eissn":["2380-8195"]},"issue":"1","month":"01","page":"481-488","author":[{"first_name":"Niraj Nitish","last_name":"Patil","full_name":"Patil, Niraj Nitish"},{"full_name":"Wu, Ruiqi","last_name":"Wu","first_name":"Ruiqi"},{"first_name":"Christine","id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","full_name":"Fiedler, Christine","last_name":"Fiedler"},{"first_name":"Nilotpal","full_name":"Kapuria, Nilotpal","last_name":"Kapuria"},{"last_name":"Nan","full_name":"Nan, Bingfei","first_name":"Bingfei"},{"orcid":"0000-0001-7408-8197","last_name":"Navita","full_name":"Navita, Navita","id":"6ebe278d-ba0b-11ee-8184-f34cdc671de4","first_name":"Navita"},{"full_name":"Cabot, Andreu","last_name":"Cabot","first_name":"Andreu"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","first_name":"Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria"},{"first_name":"Kevin M.","full_name":"Ryan, Kevin M.","last_name":"Ryan"},{"first_name":"Alex M.","full_name":"Ganose, Alex M.","last_name":"Ganose"},{"first_name":"Shalini","last_name":"Singh","full_name":"Singh, Shalini"}],"date_created":"2026-01-18T23:02:43Z","department":[{"_id":"MaIb"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","date_published":"2026-01-09T00:00:00Z","date_updated":"2026-01-19T08:43:21Z","doi":"10.1021/acsenergylett.5c02909","volume":11,"article_type":"letter_note","abstract":[{"text":"Copper chalcogenides offer high charge mobility and low lattice thermal conductivity but suffer from structural instability due to dynamic Cu+ migration. Here, we report a colloidal hot-injection synthesis of ternary cesium copper selenide (CsCu5Se3) nanocrystals (NCs), achieving precise control over phase, size, and morphology through tailored precursor-ligand modulation. This strategy enabled systematic exploration of stable and metastable Cs–Cu–Se phases and mechanistic investigation of nucleation and growth, providing insight into phase modulation and dimensional control at the nanoscale. CsCu5Se3 NCs exhibit low lattice thermal conductivity (∼0.5 Wm–1K–1) and an experimental zT of 0.27 at 718 K. Complementary first-principles calculations, consistent with experimental electronic and optical responses, predict a zT of 1.05 at 1000 K. These findings elucidate the formation dynamics of CsCu5Se3 and establish ABZ (A = alkali, B = metal, Z = chalcogen) NCs as tunable platforms for advanced functional applications.","lang":"eng"}],"quality_controlled":"1","publication":"ACS Energy Letters","intvolume":"        11","OA_type":"closed access","type":"journal_article","scopus_import":"1","title":"Layered alkali-copper selenides: Deciphering thermoelectric properties and reaction pathways for nanostructuring β-CsCu5Se3","_id":"21001","oa_version":"None","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"citation":{"short":"N.N. Patil, R. Wu, C. Fiedler, N. Kapuria, B. Nan, N. Jakhar, A. Cabot, M. Ibáñez, K.M. Ryan, A.M. Ganose, S. Singh, ACS Energy Letters 11 (2026) 481–488.","mla":"Patil, Niraj Nitish, et al. “Layered Alkali-Copper Selenides: Deciphering Thermoelectric Properties and Reaction Pathways for Nanostructuring β-CsCu5Se3.” <i>ACS Energy Letters</i>, vol. 11, no. 1, American Chemical Society, 2026, pp. 481–88, doi:<a href=\"https://doi.org/10.1021/acsenergylett.5c02909\">10.1021/acsenergylett.5c02909</a>.","ieee":"N. N. Patil <i>et al.</i>, “Layered alkali-copper selenides: Deciphering thermoelectric properties and reaction pathways for nanostructuring β-CsCu5Se3,” <i>ACS Energy Letters</i>, vol. 11, no. 1. American Chemical Society, pp. 481–488, 2026.","chicago":"Patil, Niraj Nitish, Ruiqi Wu, Christine Fiedler, Nilotpal Kapuria, Bingfei Nan, Navita Jakhar, Andreu Cabot, et al. “Layered Alkali-Copper Selenides: Deciphering Thermoelectric Properties and Reaction Pathways for Nanostructuring β-CsCu5Se3.” <i>ACS Energy Letters</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acsenergylett.5c02909\">https://doi.org/10.1021/acsenergylett.5c02909</a>.","ista":"Patil NN, Wu R, Fiedler C, Kapuria N, Nan B, Jakhar N, Cabot A, Ibáñez M, Ryan KM, Ganose AM, Singh S. 2026. Layered alkali-copper selenides: Deciphering thermoelectric properties and reaction pathways for nanostructuring β-CsCu5Se3. ACS Energy Letters. 11(1), 481–488.","ama":"Patil NN, Wu R, Fiedler C, et al. Layered alkali-copper selenides: Deciphering thermoelectric properties and reaction pathways for nanostructuring β-CsCu5Se3. <i>ACS Energy Letters</i>. 2026;11(1):481-488. doi:<a href=\"https://doi.org/10.1021/acsenergylett.5c02909\">10.1021/acsenergylett.5c02909</a>","apa":"Patil, N. N., Wu, R., Fiedler, C., Kapuria, N., Nan, B., Jakhar, N., … Singh, S. (2026). Layered alkali-copper selenides: Deciphering thermoelectric properties and reaction pathways for nanostructuring β-CsCu5Se3. <i>ACS Energy Letters</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsenergylett.5c02909\">https://doi.org/10.1021/acsenergylett.5c02909</a>"},"publisher":"American Chemical Society","status":"public","acknowledgement":"This publication has emanated from research conducted with the financial support of Taighde Éireann-Research Ireland under Grant number 22/FFP-P/11591. C.F. and M.I. would like to acknowledge the financial support of ISTA and the Werner Siemens Foundation. N.N.P. acknowledges the financial support of AMBER under grant number 12/rc/2278_p2.","day":"09","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published"},{"publisher":"American Chemical Society","status":"public","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publication_status":"published","acknowledgement":"We gratefully acknowledge the Institute of Science and Technology Austria for generous financial support. B.P. acknowledges the Austrian Science Fund (PAT 1250924) for funding.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"16","file_date_updated":"2026-01-21T09:12:10Z","PlanS_conform":"1","OA_place":"publisher","title":"Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings","citation":{"ama":"Bena A, Pieber B. Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. <i>ACS Catalysis</i>. 2026;16(2):866-881. doi:<a href=\"https://doi.org/10.1021/acscatal.5c07964\">10.1021/acscatal.5c07964</a>","apa":"Bena, A., &#38; Pieber, B. (2026). Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. <i>ACS Catalysis</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acscatal.5c07964\">https://doi.org/10.1021/acscatal.5c07964</a>","short":"A. Bena, B. Pieber, ACS Catalysis 16 (2026) 866–881.","mla":"Bena, Aleksander, and Bartholomäus Pieber. “Advances in NiI/NiIII-Catalyzed C(Sp2)–Heteroatom Cross-Couplings.” <i>ACS Catalysis</i>, vol. 16, no. 2, American Chemical Society, 2026, pp. 866–81, doi:<a href=\"https://doi.org/10.1021/acscatal.5c07964\">10.1021/acscatal.5c07964</a>.","chicago":"Bena, Aleksander, and Bartholomäus Pieber. “Advances in NiI/NiIII-Catalyzed C(Sp2)–Heteroatom Cross-Couplings.” <i>ACS Catalysis</i>. American Chemical Society, 2026. <a href=\"https://doi.org/10.1021/acscatal.5c07964\">https://doi.org/10.1021/acscatal.5c07964</a>.","ista":"Bena A, Pieber B. 2026. Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings. ACS Catalysis. 16(2), 866–881.","ieee":"A. Bena and B. Pieber, “Advances in NiI/NiIII-catalyzed C(sp2)–heteroatom cross-couplings,” <i>ACS Catalysis</i>, vol. 16, no. 2. American Chemical Society, pp. 866–881, 2026."},"_id":"21008","oa_version":"Published Version","project":[{"name":"Photoactive ligands for transformative nickel catalysis","_id":"8f1d607d-16d5-11f0-9cad-ab453295ba5e","grant_number":"PAT 1250924"}],"oa":1,"date_updated":"2026-01-21T09:15:16Z","doi":"10.1021/acscatal.5c07964","volume":16,"article_processing_charge":"Yes (via OA deal)","date_published":"2026-01-16T00:00:00Z","publication":"ACS Catalysis","ddc":["540"],"intvolume":"        16","corr_author":"1","scopus_import":"1","OA_type":"hybrid","type":"journal_article","article_type":"original","abstract":[{"text":"C(sp2)–heteroatom couplings operating via NiI/NiIII catalysis have emerged as an alternative to canonical Pd0/PdII systems that require complex ligand architectures. Despite intensive research efforts during the past decade, catalytic methods employing this approach are still mostly confined to activated starting materials and require high catalyst loadings due to the low catalytic activity of NiI and undesired catalyst deactivation events. This article highlights recent advances in the field toward solving these long-standing challenges. We survey strategies that streamline the generation of catalytically competent NiI species from bench-stable NiII precatalysts, and discuss mechanistic studies that shed light on deactivation pathways and the rate-determining oxidative addition of aryl halides. In the final section, we highlight recently developed synthetic methodologies, which provide evidence that limitations can indeed be addressed by working at elevated temperatures, employing alternative electrophiles, harnessing the benefits of additives, or fine-tuning the metal’s reactivity through the ligand field.","lang":"eng"}],"quality_controlled":"1","publication_identifier":{"eissn":["2155-5435"]},"year":"2026","page":"866-881","file":[{"date_updated":"2026-01-21T09:12:10Z","access_level":"open_access","file_id":"21030","relation":"main_file","file_name":"2026_ACSCatalysis_Bena.pdf","creator":"dernst","checksum":"05743d6d7b4bae37aad1a91471123032","date_created":"2026-01-21T09:12:10Z","content_type":"application/pdf","success":1,"file_size":3797064}],"author":[{"full_name":"Bena, Aleksander","last_name":"Bena","first_name":"Aleksander","id":"4197c39e-e8ec-11ed-86cb-afed934cd664"},{"first_name":"Bartholomäus","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","last_name":"Pieber"}],"department":[{"_id":"BaPi"},{"_id":"GradSch"}],"language":[{"iso":"eng"}],"date_created":"2026-01-20T10:04:57Z","issue":"2","month":"01"},{"title":"Certificates in AI: Learn but verify","PlanS_conform":"1","file_date_updated":"2026-01-21T08:52:07Z","OA_place":"publisher","project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"oa_version":"Published Version","_id":"21012","citation":{"ama":"Barrett C, Henzinger TA, Seshia SA. Certificates in AI: Learn but verify. <i>Communications of the ACM</i>. 2026;69(1):66-75. doi:<a href=\"https://doi.org/10.1145/3737447\">10.1145/3737447</a>","apa":"Barrett, C., Henzinger, T. A., &#38; Seshia, S. A. (2026). Certificates in AI: Learn but verify. <i>Communications of the ACM</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3737447\">https://doi.org/10.1145/3737447</a>","mla":"Barrett, Clark, et al. “Certificates in AI: Learn but Verify.” <i>Communications of the ACM</i>, vol. 69, no. 1, Association for Computing Machinery, 2026, pp. 66–75, doi:<a href=\"https://doi.org/10.1145/3737447\">10.1145/3737447</a>.","short":"C. Barrett, T.A. Henzinger, S.A. Seshia, Communications of the ACM 69 (2026) 66–75.","ista":"Barrett C, Henzinger TA, Seshia SA. 2026. Certificates in AI: Learn but verify. Communications of the ACM. 69(1), 66–75.","ieee":"C. Barrett, T. A. Henzinger, and S. A. Seshia, “Certificates in AI: Learn but verify,” <i>Communications of the ACM</i>, vol. 69, no. 1. Association for Computing Machinery, pp. 66–75, 2026.","chicago":"Barrett, Clark, Thomas A Henzinger, and Sanjit A. Seshia. “Certificates in AI: Learn but Verify.” <i>Communications of the ACM</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3737447\">https://doi.org/10.1145/3737447</a>."},"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"status":"public","has_accepted_license":"1","publisher":"Association for Computing Machinery","acknowledgement":"T.A.H. thanks Đorde Žikelic for many stimulating discussions about CML. This work was supported in part by NSFCPS Frontier Grant 1545126, by a BAIR Commons project, by the Berkeley iCy-Phy Center, by the Stanford Center for Automated Reasoning, and by the ERC Advanced Grant 101020093.","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","year":"2026","publication_identifier":{"eissn":["1557-7317"],"issn":["0001-0782"]},"month":"01","issue":"1","author":[{"last_name":"Barrett","full_name":"Barrett, Clark","first_name":"Clark"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724"},{"full_name":"Seshia, Sanjit A.","last_name":"Seshia","first_name":"Sanjit A."}],"department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"date_created":"2026-01-20T10:08:21Z","page":"66-75","file":[{"date_created":"2026-01-21T08:52:07Z","checksum":"d909a9091c254b2d18ba014124663f69","creator":"dernst","content_type":"application/pdf","file_size":2623108,"success":1,"file_id":"21028","access_level":"open_access","date_updated":"2026-01-21T08:52:07Z","file_name":"2026_CommACM_Barrett.pdf","relation":"main_file"}],"article_processing_charge":"Yes (via OA deal)","date_published":"2026-01-01T00:00:00Z","doi":"10.1145/3737447","volume":69,"oa":1,"date_updated":"2026-01-21T08:55:24Z","abstract":[{"text":"In certifiable machine learning, AI systems produce not only results but also verifiable certificates that the results can be trusted.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1","article_type":"original","OA_type":"hybrid","type":"journal_article","scopus_import":"1","publication":"Communications of the ACM","ddc":["000"],"intvolume":"        69","corr_author":"1"},{"publication_status":"published","acknowledgement":"The authors gratefully acknowledge funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp). We are grateful to three anonymous reviewer(s) for their insightful suggestions that have improved the quality of our manuscript. Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"12","has_accepted_license":"1","status":"public","publisher":"Wiley","article_number":"e2024MS004576","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"citation":{"ama":"GOSWAMI BB, Lu Z, Muller CJ. Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. <i>Journal of Advances in Modeling Earth Systems</i>. 2026;18(1). doi:<a href=\"https://doi.org/10.1029/2024ms004576\">10.1029/2024ms004576</a>","apa":"GOSWAMI, B. B., Lu, Z., &#38; Muller, C. J. (2026). Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. <i>Journal of Advances in Modeling Earth Systems</i>. Wiley. <a href=\"https://doi.org/10.1029/2024ms004576\">https://doi.org/10.1029/2024ms004576</a>","short":"B.B. GOSWAMI, Z. Lu, C.J. Muller, Journal of Advances in Modeling Earth Systems 18 (2026).","mla":"GOSWAMI, BIDYUT B., et al. “Convective Self‐aggregation in Diurnally Oscillating Sea Surface Temperature and Solar Forcing Experiments.” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 18, no. 1, e2024MS004576, Wiley, 2026, doi:<a href=\"https://doi.org/10.1029/2024ms004576\">10.1029/2024ms004576</a>.","ista":"GOSWAMI BB, Lu Z, Muller CJ. 2026. Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments. Journal of Advances in Modeling Earth Systems. 18(1), e2024MS004576.","ieee":"B. B. GOSWAMI, Z. Lu, and C. J. Muller, “Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments,” <i>Journal of Advances in Modeling Earth Systems</i>, vol. 18, no. 1. Wiley, 2026.","chicago":"GOSWAMI, BIDYUT B, Ziyin Lu, and Caroline J Muller. “Convective Self‐aggregation in Diurnally Oscillating Sea Surface Temperature and Solar Forcing Experiments.” <i>Journal of Advances in Modeling Earth Systems</i>. Wiley, 2026. <a href=\"https://doi.org/10.1029/2024ms004576\">https://doi.org/10.1029/2024ms004576</a>."},"project":[{"call_identifier":"H2020","grant_number":"805041","_id":"629205d8-2b32-11ec-9570-e1356ff73576","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate"}],"oa_version":"Published Version","_id":"21013","title":"Convective self‐aggregation in diurnally oscillating sea surface temperature and solar forcing experiments","file_date_updated":"2026-01-21T08:39:01Z","PlanS_conform":"1","OA_place":"publisher","acknowledged_ssus":[{"_id":"ScienComp"}],"type":"journal_article","scopus_import":"1","OA_type":"gold","DOAJ_listed":"1","ddc":["550"],"publication":"Journal of Advances in Modeling Earth Systems","intvolume":"        18","corr_author":"1","abstract":[{"text":"We have addressed convective self‐aggregation (CSA) in steady and oscillating sea surface temperature (SST) and solar radiation (SOLIN) cloud‐resolving model simulations in a non‐rotating radiative‐convective equilibrium (RCE) framework. Our experiment designs are motivated by land‐ocean heterogeneity of atmospheric convection. The steady and oscillating forcings are idealizations of ocean and land conditions, respectively, based on their differences in heat capacities. In both kinds of simulations, the diurnal mean SST and SOLIN are the same, and both SST and SOLIN are only varied in time (i.e., they are spatially homogeneous at any given time). We find that diurnally oscillating forcing accelerates CSA. Stronger long‐wave cooling in dry regions at night and during the warm SST phase (late afternoon) both allow the long‐wave feedback, known to favor aggregation, to intensify compared to steady forcing simulations. In addition to the long‐wave, reduced short‐wave warming in dry regions (during the day) further enhances radiative cooling there compared to moist regions. Overall, the radiative cooling is enhanced in dry regions compared to neighboring moist convective regions. A dry subsidence is driven by this net radiative (short‐wave plus long‐wave) cooling, consistent with earlier work on CSA. Stronger radiative cooling allows stronger subsidence which allows low‐level circulation to more efficiently transport moisture and energy up‐gradient, driving convection to aggregate faster. We also note a sensitivity of our experimental setup to initial conditions, more so at warmer SST. This stochastic behavior might be critical in reconciling the differences of opinion regarding the response of convection aggregation to oscillating SST forcing.","lang":"eng"}],"ec_funded":1,"quality_controlled":"1","article_type":"original","volume":18,"doi":"10.1029/2024ms004576","oa":1,"date_updated":"2026-01-21T08:41:19Z","article_processing_charge":"Yes","date_published":"2026-01-12T00:00:00Z","author":[{"id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b","first_name":"BIDYUT B","orcid":"0000-0001-8602-3083","last_name":"GOSWAMI","full_name":"GOSWAMI, BIDYUT B"},{"first_name":"Ziyin","id":"a6e549c6-8972-11ed-ae7b-a336d97ac043","full_name":"Lu, Ziyin","last_name":"Lu","orcid":"0009-0008-5320-7730"},{"full_name":"Muller, Caroline J","last_name":"Muller","orcid":"0000-0001-5836-5350","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b"}],"date_created":"2026-01-20T10:08:54Z","language":[{"iso":"eng"}],"department":[{"_id":"CaMu"},{"_id":"BjHo"},{"_id":"GradSch"}],"file":[{"file_size":19509786,"content_type":"application/pdf","success":1,"checksum":"6ea369e3b46bea58efab4f38b6c671a7","creator":"dernst","date_created":"2026-01-21T08:39:01Z","file_name":"2026_JAMES_Goswami.pdf","relation":"main_file","date_updated":"2026-01-21T08:39:01Z","file_id":"21027","access_level":"open_access"}],"month":"01","issue":"1","publication_identifier":{"eissn":["1942-2466"]},"year":"2026"},{"article_type":"original","quality_controlled":"1","ec_funded":1,"abstract":[{"text":"Early embryo geometry is one of the most invariant species-specific traits, yet its role in ensuring developmental reproducibility and robustness remains underexplored. Here we show that in zebrafish, the geometry of the fertilized egg—specifically its curvature and volume—serves as a critical initial condition triggering a cascade of events that influence development. The embryo geometry guides patterned asymmetric cell divisions in the blastoderm, generating radial gradients of cell volume and nucleocytoplasmic ratio. These gradients generate mitotic phase waves, with the nucleocytoplasmic ratio determining individual cell cycle periods independently of other cells. We demonstrate that reducing cell autonomy reshapes these waves, emphasizing the instructive role of geometry-derived volume patterns in setting the intrinsic period of the cell cycle oscillator. In addition to organizing cell cycles, early embryo geometry spatially patterns zygotic genome activation at the midblastula transition, a key step in establishing embryonic autonomy. Disrupting the embryo shape alters the zygotic genome activation pattern and causes ectopic germ layer specification, underscoring the developmental significance of geometry. Together, our findings reveal a symmetry-breaking function of early embryo geometry in coordinating cell cycle and transcriptional patterning.","lang":"eng"}],"corr_author":"1","intvolume":"        22","ddc":["570"],"publication":"Nature Physics","OA_type":"hybrid","scopus_import":"1","type":"journal_article","date_published":"2026-01-05T00:00:00Z","article_processing_charge":"Yes (via OA deal)","date_updated":"2026-04-28T12:55:30Z","oa":1,"volume":22,"doi":"10.1038/s41567-025-03122-1","month":"01","file":[{"relation":"main_file","file_name":"2026_NaturePhysics_Mishra.pdf","access_level":"open_access","file_id":"21026","date_updated":"2026-01-21T08:21:11Z","success":1,"file_size":7335694,"content_type":"application/pdf","date_created":"2026-01-21T08:21:11Z","creator":"dernst","checksum":"0ab7ac2fbcb61a364dba57152db64ed7"}],"page":"139-150","language":[{"iso":"eng"}],"date_created":"2026-01-20T10:12:19Z","department":[{"_id":"EdHa"},{"_id":"CaHe"}],"author":[{"id":"C4D70E82-1081-11EA-B3ED-9A4C3DDC885E","first_name":"Nikhil","last_name":"Mishra","orcid":"0000-0002-6425-5788","full_name":"Mishra, Nikhil"},{"full_name":"Li, Yuting I","last_name":"Li","first_name":"Yuting I","id":"ee7a5ca8-8b71-11ed-b662-b3341c05b7eb"},{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","last_name":"Hannezo","first_name":"Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J","orcid":"0000-0002-0912-4566","last_name":"Heisenberg"}],"year":"2026","publication_identifier":{"eissn":["1745-2481"],"issn":["1745-2473"],"issnl":[" 1745-2473"]},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","day":"05","acknowledgement":"We thank N. Petridou (EMBL) for sharing results before publication. N.M. was supported by funding from the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie COFUND Actions ISTplus grant agreement number 754411. Y.I.L. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement number 101034413. The research was supported by funding to C.-P.H. from the NOMIS Foundation, Project ID 1.844. We would like to thank past and present members of the Heisenberg and Hannezo groups for discussions, particularly S. Shamipour, V. Doddihal, M. Jovic, N. Hino, F. N. Arslan, R. Kobylinska and C. Camelo for feedback on the draft manuscript. This research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria through resources provided by the Aquatics Facility, Imaging & Optics Facility (IOF), Scientific Computing (SciComp) facility and Lab Support Facility (LSF). Open access funding provided by Institute of Science and Technology (IST Austria).","publication_status":"published","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"external_id":{"oaworkid":["W7118187193"]},"publisher":"Springer Nature","status":"public","has_accepted_license":"1","_id":"21015","oa_version":"Published Version","oaworkid":1,"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"917c023a-16d5-11f0-9cad-eb5cafc52090","name":"Cytoplasmic self-organization into cell-like compartments as a common guiding principle in early animal development"}],"related_material":{"link":[{"description":"News on ISTA website","relation":"research_data","url":"https://ista.ac.at/en/news/geometry-shapes-life/"}]},"citation":{"ama":"Mishra N, Li YI, Hannezo EB, Heisenberg C-PJ. Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. <i>Nature Physics</i>. 2026;22:139-150. doi:<a href=\"https://doi.org/10.1038/s41567-025-03122-1\">10.1038/s41567-025-03122-1</a>","apa":"Mishra, N., Li, Y. I., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (2026). Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. <i>Nature Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41567-025-03122-1\">https://doi.org/10.1038/s41567-025-03122-1</a>","short":"N. Mishra, Y.I. Li, E.B. Hannezo, C.-P.J. Heisenberg, Nature Physics 22 (2026) 139–150.","mla":"Mishra, Nikhil, et al. “Geometry-Driven Asymmetric Cell Divisions Pattern Cell Cycles and Zygotic Genome Activation in the Zebrafish Embryo.” <i>Nature Physics</i>, vol. 22, Springer Nature, 2026, pp. 139–50, doi:<a href=\"https://doi.org/10.1038/s41567-025-03122-1\">10.1038/s41567-025-03122-1</a>.","ista":"Mishra N, Li YI, Hannezo EB, Heisenberg C-PJ. 2026. Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo. Nature Physics. 22, 139–150.","chicago":"Mishra, Nikhil, Yuting I Li, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Geometry-Driven Asymmetric Cell Divisions Pattern Cell Cycles and Zygotic Genome Activation in the Zebrafish Embryo.” <i>Nature Physics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41567-025-03122-1\">https://doi.org/10.1038/s41567-025-03122-1</a>.","ieee":"N. Mishra, Y. I. Li, E. B. Hannezo, and C.-P. J. Heisenberg, “Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo,” <i>Nature Physics</i>, vol. 22. Springer Nature, pp. 139–150, 2026."},"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"OA_place":"publisher","PlanS_conform":"1","file_date_updated":"2026-01-21T08:21:11Z","title":"Geometry-driven asymmetric cell divisions pattern cell cycles and zygotic genome activation in the zebrafish embryo"}]