---
OA_place: repository
_id: '22704'
abstract:
- lang: eng
text: "The medial habenula (MHb) is implicated in regulating emotional responses
to aversive events. Studies in zebrafish have identified a remarkable morphological
left–right asymmetry in the dorsal habenula (zebrafish equivalent of mammalian
MHb)-interpeduncular nucleus (IPN) pathway and its asymmetrical roles in behavior.
However, there is little evidence for structural or functional lateralization
in the mammalian MHb-IPN pathway. Here, we investigated the synaptic properties
of left- and right-MHb afferents to the IPN and their roles in the expression
of conditioned fear in mice. We found that each IPN neuron receives inputs from
both left and right MHb, but the left MHb-originating synapses exhibit lower release
probability and higher γ-aminobutyric acid type B receptor (GABABR)-mediated potentiation
compared to the right MHb-originating synapses. Interestingly, these asymmetrical
properties persist in the inversus visceral mutant mice with normal internal organ
laterality (situs solitus), but nearly disappear in those with reversed internal
organ laterality (situs inversus). Behaviorally, chemogenetic inhibition of cholinergic
neurons and conditional deletion of GABABR in the left, but not the right, MHb
significantly attenuated cue-dependent fear recall. Our results demonstrate functional
asymmetry of the MHb under partial influence of the nodal flow in mice, revealing
a predominant role of GABABR-mediated signaling in the left MHb-IPN pathway in
modulating fear memories. These findings suggest that lateralized MHb pathways
could represent a fundamental principle in the neural regulation of emotion across
species but that they develop differently in zebrafish and mice.\r\n"
acknowledged_ssus:
- _id: M-Shop
- _id: PreCl
article_processing_charge: No
author:
- first_name: Elodie
full_name: Le Monnier, Elodie
id: 3B59276A-F248-11E8-B48F-1D18A9856A87
last_name: Le Monnier
- first_name: Cihan
full_name: Önal, Cihan
last_name: Önal
citation:
ama: Le Monnier E, Önal C. Asymmetrical modulation of fear expression via GABAB
receptors in the mouse medial habenula. 2026. doi:10.15479/AT-ISTA-22704
apa: Le Monnier, E., & Önal, C. (2026). Asymmetrical modulation of fear expression
via GABAB receptors in the mouse medial habenula. Institute of Science and Technology
Austria. https://doi.org/10.15479/AT-ISTA-22704
chicago: Le Monnier, Elodie, and Cihan Önal. “Asymmetrical Modulation of Fear Expression
via GABAB Receptors in the Mouse Medial Habenula.” Institute of Science and Technology
Austria, 2026. https://doi.org/10.15479/AT-ISTA-22704.
ieee: E. Le Monnier and C. Önal, “Asymmetrical modulation of fear expression via
GABAB receptors in the mouse medial habenula.” Institute of Science and Technology
Austria, 2026.
ista: Le Monnier E, Önal C. 2026. Asymmetrical modulation of fear expression via
GABAB receptors in the mouse medial habenula, Institute of Science and Technology
Austria, 10.15479/AT-ISTA-22704.
mla: Le Monnier, Elodie, and Cihan Önal. Asymmetrical Modulation of Fear Expression
via GABAB Receptors in the Mouse Medial Habenula. Institute of Science and
Technology Austria, 2026, doi:10.15479/AT-ISTA-22704.
short: E. Le Monnier, C. Önal, (2026).
corr_author: '1'
date_created: 2026-08-13T12:20:08Z
date_published: 2026-08-13T00:00:00Z
date_updated: 2026-09-16T09:55:15Z
day: '13'
department:
- _id: RySh
doi: 10.15479/AT-ISTA-22704
doi_confirm: '1'
ec_funded: 1
file:
- access_level: open_access
checksum: 7742bb211a43bb87c2b5ce7bda3068ae
content_type: application/x-zip-compressed
creator: elemonni
date_created: 2026-08-13T12:07:53Z
date_updated: 2026-08-13T12:07:53Z
file_id: '22705'
file_name: Behavior.zip
file_size: 162086
relation: main_file
success: 1
- access_level: open_access
checksum: a162eb6103a770d94536374e02934fcf
content_type: application/x-zip-compressed
creator: elemonni
date_created: 2026-08-13T12:07:57Z
date_updated: 2026-08-13T12:07:57Z
file_id: '22706'
file_name: image_analysis.zip
file_size: 6643
relation: main_file
success: 1
- access_level: open_access
checksum: 608aaf395bba5fd9cf62d8c8940d63aa
content_type: application/x-zip-compressed
creator: elemonni
date_created: 2026-08-13T12:07:59Z
date_updated: 2026-08-13T12:07:59Z
file_id: '22707'
file_name: Recordings.zip
file_size: 1193016
relation: main_file
success: 1
- access_level: open_access
checksum: 2389ebd71238bd7de03d20504a8cf962
content_type: text/plain
creator: elemonni
date_created: 2026-08-13T13:06:29Z
date_updated: 2026-08-13T13:06:29Z
file_id: '22708'
file_name: README.txt
file_size: 246
relation: main_file
success: 1
file_date_updated: 2026-08-13T13:06:29Z
fulldoi: https://doi.org/10.15479/AT-ISTA-22704
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '08'
oa: 1
oa_version: None
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 92503f6e-16d5-11f0-9cad-8c571927f3b7
grant_number: PAT 5720324
name: New regime of presynaptic release regulation
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22913'
relation: used_in_publication
status: public
status: public
title: Asymmetrical modulation of fear expression via GABAB receptors in the mouse
medial habenula
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22923'
abstract:
- lang: eng
text: "We study the sensitivity of the eigenvectors of random matrices, showing
that even small perturbations make the eigenvectors almost orthogonal. More precisely,
we consider two deformed Wigner matrices \U0001D44A +\U0001D4371, \U0001D44A +\U0001D4372
and show that their bulk eigenvectors become asymptotically orthogonal as soon
as Tr(\U0001D4371−\U0001D4372)2 ≫1, or their respective energies are separated
on a scale much bigger than the local eigenvalue spacing. Furthermore, we show
that quadratic forms of eigenvectors of \U0001D44A +\U0001D4371, \U0001D44A +\U0001D4372
with any deterministic matrix \U0001D434 ∈\U0001D402\U0001D441×\U0001D441 in a
specific subspace of codimension one are of size \U0001D441−1/2. This proves a
generalization of the eigenstate thermalization hypothesis to eigenvectors belonging
to two different spectral families."
acknowledgement: L. Erdős, J. Henheik and O. Kolupaiev were supported by the ERC Advanced
Grant “RMTBeyond” No. 101020331. G. Cipolloni is partially supported by the MUR
Excellence Department Project MatMod@TOV awarded to the Department of Mathematics,
University of Rome Tor Vergata, CUP E83C18000100006.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Sven Joscha
full_name: Henheik, Sven Joscha
id: 31d731d7-d235-11ea-ad11-b50331c8d7fb
last_name: Henheik
orcid: 0000-0003-1106-327X
- first_name: Oleksii
full_name: Kolupaiev, Oleksii
id: 149b70d4-896a-11ed-bdf8-8c63fd44ca61
last_name: Kolupaiev
orcid: 0000-0003-1491-4623
citation:
ama: Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. Eigenvector decorrelation for
random matrices. Annals of Applied Probability. 2026;36(4):3707-3756. doi:10.1214/26-AAP2318
apa: Cipolloni, G., Erdös, L., Henheik, S. J., & Kolupaiev, O. (2026). Eigenvector
decorrelation for random matrices. Annals of Applied Probability. Institute
of Mathematical Statistics. https://doi.org/10.1214/26-AAP2318
chicago: Cipolloni, Giorgio, László Erdös, Sven Joscha Henheik, and Oleksii Kolupaiev.
“Eigenvector Decorrelation for Random Matrices.” Annals of Applied Probability.
Institute of Mathematical Statistics, 2026. https://doi.org/10.1214/26-AAP2318.
ieee: G. Cipolloni, L. Erdös, S. J. Henheik, and O. Kolupaiev, “Eigenvector decorrelation
for random matrices,” Annals of Applied Probability, vol. 36, no. 4. Institute
of Mathematical Statistics, pp. 3707–3756, 2026.
ista: Cipolloni G, Erdös L, Henheik SJ, Kolupaiev O. 2026. Eigenvector decorrelation
for random matrices. Annals of Applied Probability. 36(4), 3707–3756.
mla: Cipolloni, Giorgio, et al. “Eigenvector Decorrelation for Random Matrices.”
Annals of Applied Probability, vol. 36, no. 4, Institute of Mathematical
Statistics, 2026, pp. 3707–56, doi:10.1214/26-AAP2318.
short: G. Cipolloni, L. Erdös, S.J. Henheik, O. Kolupaiev, Annals of Applied Probability
36 (2026) 3707–3756.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:54Z
date_published: 2026-08-01T00:00:00Z
date_updated: 2026-09-16T10:00:54Z
day: '01'
department:
- _id: LaEr
- _id: GradSch
doi: 10.1214/26-AAP2318
ec_funded: 1
external_id:
arxiv:
- '2410.10718'
fulldoi: https://doi.org/10.1214/26-AAP2318
intvolume: ' 36'
issue: '4'
keyword:
- characteristic flow
- Davis–Kahan theorem
- Eigenstate thermalization
- Eigenvector perturbation theory
- Local law
- zigzag strategy
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2410.10718
mathsc:
- 60B20
- 82C10
month: '08'
oa: 1
oa_version: Preprint
page: 3707-3756
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: Annals of Applied Probability
publication_identifier:
issn:
- 1050-5164
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
related_material:
record:
- id: '19546'
relation: earlier_version
status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Eigenvector decorrelation for random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 36
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22926'
abstract:
- lang: eng
text: Adeno-associated viruses (AAVs) provide a versatile tool for labeling neurons
in the Xenopus central nervous system across developmental stages. AAV-mediated
transgene expression is long-lasting and stable, enabling robust labeling of neuronal
populations without genomic integration and without the need to generate transgenic
lines. The choice of AAV capsid and promoter can restrict expression to a population
of interest, and depending on the route and timing of delivery, AAVs can selectively
target either progenitor-derived neuronal cohorts or mature neuronal populations.
Here, we have outlined two labeling strategies. First, intraventricular injections
in tadpoles transduce neural progenitor cells lining the ventricular system, resulting
in cohort-based labeling of neurons as they differentiate during development.
Second, direct intraparenchymal injections in post-metamorphic frogs enable spatially
restricted labeling and anterograde or retrograde tracing of connectivity within
defined brain regions. Together, these approaches provide selective access to
developing and mature neural circuits in X. laevis, supporting applications ranging
from anatomical tracing to functional imaging and manipulation of neural circuits.
acknowledgement: This work was supported by a Horizon Europe ERC Starting Grant Number
101041551 (L.B.S. and D.V.), FTI Strategy Lower Austria Dissertation Grant Number
FT121-D-046 (D.V.), NSF IOS Grant Number 2110086 (L.B.S. and D.V.), Special Research
Program (SFB) of the Austrian Science Fund (FWF) F7814-B (L.B.S.), and Austrian
Science Fund (FWF) 10.55776/COE16 (L.B.S. and D.V.).
alternative_title:
- Methods in Molecular Biology
article_processing_charge: Yes (in subscription journal)
author:
- first_name: David
full_name: Vijatovic, David
id: cf391e77-ec3c-11ea-a124-d69323410b58
last_name: Vijatovic
orcid: 0000-0002-5494-0941
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
citation:
ama: 'Vijatovic D, Sweeney LB. Adeno-Associated Virus (AAV) for tracking neural
development and connectivity in Xenopus. In: Beck CW, ed. Xenopus. Vol
3049. MIMB. Springer; 2026:219-229. doi:10.1007/978-1-0716-5360-9_9'
apa: Vijatovic, D., & Sweeney, L. B. (2026). Adeno-Associated Virus (AAV) for
tracking neural development and connectivity in Xenopus. In C. W. Beck (Ed.),
Xenopus (Vol. 3049, pp. 219–229). Springer. https://doi.org/10.1007/978-1-0716-5360-9_9
chicago: Vijatovic, David, and Lora B. Sweeney. “Adeno-Associated Virus (AAV) for
Tracking Neural Development and Connectivity in Xenopus.” In Xenopus, edited
by Caroline W. Beck, 3049:219–29. MIMB. Springer, 2026. https://doi.org/10.1007/978-1-0716-5360-9_9.
ieee: D. Vijatovic and L. B. Sweeney, “Adeno-Associated Virus (AAV) for tracking
neural development and connectivity in Xenopus,” in Xenopus, vol. 3049,
C. W. Beck, Ed. Springer, 2026, pp. 219–229.
ista: 'Vijatovic D, Sweeney LB. 2026.Adeno-Associated Virus (AAV) for tracking neural
development and connectivity in Xenopus. In: Xenopus. Methods in Molecular Biology,
vol. 3049, 219–229.'
mla: Vijatovic, David, and Lora B. Sweeney. “Adeno-Associated Virus (AAV) for Tracking
Neural Development and Connectivity in Xenopus.” Xenopus, edited by Caroline
W. Beck, vol. 3049, Springer, 2026, pp. 219–29, doi:10.1007/978-1-0716-5360-9_9.
short: D. Vijatovic, L.B. Sweeney, in:, C.W. Beck (Ed.), Xenopus, Springer, 2026,
pp. 219–229.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:56Z
date_published: 2026-09-02T00:00:00Z
date_updated: 2026-09-17T08:03:32Z
day: '02'
ddc:
- '570'
department:
- _id: LoSw
doi: 10.1007/978-1-0716-5360-9_9
editor:
- first_name: Caroline W.
full_name: Beck, Caroline W.
last_name: Beck
external_id:
pmid:
- '42681226'
file:
- access_level: open_access
checksum: ea5af1374dd6820830773e0e96535ac0
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T08:00:45Z
date_updated: 2026-09-17T08:00:45Z
file_id: '22939'
file_name: 2026_MIMB_Vijatovic2.pdf
file_size: 852042
relation: main_file
success: 1
file_date_updated: 2026-09-17T08:00:45Z
fulldoi: https://doi.org/10.1007/978-1-0716-5360-9_9
has_accepted_license: '1'
intvolume: ' 3049'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1007/978-1-0716-5360-9_9
month: '09'
oa: 1
oa_version: Published Version
page: 219-229
pmid: 1
project:
- _id: ebb66355-77a9-11ec-83b8-b8ac210a4dae
grant_number: '101041551'
name: Development and Evolution of Tetrapod Motor Circuits
- _id: bd73af52-d553-11ed-ba76-912049f0ac7a
grant_number: FTI21-D-046
name: Development of V1 interneuron diversity during swim-to-walk transition of
Xenopus metamorphosis
- _id: 8da85f50-16d5-11f0-9cad-eab8b0ff6c9e
grant_number: F7814
name: 'Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb
transition: cell type to connection diversity'
- _id: cf428362-b037-11f1-b015-8277a8a2f63d
grant_number: COE16
name: Neuronal circuits in health and disease (Sweeney)
- _id: 34a02c70-11ca-11ed-8bc3-fbfd2c86c88f
grant_number: 3(GG016346-01)
name: Development of Viral Vectors for Amphibian Gene Delivery and Manipulation
publication: Xenopus
publication_identifier:
eissn:
- 1940-6029
publication_status: published
publisher: Springer
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
series_title: MIMB
status: public
supplementarymaterial: no
title: Adeno-Associated Virus (AAV) for tracking neural development and connectivity
in Xenopus
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3049
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22925'
abstract:
- lang: eng
text: Hybridization Chain Reaction (HCR) enables highly sensitive and multiplexed
detection of mRNA with subcellular spatial resolution. It employs fluorophore-tagged
DNA hairpins that self-assemble on target-bound probe pairs, amplifying the signal
without enzymatic reactions. Here, we describe a protocol for performing HCR fluorescence
in situ hybridization (FISH) on Xenopus tissue sections. We also outline a semi-automated
image analysis pipeline that enables per-cell quantification of probe expression
and co-localization. This method provides a robust and quantitative approach for
visualizing gene expression patterns in situ.
acknowledgement: "This work was supported by a Horizon Europe ERC Starting Grant\r\nNumber
101041551 (L.B.S., D.V., S.P.), Special Research Program\r\n(SFB) of the Austrian
Science Fund (FWF) F7814-B (L.B.S., S.P.),\r\nAustrian Science Fund (FWF) 10.55776/COE16
(L.B.S.), FTI\r\nStrategy Lower Austria Dissertation Grant Number FT121-D-046\r\n(D.V.),
and Austrian Academy of Sciences DOC Fellowship 27229\r\n(S.P.). We also thank the
Imaging & Optics and Scientific Computing Facilities at ISTA for their support in
developing the quantification pipeline."
alternative_title:
- Methods in Molecular Biology
article_processing_charge: No
author:
- first_name: David
full_name: Vijatovic, David
id: cf391e77-ec3c-11ea-a124-d69323410b58
last_name: Vijatovic
orcid: 0000-0002-5494-0941
- first_name: Stavros
full_name: Papadopoulos, Stavros
id: 40606b92-f128-11eb-9611-bf66a98cfa5c
last_name: Papadopoulos
- first_name: Marco
full_name: Dalla Vecchia, Marco
id: 02a7a869-ff06-11ed-a87f-86649d6077e5
last_name: Dalla Vecchia
- first_name: Lora Beatrice Jaeger
full_name: Sweeney, Lora Beatrice Jaeger
id: 56BE8254-C4F0-11E9-8E45-0B23E6697425
last_name: Sweeney
orcid: 0000-0001-9242-5601
citation:
ama: 'Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. Fluorescent in situ
mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in Xenopus
cryosections. In: Beck CW, ed. Xenopus. Vol 3049. MIMB. Springer; 2026:245-259.
doi:10.1007/978-1-0716-5360-9_11'
apa: Vijatovic, D., Papadopoulos, S., Dalla Vecchia, M., & Sweeney, L. B. (2026).
Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction
(HCR) in Xenopus cryosections. In C. W. Beck (Ed.), Xenopus (Vol. 3049,
pp. 245–259). Springer. https://doi.org/10.1007/978-1-0716-5360-9_11
chicago: Vijatovic, David, Stavros Papadopoulos, Marco Dalla Vecchia, and Lora B.
Sweeney. “Fluorescent in Situ MRNA Hybridization (FISH) Using Hybridization Chain
Reaction (HCR) in Xenopus Cryosections.” In Xenopus, edited by Caroline
W. Beck, 3049:245–59. MIMB. Springer, 2026. https://doi.org/10.1007/978-1-0716-5360-9_11.
ieee: D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, and L. B. Sweeney, “Fluorescent
in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in
Xenopus cryosections,” in Xenopus, vol. 3049, C. W. Beck, Ed. Springer,
2026, pp. 245–259.
ista: 'Vijatovic D, Papadopoulos S, Dalla Vecchia M, Sweeney LB. 2026.Fluorescent
in situ mRNA hybridization (FISH) using Hybridization Chain Reaction (HCR) in
Xenopus cryosections. In: Xenopus. Methods in Molecular Biology, vol. 3049, 245–259.'
mla: Vijatovic, David, et al. “Fluorescent in Situ MRNA Hybridization (FISH) Using
Hybridization Chain Reaction (HCR) in Xenopus Cryosections.” Xenopus, edited
by Caroline W. Beck, vol. 3049, Springer, 2026, pp. 245–59, doi:10.1007/978-1-0716-5360-9_11.
short: D. Vijatovic, S. Papadopoulos, M. Dalla Vecchia, L.B. Sweeney, in:, C.W.
Beck (Ed.), Xenopus, Springer, 2026, pp. 245–259.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:55Z
date_published: 2026-09-02T00:00:00Z
date_updated: 2026-09-17T07:31:16Z
day: '02'
ddc:
- '570'
department:
- _id: LoSw
- _id: GradSch
- _id: IAS
doi: 10.1007/978-1-0716-5360-9_11
editor:
- first_name: Caroline W.
full_name: Beck, Caroline W.
last_name: Beck
external_id:
pmid:
- '42681228'
file:
- access_level: open_access
checksum: e7a075a9ee1b91d5824f8f2b9b1f3c9b
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T07:28:53Z
date_updated: 2026-09-17T07:28:53Z
file_id: '22938'
file_name: 2026_MIMB_Vijatovic.pdf
file_size: 1004024
relation: main_file
success: 1
file_date_updated: 2026-09-17T07:28:53Z
fulldoi: https://doi.org/10.1007/978-1-0716-5360-9_11
has_accepted_license: '1'
intvolume: ' 3049'
keyword:
- mRNA FISH
- Hybridization chain reaction
- In situ hybridization
- Fluorescence microscopy
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 245-259
pmid: 1
project:
- _id: ebb66355-77a9-11ec-83b8-b8ac210a4dae
grant_number: '101041551'
name: Development and Evolution of Tetrapod Motor Circuits
- _id: 8da85f50-16d5-11f0-9cad-eab8b0ff6c9e
grant_number: F7814
name: 'Stem Cell Modulation in Neural Development and Regeneration/ P14-Swim-to-limb
transition: cell type to connection diversity'
- _id: cf428362-b037-11f1-b015-8277a8a2f63d
grant_number: COE16
name: Neuronal circuits in health and disease (Sweeney)
- _id: bd73af52-d553-11ed-ba76-912049f0ac7a
grant_number: FTI21-D-046
name: Development of V1 interneuron diversity during swim-to-walk transition of
Xenopus metamorphosis
- _id: 907b765e-16d5-11f0-9cad-fef108a945b1
grant_number: '27229'
name: 'A Tale of Two Circuits: Rostrocaudal spinal cord patterning during the swim-to-limb
transition of Xenopus metamorphosis'
publication: Xenopus
publication_identifier:
eissn:
- 1940-6029
publication_status: published
publisher: Springer
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
series_title: MIMB
status: public
supplementarymaterial: no
title: Fluorescent in situ mRNA hybridization (FISH) using Hybridization Chain Reaction
(HCR) in Xenopus cryosections
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 3049
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22927'
abstract:
- lang: eng
text: Auxin and calcium (Ca2+) are central plant signals that coordinate growth,
development, and responses to environmental cues. Typically studied as largely
parallel pathways, they are now increasingly recognized as interconnected networks
whose activities converge at multiple regulatory levels. Recent advances in live
imaging, biosensors, optogenetics, and structural approaches have revealed that
auxin can rapidly trigger Ca2+ influx from the apoplast via TRANSPORT INHIBITOR
RESPONSE1 (TIR1)/AUXIN-SIGNALING F-BOX (AFB)-dependent signaling mechanisms and
Ca2+ channels, presumably involving cyclic nucleotides produced by TIR1/AFB auxin
receptors. Conversely, Ca2+ signals arising from mechanosensing, wounding, and
environmental stress can modulate auxin transport, signaling, and transcriptional
outputs. Together, these discoveries highlight a dynamic, reciprocal signaling
axis where Ca2+ acts both downstream and upstream of auxin to shape growth, development,
tropisms, and regeneration.
acknowledgement: The authors would like to acknowledge many colleagues whose valuable
contributions to the field could not be included in this review due to space limitations
and reference constraints.
article_processing_charge: No
article_type: original
author:
- first_name: Milan
full_name: Zupunski, Milan
id: f6a21fce-573e-11f0-a150-a8d96aee2539
last_name: Zupunski
- first_name: Guido
full_name: Grossmann, Guido
last_name: Grossmann
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Zupunski M, Grossmann G, Friml J. Decoding dialog: The auxin–calcium signaling
crosstalk in plants. Trends in Plant Science. 2026. doi:10.1016/j.tplants.2026.08.002'
apa: 'Zupunski, M., Grossmann, G., & Friml, J. (2026). Decoding dialog: The
auxin–calcium signaling crosstalk in plants. Trends in Plant Science. Cell
Press. https://doi.org/10.1016/j.tplants.2026.08.002'
chicago: 'Zupunski, Milan, Guido Grossmann, and Jiří Friml. “Decoding Dialog: The
Auxin–Calcium Signaling Crosstalk in Plants.” Trends in Plant Science.
Cell Press, 2026. https://doi.org/10.1016/j.tplants.2026.08.002.'
ieee: 'M. Zupunski, G. Grossmann, and J. Friml, “Decoding dialog: The auxin–calcium
signaling crosstalk in plants,” Trends in Plant Science. Cell Press, 2026.'
ista: 'Zupunski M, Grossmann G, Friml J. 2026. Decoding dialog: The auxin–calcium
signaling crosstalk in plants. Trends in Plant Science.'
mla: 'Zupunski, Milan, et al. “Decoding Dialog: The Auxin–Calcium Signaling Crosstalk
in Plants.” Trends in Plant Science, Cell Press, 2026, doi:10.1016/j.tplants.2026.08.002.'
short: M. Zupunski, G. Grossmann, J. Friml, Trends in Plant Science (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:56Z
date_published: 2026-09-04T00:00:00Z
date_updated: 2026-09-17T07:42:27Z
day: '04'
ddc:
- '580'
department:
- _id: JiFr
doi: 10.1016/j.tplants.2026.08.002
external_id:
pmid:
- '42692943'
fulldoi: https://doi.org/10.1016/j.tplants.2026.08.002
has_accepted_license: '1'
keyword:
- auxin
- calcium
- rapid signaling
- crosstalk
- growth regulation
- cyclic nucleotides
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.1016/j.tplants.2026.08.002
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Trends in Plant Science
publication_identifier:
eissn:
- 1878-4372
issn:
- 1360-1385
publication_status: epub_ahead
publisher: Cell Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Decoding dialog: The auxin–calcium signaling crosstalk in plants'
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
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22914'
abstract:
- lang: eng
text: "We present the first truly subquadratic time algorithm to compute diameter
and eccentricities in real-weighted directed graphs with constant distance VC-dimension
and strongly sublinear-sized balanced separators. For real-weighted K_h-minor-free
digraphs, this runs in O(n^{2-1/(2h-2)} polylog(n)) time.\r\nPrior to this work,
truly subquadratic time computation of diameter was only known for real-weighted
planar graphs, while extensions to broader classes like minor-free graphs were
restricted to unweighted settings. In particular, existing algorithms that use
VC-dimension [Ducoffe, Habib, Viennot; SICOMP 2022] [Le, Wulff-Nilsen; SODA 2024]
[Chan, Chang, Gao, Le, Kisfaludi-Bak, Zheng; FOCS 2025] work with small integer
weights, but do not naturally generalize to real weights. We overcome this barrier
by introducing a randomized search-to-decision reduction, demonstrating that VC-dimension
is a sufficiently powerful tool in the real-weighted regime."
acknowledgement: "This project has received funding from the Austrian Science Fund
(FWF)\r\ngrant DOI 10.55776/I5982. For open access purposes, the author has applied
a CC BY public\r\ncopyright license to any author-accepted manuscript version arising
from this submission. Thanks to Jie Gao for feedback on a preliminary version of
the manuscript"
alternative_title:
- LIPIcs
article_number: 61:1-61:12
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Da Wei
full_name: Zheng, Da Wei
id: af77956b-e859-11ef-8dc9-d301b898e32f
last_name: Zheng
citation:
ama: 'Zheng DW. Real-weighted diameter and eccentricities of minor-free and bounded
VC-dimension graphs in truly subquadratic time. In: 34th Annual European Symposium
on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2026. doi:10.4230/LIPIcs.ESA.2026.61'
apa: 'Zheng, D. W. (2026). Real-weighted diameter and eccentricities of minor-free
and bounded VC-dimension graphs in truly subquadratic time. In 34th Annual
European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.61'
chicago: Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free
and Bounded VC-Dimension Graphs in Truly Subquadratic Time.” In 34th Annual
European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.61.
ieee: D. W. Zheng, “Real-weighted diameter and eccentricities of minor-free and
bounded VC-dimension graphs in truly subquadratic time,” in 34th Annual European
Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388.
ista: 'Zheng DW. 2026. Real-weighted diameter and eccentricities of minor-free and
bounded VC-dimension graphs in truly subquadratic time. 34th Annual European Symposium
on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 61:1-61:12.'
mla: Zheng, Da Wei. “Real-Weighted Diameter and Eccentricities of Minor-Free and
Bounded VC-Dimension Graphs in Truly Subquadratic Time.” 34th Annual European
Symposium on Algorithms, vol. 388, 61:1-61:12, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.61.
short: D.W. Zheng, in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2026.
conference:
end_date: 2026-09-04
location: L’Aquila, Italy
name: 'ESA: European Symposium on Algorithms'
start_date: 2026-08-31
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:52Z
date_published: 2026-08-25T00:00:00Z
date_updated: 2026-09-17T09:31:02Z
day: '25'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ESA.2026.61
external_id:
arxiv:
- '2607.01926'
file:
- access_level: open_access
checksum: 574f50435b092a72041c7365cac3d280
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T09:28:04Z
date_updated: 2026-09-17T09:28:04Z
file_id: '22942'
file_name: 2026_LIPIcsESA_Zheng.pdf
file_size: 760002
relation: main_file
success: 1
file_date_updated: 2026-09-17T09:28:04Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2026.61
has_accepted_license: '1'
intvolume: ' 388'
keyword:
- Diameter
- eccentricities
- minor-free graphs
- real weights
- VC-dimension
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: 34th Annual European Symposium on Algorithms
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959774451'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Real-weighted diameter and eccentricities of minor-free and bounded VC-dimension
graphs in truly subquadratic time
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: 388
year: '2026'
...
---
OA_place: publisher
OA_type: diamond
_id: '22928'
abstract:
- lang: eng
text: "We present deep ALMA Band 7 observations of the [O iii] 88 µm line and underlying
dust continuum\r\nemission in four UV-bright, gravitationally lensed (magnification
µ = 1.4 − 3.8), JWST-selected\r\ngalaxies at z = 8.5 − 10.3, with observed magnitudes
−22.5 ≲ MUV ≲ −20.5. [O iii] 88 µm is\r\nconfidently detected in UNCOVER-10646
at z = 8.5080 ± 0.0011 (15σ) and DHZ1 at z = 9.3113 ±\r\n0.0006 (6σ), with both
being intrinsically luminous systems [L[O iii] = (1.1− 1.6) ×109 L⊙] that follow\r\nthe
local [O iii]-SFR relation. [O iii] 88 µm remains undetected in the two z > 10
targets, including in\r\nthe z = 10.07 X-ray AGN UHZ1, where we obtain a deep
limit of L[O iii] < 6 × 107 L⊙. Dust emission\r\nis not detected in any individual
source nor in a stack (< 3σ). The high S/N [O iii] 88 µm detection\r\nin UNCOVER-10646
uniquely reveals an additional broad component (FWHM = 1366+473\r\n−329 km/s;\r\n∆BIC
≈ 20) indicative of an ionized outflow. We infer a high outflow rate of M˙\r\nout
= 128+80\r\n−46 M⊙ yr−1\r\n,\r\ncorresponding to a mass loading factor η = M˙\r\nout/SFR
= 2.9\r\n+1.8\r\n−1.0\r\nthat matches or exceeds theoretical\r\npredictions and
JWST-based studies of ionized outflows at high redshift. While high-resolution
ALMA\r\nfollow-up is required to confirm and spatially resolve the outflow, this
first systematic study at z > 8\r\nhighlights the unique diagnostic power of [O
iii] 88 µm in characterizing galaxies in the early Universe."
acknowledgement: "We thank the referee for their valuable and constructive comments
that improved this work. We also thank Javier Alvarez-M´arquez for useful discussions
´\r\nabout the MIRI observations of UHZ1 and UNCOVER37126. HSBA gratefully acknowledges
support from\r\nAcademia Sinica through grant AS-PD-1141-M01-2. MA\r\nis supported
by FONDECYT grant number 1252054,\r\nand gratefully acknowledges support from ANID
Basal\r\nProject FB210003 and ANID MILENIO NCN2024 112.\r\nAKI acknowledges support
from KAKENHI Grant No.\r\n23H00131. NW was supported by the GACR EXPRO\r\ngrant
No. 21-13491X.\r\nThis paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2024.1.00440.S,\r\nADS/JAO.ALMA#2024.1.01197.S\r\nALMA
is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan),
together with\r\nNRC (Canada), MOST and ASIAA (Taiwan), and KASI\r\n(Republic of
Korea), in cooperation with the Republic\r\nof Chile. The Joint ALMA Observatory
is operated by\r\nESO, AUI/NRAO and NAOJ."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Hiddo S.B.
full_name: Algera, Hiddo S.B.
last_name: Algera
- first_name: John R.
full_name: Weaver, John R.
last_name: Weaver
- first_name: Tom J.L.C.
full_name: Bakx, Tom J.L.C.
last_name: Bakx
- first_name: Manuel
full_name: Aravena, Manuel
last_name: Aravena
- first_name: Rychard J.
full_name: Bouwens, Rychard J.
last_name: Bouwens
- first_name: Karin
full_name: Cescon, Karin
last_name: Cescon
- first_name: Chian Chou
full_name: Chen, Chian Chou
last_name: Chen
- first_name: Elisabete
full_name: Da Cunha, Elisabete
last_name: Da Cunha
- first_name: Pratika
full_name: Dayal, Pratika
last_name: Dayal
- first_name: Andreas
full_name: Faisst, Andreas
last_name: Faisst
- first_name: Andrea
full_name: Ferrara, Andrea
last_name: Ferrara
- first_name: Seiji
full_name: Fujimoto, Seiji
last_name: Fujimoto
- first_name: Takuya
full_name: Hashimoto, Takuya
last_name: Hashimoto
- first_name: Kasper
full_name: Heintz, Kasper
last_name: Heintz
- first_name: Rodrigo
full_name: Herrera-Camus, Rodrigo
last_name: Herrera-Camus
- first_name: Jacqueline
full_name: Hodge, Jacqueline
last_name: Hodge
- first_name: Hanae
full_name: Inami, Hanae
last_name: Inami
- first_name: Akio K.
full_name: Inoue, Akio K.
last_name: Inoue
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Romain
full_name: Meyer, Romain
last_name: Meyer
- first_name: Shoichiro
full_name: Mizukoshi, Shoichiro
last_name: Mizukoshi
- first_name: Chayan
full_name: Mondal, Chayan
last_name: Mondal
- first_name: Themiya
full_name: Nanayakkara, Themiya
last_name: Nanayakkara
- first_name: Pascal A.
full_name: Oesch, Pascal A.
last_name: Oesch
- first_name: Andrea
full_name: Pallottini, Andrea
last_name: Pallottini
- first_name: Huub
full_name: Röttgering, Huub
last_name: Röttgering
- first_name: Lucie E.
full_name: Rowland, Lucie E.
last_name: Rowland
- first_name: Sander
full_name: Schouws, Sander
last_name: Schouws
- first_name: Renske
full_name: Smit, Renske
last_name: Smit
- first_name: Laura
full_name: Sommovigo, Laura
last_name: Sommovigo
- first_name: Daniel P.
full_name: Stark, Daniel P.
last_name: Stark
- first_name: Yuma
full_name: Sugahara, Yuma
last_name: Sugahara
- first_name: Livia
full_name: Vallini, Livia
last_name: Vallini
- first_name: Bovornpratch
full_name: Vijarnwannaluk, Bovornpratch
last_name: Vijarnwannaluk
- first_name: Paul
full_name: Van Der Werf, Paul
last_name: Van Der Werf
- first_name: Norbert
full_name: Werner, Norbert
last_name: Werner
- first_name: Joris
full_name: Witstok, Joris
last_name: Witstok
- first_name: Mengyuan
full_name: Xiao, Mengyuan
last_name: Xiao
citation:
ama: 'Algera HSB, Weaver JR, Bakx TJLC, et al. A first systematic study of [OIII]
88μm at z>8: two luminous oxygen lines and a powerful ionized outflow in the
first 600 million years. The Open Journal of Astrophysics. 2026;9. doi:10.33232/001c.165333'
apa: 'Algera, H. S. B., Weaver, J. R., Bakx, T. J. L. C., Aravena, M., Bouwens,
R. J., Cescon, K., … Xiao, M. (2026). A first systematic study of [OIII] 88μm
at z>8: two luminous oxygen lines and a powerful ionized outflow in the first
600 million years. The Open Journal of Astrophysics. Maynooth Academic
Publishing. https://doi.org/10.33232/001c.165333'
chicago: 'Algera, Hiddo S.B., John R. Weaver, Tom J.L.C. Bakx, Manuel Aravena, Rychard
J. Bouwens, Karin Cescon, Chian Chou Chen, et al. “A First Systematic Study of
[OIII] 88μm at Z>8: Two Luminous Oxygen Lines and a Powerful Ionized Outflow
in the First 600 Million Years.” The Open Journal of Astrophysics. Maynooth
Academic Publishing, 2026. https://doi.org/10.33232/001c.165333.'
ieee: 'H. S. B. Algera et al., “A first systematic study of [OIII] 88μm at
z>8: two luminous oxygen lines and a powerful ionized outflow in the first
600 million years,” The Open Journal of Astrophysics, vol. 9. Maynooth
Academic Publishing, 2026.'
ista: 'Algera HSB, Weaver JR, Bakx TJLC, Aravena M, Bouwens RJ, Cescon K, Chen CC,
Da Cunha E, Dayal P, Faisst A, Ferrara A, Fujimoto S, Hashimoto T, Heintz K, Herrera-Camus
R, Hodge J, Inami H, Inoue AK, Matthee JJ, Meyer R, Mizukoshi S, Mondal C, Nanayakkara
T, Oesch PA, Pallottini A, Röttgering H, Rowland LE, Schouws S, Smit R, Sommovigo
L, Stark DP, Sugahara Y, Vallini L, Vijarnwannaluk B, Van Der Werf P, Werner N,
Witstok J, Xiao M. 2026. A first systematic study of [OIII] 88μm at z>8: two
luminous oxygen lines and a powerful ionized outflow in the first 600 million
years. The Open Journal of Astrophysics. 9.'
mla: 'Algera, Hiddo S. B., et al. “A First Systematic Study of [OIII] 88μm at Z>8:
Two Luminous Oxygen Lines and a Powerful Ionized Outflow in the First 600 Million
Years.” The Open Journal of Astrophysics, vol. 9, Maynooth Academic Publishing,
2026, doi:10.33232/001c.165333.'
short: H.S.B. Algera, J.R. Weaver, T.J.L.C. Bakx, M. Aravena, R.J. Bouwens, K. Cescon,
C.C. Chen, E. Da Cunha, P. Dayal, A. Faisst, A. Ferrara, S. Fujimoto, T. Hashimoto,
K. Heintz, R. Herrera-Camus, J. Hodge, H. Inami, A.K. Inoue, J.J. Matthee, R.
Meyer, S. Mizukoshi, C. Mondal, T. Nanayakkara, P.A. Oesch, A. Pallottini, H.
Röttgering, L.E. Rowland, S. Schouws, R. Smit, L. Sommovigo, D.P. Stark, Y. Sugahara,
L. Vallini, B. Vijarnwannaluk, P. Van Der Werf, N. Werner, J. Witstok, M. Xiao,
The Open Journal of Astrophysics 9 (2026).
dataavailabilitystatement: "This paper makes use of the following ALMA data:\r\nADS/JAO.ALMA#2024.1.00440.S,\r\nADS/JAO.ALMA#2024.1.01197.S\r\nALMA
is a partnership of ESO (representing its member states), NSF (USA) and NINS (Japan),
together with\r\nNRC (Canada), MOST and ASIAA (Taiwan), and KASI\r\n(Republic of
Korea), in cooperation with the Republic\r\nof Chile. The Joint ALMA Observatory
is operated by\r\nESO, AUI/NRAO and NAOJ."
date_created: 2026-09-13T22:01:57Z
date_published: 2026-07-21T00:00:00Z
date_updated: 2026-09-17T08:31:24Z
day: '21'
ddc:
- '520'
department:
- _id: JoMa
doi: 10.33232/001c.165333
external_id:
arxiv:
- '2512.14486'
fulldoi: https://doi.org/10.33232/001c.165333
has_accepted_license: '1'
intvolume: ' 9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2512.14486
month: '07'
oa: 1
oa_version: Published Version
publication: The Open Journal of Astrophysics
publication_identifier:
eissn:
- 2565-6120
publication_status: published
publisher: Maynooth Academic Publishing
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'A first systematic study of [OIII] 88μm at z>8: two luminous oxygen lines
and a powerful ionized outflow in the first 600 million years'
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: 9
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22920'
abstract:
- lang: eng
text: "Two-player games on graphs are a classical framework for analyzing strategic
decision making. In turn-based games, two players move a token along the edges
of the graph, and the right to move the token is determined by the current vertex.
In traditional bidding games - referred to as pure bidding games - the right to
move the token is determined at each step through bidding; here we consider Richman
bidding, where the winning player of a bid pays the losing player. The winner
is decided based on a temporal or quantitative specification evaluated over the
resulting infinite play.\r\nIn this work, we combine turn-based games and pure
bidding games into generalized bidding games, with player-1 vertices, player-2
vertices, and bidding vertices. This natural and simple generalization of bidding
games has far-reaching consequences. First, we show that, as a model, generalized
bidding games are more expressive than pure bidding games, and we provide several
applications. Second, and most importantly, we show that generalized Richman bidding
games are structurally equivalent to simple stochastic games, a well-studied model:
they are linearly interreducible to each other. As was previously known, the special
case of pure Richman bidding games corresponds to random-turn games. In other
words, generalized bidding games extend pure bidding games in the same way that
simple stochastic games extend random-turn games. We use this connection to solve
generalized Richman bidding games for temporal (parity) and quantitative (mean-payoff
and discounted-sum) specifications. From a computational perspective, we establish
that generalized bidding games with parity and mean-payoff specifications retain
the best known upper bounds for turn-based games and pure bidding games, namely
NP∩coNP.\r\nFinally, we study a repair problem that asks whether bidding vertices
can be assigned \"owners\" so as to bring the threshold budget required to win
the game below a given target. This problem has direct applications in compositional
policy synthesis for multi-objective settings, and we show it to be NP-complete."
acknowledgement: "The research was partially supported by Austrian Science Fund (FWF)
10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), ERC-2020-AdG
101020093\r\n(VAMOS), and the RYC2024-049116-I grant funded by MICIU/AEI/10.13039/501100011033
and\r\nESF+.\r\n"
alternative_title:
- LIPIcs
article_number: 13:1-13:20
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Ali
full_name: Asadi, Ali
id: 02d96aae-000e-11ec-b801-cadd0a5eefbb
last_name: Asadi
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- 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: Pavol
full_name: Kebis, Pavol
id: 2e0132b3-4e98-11ef-b275-cf7281c2802a
last_name: Kebis
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. Generalized bidding
games: Where bidding and stochastic games meet. In: 37th International Conference
on Concurrency Theory. Vol 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2026. doi:10.4230/LIPIcs.CONCUR.2026.13'
apa: 'Asadi, A., Henzinger, T. A., Goharshady, E., Kebis, P., & Mallik, K. (2026).
Generalized bidding games: Where bidding and stochastic games meet. In 37th
International Conference on Concurrency Theory (Vol. 391). Liverpool, United
Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13'
chicago: 'Asadi, Ali, Thomas A Henzinger, Ehsan Goharshady, Pavol Kebis, and Kaushik
Mallik. “Generalized Bidding Games: Where Bidding and Stochastic Games Meet.”
In 37th International Conference on Concurrency Theory, Vol. 391. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.CONCUR.2026.13.'
ieee: 'A. Asadi, T. A. Henzinger, E. Goharshady, P. Kebis, and K. Mallik, “Generalized
bidding games: Where bidding and stochastic games meet,” in 37th International
Conference on Concurrency Theory, Liverpool, United Kingdom, 2026, vol. 391.'
ista: 'Asadi A, Henzinger TA, Goharshady E, Kebis P, Mallik K. 2026. Generalized
bidding games: Where bidding and stochastic games meet. 37th International Conference
on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol.
391, 13:1-13:20.'
mla: 'Asadi, Ali, et al. “Generalized Bidding Games: Where Bidding and Stochastic
Games Meet.” 37th International Conference on Concurrency Theory, vol.
391, 13:1-13:20, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.13.'
short: A. Asadi, T.A. Henzinger, E. Goharshady, P. Kebis, K. Mallik, in:, 37th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2026.
conference:
end_date: 2026-09-04
location: Liverpool, United Kingdom
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2026-09-01
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:53Z
date_published: 2026-08-24T00:00:00Z
date_updated: 2026-09-17T09:44:41Z
day: '24'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2026.13
ec_funded: 1
external_id:
arxiv:
- '2606.29420'
file:
- access_level: open_access
checksum: de9af748d78fa42c173f68a71cbbd8d9
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T09:43:28Z
date_updated: 2026-09-17T09:43:28Z
file_id: '22946'
file_name: 2026_LIPIcsCONCUR_Asadi.pdf
file_size: 1175682
relation: main_file
success: 1
file_date_updated: 2026-09-17T09:43:28Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2026.13
has_accepted_license: '1'
intvolume: ' 391'
keyword:
- Bidding Games
- Stochastic Games
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
grant_number: F8502
name: Interface Theory for Security and Privacy
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 37th International Conference on Concurrency Theory
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959774475'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'Generalized bidding games: Where bidding and stochastic games meet'
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: 391
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22919'
abstract:
- lang: eng
text: 'Reachability is the most fundamental logical objective, yet it is notoriously
difficult to learn in reinforcement learning settings: even for Markov decision
processes, PAC learning of reachability is impossible without additional assumptions.
This difficulty also holds in turn-based stochastic games (TBSGs), where two adversarial
players interact on a finite state space. In this work, we consider turn-based
stochastic games with reachability objectives. For such settings, adversarial
learning, in which players are adversarial even in the learning phase, is impossible.
Therefore, the goal is to consider learning, in which both players learn the unknown
model together. In this spirit, previous literature on PAC learning in TBSGs considers
(a) public information shared by both players; and (b) centralized learning, which
means that players share the same learning algorithm. In this work, our contribution
is two-fold. First, we relax these strong assumptions and ensure learning: (i)
with private information not shared with the other player; and (ii) decentralized
learning where the players do not share the same learning algorithm. To the best
of our knowledge, this work is the first positive result for decentralized and
private information learning of TBSGs with reachability objectives. Second, we
introduce a game-theoretic generalization of the Expected Conditional Distance
(ECD) parameter, which measures the expected length of reaching the target set.
We establish a polynomial-sample complexity bound with respect to the number of
states, actions, ECD parameter, and inverses of error tolerance and failure probability.'
acknowledgement: "The research was partially supported by Austrian Science Fund (FWF)
10.55776/COE12,\r\nERC CoG 863818 (ForM-SMArt), FWF-2022-SFB F8502 (SPyCoDe), and
ERC-2020-AdG 101020093\r\n(VAMOS) grants."
alternative_title:
- LIPIcs
article_number: 12:1-12:23
article_processing_charge: Yes
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: Pavol
full_name: Kebis, Pavol
id: 2e0132b3-4e98-11ef-b275-cf7281c2802a
last_name: Kebis
citation:
ama: 'Asadi A, Chatterjee K, Kebis P. PAC learning in turn-based stochastic games
with reachability objectives: A decentralized private approach via expected conditional
distance. In: 37th International Conference on Concurrency Theory. Vol
391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.CONCUR.2026.12'
apa: 'Asadi, A., Chatterjee, K., & Kebis, P. (2026). PAC learning in turn-based
stochastic games with reachability objectives: A decentralized private approach
via expected conditional distance. In 37th International Conference on Concurrency
Theory (Vol. 391). Liverpool, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2026.12'
chicago: 'Asadi, Ali, Krishnendu Chatterjee, and Pavol Kebis. “PAC Learning in Turn-Based
Stochastic Games with Reachability Objectives: A Decentralized Private Approach
via Expected Conditional Distance.” In 37th International Conference on Concurrency
Theory, Vol. 391. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
https://doi.org/10.4230/LIPIcs.CONCUR.2026.12.'
ieee: 'A. Asadi, K. Chatterjee, and P. Kebis, “PAC learning in turn-based stochastic
games with reachability objectives: A decentralized private approach via expected
conditional distance,” in 37th International Conference on Concurrency Theory,
Liverpool, United Kingdom, 2026, vol. 391.'
ista: 'Asadi A, Chatterjee K, Kebis P. 2026. PAC learning in turn-based stochastic
games with reachability objectives: A decentralized private approach via expected
conditional distance. 37th International Conference on Concurrency Theory. CONCUR:
Conference on Concurrency Theory, LIPIcs, vol. 391, 12:1-12:23.'
mla: 'Asadi, Ali, et al. “PAC Learning in Turn-Based Stochastic Games with Reachability
Objectives: A Decentralized Private Approach via Expected Conditional Distance.”
37th International Conference on Concurrency Theory, vol. 391, 12:1-12:23,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.CONCUR.2026.12.'
short: A. Asadi, K. Chatterjee, P. Kebis, in:, 37th International Conference on
Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
conference:
end_date: 2026-09-04
location: Liverpool, United Kingdom
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2026-09-01
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:53Z
date_published: 2026-08-24T00:00:00Z
date_updated: 2026-09-17T09:51:25Z
day: '24'
ddc:
- '000'
department:
- _id: GradSch
- _id: KrCh
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2026.12
ec_funded: 1
external_id:
arxiv:
- '2607.14877'
file:
- access_level: open_access
checksum: 2e6c55b65d9d7ce436a6f59e81d7ba17
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T09:50:00Z
date_updated: 2026-09-17T09:50:00Z
file_id: '22947'
file_name: 2026_LIPIcsCONCUR_Asadi2.pdf
file_size: 959234
relation: main_file
success: 1
file_date_updated: 2026-09-17T09:50:00Z
fulldoi: https://doi.org/10.4230/LIPIcs.CONCUR.2026.12
has_accepted_license: '1'
intvolume: ' 391'
keyword:
- formal methods
- games and logic
- logical aspects of AI
- model checking
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 4029cfc7-b034-11f1-9e55-88ab2ff3b6ee
grant_number: COE12
name: Bilateral Artificial Intelligence (Chatterjee)
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
grant_number: F8502
name: Interface Theory for Security and Privacy
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 37th International Conference on Concurrency Theory
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959774475'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'PAC learning in turn-based stochastic games with reachability objectives:
A decentralized private approach via expected conditional distance'
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: 391
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22918'
abstract:
- lang: eng
text: "Given a weighted digraph G, a (t,g,μ)-DAG cover is a collection of g dominating
DAGs D_1,… ,D_g such that all distances are approximately preserved: for every
pair (u,v) of vertices, min_id_{D_i}(u,v) ≤ t⋅ d_G(u,v), and the total number
of non-G edges is bounded by |(∪_i D_i)⧵ G| ≤ μ. Assadi, Hoppenworth, and Wein
[STOC 25] and Filtser [SODA 26] studied DAG covers for general digraphs. This
paper initiates the study of Steiner DAG cover, where the DAGs are allowed to
contain Steiner points. \r\nWe obtain Steiner DAG covers on the important classes
of planar digraphs and low-treewidth digraphs. Specifically, we show that any
digraph with treewidth tw admits a (1,2,Õ(n⋅tw))-Steiner DAG cover. For planar
digraphs we provide a (1+ε,2,Õ_ε(n))-Steiner DAG cover.\r\nWe also demonstrate
a stark difference between Steiner and non-Steiner DAG covers. As a lower bound,
we show that any non-Steiner DAG cover for graphs with treewidth 1 with stretch
t < 2 and sub-quadratic number of extra edges requires Ω(log n) DAGs."
acknowledgement: "This work was initiated at Dagstuhl Seminar 25212: Metric Sketching
and\r\nDynamic Algorithms for Geometric and Topological Graphs. We thank the organizers
and other\r\nparticipants for a productive environment.\r\nujoy Bhore: Work supported
in part by ANRF ARG-MATRICS, Grant 002465.\r\nHsien-Chih Chang: Supported by the
U.S. National Science Foundation Grant No. CCF-2443017.\r\nJonathan Conroy: Supported
by the U.S. National Science Foundation Grant No. CCF-2443017.\r\nArnold Filtser:
This research was supported by the ISRAEL SCIENCE FOUNDATION (grant No.\r\n1042/22).\r\nEunjin
Oh: Supported by Institute of Information & Communications Technology Planning &\r\nEvaluation
(IITP) grant funded by the Korea government (MSIT) (No. RS-2024-00440239, Sublinear\r\nScalable
Algorithms for Large-Scale Data Analysis) and the National Research Foundation of
Korea\r\n(NRF) grant funded by the Korea government (MSIT) (No. RS-2024-00358505).\r\nNicole
Wein: Supported by NSF CAREER award 2541910.\r\nDa Wei Zheng: This project has received
funding from the Austrian Science Fund (FWF) grant\r\nDOI 10.55776/I5982. For open
access purposes, the author has applied a CC BY public copyright\r\nlicense to any
author-accepted manuscript version arising from this submission."
alternative_title:
- LIPIcs
article_number: 94:1-94:18
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Sujoy
full_name: Bhore, Sujoy
last_name: Bhore
- first_name: Hsien Chih
full_name: Chang, Hsien Chih
last_name: Chang
- first_name: Jonathan
full_name: Conroy, Jonathan
last_name: Conroy
- first_name: Arnold
full_name: Filtser, Arnold
last_name: Filtser
- first_name: Eunjin
full_name: Oh, Eunjin
last_name: Oh
- first_name: Nicole
full_name: Wein, Nicole
last_name: Wein
- first_name: Da Wei
full_name: Zheng, Da Wei
id: af77956b-e859-11ef-8dc9-d301b898e32f
last_name: Zheng
citation:
ama: 'Bhore S, Chang HC, Conroy J, et al. DAG covers for structured graphs: The
Steiner point effect. In: 34th Annual European Symposium on Algorithms.
Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.ESA.2026.94'
apa: 'Bhore, S., Chang, H. C., Conroy, J., Filtser, A., Oh, E., Wein, N., &
Zheng, D. W. (2026). DAG covers for structured graphs: The Steiner point effect.
In 34th Annual European Symposium on Algorithms (Vol. 388). L’Aquila, Italy:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.94'
chicago: 'Bhore, Sujoy, Hsien Chih Chang, Jonathan Conroy, Arnold Filtser, Eunjin
Oh, Nicole Wein, and Da Wei Zheng. “DAG Covers for Structured Graphs: The Steiner
Point Effect.” In 34th Annual European Symposium on Algorithms, Vol. 388.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.94.'
ieee: 'S. Bhore et al., “DAG covers for structured graphs: The Steiner point
effect,” in 34th Annual European Symposium on Algorithms, L’Aquila, Italy,
2026, vol. 388.'
ista: 'Bhore S, Chang HC, Conroy J, Filtser A, Oh E, Wein N, Zheng DW. 2026. DAG
covers for structured graphs: The Steiner point effect. 34th Annual European Symposium
on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 94:1-94:18.'
mla: 'Bhore, Sujoy, et al. “DAG Covers for Structured Graphs: The Steiner Point
Effect.” 34th Annual European Symposium on Algorithms, vol. 388, 94:1-94:18,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.94.'
short: S. Bhore, H.C. Chang, J. Conroy, A. Filtser, E. Oh, N. Wein, D.W. Zheng,
in:, 34th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2026.
conference:
end_date: 2026-09-04
location: L’Aquila, Italy
name: 'ESA: European Symposium on Algorithms'
start_date: 2026-08-31
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:53Z
date_published: 2026-08-25T00:00:00Z
date_updated: 2026-09-17T10:27:46Z
day: '25'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ESA.2026.94
external_id:
arxiv:
- '2604.04186'
file:
- access_level: open_access
checksum: 2082683b3b72865c6a795305e5d61276
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T10:09:22Z
date_updated: 2026-09-17T10:09:22Z
file_id: '22948'
file_name: 2026_LIPIcsESA_Bhore.pdf
file_size: 1123327
relation: main_file
success: 1
file_date_updated: 2026-09-17T10:09:22Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2026.94
has_accepted_license: '1'
intvolume: ' 388'
keyword:
- Directed graphs
- DAG (directed acyclic graphs)
- distortion
- metric embeddings
- planar graph
- treewidth
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: 34th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783959774451'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: 'DAG covers for structured graphs: The Steiner point effect'
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: 388
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22917'
abstract:
- lang: eng
text: 'A heap is a dynamic data structure that stores a set of labeled values under
the following operations: pop returns the minimum value of the heap, Push(x_i)
pushes a new value x_i onto the heap, and DecreaseKey(i, v) decreases the value
x_i to v. A working-set heap is a heap that supports the x_i ← pop() operation
in O(log Γ(x_i)) time where Γ(x_i) is the size of the working set: the number
of elements that were pushed onto the heap while x_i was in the heap. The goal
of working set heap design is to maintain the working set property while minimizing
the overhead of the Push and DecreaseKey operations. On a word RAM, there exist
working set heaps that support Push and DecreaseKey in amortized constant time.
In this paper, we show via a simple construction that pointer machines, one of
the most general and least-assuming computational models, support working set
heaps that support Push in amortized constant time and DecreaseKey in inverse-Ackermann
time. A by-product of this analysis is that Dijkstra’s shortest path algorithm
can be near-universally optimal on a pointer machine - incurring only an additive
O(m α(m)) overhead compared to the optimal running time for distance ordering,
where m denotes the number of edges in the graph.'
acknowledgement: "Ivor van der Hoog, Eva Rotenberg, and Daniel Rutschmann thank the
VILLUM Foundation\r\ngrant (VIL37507) “Efficient Recomputations for Changeful Problems”
for supporting this work.\r\nDaniel Rutschmann is supported by the European Research
Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation
programme (No. 101019564) . John Iacono\r\nis supported by the Fonds de la Recherche
Scientifique – FNRS.This work started at Dagstuhl 25191: Adaptive and Scalable Data
Structures.\r\n\r\n"
alternative_title:
- LIPIcs
article_number: 45:1-45:13
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Ivor
full_name: Van Der Hoog, Ivor
last_name: Van Der Hoog
- first_name: John
full_name: Iacono, John
last_name: Iacono
- first_name: Eva
full_name: Rotenberg, Eva
last_name: Rotenberg
- first_name: Daniel P
full_name: Rutschmann, Daniel P
id: 7397d908-b582-11f0-bf73-88b902e86527
last_name: Rutschmann
citation:
ama: 'Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. Near-optimal working-set
heaps and dijkstra on pointer machines. In: 34th Annual European Symposium
on Algorithms. Vol 388. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2026. doi:10.4230/LIPIcs.ESA.2026.45'
apa: 'Van Der Hoog, I., Iacono, J., Rotenberg, E., & Rutschmann, D. P. (2026).
Near-optimal working-set heaps and dijkstra on pointer machines. In 34th Annual
European Symposium on Algorithms (Vol. 388). L’Aquila, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2026.45'
chicago: Van Der Hoog, Ivor, John Iacono, Eva Rotenberg, and Daniel P Rutschmann.
“Near-Optimal Working-Set Heaps and Dijkstra on Pointer Machines.” In 34th
Annual European Symposium on Algorithms, Vol. 388. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2026. https://doi.org/10.4230/LIPIcs.ESA.2026.45.
ieee: I. Van Der Hoog, J. Iacono, E. Rotenberg, and D. P. Rutschmann, “Near-optimal
working-set heaps and dijkstra on pointer machines,” in 34th Annual European
Symposium on Algorithms, L’Aquila, Italy, 2026, vol. 388.
ista: 'Van Der Hoog I, Iacono J, Rotenberg E, Rutschmann DP. 2026. Near-optimal
working-set heaps and dijkstra on pointer machines. 34th Annual European Symposium
on Algorithms. ESA: European Symposium on Algorithms, LIPIcs, vol. 388, 45:1-45:13.'
mla: Van Der Hoog, Ivor, et al. “Near-Optimal Working-Set Heaps and Dijkstra on
Pointer Machines.” 34th Annual European Symposium on Algorithms, vol. 388,
45:1-45:13, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026, doi:10.4230/LIPIcs.ESA.2026.45.
short: I. Van Der Hoog, J. Iacono, E. Rotenberg, D.P. Rutschmann, in:, 34th Annual
European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2026.
conference:
end_date: 2026-09-04
location: L’Aquila, Italy
name: 'ESA: European Symposium on Algorithms'
start_date: 2026-08-31
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-13T22:01:53Z
date_published: 2026-08-25T00:00:00Z
date_updated: 2026-09-17T10:35:56Z
day: '25'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ESA.2026.45
ec_funded: 1
external_id:
arxiv:
- '2604.24134'
file:
- access_level: open_access
checksum: 52e7cb8881060e8f17b89cd46504f445
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T10:33:12Z
date_updated: 2026-09-17T10:33:12Z
file_id: '22949'
file_name: 2026_LIPIcsESA_vanderHoog2.pdf
file_size: 792024
relation: main_file
success: 1
file_date_updated: 2026-09-17T10:33:12Z
fulldoi: https://doi.org/10.4230/LIPIcs.ESA.2026.45
has_accepted_license: '1'
intvolume: ' 388'
keyword:
- Data structures
- graph algorithms
- amortized analysis
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
publication: 34th Annual European Symposium on Algorithms
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959774451'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Near-optimal working-set heaps and dijkstra on pointer machines
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: 388
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22408'
abstract:
- lang: eng
text: Solitons—localized wave packets that travel without spreading—play a central
role in understanding transport and properties of nonlinear systems. In quantum
many-body systems, however, such robust excitations are typically destroyed by
thermalization. Here, we theoretically demonstrate the existence of solitonic
excitations in high-energy states of Rydberg atom chains in the regime of strong
nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally
atop a special class of reviving initial states related to quantum many-body scars
and are capable of carrying energy. Exhibiting long coherence times, these states
constitute a form of non-ergodic quantum dynamics and can be efficiently implemented
on Rydberg atom simulators. In this work, in addition to a phenomenological description
of solitons, we identify their counterpart in a classical nonlinear dynamical
system, demonstrate their potential use in quantum information transfer, and conjecture
their relevance for anomalous energy transport reported in numerical studies of
Rydberg atom arrays.
acknowledgement: We acknowledge useful discussions with J.-S. Caux, E. Demler, J.
Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter,
F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868.
We acknowledge support by the Erwin Schrödinger International Institute for Mathematics
and Physics (ESI). This research was funded in part by the Austrian Science Fund
(FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This
research was supported in part by grant NSF PHY2309135 to the Kavli Institute for
Theoretical Physics (KITP).
article_number: '8783'
article_processing_charge: Yes
article_type: original
author:
- first_name: Aron
full_name: Kerschbaumer, Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
orcid: 0009-0002-2370-8661
- first_name: Jean-Yves Marc
full_name: Desaules, Jean-Yves Marc
id: 6c292945-a610-11ed-9eec-c3be1ad62a80
last_name: Desaules
orcid: 0000-0002-3749-6375
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg
atom chains. Nature Communications. 2026;17. doi:10.1038/s41467-026-75598-1
apa: Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., & Serbyn, M. (2026).
Quasi-solitons in Rydberg atom chains. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-026-75598-1
chicago: Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym
Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications.
Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75598-1.
ieee: A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons
in Rydberg atom chains,” Nature Communications, vol. 17. Springer Nature,
2026.
ista: Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons
in Rydberg atom chains. Nature Communications. 17, 8783.
mla: Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” Nature
Communications, vol. 17, 8783, Springer Nature, 2026, doi:10.1038/s41467-026-75598-1.
short: A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications
17 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: The raw data used to generate the figures are available
at ref54.The TEBD algorithm used in this work was implemented using the ITensor
library48,49 and the integration of the classical differential equations was performed
via SciPy’s Runge-Kutta RK45 integrator52,53. The code used in this study to produce
the plots from the shared data is available at ref.54.
date_created: 2026-07-27T07:26:27Z
date_published: 2026-08-21T00:00:00Z
date_updated: 2026-09-17T10:54:09Z
day: '21'
ddc:
- '530'
department:
- _id: MaSe
- _id: GradSch
doi: 10.1038/s41467-026-75598-1
ec_funded: 1
external_id:
pmid:
- '42469244'
file:
- access_level: open_access
checksum: 2e12ade81e19b7eea099a2196217edff
content_type: application/pdf
creator: dernst
date_created: 2026-09-09T07:04:48Z
date_updated: 2026-09-09T07:04:48Z
file_id: '22863'
file_name: 2026_NatureComm_Kerschbaumer.pdf
file_size: 1337815
relation: main_file
success: 1
file_date_updated: 2026-09-09T07:04:48Z
fulldoi: https://doi.org/10.1038/s41467-026-75598-1
has_accepted_license: '1'
intvolume: ' 17'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 92c64506-16d5-11f0-9cad-87ce313ee832
grant_number: COE01
name: Quantum Science Austria (Serbyn)
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '21960'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Quasi-solitons in Rydberg atom chains
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: 17
year: '2026'
...
---
OA_place: repository
_id: '21960'
abstract:
- lang: eng
text: "Solitons - localized wave packets that travel without spreading - play a
central role in understanding transport and properties of nonlinear systems. In
quantum many-body systems, however, such robust excitations are typically destroyed
by thermalization. Here, we theoretically demonstrate the existence of solitonic
excitations in high-energy states of Rydberg atom chains in the regime of strong
nearest-neighbor Rydberg blockade. \r\nThese localized wave packets propagate
directionally atop a special class of reviving initial states related to quantum
many-body scars and are capable of carrying energy. Exhibiting long coherence
times, these states constitute a form of non-ergodic quantum dynamics and can
be efficiently implemented on Rydberg atom simulators. In this work, in addition
to a phenomenological description of solitons, we identify their counterpart in
a classical nonlinear dynamical system, demonstrate their potential use in quantum
information transfer, and conjecture their relevance for anomalous energy transport
reported in numerical studies of Rydberg atom arrays."
article_processing_charge: No
author:
- first_name: Aron
full_name: Kerschbaumer, Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
orcid: 0009-0002-2370-8661
citation:
ama: 'Kerschbaumer A. Research Data: “Quasi-solitons in Rydberg atom chains.” 2026.
doi:10.15479/AT-ISTA-21960'
apa: 'Kerschbaumer, A. (2026). Research Data: “Quasi-solitons in Rydberg atom chains.”
Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21960'
chicago: 'Kerschbaumer, Aron. “Research Data: ‘Quasi-Solitons in Rydberg Atom Chains.’”
Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21960.'
ieee: 'A. Kerschbaumer, “Research Data: ‘Quasi-solitons in Rydberg atom chains.’”
Institute of Science and Technology Austria, 2026.'
ista: 'Kerschbaumer A. 2026. Research Data: ‘Quasi-solitons in Rydberg atom chains’,
Institute of Science and Technology Austria, 10.15479/AT-ISTA-21960.'
mla: 'Kerschbaumer, Aron. Research Data: “Quasi-Solitons in Rydberg Atom Chains.”
Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21960.'
short: A. Kerschbaumer, (2026).
contributor:
- contributor_type: contact_person
first_name: Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
orcid: 0009-0002-2370-8661
- contributor_type: supervisor
first_name: Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
- contributor_type: researcher
first_name: Jean-Yves Marc
id: 6c292945-a610-11ed-9eec-c3be1ad62a80
last_name: Desaules
orcid: 0000-0002-3749-6375
- contributor_type: researcher
first_name: Marko
last_name: Ljubotina
corr_author: '1'
date_created: 2026-06-09T07:17:50Z
date_published: 2026-06-16T00:00:00Z
date_updated: 2026-09-17T10:54:08Z
day: '16'
department:
- _id: GradSch
- _id: MaSe
doi: 10.15479/AT-ISTA-21960
ec_funded: 1
file:
- access_level: open_access
checksum: 133269a105e996c6c44fdd56128259c7
content_type: text/plain
creator: akerschb
date_created: 2026-06-15T22:01:57Z
date_updated: 2026-06-15T22:01:57Z
file_id: '22010'
file_name: README.txt
file_size: 1940
relation: main_file
success: 1
- access_level: open_access
checksum: 759f9649c3919f4c4ad37a1d104ea32a
content_type: application/zip
creator: akerschb
date_created: 2026-06-15T22:02:07Z
date_updated: 2026-06-15T22:02:07Z
file_id: '22011'
file_name: Soliton_Data.zip
file_size: 13259747
relation: main_file
success: 1
file_date_updated: 2026-06-15T22:02:07Z
fulldoi: https://doi.org/10.15479/AT-ISTA-21960
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22408'
relation: used_in_publication
status: public
status: public
title: 'Research Data: "Quasi-solitons in Rydberg atom chains"'
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: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22941'
abstract:
- lang: eng
text: Argonaute proteins mediate RNA interference in eukaryotes and nucleic‐acid
defence in prokaryotes. Although these systems operate in distinct biological
contexts and produce diverse downstream outcomes, they share a conserved structural
architecture and mechanism of guide‐dependent target recognition. Here, we argue
that Argonautes function as programmable surveillance platforms that kinetically
sample nucleic acids, engage targets through sequential pairing and conformational
checkpoints, and couple recognition to functional outputs through regulated structural
transitions. Rather than representing distinct recognition mechanisms, the diverse
targeting behaviours observed across Argonaute families reflect different implementations
of this shared framework, in which guide biogenesis, target accessibility, pairing
requirements and effector coupling are weighted differently according to biological
context. Viewing Argonautes through this common operational logic reconciles apparent
differences in specificity, mismatch tolerance and target selection across systems,
while providing a unified conceptual framework for understanding their evolution
and guiding the engineering of programmable nucleic‐acid recognition technologies.
acknowledgement: I would like to thank K. Kiernan and F. Alcon for insightful comments
and feedback. We acknowledge support from ISTA and from the Austrian Science Fund
(FWF) (10.55776/PAT1617625). The author used Claude (Anthropic) to assist with improving
the clarity and readability of portions of the manuscript. All scientific content,
interpretation and conclusions were conceived, verified and approved by the author,
who takes full responsibility for the final manuscript. Open Access funding provided
by Institute of Science and Technology Austria.
article_number: 1873-3468.70450
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Jack Peter Kelly
full_name: Bravo, Jack Peter Kelly
id: 96aecfa5-8931-11ee-af30-aa6a5d6eee0e
last_name: Bravo
orcid: 0000-0003-0456-0753
citation:
ama: Bravo JPK. ‘Guide and Prejudice’ - How Argonautes recognize targets across
domains of life. FEBS Letters. 2026. doi:10.1002/1873-3468.70450
apa: Bravo, J. P. K. (2026). ‘Guide and Prejudice’ - How Argonautes recognize targets
across domains of life. FEBS Letters. Wiley. https://doi.org/10.1002/1873-3468.70450
chicago: Bravo, Jack Peter Kelly. “‘Guide and Prejudice’ - How Argonautes Recognize
Targets across Domains of Life.” FEBS Letters. Wiley, 2026. https://doi.org/10.1002/1873-3468.70450.
ieee: J. P. K. Bravo, “‘Guide and Prejudice’ - How Argonautes recognize targets
across domains of life,” FEBS Letters. Wiley, 2026.
ista: Bravo JPK. 2026. ‘Guide and Prejudice’ - How Argonautes recognize targets
across domains of life. FEBS Letters., 1873–3468.70450.
mla: Bravo, Jack Peter Kelly. “‘Guide and Prejudice’ - How Argonautes Recognize
Targets across Domains of Life.” FEBS Letters, 1873–3468.70450, Wiley,
2026, doi:10.1002/1873-3468.70450.
short: J.P.K. Bravo, FEBS Letters (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-17T09:31:02Z
date_published: 2026-09-08T00:00:00Z
date_updated: 2026-09-17T11:48:51Z
day: '08'
ddc:
- '570'
department:
- _id: JaBr
doi: 10.1002/1873-3468.70450
external_id:
pmid:
- '42711859'
fulldoi: https://doi.org/10.1002/1873-3468.70450
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/1873-3468.70450
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 9f295cab-ad08-11f1-bc83-9e197d0f6d50
grant_number: PAT1617625
name: 'Search & Destroy: Mechanisms of anti-plasmid immunity'
publication: FEBS Letters
publication_identifier:
eissn:
- 1873-3468
issn:
- 0014-5793
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: ‘Guide and Prejudice’ - How Argonautes recognize targets across domains of
life
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
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21501'
abstract:
- lang: eng
text: "Kinetically constrained models were originally introduced to capture slow
relaxation in glassy systems, where dynamics are hindered by local constraints
instead of energy barriers. Their quantum counterparts have recently drawn attention
for exhibiting highly degenerate eigenstates at zero energy—known as zero modes—stemming
from chiral symmetry. Yet, the structure and implications of these zero modes
remain poorly understood. In this work, we focus on the properties of the zero
mode subspace in quantum kinetically constrained models with a U(1) particle-conservation
symmetry. We use the U(1) East, which lacks inversion symmetry, and the inversion-symmetric
U(1) East-West models to illustrate our two main results. First, we observe that
the simultaneous presence of constraints and chiral symmetry generally leads to
a parametric increase in the number of zero modes due to the fragmentation of
the many-body\r\nHilbert space into disconnected sectors. Second, we generalize
the concept of compact localized states from single-particle physics and introduce
the notion of collective bound states, a special kind of nonergodic eigenstates
that are robust to enlarging the system size. We formulate sufficient criteria
for their existence, arguing that the degenerate zero mode subspace plays a central
role, and demonstrate bound states in both example models and in a two-dimensional
model, the U(1) North-East, and in the pairflip model, a system without particle
conservation. Our results motivate a systematic study of bound states and their
relation to ergodicity breaking, transport, and other properties of quantum kinetically
constrained\r\nmodels. "
acknowledgement: The authors acknowledge useful discussions with Berislav Buca. This
work was supported by the European Research Council (ERC) under the European Union’s
Horizon 2020 research and innovation program (Grant Agreement No. 850899). 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 grant NSF PHY-2309135 to the Kavli Institute for Theoretical
Physics (KITP).
article_number: '010352'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Eulalia
full_name: Nicolau Jimenez, Eulalia
id: 04b4791c-8fd7-11ee-a7df-be2fdc569c48
last_name: Nicolau Jimenez
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Nicolau Jimenez E, Ljubotina M, Serbyn M. Fragmentation, zero modes, and collective
bound states in constrained models. PRX Quantum. 2026;7. doi:10.1103/sl79-1xgb
apa: Nicolau Jimenez, E., Ljubotina, M., & Serbyn, M. (2026). Fragmentation,
zero modes, and collective bound states in constrained models. PRX Quantum.
American Physical Society. https://doi.org/10.1103/sl79-1xgb
chicago: Nicolau Jimenez, Eloi, Marko Ljubotina, and Maksym Serbyn. “Fragmentation,
Zero Modes, and Collective Bound States in Constrained Models.” PRX Quantum.
American Physical Society, 2026. https://doi.org/10.1103/sl79-1xgb.
ieee: E. Nicolau Jimenez, M. Ljubotina, and M. Serbyn, “Fragmentation, zero modes,
and collective bound states in constrained models,” PRX Quantum, vol. 7.
American Physical Society, 2026.
ista: Nicolau Jimenez E, Ljubotina M, Serbyn M. 2026. Fragmentation, zero modes,
and collective bound states in constrained models. PRX Quantum. 7, 010352.
mla: Nicolau Jimenez, Eloi, et al. “Fragmentation, Zero Modes, and Collective Bound
States in Constrained Models.” PRX Quantum, vol. 7, 010352, American Physical
Society, 2026, doi:10.1103/sl79-1xgb.
short: E. Nicolau Jimenez, M. Ljubotina, M. Serbyn, PRX Quantum 7 (2026).
corr_author: '1'
date_created: 2026-03-28T14:57:56Z
date_published: 2026-03-13T00:00:00Z
date_updated: 2026-09-17T11:50:06Z
day: '13'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1103/sl79-1xgb
ec_funded: 1
external_id:
arxiv:
- '2504.17627'
file:
- access_level: open_access
checksum: d155ffa9e1a8275702149165f4bf963c
content_type: application/pdf
creator: dernst
date_created: 2026-03-30T06:08:07Z
date_updated: 2026-03-30T06:08:07Z
file_id: '21505'
file_name: 2026_PRXQuantum_Nicolau.pdf
file_size: 1848724
relation: main_file
success: 1
file_date_updated: 2026-03-30T06:08:07Z
fulldoi: https://doi.org/10.1103/sl79-1xgb
has_accepted_license: '1'
intvolume: ' 7'
language:
- iso: eng
month: '03'
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'
publication: PRX Quantum
publication_identifier:
eissn:
- 2691-3399
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Fragmentation, zero modes, and collective bound states in constrained models
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: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22245'
abstract:
- lang: eng
text: "A single-commodity congestion approximator for a graph is a compact data
structure that approximately predicts the edge congestion required to route any
set of single-commodity flow demands in a network. A hierarchical congestion approximator
(HCA) consists of a laminar family of cuts in the graph and has numerous applications
in approximating cut and flow problems in graphs, designing efficient routing
schemes, and managing distributed networks.\r\nThere is a tradeoff between the
running time for computing an HCA and its approximation quality. The best polynomial-time
construction in an n-node graph gives an HCA with approximation quality O(log1.5n
loglogn). Among near-linear time algorithms, the best previous result achieves
approximation quality O(log4 n). We improve upon the latter result by giving the
first near-linear time algorithm for computing an HCA with approximation quality
O(log2 n loglogn). Additionally, our algorithm can be implemented in the parallel
setting with polylogarithmic span and near-linear work, achieving the same approximation
quality. This improves upon the best previous such algorithm, which has an O(log9n)
approximation quality. We also present a lower bound of Ω(logn) for the approximation
guarantee of hierarchical congestion approximators.\r\nCrucial for achieving a
near-linear running time is a new partitioning routine that, unlike previous such
routines, manages to avoid recursing on large subgraphs. To achieve the improved
approximation quality, we introduce the new concept of border routability of a
cut and provide an improved sparsest cut oracle for general vertex weights."
acknowledgement: "We thank Evangelos Kosinas for helpful discussions on this topic.\r\nFunded
by the European Union. Views and opinions expressed\r\nare however those of the
author(s) only and do not necessarily\r\nreflect those of the European Union or
the European Research\r\nCouncil Executive Agency. Neither the European Union nor
the\r\ngranting authority can be held responsible for them.\r\nThis project has
received funding from the European Research\r\nCouncil (ERC) under the European
Union’s Horizon 2020 research\r\nand innovation programme (MoDynStruct, No. 101019564)\r\nand
the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For\r\nopen access purposes,
the author has applied a CC BY public copyright license to any author-accepted manuscript
version arising\r\nfrom this submission.\r\nThis project has received funding from
the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858."
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Robin
full_name: Münk, Robin
last_name: Münk
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
citation:
ama: 'Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion
approximator in near-linear time. In: 58th Annual ACM Symposium on Theory of
Computing. ACM; 2026:1417-1428. doi:10.1145/3798129.3800851'
apa: 'Henzinger, M., Münk, R., & Räcke, H. (2026). An improved quality hierarchical
congestion approximator in near-linear time. In 58th Annual ACM Symposium on
Theory of Computing (pp. 1417–1428). Salt Lake City, UT, United States: ACM.
https://doi.org/10.1145/3798129.3800851'
chicago: Henzinger, Monika, Robin Münk, and Harald Räcke. “An Improved Quality Hierarchical
Congestion Approximator in Near-Linear Time.” In 58th Annual ACM Symposium
on Theory of Computing, 1417–28. ACM, 2026. https://doi.org/10.1145/3798129.3800851.
ieee: M. Henzinger, R. Münk, and H. Räcke, “An improved quality hierarchical congestion
approximator in near-linear time,” in 58th Annual ACM Symposium on Theory of
Computing, Salt Lake City, UT, United States, 2026, pp. 1417–1428.
ista: 'Henzinger M, Münk R, Räcke H. 2026. An improved quality hierarchical congestion
approximator in near-linear time. 58th Annual ACM Symposium on Theory of Computing.
STOC: Symposium on the Theory of Computing, 1417–1428.'
mla: Henzinger, Monika, et al. “An Improved Quality Hierarchical Congestion Approximator
in Near-Linear Time.” 58th Annual ACM Symposium on Theory of Computing,
ACM, 2026, pp. 1417–28, doi:10.1145/3798129.3800851.
short: M. Henzinger, R. Münk, H. Räcke, in:, 58th Annual ACM Symposium on Theory
of Computing, ACM, 2026, pp. 1417–1428.
conference:
end_date: 2026-06-26
location: Salt Lake City, UT, United States
name: 'STOC: Symposium on the Theory of Computing'
start_date: 2026-06-22
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-05T22:01:36Z
date_published: 2026-06-09T00:00:00Z
date_updated: 2026-09-17T12:39:36Z
day: '09'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.1145/3798129.3800851
ec_funded: 1
external_id:
arxiv:
- '2511.03716'
file:
- access_level: open_access
checksum: 2bef46be8da6d19a641697bb0d8ade65
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T06:57:16Z
date_updated: 2026-07-06T06:57:16Z
file_id: '22250'
file_name: 2026_STOC_HenzingerMo.pdf
file_size: 919005
relation: main_file
success: 1
file_date_updated: 2026-07-06T06:57:16Z
fulldoi: https://doi.org/10.1145/3798129.3800851
has_accepted_license: '1'
keyword:
- Congestion Approximators
- Hierarchical Graph Decompositions
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1417-1428
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: 58th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9798400725364'
issn:
- 0737-8017
publication_status: published
publisher: ACM
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: An improved quality hierarchical congestion approximator in near-linear time
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
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '21921'
abstract:
- lang: eng
text: "A variety of problems in geometry processing boil down to finding the most\r\nparallel
field relative to a connection. Instances of this prototypical problem\r\nshow
up in computing direction fields and stripe patterns, quadrilateral\r\nmeshing,
and visualization of fluid flows. When the class of allowed fields\r\nincludes
those with topological defects, a relaxation is required to make\r\nthe problem
well-posed. We observe that these problems can be viewed\r\nas synchronization
problems, which admit a natural semidefinite relaxation.\r\nWe propose a unified
method of solving all these problems via the efficient\r\nBurer-Monteiro factorization
method. Geometrically, this amounts to lifting the field values to a higher-dimensional
manifold, naturally resolving\r\nthe singular nature of defects. Practically,
we show that our convex relaxation method achieves better and more reliable optima
than previous work\r\nemploying alternative relaxations"
acknowledgement: "The authors thank Steven J. Gortler and Nicolas Boumal for interesting
discussions.\r\nDavid Palmer acknowledges the generous support of the NSF\r\nMSPRF
under award #2303403 during his time at Harvard University.\r\nNatalia Pacheco-Tallaj
was supported by the NSF DGE-2141064.\r\nMattéo Couplet was supported by Wallonie-Bruxelles
International"
article_processing_charge: No
author:
- first_name: Natalia
full_name: Pacheco-Tallaj, Natalia
last_name: Pacheco-Tallaj
- first_name: Matteo
full_name: Couplet, Matteo
last_name: Couplet
- first_name: Edward
full_name: Chien, Edward
last_name: Chien
- first_name: David
full_name: Palmer, David
id: 6574708f-2fd3-11f0-89e2-ae42ebc712a4
last_name: Palmer
orcid: 0000-0002-1931-5673
citation:
ama: 'Pacheco-Tallaj N, Couplet M, Chien E, Palmer D. Synchronizing fields with
singularities. In: SIGGRAPH Conference Papers. ACM; 2026. doi:10.1145/3799902.3811225'
apa: 'Pacheco-Tallaj, N., Couplet, M., Chien, E., & Palmer, D. (2026). Synchronizing
fields with singularities. In SIGGRAPH Conference Papers. Los Angeles,
CA, United States: ACM. https://doi.org/10.1145/3799902.3811225'
chicago: Pacheco-Tallaj, Natalia, Matteo Couplet, Edward Chien, and David Palmer.
“Synchronizing Fields with Singularities.” In SIGGRAPH Conference Papers.
ACM, 2026. https://doi.org/10.1145/3799902.3811225.
ieee: N. Pacheco-Tallaj, M. Couplet, E. Chien, and D. Palmer, “Synchronizing fields
with singularities,” in SIGGRAPH Conference Papers, Los Angeles, CA, United
States, 2026.
ista: 'Pacheco-Tallaj N, Couplet M, Chien E, Palmer D. 2026. Synchronizing fields
with singularities. SIGGRAPH Conference Papers. SIGGRAPH: International Conference
and Exhibition on Computer Graphics and Interactive Techniques.'
mla: Pacheco-Tallaj, Natalia, et al. “Synchronizing Fields with Singularities.”
SIGGRAPH Conference Papers, ACM, 2026, doi:10.1145/3799902.3811225.
short: N. Pacheco-Tallaj, M. Couplet, E. Chien, D. Palmer, in:, SIGGRAPH Conference
Papers, ACM, 2026.
conference:
end_date: 2026-07-23
location: Los Angeles, CA, United States
name: 'SIGGRAPH: International Conference and Exhibition on Computer Graphics and
Interactive Techniques'
start_date: 2026-07-19
corr_author: '1'
das_tickbox: '0'
date_created: 2026-05-29T12:53:59Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-09-17T12:37:42Z
day: '01'
ddc:
- '000'
department:
- _id: ChWo
doi: 10.1145/3799902.3811225
file:
- access_level: open_access
checksum: 501e37133361dd0de7f817644e8915da
content_type: application/pdf
creator: dernst
date_created: 2026-09-17T12:36:14Z
date_updated: 2026-09-17T12:36:14Z
file_id: '22962'
file_name: 2026_ACMSiggraph_PachecoTallaj.pdf
file_size: 39559100
relation: main_file
success: 1
file_date_updated: 2026-09-17T12:36:14Z
fulldoi: https://doi.org/10.1145/3799902.3811225
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: SIGGRAPH Conference Papers
publication_identifier:
eisbn:
- '9798400725548'
publication_status: published
publisher: ACM
quality_controlled: '1'
researchdata_availability: no
status: public
supplementarymaterial: no
title: Synchronizing fields with singularities
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
_id: '22808'
abstract:
- lang: eng
text: "As automated decision-makers have become ubiquitous in many domains of life,\r\ntheir
decisions have become increasingly consequential. Recent years have shown\r\nthat
such systems can exhibit discriminatory behaviour against individuals and\r\nsocial
groups alike, thereby amplifying existing biases and entrenching\r\nsocio-economic
disparities over time. Algorithmic fairness addresses this\r\nproblem by developing
methods to quantify and mitigate unfair behaviour.\r\nHowever, much of the existing
literature studies fairness in a static\r\npre-deployment setting and, therefore,
neglects that automated decision-makers are\r\noften deployed in dynamic environments,
where their behaviour and the\r\npopulations they affect may change over time.\r\n\r\nThis
thesis addresses this gap through the lens of runtime verification.\r\nInstead
of treating fairness as a property of a classifier together with a fixed\r\ninput
distribution, it reframes fairness as a property of the interaction trace\r\nbetween
the decision-maker and its deployment environment. To evaluate such\r\nsequential
fairness properties, the thesis develops runtime monitors that\r\nobserve the
evolving interaction between the system and the environment and\r\nissue verdicts
after each new observation. Because, these monitors are designed to detect\r\nunfair
behaviour during deployment, they complement fair training,\r\nauditing, verification,
and enforcement by providing an additional layer of mathematically rigorous fairness
assurance.\r\n\r\nIn summary, the thesis develops quantitative, trace-based analogues
of\r\nclassical group and individual fairness measures and constructs monitors
for\r\nthem. This includes monitors for long-run group fairness over Markovian
traces,\r\nfor the time-varying welfare of a changing population in a dynamical
system, and\r\nfor the individual fairness of an arbitrary system generating a
trace of inputs\r\nand outputs. To achieve this, the monitors combine ideas from
runtime\r\nverification, sequential statistics, and nearest-neighbour search.
In the\r\ngroup-fairness settings, monitoring is primarily a sequential statistical\r\nestimation
problem: the monitor must construct statistically sound interval\r\nestimates
of fairness values from dependent and partially observed interactions.\r\nIn the
individual-fairness setting, the main challenge is computational\r\nefficiency:
the monitor must detect individual fairness violations by efficiently comparing
the\r\ncurrent decision with all previously observed decisions.\r\n"
acknowledgement: "This work was supported in part by the ERC-2020-AdG 101020093 (VAMOS).\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Konstantin
full_name: Kueffner, Konstantin
id: 8121a2d0-dc85-11ea-9058-af578f3b4515
last_name: Kueffner
orcid: 0000-0001-8974-2542
citation:
ama: Kueffner K. Monitoring algorithmic fairness in sequential decision making.
2026. doi:10.15479/AT-ISTA-22808
apa: Kueffner, K. (2026). Monitoring algorithmic fairness in sequential decision
making. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22808
chicago: Kueffner, Konstantin. “Monitoring Algorithmic Fairness in Sequential Decision
Making.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22808.
ieee: K. Kueffner, “Monitoring algorithmic fairness in sequential decision making,”
Institute of Science and Technology Austria, 2026.
ista: Kueffner K. 2026. Monitoring algorithmic fairness in sequential decision making.
Institute of Science and Technology Austria.
mla: Kueffner, Konstantin. Monitoring Algorithmic Fairness in Sequential Decision
Making. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22808.
short: K. Kueffner, Monitoring Algorithmic Fairness in Sequential Decision Making,
Institute of Science and Technology Austria, 2026.
corr_author: '1'
date_created: 2026-09-05T15:59:19Z
date_published: 2026-09-07T00:00:00Z
date_updated: 2026-09-18T07:41:29Z
day: '07'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: GradSch
- _id: ToHe
doi: 10.15479/AT-ISTA-22808
doi_confirm: '1'
ec_funded: 1
file:
- access_level: closed
checksum: 716ce44a6ed9a727f231bdebdeecc741
content_type: application/zip
creator: kkueffne
date_created: 2026-09-11T07:32:13Z
date_updated: 2026-09-11T07:32:13Z
file_id: '22903'
file_name: Thesis_Konstantin_Kueffner-3.zip
file_size: 26356903
relation: source_file
- access_level: open_access
checksum: 77082e90b8330fb46f585843840c5d5c
content_type: application/pdf
creator: kkueffne
date_created: 2026-09-11T07:32:17Z
date_updated: 2026-09-11T07:32:17Z
file_id: '22904'
file_name: Thesis_Konstantin_Kueffner-2.pdf
file_size: 10051715
relation: main_file
file_date_updated: 2026-09-11T07:32:17Z
fulldoi: https://doi.org/10.15479/AT-ISTA-22808
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '183'
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication_identifier:
isbn:
- 978-3-99078-089-3
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '13310'
relation: part_of_dissertation
status: public
- id: '14454'
relation: part_of_dissertation
status: public
- id: '20292'
relation: part_of_dissertation
status: public
- id: '21090'
relation: part_of_dissertation
status: public
- id: '13228'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
title: Monitoring algorithmic fairness in sequential decision making
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: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: publisher
_id: '22873'
acknowledged_ssus:
- _id: ScienComp
- _id: CampIT
acknowledgement: I acknowledge funding by the Austrian Science Fund (FWF) [10.55776/PAT8537123].
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Andreas
full_name: Ehrmann, Andreas
id: eaa689ed-f6e0-11ea-865d-bd98cbcf83c2
last_name: Ehrmann
orcid: 0000-0002-0997-5678
citation:
ama: 'Ehrmann A. Biological functionality without biochemistry: Designing nanomachines
for target behavior. 2026. doi:10.15479/AT-ISTA-22873'
apa: 'Ehrmann, A. (2026). Biological functionality without biochemistry: Designing
nanomachines for target behavior. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT-ISTA-22873'
chicago: 'Ehrmann, Andreas. “Biological Functionality without Biochemistry: Designing
Nanomachines for Target Behavior.” Institute of Science and Technology Austria,
2026. https://doi.org/10.15479/AT-ISTA-22873.'
ieee: 'A. Ehrmann, “Biological functionality without biochemistry: Designing nanomachines
for target behavior,” Institute of Science and Technology Austria, 2026.'
ista: 'Ehrmann A. 2026. Biological functionality without biochemistry: Designing
nanomachines for target behavior. Institute of Science and Technology Austria.'
mla: 'Ehrmann, Andreas. Biological Functionality without Biochemistry: Designing
Nanomachines for Target Behavior. Institute of Science and Technology Austria,
2026, doi:10.15479/AT-ISTA-22873.'
short: 'A. Ehrmann, Biological Functionality without Biochemistry: Designing Nanomachines
for Target Behavior, Institute of Science and Technology Austria, 2026.'
corr_author: '1'
das_tickbox: '0'
date_created: 2026-09-09T12:18:24Z
date_published: 2026-09-04T00:00:00Z
date_updated: 2026-09-18T11:28:29Z
day: '04'
ddc:
- '530'
- '600'
- '621'
- '004'
- '005'
degree_awarded: PhD
department:
- _id: GradSch
- _id: CaGo
- _id: EdHa
doi: 10.15479/AT-ISTA-22873
doi_confirm: '1'
file:
- access_level: closed
checksum: a5e3d79e0e5f3f4fb3c414e48116dc9e
content_type: application/pdf
creator: aehrmann
date_created: 2026-09-11T07:23:57Z
date_updated: 2026-09-17T08:59:39Z
embargo: 2027-01-15
embargo_to: open_access
file_id: '22901'
file_name: 2026_Ehrmann_Andreas_Thesis.pdf
file_size: 14782662
relation: main_file
- access_level: closed
checksum: 0235b9c52fee0c97f402f1c3d4efc1eb
content_type: application/zip
creator: aehrmann
date_created: 2026-09-11T07:24:14Z
date_updated: 2026-09-11T07:24:14Z
description: All LaTeX files to compile my PhD Thesis.
file_id: '22902'
file_name: thesis_latex_files.zip
file_size: 155228
relation: source_file
file_date_updated: 2026-09-17T08:59:39Z
fulldoi: https://doi.org/10.15479/AT-ISTA-22873
has_accepted_license: '1'
keyword:
- PhD Thesis
- functional nanomachines
- biological functionality
- nanotechnology
- energy delivery
- target behavior
- dynamics
- design principles
- optimization
- differentiable statistical physics
- machine learning
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '09'
oa_version: Published Version
page: '168'
project:
- _id: 90a98bb5-16d5-11f0-9cad-9675f3f8015d
grant_number: PAT 8537123
name: Functional bio-inspired nanomachines from sticky colloids
publication_identifier:
isbn:
- 978-3-99078-092-3
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22893'
relation: part_of_dissertation
status: public
- id: '22892'
relation: part_of_dissertation
status: public
researchdata_availability: upon request
status: public
supervisor:
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
supplementarymaterial: not applicable
title: 'Biological functionality without biochemistry: Designing nanomachines for
target behavior'
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22893'
abstract:
- lang: eng
text: Many biological machines function through controlled conformational transitions,
yet designing synthetic nanostructures with prescribed dynamical behavior remains
a major challenge. Here, we develop a modular inverse-design framework for bistable
nanostructures whose function is controlled by an energy profile along a geometric
reaction coordinate. Inspired by proteins with rigid domains connected by flexible
hinges, we introduce a hinge-arm paradigm in which a small bistable hinge controls
the energetics of a conformational transition, while rigid arms map this transition
onto the separation between external binding sites. Specifically, we ask which
features of a target energy profile can be programmed under different design constraints.
We find that the energy barriers and the binding-site separations in the two metastable
states can be readily designed, while controlling the location of the transition
state or the full shape of the energy profile requires additional design freedom.
Using a differentiable design framework, we find that some optimized solutions
are numerically inexact but still display the functional behavior for which the
target profile was selected, emphasizing the importance of function-based evaluation
criteria. These results establish a practical hierarchy of designability for bistable
nanostructures and provide a route toward synthetic nanomachines that couple conformational
transitions to target behavior.
acknowledgement: "We thank Maitane Muñoz-Basagoiti for stimulating\r\ndiscussions.
This research was funded in part by the\r\nAustrian Science Fund (FWF) [10.55776/PAT8537123].\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Andreas
full_name: Ehrmann, Andreas
id: eaa689ed-f6e0-11ea-865d-bd98cbcf83c2
last_name: Ehrmann
orcid: 0000-0002-0997-5678
- first_name: Marija
full_name: Krstić, Marija
id: a8f6d1c6-3200-11ee-973b-dab948eace26
last_name: Krstić
- first_name: Sahar
full_name: Samadzadeh, Sahar
id: 0099896b-5fb8-11ef-8420-b30b14627e93
last_name: Samadzadeh
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: Ehrmann A, Krstić M, Samadzadeh S, Goodrich CP. Designing bistable nanostructures
for target behavior. arXiv. doi:10.48550/arXiv.2606.31620
apa: Ehrmann, A., Krstić, M., Samadzadeh, S., & Goodrich, C. P. (n.d.). Designing
bistable nanostructures for target behavior. arXiv. https://doi.org/10.48550/arXiv.2606.31620
chicago: Ehrmann, Andreas, Marija Krstić, Sahar Samadzadeh, and Carl Peter Goodrich.
“Designing Bistable Nanostructures for Target Behavior.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2606.31620.
ieee: A. Ehrmann, M. Krstić, S. Samadzadeh, and C. P. Goodrich, “Designing bistable
nanostructures for target behavior,” arXiv. .
ista: Ehrmann A, Krstić M, Samadzadeh S, Goodrich CP. Designing bistable nanostructures
for target behavior. arXiv, 10.48550/arXiv.2606.31620.
mla: Ehrmann, Andreas, et al. “Designing Bistable Nanostructures for Target Behavior.”
ArXiv, doi:10.48550/arXiv.2606.31620.
short: A. Ehrmann, M. Krstić, S. Samadzadeh, C.P. Goodrich, ArXiv (n.d.).
corr_author: '1'
date_created: 2026-09-09T13:19:13Z
date_published: 2026-06-30T00:00:00Z
date_updated: 2026-09-18T11:28:28Z
day: '30'
department:
- _id: CaGo
- _id: EdHa
- _id: AnSa
doi: 10.48550/arXiv.2606.31620
external_id:
arxiv:
- '2606.31620'
fulldoi: https://doi.org/10.48550/arXiv.2606.31620
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2606.31620
month: '06'
oa: 1
oa_version: Preprint
project:
- _id: 90a98bb5-16d5-11f0-9cad-9675f3f8015d
grant_number: PAT 8537123
name: Functional bio-inspired nanomachines from sticky colloids
publication: arXiv
publication_status: draft
related_material:
record:
- id: '22873'
relation: dissertation_contains
status: public
status: public
title: Designing bistable nanostructures for target behavior
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...