[{"article_processing_charge":"No","publication":"Journal of Fluid Mechanics","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).","file_date_updated":"2025-05-28T08:12:07Z","external_id":{"isi":["001489159700001"]},"doi":"10.1017/jfm.2025.362","oa_version":"Published Version","ddc":["530"],"file":[{"checksum":"f1b0f6a977fdf2d6eb9e16c11d030c0c","success":1,"file_size":6415303,"file_id":"19751","creator":"dernst","content_type":"application/pdf","date_created":"2025-05-28T08:12:07Z","date_updated":"2025-05-28T08:12:07Z","access_level":"open_access","file_name":"2025_JourFluidMech_DeLeo.pdf","relation":"main_file"}],"OA_place":"publisher","title":"Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow","quality_controlled":"1","scopus_import":"1","status":"public","month":"05","year":"2025","author":[{"full_name":"De Leo, Annalisa","last_name":"De Leo","first_name":"Annalisa"},{"last_name":"Brizzolara","first_name":"Stefano","full_name":"Brizzolara, Stefano","id":"4bbe33b8-c59a-11ee-a1af-fa33d1ac42c4"},{"full_name":"Cavaiola, Mattia","first_name":"Mattia","last_name":"Cavaiola"},{"last_name":"He","first_name":"Junlin","full_name":"He, Junlin"},{"full_name":"Stocchino, Alessandro","first_name":"Alessandro","last_name":"Stocchino"}],"intvolume":"      1011","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"date_created":"2025-05-25T22:16:46Z","isi":1,"department":[{"_id":"BjHo"}],"publication_status":"published","ec_funded":1,"date_published":"2025-05-16T00:00:00Z","volume":1011,"type":"journal_article","oa":1,"project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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."}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T12:38:34Z","citation":{"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>.","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.","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>","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.","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>.","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)."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","article_number":"A5","article_type":"original","_id":"19729","day":"16","publisher":"Cambridge University Press","OA_type":"hybrid"},{"publication_status":"published","department":[{"_id":"BjHo"}],"date_published":"2025-05-14T00:00:00Z","ec_funded":1,"year":"2025","month":"05","status":"public","date_created":"2025-05-25T22:16:48Z","isi":1,"intvolume":"      1010","publication_identifier":{"issn":["0022-1120"],"eissn":["1469-7645"]},"author":[{"last_name":"Wang","first_name":"Baoying","full_name":"Wang, Baoying","id":"df755ffe-735a-11ee-bb55-dff29d61d338","orcid":"0000-0002-6229-0336"},{"first_name":"Roger","last_name":"Ayats López","orcid":"0000-0001-6572-0621","full_name":"Ayats López, Roger","id":"ab77522d-073b-11ed-8aff-e71b39258362"},{"last_name":"Deguchi","first_name":"K.","full_name":"Deguchi, K."},{"first_name":"A.","last_name":"Meseguer","full_name":"Meseguer, A."},{"first_name":"F.","last_name":"Mellibovsky","full_name":"Mellibovsky, F."}],"OA_place":"publisher","file":[{"relation":"main_file","success":1,"checksum":"77f39b762a0e59e88954afb93b23cc7a","file_size":3607069,"file_id":"19752","content_type":"application/pdf","creator":"dernst","date_updated":"2025-05-28T08:32:33Z","date_created":"2025-05-28T08:32:33Z","access_level":"open_access","file_name":"2025_JourFluidMech_Wang.pdf"}],"ddc":["530"],"external_id":{"isi":["001487354900001"]},"file_date_updated":"2025-05-28T08:32:33Z","doi":"10.1017/jfm.2025.278","oa_version":"Published Version","scopus_import":"1","quality_controlled":"1","title":"Feigenbaum universality in subcritical Taylor-Couette flow","article_processing_charge":"Yes (in subscription journal)","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.","publication":"Journal of Fluid Mechanics","OA_type":"hybrid","_id":"19730","article_type":"original","publisher":"Cambridge University Press","day":"14","citation":{"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>.","short":"B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, F. Mellibovsky, Journal of Fluid Mechanics 1010 (2025).","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>","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>","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>.","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.","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."},"article_number":"A36","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"grant_number":"ESP 1481224","_id":"942a0200-16d5-11f0-9cad-f48ab22dfd1c","name":"Pattern Formation Mechanisms in Planar Shear Flows"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"volume":1010,"type":"journal_article","date_updated":"2025-09-30T12:39:05Z","language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}]},{"scopus_import":"1","title":"Let us FIGURE it out: Why do scientists still make “bad” figures?","quality_controlled":"1","OA_place":"publisher","file":[{"relation":"main_file","date_updated":"2025-05-28T08:48:38Z","date_created":"2025-05-28T08:48:38Z","access_level":"open_access","file_name":"2025_ACSMaterialsAu_Rayaroth.pdf","success":1,"checksum":"a3aa15e4022fa359d6ba5afb96268841","file_size":1750018,"creator":"dernst","file_id":"19753","content_type":"application/pdf"}],"doi":"10.1021/acsmaterialsau.5c00037","file_date_updated":"2025-05-28T08:48:38Z","oa_version":"Published Version","external_id":{"pmid":["40385955"]},"ddc":["540"],"publication":"ACS Materials Au","pmid":1,"article_processing_charge":"Yes","corr_author":"1","date_published":"2025-05-14T00:00:00Z","publication_status":"published","department":[{"_id":"MaIb"}],"date_created":"2025-05-25T22:16:51Z","author":[{"id":"8aceb01b-8972-11ed-ae7b-d5fe53775add","full_name":"Rayaroth Puthiyaveettil, Aiswarya","last_name":"Rayaroth Puthiyaveettil","first_name":"Aiswarya"},{"id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","full_name":"Fiedler, Christine","last_name":"Fiedler","first_name":"Christine"},{"id":"43C61214-F248-11E8-B48F-1D18A9856A87","full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","first_name":"Maria"}],"publication_identifier":{"eissn":["2694-2461"]},"intvolume":"         5","year":"2025","status":"public","month":"05","issue":"3","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"has_accepted_license":"1","citation":{"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.","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>","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>.","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.","short":"A. Rayaroth Puthiyaveettil, C. Fiedler, M. Ibáñez, ACS Materials Au 5 (2025) 438–440.","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>","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>."},"date_updated":"2025-06-11T13:23:01Z","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"}],"language":[{"iso":"eng"}],"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","volume":5,"type":"journal_article","OA_type":"gold","page":"438-440","DOAJ_listed":"1","publisher":"American Chemical Society","day":"14","_id":"19731","article_type":"editorial"},{"article_processing_charge":"Yes (in subscription journal)","publication":"Journal of Fluid Mechanics","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"],"external_id":{"isi":["001486096600001"]},"file_date_updated":"2025-05-28T09:00:52Z","doi":"10.1017/jfm.2025.151","oa_version":"Published Version","OA_place":"publisher","file":[{"access_level":"open_access","file_name":"2025_JourFluidMech_Wang_Ayats.pdf","date_updated":"2025-05-28T09:00:52Z","date_created":"2025-05-28T09:00:52Z","creator":"dernst","file_id":"19754","content_type":"application/pdf","checksum":"899df5797844a9e811dffeebe8c05c8e","success":1,"file_size":998754,"relation":"main_file"}],"quality_controlled":"1","title":"Mathematically established chaos and forecast of statistics with recurrent patterns in Taylor-Couette flow","scopus_import":"1","month":"05","status":"public","year":"2025","intvolume":"      1011","publication_identifier":{"eissn":["1469-7645"],"issn":["0022-1120"]},"author":[{"last_name":"Wang","first_name":"Baoying","full_name":"Wang, Baoying","id":"df755ffe-735a-11ee-bb55-dff29d61d338","orcid":"0000-0002-6229-0336"},{"id":"ab77522d-073b-11ed-8aff-e71b39258362","full_name":"Ayats López, Roger","orcid":"0000-0001-6572-0621","last_name":"Ayats López","first_name":"Roger"},{"full_name":"Deguchi, K.","first_name":"K.","last_name":"Deguchi"},{"first_name":"A.","last_name":"Meseguer","full_name":"Meseguer, A."},{"full_name":"Mellibovsky, F.","last_name":"Mellibovsky","first_name":"F."}],"isi":1,"date_created":"2025-05-25T22:16:52Z","department":[{"_id":"BjHo"}],"publication_status":"published","date_published":"2025-05-13T00:00:00Z","ec_funded":1,"volume":1011,"type":"journal_article","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"name":"Pattern Formation Mechanisms in Planar Shear Flows","grant_number":"ESP 1481224","_id":"942a0200-16d5-11f0-9cad-f48ab22dfd1c"}],"oa":1,"language":[{"iso":"eng"}],"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","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>","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>.","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.","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>","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.","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>."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","article_number":"R2","article_type":"original","_id":"19732","day":"13","publisher":"Cambridge University Press","OA_type":"hybrid"},{"author":[{"first_name":"Daniel","last_name":"Kun","full_name":"Kun, Daniel"},{"full_name":"Strömberg, Karl T","id":"68011cd2-da32-11ee-a930-b2774c7aba5f","last_name":"Strömberg","first_name":"Karl T"},{"last_name":"Spagnolo","first_name":"Michele","full_name":"Spagnolo, Michele"},{"first_name":"Borivoje","last_name":"Dakić","full_name":"Dakić, Borivoje"},{"first_name":"Lee A.","last_name":"Rozema","full_name":"Rozema, Lee A."},{"full_name":"Walther, Philip","first_name":"Philip","last_name":"Walther"}],"intvolume":"       111","publication_identifier":{"eissn":["2469-9934"],"issn":["2469-9926"]},"date_created":"2025-05-25T22:16:54Z","isi":1,"arxiv":1,"status":"public","month":"05","year":"2025","date_published":"2025-05-16T00:00:00Z","department":[{"_id":"OnHo"}],"publication_status":"published","publication":"Physical Review A","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).","article_processing_charge":"No","title":"Direct and efficient detection of quantum superposition","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","doi":"10.1103/PhysRevA.111.L050402","file_date_updated":"2025-05-28T09:16:03Z","external_id":{"arxiv":["2405.08065"],"isi":["001501941500006"]},"ddc":["530"],"OA_place":"publisher","file":[{"file_size":571784,"success":1,"checksum":"b83295a8f597b7781d8e7bfa3b393b42","content_type":"application/pdf","creator":"dernst","file_id":"19755","date_created":"2025-05-28T09:16:03Z","date_updated":"2025-05-28T09:16:03Z","file_name":"2025_PhysReviewA_Kun.pdf","access_level":"open_access","relation":"main_file"}],"publisher":"American Physical Society","day":"16","_id":"19733","article_type":"letter_note","OA_type":"hybrid","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."}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T12:40:18Z","type":"journal_article","volume":111,"oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","issue":"5","article_number":"L050402","citation":{"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>.","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>","short":"D. Kun, K.T. Strömberg, M. Spagnolo, B. Dakić, L.A. Rozema, P. Walther, Physical Review A 111 (2025).","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.","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>.","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>","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."}},{"date_updated":"2025-09-30T12:41:30Z","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"}],"language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","type":"journal_article","article_number":"e113018","citation":{"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>.","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>","short":"S. Vanneste, Y. Pei, J. Friml, Nature Reviews Molecular Cell Biology (2025).","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.","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>","ista":"Vanneste S, Pei Y, Friml J. 2025. Mechanisms of auxin action in plant growth and development. Nature Reviews Molecular Cell Biology., e113018."},"day":"19","publisher":"Springer Nature","article_type":"review","_id":"19736","OA_type":"closed access","pmid":1,"publication":"Nature Reviews Molecular Cell Biology","article_processing_charge":"No","scopus_import":"1","title":"Mechanisms of auxin action in plant growth and development","quality_controlled":"1","external_id":{"pmid":["40389696"],"isi":["001490500500001"]},"oa_version":"None","doi":"10.1038/s41580-025-00851-2","isi":1,"date_created":"2025-05-25T22:16:57Z","author":[{"full_name":"Vanneste, Steffen","last_name":"Vanneste","first_name":"Steffen"},{"last_name":"Pei","first_name":"Yuanrong","full_name":"Pei, Yuanrong","id":"98605edc-6ce7-11ee-95f3-cc16b866efcd"},{"first_name":"Jiří","last_name":"Friml","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"publication_identifier":{"issn":["1471-0072"],"eissn":["1471-0080"]},"year":"2025","status":"public","month":"05","corr_author":"1","date_published":"2025-05-19T00:00:00Z","publication_status":"published","department":[{"_id":"JiFr"}]},{"day":"01","publisher":"Springer Nature","_id":"19737","article_type":"original","OA_type":"hybrid","abstract":[{"lang":"eng","text":"For general large non–Hermitian random matrices X and deterministic normal deformations A, we prove that the local eigenvalue statistics of A + X close to the critical edge points of its spectrum are universal. This concludes the proof of the third and last remaining typical universality class for non–Hermitian random matrices (for normal deformations), after bulk and sharp edge universalities have been established in recent years."}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T12:41:58Z","type":"journal_article","oa":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"62796744-2b32-11ec-9570-940b20777f1d","grant_number":"101020331","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"article_number":"050603","citation":{"ieee":"G. Cipolloni, L. Erdös, and H. C. Ji, “Non–Hermitian spectral universality at critical points,” <i>Probability Theory and Related Fields</i>. Springer Nature, 2025.","chicago":"Cipolloni, Giorgio, László Erdös, and Hong Chang Ji. “Non–Hermitian Spectral Universality at Critical Points.” <i>Probability Theory and Related Fields</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00440-025-01384-7\">https://doi.org/10.1007/s00440-025-01384-7</a>.","apa":"Cipolloni, G., Erdös, L., &#38; Ji, H. C. (2025). Non–Hermitian spectral universality at critical points. <i>Probability Theory and Related Fields</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00440-025-01384-7\">https://doi.org/10.1007/s00440-025-01384-7</a>","ista":"Cipolloni G, Erdös L, Ji HC. 2025. Non–Hermitian spectral universality at critical points. Probability Theory and Related Fields., 050603.","mla":"Cipolloni, Giorgio, et al. “Non–Hermitian Spectral Universality at Critical Points.” <i>Probability Theory and Related Fields</i>, 050603, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00440-025-01384-7\">10.1007/s00440-025-01384-7</a>.","ama":"Cipolloni G, Erdös L, Ji HC. Non–Hermitian spectral universality at critical points. <i>Probability Theory and Related Fields</i>. 2025. doi:<a href=\"https://doi.org/10.1007/s00440-025-01384-7\">10.1007/s00440-025-01384-7</a>","short":"G. Cipolloni, L. Erdös, H.C. Ji, Probability Theory and Related Fields (2025)."},"author":[{"id":"42198EFA-F248-11E8-B48F-1D18A9856A87","full_name":"Cipolloni, Giorgio","orcid":"0000-0002-4901-7992","last_name":"Cipolloni","first_name":"Giorgio"},{"orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"Erdös, László","first_name":"László","last_name":"Erdös"},{"first_name":"Hong Chang","last_name":"Ji","full_name":"Ji, Hong Chang"}],"publication_identifier":{"eissn":["1432-2064"],"issn":["0178-8051"]},"date_created":"2025-05-25T22:16:59Z","isi":1,"status":"public","month":"01","year":"2025","ec_funded":1,"main_file_link":[{"url":"https://doi.org/10.1007/s00440-025-01384-7","open_access":"1"}],"date_published":"2025-01-01T00:00:00Z","corr_author":"1","department":[{"_id":"LaEr"}],"publication_status":"epub_ahead","publication":"Probability Theory and Related Fields","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). Supported by ERC Advanced Grant “RMTBeyond” No. 101020331.","article_processing_charge":"Yes (via OA deal)","title":"Non–Hermitian spectral universality at critical points","quality_controlled":"1","scopus_import":"1","oa_version":"Published Version","doi":"10.1007/s00440-025-01384-7","external_id":{"isi":["001493091900001"]},"OA_place":"publisher"},{"year":"2025","status":"public","month":"05","date_created":"2025-05-25T22:17:02Z","author":[{"last_name":"Acharya","first_name":"Anasuya","full_name":"Acharya, Anasuya"},{"first_name":"Karen","last_name":"Azari","full_name":"Azari, Karen"},{"last_name":"Baig","first_name":"Mirza Ahad","full_name":"Baig, Mirza Ahad","id":"3EDE6DE4-AA5A-11E9-986D-341CE6697425"},{"first_name":"Dennis","last_name":"Hofheinz","full_name":"Hofheinz, Dennis"},{"full_name":"Kamath, Chethan","last_name":"Kamath","first_name":"Chethan"}],"intvolume":"     15677","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031918285"]},"department":[{"_id":"KrPi"},{"_id":"GradSch"}],"main_file_link":[{"url":"https://eprint.iacr.org/2025/281","open_access":"1"}],"date_published":"2025-05-05T00:00:00Z","article_processing_charge":"No","publication":"28th IACR International Conference on Practice and Theory of Public-Key Cryptography","OA_place":"repository","oa_version":"Preprint","doi":"10.1007/978-3-031-91829-2_2","scopus_import":"1","alternative_title":["LNCS"],"title":"Securely instantiating ‘Half Gates’ garbling in the standard model","quality_controlled":"1","_id":"19738","publisher":"Springer Nature","day":"05","page":"37-75","OA_type":"green","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","volume":15677,"date_updated":"2025-06-02T07:01:45Z","abstract":[{"lang":"eng","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."}],"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.","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>","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.","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>.","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>","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>."},"conference":{"start_date":"2025-05-12","location":"Roros, Norway","end_date":"2025-05-15","name":"PKC: Public-Key Cryptography"}},{"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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).","article_processing_charge":"No","title":"BUBAAK: Dynamic cooperative verification","quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"file_date_updated":"2025-06-02T07:10:35Z","oa_version":"Published Version","doi":"10.1007/978-3-031-90660-2_14","ddc":["000"],"OA_place":"publisher","file":[{"file_id":"19766","creator":"dernst","content_type":"application/pdf","file_size":259050,"checksum":"3f604f25dbe37383acb7f8308aad3ca6","success":1,"file_name":"2025_TACAS_Chalupa.pdf","access_level":"open_access","date_created":"2025-06-02T07:10:35Z","date_updated":"2025-06-02T07:10:35Z","relation":"main_file"}],"author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","full_name":"Chalupa, Marek","first_name":"Marek","last_name":"Chalupa"},{"full_name":"Richter, Cedric","first_name":"Cedric","last_name":"Richter"}],"intvolume":"     15698","publication_identifier":{"isbn":["9783031906596"],"issn":["0302-9743"],"eissn":["1611-3349"]},"date_created":"2025-05-25T22:17:04Z","status":"public","month":"05","year":"2025","ec_funded":1,"date_published":"2025-05-01T00:00:00Z","corr_author":"1","department":[{"_id":"ToHe"}],"publication_status":"published","abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"date_updated":"2025-06-02T07:21:41Z","type":"conference","volume":15698,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software"}],"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","conference":{"start_date":"2025-05-03","location":"Hamilton, ON, Canada","end_date":"2025-05-08","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"citation":{"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>","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.","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>.","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>.","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.","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>"},"day":"01","publisher":"Springer Nature","_id":"19739","OA_type":"hybrid","page":"212-216"},{"_id":"19740","publisher":"Springer Nature","day":"01","page":"217-236","OA_type":"hybrid","volume":15697,"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","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."}],"date_updated":"2025-06-02T07:35:06Z","citation":{"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>","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>.","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.","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.","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>.","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>"},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","conference":{"start_date":"2025-05-03","end_date":"2025-05-08","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada"},"month":"05","status":"public","year":"2025","intvolume":"     15697","publication_identifier":{"isbn":["9783031906527"],"issn":["0302-9743"],"eissn":["1611-3349"]},"author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Jafariraviz, Mahdi","last_name":"Jafariraviz","first_name":"Mahdi"},{"orcid":"0000-0001-5103-038X","full_name":"Saona Urmeneta, Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","first_name":"Raimundo J","last_name":"Saona Urmeneta"},{"last_name":"Svoboda","first_name":"Jakub","full_name":"Svoboda, Jakub","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267"}],"arxiv":1,"date_created":"2025-05-25T22:17:06Z","department":[{"_id":"KrCh"}],"publication_status":"published","date_published":"2025-05-01T00:00:00Z","ec_funded":1,"corr_author":"1","article_processing_charge":"No","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant and Austrian Science Fund (FWF) 10.55776/COE12 grant.","ddc":["000"],"file_date_updated":"2025-06-02T07:31:12Z","oa_version":"Published Version","external_id":{"arxiv":["2505.06769"]},"doi":"10.1007/978-3-031-90653-4_11","OA_place":"publisher","file":[{"access_level":"open_access","file_name":"2025_TACAS_Chatterjee.pdf","date_updated":"2025-06-02T07:31:12Z","date_created":"2025-06-02T07:31:12Z","file_id":"19767","creator":"dernst","content_type":"application/pdf","checksum":"45da6efbcbed20aada16c48c8e55e2d6","success":1,"file_size":557481,"relation":"main_file"}],"quality_controlled":"1","title":"Value iteration with guessing for Markov chains and Markov decision processes","alternative_title":["LNCS"],"scopus_import":"1"},{"month":"05","status":"public","year":"2025","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783031906428"]},"intvolume":"     15696","author":[{"first_name":"Carlos E.","last_name":"Budde","full_name":"Budde, Carlos E."},{"first_name":"Arnd","last_name":"Hartmanns","full_name":"Hartmanns, Arnd"},{"orcid":"0000-0002-1712-2165","full_name":"Meggendorfer, Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","first_name":"Tobias","last_name":"Meggendorfer"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","last_name":"Weininger","first_name":"Maximilian"},{"last_name":"Wienhöft","first_name":"Patrick","full_name":"Wienhöft, Patrick"}],"arxiv":1,"date_created":"2025-05-25T22:17:08Z","department":[{"_id":"KrCh"}],"publication_status":"published","date_published":"2025-05-01T00:00:00Z","ec_funded":1,"article_processing_charge":"No","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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).","ddc":["000"],"oa_version":"Published Version","external_id":{"arxiv":["2411.00559"]},"file_date_updated":"2025-06-02T09:35:42Z","doi":"10.1007/978-3-031-90643-5_9","file":[{"file_name":"2025_TACAS_Budde.pdf","access_level":"open_access","date_updated":"2025-06-02T09:35:42Z","date_created":"2025-06-02T09:35:42Z","file_id":"19770","content_type":"application/pdf","creator":"dernst","file_size":711271,"checksum":"d45856b503b1dd4f8f14c3566327225b","success":1,"relation":"main_file"}],"OA_place":"publisher","quality_controlled":"1","title":"Sound statistical model checking for probabilities and expected rewards","alternative_title":["LNCS"],"scopus_import":"1","_id":"19742","related_material":{"record":[{"relation":"research_data","status":"public","id":"19769"}]},"publisher":"Springer Nature","day":"01","page":"167-190","OA_type":"hybrid","type":"conference","volume":15696,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"oa":1,"language":[{"iso":"eng"}],"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","citation":{"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.","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>.","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.","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>.","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.","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>"},"has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"start_date":"2025-05-03","end_date":"2025-05-08","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada"}},{"OA_type":"hybrid","page":"130-151","related_material":{"record":[{"relation":"research_data","id":"19771","status":"public"}]},"day":"01","publisher":"Springer Nature","_id":"19743","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"end_date":"2025-05-08","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","location":"Hamilton, ON, Canada","start_date":"2025-05-03"},"citation":{"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.","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>","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.","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>","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>.","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."},"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"}],"language":[{"iso":"eng"}],"date_updated":"2025-06-02T10:55:34Z","volume":15697,"type":"conference","oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818"},{"call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"ec_funded":1,"date_published":"2025-05-01T00:00:00Z","corr_author":"1","department":[{"_id":"KrCh"}],"publication_status":"published","author":[{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Quatmann, Tim","last_name":"Quatmann","first_name":"Tim"},{"full_name":"Schäffeler, Maximilian","last_name":"Schäffeler","first_name":"Maximilian"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"},{"id":"d8ebc24a-3f98-11f0-9044-8296d4f39ab3","full_name":"Zilken, Daniel","last_name":"Zilken","first_name":"Daniel"}],"intvolume":"     15697","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783031906527"]},"date_created":"2025-05-25T22:17:09Z","arxiv":1,"status":"public","month":"05","year":"2025","title":"Fixed point certificates for reachability and expected rewards in MDPs","quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"file_date_updated":"2025-06-02T10:49:52Z","oa_version":"Published Version","doi":"10.1007/978-3-031-90653-4_7","external_id":{"arxiv":["2501.11467"]},"ddc":["000"],"OA_place":"publisher","file":[{"creator":"dernst","file_id":"19772","content_type":"application/pdf","file_size":732136,"checksum":"64b7f46ef05649b87b827248045c7645","success":1,"file_name":"2025_TACAS_ChatterjeeKrish.pdf","access_level":"open_access","date_updated":"2025-06-02T10:49:52Z","date_created":"2025-06-02T10:49:52Z","relation":"main_file"}],"publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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.","article_processing_charge":"No"},{"page":"279-300","OA_type":"hybrid","_id":"19744","publisher":"Springer Nature","day":"01","citation":{"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.","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>","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>.","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.","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>","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>.","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."},"tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"has_accepted_license":"1","conference":{"location":"Hamilton, ON, Canada","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems","end_date":"2025-05-08","start_date":"2025-05-03"},"type":"conference","volume":15697,"oa":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"abstract":[{"lang":"eng","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."}],"language":[{"iso":"eng"}],"date_updated":"2025-06-02T11:16:13Z","department":[{"_id":"KrCh"}],"publication_status":"published","ec_funded":1,"date_published":"2025-05-01T00:00:00Z","corr_author":"1","status":"public","month":"05","year":"2025","author":[{"orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee"},{"orcid":"0000-0002-8595-0587","id":"103b4fa0-896a-11ed-bdf8-87b697bef40d","full_name":"Kafshdar Goharshadi, Ehsan","first_name":"Ehsan","last_name":"Kafshdar Goharshadi"},{"first_name":"Petr","last_name":"Novotný","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotný, Petr"},{"orcid":"0000-0002-4681-1699","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde","first_name":"Dorde","last_name":"Zikelic"}],"intvolume":"     15697","publication_identifier":{"isbn":["9783031906527"],"issn":["0302-9743"],"eissn":["1611-3349"]},"date_created":"2025-05-25T22:17:10Z","arxiv":1,"file_date_updated":"2025-06-02T11:13:49Z","external_id":{"arxiv":["2501.06579"]},"doi":"10.1007/978-3-031-90653-4_14","oa_version":"Published Version","ddc":["000"],"file":[{"relation":"main_file","file_size":532181,"checksum":"7dcd85e7e753bfa994c10b3cf9ebc185","success":1,"file_id":"19773","content_type":"application/pdf","creator":"dernst","date_updated":"2025-06-02T11:13:49Z","date_created":"2025-06-02T11:13:49Z","file_name":"2025_TACAS_Chatterjee_Goharshadi.pdf","access_level":"open_access"}],"OA_place":"publisher","title":"Refuting equivalence in probabilistic programs with conditioning","quality_controlled":"1","scopus_import":"1","alternative_title":["LNCS"],"article_processing_charge":"No","publication":"31st International Conference on Tools and Algorithms for the Construction and Analysis of Systems","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."},{"abstract":[{"text":"Artifact to reproduce the experimental results presented in the article \"Sound Statistical Model Checking for Probabilities and Expected Rewards\" by Carlos E. Budde, Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft (TACAS 2025).\r\n\r\nThe contents include all data and software (formal models, software tools, Python & bash scripts) used in the experimental evaluation presented in sections 3, 4, and 6 of the article. Detailed instructions on how to reproduce the results are bundled in the artifact.","lang":"eng"}],"date_updated":"2025-06-02T09:45:41Z","type":"research_data_reference","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"title":"Sound statistical model checking for probabilities and expected rewards (experimental reproduction package)","ddc":["000"],"doi":"10.5281/ZENODO.14602066","citation":{"short":"C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, (2025).","ama":"Budde C, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>","mla":"Budde, Carlos, et al. <i>Sound Statistical Model Checking for Probabilities and Expected Rewards (Experimental Reproduction Package)</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>.","ista":"Budde C, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. 2025. Sound statistical model checking for probabilities and expected rewards (experimental reproduction package), Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14602066\">10.5281/ZENODO.14602066</a>.","apa":"Budde, C., Hartmanns, A., Meggendorfer, T., Weininger, M., &#38; Wienhöft, P. (2025). Sound statistical model checking for probabilities and expected rewards (experimental reproduction package). Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14602066\">https://doi.org/10.5281/ZENODO.14602066</a>","chicago":"Budde, Carlos, Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger, and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and Expected Rewards (Experimental Reproduction Package).” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14602066\">https://doi.org/10.5281/ZENODO.14602066</a>.","ieee":"C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft, “Sound statistical model checking for probabilities and expected rewards (experimental reproduction package).” Zenodo, 2025."},"oa_version":"Published Version","OA_place":"repository","related_material":{"record":[{"status":"public","id":"19742","relation":"used_in_publication"}]},"author":[{"last_name":"Budde","first_name":"Carlos","full_name":"Budde, Carlos"},{"full_name":"Hartmanns, Arnd","last_name":"Hartmanns","first_name":"Arnd"},{"last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1","full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165"},{"id":"02ab0197-cc70-11ed-ab61-918e71f56881","full_name":"Weininger, Maximilian","first_name":"Maximilian","last_name":"Weininger"},{"full_name":"Wienhöft, Patrick","first_name":"Patrick","last_name":"Wienhöft"}],"day":"07","publisher":"Zenodo","date_created":"2025-06-02T09:37:14Z","_id":"19769","month":"01","status":"public","year":"2025","date_published":"2025-01-07T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.14602066"}],"OA_type":"green","department":[{"_id":"KrCh"}]},{"main_file_link":[{"open_access":"1","url":"https://doi.org/10.5281/ZENODO.14626585"}],"date_published":"2025-01-09T00:00:00Z","OA_type":"green","department":[{"_id":"KrCh"}],"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"19743"}]},"author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Tim","last_name":"Quatmann","full_name":"Quatmann, Tim"},{"first_name":"Maximilian","last_name":"Schäffeler","full_name":"Schäffeler, Maximilian"},{"full_name":"Weininger, Maximilian","id":"02ab0197-cc70-11ed-ab61-918e71f56881","last_name":"Weininger","first_name":"Maximilian"},{"full_name":"Winkler, Tobias","first_name":"Tobias","last_name":"Winkler"},{"full_name":"Zilken, Daniel","id":"d8ebc24a-3f98-11f0-9044-8296d4f39ab3","last_name":"Zilken","first_name":"Daniel"}],"day":"09","publisher":"Zenodo","date_created":"2025-06-02T10:13:24Z","_id":"19771","month":"01","status":"public","year":"2025","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"title":"Artifact: Fixed point certificates for reachability and expected rewards in MDPs","ddc":["000"],"doi":"10.5281/ZENODO.14626585","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs</i>. Zenodo, 2025, doi:<a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>.","ama":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. Artifact: Fixed point certificates for reachability and expected rewards in MDPs. 2025. doi:<a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>","short":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken, (2025).","chicago":"Chatterjee, Krishnendu, Tim Quatmann, Maximilian Schäffeler, Maximilian Weininger, Tobias Winkler, and Daniel Zilken. “Artifact: Fixed Point Certificates for Reachability and Expected Rewards in MDPs.” Zenodo, 2025. <a href=\"https://doi.org/10.5281/ZENODO.14626585\">https://doi.org/10.5281/ZENODO.14626585</a>.","ieee":"K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, and D. Zilken, “Artifact: Fixed point certificates for reachability and expected rewards in MDPs.” Zenodo, 2025.","apa":"Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T., &#38; Zilken, D. (2025). Artifact: Fixed point certificates for reachability and expected rewards in MDPs. Zenodo. <a href=\"https://doi.org/10.5281/ZENODO.14626585\">https://doi.org/10.5281/ZENODO.14626585</a>","ista":"Chatterjee K, Quatmann T, Schäffeler M, Weininger M, Winkler T, Zilken D. 2025. Artifact: Fixed point certificates for reachability and expected rewards in MDPs, Zenodo, <a href=\"https://doi.org/10.5281/ZENODO.14626585\">10.5281/ZENODO.14626585</a>."},"oa_version":"Published Version","OA_place":"repository","abstract":[{"text":"This artifact allows to review and reproduce the Isabelle proofs and practical experiments from the paper *Fixed Point Certificates for Reachability and Expected Rewards in MDPs*.\r\nThe contents are two-fold:\r\nFirst, the artifact contains a formally verified certificate checker for the certificates presented in the paper.\r\nThe formal Isabelle/HOL proofs of the background theory can be inspected, checked by Isabelle and the code extraction can be retraced.\r\n\r\nSecond, the artifact contains a modified version of the model checking tool `Storm` with support for certificate generation. Together with the provided scripts and benchmark files, this allows to reproduce the experiments from the paper.\r\nAn appropriate subset of the experiments is given to allow a review in a timely manner. In addition, original logfiles from our experiments are provided, allowing a detailed inspection.\r\n\r\nThe package includes convenient installation scripts for [the TACAS 2023 VM](https://doi.org/10.5281/zenodo.7113223) (based on Ubuntu 22.04).\r\nA native installation on Linux or macOS systems (including the newer ARM-based machines) is also possible.","lang":"eng"}],"date_updated":"2025-06-02T10:55:35Z","article_processing_charge":"No","type":"research_data_reference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1},{"publisher":"Springer Nature","day":"23","_id":"19776","article_type":"original","OA_type":"hybrid","date_updated":"2025-09-30T12:43:41Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We use the circle method to prove that a density 1 of elements in Fq[t] are representable as a sum of three cubes of essentially minimal degree from Fq[t], assuming the Ratios Conjecture and that char(Fq)>3. Roughly speaking, to do so, we upgrade an order of magnitude result to a full asymptotic formula that was conjectured by Hooley in the number field setting."}],"project":[{"_id":"bd8a4fdc-d553-11ed-ba76-80a0167441a3","grant_number":"P36278","name":"Rational curves via function field analytic number theory"},{"name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","grant_number":"101034413","call_identifier":"H2020"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa":1,"type":"journal_article","volume":310,"article_number":"65","issue":"4","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"ista":"Browning TD, Glas J, Wang V. 2025. Optimal sums of three cubes in Fq[t]. Mathematische Zeitschrift. 310(4), 65.","apa":"Browning, T. D., Glas, J., &#38; Wang, V. (2025). Optimal sums of three cubes in Fq[t]. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-025-03765-z\">https://doi.org/10.1007/s00209-025-03765-z</a>","chicago":"Browning, Timothy D, Jakob Glas, and Victor Wang. “Optimal Sums of Three Cubes in Fq[T].” <i>Mathematische Zeitschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00209-025-03765-z\">https://doi.org/10.1007/s00209-025-03765-z</a>.","ieee":"T. D. Browning, J. Glas, and V. Wang, “Optimal sums of three cubes in Fq[t],” <i>Mathematische Zeitschrift</i>, vol. 310, no. 4. Springer Nature, 2025.","short":"T.D. Browning, J. Glas, V. Wang, Mathematische Zeitschrift 310 (2025).","ama":"Browning TD, Glas J, Wang V. Optimal sums of three cubes in Fq[t]. <i>Mathematische Zeitschrift</i>. 2025;310(4). doi:<a href=\"https://doi.org/10.1007/s00209-025-03765-z\">10.1007/s00209-025-03765-z</a>","mla":"Browning, Timothy D., et al. “Optimal Sums of Three Cubes in Fq[T].” <i>Mathematische Zeitschrift</i>, vol. 310, no. 4, 65, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00209-025-03765-z\">10.1007/s00209-025-03765-z</a>."},"arxiv":1,"date_created":"2025-06-03T07:30:21Z","isi":1,"publication_identifier":{"issn":["0025-5874"],"eissn":["1432-1823"]},"intvolume":"       310","author":[{"first_name":"Timothy D","last_name":"Browning","orcid":"0000-0002-8314-0177","full_name":"Browning, Timothy D","id":"35827D50-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Glas, Jakob","id":"d6423cba-dc74-11ea-a0a7-ee61689ff5fb","first_name":"Jakob","last_name":"Glas"},{"full_name":"Wang, Victor","id":"76096395-aea4-11ed-a680-ab8ebbd3f1b9","orcid":"0000-0002-0704-7026","last_name":"Wang","first_name":"Victor"}],"year":"2025","month":"05","status":"public","corr_author":"1","date_published":"2025-05-23T00:00:00Z","ec_funded":1,"publication_status":"published","department":[{"_id":"TiBr"}],"acknowledgement":"We thank Alexandra Florea for discussions on cubic Gauss sums over function fields, in addition to the anonymous referee for helpful comments. While working on this paper the first two authors were supported by a FWF grant (DOI 10.55776/P36278) and the third author was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. Open access funding provided by Institute of Science and Technology (IST Austria).","publication":"Mathematische Zeitschrift","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","quality_controlled":"1","title":"Optimal sums of three cubes in Fq[t]","OA_place":"publisher","file":[{"relation":"main_file","content_type":"application/pdf","file_id":"19782","creator":"dernst","file_size":461622,"checksum":"6f71e25740c28257bf89b8bf116c2b4d","success":1,"file_name":"2025_MathZeitschrift_Browning.pdf","access_level":"open_access","date_updated":"2025-06-03T08:28:14Z","date_created":"2025-06-03T08:28:14Z"}],"ddc":["510"],"oa_version":"Published Version","file_date_updated":"2025-06-03T08:28:14Z","external_id":{"isi":["001494367000001"],"arxiv":["2408.03668 "]},"doi":"10.1007/s00209-025-03765-z"},{"title":"Adeno-associated viral tools to trace neural development and connectivity across amphibians","acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"quality_controlled":"1","scopus_import":"1","external_id":{"pmid":["39603234"],"isi":["001444798600001"]},"file_date_updated":"2025-06-04T05:43:27Z","doi":"10.1016/j.devcel.2024.10.025","oa_version":"Published Version","ddc":["570"],"file":[{"file_id":"19790","content_type":"application/pdf","creator":"dernst","file_size":11936258,"success":1,"checksum":"a83a4cb58f5941096d3ad91ca0172594","file_name":"2025_DevelopmentalCell_Jaeger.pdf","access_level":"open_access","date_updated":"2025-06-04T05:43:27Z","date_created":"2025-06-04T05:43:27Z","relation":"main_file"}],"OA_place":"publisher","publication":"Developmental Cell","pmid":1,"acknowledgement":"We thank members of the Sweeney, Tosches, Shein-Idelson, Yamaguchi, Kelley, and Cline Labs for their contributions to this project, discussion, and support. We additionally thank the Beckman Institute CLOVER Center and Viviana Gradinaru (Caltech), Kimberly Ritola (UNC NeuroTools), and Flavia Gomez-Leite (ISTA Viral Core) for AAV production and consultation; Andras Simon and Alberto Joven (Karolinska Institute) for feedback; Elizabeth Bagnato-Cohen (Columbia) for project coordination; our animal care and imaging facilities; the amphibian stock centers (NXR, EXRC, and XenopusExpress); and our funding sources: NSF IOS 2110086 (D.B.K., L.B.S., M.A.T., A.Y., and H.T.C.); US-Israel Binational Science Foundation (BSF) 2020702 (M.S.-I.); FTI Strategy Lower Austria Dissertation FT121-D-046 (D.V.); Horizon Europe ERC Starting Grant 101041551 and Special Research Programme (SFB) of the Austrian Science Fund (FWF) project F7814-B (L.B.S.); NIH grant R35GM146973, Rita Allen Foundation Award GA_032522_FE, and CZI Ben Barres Early Career Acceleration Award 2023-331758 (M.A.T.); EMBO Long-Term Fellowship ALTF 874-2021 (A.D.); and NSF GRFP DGE 2036197 (E.C.B.J.).","article_processing_charge":"Yes (via OA deal)","date_published":"2025-03-10T00:00:00Z","corr_author":"1","department":[{"_id":"LoSw"},{"_id":"MaDe"},{"_id":"GaNo"}],"publication_status":"published","author":[{"full_name":"Jaeger, Eliza C.B.","last_name":"Jaeger","first_name":"Eliza C.B."},{"first_name":"David","last_name":"Vijatovic","id":"cf391e77-ec3c-11ea-a124-d69323410b58","full_name":"Vijatovic, David"},{"first_name":"Astrid","last_name":"Deryckere","full_name":"Deryckere, Astrid"},{"full_name":"Zorin, Nikol","first_name":"Nikol","last_name":"Zorin"},{"last_name":"Nguyen","first_name":"Akemi L.","full_name":"Nguyen, Akemi L."},{"first_name":"Georgiy","last_name":"Ivanian","id":"eaf2b366-cfd1-11ee-bbdf-c8790f800a05","full_name":"Ivanian, Georgiy"},{"full_name":"Woych, Jamie","last_name":"Woych","first_name":"Jamie"},{"last_name":"Arnold","first_name":"Rebecca C","id":"d6cce458-14c9-11ed-a755-c1c8fc6fde6f","full_name":"Arnold, Rebecca C"},{"last_name":"Ortega Gurrola","first_name":"Alonso","full_name":"Ortega Gurrola, Alonso"},{"full_name":"Shvartsman, Arik","last_name":"Shvartsman","first_name":"Arik"},{"first_name":"Francesca","last_name":"Barbieri","id":"a9492887-8972-11ed-ae7b-bfae10998254","full_name":"Barbieri, Francesca"},{"full_name":"Toma, Florina-Alexandra","id":"85dd99f2-15b2-11ec-abd3-d1ae4d57f3b5","last_name":"Toma","first_name":"Florina-Alexandra"},{"full_name":"Gorbsky, Gary J.","last_name":"Gorbsky","first_name":"Gary J."},{"full_name":"Horb, Marko E.","last_name":"Horb","first_name":"Marko E."},{"last_name":"Cline","first_name":"Hollis T.","full_name":"Cline, Hollis T."},{"last_name":"Shay","first_name":"Timothy F.","full_name":"Shay, Timothy F."},{"full_name":"Kelley, Darcy B.","last_name":"Kelley","first_name":"Darcy B."},{"full_name":"Yamaguchi, Ayako","last_name":"Yamaguchi","first_name":"Ayako"},{"full_name":"Shein-Idelson, Mark","last_name":"Shein-Idelson","first_name":"Mark"},{"full_name":"Tosches, Maria Antonietta","last_name":"Tosches","first_name":"Maria Antonietta"},{"last_name":"Sweeney","first_name":"Lora Beatrice Jaeger","id":"56BE8254-C4F0-11E9-8E45-0B23E6697425","full_name":"Sweeney, Lora Beatrice Jaeger","orcid":"0000-0001-9242-5601"}],"intvolume":"        60","publication_identifier":{"issn":["1534-5807"],"eissn":["1878-1551"]},"date_created":"2024-02-20T09:20:32Z","isi":1,"status":"public","month":"03","year":"2025","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"issue":"5","citation":{"mla":"Jaeger, Eliza C. B., et al. “Adeno-Associated Viral Tools to Trace Neural Development and Connectivity across Amphibians.” <i>Developmental Cell</i>, vol. 60, no. 5, Elsevier, 2025, p. 794–812.e6, doi:<a href=\"https://doi.org/10.1016/j.devcel.2024.10.025\">10.1016/j.devcel.2024.10.025</a>.","short":"E.C.B. Jaeger, D. Vijatovic, A. Deryckere, N. Zorin, A.L. Nguyen, G. Ivanian, J. Woych, R.C. Arnold, A. Ortega Gurrola, A. Shvartsman, F. Barbieri, F.-A. Toma, G.J. Gorbsky, M.E. Horb, H.T. Cline, T.F. Shay, D.B. Kelley, A. Yamaguchi, M. Shein-Idelson, M.A. Tosches, L.B. Sweeney, Developmental Cell 60 (2025) 794–812.e6.","ama":"Jaeger ECB, Vijatovic D, Deryckere A, et al. Adeno-associated viral tools to trace neural development and connectivity across amphibians. <i>Developmental Cell</i>. 2025;60(5):794-812.e6. doi:<a href=\"https://doi.org/10.1016/j.devcel.2024.10.025\">10.1016/j.devcel.2024.10.025</a>","apa":"Jaeger, E. C. B., Vijatovic, D., Deryckere, A., Zorin, N., Nguyen, A. L., Ivanian, G., … Sweeney, L. B. (2025). Adeno-associated viral tools to trace neural development and connectivity across amphibians. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2024.10.025\">https://doi.org/10.1016/j.devcel.2024.10.025</a>","ieee":"E. C. B. Jaeger <i>et al.</i>, “Adeno-associated viral tools to trace neural development and connectivity across amphibians,” <i>Developmental Cell</i>, vol. 60, no. 5. Elsevier, p. 794–812.e6, 2025.","chicago":"Jaeger, Eliza C.B., David Vijatovic, Astrid Deryckere, Nikol Zorin, Akemi L. Nguyen, Georgiy Ivanian, Jamie Woych, et al. “Adeno-Associated Viral Tools to Trace Neural Development and Connectivity across Amphibians.” <i>Developmental Cell</i>. Elsevier, 2025. <a href=\"https://doi.org/10.1016/j.devcel.2024.10.025\">https://doi.org/10.1016/j.devcel.2024.10.025</a>.","ista":"Jaeger ECB, Vijatovic D, Deryckere A, Zorin N, Nguyen AL, Ivanian G, Woych J, Arnold RC, Ortega Gurrola A, Shvartsman A, Barbieri F, Toma F-A, Gorbsky GJ, Horb ME, Cline HT, Shay TF, Kelley DB, Yamaguchi A, Shein-Idelson M, Tosches MA, Sweeney LB. 2025. Adeno-associated viral tools to trace neural development and connectivity across amphibians. Developmental Cell. 60(5), 794–812.e6."},"abstract":[{"text":"Amphibians, by virtue of their phylogenetic position, provide invaluable insights on nervous system evolution, development, and remodeling. The genetic toolkit for amphibians, however, remains limited. Recombinant adeno-associated viral vectors (AAVs) are a powerful alternative to transgenesis for labeling and manipulating neurons. Although successful in mammals, AAVs have never been shown to transduce amphibian cells efficiently. We screened AAVs in three amphibian species—the frogs Xenopus laevis and Pelophylax bedriagae and the salamander Pleurodeles waltl—and identified at least two AAV serotypes per species that transduce neurons. In developing amphibians, AAVs labeled groups of neurons generated at the same time during development. In the mature brain, AAVrg retrogradely traced long-range projections. Our study introduces AAVs as a tool for amphibian research, establishes a generalizable workflow for AAV screening in new species, and expands opportunities for cross-species comparisons of nervous system development, function, and evolution.","lang":"eng"}],"language":[{"iso":"eng"}],"date_updated":"2025-09-30T10:00:55Z","volume":60,"type":"journal_article","oa":1,"project":[{"_id":"bd73af52-d553-11ed-ba76-912049f0ac7a","grant_number":"FTI21-D-046","name":"Development of V1 interneuron diversity during swim-to-walk transition of Xenopus metamorphosis"},{"name":"Development and Evolution of Tetrapod Motor Circuits","_id":"ebb66355-77a9-11ec-83b8-b8ac210a4dae","grant_number":"101041551"},{"name":"Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb transition: cell type to connection diversity","_id":"8da85f50-16d5-11f0-9cad-eab8b0ff6c9e","grant_number":"F7814"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","OA_type":"hybrid","page":"794-812.e6","day":"10","publisher":"Elsevier","_id":"15016","article_type":"original"},{"OA_type":"green","page":"881-894","related_material":{"record":[{"status":"public","id":"13236","relation":"earlier_version"}]},"publisher":"Springer Nature","day":"01","article_type":"original","_id":"15121","citation":{"ista":"Zheng DW, Henzinger M. 2025. Multiplicative auction algorithm for approximate maximum weight bipartite matching. Mathematical Programming. 210, 881–894.","apa":"Zheng, D. W., &#38; Henzinger, M. (2025). Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>","chicago":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s10107-024-02066-3\">https://doi.org/10.1007/s10107-024-02066-3</a>.","ieee":"D. W. Zheng and M. Henzinger, “Multiplicative auction algorithm for approximate maximum weight bipartite matching,” <i>Mathematical Programming</i>, vol. 210. Springer Nature, pp. 881–894, 2025.","short":"D.W. Zheng, M. Henzinger, Mathematical Programming 210 (2025) 881–894.","ama":"Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum weight bipartite matching. <i>Mathematical Programming</i>. 2025;210:881-894. doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>","mla":"Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for Approximate Maximum Weight Bipartite Matching.” <i>Mathematical Programming</i>, vol. 210, Springer Nature, 2025, pp. 881–94, doi:<a href=\"https://doi.org/10.1007/s10107-024-02066-3\">10.1007/s10107-024-02066-3</a>."},"abstract":[{"lang":"eng","text":"We present an auction algorithm using multiplicative instead of constant weight updates to compute a (1-E)-approximate maximum weight matching (MWM) in a bipartite graph with n vertices and m edges in time 0(mE-1), beating the running time of the fastest known approximation algorithm of Duan and Pettie [JACM ’14] that runs in 0(mE-1 log E-1). Our algorithm is very simple and it can be extended to give a dynamic data structure that maintains a (1-E)-approximate maximum weight matching under (1) one-sided vertex deletions (with incident edges) and (2) one-sided vertex insertions (with incident edges sorted by weight) to the other side. The total time time used is 0(mE-1), where m is the sum of the number of initially existing and inserted edges."}],"language":[{"iso":"eng"}],"date_updated":"2025-09-09T12:39:58Z","type":"journal_article","volume":210,"oa":1,"project":[{"name":"The design and evaluation of modern fully dynamic data structures","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","call_identifier":"H2020"},{"name":"Fast Algorithms for a Reactive Network Layer","grant_number":"P33775","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.09217"}],"date_published":"2025-03-01T00:00:00Z","corr_author":"1","department":[{"_id":"MoHe"}],"publication_status":"published","author":[{"full_name":"Zheng, Da Wei","first_name":"Da Wei","last_name":"Zheng"},{"orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger"}],"intvolume":"       210","publication_identifier":{"issn":["0025-5610"],"eissn":["1436-4646"]},"isi":1,"date_created":"2024-03-17T23:00:58Z","arxiv":1,"status":"public","month":"03","year":"2025","title":"Multiplicative auction algorithm for approximate maximum weight bipartite matching","quality_controlled":"1","scopus_import":"1","oa_version":"Preprint","doi":"10.1007/s10107-024-02066-3","external_id":{"isi":["001176048100003"],"arxiv":["2301.09217"]},"OA_place":"repository","publication":"Mathematical Programming","acknowledgement":"The first author thanks Chandra Chekuri for useful discussions about this paper. This work was done in part at the University of Vienna. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.","article_processing_charge":"No"},{"doi":"10.1214/23-AIHP1438","oa_version":"Preprint","external_id":{"isi":["001427953600004"],"arxiv":["2301.01712"]},"OA_place":"repository","quality_controlled":"1","title":"Mesoscopic eigenvalue statistics for Wigner-type matrices","scopus_import":"1","article_processing_charge":"No","publication":"Annales de l'institut Henri Poincare (B) Probability and Statistics","acknowledgement":"I would like to express my gratitude to László Erdős for suggesting the project and supervising my work. I am also thankful to Yuanyuan Xu and Oleksii Kolupaiev for many helpful discussions. Furthermore, I am grateful to Guillaume Dubach for translating the abstract into French.\r\nThe author was supported by the ERC Advanced Grant “RMTBeyond” No. 101020331.","department":[{"_id":"GradSch"},{"_id":"LaEr"}],"publication_status":"published","date_published":"2025-02-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2301.01712"}],"ec_funded":1,"corr_author":"1","month":"02","status":"public","year":"2025","intvolume":"        61","publication_identifier":{"issn":["0246-0203"]},"author":[{"full_name":"Riabov, Volodymyr","id":"1949f904-edfb-11eb-afb5-e2dfddabb93b","first_name":"Volodymyr","last_name":"Riabov"}],"arxiv":1,"date_created":"2024-03-20T09:41:04Z","isi":1,"citation":{"ama":"Riabov V. Mesoscopic eigenvalue statistics for Wigner-type matrices. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. 2025;61(1):129-154. doi:<a href=\"https://doi.org/10.1214/23-AIHP1438\">10.1214/23-AIHP1438</a>","short":"V. Riabov, Annales de l’institut Henri Poincare (B) Probability and Statistics 61 (2025) 129–154.","mla":"Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 61, no. 1, Institute of Mathematical Statistics, 2025, pp. 129–54, doi:<a href=\"https://doi.org/10.1214/23-AIHP1438\">10.1214/23-AIHP1438</a>.","ista":"Riabov V. 2025. Mesoscopic eigenvalue statistics for Wigner-type matrices. Annales de l’institut Henri Poincare (B) Probability and Statistics. 61(1), 129–154.","chicago":"Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics, 2025. <a href=\"https://doi.org/10.1214/23-AIHP1438\">https://doi.org/10.1214/23-AIHP1438</a>.","ieee":"V. Riabov, “Mesoscopic eigenvalue statistics for Wigner-type matrices,” <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>, vol. 61, no. 1. Institute of Mathematical Statistics, pp. 129–154, 2025.","apa":"Riabov, V. (2025). Mesoscopic eigenvalue statistics for Wigner-type matrices. <i>Annales de l’institut Henri Poincare (B) Probability and Statistics</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/23-AIHP1438\">https://doi.org/10.1214/23-AIHP1438</a>"},"issue":"1","type":"journal_article","volume":61,"project":[{"grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We prove a universal mesoscopic central limit theorem for linear eigenvalue statistics of a Wigner-type matrix inside the bulk of the spectrum with compactly supported twice continuously differentiable test functions. The main novel ingredient is an optimal local law for the two-point function $T(z,\\zeta)$  and a general class of related quantities involving two resolvents at nearby spectral parameters."},{"text":"On établit un théorème limite central universel pour les statistiques linéaires mésoscopiques des valeurs propres d’une matrice de type Wigner au milieu du spectre, avec des fonctions de classe \r\n et à support compact. La principale nouveauté de cette approche est qu’elle repose sur une loi locale optimale pour la fonction à deux points $T(z,\\zeta)$ , ainsi que pour une classe plus générale d’observables impliquant deux résolvantes évaluées en des paramètres proches.","lang":"fre"}],"date_updated":"2025-05-19T13:54:31Z","page":"129-154","OA_type":"green","article_type":"original","_id":"15128","day":"01","publisher":"Institute of Mathematical Statistics"},{"arxiv":1,"date_created":"2021-09-13T12:17:10Z","publication_identifier":{"eissn":["1945-743X"],"issn":["0022-040X"]},"intvolume":"       130","author":[{"first_name":"Sebastian","last_name":"Hensel","orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","full_name":"Hensel, Sebastian"},{"full_name":"Laux, Tim","last_name":"Laux","first_name":"Tim"}],"year":"2025","month":"05","status":"public","corr_author":"1","main_file_link":[{"url":"https://arxiv.org/abs/2109.04233","open_access":"1"}],"date_published":"2025-05-01T00:00:00Z","ec_funded":1,"publication_status":"published","department":[{"_id":"JuFi"}],"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 No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged.","publication":"Journal of Differential Geometry","article_processing_charge":"No","scopus_import":"1","quality_controlled":"1","title":"A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness","OA_place":"repository","external_id":{"arxiv":["2109.04233"]},"oa_version":"Preprint","doi":"10.4310/jdg/1747065796","publisher":"International Press","day":"01","_id":"10011","article_type":"original","OA_type":"green","page":"209-268","date_updated":"2025-05-28T09:27:05Z","language":[{"iso":"eng"}],"abstract":[{"lang":"eng","text":"We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow-is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle."}],"project":[{"call_identifier":"H2020","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","grant_number":"948819","name":"Bridging Scales in Random Materials"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"volume":130,"type":"journal_article","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"],"citation":{"short":"S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268.","ama":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. <i>Journal of Differential Geometry</i>. 2025;130:209-268. doi:<a href=\"https://doi.org/10.4310/jdg/1747065796\">10.4310/jdg/1747065796</a>","mla":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.” <i>Journal of Differential Geometry</i>, vol. 130, International Press, 2025, pp. 209–68, doi:<a href=\"https://doi.org/10.4310/jdg/1747065796\">10.4310/jdg/1747065796</a>.","ista":"Hensel S, Laux T. 2025. A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. Journal of Differential Geometry. 130, 209–268.","apa":"Hensel, S., &#38; Laux, T. (2025). A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness. <i>Journal of Differential Geometry</i>. International Press. <a href=\"https://doi.org/10.4310/jdg/1747065796\">https://doi.org/10.4310/jdg/1747065796</a>","ieee":"S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of  the Allen-Cahn equation and weak-strong uniqueness,” <i>Journal of Differential Geometry</i>, vol. 130. International Press, pp. 209–268, 2025.","chicago":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of  the Allen-Cahn Equation and Weak-Strong Uniqueness.” <i>Journal of Differential Geometry</i>. International Press, 2025. <a href=\"https://doi.org/10.4310/jdg/1747065796\">https://doi.org/10.4310/jdg/1747065796</a>."}}]