[{"citation":{"ama":"Kopfová L, Tkadlec J. Colonization times in Moran process on graphs. <i>PLoS computational biology</i>. 2025;21(5):e1012868. doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1012868\">10.1371/journal.pcbi.1012868</a>","short":"L. Kopfová, J. Tkadlec, PLoS Computational Biology 21 (2025) e1012868.","ieee":"L. Kopfová and J. Tkadlec, “Colonization times in Moran process on graphs,” <i>PLoS computational biology</i>, vol. 21, no. 5. Public Library of Science, p. e1012868, 2025.","mla":"Kopfová, Lenka, and Josef Tkadlec. “Colonization Times in Moran Process on Graphs.” <i>PLoS Computational Biology</i>, vol. 21, no. 5, Public Library of Science, 2025, p. e1012868, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1012868\">10.1371/journal.pcbi.1012868</a>.","apa":"Kopfová, L., &#38; Tkadlec, J. (2025). Colonization times in Moran process on graphs. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1012868\">https://doi.org/10.1371/journal.pcbi.1012868</a>","chicago":"Kopfová, Lenka, and Josef Tkadlec. “Colonization Times in Moran Process on Graphs.” <i>PLoS Computational Biology</i>. Public Library of Science, 2025. <a href=\"https://doi.org/10.1371/journal.pcbi.1012868\">https://doi.org/10.1371/journal.pcbi.1012868</a>.","ista":"Kopfová L, Tkadlec J. 2025. Colonization times in Moran process on graphs. PLoS computational biology. 21(5), e1012868."},"arxiv":1,"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"gold","page":"e1012868","oa":1,"external_id":{"arxiv":["2410.09476"],"isi":["001481670600002"]},"isi":1,"ddc":["000"],"intvolume":"        21","type":"journal_article","publisher":"Public Library of Science","volume":21,"article_processing_charge":"Yes","date_created":"2025-05-18T22:02:50Z","has_accepted_license":"1","title":"Colonization times in Moran process on graphs","publication_identifier":{"eissn":["1553-7358"]},"DOAJ_listed":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","issue":"5","oa_version":"Published Version","date_published":"2025-05-01T00:00:00Z","doi":"10.1371/journal.pcbi.1012868","date_updated":"2025-09-30T12:34:03Z","author":[{"id":"17691681-50b9-11ef-ad56-edf4cacb21b0","last_name":"Kopfová","full_name":"Kopfová, Lenka","first_name":"Lenka"},{"orcid":"0000-0002-1097-9684","last_name":"Tkadlec","full_name":"Tkadlec, Josef","first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"}],"file":[{"success":1,"relation":"main_file","date_created":"2025-05-19T07:45:31Z","checksum":"73e35151eebd5064972c5a07ffdf2b69","file_size":6805943,"creator":"dernst","file_id":"19709","content_type":"application/pdf","file_name":"2025_PloSCompBio_Kopfova.pdf","access_level":"open_access","date_updated":"2025-05-19T07:45:31Z"}],"quality_controlled":"1","article_type":"original","department":[{"_id":"GradSch"}],"publication":"PLoS computational biology","month":"05","abstract":[{"text":"Moran Birth-death process is a standard stochastic process that is used to model natural selection in spatially structured populations. A newly occurring mutation that invades a population of residents can either fixate on the whole population or it can go extinct due to random drift. The duration of the process depends not only on the total population size n, but also on the spatial structure of the population. In this work, we consider the Moran process with a single type of individuals who invade and colonize an otherwise empty environment. Mathematically, this corresponds to the setting where the residents have zero reproduction rate, thus they never reproduce. The spatial structure is represented by a graph. We present two main contributions. First, in contrast to the Moran process in which residents do reproduce, we show that the colonization time is always at most a polynomial function of the population size n. Namely, we show that colonization always takes at most 1/2n^3 - 1/2n^2 expected steps, and for each n, we identify the slowest graph where it takes exactly that many steps. Moreover, we establish a stronger bound of roughly n^2.5 steps for undirected graphs and an even stronger bound of roughly n^2 steps for so-called regular graphs. Second, we discuss various complications that one faces when attempting to measure fixation times and colonization times in spatially structured populations, and we propose to measure the real duration of the process, rather than counting the steps of the classic Moran process.","lang":"eng"}],"year":"2025","file_date_updated":"2025-05-19T07:45:31Z","scopus_import":"1","_id":"19702","OA_place":"publisher"},{"publisher":"Elsevier","ec_funded":1,"article_processing_charge":"Yes (in subscription journal)","type":"journal_article","volume":60,"acknowledgement":"We thank A. Dimitracopoulos, K. Kawaguchi, J. Vidigueira, B. Baum, I. McLaren, D. St Johnston, and members of the Buckley, Scarpa, Steventon, Kawaguchi, and Xiong labs for technical assistance and constructive feedback. We thank Ryan Greenhalgh for methods developed to obtain fluidity values from AFM data. We thank Nicola Lawrence, Alex Sossick, and Sargon Gross-Thebing from the Gurdon Institute Imaging Facility for microscopy support. Funding: this work was supported by a Wellcome Trust/Royal Society Sir Henry Dale Fellowship (215439/Z/19/Z) and UKRI-EPSRC Frontier Research Grant (EP/X023761/1, originally selected as an ERC Starting Grant) to F.X.; an ERC Consolidator Grant (772426), ERC Synergy Grant 101118729 UNFOLD, and Alexander von Humboldt Professorship ( Alexander von Humboldt Foundation) to K.F.; and an ERC Starting Grant (851288) to E.H.","date_created":"2025-05-18T22:02:50Z","has_accepted_license":"1","ddc":["570"],"project":[{"call_identifier":"H2020","name":"Design Principles of Branching Morphogenesis","grant_number":"851288","_id":"05943252-7A3F-11EA-A408-12923DDC885E"}],"intvolume":"        60","OA_type":"hybrid","page":"2237-2247.e4","isi":1,"oa":1,"external_id":{"isi":["001570502100005"],"pmid":["40347948"]},"citation":{"chicago":"Mclaren, Susannah B.P., Shi-lei Xue, Siyuan Ding, Alexander K. Winkel, Oscar Baldwin, Shreya Dwarakacherla, Kristian Franze, Edouard B Hannezo, and Fengzhu Xiong. “Differential Tissue Deformability Underlies Fluid Pressure-Driven Shape Divergence of the Avian Embryonic Brain and Spinal Cord.” <i>Developmental Cell</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.devcel.2025.04.010\">https://doi.org/10.1016/j.devcel.2025.04.010</a>.","apa":"Mclaren, S. B. P., Xue, S., Ding, S., Winkel, A. K., Baldwin, O., Dwarakacherla, S., … Xiong, F. (2025). Differential tissue deformability underlies fluid pressure-driven shape divergence of the avian embryonic brain and spinal cord. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2025.04.010\">https://doi.org/10.1016/j.devcel.2025.04.010</a>","mla":"Mclaren, Susannah B. P., et al. “Differential Tissue Deformability Underlies Fluid Pressure-Driven Shape Divergence of the Avian Embryonic Brain and Spinal Cord.” <i>Developmental Cell</i>, vol. 60, no. 17, Elsevier, 2025, p. 2237–2247.e4, doi:<a href=\"https://doi.org/10.1016/j.devcel.2025.04.010\">10.1016/j.devcel.2025.04.010</a>.","ista":"Mclaren SBP, Xue S, Ding S, Winkel AK, Baldwin O, Dwarakacherla S, Franze K, Hannezo EB, Xiong F. 2025. Differential tissue deformability underlies fluid pressure-driven shape divergence of the avian embryonic brain and spinal cord. Developmental Cell. 60(17), 2237–2247.e4.","ieee":"S. B. P. Mclaren <i>et al.</i>, “Differential tissue deformability underlies fluid pressure-driven shape divergence of the avian embryonic brain and spinal cord,” <i>Developmental Cell</i>, vol. 60, no. 17. Elsevier, p. 2237–2247.e4, 2025.","ama":"Mclaren SBP, Xue S, Ding S, et al. Differential tissue deformability underlies fluid pressure-driven shape divergence of the avian embryonic brain and spinal cord. <i>Developmental Cell</i>. 2025;60(17):2237-2247.e4. doi:<a href=\"https://doi.org/10.1016/j.devcel.2025.04.010\">10.1016/j.devcel.2025.04.010</a>","short":"S.B.P. Mclaren, S. Xue, S. Ding, A.K. Winkel, O. Baldwin, S. Dwarakacherla, K. Franze, E.B. Hannezo, F. Xiong, Developmental Cell 60 (2025) 2237–2247.e4."},"publication_status":"published","language":[{"iso":"eng"}],"pmid":1,"month":"09","publication":"Developmental Cell","abstract":[{"lang":"eng","text":"An enlarged brain underlies the complex central nervous system of vertebrates. The dramatic expansion of the brain that diverges its shape from the spinal cord follows neural tube closure during embryonic development. Here, we show that this differential deformation is encoded by a pre-pattern of tissue material properties in chicken embryos. Using magnetic droplets and atomic force microscopy, we demonstrate that the dorsal hindbrain is more fluid than the dorsal spinal cord, resulting in a thinning versus a resisting response to increasing lumen pressure, respectively. The dorsal hindbrain exhibits reduced apical actin and a disorganized laminin matrix consistent with tissue fluidization. Blocking the activity of neural-crest-associated matrix metalloproteinases inhibits hindbrain expansion. Transplanting dorsal hindbrain cells to the spinal cord can locally create an expanded brain-like morphology in some cases. Our findings raise questions in vertebrate head evolution and suggest a general role of mechanical pre-patterning in sculpting epithelial tubes."}],"department":[{"_id":"EdHa"}],"_id":"19703","OA_place":"publisher","year":"2025","scopus_import":"1","file_date_updated":"2025-12-29T13:45:05Z","author":[{"first_name":"Susannah B.P.","full_name":"Mclaren, Susannah B.P.","last_name":"Mclaren"},{"first_name":"Shi-lei","full_name":"Xue, Shi-lei","last_name":"Xue","id":"31D2C804-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ding, Siyuan","first_name":"Siyuan","last_name":"Ding"},{"full_name":"Winkel, Alexander K.","first_name":"Alexander K.","last_name":"Winkel"},{"first_name":"Oscar","full_name":"Baldwin, Oscar","last_name":"Baldwin"},{"last_name":"Dwarakacherla","full_name":"Dwarakacherla, Shreya","first_name":"Shreya"},{"first_name":"Kristian","full_name":"Franze, Kristian","last_name":"Franze"},{"first_name":"Edouard B","full_name":"Hannezo, Edouard B","last_name":"Hannezo","orcid":"0000-0001-6005-1561","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Xiong, Fengzhu","first_name":"Fengzhu","last_name":"Xiong"}],"article_type":"original","file":[{"file_size":12564806,"creator":"dernst","file_id":"20872","content_type":"application/pdf","relation":"main_file","date_created":"2025-12-29T13:45:05Z","checksum":"1ca6f0822c1cbd430686d5e2a4f96401","success":1,"date_updated":"2025-12-29T13:45:05Z","access_level":"open_access","file_name":"2025_DevelopmentalCell_McLaren.pdf"}],"quality_controlled":"1","date_updated":"2025-12-29T14:58:14Z","PlanS_conform":"1","issue":"17","day":"08","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","date_published":"2025-09-08T00:00:00Z","doi":"10.1016/j.devcel.2025.04.010","oa_version":"Published Version","publication_identifier":{"eissn":["1878-1551"],"issn":["1534-5807"]},"title":"Differential tissue deformability underlies fluid pressure-driven shape divergence of the avian embryonic brain and spinal cord","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"}},{"publisher":"Springer Nature","article_processing_charge":"No","type":"conference","volume":15606,"acknowledgement":"We thank Pierre Briaud and Morten Øygarden for helpful discussions on algebraic attacks on RSD, and the EC reviewers for helpful comments.","date_created":"2025-05-19T14:15:01Z","intvolume":"     15606","OA_type":"green","page":"385-415","oa":1,"alternative_title":["LNCS"],"conference":{"start_date":"2025-05-04","name":"EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques","end_date":"2025-05-08","location":"Madrid, Spain"},"citation":{"ista":"Cueto Noval M, Merz S-P, Stählin P, Ünal A. 2025. On the soundness of algebraic attacks against code-based assumptions. 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques. EUROCRYPT: International Conference on the Theory and Applications of Cryptographic Techniques, LNCS, vol. 15606, 385–415.","mla":"Cueto Noval, Miguel, et al. “On the Soundness of Algebraic Attacks against Code-Based Assumptions.” <i>44th Annual International Conference on the Theory and Applications of Cryptographic Techniques</i>, vol. 15606, Springer Nature, 2025, pp. 385–415, doi:<a href=\"https://doi.org/10.1007/978-3-031-91095-1_14\">10.1007/978-3-031-91095-1_14</a>.","chicago":"Cueto Noval, Miguel, Simon-Philipp Merz, Patrick Stählin, and Akin Ünal. “On the Soundness of Algebraic Attacks against Code-Based Assumptions.” In <i>44th Annual International Conference on the Theory and Applications of Cryptographic Techniques</i>, 15606:385–415. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-91095-1_14\">https://doi.org/10.1007/978-3-031-91095-1_14</a>.","apa":"Cueto Noval, M., Merz, S.-P., Stählin, P., &#38; Ünal, A. (2025). On the soundness of algebraic attacks against code-based assumptions. In <i>44th Annual International Conference on the Theory and Applications of Cryptographic Techniques</i> (Vol. 15606, pp. 385–415). Madrid, Spain: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-91095-1_14\">https://doi.org/10.1007/978-3-031-91095-1_14</a>","short":"M. Cueto Noval, S.-P. Merz, P. Stählin, A. Ünal, in:, 44th Annual International Conference on the Theory and Applications of Cryptographic Techniques, Springer Nature, 2025, pp. 385–415.","ama":"Cueto Noval M, Merz S-P, Stählin P, Ünal A. On the soundness of algebraic attacks against code-based assumptions. In: <i>44th Annual International Conference on the Theory and Applications of Cryptographic Techniques</i>. Vol 15606. Springer Nature; 2025:385-415. doi:<a href=\"https://doi.org/10.1007/978-3-031-91095-1_14\">10.1007/978-3-031-91095-1_14</a>","ieee":"M. Cueto Noval, S.-P. Merz, P. Stählin, and A. Ünal, “On the soundness of algebraic attacks against code-based assumptions,” in <i>44th Annual International Conference on the Theory and Applications of Cryptographic Techniques</i>, Madrid, Spain, 2025, vol. 15606, pp. 385–415."},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"month":"04","publication":"44th Annual International Conference on the Theory and Applications of Cryptographic Techniques","abstract":[{"text":"We study recent algebraic attacks (Briaud-Øygarden EC’23) on the Regular Syndrome Decoding (RSD) problem and the assumptions underlying the correctness of their attacks’ complexity estimates. By relating these assumptions to interesting algebraic-combinatorial problems, we prove that they do not hold in full generality. However, we show that they are (asymptotically) true for most parameter sets, supporting the soundness of algebraic attacks on RSD. Further, we prove—without any heuristics or assumptions—that RSD can be broken in polynomial time whenever the number of error blocks times the square of the size of error blocks is larger than 2 times the square of the dimension of the code.\r\nAdditionally, we use our methodology to attack a variant of the Learning With Errors problem where each error term lies in a fixed set of constant size. We prove that this problem can be broken in polynomial time, given a sufficient number of samples. This result improves on the seminal work by Arora and Ge (ICALP’11), as the attack’s time complexity is independent of the LWE modulus.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://www.research-collection.ethz.ch/handle/20.500.11850/732894"}],"year":"2025","scopus_import":"1","_id":"19712","OA_place":"repository","date_updated":"2025-05-28T06:12:39Z","author":[{"id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","orcid":"0000-0002-2505-4246","full_name":"Cueto Noval, Miguel","first_name":"Miguel","last_name":"Cueto Noval"},{"full_name":"Merz, Simon-Philipp","first_name":"Simon-Philipp","last_name":"Merz"},{"last_name":"Stählin","full_name":"Stählin, Patrick","first_name":"Patrick"},{"id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","last_name":"Ünal","first_name":"Akin","full_name":"Ünal, Akin"}],"quality_controlled":"1","corr_author":"1","day":"28","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","date_published":"2025-04-28T00:00:00Z","doi":"10.1007/978-3-031-91095-1_14","title":"On the soundness of algebraic attacks against code-based assumptions","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783031910951"],"issn":["0302-9743"],"isbn":["9783031910944"]}},{"intvolume":"        39","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement\r\nNo 805223 ScaleML). The authors would like to acknowledge Eugenia Iofinova for useful discussions during the inception of this project.","type":"journal_article","publisher":"Association for the Advancement of Artificial Intelligence","article_processing_charge":"No","ec_funded":1,"volume":39,"date_created":"2025-05-19T14:15:35Z","citation":{"ieee":"S. Talaei, M. Ansaripour, G. Nadiradze, and D.-A. Alistarh, “Hybrid decentralized optimization: Leveraging both first- and zeroth-order optimizers for faster convergence,” <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>, vol. 39, no. 19. Association for the Advancement of Artificial Intelligence, pp. 20778–20786, 2025.","short":"S. Talaei, M. Ansaripour, G. Nadiradze, D.-A. Alistarh, Proceedings of the 39th AAAI Conference on Artificial Intelligence 39 (2025) 20778–20786.","ama":"Talaei S, Ansaripour M, Nadiradze G, Alistarh D-A. Hybrid decentralized optimization: Leveraging both first- and zeroth-order optimizers for faster convergence. <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>. 2025;39(19):20778-20786. doi:<a href=\"https://doi.org/10.1609/aaai.v39i19.34290\">10.1609/aaai.v39i19.34290</a>","ista":"Talaei S, Ansaripour M, Nadiradze G, Alistarh D-A. 2025. Hybrid decentralized optimization: Leveraging both first- and zeroth-order optimizers for faster convergence. Proceedings of the 39th AAAI Conference on Artificial Intelligence. 39(19), 20778–20786.","apa":"Talaei, S., Ansaripour, M., Nadiradze, G., &#38; Alistarh, D.-A. (2025). Hybrid decentralized optimization: Leveraging both first- and zeroth-order optimizers for faster convergence. <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence. <a href=\"https://doi.org/10.1609/aaai.v39i19.34290\">https://doi.org/10.1609/aaai.v39i19.34290</a>","mla":"Talaei, Shayan, et al. “Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence.” <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>, vol. 39, no. 19, Association for the Advancement of Artificial Intelligence, 2025, pp. 20778–86, doi:<a href=\"https://doi.org/10.1609/aaai.v39i19.34290\">10.1609/aaai.v39i19.34290</a>.","chicago":"Talaei, Shayan, Matin Ansaripour, Giorgi Nadiradze, and Dan-Adrian Alistarh. “Hybrid Decentralized Optimization: Leveraging Both First- and Zeroth-Order Optimizers for Faster Convergence.” <i>Proceedings of the 39th AAAI Conference on Artificial Intelligence</i>. Association for the Advancement of Artificial Intelligence, 2025. <a href=\"https://doi.org/10.1609/aaai.v39i19.34290\">https://doi.org/10.1609/aaai.v39i19.34290</a>."},"arxiv":1,"publication_status":"published","language":[{"iso":"eng"}],"page":"20778-20786","OA_type":"free access","external_id":{"arxiv":["2210.07703"]},"oa":1,"date_updated":"2026-02-16T12:34:44Z","article_type":"original","quality_controlled":"1","author":[{"last_name":"Talaei","first_name":"Shayan","full_name":"Talaei, Shayan"},{"first_name":"Matin","full_name":"Ansaripour, Matin","last_name":"Ansaripour"},{"id":"3279A00C-F248-11E8-B48F-1D18A9856A87","first_name":"Giorgi","full_name":"Nadiradze, Giorgi","last_name":"Nadiradze","orcid":"0000-0001-5634-0731"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"corr_author":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/ShayanTalaei/HDO"}]},"department":[{"_id":"DaAl"}],"abstract":[{"lang":"eng","text":"Distributed optimization is the standard way of speeding up machine learning training, and most of the research in the area focuses on distributed first-order, gradient-based methods. Yet, there are settings where some computationally-bounded nodes may not be able to implement first-order, gradient-based optimization, while they could still contribute to joint optimization tasks. In this paper, we initiate the study of hybrid decentralized optimization, studying settings where nodes with zeroth-order and first-order optimization capabilities co-exist in a distributed system, and attempt to jointly solve an optimization task over some data distribution. We essentially show that, under reasonable parameter settings, such a system can not only withstand noisier zeroth-order agents but can even benefit from integrating such agents into the optimization process, rather than ignoring their information. At the core of our approach is a new analysis of distributed optimization with noisy and possibly-biased gradient estimators, which may be of independent interest. Our results hold for both convex and non-convex objectives. Experimental results on standard optimization tasks confirm our analysis, showing that hybrid first-zeroth order optimization can be practical, even when training deep neural networks."}],"month":"04","publication":"Proceedings of the 39th AAAI Conference on Artificial Intelligence","scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.1609/aaai.v39i19.34290","open_access":"1"}],"year":"2025","OA_place":"publisher","_id":"19713","title":"Hybrid decentralized optimization: Leveraging both first- and zeroth-order optimizers for faster convergence","publication_identifier":{"eissn":["2374-3468"],"issn":["2159-5399"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"11","issue":"19","oa_version":"Preprint","doi":"10.1609/aaai.v39i19.34290","date_published":"2025-04-11T00:00:00Z"},{"publication_status":"published","language":[{"iso":"eng"}],"citation":{"ista":"Varela-Martínez I, Villalba Requena A, Garcia-Marqués J, Hippenmeyer S, Nieto M. 2025. Early emergence of projection-subtype fate-restricted radial glial progenitors orchestrates neocortical neurogenesis. bioRxiv, <a href=\"https://doi.org/10.1101/2025.05.07.652665\">10.1101/2025.05.07.652665</a>.","mla":"Varela-Martínez, I., et al. “Early Emergence of Projection-Subtype Fate-Restricted Radial Glial Progenitors Orchestrates Neocortical Neurogenesis.” <i>BioRxiv</i>, 2025, doi:<a href=\"https://doi.org/10.1101/2025.05.07.652665\">10.1101/2025.05.07.652665</a>.","apa":"Varela-Martínez, I., Villalba Requena, A., Garcia-Marqués, J., Hippenmeyer, S., &#38; Nieto, M. (2025). Early emergence of projection-subtype fate-restricted radial glial progenitors orchestrates neocortical neurogenesis. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2025.05.07.652665\">https://doi.org/10.1101/2025.05.07.652665</a>","chicago":"Varela-Martínez, I, Ana Villalba Requena, J. Garcia-Marqués, Simon Hippenmeyer, and M. Nieto. “Early Emergence of Projection-Subtype Fate-Restricted Radial Glial Progenitors Orchestrates Neocortical Neurogenesis.” <i>BioRxiv</i>, 2025. <a href=\"https://doi.org/10.1101/2025.05.07.652665\">https://doi.org/10.1101/2025.05.07.652665</a>.","short":"I. Varela-Martínez, A. Villalba Requena, J. Garcia-Marqués, S. Hippenmeyer, M. Nieto, BioRxiv (2025).","ama":"Varela-Martínez I, Villalba Requena A, Garcia-Marqués J, Hippenmeyer S, Nieto M. Early emergence of projection-subtype fate-restricted radial glial progenitors orchestrates neocortical neurogenesis. <i>bioRxiv</i>. 2025. doi:<a href=\"https://doi.org/10.1101/2025.05.07.652665\">10.1101/2025.05.07.652665</a>","ieee":"I. Varela-Martínez, A. Villalba Requena, J. Garcia-Marqués, S. Hippenmeyer, and M. Nieto, “Early emergence of projection-subtype fate-restricted radial glial progenitors orchestrates neocortical neurogenesis,” <i>bioRxiv</i>. 2025."},"title":"Early emergence of projection-subtype fate-restricted radial glial progenitors orchestrates neocortical neurogenesis","date_published":"2025-05-07T00:00:00Z","doi":"10.1101/2025.05.07.652665","oa":1,"oa_version":"Preprint","OA_type":"green","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","author":[{"last_name":"Varela-Martínez","full_name":"Varela-Martínez, I","first_name":"I"},{"id":"68cb85a0-39f7-11eb-9559-9aaab4f6a247","orcid":"0000-0002-5615-5277","last_name":"Villalba Requena","full_name":"Villalba Requena, Ana","first_name":"Ana"},{"full_name":"Garcia-Marqués, J.","first_name":"J.","last_name":"Garcia-Marqués"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon","first_name":"Simon"},{"last_name":"Nieto","full_name":"Nieto, M.","first_name":"M."}],"date_updated":"2025-05-28T06:37:46Z","_id":"19717","OA_place":"repository","year":"2025","main_file_link":[{"url":"https://doi.org/10.1101/2025.05.07.652665","open_access":"1"}],"date_created":"2025-05-20T10:19:29Z","month":"05","article_processing_charge":"No","publication":"bioRxiv","type":"preprint","acknowledgement":"We thank M. Caouyette for the plasmid construction for Pou3f1 overexpression; C. Varela747 Martínez for help with the code for graphical analysis; all members from the Nieto’s lab for\r\ncomment on the manuscript, specially to F. Martín for the insightful discussions;J.C. Oliveros\r\nand J.A. García from the computational service of the CNB for help with the analysis of\r\nRNAseq dataset, C.O. Sorzano for the help with statistical analysis, and the service of\r\nAdvance Optical Microscopy of the CNB for their technical advice.\r\nI.V.M holds a fellowship funded by MCICIU (PRE-2018-083376), the work was funded by\r\nPID2020-112831GB-I00 funded by MCIN/AEI /10.13039/501100011033.\r\n","abstract":[{"text":"Radial glial progenitors (RGPs) generate all projection neurons (PNs) in the cerebral cortex through incompletely understood processes. Herein, we combine Mosaic Analysis with Double Markers (MADM)-based clonal analysis at embryonic days 12.5 and 13.5 with early postnatal callosal tracing to reveal a lineage progression that challenges the inside-outside model of cortical development and the conventional view of an invariable sequence of asymmetric neurogenic divisions. Our data demonstrate that early multipotent RGPs generate all extra-telencephalic (ET) and intra-telencephalic (IT) PNs across all layers through parallel sublineages and the random specification, during the earliest neurogenic divisions, of fate-restricted daughter RGPs. While the neuronal production of the parental multipotent RGPs consists of small ET-PN or IT-PN outputs, fate-restricted RGPs produce larger translaminar outputs spanning deep and upper layers of only IT-PNs, the predominant mammalian PN subtype. We further show that the emergence of IT-PN fate-restricted RGPs also leads to quantitatively and temporally stereotyped neurogenesis population-wise.","lang":"eng"}],"department":[{"_id":"SiHi"}]},{"date_updated":"2025-12-30T08:18:25Z","file":[{"success":1,"date_created":"2025-12-30T08:18:07Z","relation":"main_file","checksum":"fb6e84ba7dc92faee97647fd2bc8cca8","file_size":1682721,"file_id":"20892","creator":"dernst","content_type":"application/pdf","file_name":"2025_JourMolecularBiology_Antoney.pdf","access_level":"open_access","date_updated":"2025-12-30T08:18:07Z"}],"article_type":"original","quality_controlled":"1","author":[{"last_name":"Antoney","full_name":"Antoney, James","first_name":"James"},{"orcid":"0000-0002-6709-2195","first_name":"Stephanie","full_name":"Kainrath, Stephanie","last_name":"Kainrath","id":"32CFBA64-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Dubowsky","full_name":"Dubowsky, Joshua G.","first_name":"Joshua G."},{"full_name":"Ahmed, F. Hafna","first_name":"F. Hafna","last_name":"Ahmed"},{"first_name":"Suk Woo","full_name":"Kang, Suk Woo","last_name":"Kang"},{"full_name":"Mackie, Emily R.R.","first_name":"Emily R.R.","last_name":"Mackie"},{"full_name":"Bracho Granado, Gustavo","first_name":"Gustavo","last_name":"Bracho Granado"},{"last_name":"Soares Da Costa","first_name":"Tatiana P.","full_name":"Soares Da Costa, Tatiana P."},{"last_name":"Jackson","first_name":"Colin J.","full_name":"Jackson, Colin J."},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","last_name":"Janovjak","full_name":"Janovjak, Harald L","first_name":"Harald L","orcid":"0000-0002-8023-9315"}],"department":[{"_id":"CaGu"}],"abstract":[{"text":"Protein-protein interactions (PPIs) mediate many fundamental cellular processes. Control of PPIs through optically or chemically responsive protein domains has had a profound impact on basic research and some clinical applications. Most chemogenetic methods induce the association, i.e., dimerization or oligomerization, of target proteins, whilst the few available dissociation approaches either break large oligomeric protein clusters or heteromeric complexes. Here, we have exploited the controlled dissociation of a homodimeric oxidoreductase from mycobacteria (MSMEG_2027) by its native cofactor, F420, which is not present in mammals, as a bioorthogonal monomerization switch. Using X-ray crystallography, we found that in the absence of F420 MSMEG_2027 forms a unique domain-swapped dimer that occludes the cofactor binding site. Rearrangement of the N-terminal helix upon F420 binding results in the dissolution of the dimer. We then showed that MSMEG_2027 can be fused to proteins of interest in human cells and applied it as a tool to induce and release MAPK/ERK signalling downstream of a chimeric fibroblast growth factor receptor 1 (FGFR1) tyrosine kinase. This F420-dependent chemogenetic de-homodimerization tool is stoichiometric and based on a single domain and thus represents a novel mechanism to investigate protein complexes in situ.","lang":"eng"}],"month":"09","publication":"Journal of Molecular Biology","scopus_import":"1","file_date_updated":"2025-12-30T08:18:07Z","year":"2025","_id":"19725","OA_place":"publisher","title":"A F420-dependent single domain chemogenetic tool for protein de-dimerization","publication_identifier":{"issn":["0022-2836"],"eissn":["1089-8638"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","issue":"17","PlanS_conform":"1","oa_version":"Published Version","doi":"10.1016/j.jmb.2025.169184","date_published":"2025-09-01T00:00:00Z","intvolume":"       437","ddc":["570"],"project":[{"_id":"255A6082-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","call_identifier":"FWF","name":"Molecular Drug Targets"}],"acknowledgement":"We thank J. Kaczmarski for advice on isothermal titration calorimetry and helpful comments, and Alexandra Tichy, Elliot Gerrard and Rahkesh T Sabapathy for assistance with experiments. This study was supported by grants of the Australian Research Council (FT200100519 and DP200102093, to H.J.; DE190100806, DP220101901, FT230100203, and DP250102939 to T.P.S.D.C; DP200102093, CE200100029 and CE200100012 to C.J.J.), the National Health and Medical Research Council (APP1187638, to H.J.). S.K. was supported by the graduate program MolecularDrugTargets (Austrian Science Fund FWF W1232). The Australian Regenerative Medicine Institute is supported by grants from the State Government of Victoria and the Australian Government. The EMBL Australia Partnership Laboratory (EMBL Australia) is supported by the National Collaborative Research Infrastructure Strategy (NCRIS) of the Australian Government. T.P.S.D.C. acknowledges the University of Adelaide for a Future Making Fellowship. E.R.R.M acknowledges the Grains Research and Development Corporation (9176977) for support through a PhD scholarship and operational funding. J.A. and E.R.R.M. were supported by Australian Research Training Program scholarship. MicroMon of Monash University provided Sanger sequencing services. Imaging was performed in the CellScreen SA screening center of Flinders University. C.J.J. thanks the ARC Centre of Excellence for Innovations in Peptide and Protein Science and the ARC Centre of Excellence in Synthetic Biology. We thank the staff of the MX2 beamline at the Australian Synchrotron, part of ANSTO, which made use of the Australian Cancer Research Foundation (ACRF) detector.","publisher":"Elsevier","type":"journal_article","article_processing_charge":"Yes (in subscription journal)","volume":437,"date_created":"2025-05-25T22:16:39Z","has_accepted_license":"1","citation":{"chicago":"Antoney, James, Stephanie Kainrath, Joshua G. Dubowsky, F. Hafna Ahmed, Suk Woo Kang, Emily R.R. Mackie, Gustavo Bracho Granado, Tatiana P. Soares Da Costa, Colin J. Jackson, and Harald L Janovjak. “A F420-Dependent Single Domain Chemogenetic Tool for Protein de-Dimerization.” <i>Journal of Molecular Biology</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.jmb.2025.169184\">https://doi.org/10.1016/j.jmb.2025.169184</a>.","apa":"Antoney, J., Kainrath, S., Dubowsky, J. G., Ahmed, F. H., Kang, S. W., Mackie, E. R. R., … Janovjak, H. L. (2025). A F420-dependent single domain chemogenetic tool for protein de-dimerization. <i>Journal of Molecular Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jmb.2025.169184\">https://doi.org/10.1016/j.jmb.2025.169184</a>","mla":"Antoney, James, et al. “A F420-Dependent Single Domain Chemogenetic Tool for Protein de-Dimerization.” <i>Journal of Molecular Biology</i>, vol. 437, no. 17, 169184, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.jmb.2025.169184\">10.1016/j.jmb.2025.169184</a>.","ista":"Antoney J, Kainrath S, Dubowsky JG, Ahmed FH, Kang SW, Mackie ERR, Bracho Granado G, Soares Da Costa TP, Jackson CJ, Janovjak HL. 2025. A F420-dependent single domain chemogenetic tool for protein de-dimerization. Journal of Molecular Biology. 437(17), 169184.","ieee":"J. Antoney <i>et al.</i>, “A F420-dependent single domain chemogenetic tool for protein de-dimerization,” <i>Journal of Molecular Biology</i>, vol. 437, no. 17. Elsevier, 2025.","ama":"Antoney J, Kainrath S, Dubowsky JG, et al. A F420-dependent single domain chemogenetic tool for protein de-dimerization. <i>Journal of Molecular Biology</i>. 2025;437(17). doi:<a href=\"https://doi.org/10.1016/j.jmb.2025.169184\">10.1016/j.jmb.2025.169184</a>","short":"J. Antoney, S. Kainrath, J.G. Dubowsky, F.H. Ahmed, S.W. Kang, E.R.R. Mackie, G. Bracho Granado, T.P. Soares Da Costa, C.J. Jackson, H.L. Janovjak, Journal of Molecular Biology 437 (2025)."},"language":[{"iso":"eng"}],"publication_status":"published","pmid":1,"OA_type":"hybrid","article_number":"169184","external_id":{"pmid":["40324743"],"isi":["001494762800001"]},"oa":1,"isi":1},{"citation":{"apa":"Mejia-Centeno, K. V., Montaña-Mora, G., Chacón-Borrero, J., Xue, Q., Gong, L., Martí-Sánchez, S., … Cabot, A. (2025). Glucose electrooxidation with simultaneous H2 production on nickel-zinc electrocatalysts derived from an ethylenediamine-functionalized zeolitic imidazole framework. <i>Chemical Engineering Journal</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.cej.2025.163491\">https://doi.org/10.1016/j.cej.2025.163491</a>","chicago":"Mejia-Centeno, Karol V., Guillem Montaña-Mora, Jesús Chacón-Borrero, Qian Xue, Li Gong, Sara Martí-Sánchez, Armando Berlanga-Vázquez, et al. “Glucose Electrooxidation with Simultaneous H2 Production on Nickel-Zinc Electrocatalysts Derived from an Ethylenediamine-Functionalized Zeolitic Imidazole Framework.” <i>Chemical Engineering Journal</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.cej.2025.163491\">https://doi.org/10.1016/j.cej.2025.163491</a>.","mla":"Mejia-Centeno, Karol V., et al. “Glucose Electrooxidation with Simultaneous H2 Production on Nickel-Zinc Electrocatalysts Derived from an Ethylenediamine-Functionalized Zeolitic Imidazole Framework.” <i>Chemical Engineering Journal</i>, vol. 515, 163491, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.cej.2025.163491\">10.1016/j.cej.2025.163491</a>.","ista":"Mejia-Centeno KV, Montaña-Mora G, Chacón-Borrero J, Xue Q, Gong L, Martí-Sánchez S, Berlanga-Vázquez A, Llorca J, Ibáñez M, Arbiol J, Qi X, Martinez-Alanis PR, Cabot A. 2025. Glucose electrooxidation with simultaneous H2 production on nickel-zinc electrocatalysts derived from an ethylenediamine-functionalized zeolitic imidazole framework. Chemical Engineering Journal. 515, 163491.","ama":"Mejia-Centeno KV, Montaña-Mora G, Chacón-Borrero J, et al. Glucose electrooxidation with simultaneous H2 production on nickel-zinc electrocatalysts derived from an ethylenediamine-functionalized zeolitic imidazole framework. <i>Chemical Engineering Journal</i>. 2025;515. doi:<a href=\"https://doi.org/10.1016/j.cej.2025.163491\">10.1016/j.cej.2025.163491</a>","short":"K.V. Mejia-Centeno, G. Montaña-Mora, J. Chacón-Borrero, Q. Xue, L. Gong, S. Martí-Sánchez, A. Berlanga-Vázquez, J. Llorca, M. Ibáñez, J. Arbiol, X. Qi, P.R. Martinez-Alanis, A. Cabot, Chemical Engineering Journal 515 (2025).","ieee":"K. V. Mejia-Centeno <i>et al.</i>, “Glucose electrooxidation with simultaneous H2 production on nickel-zinc electrocatalysts derived from an ethylenediamine-functionalized zeolitic imidazole framework,” <i>Chemical Engineering Journal</i>, vol. 515. Elsevier, 2025."},"publication_status":"published","language":[{"iso":"eng"}],"OA_type":"closed access","external_id":{"isi":["001501928300003"]},"article_number":"163491","isi":1,"intvolume":"       515","type":"journal_article","publisher":"Elsevier","article_processing_charge":"No","volume":515,"acknowledgement":"This work was financially supported by the SyDECat and AmaDE projects from the Spanish MCIN/AEI/FEDER (PID2022-136883OB-C22 & PID2023-149158OB-C43). The authors acknowledge funding from Generalitat de Catalunya 2021SGR01581, 2021SGR00457 and European Union Next Generation EU/PRTR. KVMC acknowledges the grant from Call 906 of 2021 for Doctorates Abroad from the Ministry of Science, Technology, and Innovation of Colombia. PRMA acknowledges support from the Ramón y Cajal grant RYC2023-042982-I, funded by MICIU/AEI (10.13039/501100011033) and co-financed by FSE+. This study is part of the Advanced Materials programme and was supported by MCIN with funding from European Union NextGenerationEU (PRTR-C17.I1) and by Generalitat de Catalunya (In-CAEM Project). ICN2 is supported by the Severo Ochoa program from Spanish MCIN / AEI (Grant No.: CEX2021-001214-S) and is funded by the CERCA Programme / Generalitat de Catalunya. ICN2 is founding member of e-DREAM. [76] J.L. is a Serra Húnter Fellow and is grateful to the ICREA Academia program and to projects PID2021-124572OB-C31 and CEX2023-001300-M funded by MCIN/AEI/10.13039/501100011033, EU and FEDER, and to the GC 2021 SGR 01061 grant.","date_created":"2025-05-25T22:16:40Z","title":"Glucose electrooxidation with simultaneous H2 production on nickel-zinc electrocatalysts derived from an ethylenediamine-functionalized zeolitic imidazole framework","publication_identifier":{"issn":["1385-8947"]},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa_version":"None","date_published":"2025-07-01T00:00:00Z","doi":"10.1016/j.cej.2025.163491","date_updated":"2025-12-30T08:28:59Z","author":[{"last_name":"Mejia-Centeno","full_name":"Mejia-Centeno, Karol V.","first_name":"Karol V."},{"first_name":"Guillem","full_name":"Montaña-Mora, Guillem","last_name":"Montaña-Mora"},{"last_name":"Chacón-Borrero","full_name":"Chacón-Borrero, Jesús","first_name":"Jesús"},{"last_name":"Xue","first_name":"Qian","full_name":"Xue, Qian"},{"last_name":"Gong","full_name":"Gong, Li","first_name":"Li"},{"first_name":"Sara","full_name":"Martí-Sánchez, Sara","last_name":"Martí-Sánchez"},{"last_name":"Berlanga-Vázquez","full_name":"Berlanga-Vázquez, Armando","first_name":"Armando"},{"first_name":"Jordi","full_name":"Llorca, Jordi","last_name":"Llorca"},{"last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Arbiol","first_name":"Jordi","full_name":"Arbiol, Jordi"},{"last_name":"Qi","full_name":"Qi, Xueqiang","first_name":"Xueqiang"},{"first_name":"Paulina R.","full_name":"Martinez-Alanis, Paulina R.","last_name":"Martinez-Alanis"},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"article_type":"original","quality_controlled":"1","department":[{"_id":"MaIb"}],"month":"07","publication":"Chemical Engineering Journal","abstract":[{"lang":"eng","text":"The oxidation of biomass-derived compounds such as glucose within electrochemical cells enables both the energy-efficient production of hydrogen and the generation of additional added-value chemicals from biomass. However, for this biomass valorization approach to become commercially viable, selective, cost-effective, and highly active electrooxidation catalysts need to be developed. In this work, we detail the synthesis of a nickel (Ni) and zinc (Zn)-based electrocatalyst for the glucose oxidation reaction (GOR) to formic acid (FoA) via calcination of a Zn-based zeolitic imidazole framework (ZIF) functionalized with ethylenediamine and doped with Ni. The structure, morphology, and electrochemical performance of the catalysts towards the anodic GOR to FoA coupled with the cathodic hydrogen evolution reaction (HER) are subsequently studied. Chronopotentiometry tests with 0.1 M of glucose show a conversion of 94 % at 250 mA in only 70 min, with a Faradaic efficiency (FE) of 91 % toward the production of FoA. Meanwhile, at the cathode, the HER FE is close to 98 %."}],"year":"2025","scopus_import":"1","_id":"19726"},{"ddc":["510"],"project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"intvolume":"       475","volume":475,"ec_funded":1,"type":"journal_article","publisher":"Elsevier","article_processing_charge":"Yes (via OA deal)","acknowledgement":"I thank Yuri Tschinkel for introducing me to the beautiful paper [53] and associated open questions, and thank him as well as Ramin Takloo-Bighash and Sho Tanimoto for their encouragement and comments. Also, I thank Tim Browning and Dan Loughran for comments and suggestions concerning Manin–Peyre, homogeneous spaces, and splitness. Thanks also to Anshul Adve, Peter Sarnak, Philip Tosteson, Katy Woo, and Nina Zubrilina for some interesting discussions. I thank the Browning Group and Andy O'Desky for many conversations. This project has received funding from the European Union's Horizon 2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement No. 101034413. Finally, I thank the editors and referees for their detailed input, which substantially improved the paper.","has_accepted_license":"1","date_created":"2025-05-25T22:16:41Z","arxiv":1,"citation":{"chicago":"Wang, Victor. “Asymptotic Growth of Translation-Dilation Orbits.” <i>Advances in Mathematics</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.aim.2025.110341\">https://doi.org/10.1016/j.aim.2025.110341</a>.","apa":"Wang, V. (2025). Asymptotic growth of translation-dilation orbits. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2025.110341\">https://doi.org/10.1016/j.aim.2025.110341</a>","mla":"Wang, Victor. “Asymptotic Growth of Translation-Dilation Orbits.” <i>Advances in Mathematics</i>, vol. 475, 110341, Elsevier, 2025, doi:<a href=\"https://doi.org/10.1016/j.aim.2025.110341\">10.1016/j.aim.2025.110341</a>.","ista":"Wang V. 2025. Asymptotic growth of translation-dilation orbits. Advances in Mathematics. 475, 110341.","ama":"Wang V. Asymptotic growth of translation-dilation orbits. <i>Advances in Mathematics</i>. 2025;475. doi:<a href=\"https://doi.org/10.1016/j.aim.2025.110341\">10.1016/j.aim.2025.110341</a>","short":"V. Wang, Advances in Mathematics 475 (2025).","ieee":"V. Wang, “Asymptotic growth of translation-dilation orbits,” <i>Advances in Mathematics</i>, vol. 475. Elsevier, 2025."},"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"hybrid","isi":1,"oa":1,"external_id":{"arxiv":["2309.07626"],"isi":["001495142300002"]},"article_number":"110341","author":[{"id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9","orcid":"0000-0002-0704-7026","last_name":"Wang","full_name":"Wang, Victor","first_name":"Victor"}],"article_type":"original","file":[{"date_updated":"2025-12-30T08:30:17Z","access_level":"open_access","file_name":"2025_AdvMathematics_Wang.pdf","file_size":1592341,"file_id":"20895","content_type":"application/pdf","creator":"dernst","date_created":"2025-12-30T08:30:17Z","relation":"main_file","checksum":"01f2589b678ba840d6a4066c1d8d7642","success":1}],"quality_controlled":"1","date_updated":"2025-12-30T08:30:30Z","corr_author":"1","month":"07","publication":"Advances in Mathematics","abstract":[{"text":"By studying some Clausen-like multiple Dirichlet series, we complete the proof of Manin's conjecture for sufficiently split smooth equivariant compactifications of the translation-dilation group over the rationals. Secondary terms remain elusive in general.","lang":"eng"}],"department":[{"_id":"TiBr"}],"OA_place":"publisher","_id":"19727","year":"2025","file_date_updated":"2025-12-30T08:30:17Z","scopus_import":"1","publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"title":"Asymptotic growth of translation-dilation orbits","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"PlanS_conform":"1","day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-07-01T00:00:00Z","doi":"10.1016/j.aim.2025.110341","oa_version":"Published Version"},{"status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"16","doi":"10.1017/jfm.2025.362","date_published":"2025-05-16T00:00:00Z","oa_version":"Published Version","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"title":"Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"abstract":[{"lang":"eng","text":"From anthropogenic litter carried by ocean currents to plant stems travelling through the atmosphere, geophysical flows are often seeded with elongated, fibre-like particles. In this study, we used a large-scale laboratory model of a tidal current – representative of a widespread class of geophysical flows – to investigate the tumbling motion of long, slender and floating fibres in the complex turbulence generated by flow interactions with a tidal inlet. Despite the non-stationary, non-homogeneous and anisotropic nature of this turbulence, we find that long fibres statistically rotate at the same frequency as eddies of similar size, a phenomenon called scale selection, which is known to occur in ideal turbulence. Furthermore, we report that the signal of the instantaneous transverse velocity difference between the fibre ends changes significantly from the signal produced by the flow in the fibre surroundings, although the two are statistically equivalent. These observations have twofold implications. On the one hand, they confirm the reliability of using the end-to-end velocity signal of rigid fibres to probe the two-point transverse statistics of the flow, even under realistic conditions: oceanographers could exploit this observation to measure transverse velocity differences through elongated floats in the field, where superdiffusion complicates collecting sufficient data to probe two-point turbulence statistics at a fixed separation effectively. On the other hand, by addressing the dynamics of inertial range particles floating in the coastal zone, these observations are crucial to improving our ability to predict the fate of meso- and macro-litter, a size class that is currently understudied."}],"publication":"Journal of Fluid Mechanics","month":"05","department":[{"_id":"BjHo"}],"OA_place":"publisher","_id":"19729","scopus_import":"1","file_date_updated":"2025-05-28T08:12:07Z","year":"2025","article_type":"original","file":[{"file_name":"2025_JourFluidMech_DeLeo.pdf","access_level":"open_access","date_updated":"2025-05-28T08:12:07Z","success":1,"checksum":"f1b0f6a977fdf2d6eb9e16c11d030c0c","relation":"main_file","date_created":"2025-05-28T08:12:07Z","creator":"dernst","file_id":"19751","content_type":"application/pdf","file_size":6415303}],"quality_controlled":"1","author":[{"full_name":"De Leo, Annalisa","first_name":"Annalisa","last_name":"De Leo"},{"last_name":"Brizzolara","full_name":"Brizzolara, Stefano","first_name":"Stefano","id":"4bbe33b8-c59a-11ee-a1af-fa33d1ac42c4"},{"first_name":"Mattia","full_name":"Cavaiola, Mattia","last_name":"Cavaiola"},{"last_name":"He","full_name":"He, Junlin","first_name":"Junlin"},{"first_name":"Alessandro","full_name":"Stocchino, Alessandro","last_name":"Stocchino"}],"date_updated":"2025-09-30T12:38:34Z","OA_type":"hybrid","isi":1,"article_number":"A5","external_id":{"isi":["001489159700001"]},"oa":1,"citation":{"apa":"De Leo, A., Brizzolara, S., Cavaiola, M., He, J., &#38; Stocchino, A. (2025). Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2025.362\">https://doi.org/10.1017/jfm.2025.362</a>","mla":"De Leo, Annalisa, et al. “Rigid Fibre Transport in a Periodic Non-Homogeneous Geophysical Turbulent Flow.” <i>Journal of Fluid Mechanics</i>, vol. 1011, A5, Cambridge University Press, 2025, doi:<a href=\"https://doi.org/10.1017/jfm.2025.362\">10.1017/jfm.2025.362</a>.","chicago":"De Leo, Annalisa, Stefano Brizzolara, Mattia Cavaiola, Junlin He, and Alessandro Stocchino. “Rigid Fibre Transport in a Periodic Non-Homogeneous Geophysical Turbulent Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/jfm.2025.362\">https://doi.org/10.1017/jfm.2025.362</a>.","ista":"De Leo A, Brizzolara S, Cavaiola M, He J, Stocchino A. 2025. Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow. Journal of Fluid Mechanics. 1011, A5.","ieee":"A. De Leo, S. Brizzolara, M. Cavaiola, J. He, and A. Stocchino, “Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow,” <i>Journal of Fluid Mechanics</i>, vol. 1011. Cambridge University Press, 2025.","ama":"De Leo A, Brizzolara S, Cavaiola M, He J, Stocchino A. Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow. <i>Journal of Fluid Mechanics</i>. 2025;1011. doi:<a href=\"https://doi.org/10.1017/jfm.2025.362\">10.1017/jfm.2025.362</a>","short":"A. De Leo, S. Brizzolara, M. Cavaiola, J. He, A. Stocchino, Journal of Fluid Mechanics 1011 (2025)."},"language":[{"iso":"eng"}],"publication_status":"published","acknowledgement":"A.S. expresses thanks for support from the Research Grants Council of Hong Kong (project IDs 15216422 and C5032-22EF) and from the Research Institute for Land and Space (RILS) (project ID P0049622). S.B. is funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement (no.101034413).","volume":1011,"ec_funded":1,"type":"journal_article","publisher":"Cambridge University Press","article_processing_charge":"No","has_accepted_license":"1","date_created":"2025-05-25T22:16:46Z","intvolume":"      1011","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020"}],"ddc":["530"]},{"oa_version":"Published Version","date_published":"2025-05-14T00:00:00Z","doi":"10.1017/jfm.2025.278","day":"14","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Feigenbaum universality in subcritical Taylor-Couette flow","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"year":"2025","scopus_import":"1","file_date_updated":"2025-05-28T08:32:33Z","_id":"19730","OA_place":"publisher","department":[{"_id":"BjHo"}],"publication":"Journal of Fluid Mechanics","month":"05","abstract":[{"lang":"eng","text":"Feigenbaum universality is shown to occur in subcritical shear flows. Our testing ground is the counter-rotation regime of the Taylor–Couette flow, where numerical calculations are performed within a small periodic domain. The accurate computation of up to the seventh period-doubling bifurcation, assisted by a purposely defined Poincaré section, has enabled us to reproduce the two Feigenbaum universal constants with unprecedented accuracy in a fluid flow problem. We have further devised a method to predict the bifurcation diagram up to the accumulation point of the cascade based on the detailed inspection of just the first few period-doubling bifurcations. Remarkably, the method is applicable beyond the accumulation point, with predictions remaining valid, in a statistical sense, for the chaotic dynamics that follows."}],"date_updated":"2025-09-30T12:39:05Z","author":[{"orcid":"0000-0002-6229-0336","last_name":"Wang","first_name":"Baoying","full_name":"Wang, Baoying","id":"df755ffe-735a-11ee-bb55-dff29d61d338"},{"id":"ab77522d-073b-11ed-8aff-e71b39258362","orcid":"0000-0001-6572-0621","last_name":"Ayats López","first_name":"Roger","full_name":"Ayats López, Roger"},{"last_name":"Deguchi","full_name":"Deguchi, K.","first_name":"K."},{"first_name":"A.","full_name":"Meseguer, A.","last_name":"Meseguer"},{"last_name":"Mellibovsky","full_name":"Mellibovsky, F.","first_name":"F."}],"file":[{"file_name":"2025_JourFluidMech_Wang.pdf","access_level":"open_access","date_updated":"2025-05-28T08:32:33Z","success":1,"checksum":"77f39b762a0e59e88954afb93b23cc7a","date_created":"2025-05-28T08:32:33Z","relation":"main_file","content_type":"application/pdf","file_id":"19752","creator":"dernst","file_size":3607069}],"quality_controlled":"1","article_type":"original","external_id":{"isi":["001487354900001"]},"oa":1,"article_number":"A36","isi":1,"OA_type":"hybrid","publication_status":"published","language":[{"iso":"eng"}],"citation":{"ama":"Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. Feigenbaum universality in subcritical Taylor-Couette flow. <i>Journal of Fluid Mechanics</i>. 2025;1010. doi:<a href=\"https://doi.org/10.1017/jfm.2025.278\">10.1017/jfm.2025.278</a>","short":"B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, F. Mellibovsky, Journal of Fluid Mechanics 1010 (2025).","ieee":"B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky, “Feigenbaum universality in subcritical Taylor-Couette flow,” <i>Journal of Fluid Mechanics</i>, vol. 1010. Cambridge University Press, 2025.","chicago":"Wang, Baoying, Roger Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky. “Feigenbaum Universality in Subcritical Taylor-Couette Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/jfm.2025.278\">https://doi.org/10.1017/jfm.2025.278</a>.","apa":"Wang, B., Ayats López, R., Deguchi, K., Meseguer, A., &#38; Mellibovsky, F. (2025). Feigenbaum universality in subcritical Taylor-Couette flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2025.278\">https://doi.org/10.1017/jfm.2025.278</a>","mla":"Wang, Baoying, et al. “Feigenbaum Universality in Subcritical Taylor-Couette Flow.” <i>Journal of Fluid Mechanics</i>, vol. 1010, A36, Cambridge University Press, 2025, doi:<a href=\"https://doi.org/10.1017/jfm.2025.278\">10.1017/jfm.2025.278</a>.","ista":"Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. 2025. Feigenbaum universality in subcritical Taylor-Couette flow. Journal of Fluid Mechanics. 1010, A36."},"date_created":"2025-05-25T22:16:48Z","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","publisher":"Cambridge University Press","volume":1010,"ec_funded":1,"type":"journal_article","acknowledgement":"This research is supported by the Australian Research Council Discovery Project DP230102188 and the Ministerio de Ciencia, Innovación y Universidades (Agencia Estatal de Investigación, project nos. PID 2020–114043 GB-I00 (MCIN/AEI/10.13039/501100011033) and PID 2023–150029NB-I00 (MCIN/AEI/10.13039/501100011033/FEDER, UE). B.W.’s and R.A.’s research has been funded by the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie Grant Agreement No. 101034413). R.A. has also been funded by the Austrian Science Fund (FWF) 10.55776/ESP1481224.","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"},{"grant_number":"ESP 1481224","name":"Pattern Formation Mechanisms in Planar Shear Flows","_id":"942a0200-16d5-11f0-9cad-f48ab22dfd1c"}],"ddc":["530"],"intvolume":"      1010"},{"corr_author":"1","quality_controlled":"1","file":[{"date_updated":"2025-05-28T08:48:38Z","access_level":"open_access","file_name":"2025_ACSMaterialsAu_Rayaroth.pdf","file_size":1750018,"file_id":"19753","content_type":"application/pdf","creator":"dernst","relation":"main_file","date_created":"2025-05-28T08:48:38Z","checksum":"a3aa15e4022fa359d6ba5afb96268841","success":1}],"article_type":"editorial","author":[{"id":"8aceb01b-8972-11ed-ae7b-d5fe53775add","full_name":"Rayaroth Puthiyaveettil, Aiswarya","first_name":"Aiswarya","last_name":"Rayaroth Puthiyaveettil"},{"id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","full_name":"Fiedler, Christine","first_name":"Christine","last_name":"Fiedler"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria","first_name":"Maria"}],"date_updated":"2025-06-11T13:23:01Z","_id":"19731","OA_place":"publisher","file_date_updated":"2025-05-28T08:48:38Z","scopus_import":"1","year":"2025","abstract":[{"text":"In an era of high-resolution displays, powerful design software, and automated plotting tools, one would think that scientific figures would be clearer than ever. Yet, despite numerous editorials, guidelines, and workshops dedicated to improving figure design, poorly constructed figures remain a persistent issue. Editors and experienced researchers have repeatedly highlighted key pitfalls such as cluttered layouts, inconsistent formatting, poor color choices, and misleading visuals. (1−8) Yet, the aforementioned graphical shortcomings continue to plague even high-impact journals. Why? The problem is not a lack of technology; it is a combination of poor design habits, rushed deadlines, and a tendency to treat figures as mere “data dumps” rather than as essential storytelling tools.\r\nMany people process information more effectively through visuals, naturally associating concepts easily when presented graphically. A well-crafted figure serves as a narrative within the larger story, making complex ideas more accessible. Unfortunately, visual storytelling often takes a backseat in scientific communication. Scientists are trained to analyze and interpret data, but many default to software-generated plots without considering accessibility or how their figures will be perceived by readers outside their immediate field. Without thoughtful design, figures lose their power to enhance understanding, ultimately limiting the significance of the research itself.\r\nIn this editorial, we examine the challenges that, in our view, hamper scientific figure design and discuss how thoughtful refinements driven by feedback, iteration, and design principles can enhance clarity and impact visual communication.","lang":"eng"}],"publication":"ACS Materials Au","month":"05","department":[{"_id":"MaIb"}],"tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","image":"/images/cc_by_nc_nd.png","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode"},"DOAJ_listed":"1","publication_identifier":{"eissn":["2694-2461"]},"title":"Let us FIGURE it out: Why do scientists still make “bad” figures?","doi":"10.1021/acsmaterialsau.5c00037","date_published":"2025-05-14T00:00:00Z","oa_version":"Published Version","issue":"3","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"14","intvolume":"         5","ddc":["540"],"has_accepted_license":"1","date_created":"2025-05-25T22:16:51Z","volume":5,"publisher":"American Chemical Society","article_processing_charge":"Yes","type":"journal_article","language":[{"iso":"eng"}],"publication_status":"published","pmid":1,"citation":{"ieee":"A. Rayaroth Puthiyaveettil, C. Fiedler, and M. Ibáñez, “Let us FIGURE it out: Why do scientists still make ‘bad’ figures?,” <i>ACS Materials Au</i>, vol. 5, no. 3. American Chemical Society, pp. 438–440, 2025.","ama":"Rayaroth Puthiyaveettil A, Fiedler C, Ibáñez M. Let us FIGURE it out: Why do scientists still make “bad” figures? <i>ACS Materials Au</i>. 2025;5(3):438-440. doi:<a href=\"https://doi.org/10.1021/acsmaterialsau.5c00037\">10.1021/acsmaterialsau.5c00037</a>","short":"A. Rayaroth Puthiyaveettil, C. Fiedler, M. Ibáñez, ACS Materials Au 5 (2025) 438–440.","apa":"Rayaroth Puthiyaveettil, A., Fiedler, C., &#38; Ibáñez, M. (2025). Let us FIGURE it out: Why do scientists still make “bad” figures? <i>ACS Materials Au</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acsmaterialsau.5c00037\">https://doi.org/10.1021/acsmaterialsau.5c00037</a>","mla":"Rayaroth Puthiyaveettil, Aiswarya, et al. “Let Us FIGURE It out: Why Do Scientists Still Make ‘Bad’ Figures?” <i>ACS Materials Au</i>, vol. 5, no. 3, American Chemical Society, 2025, pp. 438–40, doi:<a href=\"https://doi.org/10.1021/acsmaterialsau.5c00037\">10.1021/acsmaterialsau.5c00037</a>.","chicago":"Rayaroth Puthiyaveettil, Aiswarya, Christine Fiedler, and Maria Ibáñez. “Let Us FIGURE It out: Why Do Scientists Still Make ‘Bad’ Figures?” <i>ACS Materials Au</i>. American Chemical Society, 2025. <a href=\"https://doi.org/10.1021/acsmaterialsau.5c00037\">https://doi.org/10.1021/acsmaterialsau.5c00037</a>.","ista":"Rayaroth Puthiyaveettil A, Fiedler C, Ibáñez M. 2025. Let us FIGURE it out: Why do scientists still make “bad” figures? ACS Materials Au. 5(3), 438–440."},"oa":1,"external_id":{"pmid":["40385955"]},"page":"438-440","OA_type":"gold"},{"year":"2025","scopus_import":"1","file_date_updated":"2025-05-28T09:00:52Z","OA_place":"publisher","_id":"19732","department":[{"_id":"BjHo"}],"month":"05","publication":"Journal of Fluid Mechanics","abstract":[{"text":"The transition to chaos in the subcritical regime of counter-rotating Taylor–Couette flow is investigated using a minimal periodic domain capable of sustaining coherent structures. Following a Feigenbaum cascade, the dynamics is found to be remarkably well approximated by a simple discrete map that admits rigorous proof of its chaotic nature. The chaotic set that arises for the map features densely distributed periodic points that are in one-to-one correspondence with unstable periodic orbits (UPOs) of the Navier–Stokes system. This supports the increasingly accepted view that UPOs may serve as the backbone of turbulence and, indeed, we demonstrate that it is possible to reconstruct every statistical property of chaotic fluid flow from UPOs.","lang":"eng"}],"date_updated":"2025-09-30T12:39:44Z","author":[{"orcid":"0000-0002-6229-0336","first_name":"Baoying","full_name":"Wang, Baoying","last_name":"Wang","id":"df755ffe-735a-11ee-bb55-dff29d61d338"},{"orcid":"0000-0001-6572-0621","full_name":"Ayats López, Roger","first_name":"Roger","last_name":"Ayats López","id":"ab77522d-073b-11ed-8aff-e71b39258362"},{"full_name":"Deguchi, K.","first_name":"K.","last_name":"Deguchi"},{"first_name":"A.","full_name":"Meseguer, A.","last_name":"Meseguer"},{"full_name":"Mellibovsky, F.","first_name":"F.","last_name":"Mellibovsky"}],"file":[{"file_name":"2025_JourFluidMech_Wang_Ayats.pdf","date_updated":"2025-05-28T09:00:52Z","access_level":"open_access","relation":"main_file","date_created":"2025-05-28T09:00:52Z","checksum":"899df5797844a9e811dffeebe8c05c8e","success":1,"file_size":998754,"content_type":"application/pdf","file_id":"19754","creator":"dernst"}],"article_type":"original","quality_controlled":"1","oa_version":"Published Version","date_published":"2025-05-13T00:00:00Z","doi":"10.1017/jfm.2025.151","day":"13","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"date_created":"2025-05-25T22:16:52Z","has_accepted_license":"1","article_processing_charge":"Yes (in subscription journal)","volume":1011,"ec_funded":1,"publisher":"Cambridge University Press","type":"journal_article","acknowledgement":"This research is supported by the Australian Research Council Discovery Project DP230102188 and the Ministerio de Ciencia, Innovación y Universidades (Agencia Estatal de Investigación, project nos PID 2020-114043 GB-I00 (MCIN/AEI/10.13039/501100011033) and PID 2023-150029NB-I00 (MCIN/AEI/10.13039/ 501100011033/FEDER, UE). B.W. and R.A.’s research has been funded by the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie grant agreement no. 101034413). R.A. has also been funded by the Austrian Science Fund (FWF) 10.55776/ESP1481224.","ddc":["530"],"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program"},{"_id":"942a0200-16d5-11f0-9cad-f48ab22dfd1c","grant_number":"ESP 1481224","name":"Pattern Formation Mechanisms in Planar Shear Flows"}],"intvolume":"      1011","external_id":{"isi":["001486096600001"]},"oa":1,"article_number":"R2","isi":1,"OA_type":"hybrid","language":[{"iso":"eng"}],"publication_status":"published","citation":{"short":"B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, F. Mellibovsky, Journal of Fluid Mechanics 1011 (2025).","ama":"Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow. <i>Journal of Fluid Mechanics</i>. 2025;1011. doi:<a href=\"https://doi.org/10.1017/jfm.2025.151\">10.1017/jfm.2025.151</a>","ieee":"B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky, “Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow,” <i>Journal of Fluid Mechanics</i>, vol. 1011. Cambridge University Press, 2025.","ista":"Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. 2025. Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow. Journal of Fluid Mechanics. 1011, R2.","mla":"Wang, Baoying, et al. “Mathematically Established Chaos and Forecast of Statistics with Recurrent Patterns in Taylor-Couette Flow.” <i>Journal of Fluid Mechanics</i>, vol. 1011, R2, Cambridge University Press, 2025, doi:<a href=\"https://doi.org/10.1017/jfm.2025.151\">10.1017/jfm.2025.151</a>.","apa":"Wang, B., Ayats López, R., Deguchi, K., Meseguer, A., &#38; Mellibovsky, F. (2025). Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2025.151\">https://doi.org/10.1017/jfm.2025.151</a>","chicago":"Wang, Baoying, Roger Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky. “Mathematically Established Chaos and Forecast of Statistics with Recurrent Patterns in Taylor-Couette Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2025. <a href=\"https://doi.org/10.1017/jfm.2025.151\">https://doi.org/10.1017/jfm.2025.151</a>."}},{"language":[{"iso":"eng"}],"publication_status":"published","arxiv":1,"citation":{"ista":"Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. 2025. Direct and efficient detection of quantum superposition. Physical Review A. 111(5), L050402.","apa":"Kun, D., Strömberg, K. T., Spagnolo, M., Dakić, B., Rozema, L. A., &#38; Walther, P. (2025). Direct and efficient detection of quantum superposition. <i>Physical Review A</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.111.L050402\">https://doi.org/10.1103/PhysRevA.111.L050402</a>","mla":"Kun, Daniel, et al. “Direct and Efficient Detection of Quantum Superposition.” <i>Physical Review A</i>, vol. 111, no. 5, L050402, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/PhysRevA.111.L050402\">10.1103/PhysRevA.111.L050402</a>.","chicago":"Kun, Daniel, Karl T Strömberg, Michele Spagnolo, Borivoje Dakić, Lee A. Rozema, and Philip Walther. “Direct and Efficient Detection of Quantum Superposition.” <i>Physical Review A</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/PhysRevA.111.L050402\">https://doi.org/10.1103/PhysRevA.111.L050402</a>.","ieee":"D. Kun, K. T. Strömberg, M. Spagnolo, B. Dakić, L. A. Rozema, and P. Walther, “Direct and efficient detection of quantum superposition,” <i>Physical Review A</i>, vol. 111, no. 5. American Physical Society, 2025.","short":"D. Kun, K.T. Strömberg, M. Spagnolo, B. Dakić, L.A. Rozema, P. Walther, Physical Review A 111 (2025).","ama":"Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. Direct and efficient detection of quantum superposition. <i>Physical Review A</i>. 2025;111(5). doi:<a href=\"https://doi.org/10.1103/PhysRevA.111.L050402\">10.1103/PhysRevA.111.L050402</a>"},"isi":1,"article_number":"L050402","external_id":{"isi":["001501941500006"],"arxiv":["2405.08065"]},"oa":1,"OA_type":"hybrid","intvolume":"       111","ddc":["530"],"date_created":"2025-05-25T22:16:54Z","has_accepted_license":"1","acknowledgement":"This project has received funding from the European Union's Horizon 2020 and Horizon Europe research and innovation programmes under Grant Agreements No. 899368 (EPIQUS) and No. 101135288 (EPIQUE), the Marie Skłodowska-Curie Grant Agreement No. 956071 (AppQInfo), and the QuantERA II Programme under Grant Agreement No. 101017733 (PhoMemtor). The financial support by the Austrian Federal Ministry of Labour and Economy, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged. L.A.R. acknowledges support from the Erwin Schrödinger Center for Quantum Science & Technology (ESQ Discovery). This research was funded in whole or in part from the Austrian Science Fund (FWF) through [Grant No. 10.55776/COE1] (Quantum Science Austria), [Grant No. 10.55776/F71] (BeyondC), [Grant No. 10.55776/FG5] (Research Group 5), [Grant No. 10.55776/I6002] (PhoMemtor), and [Grant No. 10.55776/P36994] (Quantum Interference).","type":"journal_article","publisher":"American Physical Society","article_processing_charge":"No","volume":111,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_identifier":{"issn":["2469-9926"],"eissn":["2469-9934"]},"title":"Direct and efficient detection of quantum superposition","doi":"10.1103/PhysRevA.111.L050402","date_published":"2025-05-16T00:00:00Z","oa_version":"Published Version","issue":"5","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"16","file":[{"success":1,"relation":"main_file","date_created":"2025-05-28T09:16:03Z","checksum":"b83295a8f597b7781d8e7bfa3b393b42","file_size":571784,"content_type":"application/pdf","creator":"dernst","file_id":"19755","file_name":"2025_PhysReviewA_Kun.pdf","access_level":"open_access","date_updated":"2025-05-28T09:16:03Z"}],"article_type":"letter_note","quality_controlled":"1","author":[{"full_name":"Kun, Daniel","first_name":"Daniel","last_name":"Kun"},{"id":"68011cd2-da32-11ee-a930-b2774c7aba5f","last_name":"Strömberg","first_name":"Karl T","full_name":"Strömberg, Karl T"},{"first_name":"Michele","full_name":"Spagnolo, Michele","last_name":"Spagnolo"},{"last_name":"Dakić","full_name":"Dakić, Borivoje","first_name":"Borivoje"},{"last_name":"Rozema","first_name":"Lee A.","full_name":"Rozema, Lee A."},{"last_name":"Walther","first_name":"Philip","full_name":"Walther, Philip"}],"date_updated":"2025-09-30T12:40:18Z","_id":"19733","OA_place":"publisher","scopus_import":"1","file_date_updated":"2025-05-28T09:16:03Z","year":"2025","abstract":[{"lang":"eng","text":"One of the most striking quantum phenomena is superposition, where one particle simultaneously inhabits different states. Most methods to verify coherent superposition are indirect, in that they require the distinct states to be recombined. Here, we adapt an xor game, in which a “test” photon is placed in a superposition of two orthogonal spatial modes, and each mode is sent to separated parties who perform local measurements on their modes without reinterfering the original modes. We show that by using a second identical “measurement” photon the parties are nonetheless able to verify if the test photon was placed in coherent superposition of the two spatial modes. We then turn this game into a resource-efficient verification scheme, obtaining a confidence that the particle is superposed which approaches unity exponentially fast. We demonstrate our scheme using a single photon, obtaining a 99% confidence that the particle is superposed with only 37 copies. Our work shows the utility of xor games to verify quantum resources, allowing us to efficiently detect quantum superposition without reinterfering the superposed modes."}],"month":"05","publication":"Physical Review A","department":[{"_id":"OnHo"}]},{"OA_type":"closed access","isi":1,"article_number":"e113018","external_id":{"isi":["001490500500001"],"pmid":["40389696"]},"citation":{"short":"S. Vanneste, Y. Pei, J. Friml, Nature Reviews Molecular Cell Biology (2025).","ama":"Vanneste S, Pei Y, Friml J. Mechanisms of auxin action in plant growth and development. <i>Nature Reviews Molecular Cell Biology</i>. 2025. doi:<a href=\"https://doi.org/10.1038/s41580-025-00851-2\">10.1038/s41580-025-00851-2</a>","ieee":"S. Vanneste, Y. Pei, and J. Friml, “Mechanisms of auxin action in plant growth and development,” <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature, 2025.","ista":"Vanneste S, Pei Y, Friml J. 2025. Mechanisms of auxin action in plant growth and development. Nature Reviews Molecular Cell Biology., e113018.","chicago":"Vanneste, Steffen, Yuanrong Pei, and Jiří Friml. “Mechanisms of Auxin Action in Plant Growth and Development.” <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1038/s41580-025-00851-2\">https://doi.org/10.1038/s41580-025-00851-2</a>.","apa":"Vanneste, S., Pei, Y., &#38; Friml, J. (2025). Mechanisms of auxin action in plant growth and development. <i>Nature Reviews Molecular Cell Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41580-025-00851-2\">https://doi.org/10.1038/s41580-025-00851-2</a>","mla":"Vanneste, Steffen, et al. “Mechanisms of Auxin Action in Plant Growth and Development.” <i>Nature Reviews Molecular Cell Biology</i>, e113018, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1038/s41580-025-00851-2\">10.1038/s41580-025-00851-2</a>."},"publication_status":"published","pmid":1,"language":[{"iso":"eng"}],"type":"journal_article","publisher":"Springer Nature","article_processing_charge":"No","date_created":"2025-05-25T22:16:57Z","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"19","doi":"10.1038/s41580-025-00851-2","date_published":"2025-05-19T00:00:00Z","oa_version":"None","publication_identifier":{"eissn":["1471-0080"],"issn":["1471-0072"]},"title":"Mechanisms of auxin action in plant growth and development","abstract":[{"text":"The phytohormone auxin is a major signal coordinating growth and development in plants. The variety of its effects arises from its ability to form local auxin maxima and gradients within tissues, generated through directional cell-to-cell transport and elaborate metabolic control. These auxin distribution patterns instruct cells in a context-dependent manner to undergo predefined developmental transitions. In this Review, we discuss advances in auxin action at the level of homeostasis and signalling. We highlight key insights into the structural basis of PIN-mediated intercellular auxin transport and explore two novel non-transcriptional auxin signalling mechanisms: one involving intracellular Ca2+ transients and another involving cell-surface auxin perception that mediates global, ultrafast phosphorylation. Furthermore, we examine emerging evidence indicating the involvement of cyclic adenosine monophosphate as a second messenger in the transcriptional auxin response. Together, these recent developments in auxin research have profoundly deepened our understanding of the complex and diverse activities of auxin in plant growth and development.","lang":"eng"}],"month":"05","publication":"Nature Reviews Molecular Cell Biology","department":[{"_id":"JiFr"}],"_id":"19736","scopus_import":"1","year":"2025","article_type":"review","quality_controlled":"1","author":[{"last_name":"Vanneste","first_name":"Steffen","full_name":"Vanneste, Steffen"},{"first_name":"Yuanrong","full_name":"Pei, Yuanrong","last_name":"Pei","id":"98605edc-6ce7-11ee-95f3-cc16b866efcd"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","first_name":"Jiří","full_name":"Friml, Jiří","orcid":"0000-0002-8302-7596"}],"date_updated":"2025-09-30T12:41:30Z","corr_author":"1"},{"date_created":"2025-05-25T22:17:02Z","article_processing_charge":"No","type":"conference","volume":15677,"publisher":"Springer Nature","intvolume":"     15677","conference":{"start_date":"2025-05-12","name":"PKC: Public-Key Cryptography","end_date":"2025-05-15","location":"Roros, Norway"},"alternative_title":["LNCS"],"oa":1,"page":"37-75","OA_type":"green","language":[{"iso":"eng"}],"citation":{"ista":"Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. 2025. Securely instantiating ‘Half Gates’ garbling in the standard model. 28th IACR International Conference on Practice and Theory of Public-Key Cryptography. PKC: Public-Key Cryptography, LNCS, vol. 15677, 37–75.","chicago":"Acharya, Anasuya, Karen Azari, Mirza Ahad Baig, Dennis Hofheinz, and Chethan Kamath. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, 15677:37–75. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">https://doi.org/10.1007/978-3-031-91829-2_2</a>.","apa":"Acharya, A., Azari, K., Baig, M. A., Hofheinz, D., &#38; Kamath, C. (2025). Securely instantiating ‘Half Gates’ garbling in the standard model. In <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i> (Vol. 15677, pp. 37–75). Roros, Norway: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">https://doi.org/10.1007/978-3-031-91829-2_2</a>","mla":"Acharya, Anasuya, et al. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.” <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, vol. 15677, Springer Nature, 2025, pp. 37–75, doi:<a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">10.1007/978-3-031-91829-2_2</a>.","ieee":"A. Acharya, K. Azari, M. A. Baig, D. Hofheinz, and C. Kamath, “Securely instantiating ‘Half Gates’ garbling in the standard model,” in <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>, Roros, Norway, 2025, vol. 15677, pp. 37–75.","short":"A. Acharya, K. Azari, M.A. Baig, D. Hofheinz, C. Kamath, in:, 28th IACR International Conference on Practice and Theory of Public-Key Cryptography, Springer Nature, 2025, pp. 37–75.","ama":"Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. Securely instantiating ‘Half Gates’ garbling in the standard model. In: <i>28th IACR International Conference on Practice and Theory of Public-Key Cryptography</i>. Vol 15677. Springer Nature; 2025:37-75. doi:<a href=\"https://doi.org/10.1007/978-3-031-91829-2_2\">10.1007/978-3-031-91829-2_2</a>"},"_id":"19738","OA_place":"repository","scopus_import":"1","year":"2025","main_file_link":[{"url":"https://eprint.iacr.org/2025/281","open_access":"1"}],"abstract":[{"text":"Garbling is a fundamental cryptographic primitive, with numerous theoretical and practical applications. Since the first construction by Yao (FOCS’82, ’86), a line of work has concerned itself with reducing the communication and computational complexity of that construction. One of the most efficient garbling schemes presently is the ‘Half Gates’ scheme by Zahur, Rosulek, and Evans (Eurocrypt’15). Despite its widespread adoption, the provable security of this scheme has been based on assumptions whose only instantiations are in idealized models. For example, in their original paper, Zahur, Rosulek, and Evans showed that hash functions satisfying a notion called circular correlation robustness (CCR) suffice for this task, and then proved that CCR secure hash functions can be instantiated in the random permutation model.\r\nIn this work, we show how to securely instantiate the Half Gates scheme in the standard model. To this end, we first show how this scheme can be securely instantiated given a (family of) weak CCR hash function, a notion that we introduce. Furthermore, we show how a weak CCR hash function can be used to securely instantiate other efficient garbling schemes, namely the ones by Rosulek and Roy (Crypto’21) and Heath (Eurocrypt’24). Thus we believe this notion to be of independent interest.\r\nFinally, we construct such weak CCR hash functions using indistinguishability obfuscation and one-way functions. The security proof of this construction constitutes our main technical contribution. While our construction is not practical, it serves as a proof of concept supporting the soundness of these garbling schemes, which we regard to be particularly important given the recent initiative by NIST to standardize garbling, and the optimizations in Half Gates being potentially adopted.","lang":"eng"}],"publication":"28th IACR International Conference on Practice and Theory of Public-Key Cryptography","month":"05","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"quality_controlled":"1","author":[{"last_name":"Acharya","full_name":"Acharya, Anasuya","first_name":"Anasuya"},{"full_name":"Azari, Karen","first_name":"Karen","last_name":"Azari"},{"id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425","full_name":"Baig, Mirza Ahad","first_name":"Mirza Ahad","last_name":"Baig"},{"full_name":"Hofheinz, Dennis","first_name":"Dennis","last_name":"Hofheinz"},{"first_name":"Chethan","full_name":"Kamath, Chethan","last_name":"Kamath"}],"date_updated":"2025-06-02T07:01:45Z","doi":"10.1007/978-3-031-91829-2_2","date_published":"2025-05-05T00:00:00Z","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","day":"05","publication_identifier":{"isbn":["9783031918285"],"eissn":["1611-3349"],"issn":["0302-9743"]},"title":"Securely instantiating ‘Half Gates’ garbling in the standard model"},{"has_accepted_license":"1","date_created":"2025-05-25T22:17:04Z","type":"conference","publisher":"Springer Nature","article_processing_charge":"No","ec_funded":1,"volume":15698,"acknowledgement":"This work was in part supported by the ERC-2020-AdG 10102009 grant, and in part by the German Research Foundation (DFG) - WE2290/13-2 (Coop2).","project":[{"grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"ddc":["000"],"intvolume":"     15698","oa":1,"alternative_title":["LNCS"],"conference":{"start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada","end_date":"2025-05-08"},"OA_type":"hybrid","page":"212-216","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"M. Chalupa and C. Richter, “BUBAAK: Dynamic cooperative verification,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15698, pp. 212–216.","short":"M. Chalupa, C. Richter, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 212–216.","ama":"Chalupa M, Richter C. BUBAAK: Dynamic cooperative verification. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15698. Springer Nature; 2025:212-216. doi:<a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">10.1007/978-3-031-90660-2_14</a>","ista":"Chalupa M, Richter C. 2025. BUBAAK: Dynamic cooperative verification. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15698, 212–216.","chicago":"Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15698:212–16. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">https://doi.org/10.1007/978-3-031-90660-2_14</a>.","mla":"Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15698, Springer Nature, 2025, pp. 212–16, doi:<a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">10.1007/978-3-031-90660-2_14</a>.","apa":"Chalupa, M., &#38; Richter, C. (2025). BUBAAK: Dynamic cooperative verification. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15698, pp. 212–216). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90660-2_14\">https://doi.org/10.1007/978-3-031-90660-2_14</a>"},"year":"2025","file_date_updated":"2025-06-02T07:10:35Z","scopus_import":"1","OA_place":"publisher","_id":"19739","department":[{"_id":"ToHe"}],"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","month":"05","abstract":[{"text":"Cooperative verification is gaining momentum in recent years. The usual setup in cooperative verification is that a verifier A is run with some pre-defined resources, and if it is not able to verify the program, the verification task is passed to a verifier B together with information learned about the program by verifier A, then the chain can continue to a verifier C, and so on. This scheme is static: tools run one after another in a fixed pre-defined order and fixed parameters and resource limits (the scheme may differ for properties to be analyzed, though).\r\n\r\nBubaak is a program analysis tool that allows to run multiple program verifiers in a dynamically changing combination of parallel and sequential portfolios. Bubaak starts the verification process by invoking an initial set of tasks; every task, when it is done (e.g., because of hitting a time limit or finishing its job), rewrites itself into one or more successor tasks. New tasks can be also spawned upon events generated by other tasks. This all happens dynamically based on the information gathered by finished and running tasks. During their execution, tasks that run in parallel can exchange (partial) verification artifacts, either directly or with Bubaak as an intermediary.","lang":"eng"}],"corr_author":"1","date_updated":"2025-06-02T07:21:41Z","author":[{"first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463"},{"last_name":"Richter","first_name":"Cedric","full_name":"Richter, Cedric"}],"file":[{"access_level":"open_access","date_updated":"2025-06-02T07:10:35Z","file_name":"2025_TACAS_Chalupa.pdf","creator":"dernst","content_type":"application/pdf","file_id":"19766","file_size":259050,"success":1,"checksum":"3f604f25dbe37383acb7f8308aad3ca6","date_created":"2025-06-02T07:10:35Z","relation":"main_file"}],"quality_controlled":"1","oa_version":"Published Version","date_published":"2025-05-01T00:00:00Z","doi":"10.1007/978-3-031-90660-2_14","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"BUBAAK: Dynamic cooperative verification","publication_identifier":{"isbn":["9783031906596"],"issn":["0302-9743"],"eissn":["1611-3349"]}},{"arxiv":1,"citation":{"ista":"Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. 2025. Value iteration with guessing for Markov chains and Markov decision processes. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 217–236.","chicago":"Chatterjee, Krishnendu, Mahdi Jafariraviz, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:217–36. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">https://doi.org/10.1007/978-3-031-90653-4_11</a>.","mla":"Chatterjee, Krishnendu, et al. “Value Iteration with Guessing for Markov Chains and Markov Decision Processes.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 217–36, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">10.1007/978-3-031-90653-4_11</a>.","apa":"Chatterjee, K., Jafariraviz, M., Saona Urmeneta, R. J., &#38; Svoboda, J. (2025). Value iteration with guessing for Markov chains and Markov decision processes. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 217–236). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">https://doi.org/10.1007/978-3-031-90653-4_11</a>","short":"K. Chatterjee, M. Jafariraviz, R.J. Saona Urmeneta, J. Svoboda, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 217–236.","ama":"Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. Value iteration with guessing for Markov chains and Markov decision processes. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:217-236. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_11\">10.1007/978-3-031-90653-4_11</a>","ieee":"K. Chatterjee, M. Jafariraviz, R. J. Saona Urmeneta, and J. Svoboda, “Value iteration with guessing for Markov chains and Markov decision processes,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 217–236."},"publication_status":"published","language":[{"iso":"eng"}],"page":"217-236","OA_type":"hybrid","conference":{"end_date":"2025-05-08","location":"Hamilton, ON, Canada","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2025-05-03"},"alternative_title":["LNCS"],"external_id":{"arxiv":["2505.06769"]},"oa":1,"intvolume":"     15697","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"ddc":["000"],"acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12 grant.","volume":15697,"ec_funded":1,"article_processing_charge":"No","type":"conference","publisher":"Springer Nature","has_accepted_license":"1","date_created":"2025-05-25T22:17:06Z","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031906527"]},"title":"Value iteration with guessing for Markov chains and Markov decision processes","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","doi":"10.1007/978-3-031-90653-4_11","date_published":"2025-05-01T00:00:00Z","oa_version":"Published Version","file":[{"date_created":"2025-06-02T07:31:12Z","relation":"main_file","checksum":"45da6efbcbed20aada16c48c8e55e2d6","success":1,"file_size":557481,"content_type":"application/pdf","creator":"dernst","file_id":"19767","file_name":"2025_TACAS_Chatterjee.pdf","date_updated":"2025-06-02T07:31:12Z","access_level":"open_access"}],"quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"last_name":"Jafariraviz","first_name":"Mahdi","full_name":"Jafariraviz, Mahdi"},{"id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","first_name":"Raimundo J","orcid":"0000-0001-5103-038X"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub","orcid":"0000-0002-1419-3267"}],"date_updated":"2025-06-02T07:35:06Z","corr_author":"1","abstract":[{"text":"Two standard models for probabilistic systems are Markov chains (MCs) and Markov decision processes (MDPs). Classic objectives for such probabilistic models for control and planning problems are reachability and stochastic shortest path. The widely studied algorithmic approach for these problems is the Value Iteration (VI) algorithm which iteratively applies local updates called Bellman updates. There are many practical approaches for VI in the literature but they all require exponentially many Bellman updates for MCs in the worst case. A preprocessing step is an algorithm that is discrete, graph-theoretical, and requires linear space. An important open question is whether, after a polynomial-time preprocessing, VI can be achieved with sub-exponentially many Bellman updates. In this work, we present a new approach for VI based on guessing values. Our theoretical contributions are twofold. First, for MCs, we present an almost-linear-time preprocessing algorithm after which, along with guessing values, VI requires only subexponentially many Bellman updates. Second, we present an improved analysis of the speed of convergence of VI for MDPs. Finally, we present a practical algorithm for MDPs based on our new approach. Experimental results show that our approach provides a considerable improvement over existing VI-based approaches on several benchmark examples from the literature.","lang":"eng"}],"month":"05","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","department":[{"_id":"KrCh"}],"_id":"19740","OA_place":"publisher","file_date_updated":"2025-06-02T07:31:12Z","scopus_import":"1","year":"2025"},{"date_created":"2025-05-25T22:17:08Z","has_accepted_license":"1","type":"conference","ec_funded":1,"article_processing_charge":"No","publisher":"Springer Nature","volume":15696,"acknowledgement":"This work was supported by the DFG through the Cluster of Excellence EXC 2050/1 (CeTI, project ID 390696704, as part of Germany’s Excellence Strategy) and the TRR 248 (see perspicuous-computing.science, project ID 389792660), by the European Union’s Horizon 2020 research and innovation programme under Marie Skłodowska-Curie grant agreements 101008233 (MISSION), 101034413 (IST-BRIDGE), and 101067199 (ProSVED), by the EU under NextGenerationEU projects D53D23008400006 (Smartitude) under MUR PRIN 2022 and PE00000014 (SERICS) under MUR PNRR, by the Interreg North Sea project STORM_SAFE, and by NWO VIDI grant VI.Vidi.223.110 (TruSTy).","project":[{"grant_number":"101034413","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"ddc":["000"],"intvolume":"     15696","oa":1,"external_id":{"arxiv":["2411.00559"]},"alternative_title":["LNCS"],"conference":{"start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2025-05-08","location":"Hamilton, ON, Canada"},"OA_type":"hybrid","page":"167-190","publication_status":"published","language":[{"iso":"eng"}],"citation":{"chicago":"Budde, Carlos E., Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15696:167–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">https://doi.org/10.1007/978-3-031-90643-5_9</a>.","mla":"Budde, Carlos E., et al. “Sound Statistical Model Checking for Probabilities and Expected Rewards.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15696, Springer Nature, 2025, pp. 167–90, doi:<a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">10.1007/978-3-031-90643-5_9</a>.","apa":"Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., &#38; Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">https://doi.org/10.1007/978-3-031-90643-5_9</a>","ista":"Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. 2025. Sound statistical model checking for probabilities and expected rewards. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15696, 167–190.","ieee":"C. E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15696, pp. 167–190.","ama":"Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical model checking for probabilities and expected rewards. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15696. Springer Nature; 2025:167-190. doi:<a href=\"https://doi.org/10.1007/978-3-031-90643-5_9\">10.1007/978-3-031-90643-5_9</a>","short":"C.E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 167–190."},"arxiv":1,"year":"2025","scopus_import":"1","file_date_updated":"2025-06-02T09:35:42Z","OA_place":"publisher","_id":"19742","department":[{"_id":"KrCh"}],"related_material":{"record":[{"id":"19769","status":"public","relation":"research_data"}]},"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","month":"05","abstract":[{"lang":"eng","text":"Statistical model checking estimates probabilities and expectations of interest in probabilistic system models by using random simulations. Its results come with statistical guarantees. However, many tools use unsound statistical methods that produce incorrect results more often than they claim. In this paper, we provide a comprehensive overview of tools and their correctness, as well as of sound methods available for estimating probabilities from the literature. For expected rewards, we investigate how to bound the path reward distribution to apply sound statistical methods for bounded distributions, of which we recommend the Dvoretzky-Kiefer-Wolfowitz inequality that has not been used in SMC so far. We prove that even reachability rewards can be bounded in theory, and formalise the concept of limit-PAC procedures for a practical solution. The modes SMC tool implements our methods and recommendations, which we use to experimentally confirm our results."}],"date_updated":"2025-06-02T09:45:41Z","author":[{"first_name":"Carlos E.","full_name":"Budde, Carlos E.","last_name":"Budde"},{"first_name":"Arnd","full_name":"Hartmanns, Arnd","last_name":"Hartmanns"},{"last_name":"Meggendorfer","full_name":"Meggendorfer, Tobias","first_name":"Tobias","orcid":"0000-0002-1712-2165","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"last_name":"Weininger","first_name":"Maximilian","full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881"},{"first_name":"Patrick","full_name":"Wienhöft, Patrick","last_name":"Wienhöft"}],"file":[{"file_name":"2025_TACAS_Budde.pdf","date_updated":"2025-06-02T09:35:42Z","access_level":"open_access","relation":"main_file","date_created":"2025-06-02T09:35:42Z","checksum":"d45856b503b1dd4f8f14c3566327225b","success":1,"file_size":711271,"content_type":"application/pdf","creator":"dernst","file_id":"19770"}],"quality_controlled":"1","oa_version":"Published Version","date_published":"2025-05-01T00:00:00Z","doi":"10.1007/978-3-031-90643-5_9","day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Sound statistical model checking for probabilities and expected rewards","publication_identifier":{"isbn":["9783031906428"],"eissn":["1611-3349"],"issn":["0302-9743"]}},{"oa_version":"Published Version","doi":"10.1007/978-3-031-90653-4_7","date_published":"2025-05-01T00:00:00Z","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"title":"Fixed point certificates for reachability and expected rewards in MDPs","publication_identifier":{"isbn":["9783031906527"],"issn":["0302-9743"],"eissn":["1611-3349"]},"scopus_import":"1","file_date_updated":"2025-06-02T10:49:52Z","year":"2025","_id":"19743","OA_place":"publisher","related_material":{"record":[{"status":"public","id":"19771","relation":"research_data"}]},"department":[{"_id":"KrCh"}],"abstract":[{"text":"The possibility of errors in human-engineered formal verification software, such as model checkers, poses a serious threat to the purpose of these tools. An established approach to mitigate this problem are certificates—lightweight, easy-to-check proofs of the verification results. In this paper, we develop novel certificates for model checking of Markov decision processes (MDPs) with quantitative reachability and expected reward properties. Our approach is conceptually simple and relies almost exclusively on elementary fixed point theory. Our certificates work for arbitrary finite MDPs and can be readily computed with little overhead using standard algorithms. We formalize the soundness of our certificates in Isabelle/HOL and provide a formally verified certificate checker. Moreover, we augment existing algorithms in the probabilistic model checker Storm with the ability to produce certificates and demonstrate practical applicability by conducting the first formal certification of the reference results in the Quantitative Verification Benchmark Set.","lang":"eng"}],"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","month":"05","corr_author":"1","date_updated":"2025-06-02T10:55:34Z","file":[{"date_updated":"2025-06-02T10:49:52Z","access_level":"open_access","file_name":"2025_TACAS_ChatterjeeKrish.pdf","file_size":732136,"creator":"dernst","file_id":"19772","content_type":"application/pdf","date_created":"2025-06-02T10:49:52Z","relation":"main_file","checksum":"64b7f46ef05649b87b827248045c7645","success":1}],"quality_controlled":"1","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"},{"last_name":"Quatmann","full_name":"Quatmann, Tim","first_name":"Tim"},{"first_name":"Maximilian","full_name":"Schäffeler, Maximilian","last_name":"Schäffeler"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"first_name":"Tobias","full_name":"Winkler, Tobias","last_name":"Winkler"},{"id":"d8ebc24a-3f98-11f0-9044-8296d4f39ab3","first_name":"Daniel","full_name":"Zilken, Daniel","last_name":"Zilken"}],"oa":1,"external_id":{"arxiv":["2501.11467"]},"conference":{"start_date":"2025-05-03","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada","end_date":"2025-05-08"},"alternative_title":["LNCS"],"page":"130-151","OA_type":"hybrid","language":[{"iso":"eng"}],"publication_status":"published","citation":{"ieee":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Fixed point certificates for reachability and expected rewards in MDPs,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 130–151.","ama":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Fixed point certificates for reachability and expected rewards in MDPs. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:130-151. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">10.1007/978-3-031-90653-4_7</a>","short":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 130–151.","chicago":"Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:130–51. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">https://doi.org/10.1007/978-3-031-90653-4_7</a>.","apa":"Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., &#38; Zilken, D. (2025). Fixed point certificates for reachability and expected rewards in MDPs. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 130–151). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">https://doi.org/10.1007/978-3-031-90653-4_7</a>","mla":"Chatterjee, Krishnendu, et al. “Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 130–51, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_7\">10.1007/978-3-031-90653-4_7</a>.","ista":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Fixed point certificates for reachability and expected rewards in MDPs. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 130–151."},"arxiv":1,"has_accepted_license":"1","date_created":"2025-05-25T22:17:09Z","acknowledgement":"This project has received funding from the ERC CoG 863818 (ForM-SMArt), the Austrian Science Fund (FWF) 10.55776/COE12, a KI-Starter grant from the Ministerium für Kultur und Wissenschaft NRW, the DFG RTG 378803395 (ConVeY), the EU’s Horizon 2020 research and innovation programmes under the Marie Sklodowska-Curie grant agreement Nos. 101034413 (IST-BRIDGE) and 101008233 (MISSION), and the DFG RTG 2236 (UnRAVeL). Experiments were performed with computing resources granted by RWTH Aachen University under project rwth1632.","volume":15697,"ec_funded":1,"article_processing_charge":"No","publisher":"Springer Nature","type":"conference","intvolume":"     15697","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"},{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"ddc":["000"]},{"publication_identifier":{"isbn":["9783031906527"],"eissn":["1611-3349"],"issn":["0302-9743"]},"title":"Refuting equivalence in probabilistic programs with conditioning","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2025-05-01T00:00:00Z","doi":"10.1007/978-3-031-90653-4_14","oa_version":"Published Version","author":[{"first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","full_name":"Kafshdar Goharshadi, Ehsan","first_name":"Ehsan","last_name":"Kafshdar Goharshadi","orcid":"0000-0002-8595-0587"},{"last_name":"Novotný","full_name":"Novotný, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-4681-1699","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87"}],"file":[{"access_level":"open_access","date_updated":"2025-06-02T11:13:49Z","file_name":"2025_TACAS_Chatterjee_Goharshadi.pdf","file_size":532181,"content_type":"application/pdf","file_id":"19773","creator":"dernst","success":1,"relation":"main_file","date_created":"2025-06-02T11:13:49Z","checksum":"7dcd85e7e753bfa994c10b3cf9ebc185"}],"quality_controlled":"1","date_updated":"2025-06-02T11:16:13Z","corr_author":"1","month":"05","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","abstract":[{"text":"We consider the problem of refuting equivalence of probabilistic programs, i.e., the problem of proving that two probabilistic programs induce different output distributions. We study this problem in the context of programs with conditioning (i.e., with observe and score statements), where the output distribution is conditioned by the event that all the observe statements along a run evaluate to true, and where the probability densities of different runs may be updated via the score statements. Building on a recent work on programs without conditioning, we present a new equivalence refutation method for programs with conditioning. Our method is based on weighted restarting, a novel transformation of probabilistic programs with conditioning to the output equivalent probabilistic programs without conditioning that we introduce in this work. Our method is the first to be both a) fully automated, and b) providing provably correct answers. We demonstrate the applicability of our method on a set of programs from the probabilistic inference literature.","lang":"eng"}],"department":[{"_id":"KrCh"}],"OA_place":"publisher","_id":"19744","year":"2025","file_date_updated":"2025-06-02T11:13:49Z","scopus_import":"1","arxiv":1,"citation":{"ieee":"K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence in probabilistic programs with conditioning,” in <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, Hamilton, ON, Canada, 2025, vol. 15697, pp. 279–300.","ama":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. Refuting equivalence in probabilistic programs with conditioning. In: <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>. Vol 15697. Springer Nature; 2025:279-300. doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">10.1007/978-3-031-90653-4_14</a>","short":"K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, in:, 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2025, pp. 279–300.","apa":"Chatterjee, K., Goharshady, E., Novotný, P., &#38; Zikelic, D. (2025). Refuting equivalence in probabilistic programs with conditioning. In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i> (Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">https://doi.org/10.1007/978-3-031-90653-4_14</a>","mla":"Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs with Conditioning.” <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, vol. 15697, Springer Nature, 2025, pp. 279–300, doi:<a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">10.1007/978-3-031-90653-4_14</a>.","chicago":"Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic. “Refuting Equivalence in Probabilistic Programs with Conditioning.” In <i>31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems</i>, 15697:279–300. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-031-90653-4_14\">https://doi.org/10.1007/978-3-031-90653-4_14</a>.","ista":"Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2025. Refuting equivalence in probabilistic programs with conditioning. 31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 15697, 279–300."},"language":[{"iso":"eng"}],"publication_status":"published","OA_type":"hybrid","page":"279-300","alternative_title":["LNCS"],"conference":{"name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","start_date":"2025-05-03","location":"Hamilton, ON, Canada","end_date":"2025-05-08"},"oa":1,"external_id":{"arxiv":["2501.06579"]},"project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"ddc":["000"],"intvolume":"     15697","volume":15697,"type":"conference","article_processing_charge":"No","publisher":"Springer Nature","ec_funded":1,"acknowledgement":"This work was partially supported by ERC CoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12. Petr Novotný is supported by the Czech Science Foundation grant no. GA23-06963S.","has_accepted_license":"1","date_created":"2025-05-25T22:17:10Z"}]