---
OA_place: publisher
OA_type: hybrid
_id: '19595'
abstract:
- lang: eng
text: We investigate the locality of magnetic response in polycyclic aromatic molecules
using a novel deep-learning approach. Our method employs graph neural networks
(GNNs) with a graph-of-rings representation to predict nucleus independent chemical
shifts (NICS) in the space around the molecule. We train a series of models, each
time reducing the size of the largest molecules used in training. The accuracy
of prediction remains high (MAE < 0.5 ppm), even when training the model only
on molecules with up to four rings, thus providing strong evidence for the locality
of magnetic response. To overcome the known problem of generalization of GNNs,
we implement a k-hop expansion strategy and succeed in achieving accurate predictions
for molecules with up to 15 rings (almost 4 times the size of the largest training
example). Our findings have implications for understanding the magnetic response
in complex molecules and demonstrate a promising approach to overcoming GNN scalability
limitations. Furthermore, the trained models enable rapid characterization, without
the need for more expensive DFT calculations.
acknowledgement: The authors express their gratitude to Professor Dr. Peter Chen for
his continued support. The authors acknowledge the Branco Weiss Fellowship for supporting
this research as part of a Society in Science grant and the Israel Science Foundation
for financial support (Grant No. 1745/23 to R.G.-P.). R.G.-P. is a Branco Weiss
Fellow, a Horev Fellow, and an Alon Scholarship recipient. A.M.B. was supported
by the ERC StG EARS and the Israeli Science Foundation.
article_number: '144101'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Yair
full_name: Davidson, Yair
last_name: Davidson
- first_name: Aviad
full_name: Philipp, Aviad
last_name: Philipp
- first_name: Sabyasachi
full_name: Chakraborty, Sabyasachi
last_name: Chakraborty
- first_name: Alexander
full_name: Bronstein, Alexander
id: 58f3726e-7cba-11ef-ad8b-e6e8cb3904e6
last_name: Bronstein
orcid: 0000-0001-9699-8730
- first_name: Renana
full_name: Gershoni-Poranne, Renana
last_name: Gershoni-Poranne
citation:
ama: Davidson Y, Philipp A, Chakraborty S, Bronstein AM, Gershoni-Poranne R. How
local is “local”? Deep learning reveals locality of the induced magnetic field
of polycyclic aromatic hydrocarbons. Journal of Chemical Physics. 2025;162(14).
doi:10.1063/5.0257558
apa: Davidson, Y., Philipp, A., Chakraborty, S., Bronstein, A. M., & Gershoni-Poranne,
R. (2025). How local is “local”? Deep learning reveals locality of the induced
magnetic field of polycyclic aromatic hydrocarbons. Journal of Chemical Physics.
AIP Publishing. https://doi.org/10.1063/5.0257558
chicago: Davidson, Yair, Aviad Philipp, Sabyasachi Chakraborty, Alex M. Bronstein,
and Renana Gershoni-Poranne. “How Local Is ‘Local’? Deep Learning Reveals Locality
of the Induced Magnetic Field of Polycyclic Aromatic Hydrocarbons.” Journal
of Chemical Physics. AIP Publishing, 2025. https://doi.org/10.1063/5.0257558.
ieee: Y. Davidson, A. Philipp, S. Chakraborty, A. M. Bronstein, and R. Gershoni-Poranne,
“How local is ‘local’? Deep learning reveals locality of the induced magnetic
field of polycyclic aromatic hydrocarbons,” Journal of Chemical Physics,
vol. 162, no. 14. AIP Publishing, 2025.
ista: Davidson Y, Philipp A, Chakraborty S, Bronstein AM, Gershoni-Poranne R. 2025.
How local is “local”? Deep learning reveals locality of the induced magnetic field
of polycyclic aromatic hydrocarbons. Journal of Chemical Physics. 162(14), 144101.
mla: Davidson, Yair, et al. “How Local Is ‘Local’? Deep Learning Reveals Locality
of the Induced Magnetic Field of Polycyclic Aromatic Hydrocarbons.” Journal
of Chemical Physics, vol. 162, no. 14, 144101, AIP Publishing, 2025, doi:10.1063/5.0257558.
short: Y. Davidson, A. Philipp, S. Chakraborty, A.M. Bronstein, R. Gershoni-Poranne,
Journal of Chemical Physics 162 (2025).
corr_author: '1'
date_created: 2025-04-20T22:01:28Z
date_published: 2025-04-14T00:00:00Z
date_updated: 2026-09-14T07:44:59Z
day: '14'
ddc:
- '000'
department:
- _id: AlBr
doi: 10.1063/5.0257558
external_id:
isi:
- '001466311300030'
pmid:
- '40197568'
file:
- access_level: open_access
checksum: 20a31a4c506b52de863bab7d3ff989ef
content_type: application/pdf
creator: dernst
date_created: 2025-04-22T09:27:43Z
date_updated: 2025-04-22T09:27:43Z
file_id: '19606'
file_name: 2025_JourChemicalPhysics_Davidson.pdf
file_size: 7812182
relation: main_file
success: 1
file_date_updated: 2025-04-22T09:27:43Z
fulldoi: https://doi.org/10.1063/5.0257558
has_accepted_license: '1'
intvolume: ' 162'
isi: 1
issue: '14'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '04'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 1b39bd8c-ab3c-11f0-a172-a4c5bf64093b
grant_number: '863839'
name: Acoustics-based drone navigation and interaction
publication: Journal of Chemical Physics
publication_identifier:
eissn:
- 1089-7690
issn:
- 0021-9606
publication_status: published
publisher: AIP Publishing
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://gitlab.com/porannegroup/magnetic_locality
scopus_import: '1'
status: public
title: How local is “local”? Deep learning reveals locality of the induced magnetic
field of polycyclic aromatic hydrocarbons
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 162
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '17468'
abstract:
- lang: eng
text: Oxygen redox chemistry is central to life1 and many human-made technologies,
such as in energy storage2,3,4. The large energy gain from oxygen redox reactions
is often connected with the occurrence of harmful reactive oxygen species3,5,6.
Key species are superoxide and the highly reactive singlet oxygen3,4,5,6,7, which
may evolve from superoxide. However, the factors determining the formation of
singlet oxygen, rather than the relatively unreactive triplet oxygen, are unknown.
Here we report that the release of triplet or singlet oxygen is governed by individual
Marcus normal and inverted region behaviour. We found that as the driving force
for the reaction increases, the initially dominant evolution of triplet oxygen
slows down, and singlet oxygen evolution becomes predominant with higher maximum
kinetics. This behaviour also applies to the widely observed superoxide disproportionation,
in which one superoxide is oxidized by another, in both non-aqueous and aqueous
systems, with Lewis and Brønsted acidity controlling the driving forces. Singlet
oxygen yields governed by these conditions are relevant, for example, in batteries
or cellular organelles in which superoxide forms. Our findings suggest ways to
understand and control spin states and kinetics in oxygen redox chemistry, with
implications for fields, including life sciences, pure chemistry and energy storage.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: M-Shop
- _id: ScienComp
acknowledgement: S.A.F. thanks the Institute of Science and Technology Austria (ISTA)
for the support. The Scientific Service Units of ISTA supported this research through
resources provided by the Imaging and Optics Facility, the Lab Support Facility,
the Miba Machine Shop and Scientific Computing. This research was partly funded
by the Austrian Science Fund (FWF) (10.55776/P37169 and 10.55776/COE5). For open
access purposes, the author has applied for a CC BY public copyright licence to
any author-accepted manuscript version arising from this submission. R.H. acknowledges
funding through CZI grant DAF2020-225401 (10.37921/120055ratwvi) from the Chan Zuckerberg
Initiative DAF, an advised fund of Silicon Valley Community Foundation (10.13039/100014989).
H.T.K.N. acknowledges funding by the European Commission Erasmus Mundus Joint Masters
programme. We thank M. Sixt and M. Chinon for the discussions about O-redox in life
and R. Jethwa for proofreading. Open access funding was provided by ISTA.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Soumyadip
full_name: Mondal, Soumyadip
id: d25d21ef-dc8d-11ea-abe3-ec4576307f48
last_name: Mondal
- first_name: Huyen T.K.
full_name: Nguyen, Huyen T.K.
last_name: Nguyen
- first_name: Robert
full_name: Hauschild, Robert
id: 4E01D6B4-F248-11E8-B48F-1D18A9856A87
last_name: Hauschild
orcid: 0000-0001-9843-3522
- first_name: Stefan Alexander
full_name: Freunberger, Stefan Alexander
id: A8CA28E6-CE23-11E9-AD2D-EC27E6697425
last_name: Freunberger
orcid: 0000-0003-2902-5319
citation:
ama: Mondal S, Nguyen HTK, Hauschild R, Freunberger SA. Marcus kinetics control
singlet and triplet oxygen evolving from superoxide. Nature. 2025;646(8085):601–605.
doi:10.1038/s41586-025-09587-7
apa: Mondal, S., Nguyen, H. T. K., Hauschild, R., & Freunberger, S. A. (2025).
Marcus kinetics control singlet and triplet oxygen evolving from superoxide. Nature.
Springer Nature. https://doi.org/10.1038/s41586-025-09587-7
chicago: Mondal, Soumyadip, Huyen T.K. Nguyen, Robert Hauschild, and Stefan Alexander
Freunberger. “Marcus Kinetics Control Singlet and Triplet Oxygen Evolving from
Superoxide.” Nature. Springer Nature, 2025. https://doi.org/10.1038/s41586-025-09587-7.
ieee: S. Mondal, H. T. K. Nguyen, R. Hauschild, and S. A. Freunberger, “Marcus kinetics
control singlet and triplet oxygen evolving from superoxide,” Nature, vol.
646, no. 8085. Springer Nature, pp. 601–605, 2025.
ista: Mondal S, Nguyen HTK, Hauschild R, Freunberger SA. 2025. Marcus kinetics control
singlet and triplet oxygen evolving from superoxide. Nature. 646(8085), 601–605.
mla: Mondal, Soumyadip, et al. “Marcus Kinetics Control Singlet and Triplet Oxygen
Evolving from Superoxide.” Nature, vol. 646, no. 8085, Springer Nature,
2025, pp. 601–605, doi:10.1038/s41586-025-09587-7.
short: S. Mondal, H.T.K. Nguyen, R. Hauschild, S.A. Freunberger, Nature 646 (2025)
601–605.
corr_author: '1'
date_created: 2024-08-29T10:40:23Z
date_published: 2025-10-16T00:00:00Z
date_updated: 2026-09-16T06:53:54Z
day: '16'
ddc:
- '540'
department:
- _id: StFr
- _id: Bio
doi: 10.1038/s41586-025-09587-7
external_id:
isi:
- '001586378900001'
pmid:
- '41044415'
file:
- access_level: open_access
checksum: b507ddd23df0388aa65d04dc9b00fe3d
content_type: application/pdf
creator: dernst
date_created: 2025-10-20T10:26:13Z
date_updated: 2025-10-20T10:26:13Z
file_id: '20500'
file_name: 2025_Nature_Mondal.pdf
file_size: 3809247
relation: main_file
success: 1
file_date_updated: 2025-10-20T10:26:13Z
fulldoi: https://doi.org/10.1038/s41586-025-09587-7
has_accepted_license: '1'
intvolume: ' 646'
isi: 1
issue: '8085'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '10'
oa: 1
oa_version: Published Version
page: 601–605
pmid: 1
project:
- _id: 8df062be-16d5-11f0-9cad-f559b6612c7e
grant_number: P37169
name: Singlet oxygen in non-aqueous oxygen redox chemistry
- _id: c08e9ad1-5a5b-11eb-8a69-9d1cf3b07473
grant_number: CZI01
name: Tools for automation and feedback microscopy
- _id: 5eaf4378-b033-11f1-b276-f928018a46c1
grant_number: COE05
name: Materials for Energy Conversion and Storage (Freunberger)
publication: Nature
publication_identifier:
eissn:
- 1476-4687
issn:
- 0028-0836
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/taming-the-bad-oxygen/
scopus_import: '1'
status: public
title: Marcus kinetics control singlet and triplet oxygen evolving from superoxide
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 646
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
orcid: 0000-0002-0163-2152
- 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: 2026-09-16T06:57:17Z
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
fulldoi: https://doi.org/10.1007/978-3-031-90653-4_7
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'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
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: '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: 2026-09-16T06:56:56Z
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
fulldoi: https://doi.org/10.1007/978-3-031-90653-4_11
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'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
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: '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: 2026-09-16T06:57:43Z
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
fulldoi: https://doi.org/10.1007/978-3-031-90653-4_14
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'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
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: '19667'
abstract:
- lang: eng
text: The problem of checking satisfiability of linear real arithmetic (LRA) and
non-linear real arithmetic (NRA) formulas has broad applications, in particular,
they are at the heart of logic-related applications such as logic for artificial
intelligence, program analysis, etc. While there has been much work on checking
satisfiability of unquantified LRA and NRA formulas, the problem of checking satisfiability
of quantified LRA and NRA formulas remains a significant challenge. The main bottleneck
in the existing methods is a computationally expensive quantifier elimination
step. In this work, we propose a novel method for efficient quantifier elimination
in quantified LRA and NRA formulas. We propose a template-based Skolemization
approach, where we automatically synthesize linear/polynomial Skolem functions
in order to eliminate quantifiers in the formula. The key technical ingredient
in our approach are Positivstellensätze theorems from algebraic geometry, which
allow for an efficient manipulation of polynomial inequalities. Our method offers
a range of appealing theoretical properties combined with a strong practical performance.
On the theory side, our method is sound, semi-complete, and runs in subexponential
time and polynomial space, as opposed to existing sound and complete quantifier
elimination methods that run in doubly-exponential time and at least exponential
space. On the practical side, our experiments show superior performance compared
to state of the art SMT solvers in terms of the number of solved instances and
runtime, both on LRA and on NRA benchmarks.
acknowledgement: This work was partially funded by ERC CoG 863818 (ForM-SMArt) and
Austrian Science Fund (FWF) 10.55776/COE12.
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: Mehrdad
full_name: Karrabi, Mehrdad
id: 67638922-f394-11eb-9cf6-f20423e08757
last_name: Karrabi
orcid: 0009-0007-5253-9170
- first_name: Harshit J.
full_name: Motwani, Harshit J.
last_name: Motwani
- first_name: Maximilian
full_name: Seeliger, Maximilian
last_name: Seeliger
- 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, Karrabi M, Motwani HJ, Seeliger M, Zikelic D.
Quantified linear and polynomial arithmetic satisfiability via template-based
skolemization. In: Proceedings of the 39th AAAI Conference on Artificial Intelligence.
Vol 39. Association for the Advancement of Artificial Intelligence; 2025:11158-11166.
doi:10.1609/aaai.v39i11.33213'
apa: 'Chatterjee, K., Goharshady, E., Karrabi, M., Motwani, H. J., Seeliger, M.,
& Zikelic, D. (2025). Quantified linear and polynomial arithmetic satisfiability
via template-based skolemization. In Proceedings of the 39th AAAI Conference
on Artificial Intelligence (Vol. 39, pp. 11158–11166). Philadelphia, PA, United
States: Association for the Advancement of Artificial Intelligence. https://doi.org/10.1609/aaai.v39i11.33213'
chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Mehrdad Karrabi, Harshit J. Motwani,
Maximilian Seeliger, and Dorde Zikelic. “Quantified Linear and Polynomial Arithmetic
Satisfiability via Template-Based Skolemization.” In Proceedings of the 39th
AAAI Conference on Artificial Intelligence, 39:11158–66. Association for the
Advancement of Artificial Intelligence, 2025. https://doi.org/10.1609/aaai.v39i11.33213.
ieee: K. Chatterjee, E. Goharshady, M. Karrabi, H. J. Motwani, M. Seeliger, and
D. Zikelic, “Quantified linear and polynomial arithmetic satisfiability via template-based
skolemization,” in Proceedings of the 39th AAAI Conference on Artificial Intelligence,
Philadelphia, PA, United States, 2025, vol. 39, no. 11, pp. 11158–11166.
ista: 'Chatterjee K, Goharshady E, Karrabi M, Motwani HJ, Seeliger M, Zikelic D.
2025. Quantified linear and polynomial arithmetic satisfiability via template-based
skolemization. Proceedings of the 39th AAAI Conference on Artificial Intelligence.
AAAI: Conference on Artificial Intelligence vol. 39, 11158–11166.'
mla: Chatterjee, Krishnendu, et al. “Quantified Linear and Polynomial Arithmetic
Satisfiability via Template-Based Skolemization.” Proceedings of the 39th AAAI
Conference on Artificial Intelligence, vol. 39, no. 11, Association for the
Advancement of Artificial Intelligence, 2025, pp. 11158–66, doi:10.1609/aaai.v39i11.33213.
short: K. Chatterjee, E. Goharshady, M. Karrabi, H.J. Motwani, M. Seeliger, D. Zikelic,
in:, Proceedings of the 39th AAAI Conference on Artificial Intelligence, Association
for the Advancement of Artificial Intelligence, 2025, pp. 11158–11166.
conference:
end_date: 2025-03-04
location: Philadelphia, PA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2025-02-25
corr_author: '1'
date_created: 2025-05-11T22:02:39Z
date_published: 2025-04-11T00:00:00Z
date_updated: 2026-09-16T06:55:21Z
day: '11'
department:
- _id: KrCh
doi: 10.1609/aaai.v39i11.33213
ec_funded: 1
external_id:
arxiv:
- '2412.16226'
fulldoi: https://doi.org/10.1609/aaai.v39i11.33213
intvolume: ' 39'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.16226
month: '04'
oa: 1
oa_version: Preprint
page: 11158-11166
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication: Proceedings of the 39th AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
issn:
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: Quantified linear and polynomial arithmetic satisfiability via template-based
skolemization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '19669'
abstract:
- lang: eng
text: 'We consider a class of optimization problems defined by a system of linear
equations with min and max operators. This class of optimization problems has
been studied under restrictive conditions, such as, (C1) the halting or stability
condition; (C2) the non-negative coefficients condition; (C3) the sum upto 1 condition;
and (C4) the only min or only max operator condition. Several seminal results
in the literature focus on special cases. For example, turn-based stochastic games
correspond to conditions C2 and C3; and Markov decision process to conditions
C2, C3, and C4. However, the systematic computational complexity study of all
the cases has not been explored, which we address in this work. Some highlights
of our results are: with conditions C2 and C4, and with conditions C3 and C4,
the problem is NP-complete, whereas with condition C1 only, the problem is in
UP intersects coUP. Finally, we establish the computational complexity of the
decision problem of checking the respective conditions.'
acknowledgement: This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant and the Austrian Science Fund (FWF) 10.55776/COE12 grant.
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: Ruichen
full_name: Luo, Ruichen
id: b391db08-1ffe-11ee-8b67-d18ddcfb5a14
last_name: Luo
- 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, Luo R, Saona Urmeneta RJ, Svoboda J. Linear equations with min
and max operators: Computational complexity. In: Proceedings of the 39th AAAI
Conference on Artificial Intelligence. Vol 39. Association for the Advancement
of Artificial Intelligence; 2025:11150-11157. doi:10.1609/aaai.v39i11.33212'
apa: 'Chatterjee, K., Luo, R., Saona Urmeneta, R. J., & Svoboda, J. (2025).
Linear equations with min and max operators: Computational complexity. In Proceedings
of the 39th AAAI Conference on Artificial Intelligence (Vol. 39, pp. 11150–11157).
Philadelphia, PA, United States: Association for the Advancement of Artificial
Intelligence. https://doi.org/10.1609/aaai.v39i11.33212'
chicago: 'Chatterjee, Krishnendu, Ruichen Luo, Raimundo J Saona Urmeneta, and Jakub
Svoboda. “Linear Equations with Min and Max Operators: Computational Complexity.”
In Proceedings of the 39th AAAI Conference on Artificial Intelligence,
39:11150–57. Association for the Advancement of Artificial Intelligence, 2025.
https://doi.org/10.1609/aaai.v39i11.33212.'
ieee: 'K. Chatterjee, R. Luo, R. J. Saona Urmeneta, and J. Svoboda, “Linear equations
with min and max operators: Computational complexity,” in Proceedings of the
39th AAAI Conference on Artificial Intelligence, Philadelphia, PA, United
States, 2025, vol. 39, no. 11, pp. 11150–11157.'
ista: 'Chatterjee K, Luo R, Saona Urmeneta RJ, Svoboda J. 2025. Linear equations
with min and max operators: Computational complexity. Proceedings of the 39th
AAAI Conference on Artificial Intelligence. AAAI: Conference on Artificial Intelligence
vol. 39, 11150–11157.'
mla: 'Chatterjee, Krishnendu, et al. “Linear Equations with Min and Max Operators:
Computational Complexity.” Proceedings of the 39th AAAI Conference on Artificial
Intelligence, vol. 39, no. 11, Association for the Advancement of Artificial
Intelligence, 2025, pp. 11150–57, doi:10.1609/aaai.v39i11.33212.'
short: K. Chatterjee, R. Luo, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings
of the 39th AAAI Conference on Artificial Intelligence, Association for the Advancement
of Artificial Intelligence, 2025, pp. 11150–11157.
conference:
end_date: 2025-03-04
location: Philadelphia, PA, United States
name: 'AAAI: Conference on Artificial Intelligence'
start_date: 2025-02-25
corr_author: '1'
date_created: 2025-05-11T22:02:40Z
date_published: 2025-04-11T00:00:00Z
date_updated: 2026-09-16T06:55:47Z
day: '11'
department:
- _id: KrCh
doi: 10.1609/aaai.v39i11.33212
ec_funded: 1
external_id:
arxiv:
- '2412.12228'
fulldoi: https://doi.org/10.1609/aaai.v39i11.33212
intvolume: ' 39'
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.12228
month: '04'
oa: 1
oa_version: Preprint
page: 11150-11157
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication: Proceedings of the 39th AAAI Conference on Artificial Intelligence
publication_identifier:
eissn:
- 2374-3468
issn:
- 2159-5399
publication_status: published
publisher: Association for the Advancement of Artificial Intelligence
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Linear equations with min and max operators: Computational complexity'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 39
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
orcid: 0000-0002-0163-2152
- 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: 2026-09-16T06:57:17Z
day: '09'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.5281/ZENODO.14626585
fulldoi: https://doi.org/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
_id: '19903'
abstract:
- lang: eng
text: "Cooperation, that is, one person paying a cost for another's benefit, is
a fundamental principle without which no form of society could exist. The extent
to which humans cooperate with each other is also an essential feature that differentiates
them from other animals. Cooperation occurs even in the absence of altruistic
motivations, when it is selfishly incentivised by the expectation of a future
reward. For example, many economic interactions are well described that way. This
kind of cooperation requires that people exhibit reciprocal behaviour that acts
as a mechanism that rewards cooperation.\r\nWith game-theoretic models, it is
possible to formally study potential such mechanisms and under what conditions
they can exist. This thesis contributes to this effort by analysing recently introduced
models of cooperation that advance on previous work by taking into account the
potential for pre-existing inequality among cooperating individuals as well as
the different forms that reciprocity can take.\r\nIndividuals may differ both
intrinsically, in their abilities, as well as extrinsically, in the amount of
resources they have available. Allowing for such differences in a model of cooperation
helps to understand how inequality affects the potential for, and outcomes of,
cooperation among unequals. In this thesis, it is shown that in the presence of
intrinsic inequality, a similar unequal distribution of resources can increase
the potential for cooperation. This effect is stronger the smaller the group is
in which cooperation takes place. It is also shown that under particular assumptions,
if the unequal members of a group vary the size of their contributions to a cooperative
effort over time, they can thereby increase their efficiency and improve the collective
outcome.\r\nCooperative behaviour in a two-person interaction can be rewarded
either by direct reciprocation whenever the same two people interact again, or
indirectly by a third party who observed the interaction. In the latter case of
indirect reciprocity, individuals are proximally rewarded by a good reputation,
which ultimately translates to being rewarded with cooperative behaviour by others.
This mechanism can enable selfishly motivated cooperation even in circumstances
where individuals are unlikely to meet again, akin to how money facilitates trade.
While these two forms of reciprocity have mostly been studied in isolation, this
thesis analyses both direct and indirect reciprocity in a general model in order
to compare their relative effectiveness under different circumstances. The contribution
of this thesis is an extension of previous work regarding a specific kind of interaction,
whose parameters allow for convenient mathematical analysis, to the most general
set of possible interactions."
acknowledgement: "The research for this thesis was supported by the European Research
Council\r\n(grant agreements No. 863818 and No. 850529), the European Union’s Horizon
2020 research and innovation programme (Marie Skłodowska-Curie grant agreement No.
754411),\r\nthe Austrian Science Fund (grant DOI 10.55776/COE12), the French Agence
Nationale\r\nde la Recherche under the Programme d’investissements d’avenir (project
reference 17-\r\nEURE-0010) and the Australian Government through the Australian
Research Council\r\n(grant No. SR200100005, “Securing Antarctica’s Environmental
Future”)."
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Valentin
full_name: Hübner, Valentin
id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910
last_name: Hübner
orcid: 0009-0001-5009-4987
citation:
ama: Hübner V. Reciprocity and inequality in social dilemmas. 2025. doi:10.15479/AT-ISTA-19903
apa: Hübner, V. (2025). Reciprocity and inequality in social dilemmas. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-19903
chicago: Hübner, Valentin. “Reciprocity and Inequality in Social Dilemmas.” Institute
of Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-19903.
ieee: V. Hübner, “Reciprocity and inequality in social dilemmas,” Institute of Science
and Technology Austria, 2025.
ista: Hübner V. 2025. Reciprocity and inequality in social dilemmas. Institute of
Science and Technology Austria.
mla: Hübner, Valentin. Reciprocity and Inequality in Social Dilemmas. Institute
of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-19903.
short: V. Hübner, Reciprocity and Inequality in Social Dilemmas, Institute of Science
and Technology Austria, 2025.
corr_author: '1'
date_created: 2025-06-25T13:50:10Z
date_published: 2025-06-25T00:00:00Z
date_updated: 2026-09-16T06:58:24Z
day: '25'
ddc:
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/AT-ISTA-19903
doi_confirm: '1'
ec_funded: 1
file:
- access_level: closed
checksum: 794c02f8c82ca59ba6dda3bd7eed871a
content_type: application/x-xz
creator: vhuebner
date_created: 2025-06-25T13:38:07Z
date_updated: 2025-06-25T13:38:07Z
file_id: '19905'
file_name: Thesis Valentin Hübner source.tar.xz
file_size: 6192760
relation: source_file
- access_level: open_access
checksum: ac56063d81c81e40322b6ff5a8c4912e
content_type: application/pdf
creator: vhuebner
date_created: 2025-07-09T13:37:00Z
date_updated: 2025-07-09T13:37:00Z
file_id: '19976'
file_name: Thesis Valentin Hübner.pdf
file_size: 4837864
relation: main_file
file_date_updated: 2025-07-09T13:37:00Z
fulldoi: https://doi.org/10.15479/AT-ISTA-19903
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '157'
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '19843'
relation: part_of_dissertation
status: public
- id: '15083'
relation: part_of_dissertation
status: public
- id: '19074'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Reciprocity and inequality in social dilemmas
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20099'
abstract:
- lang: eng
text: The hippocampus, critical for learning and memory, is dogmatically described
as a trisynaptic circuit where dentate gyrus granule cells (GCs), CA3 pyramidal
neurons (PNs), and CA1 PNs are serially connected. However, CA3 also forms an
autoassociative network, and its PNs have diverse morphologies, intrinsic properties,
and GC input levels. How PN subtypes compose this recurrent network is unknown.
To determine the synaptic arrangement of identified CA3 PNs, we combine multicellular
patch-clamp recording and post hoc morphological analysis in mouse hippocampal
slices. PNs can be divided into distinct “superficial” and “deep” subclasses,
the latter including previously reported “athorny” cells. Subclasses have distinct
input-output transformations and asymmetric connectivity, which is more abundant
from superficial to deep PNs, splitting CA3 locally into two parallel recurrent
networks. Coincident spontaneous inhibition occurs frequently within but not between
subclasses, implying subclass-specific inhibitory innervation. Our results suggest
two separately controlled sublayers for parallel information processing in hippocampal
CA3.
acknowledged_ssus:
- _id: Bio
- _id: PreCl
- _id: LifeSc
- _id: M-Shop
acknowledgement: We thank Andrea Navas-Olive and Rebecca J. Morse-Mora for critically
reading an earlier version of the manuscript. We also thank Florian Marr and Christina
Altmutter for excellent technical assistance, Alois Schlögl for programming and
data-handling assistance, Todor Asenov for technical support, and Eleftheria Kralli-Beller
for manuscript editing. This research was supported by the Scientific Services Units
(SSUs) of ISTA. We are particularly grateful for assistance from the Imaging and
Optics Facility, Preclinical Facility, Lab Support Facility, and Miba Machine Shop.
The project received funding from the European Research Council (ERC) under the
European Union’s Horizon 2020 research and innovation program (grant agreement no.
692692 to P.J., Marie Skłodowska-Curie Actions Individual Fellowship no. 101026635
to J.F.W., and an ISTplus Fellowship through Marie Skłodowska-Curie grant agreement
no. 754411 to V.V.-B.), the Austrian Science Fund (P 36232-B, PAT 4178023, and Cluster
of Excellence 10.55776/COE16 to P.J.), and a CONACyT fellowship (289638 to V.V.-B.)
and was supported by a non-stipendiary EMBO fellowship (ALTF 756–2020 to J.F.W.).
article_number: '116080'
article_processing_charge: Yes
article_type: original
author:
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Victor M
full_name: Vargas Barroso, Victor M
id: 2F55A9DE-F248-11E8-B48F-1D18A9856A87
last_name: Vargas Barroso
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Watson J, Vargas Barroso VM, Jonas PM. Cell-specific wiring routes information
flow through hippocampal CA3. Cell Reports. 2025;44(8). doi:10.1016/j.celrep.2025.116080
apa: Watson, J., Vargas Barroso, V. M., & Jonas, P. M. (2025). Cell-specific
wiring routes information flow through hippocampal CA3. Cell Reports. Elsevier.
https://doi.org/10.1016/j.celrep.2025.116080
chicago: Watson, Jake, Victor M Vargas Barroso, and Peter M Jonas. “Cell-Specific
Wiring Routes Information Flow through Hippocampal CA3.” Cell Reports.
Elsevier, 2025. https://doi.org/10.1016/j.celrep.2025.116080.
ieee: J. Watson, V. M. Vargas Barroso, and P. M. Jonas, “Cell-specific wiring routes
information flow through hippocampal CA3,” Cell Reports, vol. 44, no. 8.
Elsevier, 2025.
ista: Watson J, Vargas Barroso VM, Jonas PM. 2025. Cell-specific wiring routes information
flow through hippocampal CA3. Cell Reports. 44(8), 116080.
mla: Watson, Jake, et al. “Cell-Specific Wiring Routes Information Flow through
Hippocampal CA3.” Cell Reports, vol. 44, no. 8, 116080, Elsevier, 2025,
doi:10.1016/j.celrep.2025.116080.
short: J. Watson, V.M. Vargas Barroso, P.M. Jonas, Cell Reports 44 (2025).
corr_author: '1'
date_created: 2025-08-03T22:01:30Z
date_published: 2025-08-01T00:00:00Z
date_updated: 2026-09-16T06:58:59Z
day: '01'
ddc:
- '570'
department:
- _id: PeJo
doi: 10.1016/j.celrep.2025.116080
ec_funded: 1
external_id:
isi:
- '001544472300002'
file:
- access_level: open_access
checksum: 556ff9760661ecd23949d75031043b1f
content_type: application/pdf
creator: dernst
date_created: 2025-08-04T06:53:07Z
date_updated: 2025-08-04T06:53:07Z
file_id: '20106'
file_name: 2025_CellReports_Watson.pdf
file_size: 27695214
relation: main_file
success: 1
file_date_updated: 2025-08-04T06:53:07Z
fulldoi: https://doi.org/10.1016/j.celrep.2025.116080
has_accepted_license: '1'
intvolume: ' 44'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: fc2be41b-9c52-11eb-aca3-faa90aa144e9
call_identifier: H2020
grant_number: '101026635'
name: Synaptic computations of the hippocampal CA3 circuitry
- _id: bd88be38-d553-11ed-ba76-81d5a70a6ef5
grant_number: P36232
name: Mechanisms of GABA release in hippocampal circuits
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: 0a6c8641-b036-11f1-bacf-e4eec62b5bb4
grant_number: COE16
name: Neuronal circuits in health and disease (Jonas)
publication: Cell Reports
publication_identifier:
eissn:
- 2211-1247
issn:
- 2639-1856
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Cell-specific wiring routes information flow through hippocampal CA3
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19843'
abstract:
- lang: eng
text: 'Social dilemmas are collective-action problems where individual interests
are at odds with group interests. Such dilemmas occur frequently at all scales
of human interactions. When dealing with collective-action problems, people often
act reciprocally. They adjust their behavior to match the previous behavior of
the recipient. The literature distinguishes two kinds of reciprocity. According
to direct reciprocity, individuals react to their immediate experiences with the
recipient. They are more likely to cooperate if the recipient previously cooperated
with them. According to indirect reciprocity, individuals react to the recipient’s
general behavior, irrespectively of whether or not they benefited directly. In
practice, the two kinds of reciprocity are often intertwined; people typically
base their decisions on both direct experiences and indirect observations. Yet
only recently have researchers begun to explore how the two kinds of reciprocity
interact. So far, this research only addresses a single type of social dilemma,
the donation game, where the effects of individual behaviors are independent.
Instead, here we allow for all pairwise social dilemmas. By applying novel techniques
to generalize the theory of zero-determinant strategies, we establish an important
proof of principle: In all social dilemmas, socially optimal outcomes can be sustained
as an equilibrium, using either direct or indirect reciprocity, or arbitrary mixtures
thereof. These results neither require games to be repeated infinitely often,
nor that individual opinions are synchronized. In this way, we considerably generalize
the scope of models of reciprocity, and we build further bridges between the literatures
on direct and indirect reciprocity.'
acknowledgement: 'This work was supported by the European Research Council CoG 863818
(ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529:
E-DIRECT (to C.H.).'
article_number: pgaf154
article_processing_charge: Yes
article_type: original
author:
- first_name: Valentin
full_name: Hübner, Valentin
id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910
last_name: Hübner
orcid: 0009-0001-5009-4987
- first_name: Laura
full_name: Schmid, Laura
id: 38B437DE-F248-11E8-B48F-1D18A9856A87
last_name: Schmid
orcid: 0000-0002-6978-7329
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Hübner V, Schmid L, Hilbe C, Chatterjee K. Stable strategies of direct and
indirect reciprocity across all social dilemmas. PNAS Nexus. 2025;4(5).
doi:10.1093/pnasnexus/pgaf154
apa: Hübner, V., Schmid, L., Hilbe, C., & Chatterjee, K. (2025). Stable strategies
of direct and indirect reciprocity across all social dilemmas. PNAS Nexus.
Oxford University Press. https://doi.org/10.1093/pnasnexus/pgaf154
chicago: Hübner, Valentin, Laura Schmid, Christian Hilbe, and Krishnendu Chatterjee.
“Stable Strategies of Direct and Indirect Reciprocity across All Social Dilemmas.”
PNAS Nexus. Oxford University Press, 2025. https://doi.org/10.1093/pnasnexus/pgaf154.
ieee: V. Hübner, L. Schmid, C. Hilbe, and K. Chatterjee, “Stable strategies of direct
and indirect reciprocity across all social dilemmas,” PNAS Nexus, vol.
4, no. 5. Oxford University Press, 2025.
ista: Hübner V, Schmid L, Hilbe C, Chatterjee K. 2025. Stable strategies of direct
and indirect reciprocity across all social dilemmas. PNAS Nexus. 4(5), pgaf154.
mla: Hübner, Valentin, et al. “Stable Strategies of Direct and Indirect Reciprocity
across All Social Dilemmas.” PNAS Nexus, vol. 4, no. 5, pgaf154, Oxford
University Press, 2025, doi:10.1093/pnasnexus/pgaf154.
short: V. Hübner, L. Schmid, C. Hilbe, K. Chatterjee, PNAS Nexus 4 (2025).
corr_author: '1'
date_created: 2025-06-15T22:01:30Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2026-09-16T06:58:23Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1093/pnasnexus/pgaf154
ec_funded: 1
external_id:
pmid:
- '40417077'
file:
- access_level: open_access
checksum: efd6648db3fc3ea0cdd7155d667e5f11
content_type: application/pdf
creator: dernst
date_created: 2025-06-23T08:09:50Z
date_updated: 2025-06-23T08:09:50Z
file_id: '19867'
file_name: 2025_PNASNexus_Huebner.pdf
file_size: 2551195
relation: main_file
success: 1
file_date_updated: 2025-06-23T08:09:50Z
fulldoi: https://doi.org/10.1093/pnasnexus/pgaf154
has_accepted_license: '1'
intvolume: ' 4'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: PNAS Nexus
publication_identifier:
eissn:
- 2752-6542
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
related_material:
record:
- id: '19903'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Stable strategies of direct and indirect reciprocity across all social dilemmas
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 4
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '19074'
abstract:
- lang: eng
text: 'The public goods game is among the most studied metaphors of cooperation
in groups. In this game, individuals can use their endowments to make contributions
towards a good that benefits everyone. Each individual, however, is tempted to
free-ride on the contributions of others. Herein, we study repeated public goods
games among asymmetric players. Previous work has explored to which extent asymmetry
allows for full cooperation, such that players contribute their full endowment
each round. However, by design that work focusses on equilibria where individuals
make the same contribution each round. Instead, here we consider players whose
contributions along the equilibrium path can change from one round to the next.
We do so for three different models – one without any budget constraints, one
with endowment constraints, and one in which individuals can save their current
endowment to be used in subsequent rounds. In each case, we explore two key quantities:
the welfare and the resource efficiency that can be achieved in equilibrium. Welfare
corresponds to the sum of all players’ payoffs. Resource efficiency relates this
welfare to the total contributions made by the players. Compared to constant contribution
sequences, we find that time-dependent contributions can improve resource efficiency
across all three models. Moreover, they can improve the players’ welfare in the
model with savings.'
acknowledgement: 'This work was supported by the European Research Council CoG 863818
(ForM-SMArt) (to K.C.) and the European Research Council Starting Grant 850529:
E-DIRECT (to C.H.), the European Union’s Horizon 2020 research and innovation programme
under the Marie Skłodowska-Curie Grant Agreement #754411 and the French Agence Nationale
de la Recherche (under the Investissement d’Avenir programme, ANR-17-EURE-0010),
and ARC SRIEAS Grant SR200100005 Securing Antarctica’s Environmental Future (to
M.K.). Open access funding provided by Institute of Science and Technology (IST
Austria).'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Valentin
full_name: Hübner, Valentin
id: 2c8aa207-dc7d-11ea-9b2f-f22972ecd910
last_name: Hübner
orcid: 0009-0001-5009-4987
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Manuel
full_name: Staab, Manuel
last_name: Staab
- first_name: Maria
full_name: Kleshnina, Maria
id: 4E21749C-F248-11E8-B48F-1D18A9856A87
last_name: Kleshnina
orcid: 0000-0002-5518-8317
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. Time-dependent strategies
in repeated asymmetric public goods games. Dynamic Games and Applications.
2025;15:1617-1645. doi:10.1007/s13235-025-00627-5
apa: Hübner, V., Hilbe, C., Staab, M., Kleshnina, M., & Chatterjee, K. (2025).
Time-dependent strategies in repeated asymmetric public goods games. Dynamic
Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00627-5
chicago: Hübner, Valentin, Christian Hilbe, Manuel Staab, Maria Kleshnina, and Krishnendu
Chatterjee. “Time-Dependent Strategies in Repeated Asymmetric Public Goods Games.”
Dynamic Games and Applications. Springer Nature, 2025. https://doi.org/10.1007/s13235-025-00627-5.
ieee: V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, and K. Chatterjee, “Time-dependent
strategies in repeated asymmetric public goods games,” Dynamic Games and Applications,
vol. 15. Springer Nature, pp. 1617–1645, 2025.
ista: Hübner V, Hilbe C, Staab M, Kleshnina M, Chatterjee K. 2025. Time-dependent
strategies in repeated asymmetric public goods games. Dynamic Games and Applications.
15, 1617–1645.
mla: Hübner, Valentin, et al. “Time-Dependent Strategies in Repeated Asymmetric
Public Goods Games.” Dynamic Games and Applications, vol. 15, Springer
Nature, 2025, pp. 1617–45, doi:10.1007/s13235-025-00627-5.
short: V. Hübner, C. Hilbe, M. Staab, M. Kleshnina, K. Chatterjee, Dynamic Games
and Applications 15 (2025) 1617–1645.
corr_author: '1'
date_created: 2025-02-23T23:01:57Z
date_published: 2025-11-01T00:00:00Z
date_updated: 2026-09-16T06:58:23Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/s13235-025-00627-5
ec_funded: 1
external_id:
isi:
- '001415587800001'
file:
- access_level: open_access
checksum: de0a412cbb7d98bf5e6a551c26acbefa
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T08:01:35Z
date_updated: 2025-12-30T08:01:35Z
file_id: '20888'
file_name: 2025_DynGamesAppl_Huebner.pdf
file_size: 1126178
relation: main_file
success: 1
file_date_updated: 2025-12-30T08:01:35Z
fulldoi: https://doi.org/10.1007/s13235-025-00627-5
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1617-1645
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Dynamic Games and Applications
publication_identifier:
eissn:
- 2153-0793
issn:
- 2153-0785
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '19903'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Time-dependent strategies in repeated asymmetric public goods games
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2025'
...
---
OA_place: publisher
_id: '20138'
abstract:
- lang: eng
text: "The evolution shapes the world around us.\r\nNot only in biology, where the
fittest individuals spread their genes but also in physics and social dynamics,
the evolutionary forces determine the development of a state of matter or public
opinions.\r\nMany models describe these dynamics.\r\nThis thesis examines the
role of the structure in the models of selection.\r\nThe population structure
is represented as a graph or a network, and each vertex is occupied by one individual.\r\nEvery
individual has a type and fitness that represents the reproductive potential and
depends on the type, occupied vertex, and the arrangement of the neighbors.\r\nThe
evolution is modeled in discrete steps; in one step, one individual is replaced
by a neighbor selected randomly with the influence of fitness.\r\n\r\n\r\n\r\nThe
role of the networks is widely examined in the literature.\r\nThe structures that
promote the spread of the desired type compared to the structureless case are
called amplifiers.\r\nThe existence of amplifiers in various settings is an intensively
studied topic, and in some settings, the amplifiers have been identified.\r\nMoreover,
there are other important questions about the number of steps until one type spreads
over the whole network (fixation time), the computational complexity, and the
questions about the robustness of these processes.\r\n\r\n\r\nThis thesis explores
the role of structure in evolution from many perspectives.\r\nFirst, it introduces
different models and various choices that can be made in the models of evolution.\r\nIt
highlights the role of the structure in the real world and how this is reflected
in these models.\r\nThen, it describes the previous results and open problems.\r\nSecond,
the thesis describes an amplifier for two variants of the Moran process: one with
a constant birth rate and the other with a constant death rate.\r\nThis is an
important contribution to the robustness of the amplification.\r\nThird, the thesis
determines the complexity of spatial games.\r\nThese are processes where the fitness
comes from a game, and the strength of selection is high.\r\nIt shows that determining
the fate of cooperation in these games is a PSPACE-complete problem.\r\nFourth,
the thesis describes the amplifier of cooperation for spatial games.\r\nThis is
the first amplifier in this setting.\r\nFifth, the thesis examines the coexistence
in the Moran process with environmental heterogeneity.\r\nIn this setting, the
fitness depends not only on the type of the individual but also on the occupied
vertex.\r\nThe chapter determines the relationship between the interactions of
vertices of different types and the coexistence time.\r\nSixth, the thesis examines
the social balance on networks and proposes a stochastic dynamic partially aware
of the state of the graph, which reaches a balanced position quickly.\r\nFinally,
the thesis presents conclusions and outlines the directions for future work.\r\n\r\n\r\n"
acknowledgement: "This work was supported by the European Research Council CoG 863818
(ForMSMArt) and Austrian Science Fund 10.55776/COE12.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: Svoboda J. Structural properties of games on graphs. 2025. doi:10.15479/AT-ISTA-20138
apa: Svoboda, J. (2025). Structural properties of games on graphs. Institute
of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-20138
chicago: Svoboda, Jakub. “Structural Properties of Games on Graphs.” Institute of
Science and Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20138.
ieee: J. Svoboda, “Structural properties of games on graphs,” Institute of Science
and Technology Austria, 2025.
ista: Svoboda J. 2025. Structural properties of games on graphs. Institute of Science
and Technology Austria.
mla: Svoboda, Jakub. Structural Properties of Games on Graphs. Institute
of Science and Technology Austria, 2025, doi:10.15479/AT-ISTA-20138.
short: J. Svoboda, Structural Properties of Games on Graphs, Institute of Science
and Technology Austria, 2025.
corr_author: '1'
das_tickbox: '1'
date_created: 2025-08-05T14:33:59Z
date_published: 2025-08-05T00:00:00Z
date_updated: 2026-09-16T06:59:33Z
day: '05'
ddc:
- '000'
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: KrCh
doi: 10.15479/AT-ISTA-20138
doi_confirm: '1'
ec_funded: 1
file:
- access_level: open_access
checksum: c6c4df9777f4537940de7ab392ad57e2
content_type: application/pdf
creator: jsvoboda
date_created: 2025-08-14T09:54:43Z
date_updated: 2025-08-14T09:54:43Z
file_id: '20177'
file_name: 2025_Svoboda_Jakub_Thesis.pdf
file_size: 5927291
relation: main_file
success: 1
- access_level: closed
checksum: 485e9f9822821bc03666d245d80aaa08
content_type: application/zip
creator: jsvoboda
date_created: 2025-08-14T09:55:20Z
date_updated: 2025-08-21T11:48:39Z
file_id: '20178'
file_name: 2025_Svoboda_Jakub_Thesis.zip
file_size: 6731815
relation: source_file
file_date_updated: 2025-08-21T11:48:39Z
fulldoi: https://doi.org/10.15479/AT-ISTA-20138
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: '167'
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
publisher_comment: "Chapter 4 is copyrighted by CC BY-NC-ND\r\n4.0, which prohibits
derivatives. Chapter 6 is copyrighted: Copyright (2025) by the American\r\nPhysical
Society. For a copy, redistribution, or modification needs to be permitted by the\r\nAmerican
Physical Society.\r\n"
related_material:
record:
- id: '12787'
relation: part_of_dissertation
status: public
- id: '12101'
relation: part_of_dissertation
status: public
- id: '12257'
relation: part_of_dissertation
status: public
- id: '15297'
relation: part_of_dissertation
status: public
- id: '18703'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
title: Structural properties of games on graphs
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '20299'
abstract:
- lang: eng
text: "Deterministic Markov Decision Processes (DMDPs) are a mathematical framework
for decision-making where the outcomes and future possible actions are deterministically
determined by the current action taken. DMDPs can be viewed as a finite directed
weighted graph, where in each step, the controller chooses an outgoing edge. An
objective is a measurable function on runs (or infinite trajectories) of the DMDP,
and the value for an objective is the maximal cumulative reward (or weight) that
the controller can guarantee. We consider the classical mean-payoff (aka limit-average)
objective, which is a basic and fundamental objective.\r\n\r\nHoward's policy
iteration algorithm is a popular method for solving DMDPs with mean-payoff objectives.
Although Howard's algorithm performs well in practice, as experimental studies
suggested, the best known upper bound is exponential and the current known lower
bound is as follows: For the input size I, the algorithm requires (math formular)
iterations, where (math formular) hides the poly-logarithmic factors, i.e., the
current lower bound on iterations is sub-linear with respect to the input size.
Our main result is an improved lower bound for this fundamental algorithm where
we show that for the input size I, the algorithm requires (math formular) iterations."
acknowledgement: "This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant and Austrian Science Fund (FWF) 10.55776/COE12.\r\n"
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Ali
full_name: Asadi, Ali
id: 02d96aae-000e-11ec-b801-cadd0a5eefbb
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Jakob
full_name: De Raaij, Jakob
last_name: De Raaij
citation:
ama: 'Asadi A, Chatterjee K, De Raaij J. Lower bound on Howard policy iteration
for deterministic Markov Decision Processes. In: The 41st Conference on Uncertainty
in Artificial Intelligence. Vol 286. ML Research Press; 2025:223-232.'
apa: 'Asadi, A., Chatterjee, K., & De Raaij, J. (2025). Lower bound on Howard
policy iteration for deterministic Markov Decision Processes. In The 41st Conference
on Uncertainty in Artificial Intelligence (Vol. 286, pp. 223–232). Rio de
Janeiro, Brazil: ML Research Press.'
chicago: Asadi, Ali, Krishnendu Chatterjee, and Jakob De Raaij. “Lower Bound on
Howard Policy Iteration for Deterministic Markov Decision Processes.” In The
41st Conference on Uncertainty in Artificial Intelligence, 286:223–32. ML
Research Press, 2025.
ieee: A. Asadi, K. Chatterjee, and J. De Raaij, “Lower bound on Howard policy iteration
for deterministic Markov Decision Processes,” in The 41st Conference on Uncertainty
in Artificial Intelligence, Rio de Janeiro, Brazil, 2025, vol. 286, pp. 223–232.
ista: 'Asadi A, Chatterjee K, De Raaij J. 2025. Lower bound on Howard policy iteration
for deterministic Markov Decision Processes. The 41st Conference on Uncertainty
in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence,
PMLR, vol. 286, 223–232.'
mla: Asadi, Ali, et al. “Lower Bound on Howard Policy Iteration for Deterministic
Markov Decision Processes.” The 41st Conference on Uncertainty in Artificial
Intelligence, vol. 286, ML Research Press, 2025, pp. 223–32.
short: A. Asadi, K. Chatterjee, J. De Raaij, in:, The 41st Conference on Uncertainty
in Artificial Intelligence, ML Research Press, 2025, pp. 223–232.
conference:
end_date: 2025-07-25
location: Rio de Janeiro, Brazil
name: 'UAI: Conference on Uncertainty in Artificial Intelligence'
start_date: 2025-07-21
corr_author: '1'
date_created: 2025-09-07T22:01:34Z
date_published: 2025-01-01T00:00:00Z
date_updated: 2026-09-16T07:01:05Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
ec_funded: 1
external_id:
arxiv:
- '2506.12254'
file:
- access_level: open_access
checksum: 4180c81bb6ed3b4f5c7a8e48d06520c6
content_type: application/pdf
creator: dernst
date_created: 2025-09-09T06:27:59Z
date_updated: 2025-09-09T06:27:59Z
file_id: '20313'
file_name: 2025_UAI_Asadi.pdf
file_size: 317097
relation: main_file
success: 1
file_date_updated: 2025-09-09T06:27:59Z
has_accepted_license: '1'
intvolume: ' 286'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 223-232
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication: The 41st Conference on Uncertainty in Artificial Intelligence
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lower bound on Howard policy iteration for deterministic 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: 286
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '20297'
abstract:
- lang: eng
text: "A standard model that arises in several applications in sequential decision-making
is partially observable Markov decision processes (POMDPs) where a decision-making
agent interacts with an uncertain environment. A basic objective in POMDPs is
the reachability objective, where given a target set of states, the goal is to
eventually arrive at one of them.\r\n\r\nThe limit-sure problem asks whether reachability
can be ensured with probability arbitrarily close to 1. In general, the limit-sure
reachability problem for POMDPs is undecidable. However, in many practical cases,
the most relevant question is the existence of policies with a small amount of
memory. In this work, we study the limit-sure reachability problem for POMDPs
with a fixed amount of memory. We establish that the computational complexity
of the problem is NP-complete."
acknowledgement: This research was partially supported by Austrian Science Fund (FWF)
10.55776/COE12, the support of the French Agence Nationale de la Recherche (ANR)
under reference ANR-21-CE40-0020 (CONVERGENCE project), and the ERC CoG 863818 (ForM-SMArt)
grant.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Ali
full_name: Asadi, Ali
id: 02d96aae-000e-11ec-b801-cadd0a5eefbb
last_name: Asadi
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- 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: Ali
full_name: Shafiee, Ali
id: 2783031a-7378-11f0-b2d0-f17f1db2ebad
last_name: Shafiee
citation:
ama: 'Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. Limit-sure reachability
for small memory policies in POMDPs is NP-complete. In: The 41st Conference
on Uncertainty in Artificial Intelligence. Vol 286. ML Research Press; 2025:238-247.'
apa: 'Asadi, A., Chatterjee, K., Saona Urmeneta, R. J., & Shafiee, A. (2025).
Limit-sure reachability for small memory policies in POMDPs is NP-complete. In
The 41st Conference on Uncertainty in Artificial Intelligence (Vol. 286,
pp. 238–247). Rio de Janeiro, Brazil: ML Research Press.'
chicago: Asadi, Ali, Krishnendu Chatterjee, Raimundo J Saona Urmeneta, and Ali Shafiee.
“Limit-Sure Reachability for Small Memory Policies in POMDPs Is NP-Complete.”
In The 41st Conference on Uncertainty in Artificial Intelligence, 286:238–47.
ML Research Press, 2025.
ieee: A. Asadi, K. Chatterjee, R. J. Saona Urmeneta, and A. Shafiee, “Limit-sure
reachability for small memory policies in POMDPs is NP-complete,” in The 41st
Conference on Uncertainty in Artificial Intelligence, Rio de Janeiro, Brazil,
2025, vol. 286, pp. 238–247.
ista: 'Asadi A, Chatterjee K, Saona Urmeneta RJ, Shafiee A. 2025. Limit-sure reachability
for small memory policies in POMDPs is NP-complete. The 41st Conference on Uncertainty
in Artificial Intelligence. UAI: Conference on Uncertainty in Artificial Intelligence,
PMLR, vol. 286, 238–247.'
mla: Asadi, Ali, et al. “Limit-Sure Reachability for Small Memory Policies in POMDPs
Is NP-Complete.” The 41st Conference on Uncertainty in Artificial Intelligence,
vol. 286, ML Research Press, 2025, pp. 238–47.
short: A. Asadi, K. Chatterjee, R.J. Saona Urmeneta, A. Shafiee, in:, The 41st Conference
on Uncertainty in Artificial Intelligence, ML Research Press, 2025, pp. 238–247.
conference:
end_date: 2025-07-25
location: Rio de Janeiro, Brazil
name: 'UAI: Conference on Uncertainty in Artificial Intelligence'
start_date: 2025-07-21
corr_author: '1'
date_created: 2025-09-07T22:01:34Z
date_published: 2025-07-01T00:00:00Z
date_updated: 2026-09-16T07:03:02Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
ec_funded: 1
external_id:
arxiv:
- '2412.00941'
file:
- access_level: open_access
checksum: 1a37ebe7ba73ab6985765bf0d17a0acc
content_type: application/pdf
creator: dernst
date_created: 2025-09-09T08:19:41Z
date_updated: 2025-09-09T08:19:41Z
file_id: '20315'
file_name: 2025_UAI_AsadiAli.pdf
file_size: 307458
relation: main_file
success: 1
file_date_updated: 2025-09-09T08:19:41Z
has_accepted_license: '1'
intvolume: ' 286'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 238-247
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication: The 41st Conference on Uncertainty in Artificial Intelligence
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Limit-sure reachability for small memory policies in POMDPs is NP-complete
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: 286
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '20296'
abstract:
- lang: eng
text: Learning-based systems are increasingly deployed across various domains, yet
the complexity of traditional neural networks poses significant challenges for
formal verification. Unlike conventional neural networks, learned Logic Gate Networks
(LGNs) replace multiplications with Boolean logic gates, yielding a sparse, netlist-like
architecture that is inherently more amenable to symbolic verification, while
still delivering promising performance. In this paper, we introduce a SAT encoding
for verifying global robustness and fairness in LGNs. We evaluate our method on
five benchmark datasets, including a newly constructed 5-class variant, and find
that LGNs are both verification-friendly and maintain strong predictive performance.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "This work is supported in part by the ERC grant under Grant No.
ERC-2020-AdG 101020093 and\r\nthe Austrian Science Fund (FWF) [10.55776/COE12].
This research was supported by the Scientific\r\nService Units (SSU) of ISTA through
resources provided by Scientific Computing (SciComp)."
alternative_title:
- PMLR
article_number: '26'
article_processing_charge: No
arxiv: 1
author:
- first_name: Fabian
full_name: Kresse, Fabian
id: faff3c84-23f6-11ef-9085-e5187b51c604
last_name: Kresse
- first_name: Zhengqi
full_name: Yu, Zhengqi
id: 20aa2ae8-f2f1-11ed-bbfa-8205053f1342
last_name: Yu
orcid: 0000-0002-4993-773X
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
citation:
ama: 'Kresse F, Yu E, Lampert C, Henzinger TA. Logic gate neural networks are good
for verification. In: 2nd International Conferenceon Neuro-Symbolic Systems.
Vol 288. ML Research Press; 2025.'
apa: 'Kresse, F., Yu, E., Lampert, C., & Henzinger, T. A. (2025). Logic gate
neural networks are good for verification. In 2nd International Conferenceon
Neuro-Symbolic Systems (Vol. 288). Philadephia, PA, United States: ML Research
Press.'
chicago: Kresse, Fabian, Emily Yu, Christoph Lampert, and Thomas A Henzinger. “Logic
Gate Neural Networks Are Good for Verification.” In 2nd International Conferenceon
Neuro-Symbolic Systems, Vol. 288. ML Research Press, 2025.
ieee: F. Kresse, E. Yu, C. Lampert, and T. A. Henzinger, “Logic gate neural networks
are good for verification,” in 2nd International Conferenceon Neuro-Symbolic
Systems, Philadephia, PA, United States, 2025, vol. 288.
ista: 'Kresse F, Yu E, Lampert C, Henzinger TA. 2025. Logic gate neural networks
are good for verification. 2nd International Conferenceon Neuro-Symbolic Systems.
NeuS: International Conferenceon Neuro-Symbolic Systems, PMLR, vol. 288, 26.'
mla: Kresse, Fabian, et al. “Logic Gate Neural Networks Are Good for Verification.”
2nd International Conferenceon Neuro-Symbolic Systems, vol. 288, 26, ML
Research Press, 2025.
short: F. Kresse, E. Yu, C. Lampert, T.A. Henzinger, in:, 2nd International Conferenceon
Neuro-Symbolic Systems, ML Research Press, 2025.
conference:
end_date: 2025-05-30
location: Philadephia, PA, United States
name: 'NeuS: International Conferenceon Neuro-Symbolic Systems'
start_date: 2025-05-28
corr_author: '1'
date_created: 2025-09-07T22:01:34Z
date_published: 2025-06-01T00:00:00Z
date_updated: 2026-09-16T07:02:18Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
- _id: ToHe
ec_funded: 1
external_id:
arxiv:
- '2505.19932'
file:
- access_level: open_access
checksum: 90a32defed34787e771a5c1623b6b0d2
content_type: application/pdf
creator: dernst
date_created: 2025-09-09T08:10:13Z
date_updated: 2025-09-09T08:10:13Z
file_id: '20314'
file_name: 2025_NeuS_Kresse.pdf
file_size: 295466
relation: main_file
success: 1
file_date_updated: 2025-09-09T08:10:13Z
has_accepted_license: '1'
intvolume: ' 288'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: d8f03aaa-b035-11f1-8588-d5147fa879e0
grant_number: COE12
name: Bilateral Artificial Intelligence (Lampert)
publication: 2nd International Conferenceon Neuro-Symbolic Systems
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Logic gate neural networks are good for verification
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 288
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '19508'
abstract:
- lang: eng
text: We consider random two-player zero-sum dynamic games with perfect information
on a class of infinite directed graphs. Starting from a fixed vertex, the players
take turns to move a token along the edges of the graph. Every vertex is assigned
a payoff known in advance by both players. Every time the token visits a vertex,
Player 2 pays Player 1 the corresponding payoff. We consider a distribution over
such games by assigning i.i.d. payoffs to the vertices. On the one hand, for acyclic
directed graphs of bounded degree and sub-exponential expansion, we show that,
when the duration of the game tends to infinity, the value converges almost surely
to a constant at an exponential rate dominated in terms of the expansion. On the
other hand, for the infinite d-ary tree (that does not fall into the previous
class of graphs), we show convergence at a double-exponential rate.
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria). This work was supported by the French Agence Nationale de la Recherche
(ANR) under references ANR-21-CE40-0020 (CONVERGENCE project) and ANR-20-CE40-0002
(GrHyDy), by Fondecyt grant 1220174, by ANID Chile grant ACT210005, and by the ERC
CoG 863818 (ForM-SMArt) grant. This collaboration was mainly conducted during a
1-year visit of Bruno Ziliotto to the Center for Mathematical Modeling (CMM) at
University of Chile in 2023, under the IRL program of CNRS. This work was supported
by Fondation CFM pour la Recherche. This paper has also been funded by the Agence
Nationale de la Recherche under grant ANR-17-EURE-0010 (Investissements d’Avenir
program).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Luc
full_name: Attia, Luc
last_name: Attia
- first_name: Lyuben
full_name: Lichev, Lyuben
id: 9aa8388e-d003-11ee-8458-c4c1d7447977
last_name: Lichev
- first_name: Dieter
full_name: Mitsche, Dieter
last_name: Mitsche
- 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: Bruno
full_name: Ziliotto, Bruno
last_name: Ziliotto
citation:
ama: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. Random zero-sum
dynamic games on infinite directed graphs. Dynamic Games and Applications.
2025;15:1517-1535. doi:10.1007/s13235-025-00636-4
apa: Attia, L., Lichev, L., Mitsche, D., Saona Urmeneta, R. J., & Ziliotto,
B. (2025). Random zero-sum dynamic games on infinite directed graphs. Dynamic
Games and Applications. Springer Nature. https://doi.org/10.1007/s13235-025-00636-4
chicago: Attia, Luc, Lyuben Lichev, Dieter Mitsche, Raimundo J Saona Urmeneta, and
Bruno Ziliotto. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.” Dynamic
Games and Applications. Springer Nature, 2025. https://doi.org/10.1007/s13235-025-00636-4.
ieee: L. Attia, L. Lichev, D. Mitsche, R. J. Saona Urmeneta, and B. Ziliotto, “Random
zero-sum dynamic games on infinite directed graphs,” Dynamic Games and Applications,
vol. 15. Springer Nature, pp. 1517–1535, 2025.
ista: Attia L, Lichev L, Mitsche D, Saona Urmeneta RJ, Ziliotto B. 2025. Random
zero-sum dynamic games on infinite directed graphs. Dynamic Games and Applications.
15, 1517–1535.
mla: Attia, Luc, et al. “Random Zero-Sum Dynamic Games on Infinite Directed Graphs.”
Dynamic Games and Applications, vol. 15, Springer Nature, 2025, pp. 1517–35,
doi:10.1007/s13235-025-00636-4.
short: L. Attia, L. Lichev, D. Mitsche, R.J. Saona Urmeneta, B. Ziliotto, Dynamic
Games and Applications 15 (2025) 1517–1535.
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2025-11-01T00:00:00Z
date_updated: 2026-09-16T07:00:33Z
day: '01'
ddc:
- '000'
department:
- _id: MaKw
- _id: KrCh
doi: 10.1007/s13235-025-00636-4
ec_funded: 1
external_id:
isi:
- '001449708900001'
file:
- access_level: open_access
checksum: b3a1b7eef40c9ac2acf3fef563081694
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T08:13:04Z
date_updated: 2025-12-30T08:13:04Z
file_id: '20891'
file_name: 2025_DynGamesAppl_Attia.pdf
file_size: 570994
relation: main_file
success: 1
file_date_updated: 2025-12-30T08:13:04Z
fulldoi: https://doi.org/10.1007/s13235-025-00636-4
has_accepted_license: '1'
intvolume: ' 15'
isi: 1
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 1517-1535
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Dynamic Games and Applications
publication_identifier:
eissn:
- 2153-0793
issn:
- 2153-0785
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '20234'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Random zero-sum dynamic games on infinite directed graphs
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 15
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20302'
abstract:
- lang: eng
text: "LocalSGD and SCAFFOLD are widely used methods in distributed stochastic optimization,
with numerous applications in machine learning, large-scale data processing, and
federated learning. However, rigorously establishing their theoretical advantages
over simpler methods, such as minibatch SGD (MbSGD), has proven challenging, as
existing analyses often rely on strong assumptions, unrealistic premises, or overly
restrictive scenarios.\r\n\r\nIn this work, we revisit the convergence properties
of LocalSGD and SCAFFOLD under a variety of existing or weaker conditions, including
gradient similarity, Hessian similarity, weak convexity, and Lipschitz continuity
of the Hessian. Our analysis shows that (i) LocalSGD achieves faster convergence
compared to MbSGD for weakly convex functions without requiring stronger gradient
similarity assumptions; (ii) LocalSGD benefits significantly from higher-order
similarity and smoothness; and (iii) SCAFFOLD demonstrates faster convergence
than MbSGD for a broader class of non-quadratic functions. These theoretical insights
provide a clearer understanding of the conditions under which LocalSGD and SCAFFOLD
outperform MbSGD."
acknowledgement: "The authors thank for the helpful discussions with Eduard Gorbunov,
Kumar Kshitij Patel, Anton\r\nRodomanov, and Ali Zindari during the preparation
of this work. This work was partially done during the first author’s stays at CISPA
and at MBZUAI. The first author also acknowledges ERC CoG 863818 (ForM-SMArt) and
Austrian Science Fund (FWF) 10.55776/COE12."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Ruichen
full_name: Luo, Ruichen
id: b391db08-1ffe-11ee-8b67-d18ddcfb5a14
last_name: Luo
- first_name: Sebastian U.
full_name: Stich, Sebastian U.
last_name: Stich
- first_name: Samuel
full_name: Horváth, Samuel
last_name: Horváth
- first_name: Martin
full_name: Takáč, Martin
last_name: Takáč
citation:
ama: 'Luo R, Stich SU, Horváth S, Takáč M. Revisiting LocalSGD and SCAFFOLD: Improved
rates and missing analysis. In: The 28th International Conference on Artificial
Intelligence and Statistics. Vol 258. ML Research Press; 2025:2539-2547.'
apa: 'Luo, R., Stich, S. U., Horváth, S., & Takáč, M. (2025). Revisiting LocalSGD
and SCAFFOLD: Improved rates and missing analysis. In The 28th International
Conference on Artificial Intelligence and Statistics (Vol. 258, pp. 2539–2547).
Mai Khao, Thailand: ML Research Press.'
chicago: 'Luo, Ruichen, Sebastian U. Stich, Samuel Horváth, and Martin Takáč. “Revisiting
LocalSGD and SCAFFOLD: Improved Rates and Missing Analysis.” In The 28th International
Conference on Artificial Intelligence and Statistics, 258:2539–47. ML Research
Press, 2025.'
ieee: 'R. Luo, S. U. Stich, S. Horváth, and M. Takáč, “Revisiting LocalSGD and SCAFFOLD:
Improved rates and missing analysis,” in The 28th International Conference
on Artificial Intelligence and Statistics, Mai Khao, Thailand, 2025, vol.
258, pp. 2539–2547.'
ista: 'Luo R, Stich SU, Horváth S, Takáč M. 2025. Revisiting LocalSGD and SCAFFOLD:
Improved rates and missing analysis. The 28th International Conference on Artificial
Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and
Statistics, PMLR, vol. 258, 2539–2547.'
mla: 'Luo, Ruichen, et al. “Revisiting LocalSGD and SCAFFOLD: Improved Rates and
Missing Analysis.” The 28th International Conference on Artificial Intelligence
and Statistics, vol. 258, ML Research Press, 2025, pp. 2539–47.'
short: R. Luo, S.U. Stich, S. Horváth, M. Takáč, in:, The 28th International Conference
on Artificial Intelligence and Statistics, ML Research Press, 2025, pp. 2539–2547.
conference:
end_date: 2025-05-05
location: Mai Khao, Thailand
name: 'AISTATS: Conference on Artificial Intelligence and Statistics'
start_date: 2025-05-03
date_created: 2025-09-07T22:01:35Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2026-09-16T07:01:32Z
day: '01'
department:
- _id: KrCh
ec_funded: 1
external_id:
arxiv:
- '2501.04443'
intvolume: ' 258'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2501.04443
month: '05'
oa: 1
oa_version: Preprint
page: 2539-2547
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
publication: The 28th International Conference on Artificial Intelligence and Statistics
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Revisiting LocalSGD and SCAFFOLD: Improved rates and missing analysis'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 258
year: '2025'
...
---
APC_amount: 3599,50 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20646'
abstract:
- lang: eng
text: Describing general quantum many-body dynamics is a challenging task due to
the exponential growth of the Hilbert space with system size. The time-dependent
variational principle (TDVP) provides a powerful tool to tackle this task by projecting
quantum evolution onto a classical dynamical system within a variational manifold.
In classical systems, periodic orbits play a crucial role in understanding the
structure of the phase space and the long-term behavior of the system. However,
finding periodic orbits is generally difficult, and their existence and properties
in generic TDVP dynamics over matrix product states have remained largely unexplored.
In this work, we develop an algorithm to systematically identify and characterize
periodic orbits in TDVP dynamics. Applying our method to the periodically kicked
Ising model, we uncover both stable and unstable periodic orbits. We characterize
the Kolmogorov-Arnold-Moser tori in the vicinity of stable periodic orbits and
track the change of the periodic orbits as we modify the Hamiltonian parameters.
We observe that periodic orbits exist at any value of the coupling constant of
the kicked Ising model between prethermal and fully thermalizing regimes, but
their relevance to quantum dynamics and imprint on quantum eigenstates diminishes
as the system leaves the prethermal regime. Our results demonstrate that periodic
orbits provide valuable insights into the TDVP approximation of quantum many-body
evolution and establish a closer connection between quantum and classical chaos.
acknowledgement: We acknowledge useful discussions with C. Kollath, A. Green, and
D. Huse. E.P., M.L., and M.S. acknowledge support by the European Research Council
under the European Union’s Horizon 2020 research and innovation program (Grant Agreement
No. 850899). This research was funded in whole or in part by the Austrian Science
Fund (FWF) (Grant No. 10.55776/COE1). For open access purposes, the author has applied
a CC BY public copyright license to any author accepted manuscript version arising
from this submission. M.L. acknowledges support by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868.
This research was supported in part by National Science Foundation (NSF) Grant No.
PHY-2309135 to the Kavli Institute for Theoretical Physics (KITP) and by the Erwin
Schrödinger International Institute for Mathematics and Physics (ESI).
article_number: '040333'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Elena
full_name: Petrova, Elena
id: 0ac84990-897b-11ed-a09c-f5abb56a4ede
last_name: Petrova
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
- first_name: Gökhan
full_name: Yalniz, Gökhan
id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
last_name: Yalniz
orcid: 0000-0002-8490-9312
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Petrova E, Ljubotina M, Yalniz G, Serbyn M. Finding periodic orbits in projected
quantum many-body dynamics. PRX Quantum. 2025;6(4). doi:10.1103/tldp-kvkd
apa: Petrova, E., Ljubotina, M., Yalniz, G., & Serbyn, M. (2025). Finding periodic
orbits in projected quantum many-body dynamics. PRX Quantum. American Physical
Society. https://doi.org/10.1103/tldp-kvkd
chicago: Petrova, Elena, Marko Ljubotina, Gökhan Yalniz, and Maksym Serbyn. “Finding
Periodic Orbits in Projected Quantum Many-Body Dynamics.” PRX Quantum.
American Physical Society, 2025. https://doi.org/10.1103/tldp-kvkd.
ieee: E. Petrova, M. Ljubotina, G. Yalniz, and M. Serbyn, “Finding periodic orbits
in projected quantum many-body dynamics,” PRX Quantum, vol. 6, no. 4. American
Physical Society, 2025.
ista: Petrova E, Ljubotina M, Yalniz G, Serbyn M. 2025. Finding periodic orbits
in projected quantum many-body dynamics. PRX Quantum. 6(4), 040333.
mla: Petrova, Elena, et al. “Finding Periodic Orbits in Projected Quantum Many-Body
Dynamics.” PRX Quantum, vol. 6, no. 4, 040333, American Physical Society,
2025, doi:10.1103/tldp-kvkd.
short: E. Petrova, M. Ljubotina, G. Yalniz, M. Serbyn, PRX Quantum 6 (2025).
corr_author: '1'
date_created: 2025-11-14T09:40:52Z
date_published: 2025-11-12T00:00:00Z
date_updated: 2026-09-16T07:04:35Z
day: '12'
ddc:
- '539'
department:
- _id: GradSch
- _id: BjHo
- _id: MaSe
doi: 10.1103/tldp-kvkd
ec_funded: 1
external_id:
arxiv:
- '2504.12472'
isi:
- '001616473700003'
file:
- access_level: open_access
checksum: 5d6d04ac518b4118405334e1ddc7a56d
content_type: application/pdf
creator: gyalniz
date_created: 2025-11-14T09:44:10Z
date_updated: 2025-11-14T09:44:10Z
file_id: '20647'
file_name: tldp-kvkd.pdf
file_size: 2504713
relation: main_file
success: 1
file_date_updated: 2025-11-14T09:44:10Z
fulldoi: https://doi.org/10.1103/tldp-kvkd
has_accepted_license: '1'
intvolume: ' 6'
isi: 1
issue: '4'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
- _id: 92c64506-16d5-11f0-9cad-87ce313ee832
grant_number: COE01
name: Quantum Science Austria (Serbyn)
publication: PRX Quantum
publication_identifier:
eissn:
- 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/reaching-for-the-quantum-scars/
scopus_import: '1'
status: public
title: Finding periodic orbits in projected quantum many-body dynamics
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20709'
abstract:
- lang: eng
text: Non-Hermitian many-body localization (NH MBL) has emerged as a possible scenario
for stable localization in open systems, as suggested by spectral indicators identifying
a putative transition for finite system sizes. In this work, we shift the focus
to dynamical probes, specifically the steady-state spin current, to investigate
transport properties in a disordered, non-Hermitian XXZ spin chain. Through exact
diagonalization for small systems and tensor-network methods for larger chains,
we demonstrate that the steady-state current remains finite and decays exponentially
with disorder strength, showing no evidence of a transition up to disorder values
far beyond the previously claimed critical point. Our results reveal a stark discrepancy
between spectral indicators, which suggest localization, and transport behavior,
which indicates delocalization. This highlights the importance of dynamical observables
in characterizing NH MBL and suggests that traditional spectral measures may not
fully capture the physics of non-Hermitian systems. Additionally, we observe a
noncommutativity of limits in system size and time, further complicating the interpretation
of finite-size studies. These findings challenge the existence of NH MBL in the
studied model and underscore the need for alternative approaches to understanding
localization in non-Hermitian settings.
acknowledgement: "F.B. thanks Giuseppe de Tomasi and Oskar A. Prośniak for discussion.
P.B. acknowledges support by the Austrian Science Fund (FWF) (Grant Agreement No.
10.55776/ESP9057324). This research was funded in whole or in part by the Austrian
Science Fund (FWF) [10.55776/COE1]. The numerical simulations were performed using
the ITensor library [73] on the Vienna Scientific Cluster (VSC) and on the MPIPKS
HPC cluster. M.L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG,
German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868.
F.R. acknowledges support by the European Union-Next Generation EU with the project
“Quantum Optics in Many-Body photonic Environments” (QOMBE) code SOE2024_0000084-CUP
B77G24000480006. Open\r\naccess publication funded by Max Planck Society."
article_number: L042014
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Pietro
full_name: Brighi, Pietro
id: 4115AF5C-F248-11E8-B48F-1D18A9856A87
last_name: Brighi
orcid: 0000-0002-7969-2729
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
- first_name: Federico
full_name: Roccati, Federico
last_name: Roccati
- first_name: Federico
full_name: Balducci, Federico
last_name: Balducci
citation:
ama: Brighi P, Ljubotina M, Roccati F, Balducci F. Finite steady-state current defies
non-Hermitian many-body localization. Physical Review Research. 2025;7(4).
doi:10.1103/crwj-x7j8
apa: Brighi, P., Ljubotina, M., Roccati, F., & Balducci, F. (2025). Finite steady-state
current defies non-Hermitian many-body localization. Physical Review Research.
American Physical Society. https://doi.org/10.1103/crwj-x7j8
chicago: Brighi, Pietro, Marko Ljubotina, Federico Roccati, and Federico Balducci.
“Finite Steady-State Current Defies Non-Hermitian Many-Body Localization.” Physical
Review Research. American Physical Society, 2025. https://doi.org/10.1103/crwj-x7j8.
ieee: P. Brighi, M. Ljubotina, F. Roccati, and F. Balducci, “Finite steady-state
current defies non-Hermitian many-body localization,” Physical Review Research,
vol. 7, no. 4. American Physical Society, 2025.
ista: Brighi P, Ljubotina M, Roccati F, Balducci F. 2025. Finite steady-state current
defies non-Hermitian many-body localization. Physical Review Research. 7(4), L042014.
mla: Brighi, Pietro, et al. “Finite Steady-State Current Defies Non-Hermitian Many-Body
Localization.” Physical Review Research, vol. 7, no. 4, L042014, American
Physical Society, 2025, doi:10.1103/crwj-x7j8.
short: P. Brighi, M. Ljubotina, F. Roccati, F. Balducci, Physical Review Research
7 (2025).
date_created: 2025-11-30T23:02:08Z
date_published: 2025-10-01T00:00:00Z
date_updated: 2026-09-16T07:06:16Z
day: '01'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/crwj-x7j8
external_id:
arxiv:
- '2504.02460'
file:
- access_level: open_access
checksum: c4e582ab64ab9f8fface70bf2fd31882
content_type: application/pdf
creator: dernst
date_created: 2025-12-01T08:00:19Z
date_updated: 2025-12-01T08:00:19Z
file_id: '20715'
file_name: 2025_PhysReviewResearch_Brighi.pdf
file_size: 483879
relation: main_file
success: 1
file_date_updated: 2025-12-01T08:00:19Z
fulldoi: https://doi.org/10.1103/crwj-x7j8
has_accepted_license: '1'
intvolume: ' 7'
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
project:
- _id: 92c64506-16d5-11f0-9cad-87ce313ee832
grant_number: COE01
name: Quantum Science Austria (Serbyn)
publication: Physical Review Research
publication_identifier:
eissn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Finite steady-state current defies non-Hermitian many-body localization
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: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2025'
...