---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21247'
abstract:
- lang: eng
text: Seasonal snowmelt in High Mountain Asia is an important source of river discharge.
Therefore, observation of the spatiotemporal variations in snow cover at catchment
scales using high-resolution satellites is essential for understanding changes
in water supply from headwater catchments. In this study, we adapt an algorithm
to automatically detect the snowline altitude (SLA) using the Google Earth Engine
platform with available high-resolution multispectral satellite archives that
can be readily applied for areas of interest. Here, we applied and evaluated the
tool to five glacierized watersheds across the Himalayas to quantify the changes
in seasonal and annual snow cover over the past 21 years and analyze climate reanalysis
data to assess the meteorological factors influencing the SLA. Our findings revealed
substantial variations in the SLA among sites in terms of seasonal patterns, decadal
trends, and meteorological controls. We identify positive trends in SLA in Hidden
Valley (+11.9 m yr−1), Langtang (+14.4 m yr−1), and Rolwaling (+8.2 m yr−1) in
the Nepalese Himalayas but a negative trend in Satopanth (−15.6 m yr−1) in the
western Indian Himalayas and no significant trend in Parlung in southeastern Tibet.
We suggest that the increase in SLA in Nepal was caused by warmer temperatures
during the monsoon season, whereas the decrease in SLA in India was driven by
increased winter snowfall and reduced monsoon snowmelt. By integrating the outcomes
of these analyses, we found that long-term changes in SLA are primarily driven
by shifts in the local climate, whereas seasonal variability may be influenced
by geographic features in conjunction with climate.
acknowledgement: We thank Maud Bernat for helping with the modification of the automatic
detection code and Michael McCarthy for preparing snowline data derived from the
MODIS satellite. This research was supported by the JSPS–SNSF (Japan Society for
the Promotion of Science–Swiss National Science Foundation) bilateral program project
(HOPE, High-elevation precipitation in High Mountain Asia; JPJSJRP 20191503, grant
no. 183633) and JSPS KAKENHI (grant nos. 23K13417 and 23H01509).
article_processing_charge: No
article_type: original
author:
- first_name: Orie
full_name: Sasaki, Orie
last_name: Sasaki
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
- first_name: Akiko
full_name: Sakai, Akiko
last_name: Sakai
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
citation:
ama: Sasaki O, Miles ES, Pellicciotti F, Sakai A, Fujita K. Contrasting patterns
of change in snowline altitude across five Himalayan catchments. The Cryosphere.
2025;19(11):5283-5298. doi:10.5194/tc-19-5283-2025
apa: Sasaki, O., Miles, E. S., Pellicciotti, F., Sakai, A., & Fujita, K. (2025).
Contrasting patterns of change in snowline altitude across five Himalayan catchments.
The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-19-5283-2025
chicago: Sasaki, Orie, Evan S. Miles, Francesca Pellicciotti, Akiko Sakai, and Koji
Fujita. “Contrasting Patterns of Change in Snowline Altitude across Five Himalayan
Catchments.” The Cryosphere. Copernicus Publications, 2025. https://doi.org/10.5194/tc-19-5283-2025.
ieee: O. Sasaki, E. S. Miles, F. Pellicciotti, A. Sakai, and K. Fujita, “Contrasting
patterns of change in snowline altitude across five Himalayan catchments,” The
Cryosphere, vol. 19, no. 11. Copernicus Publications, pp. 5283–5298, 2025.
ista: Sasaki O, Miles ES, Pellicciotti F, Sakai A, Fujita K. 2025. Contrasting patterns
of change in snowline altitude across five Himalayan catchments. The Cryosphere.
19(11), 5283–5298.
mla: Sasaki, Orie, et al. “Contrasting Patterns of Change in Snowline Altitude across
Five Himalayan Catchments.” The Cryosphere, vol. 19, no. 11, Copernicus
Publications, 2025, pp. 5283–98, doi:10.5194/tc-19-5283-2025.
short: O. Sasaki, E.S. Miles, F. Pellicciotti, A. Sakai, K. Fujita, The Cryosphere
19 (2025) 5283–5298.
date_created: 2026-02-16T15:36:51Z
date_published: 2025-11-01T00:00:00Z
date_updated: 2026-02-17T12:49:00Z
day: '01'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.5194/tc-19-5283-2025
file:
- access_level: open_access
checksum: 2bb8ada7536bb69b39448f13098f8cea
content_type: application/pdf
creator: dernst
date_created: 2026-02-17T12:35:44Z
date_updated: 2026-02-17T12:35:44Z
file_id: '21303'
file_name: 2025_Cryosphere_Sasaki.pdf
file_size: 6617241
relation: main_file
success: 1
file_date_updated: 2026-02-17T12:35:44Z
has_accepted_license: '1'
intvolume: ' 19'
issue: '11'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '11'
oa: 1
oa_version: Published Version
page: 5283-5298
publication: The Cryosphere
publication_identifier:
eissn:
- 1994-0424
publication_status: published
publisher: Copernicus Publications
quality_controlled: '1'
status: public
title: Contrasting patterns of change in snowline altitude across five Himalayan catchments
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: 19
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '21250'
abstract:
- lang: eng
text: We investigate the step complexity of the Leader Election problem (and implementing
the corresponding test-and-set object) in asynchronous shared memory, where processes
communicate through registers supporting atomic read and write and must coordinate
so that a single process becomes the leader. Determining tight step complexity
bounds for solving this problem is one of the key open problems in the theory
of shared memory distributed computing. The best known algorithm is a randomized
tournament-tree, which has worst-case expected step complexity O(log N) for N
processes. There are provably no deterministic wait-free algorithms, and only
restricted lower bounds are known for obstruction-free and randomized wait-free
algorithms. We introduce a new lower bound that establishes an Ω((log N)/(log
log N + log Q)) step complexity for any obstruction-free Leader Election algorithm,
where N is the number of processes, and 2 ≤ Q ≤ N is a bound on the value contention,
which we define as the maximum number of different values that processes can be
simultaneously poised to write to the same register in any execution of the algorithm.
Our result is strictly stronger than previous bounds based on write contention.
In particular, it implies new lower bounds on step complexity that depend on register
size.
acknowledgement: The work of Dan Alistarh is supported by grants from ERC, Austrian
FWF, and the Google and NVIDIA corporations. Faith Ellen was supported in part by
the Natural Science and Engineering Research Council of Canada (NSERC) grant RGPIN-2020-04178.
alternative_title:
- LIPIcs
article_processing_charge: Yes
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Faith
full_name: Ellen, Faith
last_name: Ellen
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
citation:
ama: 'Alistarh D-A, Ellen F, Fedorov A. An almost-logarithmic lower bound for leader
election with bounded value contention. In: 39th International Symposium on
Distributed Computing. Vol 356. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2025:3:1-3:16. doi:10.4230/LIPIcs.DISC.2025.3'
apa: 'Alistarh, D.-A., Ellen, F., & Fedorov, A. (2025). An almost-logarithmic
lower bound for leader election with bounded value contention. In 39th International
Symposium on Distributed Computing (Vol. 356, p. 3:1-3:16). Berlin, Germany:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2025.3'
chicago: Alistarh, Dan-Adrian, Faith Ellen, and Alexander Fedorov. “An Almost-Logarithmic
Lower Bound for Leader Election with Bounded Value Contention.” In 39th International
Symposium on Distributed Computing, 356:3:1-3:16. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025. https://doi.org/10.4230/LIPIcs.DISC.2025.3.
ieee: D.-A. Alistarh, F. Ellen, and A. Fedorov, “An almost-logarithmic lower bound
for leader election with bounded value contention,” in 39th International Symposium
on Distributed Computing, Berlin, Germany, 2025, vol. 356, p. 3:1-3:16.
ista: 'Alistarh D-A, Ellen F, Fedorov A. 2025. An almost-logarithmic lower bound
for leader election with bounded value contention. 39th International Symposium
on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol.
356, 3:1-3:16.'
mla: Alistarh, Dan-Adrian, et al. “An Almost-Logarithmic Lower Bound for Leader
Election with Bounded Value Contention.” 39th International Symposium on Distributed
Computing, vol. 356, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025,
p. 3:1-3:16, doi:10.4230/LIPIcs.DISC.2025.3.
short: D.-A. Alistarh, F. Ellen, A. Fedorov, in:, 39th International Symposium on
Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025,
p. 3:1-3:16.
conference:
end_date: 2025-10-31
location: Berlin, Germany
name: 'DISC: Symposium on Distributed Computing'
start_date: 2025-10-27
corr_author: '1'
date_created: 2026-02-16T15:41:15Z
date_published: 2025-10-22T00:00:00Z
date_updated: 2026-02-18T06:49:38Z
day: '22'
ddc:
- '000'
department:
- _id: DaAl
- _id: GradSch
doi: 10.4230/LIPIcs.DISC.2025.3
file:
- access_level: open_access
checksum: 3825a0e6e6a05503e842a59f95528bd9
content_type: application/pdf
creator: dernst
date_created: 2026-02-18T06:46:02Z
date_updated: 2026-02-18T06:46:02Z
file_id: '21310'
file_name: 2025_LIPIcs_Alistarh.pdf
file_size: 1492189
relation: main_file
success: 1
file_date_updated: 2026-02-18T06:46:02Z
has_accepted_license: '1'
intvolume: ' 356'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 3:1-3:16
publication: 39th International Symposium on Distributed Computing
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: An almost-logarithmic lower bound for leader election with bounded value contention
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: 356
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21251'
abstract:
- lang: eng
text: Cellular membranes differ across the tree of life. In most bacteria and eukaryotes,
single-headed lipids self-assemble into flexible bilayer membranes. By contrast,
thermophilic archaea tend to possess bilayer lipids together with double-headed,
monolayer spanning bolalipids, which are thought to enable cells to survive in
harsh environments. Here, using a minimal computational model for bolalipid membranes,
we explore the trade-offs at play when forming membranes. We find that flexible
bolalipids form membranes that resemble bilayer membranes because they are able
to assume a U-shaped conformation. Conversely, rigid bolalipids, which resemble
the bolalipids with cyclic groups found in thermophilic archaea, take on a straight
conformation and form membranes that are stiff and prone to pore formation when
they undergo changes in shape. Strikingly, however, the inclusion of small amounts
of bilayer lipids in a bolalipid membrane is enough to achieve fluid bolalipid
membranes that are both stable and flexible, resolving this trade-off. Our study
suggests a mechanism by which archaea can tune the material properties of their
membranes as and when required to enable them to survive in harsh environments
and to undergo essential membrane remodelling events like cell division.
acknowledgement: MA, BB, and AŠ acknowledge funding by the Volkswagen Foundation Grant
Az 96727. FF acknowledges financial support by the NOMIS foundation. AŠ acknowledges
funding by ERC Starting Grant 'NEPA' 802960. We thank Claudia Flandoli for her help
with illustrations.
article_number: '105432'
article_processing_charge: Yes
article_type: original
author:
- first_name: Miguel
full_name: Santana de Freitas Amaral, Miguel
id: 4f2d02dd-47a9-11ec-ad10-82820ed3f501
last_name: Santana de Freitas Amaral
- first_name: Felix F
full_name: Frey, Felix F
id: a0270b37-8f1a-11ec-95c7-8e710c59a4f3
last_name: Frey
orcid: 0000-0001-8501-6017
- first_name: Xiuyun
full_name: Jiang, Xiuyun
last_name: Jiang
- first_name: Buzz
full_name: Baum, Buzz
last_name: Baum
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Santana de Freitas Amaral M, Frey FF, Jiang X, Baum B, Šarić A. Balancing stability
and flexibility when reshaping archaeal membranes. eLife. 2025;14. doi:10.7554/elife.105432
apa: Santana de Freitas Amaral, M., Frey, F. F., Jiang, X., Baum, B., & Šarić,
A. (2025). Balancing stability and flexibility when reshaping archaeal membranes.
ELife. eLife Sciences Publications. https://doi.org/10.7554/elife.105432
chicago: Santana de Freitas Amaral, Miguel, Felix F Frey, Xiuyun Jiang, Buzz Baum,
and Anđela Šarić. “Balancing Stability and Flexibility When Reshaping Archaeal
Membranes.” ELife. eLife Sciences Publications, 2025. https://doi.org/10.7554/elife.105432.
ieee: M. Santana de Freitas Amaral, F. F. Frey, X. Jiang, B. Baum, and A. Šarić,
“Balancing stability and flexibility when reshaping archaeal membranes,” eLife,
vol. 14. eLife Sciences Publications, 2025.
ista: Santana de Freitas Amaral M, Frey FF, Jiang X, Baum B, Šarić A. 2025. Balancing
stability and flexibility when reshaping archaeal membranes. eLife. 14, 105432.
mla: Santana de Freitas Amaral, Miguel, et al. “Balancing Stability and Flexibility
When Reshaping Archaeal Membranes.” ELife, vol. 14, 105432, eLife Sciences
Publications, 2025, doi:10.7554/elife.105432.
short: M. Santana de Freitas Amaral, F.F. Frey, X. Jiang, B. Baum, A. Šarić, ELife
14 (2025).
corr_author: '1'
date_created: 2026-02-16T15:43:57Z
date_published: 2025-10-07T00:00:00Z
date_updated: 2026-02-23T11:49:05Z
day: '07'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.7554/elife.105432
ec_funded: 1
external_id:
pmid:
- '41056191 '
file:
- access_level: open_access
checksum: 4116cd5143558ded995fb9ff5fcbc7e0
content_type: application/pdf
creator: dernst
date_created: 2026-02-17T13:02:02Z
date_updated: 2026-02-17T13:02:02Z
file_id: '21305'
file_name: 2025_elife_Amaral.pdf
file_size: 10668225
relation: main_file
success: 1
file_date_updated: 2026-02-17T13:02:02Z
has_accepted_license: '1'
intvolume: ' 14'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: eba2549b-77a9-11ec-83b8-a81e493eae4e
call_identifier: H2020
grant_number: '802960'
name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines'
publication: eLife
publication_identifier:
eissn:
- 2050-084X
publication_status: published
publisher: eLife Sciences Publications
quality_controlled: '1'
related_material:
record:
- id: '21304'
relation: software
status: public
status: public
title: Balancing stability and flexibility when reshaping archaeal membranes
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: 14
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21252'
abstract:
- lang: eng
text: "Context. Recent observational results from asteroseismic studies show that
an important fraction of solar-like stars do not present detectable stochastically
excited acoustic oscillations. This non-detectability seems to correlate with
a high rotation rate in the convective envelope and a high surface magnetic activity.
At the same time, the properties of stellar convection are affected by rotation
and magnetism.\r\nAims. We investigate the role of rotation in the excitation
of acoustic modes in the convective envelope of solar-like stars, to evaluate
its impact on the energy injected in the oscillations.\r\nMethods. We derived
theoretical prescriptions for the excitation of acoustic waves in the convective
envelope of rotating solar-like stars. We adopted the rotating mixing-length Theory
to model the influence of rotation on convection. We used the MESA stellar evolution
code and the GYRE stellar oscillation code to estimate the power injected in the
oscillations from our theoretical prescriptions.\r\nResults. We demonstrate that
the power injected in the acoustic modes is insensitive to rotation if a Gaussian
time-correlation function is assumed, while it can decrease by up to 60% for a
Lorentzian time-correlation function, for a 20 Ω⊙ rotation rate. We show that
the modification of the excitation rate by rotation depends not only on the rotation
rate but also on the radial and angular orders of the considered oscillation mode.
This result can allow for better constraints on the properties of stellar convection
by studying observationally acoustic mode excitation.\r\nConclusions. These results
demonstrate how important it is to take into account the modification of stellar
convection by rotation when evaluating the amplitude of the stellar oscillations
it stochastically excites. They open the path for understanding the large variety
of observed acoustic-mode amplitudes at the surface of solar-like stars as a function
of surface rotation rates."
acknowledgement: 'The authors thank the referee for detailed comments that allow them
to improve their work. The authors thank Jordan Philidet and Kevin Belkacem for
fruitful discussions. L.B. and Stéphane M. acknowledge support from the European
Research Council (ERC) under the Horizon Europe program (Synergy Grant agreement
101071505: 4D-STAR), from the CNES SOHO-GOLF and PLATO grants at CEA-DAp, and from
PNPS (CNRS/INSU). While partially funded by the European Union, views and opinions
expressed are however those of the author only and do not necessarily reflect those
of the European Union or the European Research Council. Neither the European Union
nor the granting authority can be held responsible for them. Savita M. acknowledges
support from the Spanish Ministry of Science and Innovation with the grant no. PID2019-107061GB-C66
and through AEI under the Severo Ochoa Centres of Excellence Programme 2020–2023
(CEX2019-000920-S).'
article_number: A25
article_processing_charge: Yes
article_type: original
author:
- first_name: L.
full_name: Bessila, L.
last_name: Bessila
- first_name: A.
full_name: Deckx van Ruys, A.
last_name: Deckx van Ruys
- first_name: V.
full_name: Buriasco, V.
last_name: Buriasco
- first_name: S.
full_name: Mathis, S.
last_name: Mathis
- first_name: Lisa Annabelle
full_name: Bugnet, Lisa Annabelle
id: d9edb345-f866-11ec-9b37-d119b5234501
last_name: Bugnet
orcid: 0000-0003-0142-4000
- first_name: R. A.
full_name: García, R. A.
last_name: García
- first_name: S.
full_name: Mathur, S.
last_name: Mathur
citation:
ama: Bessila L, Deckx van Ruys A, Buriasco V, et al. The impact of rotation on the
stochastic excitation of stellar acoustic modes in solar-like pulsators. Astronomy
& Astrophysics. 2025;700. doi:10.1051/0004-6361/202452093
apa: Bessila, L., Deckx van Ruys, A., Buriasco, V., Mathis, S., Bugnet, L. A., García,
R. A., & Mathur, S. (2025). The impact of rotation on the stochastic excitation
of stellar acoustic modes in solar-like pulsators. Astronomy & Astrophysics.
EDP Sciences. https://doi.org/10.1051/0004-6361/202452093
chicago: Bessila, L., A. Deckx van Ruys, V. Buriasco, S. Mathis, Lisa Annabelle
Bugnet, R. A. García, and S. Mathur. “The Impact of Rotation on the Stochastic
Excitation of Stellar Acoustic Modes in Solar-like Pulsators.” Astronomy &
Astrophysics. EDP Sciences, 2025. https://doi.org/10.1051/0004-6361/202452093.
ieee: L. Bessila et al., “The impact of rotation on the stochastic excitation
of stellar acoustic modes in solar-like pulsators,” Astronomy & Astrophysics,
vol. 700. EDP Sciences, 2025.
ista: Bessila L, Deckx van Ruys A, Buriasco V, Mathis S, Bugnet LA, García RA, Mathur
S. 2025. The impact of rotation on the stochastic excitation of stellar acoustic
modes in solar-like pulsators. Astronomy & Astrophysics. 700, A25.
mla: Bessila, L., et al. “The Impact of Rotation on the Stochastic Excitation of
Stellar Acoustic Modes in Solar-like Pulsators.” Astronomy & Astrophysics,
vol. 700, A25, EDP Sciences, 2025, doi:10.1051/0004-6361/202452093.
short: L. Bessila, A. Deckx van Ruys, V. Buriasco, S. Mathis, L.A. Bugnet, R.A.
García, S. Mathur, Astronomy & Astrophysics 700 (2025).
date_created: 2026-02-16T15:46:59Z
date_published: 2025-08-01T00:00:00Z
date_updated: 2026-02-17T13:10:18Z
day: '01'
ddc:
- '520'
department:
- _id: LiBu
doi: 10.1051/0004-6361/202452093
file:
- access_level: open_access
checksum: b8a0927307c1d82025bcb5af47b20b26
content_type: application/pdf
creator: dernst
date_created: 2026-02-17T13:07:45Z
date_updated: 2026-02-17T13:07:45Z
file_id: '21306'
file_name: 2025_AstronomyAstrophysics_Bessila.pdf
file_size: 7161755
relation: main_file
success: 1
file_date_updated: 2026-02-17T13:07:45Z
has_accepted_license: '1'
intvolume: ' 700'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
status: public
title: The impact of rotation on the stochastic excitation of stellar acoustic modes
in solar-like pulsators
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: 700
year: '2025'
...
---
OA_type: closed access
_id: '21255'
abstract:
- lang: eng
text: As an important plant hormone to regulate growth and development, auxin has
been investigated for more than a century. It had been clearly demonstrated and
well-accepted that the intracellular auxin receptors, TIR1/AFBs, are F-box proteins
mediating transcriptional auxin signaling by their E3 ubiquitin ligase activity,
which targets and sends for degradation the Aux/IAA transcriptional repressors.
The recent discovery of adenylate cyclase (AC) and guanylate cyclase (GC) activities
for TIR1/AFBs open entirely new perspectives on how auxin signaling can operate.
This chapter traces back the history of how canonical transcriptional auxin signaling
was established and introduces the discovery of the TIR1/AFBs-mediated nontranscriptional
signaling branch. Finally, the current understanding and open questions of how
TIR1/AFBs’ AC and GC activities contribute to the transcriptional and nontranscriptional
auxin signaling are discussed, highlighting the possibility that cyclic adenosine
monophosphate (cAMP) and cyclic guanosine monophosphate (cGMP) act as second messengers
in auxin signal transduction.
alternative_title:
- Foundations and Frontiers in Enzymology
article_processing_charge: No
author:
- first_name: Linlin
full_name: Qi, Linlin
last_name: Qi
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: 'Qi L, Friml J. Nucleotidyl cyclase activities of TIR1/AFB auxin receptors:
new insights into the mechanism of auxin signaling. In: Irving H, Gehring C, Wong
A, eds. Cryptic Enzymes and Moonlighting Proteins. Elsevier; 2025:299-322.
doi:10.1016/b978-0-443-15719-6.00015-5'
apa: 'Qi, L., & Friml, J. (2025). Nucleotidyl cyclase activities of TIR1/AFB
auxin receptors: new insights into the mechanism of auxin signaling. In H. Irving,
C. Gehring, & A. Wong (Eds.), Cryptic Enzymes and Moonlighting Proteins
(pp. 299–322). Elsevier. https://doi.org/10.1016/b978-0-443-15719-6.00015-5'
chicago: 'Qi, Linlin, and Jiří Friml. “Nucleotidyl Cyclase Activities of TIR1/AFB
Auxin Receptors: New Insights into the Mechanism of Auxin Signaling.” In Cryptic
Enzymes and Moonlighting Proteins, edited by Helen Irving, Chris Gehring,
and Aloysius Wong, 299–322. Elsevier, 2025. https://doi.org/10.1016/b978-0-443-15719-6.00015-5.'
ieee: 'L. Qi and J. Friml, “Nucleotidyl cyclase activities of TIR1/AFB auxin receptors:
new insights into the mechanism of auxin signaling,” in Cryptic Enzymes and
Moonlighting Proteins, H. Irving, C. Gehring, and A. Wong, Eds. Elsevier,
2025, pp. 299–322.'
ista: 'Qi L, Friml J. 2025.Nucleotidyl cyclase activities of TIR1/AFB auxin receptors:
new insights into the mechanism of auxin signaling. In: Cryptic Enzymes and Moonlighting
Proteins. Foundations and Frontiers in Enzymology, , 299–322.'
mla: 'Qi, Linlin, and Jiří Friml. “Nucleotidyl Cyclase Activities of TIR1/AFB Auxin
Receptors: New Insights into the Mechanism of Auxin Signaling.” Cryptic Enzymes
and Moonlighting Proteins, edited by Helen Irving et al., Elsevier, 2025,
pp. 299–322, doi:10.1016/b978-0-443-15719-6.00015-5.'
short: L. Qi, J. Friml, in:, H. Irving, C. Gehring, A. Wong (Eds.), Cryptic Enzymes
and Moonlighting Proteins, Elsevier, 2025, pp. 299–322.
date_created: 2026-02-16T15:53:52Z
date_published: 2025-05-02T00:00:00Z
date_updated: 2026-02-17T13:28:38Z
day: '02'
department:
- _id: JiFr
doi: 10.1016/b978-0-443-15719-6.00015-5
editor:
- first_name: Helen
full_name: Irving, Helen
last_name: Irving
- first_name: Chris
full_name: Gehring, Chris
last_name: Gehring
- first_name: Aloysius
full_name: Wong, Aloysius
last_name: Wong
language:
- iso: eng
month: '05'
oa_version: None
page: 299-322
publication: Cryptic Enzymes and Moonlighting Proteins
publication_identifier:
isbn:
- '9780443157196'
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Nucleotidyl cyclase activities of TIR1/AFB auxin receptors: new insights into
the mechanism of auxin signaling'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21256'
abstract:
- lang: eng
text: Collagen IV is one of the main components of the basement membrane, a layer
of material that lines the majority of tissues in multicellular organisms. Collagen
IV molecules assemble into networks, providing stiffness and elasticity to tissues
and informing cell and organ shape, especially during development. In this work,
we develop two coarse-grained models for collagen IV molecules that retain biochemical
bond specificity and coarse grain at different length scales. Through molecular-dynamics
simulations, we test the assembly and mechanics of the resulting networks and
measure their response to strain in terms of stress, microscopic alignment, and
bond dynamics. Within the basement membrane, collagen IV networks rearrange by
molecule turnover, which affects tissue organization and can be linked with enzyme
activity. Here we explore network rearrangements via bond remodeling, the process
of breaking and remaking of bonds between network molecules. We then investigate
the effects of active (enzymatic) bond remodeling. We find that this nonequilibrium
remodeling allows a network to keep its integrity under strain, while relaxing
fully over a variety of timescales, a dynamic response that is unavailable to
networks undergoing equilibrium remodeling.
acknowledgement: This work received funding from the European Research Council under
the European Union's Horizon 2020 research and innovation program through Grant
Agreement No. 802960 (B.M., V.S., I.P., and A.Š.), the European Union's Horizon
2020 research and innovation program under the Marie Skłodowska-Curie Grant Agreement
No. 101034413 (I.P.), the NOMIS Foundation (F.P.-V.), the National Centre for the
Replacement, Refinement and Reduction of Animals in Research Grant No. NC/T002425/1
(N.K.), Leverhulme Trust project Grant No. RPG-2020-068 (N.K.), MRC Fellowship No.
MR/W027437/1 (Y.M.), a Lister Institute Research Prize (Y.M.) and EMBO Young Investigator
Programme (Y.M. and A.Š.).
article_number: '033019'
article_processing_charge: Yes
article_type: original
author:
- first_name: Billie
full_name: Meadowcroft, Billie
id: a4725fd6-932b-11ed-81e2-c098c7f37ae1
last_name: Meadowcroft
orcid: 0000-0003-3441-1337
- first_name: Valerio
full_name: Sorichetti, Valerio
id: ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b
last_name: Sorichetti
orcid: 0000-0002-9645-6576
- first_name: Eryk
full_name: Ratajczyk, Eryk
last_name: Ratajczyk
- first_name: Fernanda L
full_name: Perez Verdugo, Fernanda L
id: 4ecec223-9070-11ef-a0a9-bc76077bea8d
last_name: Perez Verdugo
- first_name: Nargess
full_name: Khalilgharibi, Nargess
last_name: Khalilgharibi
- first_name: Yanlan
full_name: Mao, Yanlan
last_name: Mao
- first_name: Ivan
full_name: Palaia, Ivan
id: 9c805cd2-4b75-11ec-a374-db6dd0ed57fa
last_name: Palaia
orcid: ' 0000-0002-8843-9485 '
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Meadowcroft B, Sorichetti V, Ratajczyk E, et al. Nonequilibrium remodeling
of collagen IV networks in Silico. PRX Life. 2025;3. doi:10.1103/gdd5-rnh7
apa: Meadowcroft, B., Sorichetti, V., Ratajczyk, E., Perez Verdugo, F. L., Khalilgharibi,
N., Mao, Y., … Šarić, A. (2025). Nonequilibrium remodeling of collagen IV networks
in Silico. PRX Life. American Physical Society. https://doi.org/10.1103/gdd5-rnh7
chicago: Meadowcroft, Billie, Valerio Sorichetti, Eryk Ratajczyk, Fernanda L Perez
Verdugo, Nargess Khalilgharibi, Yanlan Mao, Ivan Palaia, and Anđela Šarić. “Nonequilibrium
Remodeling of Collagen IV Networks in Silico.” PRX Life. American Physical
Society, 2025. https://doi.org/10.1103/gdd5-rnh7.
ieee: B. Meadowcroft et al., “Nonequilibrium remodeling of collagen IV networks
in Silico,” PRX Life, vol. 3. American Physical Society, 2025.
ista: Meadowcroft B, Sorichetti V, Ratajczyk E, Perez Verdugo FL, Khalilgharibi
N, Mao Y, Palaia I, Šarić A. 2025. Nonequilibrium remodeling of collagen IV networks
in Silico. PRX Life. 3, 033019.
mla: Meadowcroft, Billie, et al. “Nonequilibrium Remodeling of Collagen IV Networks
in Silico.” PRX Life, vol. 3, 033019, American Physical Society, 2025,
doi:10.1103/gdd5-rnh7.
short: B. Meadowcroft, V. Sorichetti, E. Ratajczyk, F.L. Perez Verdugo, N. Khalilgharibi,
Y. Mao, I. Palaia, A. Šarić, PRX Life 3 (2025).
corr_author: '1'
date_created: 2026-02-16T15:55:03Z
date_published: 2025-09-05T00:00:00Z
date_updated: 2026-02-17T13:37:38Z
day: '05'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.1103/gdd5-rnh7
ec_funded: 1
file:
- access_level: open_access
checksum: 04cae5231d97e533145c493880fadbd9
content_type: application/pdf
creator: dernst
date_created: 2026-02-17T13:36:01Z
date_updated: 2026-02-17T13:36:01Z
file_id: '21308'
file_name: 2025_PRXLife_Meadowcroft.pdf
file_size: 2277704
relation: main_file
success: 1
file_date_updated: 2026-02-17T13:36:01Z
has_accepted_license: '1'
intvolume: ' 3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: eba2549b-77a9-11ec-83b8-a81e493eae4e
call_identifier: H2020
grant_number: '802960'
name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines'
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 349b6ff1-11ca-11ed-8bc3-f006047c2eeb
name: EMBO Young Investigator Program - Andela Saric
publication: PRX Life
publication_identifier:
eissn:
- 2835-8279
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: Nonequilibrium remodeling of collagen IV networks in Silico
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: 3
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21257'
abstract:
- lang: eng
text: 'We investigate the problem of accurate sparse fine-tuning of large language
models (LLMs), that is, fine-tuning pre-trained LLMs on specialized tasks, while
inducing sparsity in their weights. Our work is motivated by experiments showing
that standard loss-based fine-tuning methods are not able to achieve high accuracy
in this setting, especially at high sparsity targets. To address this issue, we
perform a detailed study of knowledge distillation losses for fine-tuning of sparse
models. We determine an L2-based distillation approach that we term ‘SquareHead’,
which enables accurate recovery even at higher sparsities. Investigating the question
of efficient inference, we show that sparse LLMs can be executed faster by taking
advantage of sparsity. Specifically, we exhibit end-to-end results showing speedups
enabled by sparsity, while recovering accuracy, on the following models and tasks,
respectively: T5 for language translation, Whisper for speech translation, and
open GPT-type models such as the Mosaic Pre-Trained Transformer (MPT) and Llama-2
models for text generation. In particular, for popular generative tasks, we show
for the first time that sparse fine-tuning can reach 75% sparsity without drops
in accuracy, and provide notable end-to-end speedups for inference on CPUs. Moreover,
we also highlight that sparsity is compatible with other compression approaches,
such as quantization.'
acknowledgement: We would like to thank Eugenia Iofinova for useful comments on an
earlier version of this draft, and Artur Niederfahrenhorst for useful suggestions
regarding fine-tuning on the GSM8k dataset.
alternative_title:
- 'Machine Translation: Technologies and Applications'
article_processing_charge: No
arxiv: 1
author:
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Denis
full_name: Kuznedelev, Denis
last_name: Kuznedelev
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Michael
full_name: Goinv, Michael
last_name: Goinv
- first_name: Shubhra
full_name: Pandit, Shubhra
last_name: Pandit
- first_name: Abhinav
full_name: Agarwalla, Abhinav
last_name: Agarwalla
- first_name: Tuan
full_name: Nguyen, Tuan
last_name: Nguyen
- first_name: Alexandre
full_name: Marques, Alexandre
last_name: Marques
- first_name: Mark
full_name: Kurtz, Mark
last_name: Kurtz
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Kurtic E, Kuznedelev D, Frantar E, et al. Sparse Fine-Tuning for Inference
Acceleration of Large Language Models. In: Passban P, Way A, Rezagholizadeh M,
eds. Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques.
Springer Nature; 2025:83-97. doi:10.1007/978-3-031-85747-8_6'
apa: Kurtic, E., Kuznedelev, D., Frantar, E., Goinv, M., Pandit, S., Agarwalla,
A., … Alistarh, D.-A. (2025). Sparse Fine-Tuning for Inference Acceleration of
Large Language Models. In P. Passban, A. Way, & M. Rezagholizadeh (Eds.),
Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques
(pp. 83–97). Springer Nature. https://doi.org/10.1007/978-3-031-85747-8_6
chicago: Kurtic, Eldar, Denis Kuznedelev, Elias Frantar, Michael Goinv, Shubhra
Pandit, Abhinav Agarwalla, Tuan Nguyen, Alexandre Marques, Mark Kurtz, and Dan-Adrian
Alistarh. “Sparse Fine-Tuning for Inference Acceleration of Large Language Models.”
In Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques,
edited by Peyman Passban, Andy Way, and Mehdi Rezagholizadeh, 83–97. Springer
Nature, 2025. https://doi.org/10.1007/978-3-031-85747-8_6.
ieee: E. Kurtic et al., “Sparse Fine-Tuning for Inference Acceleration of
Large Language Models,” in Enhancing LLM Performance. Efficacy, Fine-Tuning,
and Inference Techniques, P. Passban, A. Way, and M. Rezagholizadeh, Eds.
Springer Nature, 2025, pp. 83–97.
ista: 'Kurtic E, Kuznedelev D, Frantar E, Goinv M, Pandit S, Agarwalla A, Nguyen
T, Marques A, Kurtz M, Alistarh D-A. 2025.Sparse Fine-Tuning for Inference Acceleration
of Large Language Models. In: Enhancing LLM Performance. Efficacy, Fine-Tuning,
and Inference Techniques. Machine Translation: Technologies and Applications,
, 83–97.'
mla: Kurtic, Eldar, et al. “Sparse Fine-Tuning for Inference Acceleration of Large
Language Models.” Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference
Techniques, edited by Peyman Passban et al., Springer Nature, 2025, pp. 83–97,
doi:10.1007/978-3-031-85747-8_6.
short: E. Kurtic, D. Kuznedelev, E. Frantar, M. Goinv, S. Pandit, A. Agarwalla,
T. Nguyen, A. Marques, M. Kurtz, D.-A. Alistarh, in:, P. Passban, A. Way, M. Rezagholizadeh
(Eds.), Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques,
Springer Nature, 2025, pp. 83–97.
corr_author: '1'
date_created: 2026-02-16T15:57:53Z
date_published: 2025-07-05T00:00:00Z
date_updated: 2026-02-19T09:26:54Z
day: '05'
department:
- _id: DaAl
- _id: GradSch
doi: 10.1007/978-3-031-85747-8_6
editor:
- first_name: Peyman
full_name: Passban, Peyman
last_name: Passban
- first_name: Andy
full_name: Way, Andy
last_name: Way
- first_name: Mehdi
full_name: Rezagholizadeh, Mehdi
last_name: Rezagholizadeh
external_id:
arxiv:
- '2310.06927'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.06927
month: '07'
oa: 1
oa_version: Preprint
page: 83-97
publication: Enhancing LLM Performance. Efficacy, Fine-Tuning, and Inference Techniques
publication_identifier:
eisbn:
- '9783031857478'
eissn:
- 2522-803X
isbn:
- '9783031857461'
issn:
- 2522-8021
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: Sparse Fine-Tuning for Inference Acceleration of Large Language Models
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '21260'
abstract:
- lang: eng
text: We prove that there does not exist F∈Q[x,y] of degree 4 such that F(Z^2 )=Z
≥0. In particular, this answers a question by John S. Lew and Bjorn Poonen for
quartic polynomials.
acknowledgement: "The first author would like to thank Samir Siksek for introducing
the problem\r\nto him. The material in Section 6 is a result of discussing with
many people, and the second author is very grateful to Tim Browning, Stephanie Chan,
Jakob Glas, Jakub Löwit, Mirko Mauri, Marta Pieropan, Mike Roth, Matteo Verzobio
and Victor Wang for taking the time to answer his questions and for their valuable
suggestions. We thank Tim Browning, Yijie Diao, Ana Marija Vego and the anonymous
referee for their helpful comments.\r\nThe first author was supported by NSERC Discovery
Grant RGPIN-2024-06810. The\r\nsecond author was supported by the NWO Veni Grant
016.Veni.192.047 during his time at\r\nUtrecht University and by a FWF grant (DOI
10.55776/P32428) at the Institute of Science and\r\nTechnology Austria while working
on this paper."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Stanley
full_name: Yao Xiao, Stanley
last_name: Yao Xiao
- first_name: Shuntaro
full_name: Yamagishi, Shuntaro
id: 0c3fbc5c-f7a6-11ec-8d70-9485e75b416b
last_name: Yamagishi
citation:
ama: Yao Xiao S, Yamagishi S. Quartic polynomials in two variables do not represent
all non-negative integers. Journal of the European Mathematical Society.
2025. doi:10.4171/jems/1697
apa: Yao Xiao, S., & Yamagishi, S. (2025). Quartic polynomials in two variables
do not represent all non-negative integers. Journal of the European Mathematical
Society. EMS Press. https://doi.org/10.4171/jems/1697
chicago: Yao Xiao, Stanley, and Shuntaro Yamagishi. “Quartic Polynomials in Two
Variables Do Not Represent All Non-Negative Integers.” Journal of the European
Mathematical Society. EMS Press, 2025. https://doi.org/10.4171/jems/1697.
ieee: S. Yao Xiao and S. Yamagishi, “Quartic polynomials in two variables do not
represent all non-negative integers,” Journal of the European Mathematical
Society. EMS Press, 2025.
ista: Yao Xiao S, Yamagishi S. 2025. Quartic polynomials in two variables do not
represent all non-negative integers. Journal of the European Mathematical Society.
mla: Yao Xiao, Stanley, and Shuntaro Yamagishi. “Quartic Polynomials in Two Variables
Do Not Represent All Non-Negative Integers.” Journal of the European Mathematical
Society, EMS Press, 2025, doi:10.4171/jems/1697.
short: S. Yao Xiao, S. Yamagishi, Journal of the European Mathematical Society (2025).
corr_author: '1'
date_created: 2026-02-16T16:00:02Z
date_published: 2025-08-06T00:00:00Z
date_updated: 2026-02-19T09:25:12Z
day: '06'
department:
- _id: TiBr
doi: 10.4171/jems/1697
external_id:
arxiv:
- '2307.05712'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4171/JEMS/1697
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: 26AEDAB2-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P32428
name: New frontiers of the Manin conjecture
publication: Journal of the European Mathematical Society
publication_identifier:
eissn:
- 1435-9863
issn:
- 1435-9855
publication_status: epub_ahead
publisher: EMS Press
quality_controlled: '1'
status: public
title: Quartic polynomials in two variables do not represent all non-negative integers
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21262'
abstract:
- lang: eng
text: "Continuous Group Key Agreement (CGKA) is the primitive underlying secure
group messaging. It allows a large group of N users to maintain a shared secret
key that is frequently rotated by the\r\ngroup members in order to achieve forward
secrecy and post compromise security. The group messaging scheme Messaging Layer
Security (MLS) standardized by the IETF makes use of a CGKA called TreeKEM which
arranges the N group members in a binary tree. Here, each node is associated with
a public-key, each user is assigned one of the leaves, and a user knows the corresponding
secret keys from their leaf to the root. To update the key material known to them,
a user must just replace keys at log(N) nodes, which requires them to create and
upload log(N) ciphertexts. Such updates must be processed sequentially by all
users, which for large groups is impractical. To allow for concurrent updates,
TreeKEM uses the “propose and commit” paradigm, where multiple users can concurrently
propose to update (by just sampling a fresh leaf key), and a single user can then
commit to all proposals at once. Unfortunately, this process destroys the binary
tree structure as the tree gets pruned and some nodes must be “blanked” at the
cost of increasing the in-degree of others, which makes the commit operation,
as well as, future commits more costly. In the worst case, the update cost (in
terms of uploaded ciphertexts) per user can grow from log(N) to Ω(N). In this
work we provide two main contributions. First, we show that MLS’ communication
complexity is bad not only in the worst case but also if the proposers and committers
are chosen at random: even if there’s just one update proposal for every commit
the expected cost is already over √N, and it approaches N as this ratio changes
towards more proposals. Our second contribution is a new variant of propose and
commit for\r\nTreeKEM which for moderate amounts of update proposals per commit
provably achieves an update cost of Θ(log(N)) assuming the proposers and committers
are chosen at random."
acknowledgement: B. Auerbach and B. Erol—Conducted part of this work at ISTA.
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
orcid: 0000-0002-2505-4246
- first_name: Boran
full_name: Erol, Boran
last_name: Erol
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Auerbach B, Cueto Noval M, Erol B, Pietrzak KZ. Continuous group-key agreement:
Concurrent updates without pruning. In: 45th Annual International Cryptology
Conference. Vol 16007. Springer Nature; 2025:141-172. doi:10.1007/978-3-032-01913-4_5'
apa: 'Auerbach, B., Cueto Noval, M., Erol, B., & Pietrzak, K. Z. (2025). Continuous
group-key agreement: Concurrent updates without pruning. In 45th Annual International
Cryptology Conference (Vol. 16007, pp. 141–172). Santa Barbara, CA, United
States: Springer Nature. https://doi.org/10.1007/978-3-032-01913-4_5'
chicago: 'Auerbach, Benedikt, Miguel Cueto Noval, Boran Erol, and Krzysztof Z Pietrzak.
“Continuous Group-Key Agreement: Concurrent Updates without Pruning.” In 45th
Annual International Cryptology Conference, 16007:141–72. Springer Nature,
2025. https://doi.org/10.1007/978-3-032-01913-4_5.'
ieee: 'B. Auerbach, M. Cueto Noval, B. Erol, and K. Z. Pietrzak, “Continuous group-key
agreement: Concurrent updates without pruning,” in 45th Annual International
Cryptology Conference, Santa Barbara, CA, United States, 2025, vol. 16007,
pp. 141–172.'
ista: 'Auerbach B, Cueto Noval M, Erol B, Pietrzak KZ. 2025. Continuous group-key
agreement: Concurrent updates without pruning. 45th Annual International Cryptology
Conference. CRYPTO: International Cryptology Conference, LNCS, vol. 16007, 141–172.'
mla: 'Auerbach, Benedikt, et al. “Continuous Group-Key Agreement: Concurrent Updates
without Pruning.” 45th Annual International Cryptology Conference, vol.
16007, Springer Nature, 2025, pp. 141–72, doi:10.1007/978-3-032-01913-4_5.'
short: B. Auerbach, M. Cueto Noval, B. Erol, K.Z. Pietrzak, in:, 45th Annual International
Cryptology Conference, Springer Nature, 2025, pp. 141–172.
conference:
end_date: 2025-08-21
location: Santa Barbara, CA, United States
name: 'CRYPTO: International Cryptology Conference'
start_date: 2025-08-17
date_created: 2026-02-17T07:41:04Z
date_published: 2025-08-17T00:00:00Z
date_updated: 2026-02-18T07:36:42Z
day: '17'
department:
- _id: KrPi
doi: 10.1007/978-3-032-01913-4_5
intvolume: ' 16007'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2025/1035
month: '08'
oa: 1
oa_version: Preprint
page: 141-172
publication: 45th Annual International Cryptology Conference
publication_identifier:
eisbn:
- '9783032019134'
eissn:
- 1611-3349
isbn:
- '9783032019127'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
status: public
title: 'Continuous group-key agreement: Concurrent updates without pruning'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16007
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: diamond
PlanS_conform: '1'
_id: '21263'
abstract:
- lang: eng
text: Two landmark results in combinatorial random matrix theory, due to Komlós
and Costello–Tao–Vu, show that discrete random matrices and symmetric discrete
random matrices are typically nonsingular. In particular, in the language of graph
theory, when p is a fixed constant, the biadjacency matrix of a random Erdős–Rényi
bipartite graph G(n,n,p) and the adjacency matrix of an Erdős–Rényi random graph
G(n,p) are both nonsingular with high probability. However, very sparse random
graphs (i.e., where p is allowed to decay rapidly with n) are typically singular,
due to the presence of “local” dependencies such as isolated vertices and pairs
of degree-1 vertices with the same neighbour. In this paper, we give a combinatorial
description of the rank of a sparse random graph G(n,n,c/n) or G(n,c/n) in terms
of such local dependencies, for all constants c=e (and we present some evidence
that the situation is very different for c=e). This gives an essentially complete
answer to a question raised by Vu (2014). As applications of our main theorem
and its proof, we also determine the asymptotic singularity probability of the
2-core of a sparse random graph, we show that the rank of a sparse random graph
is extremely well approximated by its matching number, and we deduce a central
limit theorem for the rank of G(n,c/n).
acknowledgement: "We would like to thank Noga Alon for suggesting that our main result
gives\r\na linear-time algorithm for computing the rank. We also thank the referees
for a number of thoughtful comments and suggestions. Glasgow was supported by NSF
graduate research fellowship program award DGE1656518. Kwan was supported by ERC
Starting Grant “RANDSTRUCT” No. 101076777. Sah and Sawhney were supported by NSF
Graduate Research Fellowship Program DGE-1745302.\r\n"
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Margalit
full_name: Glasgow, Margalit
last_name: Glasgow
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Glasgow M, Kwan MA, Sah A, Sawhney M. The exact rank of sparse random graphs.
Journal of the European Mathematical Society. 2025. doi:10.4171/jems/1692
apa: Glasgow, M., Kwan, M. A., Sah, A., & Sawhney, M. (2025). The exact rank
of sparse random graphs. Journal of the European Mathematical Society.
European Mathematical Society Press. https://doi.org/10.4171/jems/1692
chicago: Glasgow, Margalit, Matthew Alan Kwan, Ashwin Sah, and Mehtaab Sawhney.
“The Exact Rank of Sparse Random Graphs.” Journal of the European Mathematical
Society. European Mathematical Society Press, 2025. https://doi.org/10.4171/jems/1692.
ieee: M. Glasgow, M. A. Kwan, A. Sah, and M. Sawhney, “The exact rank of sparse
random graphs,” Journal of the European Mathematical Society. European
Mathematical Society Press, 2025.
ista: Glasgow M, Kwan MA, Sah A, Sawhney M. 2025. The exact rank of sparse random
graphs. Journal of the European Mathematical Society.
mla: Glasgow, Margalit, et al. “The Exact Rank of Sparse Random Graphs.” Journal
of the European Mathematical Society, European Mathematical Society Press,
2025, doi:10.4171/jems/1692.
short: M. Glasgow, M.A. Kwan, A. Sah, M. Sawhney, Journal of the European Mathematical
Society (2025).
corr_author: '1'
date_created: 2026-02-17T07:41:59Z
date_published: 2025-09-02T00:00:00Z
date_updated: 2026-02-23T10:44:41Z
day: '02'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.4171/jems/1692
external_id:
arxiv:
- '2303.05435'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4171/JEMS/1692
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Journal of the European Mathematical Society
publication_identifier:
eissn:
- 1435-9863
issn:
- 1435-9855
publication_status: epub_ahead
publisher: European Mathematical Society Press
quality_controlled: '1'
status: public
title: The exact rank of sparse random graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '21264'
abstract:
- lang: eng
text: Rodents' ability to encode the whisking phase has been extensively documented
through neuronal recordings from ascending sensory pathways. Yet, while indicating
that reafference originates from the mechanoreceptors, the mechanistic underpinnings
of the whisking phase encoding within the follicle remain unclear. Here we present
anatomical, histological, and biomechanical evidence for the presence of a distinctive
elastic segment (ES) within the basal part of the whisker shaft inside the follicle.
This ES, composed of immature keratin, is capable of both bending and twisting.
Forces generated by whisker movement deform this segment, causing whisker shaft
deflections that can stimulate specific mechanoreceptor subsets within the follicle
at different phases of the whisking cycle. This mechanism appears to operate during
both free‐air whisking and object contact. We propose that the ES enables torsion‐based
mechanoreceptor activation, allowing encoding of the whisking phase.
acknowledgement: The authors wish to express their gratitude to Prof. Menahem Segal
and Dr. Yonatan Katz for their helpful comments and discussions. The United States-Israel
Binational Science Foundation (BSF, grant no. 2021327); The European Research Council
(ERC) under the EU Horizon 2020 Research and Innovation Programme (grant no. 786949);
the Israel Science Foundation (ISF, grant no. 2237/20); The Weizmann-UK Collaboration
and a research grant from the Estate of Thomas Gruen.
article_number: ar.70051
article_processing_charge: No
article_type: original
author:
- first_name: Sebastian
full_name: Haidarliu, Sebastian
last_name: Haidarliu
- first_name: Guy
full_name: Nelinger, Guy
last_name: Nelinger
- first_name: Luka
full_name: Gantar, Luka
id: ed7c4564-13aa-11f0-9846-960f9afb2ddb
last_name: Gantar
- first_name: Ehud
full_name: Ahissar, Ehud
last_name: Ahissar
- first_name: Inbar
full_name: Saraf‐Sinik, Inbar
last_name: Saraf‐Sinik
citation:
ama: Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. An elastic segment
of the whisker shaft enables coding of the whisking phase via whisker torsion
in rats and mice. The Anatomical Record. 2025. doi:10.1002/ar.70051
apa: Haidarliu, S., Nelinger, G., Gantar, L., Ahissar, E., & Saraf‐Sinik, I.
(2025). An elastic segment of the whisker shaft enables coding of the whisking
phase via whisker torsion in rats and mice. The Anatomical Record. Wiley.
https://doi.org/10.1002/ar.70051
chicago: Haidarliu, Sebastian, Guy Nelinger, Luka Gantar, Ehud Ahissar, and Inbar
Saraf‐Sinik. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking
Phase via Whisker Torsion in Rats and Mice.” The Anatomical Record. Wiley,
2025. https://doi.org/10.1002/ar.70051.
ieee: S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, and I. Saraf‐Sinik, “An
elastic segment of the whisker shaft enables coding of the whisking phase via
whisker torsion in rats and mice,” The Anatomical Record. Wiley, 2025.
ista: Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. 2025. An elastic
segment of the whisker shaft enables coding of the whisking phase via whisker
torsion in rats and mice. The Anatomical Record., ar. 70051.
mla: Haidarliu, Sebastian, et al. “An Elastic Segment of the Whisker Shaft Enables
Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” The Anatomical
Record, ar. 70051, Wiley, 2025, doi:10.1002/ar.70051.
short: S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, I. Saraf‐Sinik, The Anatomical
Record (2025).
date_created: 2026-02-17T07:44:23Z
date_published: 2025-09-09T00:00:00Z
date_updated: 2026-02-23T10:50:27Z
day: '09'
ddc:
- '570'
department:
- _id: MaJö
doi: 10.1002/ar.70051
external_id:
pmid:
- '40923214'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/ar.70051
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: The Anatomical Record
publication_identifier:
eissn:
- 1932-8494
issn:
- 1932-8486
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: An elastic segment of the whisker shaft enables coding of the whisking phase
via whisker torsion in rats and mice
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: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21265'
abstract:
- lang: eng
text: We explain how the (shifted) Ratios Conjecture for $L(s,\chi )$ would extend
a randomization argument of Harper from a conductor-limited range to an unlimited
range of “beyond square-root cancellation” for character twists of the Liouville
function. As a corollary, the Liouville function would have nontrivial cancellation
in arithmetic progressions of modulus just exceeding the well-known square-root
barrier. Morally, the paper passes from random matrices to random multiplicative
functions.
acknowledgement: The first author is supported by the European Union’s Horizon 2020
research and innovation program under the Marie Skłodowska-Curie Grant Agreement
No. 101034413. The second author is supported by a Simons Junior Fellowship from
Simons Foundation. We thank Paul Bourgade and Kannan Soundararajan for discussions
on random matrices and probability, Alexandra Florea for helpful comments on the
Ratios Conjecture, and Joni Teräväinen for providing several references. We are
also grateful to Alexandra Florea, Adam Harper, Joni Teräväinen, and the referee
for helpful comments on earlier drafts.
article_number: rnaf279
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Victor
full_name: Wang, Victor
id: 76096395-aea4-11ed-a680-ab8ebbd3f1b9
last_name: Wang
orcid: 0000-0002-0704-7026
- first_name: Max Wenqiang
full_name: Xu, Max Wenqiang
last_name: Xu
citation:
ama: Wang V, Xu MW. Harper’s beyond square-root conjecture. International Mathematics
Research Notices. 2025;2025(18). doi:10.1093/imrn/rnaf279
apa: Wang, V., & Xu, M. W. (2025). Harper’s beyond square-root conjecture. International
Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnaf279
chicago: Wang, Victor, and Max Wenqiang Xu. “Harper’s beyond Square-Root Conjecture.”
International Mathematics Research Notices. Oxford University Press, 2025.
https://doi.org/10.1093/imrn/rnaf279.
ieee: V. Wang and M. W. Xu, “Harper’s beyond square-root conjecture,” International
Mathematics Research Notices, vol. 2025, no. 18. Oxford University Press,
2025.
ista: Wang V, Xu MW. 2025. Harper’s beyond square-root conjecture. International
Mathematics Research Notices. 2025(18), rnaf279.
mla: Wang, Victor, and Max Wenqiang Xu. “Harper’s beyond Square-Root Conjecture.”
International Mathematics Research Notices, vol. 2025, no. 18, rnaf279,
Oxford University Press, 2025, doi:10.1093/imrn/rnaf279.
short: V. Wang, M.W. Xu, International Mathematics Research Notices 2025 (2025).
date_created: 2026-02-17T07:45:45Z
date_published: 2025-09-01T00:00:00Z
date_updated: 2026-02-18T07:41:56Z
day: '01'
department:
- _id: TiBr
doi: 10.1093/imrn/rnaf279
ec_funded: 1
external_id:
arxiv:
- '2405.04094'
intvolume: ' 2025'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.04094
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Harper’s beyond square-root conjecture
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2025
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: diamond
_id: '21266'
abstract:
- lang: eng
text: "For a given elliptic curve E in short Weierstrass form, we show that almost
all quadratic twists E \r\nD have no integral points, as D ranges over square-free
integers ordered by size. Our result is conditional on a weak form of the Hall–Lang
conjecture in the case that E has partial 2-torsion. The proof uses a correspondence
of Mordell and the reduction theory of binary quartic forms in order to transfer
the problem to counting rational points of bounded height on a certain singular
cubic surface, together with extensive use of cancellation in character sum estimates,
drawn from Heath-Brown’s analysis of Selmer group statistics for the congruent
number curve."
acknowledgement: The authors are grateful to Roger Heath-Brown and to the anonymous
referees for useful comments. The first author was supported by an FWF grant (DOI
10.55776/P36278).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
- first_name: Yik Tung
full_name: Chan, Yik Tung
id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
last_name: Chan
orcid: 0000-0001-8467-4106
citation:
ama: Browning TD, Chan S. Almost all quadratic twists of an elliptic curve have
no integral points. Journal of the European Mathematical Society. 2025.
doi:10.4171/jems/1704
apa: Browning, T. D., & Chan, S. (2025). Almost all quadratic twists of an elliptic
curve have no integral points. Journal of the European Mathematical Society.
European Mathematical Society Press. https://doi.org/10.4171/jems/1704
chicago: Browning, Timothy D, and Stephanie Chan. “Almost All Quadratic Twists of
an Elliptic Curve Have No Integral Points.” Journal of the European Mathematical
Society. European Mathematical Society Press, 2025. https://doi.org/10.4171/jems/1704.
ieee: T. D. Browning and S. Chan, “Almost all quadratic twists of an elliptic curve
have no integral points,” Journal of the European Mathematical Society.
European Mathematical Society Press, 2025.
ista: Browning TD, Chan S. 2025. Almost all quadratic twists of an elliptic curve
have no integral points. Journal of the European Mathematical Society.
mla: Browning, Timothy D., and Stephanie Chan. “Almost All Quadratic Twists of an
Elliptic Curve Have No Integral Points.” Journal of the European Mathematical
Society, European Mathematical Society Press, 2025, doi:10.4171/jems/1704.
short: T.D. Browning, S. Chan, Journal of the European Mathematical Society (2025).
corr_author: '1'
date_created: 2026-02-17T07:46:26Z
date_published: 2025-09-17T00:00:00Z
date_updated: 2026-02-23T10:54:40Z
day: '17'
department:
- _id: TiBr
doi: 10.4171/jems/1704
external_id:
arxiv:
- '2401.04375'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4171/JEMS/1704
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bd8a4fdc-d553-11ed-ba76-80a0167441a3
grant_number: P36278
name: Rational curves via function field analytic number theory
publication: Journal of the European Mathematical Society
publication_identifier:
eissn:
- 1435-9863
issn:
- 1435-9855
publication_status: epub_ahead
publisher: European Mathematical Society Press
quality_controlled: '1'
status: public
title: Almost all quadratic twists of an elliptic curve have no integral points
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '21268'
abstract:
- lang: eng
text: "We consider multiple-environment Markov decision processes (MEMDP), which
consist of a finite set of MDPs over the same state space, representing different
scenarios of transition structure and probability. The value of a strategy is
the probability to satisfy the objective, here a parity objective, in the worst-case
scenario, and the value of an MEMDP is the supremum of the values achievable by
a strategy.\r\nWe show that deciding whether the value is 1 is a PSPACE-complete
problem, and even in P when the number of environments is fixed, along with new
insights to the almost-sure winning problem, which is to decide if there exists
a strategy with value 1. Pure strategies are sufficient for theses problems, whereas
randomization is necessary in general when the value is smaller than 1. We present
an algorithm to approximate the value, running in double exponential space. Our
results are in contrast to the related model of partially-observable MDPs where
all these problems are known to be undecidable."
acknowledgement: "Krishnendu Chatterjee: ERC CoG 863818 (ForM-SMArt) and Austrian
Science Fund\r\n(FWF) 10.55776/COE12. Jean-François Raskin: PDR Weave project FORM-LEARN-POMDP
funded by FNRS and DFG, and the support of the Fondation ULB. Ocan Sankur: ANR BisoUS
(ANR-22-CE48-0012) and ANR EpiRL (ANR-22-CE23-0029)."
alternative_title:
- LIPIcs
article_number: '150'
article_processing_charge: No
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Laurent
full_name: Doyen, Laurent
last_name: Doyen
- first_name: Jean-Francois
full_name: Raskin, Jean-Francois
last_name: Raskin
- first_name: Ocan
full_name: Sankur, Ocan
last_name: Sankur
citation:
ama: 'Chatterjee K, Doyen L, Raskin J-F, Sankur O. The value problem for multiple-environment
MDPs with parity objective. In: 52nd International Colloquium on Automata,
Languages, and Programming. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2025. doi:10.4230/LIPIcs.ICALP.2025.150'
apa: 'Chatterjee, K., Doyen, L., Raskin, J.-F., & Sankur, O. (2025). The value
problem for multiple-environment MDPs with parity objective. In 52nd International
Colloquium on Automata, Languages, and Programming. Aarhus, Denmark: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ICALP.2025.150'
chicago: Chatterjee, Krishnendu, Laurent Doyen, Jean-Francois Raskin, and Ocan Sankur.
“The Value Problem for Multiple-Environment MDPs with Parity Objective.” In 52nd
International Colloquium on Automata, Languages, and Programming. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ICALP.2025.150.
ieee: K. Chatterjee, L. Doyen, J.-F. Raskin, and O. Sankur, “The value problem for
multiple-environment MDPs with parity objective,” in 52nd International Colloquium
on Automata, Languages, and Programming, Aarhus, Denmark, 2025.
ista: 'Chatterjee K, Doyen L, Raskin J-F, Sankur O. 2025. The value problem for
multiple-environment MDPs with parity objective. 52nd International Colloquium
on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming,
LIPIcs, , 150.'
mla: Chatterjee, Krishnendu, et al. “The Value Problem for Multiple-Environment
MDPs with Parity Objective.” 52nd International Colloquium on Automata, Languages,
and Programming, 150, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025,
doi:10.4230/LIPIcs.ICALP.2025.150.
short: K. Chatterjee, L. Doyen, J.-F. Raskin, O. Sankur, in:, 52nd International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025.
conference:
end_date: 2025-07-11
location: Aarhus, Denmark
name: 'ICALP: Automata, Languages and Programming'
start_date: 2025-07-08
corr_author: '1'
date_created: 2026-02-17T07:49:17Z
date_published: 2025-07-30T00:00:00Z
date_updated: 2026-02-18T07:53:26Z
day: '30'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.4230/LIPIcs.ICALP.2025.150
ec_funded: 1
external_id:
arxiv:
- '2504.15960'
file:
- access_level: open_access
checksum: 4477a7fd4fbf0ba6c8e9b15683b5a6b8
content_type: application/pdf
creator: dernst
date_created: 2026-02-18T07:50:56Z
date_updated: 2026-02-18T07:50:56Z
file_id: '21313'
file_name: 2025_LIPIcs_Chatterjee.pdf
file_size: 1075724
relation: main_file
success: 1
file_date_updated: 2026-02-18T07:50:56Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 52nd International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- '9783959773720'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: The value problem for multiple-environment MDPs with parity objective
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: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21269'
abstract:
- lang: eng
text: The spatial organization of chromatin within the nucleus plays a crucial role
in gene expression and genome function. However, the quantitative relationship
between this organization and nuclear biochemical processes remains under debate.
In this study, we present a graph-based generative model, bioSBM, designed to
capture long-range chromatin interaction patterns from Hi-C data and, importantly,
simultaneously link these patterns to biochemical features. Applying bioSBM to
Hi-C maps of the GM12878 lymphoblastoid cell line, we identified a latent structure
of chromatin interactions, revealing seven distinct communities that strongly
align with known biological annotations. Additionally, we infer a linear transformation
that maps biochemical observables, such as histone marks, to the parameters of
the generative graph model, enabling accurate genome-wide predictions of chromatin
contact maps on out-of-sample data, both within the same cell line and on the
completely unseen HCT116 cell line under RAD21 depletion. These findings highlight
bioSBM's potential as a powerful tool for elucidating the relationship between
biochemistry and chromatin architecture and predicting long-range genome organization
from independent biochemical data.
acknowledgement: G.S. acknowledges co-funding from Next Generation EU, in the context
of the National Recovery and Resilience Plan, Investment PE1 - Project FAIR “Future
Artificial Intelligence Research”. This resource was co-financed by the Next Generation
EU [DM 1555 del 11.10.22]. A.R. acknowledges financial support from PNRR Grant CN
00000013 CN-HPC, M4C2I1.4, spoke 7, funded by Next Generation EU.
article_number: '043006'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Chen Y
full_name: Zhang, Chen Y
id: 81b43fb8-c9d5-11ef-bf68-ade532a1f204
last_name: Zhang
- first_name: Angelo
full_name: Rosa, Angelo
last_name: Rosa
- first_name: Guido
full_name: Sanguinetti, Guido
last_name: Sanguinetti
citation:
ama: 'Zhang CY, Rosa A, Sanguinetti G. bioSBM: A random graph model to integrate
epigenomic data in chromatin structure prediction. PRX Life. 2025;3(4).
doi:10.1103/gy1p-4256'
apa: 'Zhang, C. Y., Rosa, A., & Sanguinetti, G. (2025). bioSBM: A random graph
model to integrate epigenomic data in chromatin structure prediction. PRX Life.
American Physical Society. https://doi.org/10.1103/gy1p-4256'
chicago: 'Zhang, Chen Y, Angelo Rosa, and Guido Sanguinetti. “BioSBM: A Random Graph
Model to Integrate Epigenomic Data in Chromatin Structure Prediction.” PRX
Life. American Physical Society, 2025. https://doi.org/10.1103/gy1p-4256.'
ieee: 'C. Y. Zhang, A. Rosa, and G. Sanguinetti, “bioSBM: A random graph model to
integrate epigenomic data in chromatin structure prediction,” PRX Life,
vol. 3, no. 4. American Physical Society, 2025.'
ista: 'Zhang CY, Rosa A, Sanguinetti G. 2025. bioSBM: A random graph model to integrate
epigenomic data in chromatin structure prediction. PRX Life. 3(4), 043006.'
mla: 'Zhang, Chen Y., et al. “BioSBM: A Random Graph Model to Integrate Epigenomic
Data in Chromatin Structure Prediction.” PRX Life, vol. 3, no. 4, 043006,
American Physical Society, 2025, doi:10.1103/gy1p-4256.'
short: C.Y. Zhang, A. Rosa, G. Sanguinetti, PRX Life 3 (2025).
corr_author: '1'
date_created: 2026-02-17T07:53:01Z
date_published: 2025-10-21T00:00:00Z
date_updated: 2026-02-18T08:01:00Z
day: '21'
ddc:
- '570'
department:
- _id: GaTk
doi: 10.1103/gy1p-4256
external_id:
arxiv:
- '2409.14425'
file:
- access_level: open_access
checksum: 76ddfee3efdb4c9d085059b5a142ed78
content_type: application/pdf
creator: dernst
date_created: 2026-02-18T07:57:39Z
date_updated: 2026-02-18T07:57:39Z
file_id: '21314'
file_name: 2025_PRXLife_Zhang.pdf
file_size: 1888053
relation: main_file
success: 1
file_date_updated: 2026-02-18T07:57:39Z
has_accepted_license: '1'
intvolume: ' 3'
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: PRX Life
publication_identifier:
issn:
- 2835-8279
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
status: public
title: 'bioSBM: A random graph model to integrate epigenomic data in chromatin structure
prediction'
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: 3
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21270'
abstract:
- lang: eng
text: "The one-dimensional Fröhlich model describing the motion of a single electron
interacting with optical phonons is a paradigmatic model of quantum many-body
physics. We predict the existence of an arbitrarily large number of bound excited
states in the strong-coupling limit and calculate their excitation energies. Numerical
simulations of a discretized model demonstrate the complete amelioration of the
projector Monte Carlo sign problem by walker annihilation in an infinite Hilbert
space. They reveal the threshold for the occurrence of the first bound excited
states at a value of \U0001D6FC≈1.73 for the dimensionless coupling constant.
This puts the threshold into the regime of intermediate interaction strength.
We find a significant spectral weight and increased phonon number of the bound
excited state at threshold."
acknowledgement: We are grateful to Dmytro Kolisnyk for his help in working out the
spectrum of the Hessian. This work was supported by the Marsden Fund of New Zealand
(Contract No. MAU2007) from government funding administered by the Royal Society
Te Apārangi and by a summer scholarship from Te Whai Ao – Dodd-Walls Centre for
Photonic and Quantum Technologies and the Physics Department, University of Auckland.
We acknowledge support by the New Zealand eScience Infrastructure (NeSI) high-performance
computing facilities in the form of a merit project allocation.
article_number: '184312'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: J.
full_name: Taylor, J.
last_name: Taylor
- first_name: M.
full_name: Čufar, M.
last_name: Čufar
- first_name: David Johannes
full_name: Mitrouskas, David Johannes
id: cbddacee-2b11-11eb-a02e-a2e14d04e52d
last_name: Mitrouskas
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
- first_name: E.
full_name: Pahl, E.
last_name: Pahl
- first_name: J.
full_name: Brand, J.
last_name: Brand
citation:
ama: Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. Bound excited
states of Fröhlich polarons in one dimension. Physical Review B. 2025;112(18).
doi:10.1103/s9p9-jflq
apa: Taylor, J., Čufar, M., Mitrouskas, D. J., Seiringer, R., Pahl, E., & Brand,
J. (2025). Bound excited states of Fröhlich polarons in one dimension. Physical
Review B. American Physical Society. https://doi.org/10.1103/s9p9-jflq
chicago: Taylor, J., M. Čufar, David Johannes Mitrouskas, Robert Seiringer, E. Pahl,
and J. Brand. “Bound Excited States of Fröhlich Polarons in One Dimension.” Physical
Review B. American Physical Society, 2025. https://doi.org/10.1103/s9p9-jflq.
ieee: J. Taylor, M. Čufar, D. J. Mitrouskas, R. Seiringer, E. Pahl, and J. Brand,
“Bound excited states of Fröhlich polarons in one dimension,” Physical Review
B, vol. 112, no. 18. American Physical Society, 2025.
ista: Taylor J, Čufar M, Mitrouskas DJ, Seiringer R, Pahl E, Brand J. 2025. Bound
excited states of Fröhlich polarons in one dimension. Physical Review B. 112(18),
184312.
mla: Taylor, J., et al. “Bound Excited States of Fröhlich Polarons in One Dimension.”
Physical Review B, vol. 112, no. 18, 184312, American Physical Society,
2025, doi:10.1103/s9p9-jflq.
short: J. Taylor, M. Čufar, D.J. Mitrouskas, R. Seiringer, E. Pahl, J. Brand, Physical
Review B 112 (2025).
date_created: 2026-02-17T07:56:20Z
date_published: 2025-11-18T00:00:00Z
date_updated: 2026-02-18T08:23:59Z
day: '18'
department:
- _id: RoSe
doi: 10.1103/s9p9-jflq
external_id:
arxiv:
- '2506.02440 '
intvolume: ' 112'
issue: '18'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.48550/arXiv.2506.02440 '
month: '11'
oa: 1
oa_version: Preprint
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bound excited states of Fröhlich polarons in one dimension
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21271'
abstract:
- lang: eng
text: For general non-Hermitian large random matrices X and deterministic deformation
matrices A, we prove that the local eigenvalue statistics of A+X close to the
typical edge points of its spectrum are universal. Furthermore, we show that,
under natural assumptions, on A the spectrum of A+X does not have outliers at
a distance larger than the natural fluctuation scale of the eigenvalues. As a
consequence, the number of eigenvalues in each component of Spec(A+X) is deterministic.
acknowledgement: The authors would like to thank the anonymous referee for providing
helpful comments and suggestions. We also thank Joscha Henheik and Volodymyr Riabov
for pointing out a gap in an earlier version of the proof of equation (3.18). The
first, third, and fourth authors are supported by ERC Advanced Grant “RMTBeyond”
No. 101020331.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Andrew J
full_name: Campbell, Andrew J
id: 582b06a9-1f1c-11ee-b076-82ffce00dde4
last_name: Campbell
- first_name: Giorgio
full_name: Cipolloni, Giorgio
id: 42198EFA-F248-11E8-B48F-1D18A9856A87
last_name: Cipolloni
orcid: 0000-0002-4901-7992
- first_name: László
full_name: Erdös, László
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Hong Chang
full_name: Ji, Hong Chang
id: dd216c0a-c1f9-11eb-beaf-e9ea9d2de76d
last_name: Ji
citation:
ama: Campbell AJ, Cipolloni G, Erdös L, Ji HC. On the spectral edge of non-Hermitian
random matrices. The Annals of Probability. 2025;53(6):2256-2308. doi:10.1214/25-aop1761
apa: Campbell, A. J., Cipolloni, G., Erdös, L., & Ji, H. C. (2025). On the spectral
edge of non-Hermitian random matrices. The Annals of Probability. Institute
of Mathematical Statistics. https://doi.org/10.1214/25-aop1761
chicago: Campbell, Andrew J, Giorgio Cipolloni, László Erdös, and Hong Chang Ji.
“On the Spectral Edge of Non-Hermitian Random Matrices.” The Annals of Probability.
Institute of Mathematical Statistics, 2025. https://doi.org/10.1214/25-aop1761.
ieee: A. J. Campbell, G. Cipolloni, L. Erdös, and H. C. Ji, “On the spectral edge
of non-Hermitian random matrices,” The Annals of Probability, vol. 53,
no. 6. Institute of Mathematical Statistics, pp. 2256–2308, 2025.
ista: Campbell AJ, Cipolloni G, Erdös L, Ji HC. 2025. On the spectral edge of non-Hermitian
random matrices. The Annals of Probability. 53(6), 2256–2308.
mla: Campbell, Andrew J., et al. “On the Spectral Edge of Non-Hermitian Random Matrices.”
The Annals of Probability, vol. 53, no. 6, Institute of Mathematical Statistics,
2025, pp. 2256–308, doi:10.1214/25-aop1761.
short: A.J. Campbell, G. Cipolloni, L. Erdös, H.C. Ji, The Annals of Probability
53 (2025) 2256–2308.
corr_author: '1'
date_created: 2026-02-17T07:58:20Z
date_published: 2025-11-01T00:00:00Z
date_updated: 2026-02-18T08:35:38Z
day: '01'
department:
- _id: LaEr
doi: 10.1214/25-aop1761
ec_funded: 1
external_id:
arxiv:
- '2404.17512'
intvolume: ' 53'
issue: '6'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2404.17512
month: '11'
oa: 1
oa_version: Preprint
page: 2256-2308
project:
- _id: 62796744-2b32-11ec-9570-940b20777f1d
call_identifier: H2020
grant_number: '101020331'
name: Random matrices beyond Wigner-Dyson-Mehta
publication: The Annals of Probability
publication_identifier:
eissn:
- 2168-894X
issn:
- 0091-1798
publication_status: published
publisher: Institute of Mathematical Statistics
quality_controlled: '1'
status: public
title: On the spectral edge of non-Hermitian random matrices
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 53
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '21272'
abstract:
- lang: eng
text: Finding the ground state of Ising spin glasses is notoriously difficult due
to disorder and frustration. Often, this challenge is framed as a combinatorial
optimization problem, for which a common strategy employs simulated annealing,
a Monte Carlo (MC)-based algorithm that updates spins one at a time. Yet, these
localized updates can cause the system to become trapped in local minima. Cluster
algorithms (CAs) were developed to address this limitation and have demonstrated
considerable success in studying ferromagnetic systems; however, they tend to
encounter percolation issues when applied to generic spin glasses. In this work,
we introduce a novel CA designed to tackle these challenges by leveraging precomputed
two-point correlations, aiming solve combinatorial optimization problems in the
form of Max-Cut more efficiently. In our approach, clusters are formed probabilistically
based on these correlations. Various classical and quantum algorithms can be employed
to generate correlations that embody information about the energy landscape of
the problem. By utilizing this information, the algorithm aims to identify groups
of spins whose simultaneous flipping induces large transitions in configuration
space with high acceptance probability - even at low energy levels - thereby escaping
local minima more effectively. Notably, clusters generated using correlations
from the Quantum Approximate Optimization Algorithm exhibit high acceptance rates
at low temperatures. These acceptance rates often increase with circuit depth,
accelerating the algorithm and enabling more efficient exploration of the solution
space.
acknowledgement: "P.J.E was partially funded by the German BMWK project QCHALLenge
(Grant No. 01MQ22008B).\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Peter J.
full_name: Eder, Peter J.
last_name: Eder
- first_name: Aron
full_name: Kerschbaumer, Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
orcid: 0009-0002-2370-8661
- first_name: Jernej Rudi
full_name: Finžgar, Jernej Rudi
last_name: Finžgar
- first_name: Raimel A
full_name: Medina Ramos, Raimel A
id: CE680B90-D85A-11E9-B684-C920E6697425
last_name: Medina Ramos
orcid: 0000-0002-5383-2869
- first_name: Martin J. A.
full_name: Schuetz, Martin J. A.
last_name: Schuetz
- first_name: Helmut G.
full_name: Katzgraber, Helmut G.
last_name: Katzgraber
- first_name: Sarah
full_name: Braun, Sarah
last_name: Braun
- first_name: Christian B.
full_name: Mendl, Christian B.
last_name: Mendl
citation:
ama: 'Eder PJ, Kerschbaumer A, Finžgar JR, et al. Quantum-guided cluster algorithms
for combinatorial optimization. In: 2025 IEEE International Conference on Quantum
Computing and Engineering. IEEE; 2025. doi:10.1109/qce65121.2025.00033'
apa: 'Eder, P. J., Kerschbaumer, A., Finžgar, J. R., Medina Ramos, R. A., Schuetz,
M. J. A., Katzgraber, H. G., … Mendl, C. B. (2025). Quantum-guided cluster algorithms
for combinatorial optimization. In 2025 IEEE International Conference on Quantum
Computing and Engineering. Albuquerque, NM, United States: IEEE. https://doi.org/10.1109/qce65121.2025.00033'
chicago: Eder, Peter J., Aron Kerschbaumer, Jernej Rudi Finžgar, Raimel A Medina
Ramos, Martin J. A. Schuetz, Helmut G. Katzgraber, Sarah Braun, and Christian
B. Mendl. “Quantum-Guided Cluster Algorithms for Combinatorial Optimization.”
In 2025 IEEE International Conference on Quantum Computing and Engineering.
IEEE, 2025. https://doi.org/10.1109/qce65121.2025.00033.
ieee: P. J. Eder et al., “Quantum-guided cluster algorithms for combinatorial
optimization,” in 2025 IEEE International Conference on Quantum Computing and
Engineering, Albuquerque, NM, United States, 2025.
ista: 'Eder PJ, Kerschbaumer A, Finžgar JR, Medina Ramos RA, Schuetz MJA, Katzgraber
HG, Braun S, Mendl CB. 2025. Quantum-guided cluster algorithms for combinatorial
optimization. 2025 IEEE International Conference on Quantum Computing and Engineering.
QCE: International Conference on Quantum Computing and Engineering.'
mla: Eder, Peter J., et al. “Quantum-Guided Cluster Algorithms for Combinatorial
Optimization.” 2025 IEEE International Conference on Quantum Computing and
Engineering, IEEE, 2025, doi:10.1109/qce65121.2025.00033.
short: P.J. Eder, A. Kerschbaumer, J.R. Finžgar, R.A. Medina Ramos, M.J.A. Schuetz,
H.G. Katzgraber, S. Braun, C.B. Mendl, in:, 2025 IEEE International Conference
on Quantum Computing and Engineering, IEEE, 2025.
conference:
end_date: 2025-09-05
location: Albuquerque, NM, United States
name: 'QCE: International Conference on Quantum Computing and Engineering'
start_date: 2025-08-30
corr_author: '1'
date_created: 2026-02-17T08:00:17Z
date_published: 2025-09-01T00:00:00Z
date_updated: 2026-02-18T08:45:56Z
day: '01'
department:
- _id: MaSe
doi: 10.1109/qce65121.2025.00033
external_id:
arxiv:
- '2508.10656'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2508.10656
month: '09'
oa: 1
oa_version: Preprint
publication: 2025 IEEE International Conference on Quantum Computing and Engineering
publication_identifier:
eisbn:
- '9798331557362'
publication_status: published
publisher: IEEE
quality_controlled: '1'
status: public
title: Quantum-guided cluster algorithms for combinatorial optimization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '21280'
abstract:
- lang: eng
text: We give an algorithm that, with high probability, maintains a (1-ε)-approximate
s-t maximum flow in undirected, uncapacitated n-vertex graphs undergoing m edge
insertions in Õ(m+ n F^*/ε) total update time, where F^{*} is the maximum flow
on the final graph. This is the first algorithm to achieve polylogarithmic amortized
update time for dense graphs (m = Ω(n²)), and more generally, for graphs where
F^* = Õ(m/n). At the heart of our incremental algorithm is the residual graph
sparsification technique of Karger and Levine [SICOMP '15], originally designed
for computing exact maximum flows in the static setting. Our main contributions
are (i) showing how to maintain such sparsifiers for approximate maximum flows
in the incremental setting and (ii) generalizing the cut sparsification framework
of Fung et al. [SICOMP '19] from undirected graphs to balanced directed graphs.
acknowledgement: "Monika Henzinger and A. R. Sricharan: This project has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation\r\nprogramme (MoDynStruct, No. 101019564) and the Austrian
Science Fund (FWF) grant DOI\r\n10.55776/Z422, grant DOI 10.55776/I5982, and grant
DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.
Harald Räcke: This project has received funding from the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) – 498605858 and 470029389."
alternative_title:
- LIPIcs
article_processing_charge: No
arxiv: 1
author:
- first_name: Gramoz
full_name: Goranci, Gramoz
last_name: Goranci
- 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: Harald
full_name: Räcke, Harald
last_name: Räcke
- first_name: A.
full_name: Sricharan, A.
last_name: Sricharan
citation:
ama: 'Goranci G, Henzinger M, Räcke H, Sricharan A. Incremental approximate maximum
flow via residual graph sparsification. In: 52nd International Colloquium on
Automata, Languages, and Programming. Vol 334. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2025:91:1-91:20. doi:10.4230/lipics.icalp.2025.91'
apa: 'Goranci, G., Henzinger, M., Räcke, H., & Sricharan, A. (2025). Incremental
approximate maximum flow via residual graph sparsification. In 52nd International
Colloquium on Automata, Languages, and Programming (Vol. 334, p. 91:1-91:20).
Aarhus, Denmark: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/lipics.icalp.2025.91'
chicago: Goranci, Gramoz, Monika Henzinger, Harald Räcke, and A. Sricharan. “Incremental
Approximate Maximum Flow via Residual Graph Sparsification.” In 52nd International
Colloquium on Automata, Languages, and Programming, 334:91:1-91:20. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/lipics.icalp.2025.91.
ieee: G. Goranci, M. Henzinger, H. Räcke, and A. Sricharan, “Incremental approximate
maximum flow via residual graph sparsification,” in 52nd International Colloquium
on Automata, Languages, and Programming, Aarhus, Denmark, 2025, vol. 334,
p. 91:1-91:20.
ista: 'Goranci G, Henzinger M, Räcke H, Sricharan A. 2025. Incremental approximate
maximum flow via residual graph sparsification. 52nd International Colloquium
on Automata, Languages, and Programming. ICALP: Automata, Languages and Programming,
LIPIcs, vol. 334, 91:1-91:20.'
mla: Goranci, Gramoz, et al. “Incremental Approximate Maximum Flow via Residual
Graph Sparsification.” 52nd International Colloquium on Automata, Languages,
and Programming, vol. 334, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2025, p. 91:1-91:20, doi:10.4230/lipics.icalp.2025.91.
short: G. Goranci, M. Henzinger, H. Räcke, A. Sricharan, in:, 52nd International
Colloquium on Automata, Languages, and Programming, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025, p. 91:1-91:20.
conference:
end_date: 2025-07-11
location: Aarhus, Denmark
name: 'ICALP: Automata, Languages and Programming'
start_date: 2025-07-08
corr_author: '1'
date_created: 2026-02-17T08:26:06Z
date_published: 2025-06-30T00:00:00Z
date_updated: 2026-02-18T09:06:12Z
day: '30'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/lipics.icalp.2025.91
ec_funded: 1
external_id:
arxiv:
- '2502.09105'
file:
- access_level: open_access
checksum: c178cf554e44204b9f64ebd9b54cf7ba
content_type: application/pdf
creator: dernst
date_created: 2026-02-18T09:02:33Z
date_updated: 2026-02-18T09:02:33Z
file_id: '21315'
file_name: 2025_ICALP_Goranci.pdf
file_size: 944824
relation: main_file
success: 1
file_date_updated: 2026-02-18T09:02:33Z
has_accepted_license: '1'
intvolume: ' 334'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 91:1-91:20
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: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 52nd International Colloquium on Automata, Languages, and Programming
publication_identifier:
isbn:
- '9783959773720'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Incremental approximate maximum flow via residual graph sparsification
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: 334
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '21281'
abstract:
- lang: eng
text: "A strategy profile in a multi-player game is a Nash equilibrium if no player
can unilaterally deviate to achieve a strictly better payoff. A profile is an
ε-Nash equilibrium if no player can gain more than ε by unilaterally deviating
from their strategy. In this work, we use ε-Nash equilibria to approximate the
computation of Nash equilibria. Specifically, we focus on turn-based, multiplayer
stochastic games played on graphs, where players are restricted to stationary
strategies - strategies that use randomness but not memory.\r\nThe problem of
deciding the constrained existence of stationary Nash equilibria - where each
player’s payoff must lie within a given interval - is known to be ∃ℝ-complete
in such a setting (Hansen and Sølvsten, 2020). We extend this line of work to
stationary ε-Nash equilibria and present an algorithm that solves the following
promise problem: given a game with a Nash equilibrium satisfying the constraints,
compute an ε-Nash equilibrium that ε-satisfies those same constraints - satisfies
the constraints up to an ε additive error. Our algorithm runs in FNP^NP time.\r\nTo
achieve this, we first show that if a constrained Nash equilibrium exists, then
one exists where the non-zero probabilities are at least an inverse of a double-exponential
in the input. We further prove that such a strategy can be encoded using floating-point
representations, as in the work of Frederiksen and Miltersen (2013), which finally
gives us our FNP^NP algorithm. \r\nWe further show that the decision version of
the promise problem is NP-hard. Finally, we show a partial tightness result by
proving a lower bound for such techniques: if a constrained Nash equilibrium exists,
then there must be one where the probabilities in the strategies are double-exponentially
small."
acknowledgement: "This work is a part of project VAMOS that has received funding from
the European\r\nResearch Council (ERC), grant agreement No 101020093.\r\n"
alternative_title:
- LIPIcs
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: Leonard
full_name: Brice, Leonard
last_name: Brice
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: K. S.
full_name: Thejaswini, K. S.
id: 3807fb92-fdc1-11ee-bb4a-b4d8a431c753
last_name: Thejaswini
citation:
ama: 'Asadi A, Brice L, Chatterjee K, Thejaswini KS. ε-stationary Nash equilibria
in multi-player stochastic graph games. In: 45th Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. Vol 360. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2025:9:1-9:17. doi:10.4230/lipics.fsttcs.2025.9'
apa: 'Asadi, A., Brice, L., Chatterjee, K., & Thejaswini, K. S. (2025). ε-stationary
Nash equilibria in multi-player stochastic graph games. In 45th Annual Conference
on Foundations of Software Technology and Theoretical Computer Science (Vol.
360, p. 9:1-9:17). Pilani, India: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/lipics.fsttcs.2025.9'
chicago: Asadi, Ali, Leonard Brice, Krishnendu Chatterjee, and K. S. Thejaswini.
“ε-Stationary Nash Equilibria in Multi-Player Stochastic Graph Games.” In 45th
Annual Conference on Foundations of Software Technology and Theoretical Computer
Science, 360:9:1-9:17. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2025. https://doi.org/10.4230/lipics.fsttcs.2025.9.
ieee: A. Asadi, L. Brice, K. Chatterjee, and K. S. Thejaswini, “ε-stationary Nash
equilibria in multi-player stochastic graph games,” in 45th Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Pilani,
India, 2025, vol. 360, p. 9:1-9:17.
ista: 'Asadi A, Brice L, Chatterjee K, Thejaswini KS. 2025. ε-stationary Nash equilibria
in multi-player stochastic graph games. 45th Annual Conference on Foundations
of Software Technology and Theoretical Computer Science. FSTTCS: Conference on
Foundations of Software Technology and Theoretical Computer Science, LIPIcs, vol.
360, 9:1-9:17.'
mla: Asadi, Ali, et al. “ε-Stationary Nash Equilibria in Multi-Player Stochastic
Graph Games.” 45th Annual Conference on Foundations of Software Technology
and Theoretical Computer Science, vol. 360, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025, p. 9:1-9:17, doi:10.4230/lipics.fsttcs.2025.9.
short: A. Asadi, L. Brice, K. Chatterjee, K.S. Thejaswini, in:, 45th Annual Conference
on Foundations of Software Technology and Theoretical Computer Science, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2025, p. 9:1-9:17.
conference:
end_date: 2025-12-19
location: Pilani, India
name: 'FSTTCS: Conference on Foundations of Software Technology and Theoretical
Computer Science'
start_date: 2025-12-17
corr_author: '1'
date_created: 2026-02-17T08:27:14Z
date_published: 2025-12-09T00:00:00Z
date_updated: 2026-02-19T09:39:15Z
day: '09'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
doi: 10.4230/lipics.fsttcs.2025.9
ec_funded: 1
external_id:
arxiv:
- '2508.15356'
file:
- access_level: open_access
checksum: a66343e3ccc4a9cc5bc699c03d5764ff
content_type: application/pdf
creator: dernst
date_created: 2026-02-18T09:13:25Z
date_updated: 2026-02-18T09:13:25Z
file_id: '21316'
file_name: 2025_FSTTCS_Asadi.pdf
file_size: 1054007
relation: main_file
success: 1
file_date_updated: 2026-02-18T09:13:25Z
has_accepted_license: '1'
intvolume: ' 360'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: 9:1-9:17
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 45th Annual Conference on Foundations of Software Technology and Theoretical
Computer Science
publication_identifier:
isbn:
- '9783959774062'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: ε-stationary Nash equilibria in multi-player stochastic graph games
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 360
year: '2025'
...