---
OA_place: publisher
OA_type: hybrid
_id: '19729'
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.'
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).
article_number: A5
article_processing_charge: No
article_type: original
author:
- first_name: Annalisa
full_name: De Leo, Annalisa
last_name: De Leo
- first_name: Stefano
full_name: Brizzolara, Stefano
id: 4bbe33b8-c59a-11ee-a1af-fa33d1ac42c4
last_name: Brizzolara
- first_name: Mattia
full_name: Cavaiola, Mattia
last_name: Cavaiola
- first_name: Junlin
full_name: He, Junlin
last_name: He
- first_name: Alessandro
full_name: Stocchino, Alessandro
last_name: Stocchino
citation:
ama: De Leo A, Brizzolara S, Cavaiola M, He J, Stocchino A. Rigid fibre transport
in a periodic non-homogeneous geophysical turbulent flow. Journal of Fluid
Mechanics. 2025;1011. doi:10.1017/jfm.2025.362
apa: 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. Cambridge University Press. https://doi.org/10.1017/jfm.2025.362
chicago: De Leo, Annalisa, Stefano Brizzolara, Mattia Cavaiola, Junlin He, and Alessandro
Stocchino. “Rigid Fibre Transport in a Periodic Non-Homogeneous Geophysical Turbulent
Flow.” Journal of Fluid Mechanics. Cambridge University Press, 2025. https://doi.org/10.1017/jfm.2025.362.
ieee: A. De Leo, S. Brizzolara, M. Cavaiola, J. He, and A. Stocchino, “Rigid fibre
transport in a periodic non-homogeneous geophysical turbulent flow,” Journal
of Fluid Mechanics, vol. 1011. Cambridge University Press, 2025.
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.” Journal of Fluid Mechanics, vol. 1011, A5,
Cambridge University Press, 2025, doi:10.1017/jfm.2025.362.
short: A. De Leo, S. Brizzolara, M. Cavaiola, J. He, A. Stocchino, Journal of Fluid
Mechanics 1011 (2025).
date_created: 2025-05-25T22:16:46Z
date_published: 2025-05-16T00:00:00Z
date_updated: 2025-09-30T12:38:34Z
day: '16'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1017/jfm.2025.362
ec_funded: 1
external_id:
isi:
- '001489159700001'
file:
- access_level: open_access
checksum: f1b0f6a977fdf2d6eb9e16c11d030c0c
content_type: application/pdf
creator: dernst
date_created: 2025-05-28T08:12:07Z
date_updated: 2025-05-28T08:12:07Z
file_id: '19751'
file_name: 2025_JourFluidMech_DeLeo.pdf
file_size: 6415303
relation: main_file
success: 1
file_date_updated: 2025-05-28T08:12:07Z
has_accepted_license: '1'
intvolume: ' 1011'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- 1469-7645
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rigid fibre transport in a periodic non-homogeneous geophysical turbulent flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1011
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19730'
abstract:
- lang: eng
text: Feigenbaum universality is shown to occur in subcritical shear flows. Our
testing ground is the counter-rotation regime of the Taylor–Couette flow, where
numerical calculations are performed within a small periodic domain. The accurate
computation of up to the seventh period-doubling bifurcation, assisted by a purposely
defined Poincaré section, has enabled us to reproduce the two Feigenbaum universal
constants with unprecedented accuracy in a fluid flow problem. We have further
devised a method to predict the bifurcation diagram up to the accumulation point
of the cascade based on the detailed inspection of just the first few period-doubling
bifurcations. Remarkably, the method is applicable beyond the accumulation point,
with predictions remaining valid, in a statistical sense, for the chaotic dynamics
that follows.
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.
article_number: A36
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Baoying
full_name: Wang, Baoying
id: df755ffe-735a-11ee-bb55-dff29d61d338
last_name: Wang
orcid: 0000-0002-6229-0336
- first_name: Roger
full_name: Ayats López, Roger
id: ab77522d-073b-11ed-8aff-e71b39258362
last_name: Ayats López
orcid: 0000-0001-6572-0621
- first_name: K.
full_name: Deguchi, K.
last_name: Deguchi
- first_name: A.
full_name: Meseguer, A.
last_name: Meseguer
- first_name: F.
full_name: Mellibovsky, F.
last_name: Mellibovsky
citation:
ama: Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. Feigenbaum universality
in subcritical Taylor-Couette flow. Journal of Fluid Mechanics. 2025;1010.
doi:10.1017/jfm.2025.278
apa: Wang, B., Ayats López, R., Deguchi, K., Meseguer, A., & Mellibovsky, F.
(2025). Feigenbaum universality in subcritical Taylor-Couette flow. Journal
of Fluid Mechanics. Cambridge University Press. https://doi.org/10.1017/jfm.2025.278
chicago: Wang, Baoying, Roger Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky.
“Feigenbaum Universality in Subcritical Taylor-Couette Flow.” Journal of Fluid
Mechanics. Cambridge University Press, 2025. https://doi.org/10.1017/jfm.2025.278.
ieee: B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, and F. Mellibovsky, “Feigenbaum
universality in subcritical Taylor-Couette flow,” Journal of Fluid Mechanics,
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.
mla: Wang, Baoying, et al. “Feigenbaum Universality in Subcritical Taylor-Couette
Flow.” Journal of Fluid Mechanics, vol. 1010, A36, Cambridge University
Press, 2025, doi:10.1017/jfm.2025.278.
short: B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, F. Mellibovsky, Journal
of Fluid Mechanics 1010 (2025).
date_created: 2025-05-25T22:16:48Z
date_published: 2025-05-14T00:00:00Z
date_updated: 2025-09-30T12:39:05Z
day: '14'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1017/jfm.2025.278
ec_funded: 1
external_id:
isi:
- '001487354900001'
file:
- access_level: open_access
checksum: 77f39b762a0e59e88954afb93b23cc7a
content_type: application/pdf
creator: dernst
date_created: 2025-05-28T08:32:33Z
date_updated: 2025-05-28T08:32:33Z
file_id: '19752'
file_name: 2025_JourFluidMech_Wang.pdf
file_size: 3607069
relation: main_file
success: 1
file_date_updated: 2025-05-28T08:32:33Z
has_accepted_license: '1'
intvolume: ' 1010'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 942a0200-16d5-11f0-9cad-f48ab22dfd1c
grant_number: ESP 1481224
name: Pattern Formation Mechanisms in Planar Shear Flows
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- 1469-7645
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Feigenbaum universality in subcritical Taylor-Couette flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1010
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19731'
abstract:
- lang: eng
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."
article_processing_charge: Yes
article_type: editorial
author:
- first_name: Aiswarya
full_name: Rayaroth Puthiyaveettil, Aiswarya
id: 8aceb01b-8972-11ed-ae7b-d5fe53775add
last_name: Rayaroth Puthiyaveettil
- first_name: Christine
full_name: Fiedler, Christine
id: bd3fceba-dc74-11ea-a0a7-c17f71817366
last_name: Fiedler
- first_name: Maria
full_name: Ibáñez, Maria
id: 43C61214-F248-11E8-B48F-1D18A9856A87
last_name: Ibáñez
orcid: 0000-0001-5013-2843
citation:
ama: 'Rayaroth Puthiyaveettil A, Fiedler C, Ibáñez M. Let us FIGURE it out: Why
do scientists still make “bad” figures? ACS Materials Au. 2025;5(3):438-440.
doi:10.1021/acsmaterialsau.5c00037'
apa: 'Rayaroth Puthiyaveettil, A., Fiedler, C., & Ibáñez, M. (2025). Let us
FIGURE it out: Why do scientists still make “bad” figures? ACS Materials Au.
American Chemical Society. https://doi.org/10.1021/acsmaterialsau.5c00037'
chicago: 'Rayaroth Puthiyaveettil, Aiswarya, Christine Fiedler, and Maria Ibáñez.
“Let Us FIGURE It out: Why Do Scientists Still Make ‘Bad’ Figures?” ACS Materials
Au. American Chemical Society, 2025. https://doi.org/10.1021/acsmaterialsau.5c00037.'
ieee: 'A. Rayaroth Puthiyaveettil, C. Fiedler, and M. Ibáñez, “Let us FIGURE it
out: Why do scientists still make ‘bad’ figures?,” ACS Materials Au, vol.
5, no. 3. American Chemical Society, pp. 438–440, 2025.'
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.'
mla: 'Rayaroth Puthiyaveettil, Aiswarya, et al. “Let Us FIGURE It out: Why Do Scientists
Still Make ‘Bad’ Figures?” ACS Materials Au, vol. 5, no. 3, American Chemical
Society, 2025, pp. 438–40, doi:10.1021/acsmaterialsau.5c00037.'
short: A. Rayaroth Puthiyaveettil, C. Fiedler, M. Ibáñez, ACS Materials Au 5 (2025)
438–440.
corr_author: '1'
date_created: 2025-05-25T22:16:51Z
date_published: 2025-05-14T00:00:00Z
date_updated: 2025-06-11T13:23:01Z
day: '14'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1021/acsmaterialsau.5c00037
external_id:
pmid:
- '40385955'
file:
- access_level: open_access
checksum: a3aa15e4022fa359d6ba5afb96268841
content_type: application/pdf
creator: dernst
date_created: 2025-05-28T08:48:38Z
date_updated: 2025-05-28T08:48:38Z
file_id: '19753'
file_name: 2025_ACSMaterialsAu_Rayaroth.pdf
file_size: 1750018
relation: main_file
success: 1
file_date_updated: 2025-05-28T08:48:38Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '05'
oa: 1
oa_version: Published Version
page: 438-440
pmid: 1
publication: ACS Materials Au
publication_identifier:
eissn:
- 2694-2461
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Let us FIGURE it out: Why do scientists still make “bad” figures?'
tmp:
image: /images/cc_by_nc_nd.png
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)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19732'
abstract:
- lang: eng
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.
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.
article_number: R2
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Baoying
full_name: Wang, Baoying
id: df755ffe-735a-11ee-bb55-dff29d61d338
last_name: Wang
orcid: 0000-0002-6229-0336
- first_name: Roger
full_name: Ayats López, Roger
id: ab77522d-073b-11ed-8aff-e71b39258362
last_name: Ayats López
orcid: 0000-0001-6572-0621
- first_name: K.
full_name: Deguchi, K.
last_name: Deguchi
- first_name: A.
full_name: Meseguer, A.
last_name: Meseguer
- first_name: F.
full_name: Mellibovsky, F.
last_name: Mellibovsky
citation:
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. Journal of Fluid Mechanics. 2025;1011. doi:10.1017/jfm.2025.151
apa: 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. Cambridge
University Press. https://doi.org/10.1017/jfm.2025.151
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.” Journal of Fluid Mechanics. Cambridge University
Press, 2025. https://doi.org/10.1017/jfm.2025.151.
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,” Journal of Fluid Mechanics, vol. 1011. Cambridge University Press,
2025.
ista: Wang B, Ayats López R, Deguchi K, Meseguer A, Mellibovsky F. 2025. Mathematically
established chaos and forecast of statistics with recurrent patterns in Taylor-Couette
flow. Journal of Fluid Mechanics. 1011, R2.
mla: Wang, Baoying, et al. “Mathematically Established Chaos and Forecast of Statistics
with Recurrent Patterns in Taylor-Couette Flow.” Journal of Fluid Mechanics,
vol. 1011, R2, Cambridge University Press, 2025, doi:10.1017/jfm.2025.151.
short: B. Wang, R. Ayats López, K. Deguchi, A. Meseguer, F. Mellibovsky, Journal
of Fluid Mechanics 1011 (2025).
date_created: 2025-05-25T22:16:52Z
date_published: 2025-05-13T00:00:00Z
date_updated: 2025-09-30T12:39:44Z
day: '13'
ddc:
- '530'
department:
- _id: BjHo
doi: 10.1017/jfm.2025.151
ec_funded: 1
external_id:
isi:
- '001486096600001'
file:
- access_level: open_access
checksum: 899df5797844a9e811dffeebe8c05c8e
content_type: application/pdf
creator: dernst
date_created: 2025-05-28T09:00:52Z
date_updated: 2025-05-28T09:00:52Z
file_id: '19754'
file_name: 2025_JourFluidMech_Wang_Ayats.pdf
file_size: 998754
relation: main_file
success: 1
file_date_updated: 2025-05-28T09:00:52Z
has_accepted_license: '1'
intvolume: ' 1011'
isi: 1
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 942a0200-16d5-11f0-9cad-f48ab22dfd1c
grant_number: ESP 1481224
name: Pattern Formation Mechanisms in Planar Shear Flows
publication: Journal of Fluid Mechanics
publication_identifier:
eissn:
- 1469-7645
issn:
- 0022-1120
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mathematically established chaos and forecast of statistics with recurrent
patterns in Taylor-Couette flow
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1011
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19733'
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.
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_number: L050402
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Daniel
full_name: Kun, Daniel
last_name: Kun
- first_name: Karl T
full_name: Strömberg, Karl T
id: 68011cd2-da32-11ee-a930-b2774c7aba5f
last_name: Strömberg
- first_name: Michele
full_name: Spagnolo, Michele
last_name: Spagnolo
- first_name: Borivoje
full_name: Dakić, Borivoje
last_name: Dakić
- first_name: Lee A.
full_name: Rozema, Lee A.
last_name: Rozema
- first_name: Philip
full_name: Walther, Philip
last_name: Walther
citation:
ama: Kun D, Strömberg KT, Spagnolo M, Dakić B, Rozema LA, Walther P. Direct and
efficient detection of quantum superposition. Physical Review A. 2025;111(5).
doi:10.1103/PhysRevA.111.L050402
apa: Kun, D., Strömberg, K. T., Spagnolo, M., Dakić, B., Rozema, L. A., & Walther,
P. (2025). Direct and efficient detection of quantum superposition. Physical
Review A. American Physical Society. https://doi.org/10.1103/PhysRevA.111.L050402
chicago: Kun, Daniel, Karl T Strömberg, Michele Spagnolo, Borivoje Dakić, Lee A.
Rozema, and Philip Walther. “Direct and Efficient Detection of Quantum Superposition.”
Physical Review A. American Physical Society, 2025. https://doi.org/10.1103/PhysRevA.111.L050402.
ieee: D. Kun, K. T. Strömberg, M. Spagnolo, B. Dakić, L. A. Rozema, and P. Walther,
“Direct and efficient detection of quantum superposition,” Physical Review
A, vol. 111, no. 5. American Physical Society, 2025.
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.
mla: Kun, Daniel, et al. “Direct and Efficient Detection of Quantum Superposition.”
Physical Review A, vol. 111, no. 5, L050402, American Physical Society,
2025, doi:10.1103/PhysRevA.111.L050402.
short: D. Kun, K.T. Strömberg, M. Spagnolo, B. Dakić, L.A. Rozema, P. Walther, Physical
Review A 111 (2025).
date_created: 2025-05-25T22:16:54Z
date_published: 2025-05-16T00:00:00Z
date_updated: 2025-09-30T12:40:18Z
day: '16'
ddc:
- '530'
department:
- _id: OnHo
doi: 10.1103/PhysRevA.111.L050402
external_id:
arxiv:
- '2405.08065'
isi:
- '001501941500006'
file:
- access_level: open_access
checksum: b83295a8f597b7781d8e7bfa3b393b42
content_type: application/pdf
creator: dernst
date_created: 2025-05-28T09:16:03Z
date_updated: 2025-05-28T09:16:03Z
file_id: '19755'
file_name: 2025_PhysReviewA_Kun.pdf
file_size: 571784
relation: main_file
success: 1
file_date_updated: 2025-05-28T09:16:03Z
has_accepted_license: '1'
intvolume: ' 111'
isi: 1
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Physical Review A
publication_identifier:
eissn:
- 2469-9934
issn:
- 2469-9926
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Direct and efficient detection of quantum superposition
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 111
year: '2025'
...
---
OA_type: closed access
_id: '19736'
abstract:
- lang: eng
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.'
article_number: e113018
article_processing_charge: No
article_type: review
author:
- first_name: Steffen
full_name: Vanneste, Steffen
last_name: Vanneste
- first_name: Yuanrong
full_name: Pei, Yuanrong
id: 98605edc-6ce7-11ee-95f3-cc16b866efcd
last_name: Pei
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Vanneste S, Pei Y, Friml J. Mechanisms of auxin action in plant growth and
development. Nature Reviews Molecular Cell Biology. 2025. doi:10.1038/s41580-025-00851-2
apa: Vanneste, S., Pei, Y., & Friml, J. (2025). Mechanisms of auxin action in
plant growth and development. Nature Reviews Molecular Cell Biology. Springer
Nature. https://doi.org/10.1038/s41580-025-00851-2
chicago: Vanneste, Steffen, Yuanrong Pei, and Jiří Friml. “Mechanisms of Auxin Action
in Plant Growth and Development.” Nature Reviews Molecular Cell Biology.
Springer Nature, 2025. https://doi.org/10.1038/s41580-025-00851-2.
ieee: S. Vanneste, Y. Pei, and J. Friml, “Mechanisms of auxin action in plant growth
and development,” Nature Reviews Molecular Cell Biology. Springer Nature,
2025.
ista: Vanneste S, Pei Y, Friml J. 2025. Mechanisms of auxin action in plant growth
and development. Nature Reviews Molecular Cell Biology., e113018.
mla: Vanneste, Steffen, et al. “Mechanisms of Auxin Action in Plant Growth and Development.”
Nature Reviews Molecular Cell Biology, e113018, Springer Nature, 2025,
doi:10.1038/s41580-025-00851-2.
short: S. Vanneste, Y. Pei, J. Friml, Nature Reviews Molecular Cell Biology (2025).
corr_author: '1'
date_created: 2025-05-25T22:16:57Z
date_published: 2025-05-19T00:00:00Z
date_updated: 2025-09-30T12:41:30Z
day: '19'
department:
- _id: JiFr
doi: 10.1038/s41580-025-00851-2
external_id:
isi:
- '001490500500001'
pmid:
- '40389696'
isi: 1
language:
- iso: eng
month: '05'
oa_version: None
pmid: 1
publication: Nature Reviews Molecular Cell Biology
publication_identifier:
eissn:
- 1471-0080
issn:
- 1471-0072
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mechanisms of auxin action in plant growth and development
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19737'
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.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). Supported by ERC Advanced Grant “RMTBeyond” No. 101020331.
article_number: '050603'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Hong Chang
full_name: Ji, Hong Chang
last_name: Ji
citation:
ama: Cipolloni G, Erdös L, Ji HC. Non–Hermitian spectral universality at critical
points. Probability Theory and Related Fields. 2025. doi:10.1007/s00440-025-01384-7
apa: Cipolloni, G., Erdös, L., & Ji, H. C. (2025). Non–Hermitian spectral universality
at critical points. Probability Theory and Related Fields. Springer Nature.
https://doi.org/10.1007/s00440-025-01384-7
chicago: Cipolloni, Giorgio, László Erdös, and Hong Chang Ji. “Non–Hermitian Spectral
Universality at Critical Points.” Probability Theory and Related Fields.
Springer Nature, 2025. https://doi.org/10.1007/s00440-025-01384-7.
ieee: G. Cipolloni, L. Erdös, and H. C. Ji, “Non–Hermitian spectral universality
at critical points,” Probability Theory and Related Fields. Springer Nature,
2025.
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.” Probability Theory and Related Fields, 050603, Springer Nature,
2025, doi:10.1007/s00440-025-01384-7.
short: G. Cipolloni, L. Erdös, H.C. Ji, Probability Theory and Related Fields (2025).
corr_author: '1'
date_created: 2025-05-25T22:16:59Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2025-09-30T12:41:58Z
day: '01'
department:
- _id: LaEr
doi: 10.1007/s00440-025-01384-7
ec_funded: 1
external_id:
isi:
- '001493091900001'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/s00440-025-01384-7
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Probability Theory and Related Fields
publication_identifier:
eissn:
- 1432-2064
issn:
- 0178-8051
publication_status: epub_ahead
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Non–Hermitian spectral universality at critical points
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '19738'
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."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Anasuya
full_name: Acharya, Anasuya
last_name: Acharya
- first_name: Karen
full_name: Azari, Karen
last_name: Azari
- first_name: Mirza Ahad
full_name: Baig, Mirza Ahad
id: 3EDE6DE4-AA5A-11E9-986D-341CE6697425
last_name: Baig
- first_name: Dennis
full_name: Hofheinz, Dennis
last_name: Hofheinz
- first_name: Chethan
full_name: Kamath, Chethan
last_name: Kamath
citation:
ama: 'Acharya A, Azari K, Baig MA, Hofheinz D, Kamath C. Securely instantiating
‘Half Gates’ garbling in the standard model. In: 28th IACR International Conference
on Practice and Theory of Public-Key Cryptography. Vol 15677. Springer Nature;
2025:37-75. doi:10.1007/978-3-031-91829-2_2'
apa: 'Acharya, A., Azari, K., Baig, M. A., Hofheinz, D., & Kamath, C. (2025).
Securely instantiating ‘Half Gates’ garbling in the standard model. In 28th
IACR International Conference on Practice and Theory of Public-Key Cryptography
(Vol. 15677, pp. 37–75). Roros, Norway: Springer Nature. https://doi.org/10.1007/978-3-031-91829-2_2'
chicago: Acharya, Anasuya, Karen Azari, Mirza Ahad Baig, Dennis Hofheinz, and Chethan
Kamath. “Securely Instantiating ‘Half Gates’ Garbling in the Standard Model.”
In 28th IACR International Conference on Practice and Theory of Public-Key
Cryptography, 15677:37–75. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-91829-2_2.
ieee: A. Acharya, K. Azari, M. A. Baig, D. Hofheinz, and C. Kamath, “Securely instantiating
‘Half Gates’ garbling in the standard model,” in 28th IACR International Conference
on Practice and Theory of Public-Key Cryptography, Roros, Norway, 2025, vol.
15677, pp. 37–75.
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.'
mla: Acharya, Anasuya, et al. “Securely Instantiating ‘Half Gates’ Garbling in the Standard
Model.” 28th IACR International Conference on Practice and Theory of Public-Key
Cryptography, vol. 15677, Springer Nature, 2025, pp. 37–75, doi:10.1007/978-3-031-91829-2_2.
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.
conference:
end_date: 2025-05-15
location: Roros, Norway
name: 'PKC: Public-Key Cryptography'
start_date: 2025-05-12
date_created: 2025-05-25T22:17:02Z
date_published: 2025-05-05T00:00:00Z
date_updated: 2025-06-02T07:01:45Z
day: '05'
department:
- _id: KrPi
- _id: GradSch
doi: 10.1007/978-3-031-91829-2_2
intvolume: ' 15677'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2025/281
month: '05'
oa: 1
oa_version: Preprint
page: 37-75
publication: 28th IACR International Conference on Practice and Theory of Public-Key
Cryptography
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031918285'
issn:
- 0302-9743
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Securely instantiating ‘Half Gates’ garbling in the standard model
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15677
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19739'
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."
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).
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Cedric
full_name: Richter, Cedric
last_name: Richter
citation:
ama: 'Chalupa M, Richter C. BUBAAK: Dynamic cooperative verification. In: 31st
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems. Vol 15698. Springer Nature; 2025:212-216. doi:10.1007/978-3-031-90660-2_14'
apa: 'Chalupa, M., & Richter, C. (2025). BUBAAK: Dynamic cooperative verification.
In 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (Vol. 15698, pp. 212–216). Hamilton, ON, Canada: Springer
Nature. https://doi.org/10.1007/978-3-031-90660-2_14'
chicago: 'Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.”
In 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, 15698:212–16. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90660-2_14.'
ieee: 'M. Chalupa and C. Richter, “BUBAAK: Dynamic cooperative verification,” in
31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15698, pp. 212–216.'
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.'
mla: 'Chalupa, Marek, and Cedric Richter. “BUBAAK: Dynamic Cooperative Verification.”
31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, vol. 15698, Springer Nature, 2025, pp. 212–16, doi:10.1007/978-3-031-90660-2_14.'
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.
conference:
end_date: 2025-05-08
location: Hamilton, ON, Canada
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2025-05-03
corr_author: '1'
date_created: 2025-05-25T22:17:04Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-06-02T07:21:41Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-90660-2_14
ec_funded: 1
file:
- access_level: open_access
checksum: 3f604f25dbe37383acb7f8308aad3ca6
content_type: application/pdf
creator: dernst
date_created: 2025-06-02T07:10:35Z
date_updated: 2025-06-02T07:10:35Z
file_id: '19766'
file_name: 2025_TACAS_Chalupa.pdf
file_size: 259050
relation: main_file
success: 1
file_date_updated: 2025-06-02T07:10:35Z
has_accepted_license: '1'
intvolume: ' 15698'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 212-216
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031906596'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'BUBAAK: Dynamic cooperative verification'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15698
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19740'
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.
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant and Austrian Science Fund (FWF) 10.55776/COE12 grant.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Mahdi
full_name: Jafariraviz, Mahdi
last_name: Jafariraviz
- first_name: Raimundo J
full_name: Saona Urmeneta, Raimundo J
id: BD1DF4C4-D767-11E9-B658-BC13E6697425
last_name: Saona Urmeneta
orcid: 0000-0001-5103-038X
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Chatterjee K, Jafariraviz M, Saona Urmeneta RJ, Svoboda J. Value iteration
with guessing for Markov chains and Markov decision processes. In: 31st International
Conference on Tools and Algorithms for the Construction and Analysis of Systems.
Vol 15697. Springer Nature; 2025:217-236. doi:10.1007/978-3-031-90653-4_11'
apa: 'Chatterjee, K., Jafariraviz, M., Saona Urmeneta, R. J., & Svoboda, J.
(2025). Value iteration with guessing for Markov chains and Markov decision processes.
In 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (Vol. 15697, pp. 217–236). Hamilton, ON, Canada: Springer
Nature. https://doi.org/10.1007/978-3-031-90653-4_11'
chicago: Chatterjee, Krishnendu, Mahdi Jafariraviz, Raimundo J Saona Urmeneta, and
Jakub Svoboda. “Value Iteration with Guessing for Markov Chains and Markov Decision
Processes.” In 31st International Conference on Tools and Algorithms for the
Construction and Analysis of Systems, 15697:217–36. Springer Nature, 2025.
https://doi.org/10.1007/978-3-031-90653-4_11.
ieee: K. Chatterjee, M. Jafariraviz, R. J. Saona Urmeneta, and J. Svoboda, “Value
iteration with guessing for Markov chains and Markov decision processes,” in 31st
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems, 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.” 31st International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, vol. 15697, Springer
Nature, 2025, pp. 217–36, doi:10.1007/978-3-031-90653-4_11.
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.
conference:
end_date: 2025-05-08
location: Hamilton, ON, Canada
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2025-05-03
corr_author: '1'
date_created: 2025-05-25T22:17:06Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-06-02T07:35:06Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-90653-4_11
ec_funded: 1
external_id:
arxiv:
- '2505.06769'
file:
- access_level: open_access
checksum: 45da6efbcbed20aada16c48c8e55e2d6
content_type: application/pdf
creator: dernst
date_created: 2025-06-02T07:31:12Z
date_updated: 2025-06-02T07:31:12Z
file_id: '19767'
file_name: 2025_TACAS_Chatterjee.pdf
file_size: 557481
relation: main_file
success: 1
file_date_updated: 2025-06-02T07:31:12Z
has_accepted_license: '1'
intvolume: ' 15697'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 217-236
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031906527'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Value iteration with guessing for Markov chains and Markov decision processes
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15697
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19742'
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.
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).
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Carlos E.
full_name: Budde, Carlos E.
last_name: Budde
- first_name: Arnd
full_name: Hartmanns, Arnd
last_name: Hartmanns
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
- first_name: Patrick
full_name: Wienhöft, Patrick
last_name: Wienhöft
citation:
ama: 'Budde CE, Hartmanns A, Meggendorfer T, Weininger M, Wienhöft P. Sound statistical
model checking for probabilities and expected rewards. In: 31st International
Conference on Tools and Algorithms for the Construction and Analysis of Systems.
Vol 15696. Springer Nature; 2025:167-190. doi:10.1007/978-3-031-90643-5_9'
apa: 'Budde, C. E., Hartmanns, A., Meggendorfer, T., Weininger, M., & Wienhöft,
P. (2025). Sound statistical model checking for probabilities and expected rewards.
In 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems (Vol. 15696, pp. 167–190). Hamilton, ON, Canada: Springer
Nature. https://doi.org/10.1007/978-3-031-90643-5_9'
chicago: Budde, Carlos E., Arnd Hartmanns, Tobias Meggendorfer, Maximilian Weininger,
and Patrick Wienhöft. “Sound Statistical Model Checking for Probabilities and
Expected Rewards.” In 31st International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, 15696:167–90. Springer Nature,
2025. https://doi.org/10.1007/978-3-031-90643-5_9.
ieee: C. E. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, and P. Wienhöft,
“Sound statistical model checking for probabilities and expected rewards,” in
31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15696, pp. 167–190.
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.'
mla: Budde, Carlos E., et al. “Sound Statistical Model Checking for Probabilities
and Expected Rewards.” 31st International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, vol. 15696, Springer Nature,
2025, pp. 167–90, doi:10.1007/978-3-031-90643-5_9.
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.
conference:
end_date: 2025-05-08
location: Hamilton, ON, Canada
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2025-05-03
date_created: 2025-05-25T22:17:08Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-06-02T09:45:41Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-90643-5_9
ec_funded: 1
external_id:
arxiv:
- '2411.00559'
file:
- access_level: open_access
checksum: d45856b503b1dd4f8f14c3566327225b
content_type: application/pdf
creator: dernst
date_created: 2025-06-02T09:35:42Z
date_updated: 2025-06-02T09:35:42Z
file_id: '19770'
file_name: 2025_TACAS_Budde.pdf
file_size: 711271
relation: main_file
success: 1
file_date_updated: 2025-06-02T09:35:42Z
has_accepted_license: '1'
intvolume: ' 15696'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 167-190
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031906428'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '19769'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Sound statistical model checking for probabilities and expected rewards
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15696
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19743'
abstract:
- lang: eng
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.
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.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tim
full_name: Quatmann, Tim
last_name: Quatmann
- first_name: Maximilian
full_name: Schäffeler, Maximilian
last_name: Schäffeler
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
- first_name: Tobias
full_name: Winkler, Tobias
last_name: Winkler
- first_name: Daniel
full_name: Zilken, Daniel
id: d8ebc24a-3f98-11f0-9044-8296d4f39ab3
last_name: Zilken
citation:
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: 31st
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems. Vol 15697. Springer Nature; 2025:130-151. doi:10.1007/978-3-031-90653-4_7'
apa: 'Chatterjee, K., Quatmann, T., Schäffeler, M., Weininger, M., Winkler, T.,
& Zilken, D. (2025). Fixed point certificates for reachability and expected
rewards in MDPs. In 31st International Conference on Tools and Algorithms for
the Construction and Analysis of Systems (Vol. 15697, pp. 130–151). Hamilton,
ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_7'
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 31st International Conference on Tools and
Algorithms for the Construction and Analysis of Systems, 15697:130–51. Springer
Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_7.
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 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems, Hamilton, ON, Canada, 2025, vol. 15697, pp. 130–151.
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.'
mla: Chatterjee, Krishnendu, et al. “Fixed Point Certificates for Reachability and
Expected Rewards in MDPs.” 31st International Conference on Tools and Algorithms
for the Construction and Analysis of Systems, vol. 15697, Springer Nature,
2025, pp. 130–51, doi:10.1007/978-3-031-90653-4_7.
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.
conference:
end_date: 2025-05-08
location: Hamilton, ON, Canada
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2025-05-03
corr_author: '1'
date_created: 2025-05-25T22:17:09Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-06-02T10:55:34Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-90653-4_7
ec_funded: 1
external_id:
arxiv:
- '2501.11467'
file:
- access_level: open_access
checksum: 64b7f46ef05649b87b827248045c7645
content_type: application/pdf
creator: dernst
date_created: 2025-06-02T10:49:52Z
date_updated: 2025-06-02T10:49:52Z
file_id: '19772'
file_name: 2025_TACAS_ChatterjeeKrish.pdf
file_size: 732136
relation: main_file
success: 1
file_date_updated: 2025-06-02T10:49:52Z
has_accepted_license: '1'
intvolume: ' 15697'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 130-151
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031906527'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '19771'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Fixed point certificates for reachability and expected rewards in MDPs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15697
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19744'
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.
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.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan
full_name: Kafshdar Goharshadi, Ehsan
id: 103b4fa0-896a-11ed-bdf8-87b697bef40d
last_name: Kafshdar Goharshadi
orcid: 0000-0002-8595-0587
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Chatterjee K, Goharshady E, Novotný P, Zikelic D. Refuting equivalence in
probabilistic programs with conditioning. In: 31st International Conference
on Tools and Algorithms for the Construction and Analysis of Systems. Vol
15697. Springer Nature; 2025:279-300. doi:10.1007/978-3-031-90653-4_14'
apa: 'Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2025). Refuting
equivalence in probabilistic programs with conditioning. In 31st International
Conference on Tools and Algorithms for the Construction and Analysis of Systems
(Vol. 15697, pp. 279–300). Hamilton, ON, Canada: Springer Nature. https://doi.org/10.1007/978-3-031-90653-4_14'
chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic.
“Refuting Equivalence in Probabilistic Programs with Conditioning.” In 31st
International Conference on Tools and Algorithms for the Construction and Analysis
of Systems, 15697:279–300. Springer Nature, 2025. https://doi.org/10.1007/978-3-031-90653-4_14.
ieee: K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Refuting equivalence
in probabilistic programs with conditioning,” in 31st International Conference
on Tools and Algorithms for the Construction and Analysis of Systems, Hamilton,
ON, Canada, 2025, vol. 15697, pp. 279–300.
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.'
mla: Chatterjee, Krishnendu, et al. “Refuting Equivalence in Probabilistic Programs
with Conditioning.” 31st International Conference on Tools and Algorithms for
the Construction and Analysis of Systems, vol. 15697, Springer Nature, 2025,
pp. 279–300, doi:10.1007/978-3-031-90653-4_14.
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.
conference:
end_date: 2025-05-08
location: Hamilton, ON, Canada
name: 'TACAS: Tools and Algorithms for the Construction and Analysis of Systems'
start_date: 2025-05-03
corr_author: '1'
date_created: 2025-05-25T22:17:10Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-06-02T11:16:13Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-90653-4_14
ec_funded: 1
external_id:
arxiv:
- '2501.06579'
file:
- access_level: open_access
checksum: 7dcd85e7e753bfa994c10b3cf9ebc185
content_type: application/pdf
creator: dernst
date_created: 2025-06-02T11:13:49Z
date_updated: 2025-06-02T11:13:49Z
file_id: '19773'
file_name: 2025_TACAS_Chatterjee_Goharshadi.pdf
file_size: 532181
relation: main_file
success: 1
file_date_updated: 2025-06-02T11:13:49Z
has_accepted_license: '1'
intvolume: ' 15697'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 279-300
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 31st International Conference on Tools and Algorithms for the Construction
and Analysis of Systems
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031906527'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Refuting equivalence in probabilistic programs with conditioning
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15697
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '19769'
abstract:
- lang: eng
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."
article_processing_charge: No
author:
- first_name: Carlos
full_name: Budde, Carlos
last_name: Budde
- first_name: Arnd
full_name: Hartmanns, Arnd
last_name: Hartmanns
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
- first_name: Patrick
full_name: Wienhöft, Patrick
last_name: Wienhöft
citation:
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:10.5281/ZENODO.14602066
apa: 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. https://doi.org/10.5281/ZENODO.14602066
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. https://doi.org/10.5281/ZENODO.14602066.
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.
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, 10.5281/ZENODO.14602066.
mla: Budde, Carlos, et al. Sound Statistical Model Checking for Probabilities
and Expected Rewards (Experimental Reproduction Package). Zenodo, 2025, doi:10.5281/ZENODO.14602066.
short: C. Budde, A. Hartmanns, T. Meggendorfer, M. Weininger, P. Wienhöft, (2025).
date_created: 2025-06-02T09:37:14Z
date_published: 2025-01-07T00:00:00Z
date_updated: 2025-06-02T09:45:41Z
day: '07'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.5281/ZENODO.14602066
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/ZENODO.14602066
month: '01'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '19742'
relation: used_in_publication
status: public
status: public
title: Sound statistical model checking for probabilities and expected rewards (experimental
reproduction package)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '19771'
abstract:
- lang: eng
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."
article_processing_charge: No
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Tim
full_name: Quatmann, Tim
last_name: Quatmann
- first_name: Maximilian
full_name: Schäffeler, Maximilian
last_name: Schäffeler
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
- first_name: Tobias
full_name: Winkler, Tobias
last_name: Winkler
- first_name: Daniel
full_name: Zilken, Daniel
id: d8ebc24a-3f98-11f0-9044-8296d4f39ab3
last_name: Zilken
citation:
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:10.5281/ZENODO.14626585'
apa: '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. https://doi.org/10.5281/ZENODO.14626585'
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. https://doi.org/10.5281/ZENODO.14626585.'
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.'
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, 10.5281/ZENODO.14626585.'
mla: 'Chatterjee, Krishnendu, et al. Artifact: Fixed Point Certificates for Reachability
and Expected Rewards in MDPs. Zenodo, 2025, doi:10.5281/ZENODO.14626585.'
short: K. Chatterjee, T. Quatmann, M. Schäffeler, M. Weininger, T. Winkler, D. Zilken,
(2025).
date_created: 2025-06-02T10:13:24Z
date_published: 2025-01-09T00:00:00Z
date_updated: 2025-06-02T10:55:35Z
day: '09'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.5281/ZENODO.14626585
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/ZENODO.14626585
month: '01'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '19743'
relation: used_in_publication
status: public
status: public
title: 'Artifact: Fixed point certificates for reachability and expected rewards in
MDPs'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19776'
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.
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).
article_number: '65'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Jakob
full_name: Glas, Jakob
id: d6423cba-dc74-11ea-a0a7-ee61689ff5fb
last_name: Glas
- first_name: Victor
full_name: Wang, Victor
id: 76096395-aea4-11ed-a680-ab8ebbd3f1b9
last_name: Wang
orcid: 0000-0002-0704-7026
citation:
ama: Browning TD, Glas J, Wang V. Optimal sums of three cubes in Fq[t]. Mathematische
Zeitschrift. 2025;310(4). doi:10.1007/s00209-025-03765-z
apa: Browning, T. D., Glas, J., & Wang, V. (2025). Optimal sums of three cubes
in Fq[t]. Mathematische Zeitschrift. Springer Nature. https://doi.org/10.1007/s00209-025-03765-z
chicago: Browning, Timothy D, Jakob Glas, and Victor Wang. “Optimal Sums of Three
Cubes in Fq[T].” Mathematische Zeitschrift. Springer Nature, 2025. https://doi.org/10.1007/s00209-025-03765-z.
ieee: T. D. Browning, J. Glas, and V. Wang, “Optimal sums of three cubes in Fq[t],”
Mathematische Zeitschrift, vol. 310, no. 4. Springer Nature, 2025.
ista: Browning TD, Glas J, Wang V. 2025. Optimal sums of three cubes in Fq[t]. Mathematische
Zeitschrift. 310(4), 65.
mla: Browning, Timothy D., et al. “Optimal Sums of Three Cubes in Fq[T].” Mathematische
Zeitschrift, vol. 310, no. 4, 65, Springer Nature, 2025, doi:10.1007/s00209-025-03765-z.
short: T.D. Browning, J. Glas, V. Wang, Mathematische Zeitschrift 310 (2025).
corr_author: '1'
date_created: 2025-06-03T07:30:21Z
date_published: 2025-05-23T00:00:00Z
date_updated: 2025-09-30T12:43:41Z
day: '23'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1007/s00209-025-03765-z
ec_funded: 1
external_id:
arxiv:
- '2408.03668 '
isi:
- '001494367000001'
file:
- access_level: open_access
checksum: 6f71e25740c28257bf89b8bf116c2b4d
content_type: application/pdf
creator: dernst
date_created: 2025-06-03T08:28:14Z
date_updated: 2025-06-03T08:28:14Z
file_id: '19782'
file_name: 2025_MathZeitschrift_Browning.pdf
file_size: 461622
relation: main_file
success: 1
file_date_updated: 2025-06-03T08:28:14Z
has_accepted_license: '1'
intvolume: ' 310'
isi: 1
issue: '4'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: bd8a4fdc-d553-11ed-ba76-80a0167441a3
grant_number: P36278
name: Rational curves via function field analytic number theory
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Mathematische Zeitschrift
publication_identifier:
eissn:
- 1432-1823
issn:
- 0025-5874
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal sums of three cubes in Fq[t]
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 310
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '15016'
abstract:
- lang: eng
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.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
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)
article_type: original
author:
- first_name: Eliza C.B.
full_name: Jaeger, Eliza C.B.
last_name: Jaeger
- first_name: David
full_name: Vijatovic, David
id: cf391e77-ec3c-11ea-a124-d69323410b58
last_name: Vijatovic
- first_name: Astrid
full_name: Deryckere, Astrid
last_name: Deryckere
- first_name: Nikol
full_name: Zorin, Nikol
last_name: Zorin
- first_name: Akemi L.
full_name: Nguyen, Akemi L.
last_name: Nguyen
- first_name: Georgiy
full_name: Ivanian, Georgiy
id: eaf2b366-cfd1-11ee-bbdf-c8790f800a05
last_name: Ivanian
- first_name: Jamie
full_name: Woych, Jamie
last_name: Woych
- first_name: Rebecca C
full_name: Arnold, Rebecca C
id: d6cce458-14c9-11ed-a755-c1c8fc6fde6f
last_name: Arnold
- first_name: Alonso
full_name: Ortega Gurrola, Alonso
last_name: Ortega Gurrola
- first_name: Arik
full_name: Shvartsman, Arik
last_name: Shvartsman
- first_name: Francesca
full_name: Barbieri, Francesca
id: a9492887-8972-11ed-ae7b-bfae10998254
last_name: Barbieri
- first_name: Florina-Alexandra
full_name: Toma, Florina-Alexandra
id: 85dd99f2-15b2-11ec-abd3-d1ae4d57f3b5
last_name: Toma
- first_name: Gary J.
full_name: Gorbsky, Gary J.
last_name: Gorbsky
- first_name: Marko E.
full_name: Horb, Marko E.
last_name: Horb
- first_name: Hollis T.
full_name: Cline, Hollis T.
last_name: Cline
- first_name: Timothy F.
full_name: Shay, Timothy F.
last_name: Shay
- first_name: Darcy B.
full_name: Kelley, Darcy B.
last_name: Kelley
- first_name: Ayako
full_name: Yamaguchi, Ayako
last_name: Yamaguchi
- first_name: Mark
full_name: Shein-Idelson, Mark
last_name: Shein-Idelson
- first_name: Maria Antonietta
full_name: Tosches, Maria Antonietta
last_name: Tosches
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
citation:
ama: Jaeger ECB, Vijatovic D, Deryckere A, et al. Adeno-associated viral tools to
trace neural development and connectivity across amphibians. Developmental
Cell. 2025;60(5):794-812.e6. doi:10.1016/j.devcel.2024.10.025
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. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2024.10.025
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.” Developmental
Cell. Elsevier, 2025. https://doi.org/10.1016/j.devcel.2024.10.025.
ieee: E. C. B. Jaeger et al., “Adeno-associated viral tools to trace neural
development and connectivity across amphibians,” Developmental Cell, vol.
60, no. 5. Elsevier, p. 794–812.e6, 2025.
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.
mla: Jaeger, Eliza C. B., et al. “Adeno-Associated Viral Tools to Trace Neural Development
and Connectivity across Amphibians.” Developmental Cell, vol. 60, no. 5,
Elsevier, 2025, p. 794–812.e6, doi:10.1016/j.devcel.2024.10.025.
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.
corr_author: '1'
date_created: 2024-02-20T09:20:32Z
date_published: 2025-03-10T00:00:00Z
date_updated: 2025-09-30T10:00:55Z
day: '10'
ddc:
- '570'
department:
- _id: LoSw
- _id: MaDe
- _id: GaNo
doi: 10.1016/j.devcel.2024.10.025
external_id:
isi:
- '001444798600001'
pmid:
- '39603234'
file:
- access_level: open_access
checksum: a83a4cb58f5941096d3ad91ca0172594
content_type: application/pdf
creator: dernst
date_created: 2025-06-04T05:43:27Z
date_updated: 2025-06-04T05:43:27Z
file_id: '19790'
file_name: 2025_DevelopmentalCell_Jaeger.pdf
file_size: 11936258
relation: main_file
success: 1
file_date_updated: 2025-06-04T05:43:27Z
has_accepted_license: '1'
intvolume: ' 60'
isi: 1
issue: '5'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 794-812.e6
pmid: 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
- _id: ebb66355-77a9-11ec-83b8-b8ac210a4dae
grant_number: '101041551'
name: Development and Evolution of Tetrapod Motor Circuits
- _id: 8da85f50-16d5-11f0-9cad-eab8b0ff6c9e
grant_number: F7814
name: 'Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb
transition: cell type to connection diversity'
publication: Developmental Cell
publication_identifier:
eissn:
- 1878-1551
issn:
- 1534-5807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Adeno-associated viral tools to trace neural development and connectivity across
amphibians
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 60
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '15121'
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.
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
article_type: original
arxiv: 1
author:
- first_name: Da Wei
full_name: Zheng, Da Wei
last_name: Zheng
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
citation:
ama: Zheng DW, Henzinger M. Multiplicative auction algorithm for approximate maximum
weight bipartite matching. Mathematical Programming. 2025;210:881-894.
doi:10.1007/s10107-024-02066-3
apa: Zheng, D. W., & Henzinger, M. (2025). Multiplicative auction algorithm
for approximate maximum weight bipartite matching. Mathematical Programming.
Springer Nature. https://doi.org/10.1007/s10107-024-02066-3
chicago: Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm
for Approximate Maximum Weight Bipartite Matching.” Mathematical Programming.
Springer Nature, 2025. https://doi.org/10.1007/s10107-024-02066-3.
ieee: D. W. Zheng and M. Henzinger, “Multiplicative auction algorithm for approximate
maximum weight bipartite matching,” Mathematical Programming, vol. 210.
Springer Nature, pp. 881–894, 2025.
ista: Zheng DW, Henzinger M. 2025. Multiplicative auction algorithm for approximate
maximum weight bipartite matching. Mathematical Programming. 210, 881–894.
mla: Zheng, Da Wei, and Monika Henzinger. “Multiplicative Auction Algorithm for
Approximate Maximum Weight Bipartite Matching.” Mathematical Programming,
vol. 210, Springer Nature, 2025, pp. 881–94, doi:10.1007/s10107-024-02066-3.
short: D.W. Zheng, M. Henzinger, Mathematical Programming 210 (2025) 881–894.
corr_author: '1'
date_created: 2024-03-17T23:00:58Z
date_published: 2025-03-01T00:00:00Z
date_updated: 2025-09-09T12:39:58Z
day: '01'
department:
- _id: MoHe
doi: 10.1007/s10107-024-02066-3
ec_funded: 1
external_id:
arxiv:
- '2301.09217'
isi:
- '001176048100003'
intvolume: ' 210'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2301.09217
month: '03'
oa: 1
oa_version: Preprint
page: 881-894
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Mathematical Programming
publication_identifier:
eissn:
- 1436-4646
issn:
- 0025-5610
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '13236'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Multiplicative auction algorithm for approximate maximum weight bipartite matching
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 210
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '15128'
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.
- lang: fre
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."
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."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Volodymyr
full_name: Riabov, Volodymyr
id: 1949f904-edfb-11eb-afb5-e2dfddabb93b
last_name: Riabov
citation:
ama: Riabov V. Mesoscopic eigenvalue statistics for Wigner-type matrices. Annales
de l’institut Henri Poincare (B) Probability and Statistics. 2025;61(1):129-154.
doi:10.1214/23-AIHP1438
apa: Riabov, V. (2025). Mesoscopic eigenvalue statistics for Wigner-type matrices.
Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute
of Mathematical Statistics. https://doi.org/10.1214/23-AIHP1438
chicago: Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.”
Annales de l’institut Henri Poincare (B) Probability and Statistics. Institute
of Mathematical Statistics, 2025. https://doi.org/10.1214/23-AIHP1438.
ieee: V. Riabov, “Mesoscopic eigenvalue statistics for Wigner-type matrices,” Annales
de l’institut Henri Poincare (B) Probability and Statistics, vol. 61, no.
1. Institute of Mathematical Statistics, pp. 129–154, 2025.
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.
mla: Riabov, Volodymyr. “Mesoscopic Eigenvalue Statistics for Wigner-Type Matrices.”
Annales de l’institut Henri Poincare (B) Probability and Statistics, vol.
61, no. 1, Institute of Mathematical Statistics, 2025, pp. 129–54, doi:10.1214/23-AIHP1438.
short: V. Riabov, Annales de l’institut Henri Poincare (B) Probability and Statistics
61 (2025) 129–154.
corr_author: '1'
date_created: 2024-03-20T09:41:04Z
date_published: 2025-02-01T00:00:00Z
date_updated: 2025-05-19T13:54:31Z
day: '01'
department:
- _id: GradSch
- _id: LaEr
doi: 10.1214/23-AIHP1438
ec_funded: 1
external_id:
arxiv:
- '2301.01712'
isi:
- '001427953600004'
intvolume: ' 61'
isi: 1
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2301.01712
month: '02'
oa: 1
oa_version: Preprint
page: 129-154
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Annales de l'institut Henri Poincare (B) Probability and Statistics
publication_identifier:
issn:
- 0246-0203
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mesoscopic eigenvalue statistics for Wigner-type matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 61
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '10011'
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.
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.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Sebastian
full_name: Hensel, Sebastian
id: 4D23B7DA-F248-11E8-B48F-1D18A9856A87
last_name: Hensel
orcid: 0000-0001-7252-8072
- first_name: Tim
full_name: Laux, Tim
last_name: Laux
citation:
ama: 'Hensel S, Laux T. A new varifold solution concept for mean curvature flow:
Convergence of the Allen-Cahn equation and weak-strong uniqueness. Journal
of Differential Geometry. 2025;130:209-268. doi:10.4310/jdg/1747065796'
apa: '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. International Press. https://doi.org/10.4310/jdg/1747065796'
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.”
Journal of Differential Geometry. International Press, 2025. https://doi.org/10.4310/jdg/1747065796.'
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,” Journal
of Differential Geometry, vol. 130. International Press, pp. 209–268, 2025.'
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.'
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.”
Journal of Differential Geometry, vol. 130, International Press, 2025,
pp. 209–68, doi:10.4310/jdg/1747065796.'
short: S. Hensel, T. Laux, Journal of Differential Geometry 130 (2025) 209–268.
corr_author: '1'
date_created: 2021-09-13T12:17:10Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-05-28T09:27:05Z
day: '01'
department:
- _id: JuFi
doi: 10.4310/jdg/1747065796
ec_funded: 1
external_id:
arxiv:
- '2109.04233'
intvolume: ' 130'
keyword:
- Mean curvature flow
- gradient flows
- varifolds
- weak solutions
- weak-strong uniqueness
- calibrated geometry
- gradient-flow calibrations
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2109.04233
month: '05'
oa: 1
oa_version: Preprint
page: 209-268
project:
- _id: 0aa76401-070f-11eb-9043-b5bb049fa26d
call_identifier: H2020
grant_number: '948819'
name: Bridging Scales in Random Materials
publication: Journal of Differential Geometry
publication_identifier:
eissn:
- 1945-743X
issn:
- 0022-040X
publication_status: published
publisher: International Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'A new varifold solution concept for mean curvature flow: Convergence of the
Allen-Cahn equation and weak-strong uniqueness'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 130
year: '2025'
...