---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22408'
abstract:
- lang: eng
text: Solitons—localized wave packets that travel without spreading—play a central
role in understanding transport and properties of nonlinear systems. In quantum
many-body systems, however, such robust excitations are typically destroyed by
thermalization. Here, we theoretically demonstrate the existence of solitonic
excitations in high-energy states of Rydberg atom chains in the regime of strong
nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally
atop a special class of reviving initial states related to quantum many-body scars
and are capable of carrying energy. Exhibiting long coherence times, these states
constitute a form of non-ergodic quantum dynamics and can be efficiently implemented
on Rydberg atom simulators. In this work, in addition to a phenomenological description
of solitons, we identify their counterpart in a classical nonlinear dynamical
system, demonstrate their potential use in quantum information transfer, and conjecture
their relevance for anomalous energy transport reported in numerical studies of
Rydberg atom arrays.
acknowledgement: We acknowledge useful discussions with J.-S. Caux, E. Demler, J.
Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter,
F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868.
We acknowledge support by the Erwin Schrödinger International Institute for Mathematics
and Physics (ESI). This research was funded in part by the Austrian Science Fund
(FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This
research was supported in part by grant NSF PHY2309135 to the Kavli Institute for
Theoretical Physics (KITP).
article_processing_charge: Yes
article_type: original
author:
- first_name: Aron
full_name: Kerschbaumer, Aron
id: ade85a9c-3200-11ee-973b-91c1eb240410
last_name: Kerschbaumer
orcid: 0009-0002-2370-8661
- first_name: Jean-Yves Marc
full_name: Desaules, Jean-Yves Marc
id: 6c292945-a610-11ed-9eec-c3be1ad62a80
last_name: Desaules
orcid: 0000-0002-3749-6375
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
citation:
ama: Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg
atom chains. Nature Communications. 2026. doi:10.1038/s41467-026-75598-1
apa: Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., & Serbyn, M. (2026).
Quasi-solitons in Rydberg atom chains. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-026-75598-1
chicago: Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym
Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” Nature Communications.
Springer Nature, 2026. https://doi.org/10.1038/s41467-026-75598-1.
ieee: A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons
in Rydberg atom chains,” Nature Communications. Springer Nature, 2026.
ista: Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons
in Rydberg atom chains. Nature Communications.
mla: Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” Nature
Communications, Springer Nature, 2026, doi:10.1038/s41467-026-75598-1.
short: A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications
(2026).
corr_author: '1'
date_created: 2026-07-27T07:26:27Z
date_published: 2026-07-17T00:00:00Z
date_updated: 2026-07-30T05:42:17Z
day: '17'
ddc:
- '530'
department:
- _id: MaSe
- _id: GradSch
doi: 10.1038/s41467-026-75598-1
ec_funded: 1
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41467-026-75598-1
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: epub_ahead
publisher: Springer Nature
quality_controlled: '1'
status: public
supplementarymaterial: yes
title: Quasi-solitons in Rydberg atom chains
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '22101'
abstract:
- lang: eng
text: "Evolutionary biology examines how the genetic and phenotypic composition\r\nof
populations changes over time. An important goal is to determine the\r\nfixation
probability of a single advantageous mutant that arises in a homogeneous\r\npopulation
of N residents. Many real populations experience environmental\r\ngradients that
cause mutations to be beneficial in some spatial\r\nregions but harmful in others.
Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional
spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies
linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal
to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s
fitness should lead to a decrease in its\r\nfixation probability. However, in
this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially
increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially
decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically
and we precisely delimit the range of\r\nthe gradients for which it occurs. Our
computer simulations closely match\r\nthose findings. Altogether, our results
indicate that subjecting a simple\r\npopulation structure to natural environmental
conditions can produce strong\r\ncounterintuitive effects."
acknowledgement: "J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG
863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was
supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008
and PRIMUS 24/SCI/012."
article_number: '5325'
article_processing_charge: Yes
article_type: original
author:
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
- first_name: Hossein
full_name: Nemati, Hossein
last_name: Nemati
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Kamran
full_name: Kaveh, Kamran
last_name: Kaveh
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness
gradient on fixation probability. Nature Communications. 2026;17. doi:10.1038/s41467-026-71777-2
apa: Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2026).
The effect of the fitness gradient on fixation probability. Nature Communications.
Springer Nature. https://doi.org/10.1038/s41467-026-71777-2
chicago: Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu
Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” Nature
Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-71777-2.
ieee: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect
of the fitness gradient on fixation probability,” Nature Communications,
vol. 17. Springer Nature, 2026.
ista: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of
the fitness gradient on fixation probability. Nature Communications. 17, 5325.
mla: Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.”
Nature Communications, vol. 17, 5325, Springer Nature, 2026, doi:10.1038/s41467-026-71777-2.
short: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications
17 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Correspondence and requests for materials should be addressed
to Krishnendu Chatterjee.
date_created: 2026-06-21T22:02:59Z
date_published: 2026-12-01T00:00:00Z
date_updated: 2026-07-30T07:24:55Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1038/s41467-026-71777-2
ec_funded: 1
external_id:
pmid:
- '41997932'
file:
- access_level: open_access
checksum: b660048bb271f24d6763803e247d5c32
content_type: application/pdf
creator: dernst
date_created: 2026-06-24T06:50:24Z
date_updated: 2026-06-24T06:50:24Z
file_id: '22136'
file_name: 2026_NatureComm_Svoboda.pdf
file_size: 1068919
relation: main_file
success: 1
file_date_updated: 2026-06-24T06:50:24Z
has_accepted_license: '1'
intvolume: ' 17'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: The effect of the fitness gradient on fixation probability
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 17
year: '2026'
...
---
OA_place: publisher
_id: '22399'
abstract:
- lang: eng
text: "Gaining an understanding of how biological regulation evolves is a fundamental
research \r\nquestion in both evolutionary biology and molecular genetics. In
order to gain more insight \r\ninto this topic, we focus on studying the simple
gene regulatory system of the lac operon in \r\nE. coli. We show that simple population
genetic models can shed light on evolution \r\nexperiments and that this combined
approach of modelling the experimental system gives \r\ninsight to better understand
the causes of evolutionary change in the experiment. We also \r\nstudy the natural
diversity in the lac operon from 308 publicly available E. coli genomes that \r\ncome
from various host species and different regions of the world. Evidence that selection
is \r\ngenerally maintaining the function of the lac operon across the sample
regardless of host \r\nspecies is provided and we show that different protein
coding genes in the operon are under \r\ndifferent selective constraints on protein
sequence preservation. A similar frameshift \r\nmutation found in experimental
evolution studies is shown to be present in the sample we \r\nanalyzed, indicating
that selectively relevant variants in evolution experiments are also \r\npresent
in natural populations. We show that there is no simple phylogenetic relationship
\r\nbetween host species, geographical location and the lac operon sequence. Finally,
we argue \r\nthat a combined approach of comparative genomics, experimental evolution
and theoretical \r\nmodelling contributes to a more complete understanding of
molecular evolution. "
alternative_title:
- ISTA Master’s Thesis
article_processing_charge: No
author:
- first_name: Aleksa
full_name: Spasić, Aleksa
id: ecee9d38-4040-11ef-8843-b941efb445d6
last_name: Spasić
citation:
ama: Spasić A. Studying the evolutionary systems biology of the lac operon. 2026.
doi:10.15479/AT-ISTA-22399
apa: Spasić, A. (2026). Studying the evolutionary systems biology of the lac
operon. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22399
chicago: Spasić, Aleksa. “Studying the Evolutionary Systems Biology of the Lac Operon.”
Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22399.
ieee: A. Spasić, “Studying the evolutionary systems biology of the lac operon,”
Institute of Science and Technology Austria, 2026.
ista: Spasić A. 2026. Studying the evolutionary systems biology of the lac operon.
Institute of Science and Technology Austria.
mla: Spasić, Aleksa. Studying the Evolutionary Systems Biology of the Lac Operon.
Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22399.
short: A. Spasić, Studying the Evolutionary Systems Biology of the Lac Operon, Institute
of Science and Technology Austria, 2026.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-25T13:08:32Z
date_published: 2026-07-27T00:00:00Z
date_updated: 2026-07-31T10:52:08Z
day: '27'
ddc:
- '576'
degree_awarded: MS
department:
- _id: GradSch
- _id: GaTk
- _id: CaGu
doi: 10.15479/AT-ISTA-22399
doi_confirm: '1'
file:
- access_level: open_access
checksum: c29880dd71fcc37f23ac6e2843066ede
content_type: application/pdf
creator: aspasic
date_created: 2026-07-27T13:00:07Z
date_updated: 2026-07-27T13:00:07Z
file_id: '22588'
file_name: Aleksa_Spasic_Thesis_final.pdf
file_size: 1986078
relation: main_file
success: 1
- access_level: closed
checksum: 4ebe3bd2d833d913c0756343cca5e5f0
content_type: application/vnd.openxmlformats-officedocument.wordprocessingml.document
creator: aspasic
date_created: 2026-07-27T13:00:22Z
date_updated: 2026-07-27T13:07:23Z
file_id: '22589'
file_name: Thesis_final.docx
file_size: 1868853
relation: source_file
file_date_updated: 2026-07-27T13:07:23Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '32'
publication_identifier:
issn:
- 2791-4585
publication_status: published
publisher: Institute of Science and Technology Austria
status: public
supervisor:
- first_name: Calin C
full_name: Guet, Calin C
id: 47F8433E-F248-11E8-B48F-1D18A9856A87
last_name: Guet
orcid: 0000-0001-6220-2052
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
title: Studying the evolutionary systems biology of the lac operon
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '18706'
abstract:
- lang: eng
text: "We prove discrete-to-continuum convergence for dynamical optimal transport
on Zd\r\n -periodic graphs with cost functional having linear growth at infinity.
This result provides an answer to a problem left open by Gladbach, Kopfer, Maas,
and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the
convergence behaviour of discrete boundary-value dynamical transport problems
is proved under the stronger assumption of superlinear growth. Our result extends
the known literature to some important classes of examples, such as scaling limits
of 1 -Wasserstein transport problems. Similarly to what happens in the quadratic
case, the geometry of the graph plays a crucial role in the structure of the limit
cost function, as we discuss in the final part of this work, which includes some
visual representations."
acknowledgement: L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1,
Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science
Fund (FWF) project 10.55776/F65.
article_processing_charge: Yes
article_type: original
author:
- first_name: Lorenzo
full_name: Portinale, Lorenzo
id: 30AD2CBC-F248-11E8-B48F-1D18A9856A87
last_name: Portinale
- first_name: Filippo
full_name: Quattrocchi, Filippo
id: 3ebd6ba8-edfb-11eb-afb5-91a9745ba308
last_name: Quattrocchi
orcid: 0009-0000-9773-1931
citation:
ama: Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport
with linear growth on periodic graphs. European Journal of Applied Mathematics.
2026;37(3):614-642. doi:10.1017/s0956792524000810
apa: Portinale, L., & Quattrocchi, F. (2026). Discrete-to-continuum limits of
optimal transport with linear growth on periodic graphs. European Journal of
Applied Mathematics. Cambridge University Press. https://doi.org/10.1017/s0956792524000810
chicago: Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits
of Optimal Transport with Linear Growth on Periodic Graphs.” European Journal
of Applied Mathematics. Cambridge University Press, 2026. https://doi.org/10.1017/s0956792524000810.
ieee: L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal
transport with linear growth on periodic graphs,” European Journal of Applied
Mathematics, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026.
ista: Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal
transport with linear growth on periodic graphs. European Journal of Applied Mathematics.
37(3), 614–642.
mla: Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits
of Optimal Transport with Linear Growth on Periodic Graphs.” European Journal
of Applied Mathematics, vol. 37, no. 3, Cambridge University Press, 2026,
pp. 614–42, doi:10.1017/s0956792524000810.
short: L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37
(2026) 614–642.
das_tickbox: '0'
date_created: 2024-12-23T11:03:59Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-08-01T22:31:10Z
day: '01'
ddc:
- '500'
department:
- _id: GradSch
- _id: JaMa
doi: 10.1017/s0956792524000810
external_id:
isi:
- '001381435800001'
file:
- access_level: open_access
checksum: d038f4d00cbfbde2672c17138eab21c9
content_type: application/pdf
creator: dernst
date_created: 2026-07-23T05:55:03Z
date_updated: 2026-07-23T05:55:03Z
file_id: '22386'
file_name: 2026_EuropJourAppliedMath_Portinale.pdf
file_size: 612317
relation: main_file
success: 1
file_date_updated: 2026-07-23T05:55:03Z
has_accepted_license: '1'
intvolume: ' 37'
isi: 1
issue: '3'
keyword:
- optimal transport
- discrete-to-continuum
- homogenisation
- linear growth
- gamma-convergence
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 614-642
project:
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication: European Journal of Applied Mathematics
publication_identifier:
eissn:
- 1469-4425
issn:
- 0956-7925
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '20563'
relation: dissertation_contains
status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Discrete-to-continuum limits of optimal transport with linear growth on periodic
graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22007'
abstract:
- lang: eng
text: "Truncation of cryptographic outputs is a technique that was recently introduced
in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try
out many inputs to some cryptographic algorithm until the output (e.g. a public-key
or some hash value) falls into some sparse set and thus can be compressed: by
trying out an expected 2^k different inputs one will find an output that starts
with k zeros.\r\nUsing such truncation one can for example save substantial gas
fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi
et al., 2022] show that truncation preserves the security of the underlying primitive,
they only consider a setting without preprocessing. In this work we show that
lower bounds on the time-space tradeoff for inverting random functions and permutations
also hold with truncation, except for parameters ranges where the bound fails
to hold for \"trivial\" reasons.\r\nConcretely, it’s known that any algorithm
that inverts a random function or permutation with range N making T queries and
using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no
longer holds in the truncated setting where one must only invert a challenge from
a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges,
which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query.\r\nWe
show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k
bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog
N lower bound applies."
alternative_title:
- LIPIcs
article_number: 4:1-4:10
article_processing_charge: Yes
author:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
- first_name: Pengxiang
full_name: Wang, Pengxiang
last_name: Wang
citation:
ama: 'Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing.
In: 6th Conference on Information-Theoretic Cryptography. Vol 343. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.ITC.2025.4'
apa: 'Pietrzak, K. Z., & Wang, P. (2025). Time-space tradeoffs of truncation
with preprocessing. In 6th Conference on Information-Theoretic Cryptography
(Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2025.4'
chicago: Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation
with Preprocessing.” In 6th Conference on Information-Theoretic Cryptography,
Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITC.2025.4.
ieee: K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,”
in 6th Conference on Information-Theoretic Cryptography, Santa Barbara,
CA, United States, 2025, vol. 343.
ista: 'Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing.
6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic
Cryptography, LIPIcs, vol. 343, 4:1-4:10.'
mla: Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation
with Preprocessing.” 6th Conference on Information-Theoretic Cryptography,
vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ITC.2025.4.
short: K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography,
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
conference:
end_date: 2025-08-17
location: Santa Barbara, CA, United States
name: 'ITC: Information Theoretic Cryptography'
start_date: 2025-08-16
corr_author: '1'
cryptoeprintid: 1
das_tickbox: '0'
date_created: 2026-06-14T22:01:45Z
date_published: 2025-09-08T00:00:00Z
date_updated: 2026-06-22T08:57:41Z
day: '08'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ITC.2025.4
external_id:
cryptoeprintid:
- 2025/723
file:
- access_level: open_access
checksum: 3f791b03df26853342855a9d9581cb58
content_type: application/pdf
creator: dernst
date_created: 2026-06-22T08:54:32Z
date_updated: 2026-06-22T08:54:32Z
file_id: '22118'
file_name: 2025_LIPIcs_Pietrzak.pdf
file_size: 772046
relation: main_file
success: 1
file_date_updated: 2026-06-22T08:54:32Z
has_accepted_license: '1'
intvolume: ' 343'
keyword:
- Time-Space Lower Bounds
- Blockchains
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: 6th Conference on Information-Theoretic Cryptography
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773850'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Time-space tradeoffs of truncation with preprocessing
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: 343
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '22032'
abstract:
- lang: eng
text: We prove that the focusing and defocusing continuum Calogero–Moser models
are well-posed in the scaling-critical space L^2+(R). In the focusing case, this
requires solutions to have mass less than that of the soliton.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Thierry
full_name: Laurens, Thierry
last_name: Laurens
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum
Calogero–Moser models on the line. Communications of the American Mathematical
Society. 2025;5(7):284-320. doi:10.1090/cams/48
apa: Killip, R., Laurens, T., & Vişan, M. (2025). Scaling-critical well-posedness
for continuum Calogero–Moser models on the line. Communications of the American
Mathematical Society. American Mathematical Society. https://doi.org/10.1090/cams/48
chicago: Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness
for Continuum Calogero–Moser Models on the Line.” Communications of the American
Mathematical Society. American Mathematical Society, 2025. https://doi.org/10.1090/cams/48.
ieee: R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for
continuum Calogero–Moser models on the line,” Communications of the American
Mathematical Society, vol. 5, no. 7. American Mathematical Society, pp. 284–320,
2025.
ista: Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum
Calogero–Moser models on the line. Communications of the American Mathematical
Society. 5(7), 284–320.
mla: Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser
Models on the Line.” Communications of the American Mathematical Society,
vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:10.1090/cams/48.
short: R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical
Society 5 (2025) 284–320.
das_tickbox: '1'
date_created: 2026-06-19T07:42:34Z
date_published: 2025-06-23T00:00:00Z
date_updated: 2026-06-22T11:21:09Z
day: '23'
ddc:
- '500'
doi: 10.1090/cams/48
extern: '1'
external_id:
arxiv:
- '2311.12334'
has_accepted_license: '1'
intvolume: ' 5'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2311.12334
month: '06'
oa: 1
oa_version: Published Version
page: 284-320
publication: Communications of the American Mathematical Society
publication_identifier:
issn:
- 2692-3688
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scaling-critical well-posedness for continuum Calogero–Moser models on the
line
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22036'
abstract:
- lang: eng
text: We prove dispersive decay, pointwise in time, for solutions to the mass-critical
nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.
article_number: '21'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chenjie
full_name: Fan, Chenjie
last_name: Fan
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
- first_name: Zehua
full_name: Zhao, Zehua
last_name: Zhao
citation:
ama: Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear
Schrödinger equation. Mathematische Zeitschrift. 2025;311. doi:10.1007/s00209-025-03821-8
apa: Fan, C., Killip, R., Vişan, M., & Zhao, Z. (2025). Dispersive decay for
the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift.
Springer Nature. https://doi.org/10.1007/s00209-025-03821-8
chicago: Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay
for the Mass-Critical Nonlinear Schrödinger Equation.” Mathematische Zeitschrift.
Springer Nature, 2025. https://doi.org/10.1007/s00209-025-03821-8.
ieee: C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical
nonlinear Schrödinger equation,” Mathematische Zeitschrift, vol. 311. Springer
Nature, 2025.
ista: Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical
nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.
mla: Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger
Equation.” Mathematische Zeitschrift, vol. 311, 21, Springer Nature, 2025,
doi:10.1007/s00209-025-03821-8.
short: C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).
das_tickbox: '1'
date_created: 2026-06-19T07:44:05Z
date_published: 2025-07-24T00:00:00Z
date_updated: 2026-06-22T13:00:14Z
day: '24'
doi: 10.1007/s00209-025-03821-8
extern: '1'
external_id:
arxiv:
- '2403.09989'
intvolume: ' 311'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2403.09989
month: '07'
oa: 1
oa_version: Preprint
publication: Mathematische Zeitschrift
publication_identifier:
eissn:
- 1432-1823
issn:
- 0025-5874
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dispersive decay for the mass-critical nonlinear Schrödinger equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 311
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '12662'
abstract:
- lang: eng
text: 'Modern machine learning tasks often require considering not just one but
multiple objectives. For example, besides the prediction quality, this could be
the efficiency, robustness or fairness of the learned models, or any of their
combinations. Multi-objective learning offers a natural framework for handling
such problems without having to commit to early trade-offs. Surprisingly, statistical
learning theory so far offers almost no insight into the generalization properties
of multi-objective learning. In this work, we make first steps to fill this gap:
We establish foundational generalization bounds for the multi-objective setting
as well as generalization and excess bounds for learning with scalarizations.
We also provide the first theoretical analysis of the relation between the Pareto-optimal
sets of the true objectives and the Pareto-optimal sets of their empirical approximations
from training data. In particular, we show a surprising asymmetry: All Pareto-optimal
solutions can be approximated by empirically Pareto-optimal ones, but not vice
versa.'
acknowledgement: Open access funding provided by Institute of Science and Technology
(IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Peter
full_name: Súkeník, Peter
id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
last_name: Súkeník
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: Súkeník P, Lampert C. Generalization in multi-objective machine learning. Neural
Computing and Applications. 2025;37:24669–24683. doi:10.1007/s00521-024-10616-1
apa: Súkeník, P., & Lampert, C. (2025). Generalization in multi-objective machine
learning. Neural Computing and Applications. Springer Nature. https://doi.org/10.1007/s00521-024-10616-1
chicago: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective
Machine Learning.” Neural Computing and Applications. Springer Nature,
2025. https://doi.org/10.1007/s00521-024-10616-1.
ieee: P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,”
Neural Computing and Applications, vol. 37. Springer Nature, pp. 24669–24683,
2025.
ista: Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning.
Neural Computing and Applications. 37, 24669–24683.
mla: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine
Learning.” Neural Computing and Applications, vol. 37, Springer Nature,
2025, pp. 24669–24683, doi:10.1007/s00521-024-10616-1.
short: P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.
corr_author: '1'
date_created: 2023-02-20T08:23:06Z
date_published: 2025-10-01T00:00:00Z
date_updated: 2025-12-30T06:39:56Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s00521-024-10616-1
external_id:
arxiv:
- '2208.13499'
file:
- access_level: open_access
checksum: 61ad4591aee16b1e02daf6c164321a42
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T06:39:11Z
date_updated: 2025-12-30T06:39:11Z
file_id: '20877'
file_name: 2025_NeuralCompApplic_Sukenik.pdf
file_size: 500213
relation: main_file
success: 1
file_date_updated: 2025-12-30T06:39:11Z
has_accepted_license: '1'
intvolume: ' 37'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 24669–24683
publication: Neural Computing and Applications
publication_identifier:
eissn:
- 1433-3058
issn:
- 0941-0643
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalization in multi-objective machine learning
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: 37
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20820'
abstract:
- lang: eng
text: 'The high computational costs of large language models (LLMs) have led to
a flurry of research on LLM compression, via methods such as quantization, sparsification,
or structured pruning. A new frontier in this area is given by dynamic, non-uniform
compression methods, which adjust the compression levels (e.g., sparsity) per-block
or even per-layer in order to minimize accuracy loss, while guaranteeing a global
compression threshold. Yet, current methods rely on estimating the "importance"
of a given layer, implicitly assuming that layers contribute independently to
the overall compression error. We begin from the motivating observation that this
independence assumption does not generally hold for LLM compression: pruning a
model further may even significantly recover performance. To address this, we
propose EvoPress, a novel evolutionary framework for dynamic LLM compression.
By formulating dynamic compression as a general optimization problem, EvoPress
identifies optimal compression profiles in a highly efficient manner, and generalizes
across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art
performance for dynamic compression of Llama, Mistral, and Phi models, setting
new benchmarks for structural pruning (block/layer dropping), unstructured sparsity,
and quantization with dynamic bitwidths.'
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Oliver
full_name: Sieberling, Oliver
last_name: Sieberling
- first_name: Denis
full_name: Kuznedelev, Denis
last_name: Kuznedelev
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- 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: 'Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic
model compression via evolutionary search. In: 42nd International Conference
on Machine Learning. Vol 267. ML Research Press; 2025:55556-55590.'
apa: 'Sieberling, O., Kuznedelev, D., Kurtic, E., & Alistarh, D.-A. (2025).
EvoPress: Accurate dynamic model compression via evolutionary search. In 42nd
International Conference on Machine Learning (Vol. 267, pp. 55556–55590).
Vancouver, Canada: ML Research Press.'
chicago: 'Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh.
“EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In 42nd
International Conference on Machine Learning, 267:55556–90. ML Research Press,
2025.'
ieee: 'O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate
dynamic model compression via evolutionary search,” in 42nd International Conference
on Machine Learning, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.'
ista: 'Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. 2025. EvoPress: Accurate
dynamic model compression via evolutionary search. 42nd International Conference
on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
vol. 267, 55556–55590.'
mla: 'Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via
Evolutionary Search.” 42nd International Conference on Machine Learning,
vol. 267, ML Research Press, 2025, pp. 55556–90.'
short: O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International
Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.
conference:
end_date: 2025-07-19
location: Vancouver, Canada
name: 'ICML: International Conference on Machine Learning'
start_date: 2025-07-13
corr_author: '1'
date_created: 2025-12-14T23:02:05Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-12-16T12:34:32Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '2410.14649'
file:
- access_level: open_access
checksum: 1d744fbaeb199b08e8b6f48bc0dd047e
content_type: application/pdf
creator: dernst
date_created: 2025-12-16T12:32:40Z
date_updated: 2025-12-16T12:32:40Z
file_id: '20828'
file_name: 2025_ICML_Sieberling.pdf
file_size: 908379
relation: main_file
success: 1
file_date_updated: 2025-12-16T12:32:40Z
has_accepted_license: '1'
intvolume: ' 267'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 55556-55590
publication: 42nd International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'EvoPress: Accurate dynamic model compression via evolutionary search'
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: 267
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20821'
abstract:
- lang: eng
text: Modern deep neural networks exhibit heterogeneity across numerous layers of
various types such as residuals, multi-head attention, etc., due to varying structures
(dimensions, activation functions, etc.), distinct representation characteristics,
which impact predictions. We develop a general layer-wise quantization framework
with tight variance and code-length bounds, adapting to the heterogeneities over
the course of training. We then apply a new layer-wise quantization technique
within distributed variational inequalities (VIs), proposing a novel Quantized
Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which
achieves competitive convergence rates for monotone VIs. We empirically show that
QODA achieves up to a 150% speedup over the baselines in end-to-end training time
for training Wasserstein GAN on 12+GPUs.
acknowledgement: "This work was supported by Hasler Foundation Program: Hasler Responsible
AI (project number 21043). The research was also sponsored by the Army Research
Office and was accomplished under Grant Number W911NF-24-1-0048. This work was further
funded by the Swiss National Science Foundation (SNSF) under grant number 200021_205011.
We also acknowledge project A11 of the Swiss National Supercomputing Centre (CSCS)
for providing computing resources. Dan Alistarh and Ilia Markov were supported in
part through the ERC Proofof-Concept grant FastML (Grant Agreement 101158077). Ali
Ramezani-Kebrya was supported by the Research Council of Norway through FRIPRO Grant
under project number 356103, its Centres of Excellence scheme, Integreat - Norwegian
Centre for knowledge-driven machine learning under\r\nproject number 332645 - and
its Centre for Research-based Innovation funding scheme (Visual Intelligence under
grant no. 309439)."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Anh Duc
full_name: Nguyen, Anh Duc
last_name: Nguyen
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Frank Zhengqing
full_name: Wu, Frank Zhengqing
last_name: Wu
- first_name: Ali
full_name: Ramezani-Kebrya, Ali
last_name: Ramezani-Kebrya
- first_name: Kimon
full_name: Antonakopoulos, Kimon
last_name: Antonakopoulos
- 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: Volkan
full_name: Cevher, Volkan
last_name: Cevher
citation:
ama: 'Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic
dual averaging. In: 42nd International Conference on Machine Learning.
Vol 267. ML Research Press; 2025:46026-46072.'
apa: 'Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos,
K., Alistarh, D.-A., & Cevher, V. (2025). Layer-wise quantization for quantized
optimistic dual averaging. In 42nd International Conference on Machine Learning
(Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.'
chicago: Nguyen, Anh Duc, Ilia Markov, Frank Zhengqing Wu, Ali Ramezani-Kebrya,
Kimon Antonakopoulos, Dan-Adrian Alistarh, and Volkan Cevher. “Layer-Wise Quantization
for Quantized Optimistic Dual Averaging.” In 42nd International Conference
on Machine Learning, 267:46026–72. ML Research Press, 2025.
ieee: A. D. Nguyen et al., “Layer-wise quantization for quantized optimistic
dual averaging,” in 42nd International Conference on Machine Learning,
Vancouver, Canada, 2025, vol. 267, pp. 46026–46072.
ista: 'Nguyen AD, Markov I, Wu FZ, Ramezani-Kebrya A, Antonakopoulos K, Alistarh
D-A, Cevher V. 2025. Layer-wise quantization for quantized optimistic dual averaging.
42nd International Conference on Machine Learning. ICML: International Conference
on Machine Learning, PMLR, vol. 267, 46026–46072.'
mla: Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual
Averaging.” 42nd International Conference on Machine Learning, vol. 267,
ML Research Press, 2025, pp. 46026–72.
short: A.D. Nguyen, I. Markov, F.Z. Wu, A. Ramezani-Kebrya, K. Antonakopoulos, D.-A.
Alistarh, V. Cevher, in:, 42nd International Conference on Machine Learning, ML
Research Press, 2025, pp. 46026–46072.
conference:
end_date: 2025-07-19
location: Vancouver, Canada
name: 'ICML: International Conference on Machine Learning'
start_date: 2025-07-13
date_created: 2025-12-14T23:02:06Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-12-16T12:46:54Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
arxiv:
- '2505.14371'
file:
- access_level: open_access
checksum: a7edf0e4304171a3e035842b3aab1704
content_type: application/pdf
creator: dernst
date_created: 2025-12-16T12:45:41Z
date_updated: 2025-12-16T12:45:41Z
file_id: '20830'
file_name: 2025_ICML_Nguyen.pdf
file_size: 756213
relation: main_file
success: 1
file_date_updated: 2025-12-16T12:45:41Z
has_accepted_license: '1'
intvolume: ' 267'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 46026-46072
project:
- _id: 8e35c14b-16d5-11f0-9cad-a3fc35339161
grant_number: '101158077'
name: 'FastML: Efficient and Cost-Effective Distributed Machine Learning'
publication: 42nd International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Layer-wise quantization for quantized optimistic dual averaging
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: 267
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '20839'
abstract:
- lang: eng
text: For every couple of Hausdorff functions ψ and φ verifying some mild assumptions,
there exists a compact subset K of the Baire space such that the φ-Hausdorff measure
and the ψ-packing measure on K are both finite and positive. Such examples are
then embedded in any infinite dimensional Banach space to answer positively a
question of Fan on the existence of metric spaces with arbitrary scales.
article_processing_charge: Yes
article_type: original
author:
- first_name: Mathieu
full_name: Helfter, Mathieu
id: 7d296fbe-e2c6-11ee-84d3-d5c2945f9a57
last_name: Helfter
citation:
ama: Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional
Banach spaces. Journal of Fractal Geometry. 2025. doi:10.4171/jfg/177
apa: Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite
dimensional Banach spaces. Journal of Fractal Geometry. EMS Press. https://doi.org/10.4171/jfg/177
chicago: Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in
Infinite Dimensional Banach Spaces.” Journal of Fractal Geometry. EMS Press,
2025. https://doi.org/10.4171/jfg/177.
ieee: M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite
dimensional Banach spaces,” Journal of Fractal Geometry. EMS Press, 2025.
ista: Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite
dimensional Banach spaces. Journal of Fractal Geometry.
mla: Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite
Dimensional Banach Spaces.” Journal of Fractal Geometry, EMS Press, 2025,
doi:10.4171/jfg/177.
short: M. Helfter, Journal of Fractal Geometry (2025).
corr_author: '1'
date_created: 2025-12-19T10:15:37Z
date_published: 2025-11-07T00:00:00Z
date_updated: 2026-06-18T18:26:33Z
day: '07'
ddc:
- '500'
department:
- _id: VaKa
doi: 10.4171/jfg/177
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.4171/jfg/177
month: '11'
oa: 1
oa_version: Published Version
publication: Journal of Fractal Geometry
publication_identifier:
eissn:
- 2308-1317
issn:
- 2308-1309
publication_status: epub_ahead
publisher: EMS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach
spaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
_id: '20842'
abstract:
- lang: eng
text: Probing the possibility of entanglement generation through gravity offers
a path to tackle the question of whether gravitational fields possess a quantum
mechanical nature. A potential realization necessitates systems with low-frequency
dynamics at an optimal mass scale, for which the microgram-to-milligram range
is a strong contender. Here, after refining a figure-of-merit for the problem,
we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate
laser cooling its motion from room temperature to 240~microkelvins, surpassing
by over 20-fold the coldest motions attained for oscillators ranging from micrograms
to kilograms. We quantify and contrast the utility of the current approach with
other platforms. The achieved performance and large improvement potential highlight
milligram-scale torsional pendulums as a powerful platform for precision measurements
relevant to future studies at the quantum-gravity interface.
article_processing_charge: No
author:
- first_name: Sofya
full_name: Agafonova, Sofya
id: 09501ff6-dca7-11ea-a8ae-b3e0b9166e80
last_name: Agafonova
orcid: 0000-0003-0582-2946
citation:
ama: 'Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments
at the quantum-gravity interface.” 2025. doi:10.15479/AT-ISTA-20842'
apa: 'Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum
toward experiments at the quantum-gravity interface.” Institute of Science and
Technology Austria. https://doi.org/10.15479/AT-ISTA-20842'
chicago: 'Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum
toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and
Technology Austria, 2025. https://doi.org/10.15479/AT-ISTA-20842.'
ieee: 'S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward
experiments at the quantum-gravity interface.’” Institute of Science and Technology
Austria, 2025.'
ista: 'Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward
experiments at the quantum-gravity interface’, Institute of Science and Technology
Austria, 10.15479/AT-ISTA-20842.'
mla: 'Agafonova, Sofia. Research Data for: “One-Milligram Torsional Pendulum
toward Experiments at the Quantum-Gravity Interface.” Institute of Science
and Technology Austria, 2025, doi:10.15479/AT-ISTA-20842.'
short: S. Agafonova, (2025).
contributor:
- first_name: Pere
last_name: Rosello
- first_name: Manuel
last_name: Mekonnen
- contributor_type: supervisor
first_name: Onur
id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
last_name: Hosten
orcid: 0000-0002-2031-204X
corr_author: '1'
date_created: 2025-12-21T14:23:50Z
date_published: 2025-12-22T00:00:00Z
date_updated: 2026-06-10T08:36:07Z
day: '22'
department:
- _id: GradSch
- _id: OnHo
doi: 10.15479/AT-ISTA-20842
file:
- access_level: open_access
checksum: 7af34e4226a00cdcb7f154272050e217
content_type: application/x-zip-compressed
creator: sagafono
date_created: 2025-12-22T13:45:30Z
date_updated: 2025-12-22T13:45:30Z
file_id: '20854'
file_name: AllData.zip
file_size: 146656591
relation: main_file
success: 1
- access_level: open_access
checksum: 71806a2ef9fb26ad7b78e04c6754ee4e
content_type: application/x-zip-compressed
creator: sagafono
date_created: 2025-12-22T13:45:33Z
date_updated: 2025-12-22T13:45:33Z
file_id: '20855'
file_name: SourceData.zip
file_size: 93470129
relation: main_file
success: 1
- access_level: open_access
checksum: 08facd1b4a102f83e4d99d48a85b258d
content_type: text/plain
creator: sagafono
date_created: 2025-12-22T13:51:09Z
date_updated: 2025-12-22T13:51:09Z
file_id: '20856'
file_name: readme.txt
file_size: 461
relation: main_file
success: 1
file_date_updated: 2025-12-22T13:51:09Z
has_accepted_license: '1'
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: bdb2a702-d553-11ed-ba76-f12e3e5a3bc6
grant_number: '101087907'
name: 'A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational
quantum mechanics'
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '20840'
relation: used_in_publication
status: public
status: public
title: 'Research Data for: ''One-milligram torsional pendulum toward experiments at
the quantum-gravity interface'''
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20845'
abstract:
- lang: eng
text: "We develop new attacks against the Evasive LWE family of assumptions, in
both the public and private-coin regime. To the best of our knowledge, ours are
the first attacks against Evasive LWE in the public-coin regime, for any instantiation
from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The
recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption
(ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption.
This assumption has been popularly considered as a safe, public-coin instance
of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10,
11]).\r\nWe provide the first attack against this assumption, challenging the
widely held belief that this is a public-coin assumption.\r\n2. We demonstrate
a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural
parameter regime. Our attack crucially relies on the error in the pre-condition
being larger than the error in the post-condition, necessitating a refinement
of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal,
Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom
functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities
(PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against
the assumption stated in the first posting of their work (subsequently refined
to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently
to [4]) provides a construction of obfuscation for pseudorandom functionalities
by relying on private-coin evasive LWE. We provide a new attack against their
stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived,
“self-referential” classes of pseudorandom functionalities for which pseudorandom
obfuscation cannot exist. We extend their techniques to develop an analogous result
for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed
to specifically avoid “zeroizing attacks”, our work shows that in certain settings,
such attacks can still apply."
acknowledgement: "We thank Rachel Lin for expressing concern about the applicability
of “HJL-style” attacks [15] on the construction in [2] during a talk by the first
author about [2]. This was the starting point of the investigation that led us to
develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for
sharing his rationale for introducing evasive LWE.\r\nThe first author is supported
by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship.
The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras
during which the collaboration was initiated. The 4th author is partly supported
by JST CREST Grant Number JPMJCR22M1."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shweta
full_name: Agrawal, Shweta
last_name: Agrawal
- first_name: Anuja
full_name: Modi, Anuja
last_name: Modi
- first_name: Anshu
full_name: Yadav, Anshu
id: dc8f1524-403e-11ee-bf07-9649ad996e21
last_name: Yadav
- first_name: Shota
full_name: Yamada, Shota
last_name: Yamada
citation:
ama: 'Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular
evasive LWE. In: 23rd International Conference on Theory of Cryptography.
Vol 16269. Springer Nature; 2025:259-290. doi:10.1007/978-3-032-12293-3_9'
apa: 'Agrawal, S., Modi, A., Yadav, A., & Yamada, S. (2025). Zeroizing attacks
against evasive and circular evasive LWE. In 23rd International Conference
on Theory of Cryptography (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer
Nature. https://doi.org/10.1007/978-3-032-12293-3_9'
chicago: Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing
Attacks against Evasive and Circular Evasive LWE.” In 23rd International Conference
on Theory of Cryptography, 16269:259–90. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-12293-3_9.
ieee: S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive
and circular evasive LWE,” in 23rd International Conference on Theory of Cryptography,
Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.
ista: 'Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive
and circular evasive LWE. 23rd International Conference on Theory of Cryptography.
TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290.'
mla: Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive
LWE.” 23rd International Conference on Theory of Cryptography, vol. 16269,
Springer Nature, 2025, pp. 259–90, doi:10.1007/978-3-032-12293-3_9.
short: S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference
on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.
conference:
end_date: 2025-12-05
location: Aarhus, Denmark
name: 'TCC: Theory of Cryptography'
start_date: 2025-12-01
date_created: 2025-12-21T23:01:33Z
date_published: 2025-12-05T00:00:00Z
date_updated: 2025-12-29T11:51:13Z
day: '05'
department:
- _id: KrPi
doi: 10.1007/978-3-032-12293-3_9
intvolume: ' 16269'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2025/375
month: '12'
oa: 1
oa_version: Preprint
page: 259-290
publication: 23rd International Conference on Theory of Cryptography
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783032122926'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zeroizing attacks against evasive and circular evasive LWE
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16269
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20846'
abstract:
- lang: eng
text: "CVRFs are PRFs that unify the properties of verifiable and constrained PRFs.
Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy
in 2014, it has been an open problem to construct CVRFs without using heavy machinery
such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this
problem by constructing a prefix-constrained verifiable PRF that does not rely
on the aforementioned assumptions. Essentially, our construction is a verifiable
version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage
degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate
values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group
elements. These outputs can be verified using pairings since the underlying PRG
is of degree 2.\r\nWe prove the selective security of our construction under the
Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which
we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness
of recursive DDH in the generic group model assuming the hardness of the Multivariate
Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast,
in terms of applications, we observe that our CVRF is also an exponent (C)VRF
in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25)
with various applications to threshold cryptography in mind. In addition to that,
we give further applications for prefix-CVRFs in the blockchain setting, namely,
stake-pooling and compressible randomness beacons."
acknowledgement: "We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions
on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes
of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook
Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the
Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has
applied a CC BY public copyright license to any author-accepted manuscript version
arising from this submission."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nicholas
full_name: Brandt, Nicholas
last_name: Brandt
- 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: Christoph Ullrich
full_name: Günther, Christoph Ullrich
id: ec98511c-eb8e-11eb-b029-edd25d7271a1
last_name: Günther
- first_name: Akin
full_name: Ünal, Akin
id: f6b56fb6-dc63-11ee-9dbf-f6780863a85a
last_name: Ünal
orcid: 0000-0002-8929-0221
- first_name: Stella
full_name: Wohnig, Stella
last_name: Wohnig
citation:
ama: 'Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable
random functions without obfuscation and friends. In: 23rd International Conference
on Theory of Cryptography. Vol 16271. Springer Nature; 2025:478-511. doi:10.1007/978-3-032-12290-2_16'
apa: 'Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., & Wohnig, S. (2025).
Constrained verifiable random functions without obfuscation and friends. In 23rd
International Conference on Theory of Cryptography (Vol. 16271, pp. 478–511).
Aarhus, Denmark: Springer Nature. https://doi.org/10.1007/978-3-032-12290-2_16'
chicago: Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal,
and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation
and Friends.” In 23rd International Conference on Theory of Cryptography,
16271:478–511. Springer Nature, 2025. https://doi.org/10.1007/978-3-032-12290-2_16.
ieee: N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained
verifiable random functions without obfuscation and friends,” in 23rd International
Conference on Theory of Cryptography, Aarhus, Denmark, 2025, vol. 16271, pp.
478–511.
ista: 'Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained
verifiable random functions without obfuscation and friends. 23rd International
Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol.
16271, 478–511.'
mla: Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation
and Friends.” 23rd International Conference on Theory of Cryptography,
vol. 16271, Springer Nature, 2025, pp. 478–511, doi:10.1007/978-3-032-12290-2_16.
short: N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International
Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511.
conference:
end_date: 2025-12-05
location: Aarhus, Denmark
name: 'TCC: Theory of Cryptography'
start_date: 2025-12-01
corr_author: '1'
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-05T00:00:00Z
date_updated: 2025-12-29T11:11:29Z
day: '05'
department:
- _id: KrPi
doi: 10.1007/978-3-032-12290-2_16
intvolume: ' 16271'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2025/1045
month: '12'
oa: 1
oa_version: Preprint
page: 478-511
project:
- _id: 34a34d57-11ca-11ed-8bc3-a2688a8724e1
grant_number: F8509
name: Security and Privacy by Design for Complex Systems
publication: 23rd International Conference on Theory of Cryptography
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783032122896'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constrained verifiable random functions without obfuscation and friends
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16271
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '20847'
abstract:
- lang: eng
text: "We report on an experimental active matter system with motion restricted
to four cardinal directions. Our particles are magnetite-doped colloidal spheres
driven by the Quincke electrorotational instability. The absence of a magnetic
field (|\U0001D469|=0) leads to circular trajectories interspersed with short
spontaneous runs. Intermediate fields (|\U0001D469|≲20mT) linearize the motion
along the axis perpendicular to \U0001D469. At high magnetic fields, we observe
the surprising emergence of a second, distinct linearization along the axis parallel
to \U0001D469. With numerical simulations, we show that this behavior can be explained
by anisotropic magnetic susceptibility."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
- _id: ScienComp
- _id: LifeSc
acknowledgement: "This research was funded in whole or in part by the Austrian Science
Fund (FWF) [Grant DOI: 10.55776/ESP298]. This project has received funding from
the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (Grant\r\nAgreement No. 949120). This research was supported
by the Scientific Service Units of The Institute of Science and Technology Austria
(ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility,
Scientific Computing Facility, and Lab Support Facility. We wish to acknowledge
the crucial contributions of Alexandre Morin in getting the project off the ground,
and Jack Merrin for creating the SU-8 deposition protocol used in the construction
of our\r\ncells. We also wish to thank Kimberley Modic and Hamza Nasir for their
work on single-particle characterization. "
article_number: '065418'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Eavan
full_name: Fitzgerald, Eavan
id: 2df8ab8f-080d-11ed-979a-bfe651ca3afa
last_name: Fitzgerald
- first_name: Cécile
full_name: Clavaud, Cécile
id: 5f654c5d-04a1-11eb-ab36-ba9ffec58bd8
last_name: Clavaud
orcid: 0000-0002-1843-3803
- first_name: Debasish
full_name: Das, Debasish
last_name: Das
- first_name: Isaac C
full_name: Lenton, Isaac C
id: a550210f-223c-11ec-8182-e2d45e817efb
last_name: Lenton
orcid: 0000-0002-5010-6984
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
citation:
ama: 'Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right
angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical
Review E. 2025;112(6). doi:10.1103/1ss8-31rb'
apa: 'Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., & Waitukaitis, S.
R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic
active matter. Physical Review E. American Physical Society. https://doi.org/10.1103/1ss8-31rb'
chicago: 'Fitzgerald, Eavan, Cécile Clavaud, Debasish Das, Isaac C Lenton, and Scott
R Waitukaitis. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic
Active Matter.” Physical Review E. American Physical Society, 2025. https://doi.org/10.1103/1ss8-31rb.'
ieee: 'E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling
at right angles: Magnetic anisotropy enables dual-anisotropic active matter,”
Physical Review E, vol. 112, no. 6. American Physical Society, 2025.'
ista: 'Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. 2025. Rolling
at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical
Review E. 112(6), 065418.'
mla: 'Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables
Dual-Anisotropic Active Matter.” Physical Review E, vol. 112, no. 6, 065418,
American Physical Society, 2025, doi:10.1103/1ss8-31rb.'
short: E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical
Review E 112 (2025).
corr_author: '1'
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-01T00:00:00Z
date_updated: 2025-12-29T11:19:34Z
day: '01'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1103/1ss8-31rb
ec_funded: 1
external_id:
arxiv:
- '2508.05643'
file:
- access_level: open_access
checksum: d593e933f976c3f3cde37ad66539d57d
content_type: application/pdf
creator: dernst
date_created: 2025-12-29T11:15:42Z
date_updated: 2025-12-29T11:15:42Z
file_id: '20862'
file_name: 2025_PhysReviewE_Fitzgerald.pdf
file_size: 2131491
relation: main_file
success: 1
file_date_updated: 2025-12-29T11:15:42Z
has_accepted_license: '1'
intvolume: ' 112'
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: bd8eede5-d553-11ed-ba76-eaded0d13485
grant_number: E 298
name: 'MixQUIckR: Mixing with QUIncke Rollers'
- _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa
call_identifier: H2020
grant_number: '949120'
name: 'Tribocharge: a multi-scale approach to an enduring problem in physics'
publication: Physical Review E
publication_identifier:
eissn:
- 2470-0053
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active
matter'
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: 112
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20848'
abstract:
- lang: eng
text: 'Genetic variation that influences complex disease susceptibility is introduced
into the population by mutation and removed by natural selection and genetic drift.
This mutation–selection–drift balance (MSDB) shapes the prevalence of a disease
and its genetic architecture. To date, however, MSDB has been modeled only for
monogenic (Mendelian) diseases. Here, we develop an MSDB model for complex disease
susceptibility: we assume that genotype relates to disease risk according to the
canonical liability threshold model and that the selection on variants affecting
risk stems from the fitness cost of the disease. We focus on diseases that are
highly polygenic, entail a substantial fitness cost, and are neither extremely
common in the population nor exceedingly rare. The comparison of model predictions
with genome-wide association studies and other observations in humans indicates
that common genetic variation affecting complex disease susceptibility is little
affected by directional selection and instead shaped by pleiotropic stabilizing
selection on other traits. In turn, directional selection may exert a more substantial
effect on rare, large-effect variants. Our results also suggest that current estimates
of disease heritability are likely biased. The model thus provides a better understanding
of the evolutionary processes that shape the architecture and prevalence of complex
diseases.'
acknowledgement: We thank Nick Barton, Magnus Nordborg, John Novembre, Molly Przeworski,
and Himani Sachdeva for many helpful discussions and for comments on the manuscript,
and we thank Joshua Schraiber and 2 anonymous reviewers for comments on the manuscript.
We also thank members of the Sella, Przeworski and Andolfatto labs at Columbia University,
and the Berg, Novembre and Steinrücken labs at the University of Chicago, for feedback
on the work at various stages. This work was completed in part with resources provided
by the University of Chicago's Research Computing Center. This work was supported
by National Institutes of Health F32 grant GM126787 and R35 grant GM151257 to J.J.B.
and National Institutes of Health R01 grant GM115889 to G.S.
article_number: iyaf220
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jeremy J.
full_name: Berg, Jeremy J.
last_name: Berg
- first_name: Xinyi
full_name: Li, Xinyi
last_name: Li
- first_name: Kellen
full_name: Riall, Kellen
last_name: Riall
- first_name: Laura
full_name: Hayward, Laura
id: fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b
last_name: Hayward
- first_name: Guy
full_name: Sella, Guy
last_name: Sella
citation:
ama: Berg JJ, Li X, Riall K, Hayward L, Sella G. Mutation–selection–drift balance
models of complex diseases. Genetics. 2025;231(4). doi:10.1093/genetics/iyaf220
apa: Berg, J. J., Li, X., Riall, K., Hayward, L., & Sella, G. (2025). Mutation–selection–drift
balance models of complex diseases. Genetics. Oxford University Press.
https://doi.org/10.1093/genetics/iyaf220
chicago: Berg, Jeremy J., Xinyi Li, Kellen Riall, Laura Hayward, and Guy Sella.
“Mutation–Selection–Drift Balance Models of Complex Diseases.” Genetics.
Oxford University Press, 2025. https://doi.org/10.1093/genetics/iyaf220.
ieee: J. J. Berg, X. Li, K. Riall, L. Hayward, and G. Sella, “Mutation–selection–drift
balance models of complex diseases,” Genetics, vol. 231, no. 4. Oxford
University Press, 2025.
ista: Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift
balance models of complex diseases. Genetics. 231(4), iyaf220.
mla: Berg, Jeremy J., et al. “Mutation–Selection–Drift Balance Models of Complex
Diseases.” Genetics, vol. 231, no. 4, iyaf220, Oxford University Press,
2025, doi:10.1093/genetics/iyaf220.
short: J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-01T00:00:00Z
date_updated: 2025-12-29T11:29:16Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/genetics/iyaf220
external_id:
pmid:
- '41073879'
file:
- access_level: open_access
checksum: b02eb6b78028b8bef435edc8435a8468
content_type: application/pdf
creator: dernst
date_created: 2025-12-29T11:27:51Z
date_updated: 2025-12-29T11:27:51Z
file_id: '20863'
file_name: 2025_Genetics_Berg.pdf
file_size: 1182339
relation: main_file
success: 1
file_date_updated: 2025-12-29T11:27:51Z
has_accepted_license: '1'
intvolume: ' 231'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genetics
publication_identifier:
eissn:
- 1943-2631
issn:
- 0016-6731
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mutation–selection–drift balance models of complex diseases
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 231
year: '2025'
...
---
APC_amount: 3003,56 EUR
OA_place: publisher
OA_type: hybrid
_id: '20857'
abstract:
- lang: eng
text: 'Evolutionary games provide a flexible mathematical framework for many problems
in biology and social evolution. Prisoners’ dilemma, and in particular, the important
special case of donation games, represents social dilemmas where cooperation is
mutually beneficial, yet defection is preferred by selfish agents. In evolutionary
games on networks, the agents interact over a population structure. The existence
of population structures that promote cooperative behavior is a fascinating and
active research topic. Previous research establishes structures promoting cooperation
in the limit of weak selection where the benefit-to-cost ratio β exceeds 1.5.
The existence of such structures for medium and strong selection for 1 < ß < 2
and for weak selection for 1 < ß < 1.5 has been a long-standing open question.
First, we answer the open questions in the affirmative: For every selection strength
and every ß > 1, we construct networks promoting cooperation. Second, we present
a robustness result with respect to β and selection strength: Our structures promote
cooperation for a range of these parameter values rather than specific parameter
values. Finally, we supplement our theoretical results with simulation results
on small population structures that show the effectiveness of our construction
over well-studied population structures.'
acknowledgement: J.S. and K.C. were supported by the European Research Council CoG
863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/COE12.
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
citation:
ama: Svoboda J, Chatterjee K. Promoters of cooperation in evolutionary games. Proceedings
of the National Academy of Sciences. 2025;122(51):e2524109122. doi:10.1073/pnas.2524109122
apa: Svoboda, J., & Chatterjee, K. (2025). Promoters of cooperation in evolutionary
games. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.2524109122
chicago: Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in
Evolutionary Games.” Proceedings of the National Academy of Sciences. National
Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2524109122.
ieee: J. Svoboda and K. Chatterjee, “Promoters of cooperation in evolutionary games,”
Proceedings of the National Academy of Sciences, vol. 122, no. 51. National
Academy of Sciences, p. e2524109122, 2025.
ista: Svoboda J, Chatterjee K. 2025. Promoters of cooperation in evolutionary games.
Proceedings of the National Academy of Sciences. 122(51), e2524109122.
mla: Svoboda, Jakub, and Krishnendu Chatterjee. “Promoters of Cooperation in Evolutionary
Games.” Proceedings of the National Academy of Sciences, vol. 122, no.
51, National Academy of Sciences, 2025, p. e2524109122, doi:10.1073/pnas.2524109122.
short: J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences
122 (2025) e2524109122.
corr_author: '1'
date_created: 2025-12-28T23:01:26Z
date_published: 2025-12-15T00:00:00Z
date_updated: 2026-05-20T08:13:17Z
day: '15'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1073/pnas.2524109122
ec_funded: 1
external_id:
pmid:
- '41397136'
file:
- access_level: open_access
checksum: dd50b62a1efc28c0133fe9c11dbee53c
content_type: application/pdf
creator: dernst
date_created: 2025-12-29T09:36:50Z
date_updated: 2025-12-29T09:36:50Z
file_id: '20860'
file_name: 2025_PNAS_Svoboda.pdf
file_size: 2308124
relation: main_file
success: 1
file_date_updated: 2025-12-29T09:36:50Z
has_accepted_license: '1'
intvolume: ' 122'
issue: '51'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
page: e2524109122
pmid: 1
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Promoters of cooperation in evolutionary games
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 122
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20864'
abstract:
- lang: eng
text: Studies of the distant Universe are providing key insights into our understanding
of the formation of galaxies. The advent of the James Webb Space Telescope (JWST)
has significantly enhanced our observational capabilities, leading to an expanded
redshift frontier, providing unprecedented detail in the characterisation of early
galaxies and enabling the discovery of new populations of accreting black holes.
This review aims to provide an introduction to the basic processes and components
that shape the observed spectra of galaxies, with a focus on their relevance to
techniques with which high-redshift galaxies are selected. The review further
introduces specific topics that have attracted significant attention in recent
literature, including the discovery of highly efficient galaxy formation in the
early Universe, the relation between galaxies and the process of reionization,
new insights into the formation of the first stars and the enrichment of interstellar
gas with heavy elements, and breakthroughs in our understanding of the origins
of supermassive black holes.
acknowledgement: I thank Claudia Di Cesare, Edoardo Iani, Gauri Kotiwale and Wendy
Sun for proofreading, Daichi Kashino, Gauri Kotiwale, Sara Mascia, Benjamín Navarette
and Joris Witstok for their assistance in preparing some of the Figures, and Richard
Ellis and Stephen Blundell for constructive comments. Funded by the European Union
(ERC, AGENTS, 101076224).
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
citation:
ama: 'Matthee JJ. JWST provides a new view of cosmic dawn: Latest developments in
studies of early galaxies. Contemporary Physics. 2025;66(1-4):116-151.
doi:10.1080/00107514.2025.2586370'
apa: 'Matthee, J. J. (2025). JWST provides a new view of cosmic dawn: Latest developments
in studies of early galaxies. Contemporary Physics. Taylor & Francis.
https://doi.org/10.1080/00107514.2025.2586370'
chicago: 'Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments
in Studies of Early Galaxies.” Contemporary Physics. Taylor & Francis,
2025. https://doi.org/10.1080/00107514.2025.2586370.'
ieee: 'J. J. Matthee, “JWST provides a new view of cosmic dawn: Latest developments
in studies of early galaxies,” Contemporary Physics, vol. 66, no. 1–4.
Taylor & Francis, pp. 116–151, 2025.'
ista: 'Matthee JJ. 2025. JWST provides a new view of cosmic dawn: Latest developments
in studies of early galaxies. Contemporary Physics. 66(1–4), 116–151.'
mla: 'Matthee, Jorryt J. “JWST Provides a New View of Cosmic Dawn: Latest Developments
in Studies of Early Galaxies.” Contemporary Physics, vol. 66, no. 1–4,
Taylor & Francis, 2025, pp. 116–51, doi:10.1080/00107514.2025.2586370.'
short: J.J. Matthee, Contemporary Physics 66 (2025) 116–151.
corr_author: '1'
date_created: 2025-12-29T12:05:25Z
date_published: 2025-12-04T00:00:00Z
date_updated: 2026-04-07T08:44:00Z
day: '04'
department:
- _id: JoMa
doi: 10.1080/00107514.2025.2586370
external_id:
arxiv:
- '2511.04843'
intvolume: ' 66'
issue: 1-4
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2511.04843
month: '12'
oa: 1
oa_version: Preprint
page: 116-151
project:
- _id: bd9b2118-d553-11ed-ba76-db24564edfea
grant_number: '101076224'
name: Young galaxies as tracers and agents of cosmic reionization
publication: Contemporary Physics
publication_identifier:
eissn:
- 1366-5812
issn:
- 0010-7514
publication_status: published
publisher: Taylor & Francis
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'JWST provides a new view of cosmic dawn: Latest developments in studies of
early galaxies'
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
volume: 66
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20866'
abstract:
- lang: eng
text: In this work, we present hypernode automata as a specification formalism for
hyperproperties of systems whose executions may be misaligned among themselves,
such as concurrent systems. These automata consist of nodes labeled with hypernode
logic formulas and transitions marked with synchronizing actions. Hypernode logic
formulas establish relations between sequences of variable values among different
system executions. This logic enables both synchronous and asynchronous analysis
of traces. In its asynchronous view on execution traces, hypernode formulas establish
relations on the order of value changes for each variable without correlating
their timing. In both views, the analysis of different execution traces is synchronized
through the transitions of hypernode automata. By combining logic’s declarative
nature with automata’s procedural power, hypernode automata seamlessly integrate
asynchronicity requirements at the node level with synchronicity between node
transitions. We show that the model-checking problem for hypernode automata is
decidable for specifications where each node specifies either a synchronous or
an asynchronous requirement for the system’s executions, but not both.
acknowledgement: This work was supported in part by the Austrian Science Fund (FWF)
SFB project SpyCoDe 10.55776/F85, by the FWF projects ZK-35 and W1255-N23, and by
the ERC Advanced Grant VAMOS 101020093. Open access funding provided by Institute
of Science and Technology (IST Austria).
article_number: '43'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Ezio
full_name: Bartocci, Ezio
last_name: Bartocci
- first_name: Marek
full_name: Chalupa, Marek
id: 87e34708-d6c6-11ec-9f5b-9391e7be2463
last_name: Chalupa
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Dejan
full_name: Nickovic, Dejan
id: 41BCEE5C-F248-11E8-B48F-1D18A9856A87
last_name: Nickovic
- first_name: Ana
full_name: Oliveira da Costa, Ana
id: f347ec37-6676-11ee-b395-a888cb7b4fb4
last_name: Oliveira da Costa
orcid: 0000-0002-8741-5799
citation:
ama: Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. Hypernode
automata. Acta Informatica. 2025;62(4). doi:10.1007/s00236-025-00509-8
apa: Bartocci, E., Chalupa, M., Henzinger, T. A., Nickovic, D., & Oliveira da
Costa, A. (2025). Hypernode automata. Acta Informatica. Springer Nature.
https://doi.org/10.1007/s00236-025-00509-8
chicago: Bartocci, Ezio, Marek Chalupa, Thomas A Henzinger, Dejan Nickovic, and
Ana Oliveira da Costa. “Hypernode Automata.” Acta Informatica. Springer
Nature, 2025. https://doi.org/10.1007/s00236-025-00509-8.
ieee: E. Bartocci, M. Chalupa, T. A. Henzinger, D. Nickovic, and A. Oliveira da
Costa, “Hypernode automata,” Acta Informatica, vol. 62, no. 4. Springer
Nature, 2025.
ista: Bartocci E, Chalupa M, Henzinger TA, Nickovic D, Oliveira da Costa A. 2025.
Hypernode automata. Acta Informatica. 62(4), 43.
mla: Bartocci, Ezio, et al. “Hypernode Automata.” Acta Informatica, vol.
62, no. 4, 43, Springer Nature, 2025, doi:10.1007/s00236-025-00509-8.
short: E. Bartocci, M. Chalupa, T.A. Henzinger, D. Nickovic, A. Oliveira da Costa,
Acta Informatica 62 (2025).
corr_author: '1'
date_created: 2025-12-29T12:07:12Z
date_published: 2025-12-09T00:00:00Z
date_updated: 2026-01-05T12:27:41Z
day: '09'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/s00236-025-00509-8
ec_funded: 1
external_id:
arxiv:
- '2305.02836'
file:
- access_level: open_access
checksum: 06ed45a1218ad8464818803ae2968aaf
content_type: application/pdf
creator: dernst
date_created: 2026-01-05T12:26:43Z
date_updated: 2026-01-05T12:26:43Z
file_id: '20944'
file_name: 2025_ActaInformatica_Bartocci.pdf
file_size: 7117003
relation: main_file
success: 1
file_date_updated: 2026-01-05T12:26:43Z
has_accepted_license: '1'
intvolume: ' 62'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 34a1b658-11ca-11ed-8bc3-c75229f0241e
grant_number: F8502
name: Interface Theory for Security and Privacy
publication: Acta Informatica
publication_identifier:
eissn:
- 1432-0525
issn:
- 0001-5903
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '14405'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Hypernode automata
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: 62
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
PlanS_conform: '1'
_id: '20867'
abstract:
- lang: eng
text: We discuss the embeddability of subspaces of the Gromov–Hausdorff space, which
consists of isometry classes of compact metric spaces endowed with the Gromov–Hausdorff
distance, into Hilbert spaces. These embeddings are particularly valuable for
applications to topological data analysis. We prove that its subspace consisting
of metric spaces with at most n points has asymptotic dimension n(n−1)∕2. Thus,
there exists a coarse embedding of that space into a Hilbert space. On the contrary,
if the number of points is not bounded, then the subspace cannot be coarsely embedded
into any uniformly convex Banach space and so, in particular, into any Hilbert
space. Furthermore, we prove that, even if we restrict to finite metric spaces
whose diameter is bounded by some constant, the subspace still cannot be bi-Lipschitz
embedded into any finite-dimensional Hilbert space. We obtain both nonembeddability
results by finding obstructions to coarse and bi-Lipschitz embeddings in families
of isometry classes of finite subsets of the real line endowed with the Euclidean–Hausdorff
distance.
acknowledgement: "The author was supported by the FWF Grant, Project number I4245-N35.
The author would like to thank Thomas Weighill for the helpful discussions around
Theorem 3.10, and Takamitsu Yamauchi for bringing to my attention the fundamental
reference [35]. Furthermore, the author\r\nis thankful for the detailed and helpful
comments of the reviewer of this manuscript."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nicolò
full_name: Zava, Nicolò
id: c8b3499c-7a77-11eb-b046-aa368cbbf2ad
last_name: Zava
orcid: 0000-0001-8686-1888
citation:
ama: Zava N. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff
space into Hilbert spaces. Algebraic & Geometric Topology. 2025;25(8):5153-5174.
doi:10.2140/agt.2025.25.5153
apa: Zava, N. (2025). Coarse and bi-Lipschitz embeddability of subspaces of the
Gromov–Hausdorff space into Hilbert spaces. Algebraic & Geometric Topology.
Mathematical Sciences Publishers. https://doi.org/10.2140/agt.2025.25.5153
chicago: Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the
Gromov–Hausdorff Space into Hilbert Spaces.” Algebraic & Geometric Topology.
Mathematical Sciences Publishers, 2025. https://doi.org/10.2140/agt.2025.25.5153.
ieee: N. Zava, “Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff
space into Hilbert spaces,” Algebraic & Geometric Topology, vol. 25,
no. 8. Mathematical Sciences Publishers, pp. 5153–5174, 2025.
ista: Zava N. 2025. Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff
space into Hilbert spaces. Algebraic & Geometric Topology. 25(8), 5153–5174.
mla: Zava, Nicolò. “Coarse and Bi-Lipschitz Embeddability of Subspaces of the Gromov–Hausdorff
Space into Hilbert Spaces.” Algebraic & Geometric Topology, vol. 25,
no. 8, Mathematical Sciences Publishers, 2025, pp. 5153–74, doi:10.2140/agt.2025.25.5153.
short: N. Zava, Algebraic & Geometric Topology 25 (2025) 5153–5174.
corr_author: '1'
date_created: 2025-12-29T12:09:09Z
date_published: 2025-11-20T00:00:00Z
date_updated: 2026-01-05T12:19:09Z
day: '20'
ddc:
- '500'
department:
- _id: HeEd
doi: 10.2140/agt.2025.25.5153
external_id:
arxiv:
- '2303.04730'
file:
- access_level: open_access
checksum: 1e05b4f17a44500ae1ae1e21bc636f6a
content_type: application/pdf
creator: dernst
date_created: 2026-01-05T12:16:38Z
date_updated: 2026-01-05T12:16:38Z
file_id: '20943'
file_name: 2025_AlgebraicGeomTopology_Zava.pdf
file_size: 574389
relation: main_file
success: 1
file_date_updated: 2026-01-05T12:16:38Z
has_accepted_license: '1'
intvolume: ' 25'
issue: '8'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 5153-5174
project:
- _id: 26AD5D90-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I04245
name: Algebraic Footprints of Geometric Features in Homology
publication: Algebraic & Geometric Topology
publication_identifier:
eissn:
- 1472-2739
issn:
- 1472-2747
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
scopus_import: '1'
status: public
title: Coarse and bi-Lipschitz embeddability of subspaces of the Gromov–Hausdorff
space into Hilbert spaces
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: 25
year: '2025'
...