[{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"101076224","_id":"bd9b2118-d553-11ed-ba76-db24564edfea","name":"Young galaxies as tracers and agents of cosmic reionization"}],"publication":"Science","article_type":"comment","year":"2026","acknowledgement":"The author acknowledges the support from the European Union (European Research Council, AGENTS, 101076224).","publication_identifier":{"eissn":["1095-9203"]},"date_published":"2026-02-19T00:00:00Z","intvolume":"       391","doi":"10.1126/science.adz8603","day":"19","article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"page":"767-768","date_updated":"2026-03-02T09:15:45Z","title":"Black holes disguised as little red dots","author":[{"first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"}],"oa_version":"None","publisher":"AAAS","corr_author":"1","department":[{"_id":"JoMa"}],"OA_type":"closed access","volume":391,"quality_controlled":"1","citation":{"short":"J.J. Matthee, Science 391 (2026) 767–768.","ieee":"J. J. Matthee, “Black holes disguised as little red dots,” <i>Science</i>, vol. 391, no. 6787. AAAS, pp. 767–768, 2026.","apa":"Matthee, J. J. (2026). Black holes disguised as little red dots. <i>Science</i>. AAAS. <a href=\"https://doi.org/10.1126/science.adz8603\">https://doi.org/10.1126/science.adz8603</a>","ama":"Matthee JJ. Black holes disguised as little red dots. <i>Science</i>. 2026;391(6787):767-768. doi:<a href=\"https://doi.org/10.1126/science.adz8603\">10.1126/science.adz8603</a>","chicago":"Matthee, Jorryt J. “Black Holes Disguised as Little Red Dots.” <i>Science</i>. AAAS, 2026. <a href=\"https://doi.org/10.1126/science.adz8603\">https://doi.org/10.1126/science.adz8603</a>.","ista":"Matthee JJ. 2026. Black holes disguised as little red dots. Science. 391(6787), 767–768.","mla":"Matthee, Jorryt J. “Black Holes Disguised as Little Red Dots.” <i>Science</i>, vol. 391, no. 6787, AAAS, 2026, pp. 767–68, doi:<a href=\"https://doi.org/10.1126/science.adz8603\">10.1126/science.adz8603</a>."},"pmid":1,"abstract":[{"lang":"eng","text":"There may be a newly identified early phase of supermassive black hole growth"}],"type":"journal_article","scopus_import":"1","issue":"6787","month":"02","_id":"21371","external_id":{"pmid":["41712710"]},"date_created":"2026-03-01T23:01:39Z","publication_status":"published"},{"doi":"10.1103/16dk-5dgx","day":"06","oa":1,"file":[{"file_id":"21376","date_updated":"2026-03-02T09:24:44Z","relation":"main_file","checksum":"172720f1f0c5c9d06a282e52023a0030","content_type":"application/pdf","file_size":16789781,"creator":"dernst","success":1,"date_created":"2026-03-02T09:24:44Z","file_name":"2026_JPhysPhotonics_Volpe.pdf","access_level":"open_access"}],"intvolume":"         8","date_published":"2026-02-06T00:00:00Z","article_number":"L012034","ec_funded":1,"acknowledgement":"We thank Georgios Koutentakis, Frédéric Chevy, Hussam Al Daas, and Richard Schmidt for fruitful discussions; Jan Arlt for sharing their experimental data and many fruitful discussions; and Christoph Eigen for sharing their experimental data and inspiring discussions. R.A., T.P., and G.M.B. have been supported in part by the Danish National Research Foundation through the Center of Excellence “CCQ” (Grant Agreement No. DNRF156) and the Independent Research Fund Denmark–Natural Sciences via Grant No. DFF-8021-00233B. R.A., A.G.V., and M.L. acknowledge support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). R.A. received funding from the Austrian Academy of Science ÖAW Grant No. PR1029OEAW03.","year":"2026","article_type":"letter_note","publication_identifier":{"issn":["2643-1564"]},"publication":"Physical Review Research","arxiv":1,"project":[{"call_identifier":"H2020","grant_number":"801770","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle"},{"grant_number":"12078","name":"Polarons in Lead Halide Perovskites","_id":"8fa7db46-16d5-11f0-9cad-917600954daf"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["530"],"OA_place":"publisher","oa_version":"Published Version","DOAJ_listed":"1","title":"Phenomenological model of decaying Bose polarons","author":[{"first_name":"Ragheed","full_name":"Al Hyder, Ragheed","last_name":"Al Hyder","id":"d1c405be-ae15-11ed-8510-ccf53278162e"},{"full_name":"Bruun, G. M.","last_name":"Bruun","first_name":"G. M."},{"full_name":"Pohl, T.","last_name":"Pohl","first_name":"T."},{"first_name":"Mikhail","orcid":"0000-0002-6990-7802","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0003-0393-5525","id":"37D278BC-F248-11E8-B48F-1D18A9856A87","last_name":"Volosniev","full_name":"Volosniev, Artem","first_name":"Artem"}],"date_updated":"2026-03-02T09:27:26Z","language":[{"iso":"eng"}],"status":"public","file_date_updated":"2026-03-02T09:24:44Z","has_accepted_license":"1","article_processing_charge":"No","abstract":[{"lang":"eng","text":"Cold atom experiments show that a mobile impurity particle immersed in a weakly interacting Bose-Einstein condensate forms a well-defined quasiparticle (Bose polaron) for weak to moderate impurity-boson interaction strengths, whereas a significant line broadening is consistently observed for strong interactions. Motivated by this, we introduce a phenomenological theory based on the assumption that the most relevant states are characterized by the impurity correlated with at most one boson, since they have the largest overlap with the uncorrelated states to which the most common experimental probes couple. These experimentally relevant states can, however, decay to lower energy states characterized by correlations involving multiple bosons, and we model this using a minimal variational wave function combined with a complex impurity-boson interaction strength. We first motivate this approach by comparing to a more elaborate theory that includes correlations with up to two bosons. Our phenomenological model is shown to recover the main results of two recent experiments probing both the spectral and the nonequilibrium properties of the Bose polaron. Our work offers an intuitive framework for analyzing experimental data and highlights the importance of understanding the complicated problem of the Bose polaron decay in a many-body setting."}],"type":"journal_article","citation":{"short":"R. Al Hyder, G.M. Bruun, T. Pohl, M. Lemeshko, A. Volosniev, Physical Review Research 8 (2026).","ieee":"R. Al Hyder, G. M. Bruun, T. Pohl, M. Lemeshko, and A. Volosniev, “Phenomenological model of decaying Bose polarons,” <i>Physical Review Research</i>, vol. 8. American Physical Society, 2026.","ama":"Al Hyder R, Bruun GM, Pohl T, Lemeshko M, Volosniev A. Phenomenological model of decaying Bose polarons. <i>Physical Review Research</i>. 2026;8. doi:<a href=\"https://doi.org/10.1103/16dk-5dgx\">10.1103/16dk-5dgx</a>","apa":"Al Hyder, R., Bruun, G. M., Pohl, T., Lemeshko, M., &#38; Volosniev, A. (2026). Phenomenological model of decaying Bose polarons. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/16dk-5dgx\">https://doi.org/10.1103/16dk-5dgx</a>","mla":"Al Hyder, Ragheed, et al. “Phenomenological Model of Decaying Bose Polarons.” <i>Physical Review Research</i>, vol. 8, L012034, American Physical Society, 2026, doi:<a href=\"https://doi.org/10.1103/16dk-5dgx\">10.1103/16dk-5dgx</a>.","ista":"Al Hyder R, Bruun GM, Pohl T, Lemeshko M, Volosniev A. 2026. Phenomenological model of decaying Bose polarons. Physical Review Research. 8, L012034.","chicago":"Al Hyder, Ragheed, G. M. Bruun, T. Pohl, Mikhail Lemeshko, and Artem Volosniev. “Phenomenological Model of Decaying Bose Polarons.” <i>Physical Review Research</i>. American Physical Society, 2026. <a href=\"https://doi.org/10.1103/16dk-5dgx\">https://doi.org/10.1103/16dk-5dgx</a>."},"quality_controlled":"1","volume":8,"OA_type":"gold","department":[{"_id":"MiLe"}],"corr_author":"1","publisher":"American Physical Society","PlanS_conform":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2026-03-01T23:01:39Z","external_id":{"arxiv":["2507.04143"]},"_id":"21373","month":"02","scopus_import":"1"},{"arxiv":1,"publication":"51st International Conference on Current Trends in Theory and Practice of Computer Science","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","oa":1,"doi":"10.1007/978-3-032-17801-5_39","day":"13","date_published":"2026-02-13T00:00:00Z","intvolume":"     16448","year":"2026","acknowledgement":"We thank the organizers of the HOMONOLO 2024 workshop in Nová Louka, Czech Republic, for the fruitful atmosphere where the research on this project was initiated.\r\n\r\nT. Antić, A. Džuklevski, J. Kratochvíl and M. Saumell received funding from GAČR grant 23–04949X, T.A and A.Dž were additionally supported by GAUK grant SVV–2025–260822. G. Liotta was supported in part by MUR of Italy, PRIN Project no. 2022TS4Y3N – EXPAND and PON Project ARS01_00540. J. Fiala was in part supported by GAČR grant 25-16847S.","publication_identifier":{"eissn":["1611-3349"],"isbn":["9783032178008"],"issn":["0302-9743"]},"author":[{"first_name":"Todor","last_name":"Antić","full_name":"Antić, Todor"},{"last_name":"Džuklevski","full_name":"Džuklevski, Aleksa","first_name":"Aleksa"},{"last_name":"Fiala","full_name":"Fiala, Jiří","first_name":"Jiří"},{"first_name":"Jan","full_name":"Kratochvíl, Jan","last_name":"Kratochvíl"},{"full_name":"Liotta, Giuseppe","last_name":"Liotta","first_name":"Giuseppe"},{"id":"f86f7148-b140-11ec-9577-95435b8df824","last_name":"Saghafian","full_name":"Saghafian, Morteza","first_name":"Morteza"},{"first_name":"Maria","full_name":"Saumell, Maria","last_name":"Saumell"},{"last_name":"Zink","full_name":"Zink, Johannes","first_name":"Johannes"}],"title":"Edge-constrained Hamiltonian paths on a point set","page":"532-546","date_updated":"2026-03-02T08:49:20Z","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","oa_version":"Preprint","volume":16448,"department":[{"_id":"HeEd"}],"OA_type":"green","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2511.22526"}],"citation":{"short":"T. Antić, A. Džuklevski, J. Fiala, J. Kratochvíl, G. Liotta, M. Saghafian, M. Saumell, J. Zink, in:, 51st International Conference on Current Trends in Theory and Practice of Computer Science, Springer Nature, 2026, pp. 532–546.","ieee":"T. Antić <i>et al.</i>, “Edge-constrained Hamiltonian paths on a point set,” in <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, Krakow, Poland, 2026, vol. 16448, pp. 532–546.","apa":"Antić, T., Džuklevski, A., Fiala, J., Kratochvíl, J., Liotta, G., Saghafian, M., … Zink, J. (2026). Edge-constrained Hamiltonian paths on a point set. In <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i> (Vol. 16448, pp. 532–546). Krakow, Poland: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">https://doi.org/10.1007/978-3-032-17801-5_39</a>","ama":"Antić T, Džuklevski A, Fiala J, et al. Edge-constrained Hamiltonian paths on a point set. In: <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>. Vol 16448. Springer Nature; 2026:532-546. doi:<a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">10.1007/978-3-032-17801-5_39</a>","chicago":"Antić, Todor, Aleksa Džuklevski, Jiří Fiala, Jan Kratochvíl, Giuseppe Liotta, Morteza Saghafian, Maria Saumell, and Johannes Zink. “Edge-Constrained Hamiltonian Paths on a Point Set.” In <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, 16448:532–46. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">https://doi.org/10.1007/978-3-032-17801-5_39</a>.","ista":"Antić T, Džuklevski A, Fiala J, Kratochvíl J, Liotta G, Saghafian M, Saumell M, Zink J. 2026. Edge-constrained Hamiltonian paths on a point set. 51st International Conference on Current Trends in Theory and Practice of Computer Science. SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science, LNCS, vol. 16448, 532–546.","mla":"Antić, Todor, et al. “Edge-Constrained Hamiltonian Paths on a Point Set.” <i>51st International Conference on Current Trends in Theory and Practice of Computer Science</i>, vol. 16448, Springer Nature, 2026, pp. 532–46, doi:<a href=\"https://doi.org/10.1007/978-3-032-17801-5_39\">10.1007/978-3-032-17801-5_39</a>."},"type":"conference","abstract":[{"text":"Let . S be a set of distinct points in general position in the\r\nEuclidean plane. A plane Hamiltonian path on . S is a crossing-free geometric path such that every point of .S is a vertex of the path. It is\r\nknown that, if. S is sufficiently large, there exist three edge-disjoint plane\r\nHamiltonian paths on . S. In this paper we study an edge-constrained\r\nversion of the problem of finding Hamiltonian paths on a point set. We\r\nfirst consider the problem of finding a single plane Hamiltonian path . π\r\nwith endpoints .s, t ∈ S and constraints given by a segment . ab, where\r\n.a, b ∈ S. We consider the following scenarios: (i) .ab ∈ π; (ii) .ab π. We\r\ncharacterize those quintuples . S, a, b, s, t for which . π exists. Secondly,\r\nwe consider the problem of finding two plane Hamiltonian paths . π1, π2\r\non a set . S with constraints given by a segment . ab, where .a, b ∈ S. We\r\nconsider the following scenarios: (i) .π1 and .π2 share no edges and .ab is\r\nan edge of . π1; (ii) .π1 and .π2 share no edges and none of them includes\r\n.ab as an edge; (iii) both .π1 and .π2 include .ab as an edge and share no\r\nother edges. In all cases, we characterize those triples . S, a, b for which\r\n.π1 and .π2 exist.","lang":"eng"}],"quality_controlled":"1","_id":"21374","month":"02","scopus_import":"1","publication_status":"published","date_created":"2026-03-01T23:01:40Z","conference":{"end_date":"2026-02-13","location":"Krakow, Poland","name":"SOFSEM: Conference on Current Trends in Theory and Practice of Computer Science","start_date":"2026-02-09"},"external_id":{"arxiv":["2511.22526"]},"alternative_title":["LNCS"]},{"external_id":{"pmid":["41673453"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"PlanS_conform":"1","publication_status":"published","date_created":"2026-03-02T10:04:49Z","month":"02","issue":"2","scopus_import":"1","_id":"21378","citation":{"short":"A. Amrapali Vishwanath, T. Comyn, R.G. Mira, C. Brossier, C. Pascual-Caro, M. Faour, K. Boumendil, C. Chintaluri, C. Ramon-Duaso, R. Fan, K. Ghosh, H. Farrants, J.-P. Berwick, R. Sivakumar, M. Lopez-Manzaneda, E.R. Schreiter, T. Preat, T.P. Vogels, V. Rangaraju, A. Busquets-Garcia, P.-Y. Plaçais, A. Pavlowsky, J. de Juan-Sanz, Nature Metabolism 8 (2026) 467–488.","apa":"Amrapali Vishwanath, A., Comyn, T., Mira, R. G., Brossier, C., Pascual-Caro, C., Faour, M., … de Juan-Sanz, J. (2026). Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species. <i>Nature Metabolism</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42255-026-01451-w\">https://doi.org/10.1038/s42255-026-01451-w</a>","ieee":"A. Amrapali Vishwanath <i>et al.</i>, “Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species,” <i>Nature Metabolism</i>, vol. 8, no. 2. Springer Nature, pp. 467–488, 2026.","ama":"Amrapali Vishwanath A, Comyn T, Mira RG, et al. Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species. <i>Nature Metabolism</i>. 2026;8(2):467-488. doi:<a href=\"https://doi.org/10.1038/s42255-026-01451-w\">10.1038/s42255-026-01451-w</a>","mla":"Amrapali Vishwanath, Anjali, et al. “Mitochondrial Ca2+ Efflux Controls Neuronal Metabolism and Long-Term Memory across Species.” <i>Nature Metabolism</i>, vol. 8, no. 2, Springer Nature, 2026, pp. 467–88, doi:<a href=\"https://doi.org/10.1038/s42255-026-01451-w\">10.1038/s42255-026-01451-w</a>.","chicago":"Amrapali Vishwanath, Anjali, Typhaine Comyn, Rodrigo G. Mira, Claire Brossier, Carlos Pascual-Caro, Maya Faour, Kahina Boumendil, et al. “Mitochondrial Ca2+ Efflux Controls Neuronal Metabolism and Long-Term Memory across Species.” <i>Nature Metabolism</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s42255-026-01451-w\">https://doi.org/10.1038/s42255-026-01451-w</a>.","ista":"Amrapali Vishwanath A, Comyn T, Mira RG, Brossier C, Pascual-Caro C, Faour M, Boumendil K, Chintaluri C, Ramon-Duaso C, Fan R, Ghosh K, Farrants H, Berwick J-P, Sivakumar R, Lopez-Manzaneda M, Schreiter ER, Preat T, Vogels TP, Rangaraju V, Busquets-Garcia A, Plaçais P-Y, Pavlowsky A, de Juan-Sanz J. 2026. Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species. Nature Metabolism. 8(2), 467–488."},"pmid":1,"type":"journal_article","abstract":[{"text":"From insects to mammals, essential brain functions, such as forming long-term memories (LTMs), increase metabolic activity in stimulated neurons to meet the energetic demand associated with brain activation. However, while impairing neuronal metabolism limits brain performance, whether expanding the metabolic capacity of neurons boosts brain function remains poorly understood. Here, we show that LTM formation of flies and mice can be enhanced by increasing mitochondrial metabolism in central memory circuits. By knocking down the mitochondrial Ca2+ exporter Letm1, we favour Ca2+ retention in the mitochondrial matrix of neurons due to reduction of mitochondrial H+/Ca2+ exchange. The resulting increase in mitochondrial Ca2+ over-activates mitochondrial metabolism in neurons of central memory circuits, leading to improved LTM storage in training paradigms in which wild-type counterparts of both species fail to remember. Our findings unveil an evolutionarily conserved mechanism that controls mitochondrial metabolism in neurons and indicate its involvement in shaping higher brain functions, such as LTM.","lang":"eng"}],"quality_controlled":"1","publisher":"Springer Nature","volume":8,"OA_type":"hybrid","department":[{"_id":"TiVo"}],"oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","file_date_updated":"2026-03-02T15:21:27Z","title":"Mitochondrial Ca2+ efflux controls neuronal metabolism and long-term memory across species","author":[{"full_name":"Amrapali Vishwanath, Anjali","last_name":"Amrapali Vishwanath","first_name":"Anjali"},{"first_name":"Typhaine","full_name":"Comyn, Typhaine","last_name":"Comyn"},{"full_name":"Mira, Rodrigo G.","last_name":"Mira","first_name":"Rodrigo G."},{"first_name":"Claire","full_name":"Brossier, Claire","last_name":"Brossier"},{"full_name":"Pascual-Caro, Carlos","last_name":"Pascual-Caro","first_name":"Carlos"},{"first_name":"Maya","last_name":"Faour","full_name":"Faour, Maya"},{"first_name":"Kahina","last_name":"Boumendil","full_name":"Boumendil, Kahina"},{"first_name":"Chaitanya","id":"BA06AFEE-A4BA-11EA-AE5C-14673DDC885E","full_name":"Chintaluri, Chaitanya","last_name":"Chintaluri","orcid":"0000-0003-4252-1608"},{"first_name":"Carla","full_name":"Ramon-Duaso, Carla","last_name":"Ramon-Duaso"},{"first_name":"Ruolin","full_name":"Fan, Ruolin","last_name":"Fan"},{"full_name":"Ghosh, Kishalay","last_name":"Ghosh","first_name":"Kishalay"},{"first_name":"Helen","last_name":"Farrants","full_name":"Farrants, Helen"},{"first_name":"Jean-Paul","full_name":"Berwick, Jean-Paul","last_name":"Berwick"},{"full_name":"Sivakumar, Riya","last_name":"Sivakumar","first_name":"Riya"},{"first_name":"Mario","last_name":"Lopez-Manzaneda","full_name":"Lopez-Manzaneda, Mario"},{"first_name":"Eric R.","last_name":"Schreiter","full_name":"Schreiter, Eric R."},{"full_name":"Preat, Thomas","last_name":"Preat","first_name":"Thomas"},{"first_name":"Tim P","orcid":"0000-0003-3295-6181","full_name":"Vogels, Tim P","last_name":"Vogels","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425"},{"first_name":"Vidhya","last_name":"Rangaraju","full_name":"Rangaraju, Vidhya"},{"first_name":"Arnau","last_name":"Busquets-Garcia","full_name":"Busquets-Garcia, Arnau"},{"first_name":"Pierre-Yves","full_name":"Plaçais, Pierre-Yves","last_name":"Plaçais"},{"last_name":"Pavlowsky","full_name":"Pavlowsky, Alice","first_name":"Alice"},{"first_name":"Jaime","full_name":"de Juan-Sanz, Jaime","last_name":"de Juan-Sanz"}],"date_updated":"2026-03-02T15:23:10Z","page":"467-488","acknowledgement":"We thank all members of the laboratory of J.d.J.-S. for insightful discussions and comments. We thank S. Perez for technical assistance. This work was made possible by the Paris Brain Institute Diane Barriere Chair in Synaptic Bioenergetics awarded to J.d.J.-S., who is also supported by an ERC Starting Grant (SynaptoEnergy, European Research Council; ERC-StG-852873), 2019 ATIP-Avenir Grant (CNRS, Inserm), a Big Brain Theory Grant (ICM Foundation) and a Kavli Exploratory Award (Kavli Foundation). This work was also supported by an ERC Advanced Grant (EnergyMeMo; ERC-AdG-741550) to T.P. and grants from the Agence Nationale de la Recherche to P.Y.P. (ANR-20-CE92-0047-01), T.P. (ANR-23-CE16-0029-01), A.P. and J.d.J.-S. (ANR-22-CE16-0020) and J.d.J.-S. (ANR-24-CE16-0221). T.P., P.Y.P. and J.d.J.-S. are permanent CNRS researchers. A.P. is a permanent ESPCI associate professor. T.C. was funded by the French Ministry of Research and the Fondation pour la Recherche Médicale. V.R. was funded by the Max Planck Society, the Chan Zuckerberg Initiative DAF, an advised fund of the Silicon Valley Community Foundation grant number 2024-349543 and the NIH Director’s New Innovator Award (DP2 MH140148). A.B.-G. and C.R.-D. received funding from an ERC Starting Grant (HighMemory; ERC-StG-948217), the Ministry of Economy and Competitiveness (PID2021-122795OB-I00) and the Departament d’Economia i Coneixement de la Generalitat de Catalunya (SGR 00022). T.P.V. was funded by the Wellcome Trust and a Royal Society Sir Henry Dale Research Fellowship (WT100000) and a Wellcome Trust Senior Research Fellowship (214316/Z/18/Z). K.G. was supported by the DIM C-BRAINS, funded by the Conseil Régional d’Ile-de-France. The contributions of H.F. and E.R.S. were supported by the Howard Hughes Medical Institute. The PHENO-ICMice animal Core at ICM is supported by two ‘Investissements d’avenir’ (ANR-10- IAIHU-06 and ANR-11-INBS-0011-NeurATRIS) and the Fondation pour la Recherche Médicale.","year":"2026","publication_identifier":{"eissn":["2522-5812"]},"article_type":"original","oa":1,"file":[{"content_type":"application/pdf","checksum":"365932a599d05bc9ce8a57204e7a1465","relation":"main_file","date_updated":"2026-03-02T15:21:27Z","file_id":"21392","access_level":"open_access","success":1,"date_created":"2026-03-02T15:21:27Z","file_name":"2026_NatureMetab_AmrapaliVishwanath.pdf","creator":"dernst","file_size":5326608}],"doi":"10.1038/s42255-026-01451-w","day":"11","date_published":"2026-02-11T00:00:00Z","intvolume":"         8","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87","grant_number":"214316/Z/18/Z"}],"OA_place":"publisher","ddc":["570"],"publication":"Nature Metabolism"},{"publication_identifier":{"issn":["0178-8051"],"eissn":["1432-2064"]},"article_type":"original","year":"2026","acknowledgement":"FO and CW thank Ron Peled for insightful discussions on the white-noise multi-dimensional case in the Fall of 2023. CW thanks Barbara Dembin for the discussion during a workshop in Spring 2025. The work was done while the authors were affiliated with the Max Planck Institute for Mathematics in the Sciences; CW thanks the MPI for the support and warm hospitality. Open access funding provided by Institute of Science and Technology (IST Austria).","doi":"10.1007/s00440-026-01468-y","day":"14","oa":1,"date_published":"2026-02-14T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","ddc":["510"],"publication":"Probability Theory and Related Fields","oa_version":"Published Version","language":[{"iso":"eng"}],"status":"public","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","author":[{"first_name":"Felix","full_name":"Otto, Felix","last_name":"Otto"},{"first_name":"Matteo","full_name":"Palmieri, Matteo","last_name":"Palmieri"},{"full_name":"Wagner, Christian","last_name":"Wagner","id":"bf0c729b-2619-11f0-8024-9d69bb2b8b20","first_name":"Christian"}],"title":"On minimizing curves in a Brownian potential","date_updated":"2026-03-02T15:15:13Z","type":"journal_article","abstract":[{"lang":"eng","text":"We study a (1 + 1)-dimensional semi-discrete random variational problem that can be interpreted as the geometrically linearized version of the critical 2-dimensional random field Ising model. The scaling of the correlation length of the latter was recently characterized in Probab. Duke Math. J. 172(9), 1781–1811 (2023) and arXiv:2011.08768v3, (2022); our analysis is reminiscent of the multi-scale approach of the latter work and of Combinatorica 9, 161–187 (1989) . We show that at every dyadic scale from the system size down to the lattice spacing the minimizer contains at most order-one Dirichlet energy per unit length. We also establish a quenched homogenization result in the sense that the leading order of the minimal energy becomes deterministic as the ratio system size / lattice spacing diverges. To this purpose we adapt arguments from arXiv:2401.06768, (2024) on the (d + 1)-dimensional version our the model, with a Brownian replacing the white noise potential, to obtain the initial large-scale bounds. Based on our estimate of the (p = 3)-Dirichlet energy, we give an informal justification of the geometric linearization. Our bounds, which are oblivious to the microscopic cut-off scale provided by the lattice spacing, yield tightness of the law of minimizers in the space of continuous functions as the lattice spacing is sent to zero."}],"citation":{"chicago":"Otto, Felix, Matteo Palmieri, and Christian Wagner. “On Minimizing Curves in a Brownian Potential.” <i>Probability Theory and Related Fields</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00440-026-01468-y\">https://doi.org/10.1007/s00440-026-01468-y</a>.","ista":"Otto F, Palmieri M, Wagner C. 2026. On minimizing curves in a Brownian potential. Probability Theory and Related Fields.","mla":"Otto, Felix, et al. “On Minimizing Curves in a Brownian Potential.” <i>Probability Theory and Related Fields</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s00440-026-01468-y\">10.1007/s00440-026-01468-y</a>.","ieee":"F. Otto, M. Palmieri, and C. Wagner, “On minimizing curves in a Brownian potential,” <i>Probability Theory and Related Fields</i>. Springer Nature, 2026.","apa":"Otto, F., Palmieri, M., &#38; Wagner, C. (2026). On minimizing curves in a Brownian potential. <i>Probability Theory and Related Fields</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00440-026-01468-y\">https://doi.org/10.1007/s00440-026-01468-y</a>","ama":"Otto F, Palmieri M, Wagner C. On minimizing curves in a Brownian potential. <i>Probability Theory and Related Fields</i>. 2026. doi:<a href=\"https://doi.org/10.1007/s00440-026-01468-y\">10.1007/s00440-026-01468-y</a>","short":"F. Otto, M. Palmieri, C. Wagner, Probability Theory and Related Fields (2026)."},"quality_controlled":"1","publisher":"Springer Nature","corr_author":"1","main_file_link":[{"url":"https://doi.org/10.1007/s00440-026-01468-y","open_access":"1"}],"OA_type":"hybrid","department":[{"_id":"JuFi"}],"publication_status":"epub_ahead","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2026-03-02T10:05:23Z","month":"02","scopus_import":"1","_id":"21379"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"publisher","ddc":["520"],"publication":"Astronomy & Astrophysics","arxiv":1,"article_number":"A261","article_type":"original","year":"2026","acknowledgement":"We thank the referee for several helpful suggestions. AGA, MGO and IM acknowledge financial support from the Severo Ochoa grant CEX2021-001131-S, funded by MICIU/AEI/10.13039/501100011033. AGA also acknowledges FPI support under grant code CEX2021-001131-S20-7. Both AGA and MGO acknowledge support from the research grant\r\nPID2022-136598NB-C32 (“Estallidos8”). MGO also acknowledges the support by the project ref. AST22_00001_Subp_11 funded from the EU – NextGenerationEU. RA acknowledges support from PID2023-147386NB-I00 funded by MICIU/AEI/10.13039/501100011033 and ERDF/EU. IM acknowledges support from PID2022-140871NB-C21 funded by MICIU/AEI/10.13039/501100011033 and FEDER/UE. RGD acknowledge financial support from the project PID2022-141755NB-I00, and the Severo Ochoa grant CEX2021-001131-S funded\r\nby MICIU/AEI/ 10.13039/501100011033. JAFO and AE acknowledge support from the Spanish Ministry of Science and Innovation and the EU–NextGenerationEU through the RRF project ICTS-MRR-2021-03-CEFCA. AHC and ALC acknowledge support from MCIN/AEI/10.13039/501100011033, “ERDF A way of making Europe”, and “EU NextGenerationEU/PRTR” through PID2021-124918NB-C44 and CNS2023-145339, as well as from the RRF project ICTS-MRR-2021-03-CEFCA ALC and RPT acknowledge the financial\r\nsupport from the European Union – NextGenerationEU through the RRF program Planes Complementarios con las CCAA de Astrofísica y Física de Altas Energías – LA4. I.B. acknowledges support from the EU Horizon 2020 programme (Marie Sklodowska-Curie Grant 101059532) and the Franziska Seidl Funding Program, University of Vienna. This paper has gone through internal‘ review by the J-PAS collaboration. Based on observations made with the\r\nJST/T250 telescope and JPCam at the Observatorio Astrofísico de Javalambre (OAJ), in Teruel, owned, managed, and operated by the Centro de Estudios de Física del Cosmos de Aragón (CEFCA). We acknowledge the OAJ Data Processing and Archiving Unit (UPAD) for reducing and calibrating the OAJ data used in this work. Funding for the J-PAS Project has been provided by the Governments of Spain and Aragón through the Fondo de Inversiones de Teruel; the Aragonese Government through the Research Groups E96, E103, E16_17R, E16_20R, and E16_23R; the Spanish Ministry of Science and Innovation (MCIN/AEI/10.13039/501100011033 y FEDER, Una manera de hacer Europa) with grants PID2021-124918NB-C41, PID2021-124918NB-C42, PID2021-124918NA-C43, and PID2021-124918NB-C44; the Spanish Ministry\r\nof Science, Innovation and Universities (MCIU/AEI/FEDER, UE) with grants\r\nPGC2018-097585-B-C21 and PGC2018-097585-B-C22; the Spanish Ministry of Economy and Competitiveness (MINECO) under AYA2015-66211-C2-1-P, AYA2015-66211-C2-2, and AYA2012-30789; and European FEDER funding (FCDD10-4E-867, FCDD13-4E-2685).","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"oa":1,"file":[{"content_type":"application/pdf","checksum":"cd25a05386ab5638ae5baf8add0ecbee","relation":"main_file","date_updated":"2026-03-02T14:51:57Z","file_id":"21391","access_level":"open_access","creator":"dernst","file_size":1813456,"file_name":"2026_AstronomyAstrophysics_GimenezAlcazar.pdf","success":1,"date_created":"2026-03-02T14:51:57Z"}],"doi":"10.1051/0004-6361/202557358","day":"01","date_published":"2026-02-01T00:00:00Z","intvolume":"       706","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","has_accepted_license":"1","file_date_updated":"2026-03-02T14:51:57Z","author":[{"full_name":"Giménez-Alcázar, A.","last_name":"Giménez-Alcázar","first_name":"A."},{"last_name":"Amorín","full_name":"Amorín, R.","first_name":"R."},{"first_name":"J. M.","last_name":"Vílchez","full_name":"Vílchez, J. M."},{"last_name":"Hernán-Caballero","full_name":"Hernán-Caballero, A.","first_name":"A."},{"first_name":"M.","last_name":"González-Otero","full_name":"González-Otero, M."},{"first_name":"A.","last_name":"Arroyo-Polonio","full_name":"Arroyo-Polonio, A."},{"last_name":"Iglesias-Páramo","full_name":"Iglesias-Páramo, J.","first_name":"J."},{"last_name":"Lumbreras-Calle","full_name":"Lumbreras-Calle, A.","first_name":"A."},{"full_name":"Fernández-Ontiveros, J. A.","last_name":"Fernández-Ontiveros","first_name":"J. A."},{"full_name":"López-Sanjuan, C.","last_name":"López-Sanjuan","first_name":"C."},{"first_name":"L.","last_name":"Bonatto","full_name":"Bonatto, L."},{"last_name":"González Delgado","full_name":"González Delgado, R. M.","first_name":"R. M."},{"first_name":"C.","last_name":"Kehrig","full_name":"Kehrig, C."},{"id":"018f0249-0e87-11f0-b167-cbce08fbd541","full_name":"Torralba Torregrosa, Alberto","last_name":"Torralba Torregrosa","orcid":"0000-0001-5586-6950","first_name":"Alberto"},{"last_name":"Rahna","full_name":"Rahna, P. T.","first_name":"P. T."},{"last_name":"Jiménez-Teja","full_name":"Jiménez-Teja, Y.","first_name":"Y."},{"first_name":"I.","full_name":"Márquez, I.","last_name":"Márquez"},{"first_name":"I.","full_name":"Breda, I.","last_name":"Breda"},{"full_name":"Álvarez-Candal, A.","last_name":"Álvarez-Candal","first_name":"A."},{"full_name":"Abramo, R.","last_name":"Abramo","first_name":"R."},{"last_name":"Alcaniz","full_name":"Alcaniz, J.","first_name":"J."},{"full_name":"Benitez, N.","last_name":"Benitez","first_name":"N."},{"first_name":"S.","full_name":"Bonoli, S.","last_name":"Bonoli"},{"full_name":"Carneiro, S.","last_name":"Carneiro","first_name":"S."},{"last_name":"Cenarro","full_name":"Cenarro, J.","first_name":"J."},{"full_name":"Cristóbal-Hornillos, D.","last_name":"Cristóbal-Hornillos","first_name":"D."},{"first_name":"R.","last_name":"Dupke","full_name":"Dupke, R."},{"last_name":"Ederoclite","full_name":"Ederoclite, A.","first_name":"A."},{"first_name":"C.","last_name":"Hernández-Monteagudo","full_name":"Hernández-Monteagudo, C."},{"first_name":"A.","full_name":"Marín-Franch, A.","last_name":"Marín-Franch"},{"full_name":"Mendes de Oliveira, C.","last_name":"Mendes de Oliveira","first_name":"C."},{"first_name":"M.","last_name":"Moles","full_name":"Moles, M."},{"last_name":"Sodré","full_name":"Sodré, L.","first_name":"L."},{"first_name":"K.","last_name":"Taylor","full_name":"Taylor, K."},{"full_name":"Varela, J.","last_name":"Varela","first_name":"J."},{"full_name":"Vázquez Ramió, H.","last_name":"Vázquez Ramió","first_name":"H."}],"title":"J-PAS: First identification, physical properties, and ionization efficiency of extreme emission line galaxies","date_updated":"2026-03-02T15:10:27Z","DOAJ_listed":"1","oa_version":"Published Version","publisher":"EDP Sciences","volume":706,"OA_type":"diamond","department":[{"_id":"JoMa"}],"citation":{"mla":"Giménez-Alcázar, A., et al. “J-PAS: First Identification, Physical Properties, and Ionization Efficiency of Extreme Emission Line Galaxies.” <i>Astronomy &#38; Astrophysics</i>, vol. 706, A261, EDP Sciences, 2026, doi:<a href=\"https://doi.org/10.1051/0004-6361/202557358\">10.1051/0004-6361/202557358</a>.","chicago":"Giménez-Alcázar, A., R. Amorín, J. M. Vílchez, A. Hernán-Caballero, M. González-Otero, A. Arroyo-Polonio, J. Iglesias-Páramo, et al. “J-PAS: First Identification, Physical Properties, and Ionization Efficiency of Extreme Emission Line Galaxies.” <i>Astronomy &#38; Astrophysics</i>. EDP Sciences, 2026. <a href=\"https://doi.org/10.1051/0004-6361/202557358\">https://doi.org/10.1051/0004-6361/202557358</a>.","ista":"Giménez-Alcázar A, Amorín R, Vílchez JM, Hernán-Caballero A, González-Otero M, Arroyo-Polonio A, Iglesias-Páramo J, Lumbreras-Calle A, Fernández-Ontiveros JA, López-Sanjuan C, Bonatto L, González Delgado RM, Kehrig C, Torralba Torregrosa A, Rahna PT, Jiménez-Teja Y, Márquez I, Breda I, Álvarez-Candal A, Abramo R, Alcaniz J, Benitez N, Bonoli S, Carneiro S, Cenarro J, Cristóbal-Hornillos D, Dupke R, Ederoclite A, Hernández-Monteagudo C, Marín-Franch A, Mendes de Oliveira C, Moles M, Sodré L, Taylor K, Varela J, Vázquez Ramió H. 2026. J-PAS: First identification, physical properties, and ionization efficiency of extreme emission line galaxies. Astronomy &#38; Astrophysics. 706, A261.","ama":"Giménez-Alcázar A, Amorín R, Vílchez JM, et al. J-PAS: First identification, physical properties, and ionization efficiency of extreme emission line galaxies. <i>Astronomy &#38; Astrophysics</i>. 2026;706. doi:<a href=\"https://doi.org/10.1051/0004-6361/202557358\">10.1051/0004-6361/202557358</a>","apa":"Giménez-Alcázar, A., Amorín, R., Vílchez, J. M., Hernán-Caballero, A., González-Otero, M., Arroyo-Polonio, A., … Vázquez Ramió, H. (2026). J-PAS: First identification, physical properties, and ionization efficiency of extreme emission line galaxies. <i>Astronomy &#38; Astrophysics</i>. EDP Sciences. <a href=\"https://doi.org/10.1051/0004-6361/202557358\">https://doi.org/10.1051/0004-6361/202557358</a>","ieee":"A. Giménez-Alcázar <i>et al.</i>, “J-PAS: First identification, physical properties, and ionization efficiency of extreme emission line galaxies,” <i>Astronomy &#38; Astrophysics</i>, vol. 706. EDP Sciences, 2026.","short":"A. Giménez-Alcázar, R. Amorín, J.M. Vílchez, A. Hernán-Caballero, M. González-Otero, A. Arroyo-Polonio, J. Iglesias-Páramo, A. Lumbreras-Calle, J.A. Fernández-Ontiveros, C. López-Sanjuan, L. Bonatto, R.M. González Delgado, C. Kehrig, A. Torralba Torregrosa, P.T. Rahna, Y. Jiménez-Teja, I. Márquez, I. Breda, A. Álvarez-Candal, R. Abramo, J. Alcaniz, N. Benitez, S. Bonoli, S. Carneiro, J. Cenarro, D. Cristóbal-Hornillos, R. Dupke, A. Ederoclite, C. Hernández-Monteagudo, A. Marín-Franch, C. Mendes de Oliveira, M. Moles, L. Sodré, K. Taylor, J. Varela, H. Vázquez Ramió, Astronomy &#38; Astrophysics 706 (2026)."},"type":"journal_article","abstract":[{"lang":"eng","text":"Context. Extreme emission line galaxies (EELGs) are believed to significantly contribute to the star formation activity and mass assembly in galaxies. EELGs likely also play a leading role in the cosmic re-ionization as their interstellar medium may allow a significant fraction of their ionizing photons to escape (> 5%). Finding low-redshift analogues of these high-z galaxies is therefore essential to characterizing the physical conditions in the interstellar medium of these galaxies and understanding the processes that re-ionized the Universe.\r\n\r\nAims. We aimed to develop a robust and efficient method for the photometric identification of EELGs using the J-PAS survey. J-PAS will cover approximately 8500 deg2 of the sky with 54 narrow-band filters in the optical range plus i-SDSS, enabling detailed studies of the physical properties of these galaxies. In this work we focused on an initial subset of the survey: a 30 square degree area with complete observations in all bands.\r\n\r\nMethods. We combine equivalent width (EW) measurements from J-PAS narrow-band photometry with artificial intelligence techniques to identify galaxies with emission lines exceeding 300 Å. We validated our selection using spectroscopic data from DESI DR1 and characterized the selected sample through spectral energy distribution fitting with CIGALE.\r\n\r\nResults. We identify 917 EELGs up to z = 0.8 over 30 deg2, achieving a purity of 95% and a completeness of 96% for i-SDSS < 22.5 mag. Importantly, active galactic nucleus contamination was carefully considered and is estimated to be around 5%. Furthermore, a cross-match with DESI yielded 79 counterparts; their redshifts are in excellent agreement with our photometric estimates, thereby confirming the reliability of our redshift determination. In addition, the derived emission line fluxes are in good agreement with spectroscopic measurements. Moreover, the selected sample reveals strong correlations between the ionizing photon production efficiency (ξion) and EW(Hβ), which are consistent with previous observational studies at low and high redshifts and theoretical expectations. Finally, most of the sources surpass the ionizing efficiency threshold required for re-ionization, highlighting their relevance as local analogues of early-Universe galaxies."}],"quality_controlled":"1","month":"02","scopus_import":"1","_id":"21380","external_id":{"arxiv":["2512.08484"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","date_created":"2026-03-02T10:06:10Z"},{"doi":"10.1063/5.0316886","day":"14","oa":1,"intvolume":"       164","date_published":"2026-02-14T00:00:00Z","article_number":"060901","year":"2026","publication_identifier":{"issn":["0021-9606"],"eissn":["1089-7690"]},"acknowledgement":"B.C. thanks Christoph Dellago for his mentorship and influence. In addition to his seminal contributions to statistical mechanics, Christoph Dellago is an early developer and adopter of machine learning interatomic potentials. B.C. did two exchanges in the groups of Christoph Dellago and Jörg Behler in 2018, with transformative impact on her research directions.\r\n\r\nWe thank Peichen Zhong and Daniel S. King for useful feedback on the manuscript and for the collaborations on the LES method.\r\n\r\nFunding acknowledgment: Research reported in this publication was supported by the National Institute Of General Medical Sciences of the National Institutes of Health under Award No. R35GM159986. The content is solely the responsibility of the authors and does not necessarily represent the official views of the National Institutes of Health.","article_type":"original","arxiv":1,"publication":"The Journal of Chemical Physics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","OA_place":"repository","oa_version":"Preprint","title":"Long-range electrostatics for machine learning interatomic potentials is easier than we thought","author":[{"first_name":"Dongjin","full_name":"Kim, Dongjin","last_name":"Kim"},{"full_name":"Cheng, Bingqing","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","first_name":"Bingqing"}],"date_updated":"2026-03-02T14:46:24Z","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No","type":"journal_article","abstract":[{"text":"The lack of long-range electrostatics is a key limitation of modern machine learning interatomic potentials (MLIPs), hindering reliable applications to interfaces, charge-transfer reactions, polar and ionic materials, and biomolecules. In this Perspective, we distill two design principles behind the Latent Ewald Summation framework, which can capture long-range interactions, charges, and electrical response just by learning from standard energy and force training data: (i) use a Coulomb functional form with environment-dependent charges to capture electrostatic interactions, and (ii) avoid explicit training on ambiguous density functional theory partial charges. When both principles are satisfied, substantial flexibility remains: essentially any short-range MLIP can be augmented; charge equilibration schemes can be added when desired; dipoles and Born effective charges can be inferred or fine-tuned; and charge/spin-state embeddings or tensorial targets can be further incorporated. We also discuss current limitations and open challenges. Together, these minimal, physics-guided design rules suggest that incorporating long-range electrostatics into MLIPs is simpler and perhaps more broadly applicable than is commonly assumed.","lang":"eng"}],"citation":{"mla":"Kim, Dongjin, and Bingqing Cheng. “Long-Range Electrostatics for Machine Learning Interatomic Potentials Is Easier than We Thought.” <i>The Journal of Chemical Physics</i>, vol. 164, no. 6, 060901, AIP Publishing, 2026, doi:<a href=\"https://doi.org/10.1063/5.0316886\">10.1063/5.0316886</a>.","chicago":"Kim, Dongjin, and Bingqing Cheng. “Long-Range Electrostatics for Machine Learning Interatomic Potentials Is Easier than We Thought.” <i>The Journal of Chemical Physics</i>. AIP Publishing, 2026. <a href=\"https://doi.org/10.1063/5.0316886\">https://doi.org/10.1063/5.0316886</a>.","ista":"Kim D, Cheng B. 2026. Long-range electrostatics for machine learning interatomic potentials is easier than we thought. The Journal of Chemical Physics. 164(6), 060901.","apa":"Kim, D., &#38; Cheng, B. (2026). Long-range electrostatics for machine learning interatomic potentials is easier than we thought. <i>The Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0316886\">https://doi.org/10.1063/5.0316886</a>","ieee":"D. Kim and B. Cheng, “Long-range electrostatics for machine learning interatomic potentials is easier than we thought,” <i>The Journal of Chemical Physics</i>, vol. 164, no. 6. AIP Publishing, 2026.","ama":"Kim D, Cheng B. Long-range electrostatics for machine learning interatomic potentials is easier than we thought. <i>The Journal of Chemical Physics</i>. 2026;164(6). doi:<a href=\"https://doi.org/10.1063/5.0316886\">10.1063/5.0316886</a>","short":"D. Kim, B. Cheng, The Journal of Chemical Physics 164 (2026)."},"quality_controlled":"1","volume":164,"department":[{"_id":"BiCh"}],"OA_type":"free access","publisher":"AIP Publishing","corr_author":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2512.18029","open_access":"1"}],"publication_status":"published","date_created":"2026-03-02T10:06:46Z","external_id":{"arxiv":["2512.18029"]},"_id":"21381","month":"02","scopus_import":"1","issue":"6"},{"OA_place":"publisher","ddc":["570"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Science Advances","acknowledgement":"We thank all the Sánchez Alvarado lab members for inputs and discussions. We are grateful to the Stowers Aquatics (particularly the Planarian team), Microscopy, and Molecular Biology core facilities for technical contributions and method development; e. n. lissek and A. Fujii from Oni US and S. Wang from the University of Missouri, Kansas city, for assistance with dStORM imaging; and d. Alburty and A. Page from innovaprep for assisting with the ntA. We also thank M. Miller for the illustrations. This work was supported by the hhMi and Stowers institute. ","article_type":"original","year":"2026","publication_identifier":{"eissn":["2375-2548"]},"article_number":"eady1461","intvolume":"        12","date_published":"2026-02-01T00:00:00Z","day":"01","doi":"10.1126/sciadv.ady1461","oa":1,"file":[{"relation":"main_file","checksum":"fa9f6dafe3538e2d2872c098e06d1712","content_type":"application/pdf","file_id":"21389","date_updated":"2026-03-02T14:19:35Z","access_level":"open_access","file_size":2841345,"creator":"dernst","date_created":"2026-03-02T14:19:35Z","file_name":"2026_ScienceAdv_Sasidharan.pdf","success":1}],"file_date_updated":"2026-03-02T14:19:35Z","article_processing_charge":"Yes","has_accepted_license":"1","language":[{"iso":"eng"}],"status":"public","date_updated":"2026-03-02T14:23:22Z","title":"Extracellular vesicles mediate stem cell signaling and systemic RNAi in planarians","author":[{"first_name":"Vidyanand","last_name":"Sasidharan","full_name":"Sasidharan, Vidyanand"},{"first_name":"Laura","full_name":"Ancellotti, Laura","last_name":"Ancellotti"},{"id":"034e0824-174b-11ef-b32b-9366a0e70d1c","last_name":"Doddihal","full_name":"Doddihal, Viraj","first_name":"Viraj"},{"last_name":"Brewster","full_name":"Brewster, Carolyn","first_name":"Carolyn"},{"last_name":"Mann","full_name":"Mann, Frederick","first_name":"Frederick"},{"last_name":"McKinney","full_name":"McKinney, Mary Cathleen","first_name":"Mary Cathleen"},{"last_name":"Varberg","full_name":"Varberg, Joseph","first_name":"Joseph"},{"first_name":"Eric","last_name":"Ross","full_name":"Ross, Eric"},{"first_name":"Fengyan","last_name":"Deng","full_name":"Deng, Fengyan"},{"first_name":"Kexi","full_name":"Yi, Kexi","last_name":"Yi"},{"last_name":"Sánchez Alvarado","full_name":"Sánchez Alvarado, Alejandro","first_name":"Alejandro"}],"DOAJ_listed":"1","oa_version":"Published Version","publisher":"American Association for the Advancement of Science","OA_type":"gold","department":[{"_id":"CaHe"}],"volume":12,"quality_controlled":"1","abstract":[{"text":"Planarian flatworms are known for their remarkable regenerative capacity; however, the precise intercellular communication mechanisms underlying this process remain unsolved. Here, we report the discovery and characterization of abundant extracellular vesicles (EVs) in planarians. Using imaging and molecular analysis, we show conservation of biogenesis, morphology, and protein composition of planarian EVs. Environmental stressors significantly elevate EV release, indicating that planarians dynamically regulate vesicle production. Functionally, planarian EVs mediate intercellular communication by transferring regulatory signals: We find that they shuttle small RNAs that effect systemic RNA interference (RNAi) throughout the organism. Notably, gene knockdown experiments reveal a crucial role for AGO-3, a member of the Argonaute family of proteins, in modulating the association of small interfering RNAs with EVs, linking the intracellular RNAi machinery to EV-based signaling. These findings highlight EVs as pivotal mediators of cell-cell communication in planarians, with broad implications for understanding the coordination of gene regulation and tissue regeneration in animals.","lang":"eng"}],"type":"journal_article","citation":{"ista":"Sasidharan V, Ancellotti L, Doddihal V, Brewster C, Mann F, McKinney MC, Varberg J, Ross E, Deng F, Yi K, Sánchez Alvarado A. 2026. Extracellular vesicles mediate stem cell signaling and systemic RNAi in planarians. Science Advances. 12(6), eady1461.","chicago":"Sasidharan, Vidyanand, Laura Ancellotti, Viraj Doddihal, Carolyn Brewster, Frederick Mann, Mary Cathleen McKinney, Joseph Varberg, et al. “Extracellular Vesicles Mediate Stem Cell Signaling and Systemic RNAi in Planarians.” <i>Science Advances</i>. American Association for the Advancement of Science, 2026. <a href=\"https://doi.org/10.1126/sciadv.ady1461\">https://doi.org/10.1126/sciadv.ady1461</a>.","mla":"Sasidharan, Vidyanand, et al. “Extracellular Vesicles Mediate Stem Cell Signaling and Systemic RNAi in Planarians.” <i>Science Advances</i>, vol. 12, no. 6, eady1461, American Association for the Advancement of Science, 2026, doi:<a href=\"https://doi.org/10.1126/sciadv.ady1461\">10.1126/sciadv.ady1461</a>.","apa":"Sasidharan, V., Ancellotti, L., Doddihal, V., Brewster, C., Mann, F., McKinney, M. C., … Sánchez Alvarado, A. (2026). Extracellular vesicles mediate stem cell signaling and systemic RNAi in planarians. <i>Science Advances</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/sciadv.ady1461\">https://doi.org/10.1126/sciadv.ady1461</a>","ieee":"V. Sasidharan <i>et al.</i>, “Extracellular vesicles mediate stem cell signaling and systemic RNAi in planarians,” <i>Science Advances</i>, vol. 12, no. 6. American Association for the Advancement of Science, 2026.","ama":"Sasidharan V, Ancellotti L, Doddihal V, et al. Extracellular vesicles mediate stem cell signaling and systemic RNAi in planarians. <i>Science Advances</i>. 2026;12(6). doi:<a href=\"https://doi.org/10.1126/sciadv.ady1461\">10.1126/sciadv.ady1461</a>","short":"V. Sasidharan, L. Ancellotti, V. Doddihal, C. Brewster, F. Mann, M.C. McKinney, J. Varberg, E. Ross, F. Deng, K. Yi, A. Sánchez Alvarado, Science Advances 12 (2026)."},"scopus_import":"1","issue":"6","month":"02","_id":"21383","date_created":"2026-03-02T10:08:07Z","publication_status":"published","tmp":{"short":"CC BY-NC (4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"}},{"publisher":"Public Library of Science","department":[{"_id":"MiSi"}],"OA_type":"gold","volume":22,"quality_controlled":"1","citation":{"mla":"Liu, Jiayi, et al. “Modelling Chemotaxis of Branched Cells in Complex Environments Provides Insights into Immune Cell Navigation.” <i>PLOS Computational Biology</i>, vol. 22, no. 2, e1013934, Public Library of Science, 2026, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1013934\">10.1371/journal.pcbi.1013934</a>.","chicago":"Liu, Jiayi, Jonathan E. Ron, Giulia Rinaldi, Ivanna Williantarra, Antonios Georgantzoglou, Ingrid de Vries, Michael K Sixt, Milka Sarris, and Nir S. Gov. “Modelling Chemotaxis of Branched Cells in Complex Environments Provides Insights into Immune Cell Navigation.” <i>PLOS Computational Biology</i>. Public Library of Science, 2026. <a href=\"https://doi.org/10.1371/journal.pcbi.1013934\">https://doi.org/10.1371/journal.pcbi.1013934</a>.","ista":"Liu J, Ron JE, Rinaldi G, Williantarra I, Georgantzoglou A, de Vries I, Sixt MK, Sarris M, Gov NS. 2026. Modelling chemotaxis of branched cells in complex environments provides insights into immune cell navigation. PLOS Computational Biology. 22(2), e1013934.","ieee":"J. Liu <i>et al.</i>, “Modelling chemotaxis of branched cells in complex environments provides insights into immune cell navigation,” <i>PLOS Computational Biology</i>, vol. 22, no. 2. Public Library of Science, 2026.","ama":"Liu J, Ron JE, Rinaldi G, et al. Modelling chemotaxis of branched cells in complex environments provides insights into immune cell navigation. <i>PLOS Computational Biology</i>. 2026;22(2). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1013934\">10.1371/journal.pcbi.1013934</a>","apa":"Liu, J., Ron, J. E., Rinaldi, G., Williantarra, I., Georgantzoglou, A., de Vries, I., … Gov, N. S. (2026). Modelling chemotaxis of branched cells in complex environments provides insights into immune cell navigation. <i>PLOS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1013934\">https://doi.org/10.1371/journal.pcbi.1013934</a>","short":"J. Liu, J.E. Ron, G. Rinaldi, I. Williantarra, A. Georgantzoglou, I. de Vries, M.K. Sixt, M. Sarris, N.S. Gov, PLOS Computational Biology 22 (2026)."},"pmid":1,"type":"journal_article","abstract":[{"lang":"eng","text":"Cell migration in vivo is often guided by chemical signaling, i.e., chemotaxis. For immune cells performing chemotaxis in the organism, this process is influenced by the complex geometry of the tissue environment. In this study, we use a theoretical model of branched cell migration on a network to explore the cellular response to chemical gradients. The model predicts the response of a branched cell to a chemical gradient: how the cell reorients its internal polarity and how it navigates through a complex environment up a chemical gradient. We then compare the model’s predictions with experimental observations of neutrophils migrating to the site of a laser-inflicted wound in a zebrafish larva fin, and neutrophils migrating in vitro inside a regular lattice of pillars. We find that the model captures the details of the subcellular response to the chemokine gradient, as well as qualitative characteristics of the large-scale migration, suggesting that the neutrophils behave as fast cells, which explains the functionality of these immune cells."}],"scopus_import":"1","issue":"2","month":"02","_id":"21384","external_id":{"pmid":["41632822"]},"date_created":"2026-03-02T10:08:38Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","PlanS_conform":"1","ddc":["570"],"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Pushing from within: Control of cell shape, integrity and motility by cytoskeletal pushing forces","_id":"bd91e723-d553-11ed-ba76-fe7eeb2185fd","grant_number":"101071793"}],"publication":"PLOS Computational Biology","article_type":"original","acknowledgement":"N.S.G. is the incumbent of the Lee and William Abramowitz Professorial Chair of Biophysics (Weizmann Institute), and acknowledges support from the Royal Society Wolfson Visiting Fellowship, and Human Frontier Science Program grant RGP0032/2022. Work by M.S., I.W., G.R. and A.G. was supported by the Leverhulme Trust (grant RPG-2021-226) and the European Research Council (ERC) under the Horizon 2020 program and UKRI, Grant agreement No.\r\nEP/Y02799X/1. M.S. and I.d.V acknowledge support by the European Research Council (grant ERC-SyG 101071793 to M.S). The funders had no role in study design, data collection and\r\nanalysis, decision to publish, or preparation of the manuscript.","year":"2026","publication_identifier":{"eissn":["1553-7358"]},"article_number":"e1013934","date_published":"2026-02-03T00:00:00Z","intvolume":"        22","file":[{"file_size":20688452,"creator":"dernst","file_name":"2026_PloSCompBio_.pdf","date_created":"2026-03-02T14:11:14Z","success":1,"access_level":"open_access","file_id":"21388","date_updated":"2026-03-02T14:11:14Z","relation":"main_file","content_type":"application/pdf","checksum":"564041089e7334804ad3cade973f80b4"}],"oa":1,"doi":"10.1371/journal.pcbi.1013934","day":"03","article_processing_charge":"Yes","has_accepted_license":"1","file_date_updated":"2026-03-02T14:11:14Z","status":"public","language":[{"iso":"eng"}],"date_updated":"2026-03-02T14:12:22Z","author":[{"first_name":"Jiayi","full_name":"Liu, Jiayi","last_name":"Liu"},{"full_name":"Ron, Jonathan E.","last_name":"Ron","first_name":"Jonathan E."},{"last_name":"Rinaldi","full_name":"Rinaldi, Giulia","first_name":"Giulia"},{"first_name":"Ivanna","full_name":"Williantarra, Ivanna","last_name":"Williantarra"},{"first_name":"Antonios","full_name":"Georgantzoglou, Antonios","last_name":"Georgantzoglou"},{"first_name":"Ingrid","id":"4C7D837E-F248-11E8-B48F-1D18A9856A87","last_name":"de Vries","full_name":"de Vries, Ingrid"},{"first_name":"Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Sarris","full_name":"Sarris, Milka","first_name":"Milka"},{"first_name":"Nir S.","full_name":"Gov, Nir S.","last_name":"Gov"}],"title":"Modelling chemotaxis of branched cells in complex environments provides insights into immune cell navigation","DOAJ_listed":"1","oa_version":"Published Version"},{"citation":{"chicago":"Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/prm.2026.10123\">https://doi.org/10.1017/prm.2026.10123</a>.","ista":"Wang V, Xu M. 2026. Average sizes of mixed character sums. Proceedings of the Royal Society of Edinburgh: Section A Mathematics., 1–15.","mla":"Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>, Cambridge University Press, 2026, pp. 1–15, doi:<a href=\"https://doi.org/10.1017/prm.2026.10123\">10.1017/prm.2026.10123</a>.","ieee":"V. Wang and M. Xu, “Average sizes of mixed character sums,” <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press, pp. 1–15, 2026.","apa":"Wang, V., &#38; Xu, M. (2026). Average sizes of mixed character sums. <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/prm.2026.10123\">https://doi.org/10.1017/prm.2026.10123</a>","ama":"Wang V, Xu M. Average sizes of mixed character sums. <i>Proceedings of the Royal Society of Edinburgh: Section A Mathematics</i>. 2026:1-15. doi:<a href=\"https://doi.org/10.1017/prm.2026.10123\">10.1017/prm.2026.10123</a>","short":"V. Wang, M. Xu, Proceedings of the Royal Society of Edinburgh: Section A Mathematics (2026) 1–15."},"type":"journal_article","abstract":[{"lang":"eng","text":"We prove that the average size of a mixed character sum (math. formular) (for a suitable smooth function w) is on the order of √x for all irrational real θ satisfying a weak Diophantine condition, where χ is drawn from the family of Dirichlet characters modulo a large prime r and where x 6 r. In contrast, it was proved by Harper that the average size is o(√x) for rational θ. Certain quadratic Diophantine equations play a key role in the present paper. "}],"quality_controlled":"1","OA_type":"hybrid","department":[{"_id":"TiBr"}],"publisher":"Cambridge University Press","corr_author":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/prm.2026.10123"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"epub_ahead","PlanS_conform":"1","date_created":"2026-03-02T10:09:23Z","external_id":{"arxiv":["2411.14181"]},"_id":"21385","month":"01","oa":1,"doi":"10.1017/prm.2026.10123","date_published":"2026-01-01T00:00:00Z","publication_identifier":{"issn":["0308-2105"],"eissn":["1473-7124"]},"year":"2026","article_type":"original","acknowledgement":"We thank Ofir Gorodetsky, Andrew Granville, Adam Harper, Youness Lamzouri,\r\nKannan Soundararajan, Ping Xi, and Matt Young for their interest, helpful discussions, and comments. Special thanks are due to Jonathan Bober, Oleksiy Klurman,\r\nand Besfort Shala for sending us a letter about Question 1.3, and to Hung Bui\r\nfor informing us of [7]. V.W. thanks Stanford University for its hospitality and is supported by the European Union’s Horizon 2020 research and innovation program\r\nunder the Marie Skłodowska–Curie Grant Agreement No. 101034413. M.X. is supported by a Simons Junior Fellowship from the Simons Society of Fellows at the\r\nSimons Foundation.","ec_funded":1,"arxiv":1,"publication":"Proceedings of the Royal Society of Edinburgh: Section A Mathematics","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"OA_place":"publisher","ddc":["510"],"oa_version":"Published Version","title":"Average sizes of mixed character sums","author":[{"orcid":"0000-0002-0704-7026","full_name":"Wang, Victor","last_name":"Wang","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9","first_name":"Victor"},{"first_name":"Max","last_name":"Xu","full_name":"Xu, Max"}],"date_updated":"2026-03-02T14:05:47Z","page":"1-15","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1"},{"year":"2026","oa":1,"citation":{"short":"I. Sergeev, M. Dvorak, C. Rampell, M. Sandey, P. Monticone, ArXiv (n.d.).","mla":"Sergeev, Ivan, et al. “A Blueprint for the Formalization of Seymour’s Matroid Decomposition Theorem.” <i>ArXiv</i>, doi:<a href=\"https://doi.org/10.48550/arXiv.2601.01255\">10.48550/arXiv.2601.01255</a>.","ista":"Sergeev I, Dvorak M, Rampell C, Sandey M, Monticone P. A blueprint for the formalization of Seymour’s matroid decomposition theorem. arXiv, <a href=\"https://doi.org/10.48550/arXiv.2601.01255\">10.48550/arXiv.2601.01255</a>.","chicago":"Sergeev, Ivan, Martin Dvorak, Cameron Rampell, Mark Sandey, and Pietro Monticone. “A Blueprint for the Formalization of Seymour’s Matroid Decomposition Theorem.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2601.01255\">https://doi.org/10.48550/arXiv.2601.01255</a>.","ieee":"I. Sergeev, M. Dvorak, C. Rampell, M. Sandey, and P. Monticone, “A blueprint for the formalization of Seymour’s matroid decomposition theorem,” <i>arXiv</i>. .","apa":"Sergeev, I., Dvorak, M., Rampell, C., Sandey, M., &#38; Monticone, P. (n.d.). A blueprint for the formalization of Seymour’s matroid decomposition theorem. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2601.01255\">https://doi.org/10.48550/arXiv.2601.01255</a>","ama":"Sergeev I, Dvorak M, Rampell C, Sandey M, Monticone P. A blueprint for the formalization of Seymour’s matroid decomposition theorem. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2601.01255\">10.48550/arXiv.2601.01255</a>"},"doi":"10.48550/arXiv.2601.01255","type":"preprint","abstract":[{"text":"This document is a blueprint for the formalization in Lean of the structural theory of regular matroids underlying Seymour's decomposition theorem. We present a modular account of regularity via totally unimodular representations, show that regularity is preserved under 1-, 2-, and 3-sums, and establish regularity for several special classes of matroids, including graphic, cographic, and the matroid R10. The blueprint records the logical structure of the proof, the precise dependencies between results, and their correspondence with Lean declarations. It is intended both as a guide for the ongoing formalization effort and as a human-readable reference for the organization of the proof.","lang":"eng"}],"day":"03","date_published":"2026-01-03T00:00:00Z","corr_author":"1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2601.01255"}],"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"publication":"arXiv","arxiv":1,"external_id":{"arxiv":["2601.01255"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"submitted","oa_version":"Preprint","date_created":"2026-03-04T12:09:26Z","language":[{"iso":"eng"}],"status":"public","month":"01","article_processing_charge":"No","author":[{"first_name":"Ivan","orcid":"0009-0004-9145-8785","id":"ca3c9187-9a72-11ee-a009-8af825d896b0","last_name":"Sergeev","full_name":"Sergeev, Ivan"},{"first_name":"Martin","id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","last_name":"Dvorak","full_name":"Dvorak, Martin","orcid":"0000-0001-5293-214X"},{"first_name":"Cameron","full_name":"Rampell, Cameron","last_name":"Rampell"},{"last_name":"Sandey","full_name":"Sandey, Mark","first_name":"Mark"},{"last_name":"Monticone","full_name":"Monticone, Pietro","first_name":"Pietro"}],"title":"A blueprint for the formalization of Seymour's matroid decomposition theorem","_id":"21400","page":"18","date_updated":"2026-03-09T15:14:18Z","related_material":{"link":[{"url":"https://ivan-sergeyev.github.io/seymour/blueprint.pdf","relation":"supplementary_material"}]}},{"article_processing_charge":"No","status":"public","language":[{"iso":"eng"}],"date_updated":"2026-03-09T10:19:45Z","title":"Ostracod shell chemistry as proxy for coastal marine conditions of a highly urbanized megacity (Hong Kong SAR) and an agro-centric oceanic province (Jeju Island, Republic of Korea) – a preliminary comparative analysis","author":[{"last_name":"Jöst","full_name":"Jöst, Anna B.","first_name":"Anna B."},{"first_name":"Maximiliano J","last_name":"Rodriguez Moreno","full_name":"Rodriguez Moreno, Maximiliano J","id":"59bea3b2-8c82-11ef-a41a-af7b0efd9065"},{"first_name":"Taihun","last_name":"Kim","full_name":"Kim, Taihun"},{"first_name":"David M.","last_name":"Baker","full_name":"Baker, David M."},{"first_name":"Moriaki","full_name":"Yasuhara, Moriaki","last_name":"Yasuhara"},{"full_name":"Not, Christelle A.","last_name":"Not","first_name":"Christelle A."},{"first_name":"Ivana","full_name":"Karanovic, Ivana","last_name":"Karanovic"}],"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Marine Pollution Bulletin","publication_identifier":{"eissn":["1879-3363"],"issn":["002-5326X"]},"article_type":"original","acknowledgement":"We thank the KIOST staff of the Jeju Marine Research Center for assisting sample collection, the research assistants and students of the Yoon Idea Lab led by Prof. Dr. Tae-Hyun Yoon at Hanyang University for facilitating and assisting in ICP-MS test runs involved in a pilot study preceding this study, Ms. Garance Perrois and Mr. Léonard Pons for assistance with statistics-related questions, and the two anonymous reviewers for their valuable comments and suggestions. The study described in this article was partially supported by grants from the Brain Pool Program through NRF funded by the Ministry of Science and ICT (reference code: 2019H1D3A1A01070922 to ABJ), by the Ministry of Oceans and Fisheries (grant number RS-2024-00406249 to TK), by the Korea Institute of Marine Science and Technology (KIMST), funded by the Ministry of Oceans and Fisheries (grant number RS-2025-02304432 to TK), and by the Korea Institute of Ocean Science and Technology (PEA0404 to TK).","year":"2026","article_number":"119493","date_published":"2026-03-02T00:00:00Z","intvolume":"       227","day":"02","doi":"10.1016/j.marpolbul.2026.119493","issue":"6","scopus_import":"1","month":"03","_id":"21406","external_id":{"pmid":["41774948"]},"date_created":"2026-03-08T23:01:44Z","publication_status":"published","publisher":"Elsevier","department":[{"_id":"FrPe"}],"OA_type":"closed access","volume":227,"quality_controlled":"1","citation":{"ama":"Jöst AB, Rodriguez Moreno MJ, Kim T, et al. Ostracod shell chemistry as proxy for coastal marine conditions of a highly urbanized megacity (Hong Kong SAR) and an agro-centric oceanic province (Jeju Island, Republic of Korea) – a preliminary comparative analysis. <i>Marine Pollution Bulletin</i>. 2026;227(6). doi:<a href=\"https://doi.org/10.1016/j.marpolbul.2026.119493\">10.1016/j.marpolbul.2026.119493</a>","ieee":"A. B. Jöst <i>et al.</i>, “Ostracod shell chemistry as proxy for coastal marine conditions of a highly urbanized megacity (Hong Kong SAR) and an agro-centric oceanic province (Jeju Island, Republic of Korea) – a preliminary comparative analysis,” <i>Marine Pollution Bulletin</i>, vol. 227, no. 6. Elsevier, 2026.","apa":"Jöst, A. B., Rodriguez Moreno, M. J., Kim, T., Baker, D. M., Yasuhara, M., Not, C. A., &#38; Karanovic, I. (2026). Ostracod shell chemistry as proxy for coastal marine conditions of a highly urbanized megacity (Hong Kong SAR) and an agro-centric oceanic province (Jeju Island, Republic of Korea) – a preliminary comparative analysis. <i>Marine Pollution Bulletin</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.marpolbul.2026.119493\">https://doi.org/10.1016/j.marpolbul.2026.119493</a>","mla":"Jöst, Anna B., et al. “Ostracod Shell Chemistry as Proxy for Coastal Marine Conditions of a Highly Urbanized Megacity (Hong Kong SAR) and an Agro-Centric Oceanic Province (Jeju Island, Republic of Korea) – a Preliminary Comparative Analysis.” <i>Marine Pollution Bulletin</i>, vol. 227, no. 6, 119493, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.marpolbul.2026.119493\">10.1016/j.marpolbul.2026.119493</a>.","ista":"Jöst AB, Rodriguez Moreno MJ, Kim T, Baker DM, Yasuhara M, Not CA, Karanovic I. 2026. Ostracod shell chemistry as proxy for coastal marine conditions of a highly urbanized megacity (Hong Kong SAR) and an agro-centric oceanic province (Jeju Island, Republic of Korea) – a preliminary comparative analysis. Marine Pollution Bulletin. 227(6), 119493.","chicago":"Jöst, Anna B., Maximiliano J Rodriguez Moreno, Taihun Kim, David M. Baker, Moriaki Yasuhara, Christelle A. Not, and Ivana Karanovic. “Ostracod Shell Chemistry as Proxy for Coastal Marine Conditions of a Highly Urbanized Megacity (Hong Kong SAR) and an Agro-Centric Oceanic Province (Jeju Island, Republic of Korea) – a Preliminary Comparative Analysis.” <i>Marine Pollution Bulletin</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.marpolbul.2026.119493\">https://doi.org/10.1016/j.marpolbul.2026.119493</a>.","short":"A.B. Jöst, M.J. Rodriguez Moreno, T. Kim, D.M. Baker, M. Yasuhara, C.A. Not, I. Karanovic, Marine Pollution Bulletin 227 (2026)."},"abstract":[{"text":"This preliminary study investigates the trace-element composition of ostracod shells (Ostracoda: Crustacea) as biogenic calcium carbonates in their role as environmental sentinels of pollution. Using high-resolution in-situ analysis, we compared two contrasting coastal systems: the highly urbanized seascape of metropolitan megacity Hong Kong (HKSAR) and the agriculturally dominated waters of rural retreat Jeju Island, Republic of Korea (ROK). The goal was to assess whether anthropogenic stress gradients affect trace element-to‑calcium ratios (E/Ca) in the carapaces of shallow-marine Neonesidea Maddocks, 1969 species. Hereby, the focus is laid on potential differences in the effects of extreme urbanization and extreme agriculturalization. We analyzed 12 trace elements commonly incorporated into ostracod shells using Inductively Coupled Plasma–Mass Spectrometry (ICP-MS). Only Mn/Ca, Mg/Ca, and Ni/Ca ratios showed strong correlations with specific seawater physicochemical parameters. Notably, Mn/Ca differed significantly between the two sites, seemingly driven mainly by variations in nitrite nitrogen levels. This suggests that Mn incorporation is sensitive to pollution source, urban versus agricultural, though species-specific uptake effects cannot be excluded. No significant differences in elemental uptake were found between adult and A-1 juvenile stages of Neonesidea mutsuensis Ishizaki, 1961 or Neonesidea elegans (Brady, 1969), supporting the use of both age groups in environmental reconstructions and increasing potential sample yields. While remaining empirical and exploratory, our tentative findings suggest that ostracod geochemistry holds promise for marine pollution monitoring and cautiously supports the application of ostracod Mn/Ca ratios to reconstruct anthropogenic, particularly nitrogen-related, impacts in nearshore environments using sediment core records.","lang":"eng"}],"pmid":1,"type":"journal_article"},{"day":"01","doi":"10.1007/s41468-026-00233-3","oa":1,"file":[{"date_updated":"2026-03-09T11:29:30Z","file_id":"21416","checksum":"0bf6dc430cafa40c08f260fe17d54595","content_type":"application/pdf","relation":"main_file","creator":"dernst","file_size":323111,"file_name":"2026_JourAppliedCompTopology_Edelsbrunner.pdf","date_created":"2026-03-09T11:29:30Z","success":1,"access_level":"open_access"}],"intvolume":"        10","date_published":"2026-03-01T00:00:00Z","article_number":"5","acknowledgement":"The authors would like to thank Michael Lesnick and Primoz Skraba for their helpful comments regarding sparse approximations of filtrations. We are also grateful to the anonymous referees for their careful reading and constructive suggestions. The three authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35, the U.S. National Science Foundation (NSF-DMS), grant no. 2005630, and a JSPS Grant-in-Aid for Transformative Research Areas (A) (22H05107, Y.H.), EPSRC Research Grant EP/Y008642/1.","publication_identifier":{"issn":["2367-1726"],"eissn":["2367-1734"]},"article_type":"original","year":"2026","arxiv":1,"publication":"Journal of Applied and Computational Topology","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"Mathematics, Computer Science","call_identifier":"FWF"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35","call_identifier":"FWF"}],"ddc":["500"],"OA_place":"publisher","oa_version":"Published Version","title":"Maximum persistent Betti numbers of Čech complexes","author":[{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"last_name":"Kahle","full_name":"Kahle, Matthew","first_name":"Matthew"},{"full_name":"Kanazawa, Shu","last_name":"Kanazawa","first_name":"Shu"}],"date_updated":"2026-03-09T11:31:29Z","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2026-03-09T11:29:30Z","article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","abstract":[{"text":"This note proves that only a linear number of holes in a Cech complex of n points in R^d\r\ncan persist over an interval of constant length. Specifically, for any fixed dimension p <\r\nd and fixed ε > 0, the number of p-dimensional holes in the ˇ Cech complex at radius 1\r\nthat persist to radius 1+ε is bounded above by a constant times n,where n is the number\r\nof points. The proof uses a packing argument supported by relating theCˇ ech complexes\r\nwith corresponding snap complexes over the cells in a partition of space. The argument\r\nis self-contained and elementary, relying on geometric and combinatorial constructions\r\nrather than on the existing theory of sparse approximations or interleavings. The bound\r\nalso applies to Alpha complexes and Vietoris–Rips complexes. While our result can be\r\ninferred from prior work on sparse filtrations, to our knowledge, no explicit statement\r\nor direct proof of this bound appears in the literature.","lang":"eng"}],"type":"journal_article","citation":{"mla":"Edelsbrunner, Herbert, et al. “Maximum Persistent Betti Numbers of Čech Complexes.” <i>Journal of Applied and Computational Topology</i>, vol. 10, 5, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s41468-026-00233-3\">10.1007/s41468-026-00233-3</a>.","chicago":"Edelsbrunner, Herbert, Matthew Kahle, and Shu Kanazawa. “Maximum Persistent Betti Numbers of Čech Complexes.” <i>Journal of Applied and Computational Topology</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s41468-026-00233-3\">https://doi.org/10.1007/s41468-026-00233-3</a>.","ista":"Edelsbrunner H, Kahle M, Kanazawa S. 2026. Maximum persistent Betti numbers of Čech complexes. Journal of Applied and Computational Topology. 10, 5.","apa":"Edelsbrunner, H., Kahle, M., &#38; Kanazawa, S. (2026). Maximum persistent Betti numbers of Čech complexes. <i>Journal of Applied and Computational Topology</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s41468-026-00233-3\">https://doi.org/10.1007/s41468-026-00233-3</a>","ieee":"H. Edelsbrunner, M. Kahle, and S. Kanazawa, “Maximum persistent Betti numbers of Čech complexes,” <i>Journal of Applied and Computational Topology</i>, vol. 10. Springer Nature, 2026.","ama":"Edelsbrunner H, Kahle M, Kanazawa S. Maximum persistent Betti numbers of Čech complexes. <i>Journal of Applied and Computational Topology</i>. 2026;10. doi:<a href=\"https://doi.org/10.1007/s41468-026-00233-3\">10.1007/s41468-026-00233-3</a>","short":"H. Edelsbrunner, M. Kahle, S. Kanazawa, Journal of Applied and Computational Topology 10 (2026)."},"quality_controlled":"1","volume":10,"OA_type":"hybrid","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","PlanS_conform":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2026-03-08T23:01:45Z","external_id":{"arxiv":["2409.05241"]},"_id":"21407","month":"03","scopus_import":"1"},{"article_processing_charge":"Yes (via OA deal)","has_accepted_license":"1","file_date_updated":"2026-03-09T10:38:55Z","status":"public","language":[{"iso":"eng"}],"date_updated":"2026-03-09T10:40:41Z","title":"Simultaneous optimization of assembly time and yield in programmable self-assembly","author":[{"first_name":"Maximilian","last_name":"Hübl","full_name":"Hübl, Maximilian","id":"5eb8629e-15b2-11ec-abd3-e6f3e5e01f32"},{"first_name":"Carl Peter","full_name":"Goodrich, Carl Peter","last_name":"Goodrich","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","orcid":"0000-0002-1307-5074"}],"oa_version":"Published Version","ddc":["540"],"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"8dd93da8-16d5-11f0-9cad-d2c70200d9a5","name":"Dynamically reconfigurable self-assembly with triangular DNA-origami bricks","grant_number":"FTI23-G-011"}],"arxiv":1,"publication":"Journal of Chemical Physics","publication_identifier":{"eissn":["1089-7690"],"issn":["0021-9606"]},"article_type":"original","acknowledgement":"The research was supported by the Gesellschaft für Forschungsförderung Niederösterreich under Project No. FTI23-G-011.","year":"2026","article_number":"084904","date_published":"2026-02-28T00:00:00Z","intvolume":"       164","oa":1,"file":[{"access_level":"open_access","file_size":6903766,"creator":"dernst","file_name":"2026_JourChemPhysics_Huebl.pdf","date_created":"2026-03-09T10:38:55Z","success":1,"relation":"main_file","checksum":"9bdb8870930e83edb973408da3038559","content_type":"application/pdf","file_id":"21415","date_updated":"2026-03-09T10:38:55Z"}],"doi":"10.1063/5.0304731","day":"28","scopus_import":"1","issue":"8","month":"02","_id":"21408","external_id":{"arxiv":["2510.07876"]},"date_created":"2026-03-08T23:01:45Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_status":"published","corr_author":"1","publisher":"AIP Publishing","OA_type":"hybrid","department":[{"_id":"CaGo"},{"_id":"GradSch"}],"volume":164,"quality_controlled":"1","citation":{"apa":"Hübl, M., &#38; Goodrich, C. P. (2026). Simultaneous optimization of assembly time and yield in programmable self-assembly. <i>Journal of Chemical Physics</i>. AIP Publishing. <a href=\"https://doi.org/10.1063/5.0304731\">https://doi.org/10.1063/5.0304731</a>","ama":"Hübl M, Goodrich CP. Simultaneous optimization of assembly time and yield in programmable self-assembly. <i>Journal of Chemical Physics</i>. 2026;164(8). doi:<a href=\"https://doi.org/10.1063/5.0304731\">10.1063/5.0304731</a>","ieee":"M. Hübl and C. P. Goodrich, “Simultaneous optimization of assembly time and yield in programmable self-assembly,” <i>Journal of Chemical Physics</i>, vol. 164, no. 8. AIP Publishing, 2026.","ista":"Hübl M, Goodrich CP. 2026. Simultaneous optimization of assembly time and yield in programmable self-assembly. Journal of Chemical Physics. 164(8), 084904.","chicago":"Hübl, Maximilian, and Carl Peter Goodrich. “Simultaneous Optimization of Assembly Time and Yield in Programmable Self-Assembly.” <i>Journal of Chemical Physics</i>. AIP Publishing, 2026. <a href=\"https://doi.org/10.1063/5.0304731\">https://doi.org/10.1063/5.0304731</a>.","mla":"Hübl, Maximilian, and Carl Peter Goodrich. “Simultaneous Optimization of Assembly Time and Yield in Programmable Self-Assembly.” <i>Journal of Chemical Physics</i>, vol. 164, no. 8, 084904, AIP Publishing, 2026, doi:<a href=\"https://doi.org/10.1063/5.0304731\">10.1063/5.0304731</a>.","short":"M. Hübl, C.P. Goodrich, Journal of Chemical Physics 164 (2026)."},"type":"journal_article","abstract":[{"lang":"eng","text":"Rational design strategies for self-assembly require a detailed understanding of both the equilibrium state and the assembly kinetics. While the former is starting to be well understood, the latter remains a major theoretical challenge, especially in programmable systems and the so-called semi-addressable regime, where binding is often nondeterministic and the formation of off-target structures negatively influences the assembly. Here, we show that it is possible to simultaneously sculpt the assembly outcome and the assembly kinetics through the underexplored design space of binding energies and particle concentrations. By formulating the assembly process as a complex reaction network, we calculate and optimize the tradeoff between assembly speed and quality and show that parameter optimization can speed up assembly by many orders of magnitude without lowering the yield of the target structure. Although the exact speedup varies from design to design, we find the largest speedups for nondeterministic systems where unoptimized assembly is the slowest, sometimes even making them assemble faster than optimized, fully addressable designs. Therefore, these results not only solve a key challenge in semi-addressable self-assembly but further emphasize the utility of semi-addressability, where designs have the potential to be faster as well as cheaper (fewer particle species) and better (higher yield). More broadly, our results highlight the importance of parameter optimization in programmable self-assembly and provide practical tools for simultaneous optimization of kinetics and yield in a wide range of systems."}]},{"external_id":{"pmid":["41589062"]},"PlanS_conform":"1","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2026-03-08T23:01:45Z","month":"02","issue":"2","scopus_import":"1","_id":"21409","abstract":[{"text":"Meiotic drivers are selfish genetic elements that gain transmission advantages by distorting equal, Mendelian segregation. For decades, biologists have considered meiotic drivers as interesting, albeit esoteric, case studies. It is now clear, however, that meiotic drive is more common and phylogenetically widespread than previously supposed. Indeed, intensive study of a few well-known cases has begun to reveal the evolutionary genomic consequences of meiotic drive. We argue here that many features of genome evolution, content, and organization that are seemingly inexplicable by organismal adaptation or nearly neutral processes are instead best accounted for by recurrent histories of meiotic drive. We review how meiotic drive can affect the evolution of sequences, gene copy numbers, genes with functions in meiosis and gametogenesis, signatures of “selection,” chromosome rearrangements, and karyotype evolution. We also explore the interactions of meiotic drive elements with other classes of selfish genetic elements, including satellite DNAs, transposable elements, and with the endogenous host genes involved in drive suppression. Finally, we argue that some aspects of drive-mediated genome evolution are now sufficiently well established that we might reverse the direction of discovery—rather than ask how drive affects genome evolution, we can use genome data to discover new putative drive elements.","lang":"eng"}],"type":"journal_article","pmid":1,"citation":{"short":"D.C. Presgraves, R.K. Dawe, K.A. Dyer, L. Fishman, S.A. Bhide, S.L. Bradshaw, M.J. Brady, A. Burga, C. Courret, B.L. Fagen, A.B.S. Machado Ferretti, R.K. Kelemen, J. Kitano, Y. Liu, E. Martí, T. Erlenbach, J.A. Reinhardt, L. Ross, J.N. Runge, C.M. Swanepoel, B. Vicoso, A.A. Vogan, A.K. Lindholm, A.M. Larracuente, R.L. Unckless, Molecular Biology and Evolution 43 (2026).","mla":"Presgraves, Daven C., et al. “The Evolutionary Genomics of Meiotic Drive.” <i>Molecular Biology and Evolution</i>, vol. 43, no. 2, msag020, Oxford University Press, 2026, doi:<a href=\"https://doi.org/10.1093/molbev/msag020\">10.1093/molbev/msag020</a>.","ista":"Presgraves DC, Dawe RK, Dyer KA, Fishman L, Bhide SA, Bradshaw SL, Brady MJ, Burga A, Courret C, Fagen BL, Machado Ferretti ABS, Kelemen RK, Kitano J, Liu Y, Martí E, Erlenbach T, Reinhardt JA, Ross L, Runge JN, Swanepoel CM, Vicoso B, Vogan AA, Lindholm AK, Larracuente AM, Unckless RL. 2026. The evolutionary genomics of meiotic drive. Molecular Biology and Evolution. 43(2), msag020.","chicago":"Presgraves, Daven C., R. Kelly Dawe, Kelly A. Dyer, Lila Fishman, Soumitra A. Bhide, Sasha L. Bradshaw, Meghan J. Brady, et al. “The Evolutionary Genomics of Meiotic Drive.” <i>Molecular Biology and Evolution</i>. Oxford University Press, 2026. <a href=\"https://doi.org/10.1093/molbev/msag020\">https://doi.org/10.1093/molbev/msag020</a>.","ama":"Presgraves DC, Dawe RK, Dyer KA, et al. The evolutionary genomics of meiotic drive. <i>Molecular Biology and Evolution</i>. 2026;43(2). doi:<a href=\"https://doi.org/10.1093/molbev/msag020\">10.1093/molbev/msag020</a>","apa":"Presgraves, D. C., Dawe, R. K., Dyer, K. A., Fishman, L., Bhide, S. A., Bradshaw, S. L., … Unckless, R. L. (2026). The evolutionary genomics of meiotic drive. <i>Molecular Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/molbev/msag020\">https://doi.org/10.1093/molbev/msag020</a>","ieee":"D. C. Presgraves <i>et al.</i>, “The evolutionary genomics of meiotic drive,” <i>Molecular Biology and Evolution</i>, vol. 43, no. 2. Oxford University Press, 2026."},"quality_controlled":"1","publisher":"Oxford University Press","volume":43,"OA_type":"gold","department":[{"_id":"BeVi"}],"DOAJ_listed":"1","oa_version":"Published Version","status":"public","language":[{"iso":"eng"}],"file_date_updated":"2026-03-09T10:32:02Z","article_processing_charge":"Yes","has_accepted_license":"1","author":[{"first_name":"Daven C.","last_name":"Presgraves","full_name":"Presgraves, Daven C."},{"full_name":"Dawe, R. Kelly","last_name":"Dawe","first_name":"R. Kelly"},{"last_name":"Dyer","full_name":"Dyer, Kelly A.","first_name":"Kelly A."},{"first_name":"Lila","full_name":"Fishman, Lila","last_name":"Fishman"},{"last_name":"Bhide","full_name":"Bhide, Soumitra A.","first_name":"Soumitra A."},{"last_name":"Bradshaw","full_name":"Bradshaw, Sasha L.","first_name":"Sasha L."},{"full_name":"Brady, Meghan J.","last_name":"Brady","first_name":"Meghan J."},{"first_name":"Alejandro","last_name":"Burga","full_name":"Burga, Alejandro"},{"full_name":"Courret, Cécile","last_name":"Courret","first_name":"Cécile"},{"first_name":"Brandon L.","last_name":"Fagen","full_name":"Fagen, Brandon L."},{"last_name":"Machado Ferretti","full_name":"Machado Ferretti, Ana Beatriz Stein","first_name":"Ana Beatriz Stein"},{"orcid":"0000-0002-8489-9281","full_name":"Kelemen, Réka K","last_name":"Kelemen","id":"48D3F8DE-F248-11E8-B48F-1D18A9856A87","first_name":"Réka K"},{"last_name":"Kitano","full_name":"Kitano, Jun","first_name":"Jun"},{"full_name":"Liu, Yiran","last_name":"Liu","first_name":"Yiran"},{"full_name":"Martí, Emiliano","last_name":"Martí","first_name":"Emiliano"},{"first_name":"Theresa","last_name":"Erlenbach","full_name":"Erlenbach, Theresa"},{"last_name":"Reinhardt","full_name":"Reinhardt, Josephine A.","first_name":"Josephine A."},{"first_name":"Laura","full_name":"Ross, Laura","last_name":"Ross"},{"first_name":"Jan Niklas","full_name":"Runge, Jan Niklas","last_name":"Runge"},{"first_name":"Callie M.","full_name":"Swanepoel, Callie M.","last_name":"Swanepoel"},{"orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","first_name":"Beatriz"},{"first_name":"Aaron A.","last_name":"Vogan","full_name":"Vogan, Aaron A."},{"first_name":"Anna K.","full_name":"Lindholm, Anna K.","last_name":"Lindholm"},{"last_name":"Larracuente","full_name":"Larracuente, Amanda M.","first_name":"Amanda M."},{"last_name":"Unckless","full_name":"Unckless, Robert L.","first_name":"Robert L."}],"title":"The evolutionary genomics of meiotic drive","date_updated":"2026-03-09T10:33:04Z","article_number":"msag020","article_type":"original","acknowledgement":"This review is a product of the SMBE satellite workshop and the SNSF Scientific Exchange on the Genomic Consequences of Meiotic Drive. We thank the Society for Molecular Biology and Evolution (satellite grant to A.M.L., A.K.L., R.L.U., D.C.P.), the Swiss National Science Foundation (Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung IZSEZ0_217501 to A.K.L.), and the National Science Foundation Division of Molecular and Cellular Biosciences (NSF MCB Conference grant 2312190 to R.L.U.) for their generous support of the workshop.\r\n\r\nWe also thank the following for their support of individual authors: National Science Foundation Division of Molecular and Cellular Biosciences (NSF MCB CAREER 2047052 to R.L.U.), Division of Environmental Biology (NSF DEB-2344468 to L.F., NSF DEB-1737824 to K.A.D.), National Institute of General Medical Sciences (NIH R35GM119515 to A.M.L., NIH R01GM148442 to D.C.P.), European Research Council (PGErepro to L.R.), Fundação de Amparo à Pesquisa do Estado de São Paulo (FAPESP 2020/06188-5 to A.B.S.M.F.), Royal Society (DHF\\R1\\180120 to L.R.), Wissenschaftskolleg zu Berlin (support for D.C.P.), and Vetenskapsrådet (Swedish Research Council VR grant number 2021-0429 to A.A.V.).","year":"2026","publication_identifier":{"eissn":["1537-1719"]},"doi":"10.1093/molbev/msag020","day":"02","oa":1,"file":[{"file_id":"21414","date_updated":"2026-03-09T10:32:02Z","relation":"main_file","checksum":"406e7cca0f2536d3bb877032fc837f9b","content_type":"application/pdf","file_name":"2026_MolecularBioEvolution_Presgraves.pdf","success":1,"date_created":"2026-03-09T10:32:02Z","file_size":4533829,"creator":"dernst","access_level":"open_access"}],"intvolume":"        43","date_published":"2026-02-02T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["570"],"OA_place":"publisher","publication":"Molecular Biology and Evolution"},{"citation":{"short":"A. Jabal Ameli, F. Motiei, M. Saghafian, in:, 20th International Conference and Workshops on Algorithms and Computation, Springer Nature, 2026, pp. 386–401.","mla":"Jabal Ameli, Afrouz, et al. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” <i>20th International Conference and Workshops on Algorithms and Computation</i>, vol. 16444, Springer Nature, 2026, pp. 386–401, doi:<a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">10.1007/978-981-95-7127-7_26</a>.","chicago":"Jabal Ameli, Afrouz, Faezeh Motiei, and Morteza Saghafian. “On the MST-Ratio: Theoretical Bounds and Complexity of Finding the Maximum.” In <i>20th International Conference and Workshops on Algorithms and Computation</i>, 16444:386–401. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">https://doi.org/10.1007/978-981-95-7127-7_26</a>.","ista":"Jabal Ameli A, Motiei F, Saghafian M. 2026. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. 20th International Conference and Workshops on Algorithms and Computation. WALCOM: International Conference and Workshops on Algorithms and Computation, LNCS, vol. 16444, 386–401.","ama":"Jabal Ameli A, Motiei F, Saghafian M. On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In: <i>20th International Conference and Workshops on Algorithms and Computation</i>. Vol 16444. Springer Nature; 2026:386-401. doi:<a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">10.1007/978-981-95-7127-7_26</a>","apa":"Jabal Ameli, A., Motiei, F., &#38; Saghafian, M. (2026). On the MST-ratio: Theoretical bounds and complexity of finding the maximum. In <i>20th International Conference and Workshops on Algorithms and Computation</i> (Vol. 16444, pp. 386–401). Perugia, Italy: Springer Nature. <a href=\"https://doi.org/10.1007/978-981-95-7127-7_26\">https://doi.org/10.1007/978-981-95-7127-7_26</a>","ieee":"A. Jabal Ameli, F. Motiei, and M. Saghafian, “On the MST-ratio: Theoretical bounds and complexity of finding the maximum,” in <i>20th International Conference and Workshops on Algorithms and Computation</i>, Perugia, Italy, 2026, vol. 16444, pp. 386–401."},"abstract":[{"lang":"eng","text":"Given a finite set of red and blue points in R^d, the MST-ratio is defined as the total length of the Euclidean minimum spanning trees of the red points and the blue points, divided by the length of the Euclidean minimum spanning tree of their union. The MST-ratio has recently gained attention due to its direct interpretation in topological models for studying point sets with applications in spatial biology. The maximum MST-ratio of a point set is the maximum MST-ratio over all proper colorings of its points by red and blue. We prove that finding the maximum MST-ratio of a given point set is NP-hard when the dimension is part of the input. Moreover, we present a quadratic-time 3-approximation algorithm for this problem. As part of the proof, we show that in any metric space, the maximum MST-ratio is smaller than 3. Furthermore, we study the average MST-ratio over all colorings of a set of n points. We show that this average is always at least n-2/n-1, and for n random points uniformly distributed in a d-dimensional unit cube, the average tends to (math formular) in expectation as n approaches infinity."}],"type":"conference","quality_controlled":"1","volume":16444,"department":[{"_id":"HeEd"}],"OA_type":"green","publisher":"Springer Nature","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2409.11079"}],"publication_status":"published","date_created":"2026-03-08T23:01:45Z","conference":{"end_date":"2026-03-06","name":"WALCOM: International Conference and Workshops on Algorithms and Computation","location":"Perugia, Italy","start_date":"2026-03-04"},"external_id":{"arxiv":["2409.11079"]},"alternative_title":["LNCS"],"_id":"21410","month":"02","scopus_import":"1","oa":1,"day":"14","doi":"10.1007/978-981-95-7127-7_26","date_published":"2026-02-14T00:00:00Z","intvolume":"     16444","acknowledgement":"A. J. Ameli—Supported by the project COALESCE (ERC grant no. 853234).\r\nM. Saghafian—Partially supported by the European Research Council (ERC), grant no. 788183, and by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.","year":"2026","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9789819571260"]},"ec_funded":1,"publication":"20th International Conference and Workshops on Algorithms and Computation","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183"},{"name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","call_identifier":"FWF"}],"OA_place":"repository","oa_version":"Preprint","author":[{"last_name":"Jabal Ameli","full_name":"Jabal Ameli, Afrouz","first_name":"Afrouz"},{"first_name":"Faezeh","full_name":"Motiei, Faezeh","last_name":"Motiei"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"title":"On the MST-ratio: Theoretical bounds and complexity of finding the maximum","date_updated":"2026-03-09T10:25:41Z","page":"386-401","status":"public","language":[{"iso":"eng"}],"article_processing_charge":"No"},{"scopus_import":"1","month":"01","_id":"21411","alternative_title":["LIPIcs"],"conference":{"start_date":"2025-12-03","location":"Iaşi, Romania","name":"OPODIS: Conference on Principles of Distributed Systems","end_date":"2025-12-05"},"date_created":"2026-03-08T23:01:46Z","publication_status":"published","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"KrCh"}],"OA_type":"gold","volume":361,"quality_controlled":"1","type":"conference","abstract":[{"text":"To achieve fast recovery from link failures, most modern communication networks feature fully\r\ndecentralized fast re-routing mechanisms. These re-routing mechanisms rely on pre-installed static re-routing rules at the nodes (the routers), which depend only on local failure information, namely on the failed links incident to the node. Ideally, a network is perfectly resilient: the re-routing rules ensure that packets are always successfully routed to their destinations as long as the source and the destination are still physically connected in the underlying network after the failures. Unfortunately, there are examples where achieving perfect resilience is not possible. Surprisingly, only very little is known about the algorithmic aspect of when and how perfect resilience can be achieved. We investigate the computational complexity of analyzing such local fast re-routing mechanisms. Our main result is a negative one: we show that even checking whether a given set of static re-routing rules ensures perfect resilience is coNP-complete. Additionally, we investigate other fundamental variations of the problem. In particular, we show that our coNP-completeness proof also applies to scenarios where the re-routing rules have specific patterns (known as skipping in the literature). On the positive side, for scenarios where nodes do not have information about the link from which a packet arrived (the so-called in-port), we present a linear-time algorithm to realize perfect resilience whenever possible (which we show can also be determined in linear time). ","lang":"eng"}],"citation":{"ieee":"M. Bentert, E. Ceylan, V. Hübner, S. Schmid, and J. Srba, “Fast re-routing in networks: On the complexity of perfect resilience,” in <i>29th International Conference on Principles of Distributed Systems</i>, Iaşi, Romania, 2026, vol. 361.","ama":"Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. Fast re-routing in networks: On the complexity of perfect resilience. In: <i>29th International Conference on Principles of Distributed Systems</i>. Vol 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">10.4230/LIPIcs.OPODIS.2025.31</a>","apa":"Bentert, M., Ceylan, E., Hübner, V., Schmid, S., &#38; Srba, J. (2026). Fast re-routing in networks: On the complexity of perfect resilience. In <i>29th International Conference on Principles of Distributed Systems</i> (Vol. 361). Iaşi, Romania: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2025.31</a>","mla":"Bentert, Matthias, et al. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” <i>29th International Conference on Principles of Distributed Systems</i>, vol. 361, 31, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:<a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">10.4230/LIPIcs.OPODIS.2025.31</a>.","chicago":"Bentert, Matthias, Esra Ceylan, Valentin Hübner, Stefan Schmid, and Jiří Srba. “Fast Re-Routing in Networks: On the Complexity of Perfect Resilience.” In <i>29th International Conference on Principles of Distributed Systems</i>, Vol. 361. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. <a href=\"https://doi.org/10.4230/LIPIcs.OPODIS.2025.31\">https://doi.org/10.4230/LIPIcs.OPODIS.2025.31</a>.","ista":"Bentert M, Ceylan E, Hübner V, Schmid S, Srba J. 2026. Fast re-routing in networks: On the complexity of perfect resilience. 29th International Conference on Principles of Distributed Systems. OPODIS: Conference on Principles of Distributed Systems, LIPIcs, vol. 361, 31.","short":"M. Bentert, E. Ceylan, V. Hübner, S. Schmid, J. Srba, in:, 29th International Conference on Principles of Distributed Systems, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026."},"file_date_updated":"2026-03-09T12:33:58Z","article_processing_charge":"No","has_accepted_license":"1","language":[{"iso":"eng"}],"status":"public","date_updated":"2026-03-09T12:36:11Z","title":"Fast re-routing in networks: On the complexity of perfect resilience","author":[{"first_name":"Matthias","full_name":"Bentert, Matthias","last_name":"Bentert"},{"full_name":"Ceylan, Esra","last_name":"Ceylan","first_name":"Esra"},{"first_name":"Valentin","full_name":"Hübner, Valentin","last_name":"Hübner","id":"2c8aa207-dc7d-11ea-9b2f-f22972ecd910","orcid":"0009-0001-5009-4987"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"},{"first_name":"Jiří","full_name":"Srba, Jiří","last_name":"Srba"}],"oa_version":"Published Version","OA_place":"publisher","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"29th International Conference on Principles of Distributed Systems","year":"2026","publication_identifier":{"isbn":["9783959774093"],"eissn":["1868-8969"]},"acknowledgement":"Matthias Bentert: ERC Horizon 2020 research and innovation programme (grant agreement\r\nNo. 819416) and ERC Consolidator grant AdjustNet (agreement No. 864228).\r\nEsra Ceylan: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378).\r\nStefan Schmid: German Research Foundation (DFG) project ReNO, Schwerpunktprogramm:\r\nResilienz in Vernetzten Welten – Beherrschen von Fehlern, Überlast, Angriffen und dem\r\nUnbekannten (SPP 2378).","article_number":"31","intvolume":"       361","date_published":"2026-01-07T00:00:00Z","doi":"10.4230/LIPIcs.OPODIS.2025.31","day":"07","oa":1,"file":[{"checksum":"a7af114da7c38d2338b4edb922eb27f1","content_type":"application/pdf","relation":"main_file","date_updated":"2026-03-09T12:33:58Z","file_id":"21419","access_level":"open_access","creator":"dernst","file_size":1041334,"date_created":"2026-03-09T12:33:58Z","success":1,"file_name":"2026_OPODIS_Bentert.pdf"}]},{"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","publisher":"Institute of Science and Technology Austria","corr_author":"1","OA_place":"repository","OA_type":"free access","department":[{"_id":"VeSu"}],"year":"2026","day":"11","type":"research_data","doi":"10.15479/AT-ISTA-21422","citation":{"short":"V. Sunko, (2026).","ama":"Sunko V. Data underpinning “Magneto-optical Kerr effect in an A-type antiferromagnet.” 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21422\">10.15479/AT-ISTA-21422</a>","apa":"Sunko, V. (2026). Data underpinning “Magneto-optical Kerr effect in an A-type antiferromagnet.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21422\">https://doi.org/10.15479/AT-ISTA-21422</a>","ieee":"V. Sunko, “Data underpinning ‘Magneto-optical Kerr effect in an A-type antiferromagnet.’” Institute of Science and Technology Austria, 2026.","mla":"Sunko, Veronika. <i>Data Underpinning “Magneto-Optical Kerr Effect in an A-Type Antiferromagnet.”</i> Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21422\">10.15479/AT-ISTA-21422</a>.","chicago":"Sunko, Veronika. “Data Underpinning ‘Magneto-Optical Kerr Effect in an A-Type Antiferromagnet.’” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21422\">https://doi.org/10.15479/AT-ISTA-21422</a>.","ista":"Sunko V. 2026. Data underpinning ‘Magneto-optical Kerr effect in an A-type antiferromagnet’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21422\">10.15479/AT-ISTA-21422</a>."},"file":[{"file_name":"MBT_Data_Paper.zip","success":1,"date_created":"2026-03-11T10:28:34Z","creator":"vsunko","file_size":85004,"access_level":"open_access","date_updated":"2026-03-11T10:28:34Z","file_id":"21429","content_type":"application/zip","checksum":"54db0b68f0cf919009317fd3da8f733b","relation":"main_file"},{"file_id":"21430","date_updated":"2026-03-11T10:28:37Z","relation":"main_file","checksum":"df1785b7ada7cd07f76a441ee4f52266","content_type":"text/plain","file_name":"README.txt","success":1,"date_created":"2026-03-11T10:28:37Z","file_size":2593,"creator":"vsunko","access_level":"open_access"}],"oa":1,"date_published":"2026-03-11T00:00:00Z","month":"03","status":"public","file_date_updated":"2026-03-11T10:28:37Z","article_processing_charge":"No","has_accepted_license":"1","title":"Data underpinning \"Magneto-optical Kerr effect in an A-type antiferromagnet\"","author":[{"id":"23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3","last_name":"Sunko","full_name":"Sunko, Veronika","orcid":"0000-0003-2724-3523","first_name":"Veronika"}],"_id":"21422","date_updated":"2026-03-11T13:01:48Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"date_created":"2026-03-11T07:04:26Z","oa_version":"None"},{"keyword":["hypocampus","ca3 simulations","modelling"],"tmp":{"short":"GPL 3.0","legal_code_url":"https://www.gnu.org/licenses/gpl-3.0.en.html","name":"GNU General Public License 3.0"},"date_created":"2026-03-12T08:20:46Z","month":"03","status":"public","file_date_updated":"2026-03-12T10:24:45Z","has_accepted_license":"1","title":"CA3Simu v1.06 (vargas2026v1)","author":[{"last_name":"Schlögl","full_name":"Schlögl, Alois","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5621-8100","first_name":"Alois"}],"_id":"21442","date_updated":"2026-03-12T11:28:52Z","ec_funded":1,"year":"2026","doi":"10.15479/AT-ISTA-21442","type":"software","day":"12","citation":{"short":"A. Schlögl, (2026).","mla":"Schlögl, Alois. <i>CA3Simu v1.06 (Vargas2026v1)</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","chicago":"Schlögl, Alois. “CA3Simu v1.06 (Vargas2026v1).” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>.","ista":"Schlögl A. 2026. CA3Simu v1.06 (vargas2026v1), Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>.","ama":"Schlögl A. CA3Simu v1.06 (vargas2026v1). 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21442\">10.15479/AT-ISTA-21442</a>","apa":"Schlögl, A. (2026). CA3Simu v1.06 (vargas2026v1). Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21442\">https://doi.org/10.15479/AT-ISTA-21442</a>","ieee":"A. Schlögl, “CA3Simu v1.06 (vargas2026v1).” Institute of Science and Technology Austria, 2026."},"file":[{"checksum":"441c8827717dcda05f91c127d15cf1e9","content_type":"application/gzip","relation":"main_file","date_updated":"2026-03-12T08:19:14Z","file_id":"21443","access_level":"open_access","success":1,"date_created":"2026-03-12T08:19:14Z","file_name":"ca3simu-vargas2026v1.tar.gz","creator":"schloegl","file_size":160410},{"file_id":"21445","date_updated":"2026-03-12T10:24:45Z","relation":"main_file","content_type":"text/markdown","checksum":"3c0092076228a15c0a7ae703192d43ea","file_size":10923,"creator":"schloegl","file_name":"README.md","date_created":"2026-03-12T10:24:45Z","success":1,"access_level":"open_access"}],"oa":1,"date_published":"2026-03-12T00:00:00Z","license":"https://opensource.org/licenses/GPL-3.0","project":[{"name":"Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits","_id":"e62b56fe-ab3c-11f0-94c7-d181dd352b3b","grant_number":"101199096"},{"grant_number":"P36232","name":"Mechanisms of GABA release in hippocampal circuits","_id":"bd88be38-d553-11ed-ba76-81d5a70a6ef5"},{"grant_number":"PAT 4178023","name":"Synaptic networks of human brain","_id":"8d9195e9-16d5-11f0-9cad-d075be887a1e"},{"_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glutamatergic synapse","grant_number":"692692","call_identifier":"H2020"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","corr_author":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"ScienComp"},{"_id":"PeJo"}]},{"OA_place":"repository","ddc":["000"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","project":[{"call_identifier":"H2020","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software"},{"grant_number":"F8512","name":"Security and Privacy by Design for Complex Systems","_id":"34a4ce89-11ca-11ed-8bc3-8cc37fb6e11f"}],"supervisor":[{"first_name":"Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger"}],"publication_identifier":{"issn":["2791-4585"]},"acknowledgement":"This work is part of the project VAMOS, which has received funding from the European\r\nResearch Council (ERC) under grant agreement No. 101020093, and the Austrian Science\r\nFund (FWF) SFB project SpyCoDe F8502.\r\n","year":"2026","degree_awarded":"MS","ec_funded":1,"date_published":"2026-03-05T00:00:00Z","file":[{"content_type":"application/pdf","checksum":"3f49f05c9d123e14d7adb73d3bc50fe2","relation":"main_file","date_updated":"2026-03-10T15:20:09Z","file_id":"21404","access_level":"open_access","creator":"mkarimi","file_size":766048,"date_created":"2026-03-06T14:06:25Z","file_name":"2026_Karimi_Mahyar_Thesis.pdf"},{"content_type":"application/zip","checksum":"8fb9db4b4187e26443369a993427a5ff","relation":"source_file","date_updated":"2026-03-06T14:06:25Z","file_id":"21405","access_level":"closed","creator":"mkarimi","file_size":1243394,"date_created":"2026-03-06T14:06:25Z","file_name":"2026_Karimi_Mahyar_Thesis_src.zip"}],"oa":1,"doi":"10.15479/AT-ISTA-21401","day":"05","has_accepted_license":"1","article_processing_charge":"No","file_date_updated":"2026-03-10T15:20:09Z","status":"public","language":[{"iso":"eng"}],"related_material":{"record":[{"id":"21020","relation":"part_of_dissertation","status":"public"}]},"page":"60","date_updated":"2026-03-13T13:37:20Z","author":[{"orcid":"0009-0005-0820-1696","last_name":"Karimi","full_name":"Karimi, Mahyar","id":"6e5417ba-5355-11ee-ae5a-94c2e510b26b","first_name":"Mahyar"}],"title":"Privacy-preserving runtime verification","keyword":["Privacy-preserving verification","Runtime verification","Monitoring","Reactive functionalities","Cryptographic protocols"],"oa_version":"Published Version","corr_author":"1","publisher":"Institute of Science and Technology Austria","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"citation":{"apa":"Karimi, M. (2026). <i>Privacy-preserving runtime verification</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>","ieee":"M. Karimi, “Privacy-preserving runtime verification,” Institute of Science and Technology Austria, 2026.","ama":"Karimi M. Privacy-preserving runtime verification. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>","mla":"Karimi, Mahyar. <i>Privacy-Preserving Runtime Verification</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21401\">10.15479/AT-ISTA-21401</a>.","chicago":"Karimi, Mahyar. “Privacy-Preserving Runtime Verification.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21401\">https://doi.org/10.15479/AT-ISTA-21401</a>.","ista":"Karimi M. 2026. Privacy-preserving runtime verification. Institute of Science and Technology Austria.","short":"M. Karimi, Privacy-Preserving Runtime Verification, Institute of Science and Technology Austria, 2026."},"abstract":[{"lang":"eng","text":"Runtime verification offers scalable solutions to improve the safety and reliability of systems. However, systems that require verification or monitoring by a third party to ensure compliance with a specification might contain sensitive information, causing privacy concerns when usual runtime verification approaches are used. Privacy is compromised if protected information about the system, or sensitive data that is processed by the system, is revealed. In addition, revealing the specification being monitored may undermine the essence of third-party verification.\r\n\r\nIn this thesis, we propose a protocol for privacy-preserving runtime verification of systems against formal sequential specifications. We develop the protocol in two steps. In the first step, the monitor verifies whether the system satisfies the specification without learning anything else, though both parties are aware of the specification. In the second step, we extend the protocol to ensure that the system remains oblivious to the monitored specification, while the monitor learns only whether the system satisfies the specification and nothing more. Our protocol adapts and improves existing techniques used in cryptography, and more specifically, multi-party computation.\r\n\r\nThe sequential specification defines the observation step of the monitor, whose granularity depends on the situation (e.g., banks may be monitored on a daily basis). Our protocol exchanges a single message per observation step, after an initialization phase. This design minimizes communication overhead, enabling relatively lightweight privacy-preserving monitoring. We implement our approach for monitoring specifications described by register automata and evaluate it experimentally.\r\n"}],"type":"dissertation","month":"03","_id":"21401","alternative_title":["ISTA Master’s Thesis"],"date_created":"2026-03-05T15:20:47Z","publication_status":"published"}]