---
OA_place: publisher
OA_type: hybrid
_id: '19935'
abstract:
- lang: eng
text: "The separation logic framework Iris has been built on the premise that all
assertions are stable, meaning they unconditionally enjoy the famous frame rule.
This gives Iris—and the numerous program logics that build on it—very modular
reasoning principles. But stability also comes at a cost. It excludes a core feature
of the Viper verifier family, heap-dependent expression assertions, which lift
program expressions to the assertion level in order to reduce redundancy between
code and specifications and better facilitate SMT-based automation.\r\nIn this
paper, we bring heap-dependent expression assertions to Iris with Daenerys. To
do so, we must first revisit the very core of Iris, extending it with a new form
of unstable resources (and adapting the frame rule accordingly). On top, we then
build a program logic with heap-dependent expression assertions and lay the foundations
for connecting Iris to SMT solvers. We apply Daenerys to several case studies,
including some that go beyond what Viper and Iris can do individually and others
that benefit from the connection to SMT."
acknowledgement: "We would like to thank the anonymous reviewers for their helpful
feedback and Alex Summers\r\nfor insightful discussions. This work was funded in
part by a Google PhD Fellowship for the first\r\nauthor."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Simon
full_name: Spies, Simon
last_name: Spies
- first_name: Niklas
full_name: Mück, Niklas
last_name: Mück
- first_name: Haoyi
full_name: Zeng, Haoyi
last_name: Zeng
- first_name: Michael Joachim
full_name: Sammler, Michael Joachim
id: 510d3901-2a03-11ee-914d-d9ae9011f0a7
last_name: Sammler
- first_name: Andrea
full_name: Lattuada, Andrea
last_name: Lattuada
- first_name: Peter
full_name: Müller, Peter
last_name: Müller
- first_name: Derek
full_name: Dreyer, Derek
last_name: Dreyer
citation:
ama: Spies S, Mück N, Zeng H, et al. Destabilizing Iris. Proceedings of the ACM
on Programming Languages. 2025;9(PLDI):848-873. doi:10.1145/3729284
apa: Spies, S., Mück, N., Zeng, H., Sammler, M. J., Lattuada, A., Müller, P., &
Dreyer, D. (2025). Destabilizing Iris. Proceedings of the ACM on Programming
Languages. Association for Computing Machinery. https://doi.org/10.1145/3729284
chicago: Spies, Simon, Niklas Mück, Haoyi Zeng, Michael Joachim Sammler, Andrea
Lattuada, Peter Müller, and Derek Dreyer. “Destabilizing Iris.” Proceedings
of the ACM on Programming Languages. Association for Computing Machinery,
2025. https://doi.org/10.1145/3729284.
ieee: S. Spies et al., “Destabilizing Iris,” Proceedings of the ACM on
Programming Languages, vol. 9, no. PLDI. Association for Computing Machinery,
pp. 848–873, 2025.
ista: Spies S, Mück N, Zeng H, Sammler MJ, Lattuada A, Müller P, Dreyer D. 2025.
Destabilizing Iris. Proceedings of the ACM on Programming Languages. 9(PLDI),
848–873.
mla: Spies, Simon, et al. “Destabilizing Iris.” Proceedings of the ACM on Programming
Languages, vol. 9, no. PLDI, Association for Computing Machinery, 2025, pp.
848–73, doi:10.1145/3729284.
short: S. Spies, N. Mück, H. Zeng, M.J. Sammler, A. Lattuada, P. Müller, D. Dreyer,
Proceedings of the ACM on Programming Languages 9 (2025) 848–873.
corr_author: '1'
date_created: 2025-06-30T08:47:31Z
date_published: 2025-06-01T00:00:00Z
date_updated: 2025-06-30T09:10:11Z
day: '01'
ddc:
- '000'
department:
- _id: MiSa
doi: 10.1145/3729284
file:
- access_level: open_access
checksum: 6b72d84c10a10ba7cd1646e2c36dc1ff
content_type: application/pdf
creator: dernst
date_created: 2025-06-30T09:01:08Z
date_updated: 2025-06-30T09:01:08Z
file_id: '19938'
file_name: 2025_ProcACMProg_Spies.pdf
file_size: 843343
relation: main_file
success: 1
file_date_updated: 2025-06-30T09:01:08Z
has_accepted_license: '1'
intvolume: ' 9'
issue: PLDI
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 848-873
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Destabilizing Iris
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19936'
abstract:
- lang: eng
text: 'There has been a recent upsurge of interest in formal, machine-checked verification
of timing guarantees for C implementations of real-time system schedulers. However,
prior work has only considered tick-based schedulers, which enjoy a clearly defined
notion of time: the time "quantum". In this work, we present a new approach to
real-time systems verification for interrupt-free schedulers, which are commonly
used in deeply embedded and resource-constrained systems but which do not enjoy
a natural notion of periodic time. Our approach builds on and connects two recently
developed Rocq-based systems—RefinedC (for foundational C verification) and Prosa
(for verified response-time analysis)—adapting the former to reason about timed
traces and the latter to reason about overheads. We apply the resulting system,
which we call RefinedProsa, to verify Rössl, a simple yet representative, fixed-priority,
non-preemptive, interrupt-free scheduler implemented in C.'
acknowledgement: "We would like to thank the anonymous reviewers for their helpful
feedback.\r\nThis project has received funding from the European Research Council
(ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme
(grant agreement No 803111)."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Kimaya
full_name: Bedarkar, Kimaya
last_name: Bedarkar
- first_name: Laila
full_name: Elbeheiry, Laila
last_name: Elbeheiry
- first_name: Michael Joachim
full_name: Sammler, Michael Joachim
id: 510d3901-2a03-11ee-914d-d9ae9011f0a7
last_name: Sammler
- first_name: Lennard
full_name: Gäher, Lennard
last_name: Gäher
- first_name: Björn
full_name: Brandenburg, Björn
last_name: Brandenburg
- first_name: Derek
full_name: Dreyer, Derek
last_name: Dreyer
- first_name: Deepak
full_name: Garg, Deepak
last_name: Garg
citation:
ama: 'Bedarkar K, Elbeheiry L, Sammler MJ, et al. RefinedProsa: Connecting response-time
analysis with C verification for interrupt-free schedulers. Proceedings of
the ACM on Programming Languages. 2025;9(PLDI):73-97. doi:10.1145/3729249'
apa: 'Bedarkar, K., Elbeheiry, L., Sammler, M. J., Gäher, L., Brandenburg, B., Dreyer,
D., & Garg, D. (2025). RefinedProsa: Connecting response-time analysis with
C verification for interrupt-free schedulers. Proceedings of the ACM on Programming
Languages. Association for Computing Machinery. https://doi.org/10.1145/3729249'
chicago: 'Bedarkar, Kimaya, Laila Elbeheiry, Michael Joachim Sammler, Lennard Gäher,
Björn Brandenburg, Derek Dreyer, and Deepak Garg. “RefinedProsa: Connecting Response-Time
Analysis with C Verification for Interrupt-Free Schedulers.” Proceedings of
the ACM on Programming Languages. Association for Computing Machinery, 2025.
https://doi.org/10.1145/3729249.'
ieee: 'K. Bedarkar et al., “RefinedProsa: Connecting response-time analysis
with C verification for interrupt-free schedulers,” Proceedings of the ACM
on Programming Languages, vol. 9, no. PLDI. Association for Computing Machinery,
pp. 73–97, 2025.'
ista: 'Bedarkar K, Elbeheiry L, Sammler MJ, Gäher L, Brandenburg B, Dreyer D, Garg
D. 2025. RefinedProsa: Connecting response-time analysis with C verification for
interrupt-free schedulers. Proceedings of the ACM on Programming Languages. 9(PLDI),
73–97.'
mla: 'Bedarkar, Kimaya, et al. “RefinedProsa: Connecting Response-Time Analysis
with C Verification for Interrupt-Free Schedulers.” Proceedings of the ACM
on Programming Languages, vol. 9, no. PLDI, Association for Computing Machinery,
2025, pp. 73–97, doi:10.1145/3729249.'
short: K. Bedarkar, L. Elbeheiry, M.J. Sammler, L. Gäher, B. Brandenburg, D. Dreyer,
D. Garg, Proceedings of the ACM on Programming Languages 9 (2025) 73–97.
corr_author: '1'
date_created: 2025-06-30T08:47:58Z
date_published: 2025-06-13T00:00:00Z
date_updated: 2025-06-30T09:09:55Z
day: '13'
ddc:
- '000'
department:
- _id: MiSa
doi: 10.1145/3729249
file:
- access_level: open_access
checksum: 8c18d777feb342a7265c54b16205ec4c
content_type: application/pdf
creator: dernst
date_created: 2025-06-30T09:08:05Z
date_updated: 2025-06-30T09:08:05Z
file_id: '19939'
file_name: 2025_ProcACMProg_Bedarkar.pdf
file_size: 1043790
relation: main_file
success: 1
file_date_updated: 2025-06-30T09:08:05Z
has_accepted_license: '1'
intvolume: ' 9'
issue: PLDI
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 73-97
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
issn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'RefinedProsa: Connecting response-time analysis with C verification for interrupt-free
schedulers'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 9
year: '2025'
...
---
OA_type: closed access
_id: '19937'
abstract:
- lang: eng
text: Simplets are elementary units within simplicial complexes and are fundamental
for analyzing the structure of simplicial complexes. Previous efforts have mainly
focused on accurately counting or approximating the number of simplets rather
than studying their frequencies. However, analyzing simplet frequencies is more
practical for large-scale simplicial complexes. This paper introduces the Simplet
Frequency Distribution (SFD) vector, which enables the analysis of simplet frequencies
in simplicial complexes. Additionally, we provide a bound on the sample complexity
required to approximate the SFD vector using any uniform sampling-based algorithm
accurately. We extend the definition of simplet frequency distribution to encompass
simplices, allowing for the analysis of simplet frequencies within simplices of
simplicial complexes. This paper introduces the Simplet Degree Vector (SDV) and
the Simplet Degree Centrality (SDC), facilitating this analysis for each simplex.
Furthermore, we present a bound on the sample complexity required for accurately
approximating the SDV and SDC for a set of simplices using any uniform sampling-based
algorithm. We also introduce algorithms for approximating SFD, geometric SFD,
SDV, and SDC. We also validate the theoretical bounds with experiments on random
simplicial complexes and demonstrate the practical application through a case
study.
acknowledgement: "The authors would like to thank the anonymous reviewers for their
valuable comments and suggestions, which improved this paper.\r\nWork by the first
and fourth authors is partially supported by the European Research Council (ERC),
grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant
no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science
Fund (FWF), grant no. I 02979-N35."
article_number: '122425'
article_processing_charge: No
article_type: original
author:
- first_name: Mohammad
full_name: Mahini, Mohammad
last_name: Mahini
- first_name: Hamid
full_name: Beigy, Hamid
last_name: Beigy
- first_name: Salman
full_name: Qadami, Salman
last_name: Qadami
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
citation:
ama: 'Mahini M, Beigy H, Qadami S, Saghafian M. Simplet-based signatures and approximation
in simplicial complexes: Frequency, degree, and centrality. Information Sciences.
2025;719(11). doi:10.1016/j.ins.2025.122425'
apa: 'Mahini, M., Beigy, H., Qadami, S., & Saghafian, M. (2025). Simplet-based
signatures and approximation in simplicial complexes: Frequency, degree, and centrality.
Information Sciences. Elsevier. https://doi.org/10.1016/j.ins.2025.122425'
chicago: 'Mahini, Mohammad, Hamid Beigy, Salman Qadami, and Morteza Saghafian. “Simplet-Based
Signatures and Approximation in Simplicial Complexes: Frequency, Degree, and Centrality.”
Information Sciences. Elsevier, 2025. https://doi.org/10.1016/j.ins.2025.122425.'
ieee: 'M. Mahini, H. Beigy, S. Qadami, and M. Saghafian, “Simplet-based signatures
and approximation in simplicial complexes: Frequency, degree, and centrality,”
Information Sciences, vol. 719, no. 11. Elsevier, 2025.'
ista: 'Mahini M, Beigy H, Qadami S, Saghafian M. 2025. Simplet-based signatures
and approximation in simplicial complexes: Frequency, degree, and centrality.
Information Sciences. 719(11), 122425.'
mla: 'Mahini, Mohammad, et al. “Simplet-Based Signatures and Approximation in Simplicial
Complexes: Frequency, Degree, and Centrality.” Information Sciences, vol.
719, no. 11, 122425, Elsevier, 2025, doi:10.1016/j.ins.2025.122425.'
short: M. Mahini, H. Beigy, S. Qadami, M. Saghafian, Information Sciences 719 (2025).
corr_author: '1'
date_created: 2025-06-30T08:48:48Z
date_published: 2025-11-01T00:00:00Z
date_updated: 2025-12-30T09:05:32Z
day: '01'
department:
- _id: HeEd
doi: 10.1016/j.ins.2025.122425
ec_funded: 1
external_id:
isi:
- '001516170500002'
intvolume: ' 719'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa_version: None
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: Information Sciences
publication_identifier:
issn:
- 0020-0255
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Simplet-based signatures and approximation in simplicial complexes: Frequency,
degree, and centrality'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 719
year: '2025'
...
---
_id: '19956'
abstract:
- lang: eng
text: The specific introduction of 1H-13C or 1H-15N moieties into otherwise deuterated
proteins holds great potential for high-resolution solution and magic-angle spinning
(MAS) NMR studies of protein structure and dynamics. Arginine residues play key
roles for example at active sites of enzymes. Taking advantage of a chemically
synthesized Arg with a 13C-1H2 group in an otherwise deuterated backbone, we demonstrate
here the usefulness of proton-detected arginine MAS NMR approaches to probe arginine
dynamics. In experiments on crystalline ubiquitin and the 134 kDa tetrameric enzyme
malate dehydrogenase we detected a wide range of motions, from sites that are
rigid on time scales of at least tens of milliseconds to residues undergoing predominantly
nanosecond motions. Spin-relaxation and dipolar-coupling measurements enabled
quantitative determination of these dynamics. We observed microsecond dynamics
of residue Arg54 in crystalline ubiquitin, whose backbone is known to sample different
β-turn conformations on this time scale. The labeling scheme and experiments presented
here expand the toolkit for high-resolution proton-detected MAS NMR
acknowledged_ssus:
- _id: NMR
- _id: LifeSc
article_processing_charge: No
author:
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Schanda P. Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific
Isotope-Labeling Scheme. 2025. doi:10.15479/AT-ISTA-19956
apa: Schanda, P. (2025). Arginine Dynamics Probed by Magic-Angle Spinning NMR with
a Specific Isotope-Labeling Scheme. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT-ISTA-19956
chicago: Schanda, Paul. “Arginine Dynamics Probed by Magic-Angle Spinning NMR with
a Specific Isotope-Labeling Scheme.” Institute of Science and Technology Austria,
2025. https://doi.org/10.15479/AT-ISTA-19956.
ieee: P. Schanda, “Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific
Isotope-Labeling Scheme.” Institute of Science and Technology Austria, 2025.
ista: Schanda P. 2025. Arginine Dynamics Probed by Magic-Angle Spinning NMR with
a Specific Isotope-Labeling Scheme, Institute of Science and Technology Austria,
10.15479/AT-ISTA-19956.
mla: Schanda, Paul. Arginine Dynamics Probed by Magic-Angle Spinning NMR with
a Specific Isotope-Labeling Scheme. Institute of Science and Technology Austria,
2025, doi:10.15479/AT-ISTA-19956.
short: P. Schanda, (2025).
contributor:
- contributor_type: researcher
first_name: Darja
last_name: Rohden
- contributor_type: researcher
first_name: Federico
last_name: Napoli
- contributor_type: researcher
first_name: Ben
last_name: Tatman
- contributor_type: researcher
first_name: Paul
last_name: Schanda
corr_author: '1'
date_created: 2025-07-03T04:21:37Z
date_published: 2025-07-03T00:00:00Z
date_updated: 2025-12-29T14:52:16Z
day: '03'
ddc:
- '572'
department:
- _id: PaSc
doi: 10.15479/AT-ISTA-19956
file:
- access_level: open_access
checksum: a2ef61aa9fb5313c7d426913eb0482c0
content_type: application/octet-stream
creator: pschanda
date_created: 2025-07-03T10:30:14Z
date_updated: 2025-07-03T10:30:14Z
file_id: '19960'
file_name: README
file_size: 1160
relation: main_file
success: 1
- access_level: open_access
checksum: 8fb77b96d0fcc95c9903005652207a8c
content_type: application/zip
creator: pschanda
date_created: 2025-07-03T10:30:55Z
date_updated: 2025-07-03T10:30:55Z
file_id: '19961'
file_name: data_Arg_MASNMR_Rohden.zip
file_size: 128597184
relation: main_file
success: 1
- access_level: open_access
checksum: a60cc16d20b089c4bef94040a99cfba5
content_type: application/x-xz
creator: pschanda
date_created: 2025-08-14T07:06:58Z
date_updated: 2025-08-14T07:06:58Z
file_id: '20172'
file_name: 20240903_ubi_DN_Argd1C13_2D_spectra.tar.xz
file_size: 4766564
relation: main_file
success: 1
file_date_updated: 2025-08-14T07:06:58Z
has_accepted_license: '1'
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '07'
oa: 1
oa_version: None
project:
- _id: eb9c82eb-77a9-11ec-83b8-aadd536561cf
grant_number: I05812
name: AlloSpace. The emergence and mechanisms of allostery
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '20258'
relation: used_in_publication
status: public
status: public
title: Arginine Dynamics Probed by Magic-Angle Spinning NMR with a Specific Isotope-Labeling
Scheme
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '19963'
abstract:
- lang: eng
text: The acquisition of cellular identity requires large-scale alterations in cellular
state. The noncanonical proteasome activator PSME3 is known to regulate diverse
cellular processes, but its importance for differentiation remains unclear. Here,
we demonstrate that PSME3 binds dynamically to highly active promoters over the
course of differentiation. However, loss of PSME3 does not globally affect mRNA
transcription. We find instead that PSME3 influences the levels of several adhesion-related
proteins and acts upstream of the HSP90 co-chaperone NUDC to regulate cell motility
and myoblast differentiation in a proteasome-independent manner. Our findings
reveal several new facets of PSME3 functionality and highlight its importance
for the differentiation of myogenic cells.
acknowledged_ssus:
- _id: LifeSc
- _id: Bio
acknowledgement: 'All proteomics analysis was done by the ISTA LSF Mass Spectrometry
Service: Ewelina Dutkiewicz-Kopczynska processed the samples (digest and cleanup);
Bella Bruszel optimized the acquisition methods, acquired the data, and performed
all searches; and Armel Nicolas provided pre- and post-project consulting and post-processed
the search results using a development version of their data analysis package, proteoCraft
(publication pending). The authors would like to thank Saki for their clarity of
thought and insight, as well as Dr. Lorenzo Puri and the members of his laboratory
for invaluable discussions relating to the project. This research was further supported
by the Lab Support Facility and the Imaging and Optics Facility of ISTA.'
article_number: e202503208
article_processing_charge: Yes
article_type: original
author:
- first_name: Kenneth D
full_name: Kuhn, Kenneth D
id: 7deed7e0-0133-11f0-8590-c4600b08d0f4
last_name: Kuhn
- first_name: Ukrae H.
full_name: Cho, Ukrae H.
last_name: Cho
- first_name: Martin W
full_name: Hetzer, Martin W
id: 86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed
last_name: Hetzer
orcid: 0000-0002-2111-992X
citation:
ama: Kuhn KD, Cho UH, Hetzer M. PSME3 regulates migration and differentiation of
myoblasts. Life Science Alliance. 2025;8(9). doi:10.26508/lsa.202503208
apa: Kuhn, K. D., Cho, U. H., & Hetzer, M. (2025). PSME3 regulates migration
and differentiation of myoblasts. Life Science Alliance. Embo Press. https://doi.org/10.26508/lsa.202503208
chicago: Kuhn, Kenneth D, Ukrae H. Cho, and Martin Hetzer. “PSME3 Regulates Migration
and Differentiation of Myoblasts.” Life Science Alliance. Embo Press, 2025.
https://doi.org/10.26508/lsa.202503208.
ieee: K. D. Kuhn, U. H. Cho, and M. Hetzer, “PSME3 regulates migration and differentiation
of myoblasts,” Life Science Alliance, vol. 8, no. 9. Embo Press, 2025.
ista: Kuhn KD, Cho UH, Hetzer M. 2025. PSME3 regulates migration and differentiation
of myoblasts. Life Science Alliance. 8(9), e202503208.
mla: Kuhn, Kenneth D., et al. “PSME3 Regulates Migration and Differentiation of
Myoblasts.” Life Science Alliance, vol. 8, no. 9, e202503208, Embo Press,
2025, doi:10.26508/lsa.202503208.
short: K.D. Kuhn, U.H. Cho, M. Hetzer, Life Science Alliance 8 (2025).
corr_author: '1'
date_created: 2025-07-06T22:01:22Z
date_published: 2025-09-01T00:00:00Z
date_updated: 2025-12-30T09:17:55Z
day: '01'
ddc:
- '570'
department:
- _id: MaHe
doi: 10.26508/lsa.202503208
external_id:
isi:
- '001511452100001'
pmid:
- '40537284'
file:
- access_level: open_access
checksum: 591d47aa39fc969986c7d3b966890f5f
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T09:17:09Z
date_updated: 2025-12-30T09:17:09Z
file_id: '20904'
file_name: 2025_LifeScienceAlliance_Kuhn.pdf
file_size: 5471288
relation: main_file
success: 1
file_date_updated: 2025-12-30T09:17:09Z
has_accepted_license: '1'
intvolume: ' 8'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
publication: Life Science Alliance
publication_identifier:
eissn:
- 2575-1077
publication_status: published
publisher: Embo Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: PSME3 regulates migration and differentiation of myoblasts
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: 8
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19964'
abstract:
- lang: eng
text: It has been suggested that giant planet occurrence peaks for stars with M*
≈ 3 M⊙ at a value a factor of 4 higher than observed for solar-mass stars. This
population of giant planets predicted to frequently orbit main-sequence B stars
at a ≈ 10 au is difficult to characterize during the few hundred million years
while fusion persists in their host stars. By the time those stars become massive,
young white dwarfs, any giant planets present would still be luminous as a consequence
of their recent formation. From an initial sample of 2195 Gaia-identified massive,
young white dwarfs, we use homogeneous Spitzer Infrared Array Camera (IRAC) photometry
to search for evidence of unresolved giant planets. For 30 systems, these IRAC
data provide sensitivity to objects with M ≲ 10 MJup, and we identify one candidate
with M ≈ 4 MJup orbiting the white dwarf GALEX J071816.4+373139. Correcting for
the possibility that some of the white dwarfs in our sample result from mergers,
we find a giant planet occurrence n GP = 0.11+0.13-0.07 for stars with initial
masses M* ≳ 3 M⊙. Our occurrence inference is consistent with both the Doppler-inferred
occurrence of giant planets orbiting M* ≈ 2 M⊙ giant stars and the theoretically
predicted factor of 4 enhancement in the occurrence of giant planets orbiting
M* ≈ 3 M⊙ stars relative to solar-mass stars. Future James Webb Space Telescope
NIRCam observations of our sample would provide sensitivity to Saturn-mass planets
and thereby a definitive estimate of the occurrence of giant planets orbiting
stars with M* ≳ 3 M⊙.
acknowledgement: "We thank Jay Farihi, Guangwei Fu, J. J. Hermes, Mary Anne Limbach,
and Daniel Thorngren for useful discussions. S.C. thanks Siyu Yao for her constant
inspiration and encouragement. S.C. acknowledges the support of the Martin A. and
Helen Chooljian Member Fund, funding from the Zurich Insurance Company, and the
Fund for Natural Sciences at the Institute for Advanced Study. This work has made
use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia),
processed by the Gaia Data Processing and Analysis Consortium (DPAC; https://www.cosmos.esa.int/web/gaia/dpac/consortium).
Funding for the DPAC has been provided by national institutions, in particular the
institutions participating in the Gaia Multilateral Agreement. This work is based
in part on observations made with the Spitzer Space Telescope, which is operated
by the Jet Propulsion Laboratory, California Institute of Technology under a contract
with NASA. This publication makes use of data products from the Wide-field Infrared
Survey Explorer, which is a joint project of the University of California, Los Angeles,
and the Jet Propulsion Laboratory/California Institute of Technology, funded by
the National Aeronautics and Space Administration. This research has made use of
the NASA Exoplanet Archive, which is operated by the California Institute of Technology,
under contract with the National Aeronautics and Space Administration under the
Exoplanet Exploration Program. This research has made use of NASA’s Astrophysics
Data System.\r\nFacilities: ADS - , ESO:VISTA - European Southern Observatory's
4.1 meter Visible and Infrared Survey Telescope for Astronomy, Exoplanet Archive
- , Gaia - , IRSA - , NEOWISE - , Spitzer - Spitzer Space Telescope satellite, UKIRT
- United Kingdom Infrared Telescope, WISE - Wide-field Infrared Survey Explorer.\r\nSoftware:
astropy (Astropy Collaboration et al. 2013, 2018, 2022), numpy (C. R. Harris et
al. 2020), matplotlib (J. D. Hunter 2007), R (R Core Team 2024), SciPy (P. Virtanen
et al. 2020)."
article_number: '47'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Sihao
full_name: Cheng, Sihao
last_name: Cheng
- first_name: Kevin C.
full_name: Schlaufman, Kevin C.
last_name: Schlaufman
- first_name: Ilaria
full_name: Caiazzo, Ilaria
id: 8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d
last_name: Caiazzo
orcid: 0000-0002-4770-5388
citation:
ama: Cheng S, Schlaufman KC, Caiazzo I. A candidate giant planet companion to the
massive, young White Dwarf GALEX J071816.4+373139 informs the occurrence of giant
planets orbiting B stars. The Astronomical Journal. 2025;170(1). doi:10.3847/1538-3881/addd21
apa: Cheng, S., Schlaufman, K. C., & Caiazzo, I. (2025). A candidate giant planet
companion to the massive, young White Dwarf GALEX J071816.4+373139 informs the
occurrence of giant planets orbiting B stars. The Astronomical Journal.
IOP Publishing. https://doi.org/10.3847/1538-3881/addd21
chicago: Cheng, Sihao, Kevin C. Schlaufman, and Ilaria Caiazzo. “A Candidate Giant
Planet Companion to the Massive, Young White Dwarf GALEX J071816.4+373139 Informs
the Occurrence of Giant Planets Orbiting B Stars.” The Astronomical Journal.
IOP Publishing, 2025. https://doi.org/10.3847/1538-3881/addd21.
ieee: S. Cheng, K. C. Schlaufman, and I. Caiazzo, “A candidate giant planet companion
to the massive, young White Dwarf GALEX J071816.4+373139 informs the occurrence
of giant planets orbiting B stars,” The Astronomical Journal, vol. 170,
no. 1. IOP Publishing, 2025.
ista: Cheng S, Schlaufman KC, Caiazzo I. 2025. A candidate giant planet companion
to the massive, young White Dwarf GALEX J071816.4+373139 informs the occurrence
of giant planets orbiting B stars. The Astronomical Journal. 170(1), 47.
mla: Cheng, Sihao, et al. “A Candidate Giant Planet Companion to the Massive, Young
White Dwarf GALEX J071816.4+373139 Informs the Occurrence of Giant Planets Orbiting
B Stars.” The Astronomical Journal, vol. 170, no. 1, 47, IOP Publishing,
2025, doi:10.3847/1538-3881/addd21.
short: S. Cheng, K.C. Schlaufman, I. Caiazzo, The Astronomical Journal 170 (2025).
date_created: 2025-07-06T22:01:22Z
date_published: 2025-07-01T00:00:00Z
date_updated: 2026-02-19T09:31:41Z
day: '01'
ddc:
- '520'
department:
- _id: IlCa
doi: 10.3847/1538-3881/addd21
external_id:
arxiv:
- '2408.03985'
isi:
- '001514518100001'
file:
- access_level: open_access
checksum: 144b0e46aa3dff0cdf8c6ee7d4fe2fe4
content_type: application/pdf
creator: dernst
date_created: 2025-07-08T06:40:54Z
date_updated: 2025-07-08T06:40:54Z
file_id: '19975'
file_name: 2025_AstronomicalJour_Cheng.pdf
file_size: 931173
relation: main_file
success: 1
file_date_updated: 2025-07-08T06:40:54Z
has_accepted_license: '1'
intvolume: ' 170'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: The Astronomical Journal
publication_identifier:
eissn:
- 1538-3881
issn:
- 0004-6256
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: A candidate giant planet companion to the massive, young White Dwarf GALEX
J071816.4+373139 informs the occurrence of giant planets orbiting B stars
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: 170
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '19965'
abstract:
- lang: eng
text: Multiagent learning is challenging when agents face mixed-motivation interactions,
where conflicts of interest arise as agents independently try to optimize their
respective outcomes. Recent advancements in evolutionary game theory have identified
a class of “zero-determinant” strategies, which confer an agent with significant
unilateral control over outcomes in repeated games. Building on these insights,
we present a comprehensive generalization of zero-determinant strategies to stochastic
games, encompassing dynamic environments. We propose an algorithm that allows
an agent to discover strategies enforcing predetermined linear (or approximately
linear) payoff relationships. Of particular interest is the relationship in which
both payoffs are equal, which serves as a proxy for fairness in symmetric games.
We demonstrate that an agent can discover strategies enforcing such relationships
through experience alone, without coordinating with an opponent. In finding and
using such a strategy, an agent (“enforcer”) can incentivize optimal and equitable
outcomes, circumventing potential exploitation. In particular, from the opponent’s
viewpoint, the enforcer transforms a mixed-motivation problem into a cooperative
problem, paving the way for more collaboration and fairness in multiagent systems.
acknowledgement: 'We gratefully acknowledge the support from the European Research
Council (Starting Grant 850529: E-DIRECT) and the Max Planck Society (C.H.), the
European Research Council (Consolidator Grant 863818: ForM-SMArt) (K.C.), the Shanghai
Pujiang Program (No. 23PJ1405500) (Q.S.), the Army Research Office (Grant No. W911NF-18-1-0325)
(N.E.L.), and the John Templeton Foundation (Grant No. 62281) (J.B.P.).'
article_number: e2319927121
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Alex
full_name: Mcavoy, Alex
last_name: Mcavoy
- first_name: Udari Madhushani
full_name: Sehwag, Udari Madhushani
last_name: Sehwag
- first_name: Christian
full_name: Hilbe, Christian
id: 2FDF8F3C-F248-11E8-B48F-1D18A9856A87
last_name: Hilbe
orcid: 0000-0001-5116-955X
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Wolfram
full_name: Barfuss, Wolfram
last_name: Barfuss
- first_name: Qi
full_name: Su, Qi
last_name: Su
- first_name: Naomi Ehrich
full_name: Leonard, Naomi Ehrich
last_name: Leonard
- first_name: Joshua B.
full_name: Plotkin, Joshua B.
last_name: Plotkin
citation:
ama: Mcavoy A, Sehwag UM, Hilbe C, et al. Unilateral incentive alignment in two-agent
stochastic games. Proceedings of the National Academy of Sciences. 2025;122(25).
doi:10.1073/pnas.2319927121
apa: Mcavoy, A., Sehwag, U. M., Hilbe, C., Chatterjee, K., Barfuss, W., Su, Q.,
… Plotkin, J. B. (2025). Unilateral incentive alignment in two-agent stochastic
games. Proceedings of the National Academy of Sciences. National Academy
of Sciences. https://doi.org/10.1073/pnas.2319927121
chicago: Mcavoy, Alex, Udari Madhushani Sehwag, Christian Hilbe, Krishnendu Chatterjee,
Wolfram Barfuss, Qi Su, Naomi Ehrich Leonard, and Joshua B. Plotkin. “Unilateral
Incentive Alignment in Two-Agent Stochastic Games.” Proceedings of the National
Academy of Sciences. National Academy of Sciences, 2025. https://doi.org/10.1073/pnas.2319927121.
ieee: A. Mcavoy et al., “Unilateral incentive alignment in two-agent stochastic
games,” Proceedings of the National Academy of Sciences, vol. 122, no.
25. National Academy of Sciences, 2025.
ista: Mcavoy A, Sehwag UM, Hilbe C, Chatterjee K, Barfuss W, Su Q, Leonard NE, Plotkin
JB. 2025. Unilateral incentive alignment in two-agent stochastic games. Proceedings
of the National Academy of Sciences. 122(25), e2319927121.
mla: Mcavoy, Alex, et al. “Unilateral Incentive Alignment in Two-Agent Stochastic
Games.” Proceedings of the National Academy of Sciences, vol. 122, no.
25, e2319927121, National Academy of Sciences, 2025, doi:10.1073/pnas.2319927121.
short: A. Mcavoy, U.M. Sehwag, C. Hilbe, K. Chatterjee, W. Barfuss, Q. Su, N.E.
Leonard, J.B. Plotkin, Proceedings of the National Academy of Sciences 122 (2025).
date_created: 2025-07-06T22:01:23Z
date_published: 2025-06-24T00:00:00Z
date_updated: 2025-09-30T13:47:14Z
day: '24'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1073/pnas.2319927121
ec_funded: 1
external_id:
isi:
- '001522351900001'
pmid:
- '40523172'
file:
- access_level: open_access
checksum: 3b35befd959a3e37aa9080a64a6afaf3
content_type: application/pdf
creator: dernst
date_created: 2025-07-08T05:52:26Z
date_updated: 2025-07-08T05:52:26Z
file_id: '19972'
file_name: 2025_PNAS_McAvoy.pdf
file_size: 29525932
relation: main_file
success: 1
file_date_updated: 2025-07-08T05:52:26Z
has_accepted_license: '1'
intvolume: ' 122'
isi: 1
issue: '25'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '06'
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: Proceedings of the National Academy of Sciences
publication_identifier:
eissn:
- 1091-6490
issn:
- 0027-8424
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Unilateral incentive alignment in two-agent stochastic 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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 122
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '19966'
abstract:
- lang: eng
text: Recently discovered nanofluidic memristors, have raised promises for the development
of iontronics and neuromorphic computing with ions. Ionic memory effects are related
to ion dynamics inside nanochannels, with timescales associated with the manifold
physicochemical phenomena occurring at confined interfaces. Here, we explore experimentally
the frequency-dependent current–voltage response of model nanochannels—namely
glass nanopipettes—to investigate memory effects in ion transport. This characterisation,
which we refer to as mem-spectrometry, highlights two characteristic frequencies,
associated with short and long timescales of the order of 50 ms and 50 s in the
present system. Whereas the former can be associated with ionic diffusion, very
long timescales are difficult to explain with conventional transport phenomena.
We develop a minimal model accounting for these mem-spectrometry results, pointing
to surface charge regulation and ionic adsorption-desorption as possible origins
for the long-term memory. Our work demonstrates the relevance of mem-spectrometry
to highlight subtle ion transport properties in nanochannels, giving hereby new
insights on the mechanisms governing ion transport and current rectification in
charged conical nanopores.
acknowledgement: The authors acknowledge ERC n-AQUA for funding. S J acknowledges
CNRS for funding. The authors thank Hummink for pipette supply and characterization.
P R acknowledges funding from the European Union Horizon 2020 research and innovation
program under the Marie Skodowska-Curie Grant Agreement No. 101034413.
article_number: '065001'
article_processing_charge: Yes
article_type: original
author:
- first_name: Simon
full_name: Jouveshomme, Simon
last_name: Jouveshomme
- first_name: Mathieu
full_name: Lizée, Mathieu
last_name: Lizée
- first_name: Paul
full_name: Robin, Paul
id: 48c58128-57b0-11ee-9095-dc28fd97fc1d
last_name: Robin
orcid: 0000-0002-5728-9189
- first_name: Lydéric
full_name: Bocquet, Lydéric
last_name: Bocquet
citation:
ama: Jouveshomme S, Lizée M, Robin P, Bocquet L. Multiple ionic memories in asymmetric
nanochannels revealed by mem-spectrometry. New Journal of Physics. 2025;27(6).
doi:10.1088/1367-2630/ade61b
apa: Jouveshomme, S., Lizée, M., Robin, P., & Bocquet, L. (2025). Multiple ionic
memories in asymmetric nanochannels revealed by mem-spectrometry. New Journal
of Physics. IOP Publishing. https://doi.org/10.1088/1367-2630/ade61b
chicago: Jouveshomme, Simon, Mathieu Lizée, Paul Robin, and Lydéric Bocquet. “Multiple
Ionic Memories in Asymmetric Nanochannels Revealed by Mem-Spectrometry.” New
Journal of Physics. IOP Publishing, 2025. https://doi.org/10.1088/1367-2630/ade61b.
ieee: S. Jouveshomme, M. Lizée, P. Robin, and L. Bocquet, “Multiple ionic memories
in asymmetric nanochannels revealed by mem-spectrometry,” New Journal of Physics,
vol. 27, no. 6. IOP Publishing, 2025.
ista: Jouveshomme S, Lizée M, Robin P, Bocquet L. 2025. Multiple ionic memories
in asymmetric nanochannels revealed by mem-spectrometry. New Journal of Physics.
27(6), 065001.
mla: Jouveshomme, Simon, et al. “Multiple Ionic Memories in Asymmetric Nanochannels
Revealed by Mem-Spectrometry.” New Journal of Physics, vol. 27, no. 6,
065001, IOP Publishing, 2025, doi:10.1088/1367-2630/ade61b.
short: S. Jouveshomme, M. Lizée, P. Robin, L. Bocquet, New Journal of Physics 27
(2025).
date_created: 2025-07-06T22:01:23Z
date_published: 2025-06-01T00:00:00Z
date_updated: 2025-09-30T13:47:45Z
day: '01'
ddc:
- '530'
department:
- _id: EdHa
doi: 10.1088/1367-2630/ade61b
ec_funded: 1
external_id:
isi:
- '001517731700001'
file:
- access_level: open_access
checksum: e0e11aa01c54b20ee6cdd1f6b999571f
content_type: application/pdf
creator: dernst
date_created: 2025-07-08T06:11:59Z
date_updated: 2025-07-08T06:11:59Z
file_id: '19973'
file_name: 2025_NewJourPhysics_Jouveshomme.pdf
file_size: 1296141
relation: main_file
success: 1
file_date_updated: 2025-07-08T06:11:59Z
has_accepted_license: '1'
intvolume: ' 27'
isi: 1
issue: '6'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: New Journal of Physics
publication_identifier:
eissn:
- 1367-2630
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multiple ionic memories in asymmetric nanochannels revealed by mem-spectrometry
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 27
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '19967'
abstract:
- lang: eng
text: "Context. Investigating the ionizing emission of star-forming galaxies and
the escape fraction of ionizing photons is critical to understanding their contribution
to reionization and their impact on the surrounding environment. The number of
ionizing photons available to reionize the intergalactic medium (IGM) depends
on not only the abundance of galaxies but also their efficiency in producing ionizing
photons (ξion). This quantity is thus fundamental to quantify the role of faint
versus bright sources in driving this process, as we must assess their relative
contribution to the total ionizing emissivity.\r\n\r\nAims. Our goal is to estimate
the ξion using Balmer lines (Hα or Hβ) in a sample of 761 galaxies at 4 ≤ z ≤ 10
selected from different JWST spectroscopic surveys. We aim to determine the redshift
evolution of ξion and the relation of ξion with the physical properties of the
galaxies.\r\n\r\nMethods. We used the available HST and JWST photometry to perform
a spectral energy distribution (SED) fitting in the sample to determine their
physical properties and relate them with ξion. We used the BAGPIPES code for the
SED fitting and assumed a delayed exponential model for the star formation history.
We used the NIRSpec spectra from prism or grating configurations to estimate Balmer
luminosities, and then constrained ξion values after dust correction.\r\n\r\nResults.
We find a mean value of 1025.22 Hz erg−1 for ξion in the sample with an observed
scatter of 0.42 dex. We find an increase in the median values of ξion with redshift
from 1025.09 Hz erg−1 at z ∼ 4.18 to 1025.28 Hz erg−1 at z ∼ 7.14, confirming
the redshift evolution of ξion found in other studies. Regarding the relation
between ξion and physical properties, we find a decrease in ξion with increasing
stellar mass, indicating that low-mass galaxies are efficient producers of ionizing
photons. We also find an increase in ξion with increasing specific star formation
rate (sSFR) and increasing UV absolute magnitude. This indicates that faint galaxies
and galaxies with high sSFR are also efficient producers. We also investigated
the relation of ξion with the rest-frame equivalent width (EW) of [OIII]λ5007
and find that galaxies with the higher EW([OIII]λ5007) are more efficient producers
of ionizing photons, with the best fit leading to the relation log(ξion) = 0.43 × log(EW[OIII])+23.99.
Similarly, we find that galaxies with higher O32 = [OIII]λ5007/[OII]λλ3727,3729
and lower gas-phase metallicities (based on the R23 = ([OIII]λλ4959,5007+[OII]λλ3727,3729)/Hβ
calibration) show higher ξion values."
acknowledgement: We thank the anonymous referee for the detailed review and useful
suggestions that helped to improve this paper. We wish to thank all our colleagues
in the CEERS collaboration for their hard work and valuable contributions to this
project. We thank Pietro Bergamini for providing us with the magnification factors
for the lensed sources. MLl acknowledges support from the INAF Large Grant 2022
“Extragalactic Surveys with JWST” (PI L. Pentericci), the PRIN 2022 MUR project
2022CB3PJ3 – First Light And Galaxy aSsembly (FLAGS) funded by the European Union
– Next Generation EU, and INAF Mini-grant “Galaxies in the epoch of Reionization
and their analogs at lower redshift” (PI M. Llerena). RA acknowledges support of
grant PID2023-147386NB-I00 funded by MICIU/AEI/10.13039/501100011033 and by ERDF/EU,
and the Severo Ochoa grant CEX2021-001131-S This work is based on observations made
with the NASA/ESA/CSA James Webb Space Telescope (JWST). The JWST data presented
in this article were obtained from the Mikulski Archive for Space Telescopes (MAST)
at the Space Telescope Science Institute. The specific observations analyzed are
associated with program JWST-GO-3073 and can be accessed via DOI. We acknowledge
support from INAF Mini-grant “Reionization and Fundamental Cosmology with High-Redshift
Galaxies”. This work has made extensive use of Python packages astropy (Astropy
Collaboration 2018), numpy (Harris et al. 2020), Matplotlib (Hunter 2007) and LiMe
(Fernández et al. 2024).
article_number: A302
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: M.
full_name: Llerena, M.
last_name: Llerena
- first_name: L.
full_name: Pentericci, L.
last_name: Pentericci
- first_name: L.
full_name: Napolitano, L.
last_name: Napolitano
- first_name: Sara
full_name: Mascia, Sara
id: edaf889c-c7cd-11ef-ab1b-bb28c431bd29
last_name: Mascia
- first_name: R.
full_name: Amorín, R.
last_name: Amorín
- first_name: A.
full_name: Calabrò, A.
last_name: Calabrò
- first_name: M.
full_name: Castellano, M.
last_name: Castellano
- first_name: N. J.
full_name: Cleri, N. J.
last_name: Cleri
- first_name: M.
full_name: Giavalisco, M.
last_name: Giavalisco
- first_name: N. A.
full_name: Grogin, N. A.
last_name: Grogin
- first_name: N. P.
full_name: Hathi, N. P.
last_name: Hathi
- first_name: M.
full_name: Hirschmann, M.
last_name: Hirschmann
- first_name: A. M.
full_name: Koekemoer, A. M.
last_name: Koekemoer
- first_name: T.
full_name: Nanayakkara, T.
last_name: Nanayakkara
- first_name: F.
full_name: Pacucci, F.
last_name: Pacucci
- first_name: L.
full_name: Shen, L.
last_name: Shen
- first_name: S. M.
full_name: Wilkins, S. M.
last_name: Wilkins
- first_name: I.
full_name: Yoon, I.
last_name: Yoon
- first_name: L. Y.A.
full_name: Yung, L. Y.A.
last_name: Yung
- first_name: R.
full_name: Bhatawdekar, R.
last_name: Bhatawdekar
- first_name: R. A.
full_name: Lucas, R. A.
last_name: Lucas
- first_name: X.
full_name: Wang, X.
last_name: Wang
- first_name: P.
full_name: Arrabal Haro, P.
last_name: Arrabal Haro
- first_name: M. B.
full_name: Bagley, M. B.
last_name: Bagley
- first_name: S. L.
full_name: Finkelstein, S. L.
last_name: Finkelstein
- first_name: J. S.
full_name: Kartaltepe, J. S.
last_name: Kartaltepe
- first_name: E.
full_name: Merlin, E.
last_name: Merlin
- first_name: C.
full_name: Papovich, C.
last_name: Papovich
- first_name: N.
full_name: Pirzkal, N.
last_name: Pirzkal
- first_name: P.
full_name: Santini, P.
last_name: Santini
citation:
ama: Llerena M, Pentericci L, Napolitano L, et al. The ionizing photon production
efficiency of star-forming galaxies at z ∼ 4–10. Astronomy & Astrophysics.
2025;698. doi:10.1051/0004-6361/202453251
apa: Llerena, M., Pentericci, L., Napolitano, L., Mascia, S., Amorín, R., Calabrò,
A., … Santini, P. (2025). The ionizing photon production efficiency of star-forming
galaxies at z ∼ 4–10. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202453251
chicago: Llerena, M., L. Pentericci, L. Napolitano, Sara Mascia, R. Amorín, A. Calabrò,
M. Castellano, et al. “The Ionizing Photon Production Efficiency of Star-Forming
Galaxies at z ∼ 4–10.” Astronomy & Astrophysics. EDP Sciences, 2025.
https://doi.org/10.1051/0004-6361/202453251.
ieee: M. Llerena et al., “The ionizing photon production efficiency of star-forming
galaxies at z ∼ 4–10,” Astronomy & Astrophysics, vol. 698. EDP Sciences,
2025.
ista: Llerena M, Pentericci L, Napolitano L, Mascia S, Amorín R, Calabrò A, Castellano
M, Cleri NJ, Giavalisco M, Grogin NA, Hathi NP, Hirschmann M, Koekemoer AM, Nanayakkara
T, Pacucci F, Shen L, Wilkins SM, Yoon I, Yung LYA, Bhatawdekar R, Lucas RA, Wang
X, Arrabal Haro P, Bagley MB, Finkelstein SL, Kartaltepe JS, Merlin E, Papovich
C, Pirzkal N, Santini P. 2025. The ionizing photon production efficiency of star-forming
galaxies at z ∼ 4–10. Astronomy & Astrophysics. 698, A302.
mla: Llerena, M., et al. “The Ionizing Photon Production Efficiency of Star-Forming
Galaxies at z ∼ 4–10.” Astronomy & Astrophysics, vol. 698, A302, EDP
Sciences, 2025, doi:10.1051/0004-6361/202453251.
short: M. Llerena, L. Pentericci, L. Napolitano, S. Mascia, R. Amorín, A. Calabrò,
M. Castellano, N.J. Cleri, M. Giavalisco, N.A. Grogin, N.P. Hathi, M. Hirschmann,
A.M. Koekemoer, T. Nanayakkara, F. Pacucci, L. Shen, S.M. Wilkins, I. Yoon, L.Y.A.
Yung, R. Bhatawdekar, R.A. Lucas, X. Wang, P. Arrabal Haro, M.B. Bagley, S.L.
Finkelstein, J.S. Kartaltepe, E. Merlin, C. Papovich, N. Pirzkal, P. Santini,
Astronomy & Astrophysics 698 (2025).
date_created: 2025-07-06T22:01:23Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2026-02-16T12:12:15Z
day: '20'
ddc:
- '520'
department:
- _id: JoMa
doi: 10.1051/0004-6361/202453251
external_id:
arxiv:
- '2412.01358'
isi:
- '001512479700026'
file:
- access_level: open_access
checksum: 92745034d9448d38b6b0394407ae39a0
content_type: application/pdf
creator: dernst
date_created: 2025-07-08T06:17:02Z
date_updated: 2025-07-08T06:17:02Z
file_id: '19974'
file_name: 2025_AstronomyAstrophysics_Llerena.pdf
file_size: 7557993
relation: main_file
success: 1
file_date_updated: 2025-07-08T06:17:02Z
has_accepted_license: '1'
intvolume: ' 698'
isi: 1
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: Astronomy & Astrophysics
publication_identifier:
eissn:
- 1432-0746
issn:
- 0004-6361
publication_status: published
publisher: EDP Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: The ionizing photon production efficiency of star-forming galaxies at z ∼ 4–10
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: 698
year: '2025'
...
---
OA_type: closed access
_id: '19968'
abstract:
- lang: eng
text: In the dynamic arena of innovation, the relations between academia and industry
are a keystone for breakthroughs and practical applications. Yet, the groundwork
of these pivotal University-Industry (U-I) partnerships remains covered in complexity.
This paper delves into these intricate relations, unraveling the factors that
help successful collaborations. Grounded in the Resource-Based Theory, our study
transcends traditional analytical boundaries, leveraging a neural network model
to understand a comprehensive dataset from the UK’s Higher Education Statistics
Agency, SCIMAGO Rankings, and Clarivate Publications. This novel approach helps
to make clear the interplay of academic load, administrative support, scientific
output, and university rank in sculpting U-I collaboration dynamics. Our findings
suggest that reduced academic load and robust administrative support significantly
bolster U-I collaborations. However, the influence of scientific output and university
ranking is more nuanced, challenging the common belief. High scientific output,
while indicative of expertise, doesn't always align with industry goals. Similarly,
while higher-ranked universities could attract more collaborations, the benefits
are not universal. This paper not only contributes to a deeper understanding of
U-I collaborations, but also provides actionable insights for university administrators,
policymakers, and industry leaders. In a world where innovation is key, understanding
these collaborative dynamics is crucial for fostering partnerships that push the
boundaries of research and practical application.
article_processing_charge: No
author:
- first_name: Carlos
full_name: Plata, Carlos
last_name: Plata
- first_name: Alejandro
full_name: Casallas Garcia, Alejandro
id: 92081129-2d75-11ef-a48d-b04dd7a2385a
last_name: Casallas Garcia
orcid: 0000-0002-1988-5035
citation:
ama: 'Plata C, Casallas Garcia A. Machine learning analysis of the factors influencing
university-industry collaborations. In: 85th Annual Meeting of the Academy
of Management. Vol 2025. Academy of Management; 2025. doi:10.5465/AMPROC.2025.54bp'
apa: 'Plata, C., & Casallas Garcia, A. (2025). Machine learning analysis of
the factors influencing university-industry collaborations. In 85th Annual
Meeting of the Academy of Management (Vol. 2025). Copenhagen, Denmark: Academy
of Management. https://doi.org/10.5465/AMPROC.2025.54bp'
chicago: Plata, Carlos, and Alejandro Casallas Garcia. “Machine Learning Analysis
of the Factors Influencing University-Industry Collaborations.” In 85th Annual
Meeting of the Academy of Management, Vol. 2025. Academy of Management, 2025.
https://doi.org/10.5465/AMPROC.2025.54bp.
ieee: C. Plata and A. Casallas Garcia, “Machine learning analysis of the factors
influencing university-industry collaborations,” in 85th Annual Meeting of
the Academy of Management, Copenhagen, Denmark, 2025, vol. 2025, no. 1.
ista: 'Plata C, Casallas Garcia A. 2025. Machine learning analysis of the factors
influencing university-industry collaborations. 85th Annual Meeting of the Academy
of Management. AOM: Annual Meeting of the Academy of Management vol. 2025.'
mla: Plata, Carlos, and Alejandro Casallas Garcia. “Machine Learning Analysis of
the Factors Influencing University-Industry Collaborations.” 85th Annual Meeting
of the Academy of Management, vol. 2025, no. 1, Academy of Management, 2025,
doi:10.5465/AMPROC.2025.54bp.
short: C. Plata, A. Casallas Garcia, in:, 85th Annual Meeting of the Academy of
Management, Academy of Management, 2025.
conference:
end_date: 2025-07-29
location: Copenhagen, Denmark
name: 'AOM: Annual Meeting of the Academy of Management'
start_date: 2025-07-25
date_created: 2025-07-06T22:01:23Z
date_published: 2025-06-17T00:00:00Z
date_updated: 2025-09-09T08:39:03Z
day: '17'
department:
- _id: CaMu
doi: 10.5465/AMPROC.2025.54bp
intvolume: ' 2025'
issue: '1'
language:
- iso: eng
month: '06'
oa_version: None
publication: 85th Annual Meeting of the Academy of Management
publication_identifier:
eissn:
- 2151-6561
issn:
- 0065-0668
publication_status: published
publisher: Academy of Management
quality_controlled: '1'
scopus_import: '1'
status: public
title: Machine learning analysis of the factors influencing university-industry collaborations
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2025
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '19969'
abstract:
- lang: eng
text: "In the stochastic population protocol model, we are given a connected graph
with n nodes, and in every time step, a scheduler samples an edge of the graph
uniformly at random and the nodes connected by this edge interact. A fundamental
task in this model is stable leader election, in which all nodes start in an identical
state and the aim is to reach a configuration in which (1)\r\nexactly one node
is elected as leader and (2) this node remains as the unique leader no matter
what sequence of interactions follows. On cliques, the complexity of this problem
has recently been settled: time-optimal protocols stabilize in (n log n) expected
steps using (log log n) states, whereas protocols that use O(1) states require
(n2) expected steps. In this work, we investigate the complexity of stable leader
election on graphs. We provide the first non-trivial time lower bounds on general
graphs, showing that, when moving beyond cliques, the complexity of stable leader
election can range from O(1) to (n3) expected steps. We describe a protocol that
is time-optimal on many graph families, but uses polynomially-many states. In
contrast, we give a near-time-optimal protocol that uses only O(log2 n) states
that is at most a factor O(log n) slower. Finally, we observe that for many graphs
the constant-state protocol of Beauquier et al. [OPODIS 2013] is at most a factor
O(n log n) slower than the fast polynomial-state protocol, and among constant-state
protocols, this protocol has near-optimal average case complexity on dense random
graphs."
acknowledgement: We thank all anonymous reviewers for their helpful comments. We would
also like to thank Jakob Solnerzik and Olivier Stietel for catching some errors
in the proofs. Open Access funding enabled and organized by Projekt DEAL. We gratefully
acknowledge funding from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme (grant agreement No 805223
ScaleML).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
- first_name: Joel
full_name: Rybicki, Joel
id: 334EFD2E-F248-11E8-B48F-1D18A9856A87
last_name: Rybicki
orcid: 0000-0002-6432-6646
- first_name: Sasha
full_name: Voitovych, Sasha
last_name: Voitovych
citation:
ama: Alistarh D-A, Rybicki J, Voitovych S. Near-optimal leader election in population
protocols on graphs. Distributed Computing. 2025;38:207-245. doi:10.1007/s00446-025-00487-7
apa: Alistarh, D.-A., Rybicki, J., & Voitovych, S. (2025). Near-optimal leader
election in population protocols on graphs. Distributed Computing. Springer
Nature. https://doi.org/10.1007/s00446-025-00487-7
chicago: Alistarh, Dan-Adrian, Joel Rybicki, and Sasha Voitovych. “Near-Optimal
Leader Election in Population Protocols on Graphs.” Distributed Computing.
Springer Nature, 2025. https://doi.org/10.1007/s00446-025-00487-7.
ieee: D.-A. Alistarh, J. Rybicki, and S. Voitovych, “Near-optimal leader election
in population protocols on graphs,” Distributed Computing, vol. 38. Springer
Nature, pp. 207–245, 2025.
ista: Alistarh D-A, Rybicki J, Voitovych S. 2025. Near-optimal leader election in
population protocols on graphs. Distributed Computing. 38, 207–245.
mla: Alistarh, Dan-Adrian, et al. “Near-Optimal Leader Election in Population Protocols
on Graphs.” Distributed Computing, vol. 38, Springer Nature, 2025, pp.
207–45, doi:10.1007/s00446-025-00487-7.
short: D.-A. Alistarh, J. Rybicki, S. Voitovych, Distributed Computing 38 (2025)
207–245.
corr_author: '1'
date_created: 2025-07-06T22:01:24Z
date_published: 2025-09-01T00:00:00Z
date_updated: 2025-12-30T09:04:18Z
day: '01'
ddc:
- '510'
department:
- _id: DaAl
doi: 10.1007/s00446-025-00487-7
ec_funded: 1
external_id:
arxiv:
- '2205.12597'
isi:
- '001518300400001'
file:
- access_level: open_access
checksum: 2789c0fdfb58f64930f05f6ac2b3ca61
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T09:03:55Z
date_updated: 2025-12-30T09:03:55Z
file_id: '20900'
file_name: 2025_DistributedComp_Alistarh.pdf
file_size: 770705
relation: main_file
success: 1
file_date_updated: 2025-12-30T09:03:55Z
has_accepted_license: '1'
intvolume: ' 38'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 207-245
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Distributed Computing
publication_identifier:
eissn:
- 1432-0452
issn:
- 0178-2770
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '11844'
relation: earlier_version
status: public
scopus_import: '1'
status: public
title: Near-optimal leader election in population protocols on 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: 38
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '19982'
abstract:
- lang: eng
text: "Dynamically maintaining the minimum cut in a graph G under edge insertions
and deletion is a fundamental problem in dynamic graph algorithms for which no
conditional lower bound on the time per operation exists. In an n-node graph the
best known (1 + o (1))-approximate algorithm takes update time [14]. If the minimum
cut is guaranteed to be (log n )o (1), a deterministic exact algorithm with n
o (1) update time exists [8].\r\nWe present the first fully dynamic algorithm
for (1 + o (1))-approximate minimum cut with n o(1) update time. Our main technical
contribution is to show that it suffices to consider small-volume cuts in suitably
contracted graphs."
acknowledgement: This project has received funding from the European Research Council
(ERC) under the European Union’sHorizon 2020 research and innovation programme (MoDynStruct,
No. 101019564) and the Austrian Science Fund(FWF) grant DOI 10.55776/Z422, grant
DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the
netidee SCIENCE Stiftung, 2020–2024.
article_processing_charge: No
arxiv: 1
author:
- first_name: Antoine
full_name: El-Hayek, Antoine
id: 888a098e-fcac-11ee-aff7-d347be57b725
last_name: El-Hayek
orcid: 0000-0003-4268-7368
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Jason
full_name: Li, Jason
last_name: Li
citation:
ama: 'El-Hayek A, Henzinger M, Li J. Fully dynamic approximate minimum cut in subpolynomial
time per operation. In: Proceedings of the 2025 Annual ACM-SIAM Symposium on
Discrete Algorithms. Society for Industrial and Applied Mathematics; 2025:750-784.
doi:10.1137/1.9781611978322.22'
apa: 'El-Hayek, A., Henzinger, M., & Li, J. (2025). Fully dynamic approximate
minimum cut in subpolynomial time per operation. In Proceedings of the 2025
Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 750–784). New Orleans,
LA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611978322.22'
chicago: El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Fully Dynamic Approximate
Minimum Cut in Subpolynomial Time per Operation.” In Proceedings of the 2025
Annual ACM-SIAM Symposium on Discrete Algorithms, 750–84. Society for Industrial
and Applied Mathematics, 2025. https://doi.org/10.1137/1.9781611978322.22.
ieee: A. El-Hayek, M. Henzinger, and J. Li, “Fully dynamic approximate minimum cut
in subpolynomial time per operation,” in Proceedings of the 2025 Annual ACM-SIAM
Symposium on Discrete Algorithms, New Orleans, LA, United States, 2025, pp.
750–784.
ista: 'El-Hayek A, Henzinger M, Li J. 2025. Fully dynamic approximate minimum cut
in subpolynomial time per operation. Proceedings of the 2025 Annual ACM-SIAM Symposium
on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 750–784.'
mla: El-Hayek, Antoine, et al. “Fully Dynamic Approximate Minimum Cut in Subpolynomial
Time per Operation.” Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete
Algorithms, Society for Industrial and Applied Mathematics, 2025, pp. 750–84,
doi:10.1137/1.9781611978322.22.
short: A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the 2025 Annual ACM-SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2025, pp. 750–784.
conference:
end_date: 2025-01-15
location: New Orleans, LA, United States
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2025-01-12
corr_author: '1'
date_created: 2025-07-10T13:08:57Z
date_published: 2025-01-07T00:00:00Z
date_updated: 2025-12-29T12:30:04Z
day: '07'
department:
- _id: MoHe
doi: 10.1137/1.9781611978322.22
ec_funded: 1
external_id:
arxiv:
- '2412.15069'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.15069
month: '01'
oa: 1
oa_version: Preprint
page: 750-784
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 2025 Annual ACM-SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- '9781611978322'
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
status: public
title: Fully dynamic approximate minimum cut in subpolynomial time per operation
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '19998'
abstract:
- lang: eng
text: nspired by Richard Feynman’s 1959 lecture and the 1966 film Fantastic Voyage,
the field of micro/nanorobots has evolved from science fiction to reality, with
significant advancements in biomedical and environmental applications. Despite
the rapid progress, the deployment of functional micro/nanorobots remains limited.
This review of the technology roadmap identifies key challenges hindering their
widespread use, focusing on propulsion mechanisms, fundamental theoretical aspects,
collective behavior, material design, and embodied intelligence. We explore the
current state of micro/nanorobot technology, with an emphasis on applications
in biomedicine, environmental remediation, analytical sensing, and other industrial
technological aspects. Additionally, we analyze issues related to scaling up production,
commercialization, and regulatory frameworks that are crucial for transitioning
from research to practical applications. We also emphasize the need for interdisciplinary
collaboration to address both technical and nontechnical challenges, such as sustainability,
ethics, and business considerations. Finally, we propose a roadmap for future
research to accelerate the development of micro/nanorobots, positioning them as
essential tools for addressing grand challenges and enhancing the quality of life.
acknowledgement: 'The content is solely the responsibility of the authors and does
not necessarily represent the official views of the funding agencies. Martin Pumera
acknowledges the financial support of Grant Agency of the Czech Republic (EXPRO:
25-15484X). Xiaohui Ju, Xia Peng and Cagatay M. Oral acknowledge ERDF/ESF project
TECHSCALE (No. CZ.02.01.01/00/22_008/0004587) for financial support. Xiaohui Ju
acknowledges the financial support from Czech Grant Agency GACR standard grant No.
25-15996S. Salvador Pane, Fabian Landers and Semih Sevim acknowledge funding from
the European Union''s Horizon 2020 Proactive Open program under FETPROACT-EIC-05-2019
ANGIE (No. 952152) and the European Union’s Horizon Europe Research and Innovation
Programme under the EVA project (GA no. 101047081).Li Zhang acknowledges funding
support from the Hong Kong Research Grants Council (RGC) with grant numbers R4015-2,
RFS2122-4S03, and STG1/E-401/23-N. Hamed Shahsavan acknowledges Natural Sciences
and Engineering Research Council of Canada (NSERC). Cagatay M. Oral and Hamed Shahsavan
were in part funded by the WIN-CEITEC BUT Joint Seed Funding Program. Qiang He and
Xiankun Lin acknowledge the National Natural Science Foundation of China (22193033,
U22A20346) and Heilongjiang Provincial Key R&D Program (2022ZX02C23) for providing
financial support. Il-Doo Kim acknowledges the National Research Foundation of Korea
(NRF) grant funded by the Korea government (MSIT) (No. RS-2024-00435493). Ramin
Golestanian acknowledges support from the Max Planck School Matter to Life and the
MaxSynBio Consortium which are jointly funded by the Federal Ministry of Education
and Research (BMBF) of Germany and the Max Planck Society. Bradley J. Nelson and
Semih Sevim acknowledge funding from the Swiss National Science Foundation under
SNSF-Sinergia project no. 198643. Raphael Wittkowski is funded by the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) − 535275785. Daniel Ahmed acknowledges the support
provided by the European Research Council, as part of the European Union’s Horizon
2020 research and innovation program (grant agreement 853309, SONOBOTS) and Swiss
National Science Foundation (SNSF) under the SNSF Project funding MINT 2022 grant
agreement No. 213058. Daniel Ahmed also extends thanks to Zhiyuan Zhang, Mahmoud
Medany, and Prajwal Agrawal for helpful discussions. Wei Wang acknowledges the National
Natural Science Foundation of China (T2322006) and the Shenzhen Science and Technology
Program (RCYX20210609103122038). Mariana Medina-Sánchez acknowledges the financial
support received from the European Union’s Horizon 2020 research and innovation
program (ERC Starting Grant Nr. 853609), the HORIZON-MSCA-2022-COFUND-101126600-SmartBRAIN3,
and the Grant PID2023-148899OA-I00 funded by MICIU/AEI/ 10.13039/501100011033. Maria
Guix acknowledges the financial support from the Spanish Ministry of Science (grants
RYC2020-945030119-I and PID2023-151682NA-I00 funded by MCIN/ AEI /10.13039/501100011033/
and FEDER) and Unidades de Excelencia María de Maeztu 2021 CEX2021-001202-M. Bahareh
Behkam and Naimat Kalim Bari acknowledge support from the National Science Foundation
(CBET-2318093). Naimat Kalim Bari also gratefully acknowledges financial support
from the Virginia Tech Presidential Postdoctoral Fellowship. Raymond Kapral acknowledges
the Natural Sciences and Engineering Research Council of Canada. Giuseppe Battaglia,
Subhadip Ghosh and Bárbara Borges Fernandes thank the European Research Council
ChessTaG grant 769798 (G.B.); Ministry of Science and Innovation of Spain, Proyectos
I+D+I PID2020-119914RBI00 and Proyectos I+D+I PID2023-149206OB-I00 and the Agencia
de Gestión de Ayudas Universitarias y de Investigación (AGAUR) for the grant SGR
01538 and for SG fellowship (2022 BP 00214). Alexander Leshansky and Konstantin
Morozov acknowledge the support of the Israel Science Foundation (ISF) via grant
no. 2899/21. Alberto Escarpa and Beatriz Jurado Sánchez acknowledge support from
The Spanish Ministry of Science, Innovation and Universities [Grant PID2023-152298NB-I00
funded by MCIN/AEI/10.13039/501100011033 and FEDER, UE (A.E, B. J. S), grant TED2021-132720B-I00,
funded by MCIN/AEI/10.13039/501100011033 and the European Union “NextGenerationEU”/PRTR
(A.E, B. J. S); grant CNS2023-144653 funded by MCIN/AEI/10.13039/ 501100011033 and
the European Union “NextGenerationEU”/PRTR] and Junta de Comunidades de Castilla
la Mancha (grant number SBPLY/23/180225/000058). Jeremie Palacci acknowledges support
from the European Union through ERC grant (VULCAN, 101086998). Josep Puigmartí-Luis
acknowledges the Agencia Estatal de Investigación (AEI) for the María de Maeztu,
project no. CEX2021-001202-M, the Ministerio de Ciencia, Innovación y Universidades
(Grant No. PID2020-116612RB-C33 funded by MCIN/AEI/10.13039/501100011033) and the
Generalitat de Catalunya (2021 SGR 00270). James D. Nicholas, Jordi Ignés-Mullol,
and Josep Puigmartí-Luis acknowledge support from the European Union’s Horizon Europe
Research and Innovation Programme under the EVA project (GA no: 101047081). Josep
Puigmartí-Luis and Jordi Ignés-Mullol acknowledge support from the European Union’s
Horizon 2020 Proactive Open program under FETPROACT-EIC-05-2019 ANGIE (No. 952152).
Jordi Ignés-Mullol also acknowledges the Ministerio de Ciencia, Innovación y Universidades
(Grant No. PID2022-137713NB-C21 funded by MICIU/AEI/10.13039/501100011033). Lauren
Zarzar and Yutong Liu acknowledge support from the US Army Research Office (Grant
W911NF-18-1-0414). Longqiu Li acknowledges the National Natural Science Foundation
of China (52125505, U23A20637) for providing financial support. Wyatt Shields acknowledges
support from the National Science Foundation (NSF) through a CAREER grant (CBET
2143419). Xing Ma acknowledges the support from Shenzhen Science and Technology
Program (RCJC20231211090000001). David H. Gracias acknowledges support from the
NIH-NIBIB (R01EB017742). The content is solely the responsibility of the authors
and does not necessarily represent the official views of the NIH. Samuel Sánchez
acknowledges funding from the European Research Council (ERC) under the European
Union’s Horizon 2020 and Horizon Europe research and innovation programmes (grants
agreement No 866348, i-NanoSwarms), the CERCA program by the Generalitat de Catalunya,
the project 2021 SGR 01606, and the "Centro de Excelencia Severo Ochoa" (Grant CEX2023-001282-S).
Maria Jose Esplandiu acknowledges the Ministerio de Ciencia e Innovación of Spain
(MICIN) through PID 2021-124568NB-I00 and TED2021-129898B-C21 project. Sarthak Misra
and Antonio Lobosco acknowledge funding from European Research Council (ERC) under
the European Union’s Horizon 2020 Research and Innovation Programme (Grant Nr. 866494,
project-MAESTRO). Jinxing Li acknowledges support from the National Science Foundation
under Award Nos. CMMI 2323917, ECCS-2216131, ECCS 2339495, ECCS-2334134, NIH NIBIB
Trailblazer R21 Award, and Henry Ford Hospital + MSU Cancer Research Pilot Award.
Ze Xiong acknowledges the financial support from the International S&T Cooperation
Program of Shanghai (24490710900) and the start-up grant from ShanghaiTech University
(2023F0209-000-02). Yongfeng Mei acknowledges the National Natural Science Foundation
of China (62375054), Science and Technology Commission of Shanghai Municipality
(24520750200, 24CL2900200), and Shanghai Talent Programs. Ayusman Sen thanks the
National Science Foundation, the Air Force Office of Scientific Research, and the
Sloan Foundation for their financial support. Abdon Pena-Francesch acknowledges
support from the Air Force Office of Scientific Research under award number FA9550-24-1-0185.
Katherine Villa acknowledges funding from the European Research Council (ERC) under
the European Union’s Horizon 2020 research and innovation programme (GA no. 101076680;
PhotoSwim) and the support from the Spanish Ministry of Science (MCIN/AEI/10.13039/501100011033)
and the European Union (Next generation EU/PRTR) through the Ramón y Cajal grant,
RYC2021-031075-I. Kang Liang acknowledges support from the Australian Research Council
(DP250101401 and FT220100479) and the National Breast Cancer Foundation, Australia
(IIRS-22–104). Jizhai Cui acknowledges the National Key Technologies R&D Program
of China (2022YFA1207000) and Shanghai Rising-Star Program (24QA2700700). Xiang-Zhong
Chen acknowledges the National Natural Science Foundation of China (52473254) and
the National Key Research and Development Program of China (2023YFB35070003)'
article_processing_charge: Yes (in subscription journal)
article_type: review
author:
- first_name: Xiaohui
full_name: Ju, Xiaohui
last_name: Ju
- first_name: Chuanrui
full_name: Chen, Chuanrui
last_name: Chen
- first_name: Cagatay M.
full_name: Oral, Cagatay M.
last_name: Oral
- first_name: Semih
full_name: Sevim, Semih
last_name: Sevim
- first_name: Ramin
full_name: Golestanian, Ramin
last_name: Golestanian
- first_name: Mengmeng
full_name: Sun, Mengmeng
last_name: Sun
- first_name: Negin
full_name: Bouzari, Negin
last_name: Bouzari
- first_name: Xiankun
full_name: Lin, Xiankun
last_name: Lin
- first_name: Mario
full_name: Urso, Mario
last_name: Urso
- first_name: Jong Seok
full_name: Nam, Jong Seok
last_name: Nam
- first_name: Yujang
full_name: Cho, Yujang
last_name: Cho
- first_name: Xia
full_name: Peng, Xia
last_name: Peng
- first_name: Fabian C.
full_name: Landers, Fabian C.
last_name: Landers
- first_name: Shihao
full_name: Yang, Shihao
last_name: Yang
- first_name: Azin
full_name: Adibi, Azin
last_name: Adibi
- first_name: Nahid
full_name: Taz, Nahid
last_name: Taz
- first_name: Raphael
full_name: Wittkowski, Raphael
last_name: Wittkowski
- first_name: Daniel
full_name: Ahmed, Daniel
last_name: Ahmed
- first_name: Wei
full_name: Wang, Wei
last_name: Wang
- first_name: Veronika
full_name: Magdanz, Veronika
last_name: Magdanz
- first_name: Mariana
full_name: Medina-Sánchez, Mariana
last_name: Medina-Sánchez
- first_name: Maria
full_name: Guix, Maria
last_name: Guix
- first_name: Naimat
full_name: Bari, Naimat
last_name: Bari
- first_name: Bahareh
full_name: Behkam, Bahareh
last_name: Behkam
- first_name: Raymond
full_name: Kapral, Raymond
last_name: Kapral
- first_name: Yaxin
full_name: Huang, Yaxin
last_name: Huang
- first_name: Jinyao
full_name: Tang, Jinyao
last_name: Tang
- first_name: Ben
full_name: Wang, Ben
last_name: Wang
- first_name: Konstantin
full_name: Morozov, Konstantin
last_name: Morozov
- first_name: Alexander
full_name: Leshansky, Alexander
last_name: Leshansky
- first_name: Sarmad Ahmad
full_name: Abbasi, Sarmad Ahmad
last_name: Abbasi
- first_name: Hongsoo
full_name: Choi, Hongsoo
last_name: Choi
- first_name: Subhadip
full_name: Ghosh, Subhadip
last_name: Ghosh
- first_name: Bárbara
full_name: Borges Fernandes, Bárbara
last_name: Borges Fernandes
- first_name: Giuseppe
full_name: Battaglia, Giuseppe
last_name: Battaglia
- first_name: Peer
full_name: Fischer, Peer
last_name: Fischer
- first_name: Ambarish
full_name: Ghosh, Ambarish
last_name: Ghosh
- first_name: Beatriz
full_name: Jurado Sánchez, Beatriz
last_name: Jurado Sánchez
- first_name: Alberto
full_name: Escarpa, Alberto
last_name: Escarpa
- first_name: Quentin
full_name: Martinet, Quentin
id: b37485a8-d343-11eb-a0e9-df8c484ef8ab
last_name: Martinet
orcid: 0000-0002-2916-6632
- first_name: Jérémie A
full_name: Palacci, Jérémie A
id: 8fb92548-2b22-11eb-b7c1-a3f0d08d7c7d
last_name: Palacci
orcid: 0000-0002-7253-9465
- first_name: Eric
full_name: Lauga, Eric
last_name: Lauga
- first_name: Jeffrey
full_name: Moran, Jeffrey
last_name: Moran
- first_name: Miguel A.
full_name: Ramos-Docampo, Miguel A.
last_name: Ramos-Docampo
- first_name: Brigitte
full_name: Städler, Brigitte
last_name: Städler
- first_name: Ramón Santiago
full_name: Herrera Restrepo, Ramón Santiago
last_name: Herrera Restrepo
- first_name: Gilad
full_name: Yossifon, Gilad
last_name: Yossifon
- first_name: James D.
full_name: Nicholas, James D.
last_name: Nicholas
- first_name: Jordi
full_name: Ignés-Mullol, Jordi
last_name: Ignés-Mullol
- first_name: Josep
full_name: Puigmartí-Luis, Josep
last_name: Puigmartí-Luis
- first_name: Yutong
full_name: Liu, Yutong
last_name: Liu
- first_name: Lauren D.
full_name: Zarzar, Lauren D.
last_name: Zarzar
- first_name: C. Wyatt
full_name: Shields, C. Wyatt
last_name: Shields
- first_name: Longqiu
full_name: Li, Longqiu
last_name: Li
- first_name: Shanshan
full_name: Li, Shanshan
last_name: Li
- first_name: Xing
full_name: Ma, Xing
last_name: Ma
- first_name: David H.
full_name: Gracias, David H.
last_name: Gracias
- first_name: Orlin
full_name: Velev, Orlin
last_name: Velev
- first_name: Samuel
full_name: Sánchez, Samuel
last_name: Sánchez
- first_name: Maria Jose
full_name: Esplandiu, Maria Jose
last_name: Esplandiu
- first_name: Juliane
full_name: Simmchen, Juliane
last_name: Simmchen
- first_name: Antonio
full_name: Lobosco, Antonio
last_name: Lobosco
- first_name: Sarthak
full_name: Misra, Sarthak
last_name: Misra
- first_name: Zhiguang
full_name: Wu, Zhiguang
last_name: Wu
- first_name: Jinxing
full_name: Li, Jinxing
last_name: Li
- first_name: Alexander
full_name: Kuhn, Alexander
last_name: Kuhn
- first_name: Amir
full_name: Nourhani, Amir
last_name: Nourhani
- first_name: Tijana
full_name: Maric, Tijana
last_name: Maric
- first_name: Ze
full_name: Xiong, Ze
last_name: Xiong
- first_name: Amirreza
full_name: Aghakhani, Amirreza
last_name: Aghakhani
- first_name: Yongfeng
full_name: Mei, Yongfeng
last_name: Mei
- first_name: Yingfeng
full_name: Tu, Yingfeng
last_name: Tu
- first_name: Fei
full_name: Peng, Fei
last_name: Peng
- first_name: Eric
full_name: Diller, Eric
last_name: Diller
- first_name: Mahmut Selman
full_name: Sakar, Mahmut Selman
last_name: Sakar
- first_name: Ayusman
full_name: Sen, Ayusman
last_name: Sen
- first_name: Junhui
full_name: Law, Junhui
last_name: Law
- first_name: Yu
full_name: Sun, Yu
last_name: Sun
- first_name: Abdon
full_name: Pena-Francesch, Abdon
last_name: Pena-Francesch
- first_name: Katherine
full_name: Villa, Katherine
last_name: Villa
- first_name: Huaizhi
full_name: Li, Huaizhi
last_name: Li
- first_name: Donglei Emma
full_name: Fan, Donglei Emma
last_name: Fan
- first_name: Kang
full_name: Liang, Kang
last_name: Liang
- first_name: Tony Jun
full_name: Huang, Tony Jun
last_name: Huang
- first_name: Xiang-Zhong
full_name: Chen, Xiang-Zhong
last_name: Chen
- first_name: Songsong
full_name: Tang, Songsong
last_name: Tang
- first_name: Xueji
full_name: Zhang, Xueji
last_name: Zhang
- first_name: Jizhai
full_name: Cui, Jizhai
last_name: Cui
- first_name: Hong
full_name: Wang, Hong
last_name: Wang
- first_name: Wei
full_name: Gao, Wei
last_name: Gao
- first_name: Vineeth
full_name: Kumar Bandari, Vineeth
last_name: Kumar Bandari
- first_name: Oliver G.
full_name: Schmidt, Oliver G.
last_name: Schmidt
- first_name: Xianghua
full_name: Wu, Xianghua
last_name: Wu
- first_name: Jianguo
full_name: Guan, Jianguo
last_name: Guan
- first_name: Metin
full_name: Sitti, Metin
last_name: Sitti
- first_name: Bradley J.
full_name: Nelson, Bradley J.
last_name: Nelson
- first_name: Salvador
full_name: Pané, Salvador
last_name: Pané
- first_name: Li
full_name: Zhang, Li
last_name: Zhang
- first_name: Hamed
full_name: Shahsavan, Hamed
last_name: Shahsavan
- first_name: Qiang
full_name: He, Qiang
last_name: He
- first_name: Il-Doo
full_name: Kim, Il-Doo
last_name: Kim
- first_name: Joseph
full_name: Wang, Joseph
last_name: Wang
- first_name: Martin
full_name: Pumera, Martin
last_name: Pumera
citation:
ama: Ju X, Chen C, Oral CM, et al. Technology roadmap of micro/nanorobots. ACS
Nano. 2025;19(27):24174-24334. doi:10.1021/acsnano.5c03911
apa: Ju, X., Chen, C., Oral, C. M., Sevim, S., Golestanian, R., Sun, M., … Pumera,
M. (2025). Technology roadmap of micro/nanorobots. ACS Nano. American Chemical
Society. https://doi.org/10.1021/acsnano.5c03911
chicago: Ju, Xiaohui, Chuanrui Chen, Cagatay M. Oral, Semih Sevim, Ramin Golestanian,
Mengmeng Sun, Negin Bouzari, et al. “Technology Roadmap of Micro/Nanorobots.”
ACS Nano. American Chemical Society, 2025. https://doi.org/10.1021/acsnano.5c03911.
ieee: X. Ju et al., “Technology roadmap of micro/nanorobots,” ACS Nano,
vol. 19, no. 27. American Chemical Society, pp. 24174–24334, 2025.
ista: Ju X et al. 2025. Technology roadmap of micro/nanorobots. ACS Nano. 19(27),
24174–24334.
mla: Ju, Xiaohui, et al. “Technology Roadmap of Micro/Nanorobots.” ACS Nano,
vol. 19, no. 27, American Chemical Society, 2025, pp. 24174–334, doi:10.1021/acsnano.5c03911.
short: X. Ju, C. Chen, C.M. Oral, S. Sevim, R. Golestanian, M. Sun, N. Bouzari,
X. Lin, M. Urso, J.S. Nam, Y. Cho, X. Peng, F.C. Landers, S. Yang, A. Adibi, N.
Taz, R. Wittkowski, D. Ahmed, W. Wang, V. Magdanz, M. Medina-Sánchez, M. Guix,
N. Bari, B. Behkam, R. Kapral, Y. Huang, J. Tang, B. Wang, K. Morozov, A. Leshansky,
S.A. Abbasi, H. Choi, S. Ghosh, B. Borges Fernandes, G. Battaglia, P. Fischer,
A. Ghosh, B. Jurado Sánchez, A. Escarpa, Q. Martinet, J.A. Palacci, E. Lauga,
J. Moran, M.A. Ramos-Docampo, B. Städler, R.S. Herrera Restrepo, G. Yossifon,
J.D. Nicholas, J. Ignés-Mullol, J. Puigmartí-Luis, Y. Liu, L.D. Zarzar, C.W. Shields,
L. Li, S. Li, X. Ma, D.H. Gracias, O. Velev, S. Sánchez, M.J. Esplandiu, J. Simmchen,
A. Lobosco, S. Misra, Z. Wu, J. Li, A. Kuhn, A. Nourhani, T. Maric, Z. Xiong,
A. Aghakhani, Y. Mei, Y. Tu, F. Peng, E. Diller, M.S. Sakar, A. Sen, J. Law, Y.
Sun, A. Pena-Francesch, K. Villa, H. Li, D.E. Fan, K. Liang, T.J. Huang, X.-Z.
Chen, S. Tang, X. Zhang, J. Cui, H. Wang, W. Gao, V. Kumar Bandari, O.G. Schmidt,
X. Wu, J. Guan, M. Sitti, B.J. Nelson, S. Pané, L. Zhang, H. Shahsavan, Q. He,
I.-D. Kim, J. Wang, M. Pumera, ACS Nano 19 (2025) 24174–24334.
date_created: 2025-07-10T14:53:27Z
date_published: 2025-06-27T00:00:00Z
date_updated: 2025-12-30T09:07:44Z
day: '27'
ddc:
- '540'
department:
- _id: JePa
doi: 10.1021/acsnano.5c03911
external_id:
isi:
- '001519731400001'
pmid:
- '40577644'
file:
- access_level: open_access
checksum: 5f6034144bf9f649ff74fed01b04aa22
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T09:07:31Z
date_updated: 2025-12-30T09:07:31Z
file_id: '20901'
file_name: 2025_ACSNano_Ju.pdf
file_size: 11892237
relation: main_file
success: 1
file_date_updated: 2025-12-30T09:07:31Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '27'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 24174-24334
pmid: 1
project:
- _id: bdac72da-d553-11ed-ba76-eae56e802b74
grant_number: '101086998'
name: 'VULCAN: matter, powered from within'
publication: ACS Nano
publication_identifier:
eissn:
- 1936-086X
issn:
- 1936-0851
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Technology roadmap of micro/nanorobots
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 19
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20002'
abstract:
- lang: eng
text: While the most widely used CRISPR-Cas enzyme is the Cas9 endonuclease from
Streptococcus pyogenes (Cas9), it exhibits single-turnover enzyme kinetics which
leads to long residence times on product DNA. This blocks access to DNA repair
machinery and acts as a major bottleneck during CRISPR-Cas9 gene editing. Cas9
can eventually be removed from the product by extrinsic factors, such as translocating
polymerases, but the mechanisms contributing to Cas9 dissociation following cleavage
remain poorly understood. Here, we employ truncated guide RNAs as a strategy to
weaken PAM-distal nucleic acid interactions and promote faster enzyme turnover.
Using kinetics-guided cryo-EM, we examine the conformational landscape of a multi-turnover
Cas9, including the first detailed snapshots of Cas9 dissociating from product
DNA. We discovered that while the PAM-distal product dissociates from Cas9 following
cleavage, tight binding of the PAM-proximal product directly inhibits re-binding
of new targets. Our work provides direct evidence as to why Cas9 acts as a single-turnover
enzyme and will guide future Cas9 engineering efforts.
acknowledgement: We thank Dr. Kenneth Johnson for assistance with kinetic analysis
and helpful discussion as well as Dr. Jack Bravo and members of the Taylor lab for
insightful comments on the manuscript. Data were collected at the Sauer Structural
Biology Laboratory at the University of Texas at Austin. This work was supported
by a National Institutes of Health grant R35GM138348 (to D.W.T.). The content is
solely the responsibility of the authors and does not necessarily represent the
official views of the National Institutes of Health. Computational resources for
this work were supported by the Welch Foundation grant F-1938 (to D.W.T.).
article_number: '5681'
article_processing_charge: Yes
article_type: original
author:
- first_name: Kaitlyn
full_name: Kiernan, Kaitlyn
id: 91e8ab53-b70a-11ef-adcb-f779f833b451
last_name: Kiernan
- first_name: David W.
full_name: Taylor, David W.
last_name: Taylor
citation:
ama: Kiernan K, Taylor DW. Visualization of a multi-turnover Cas9 after product
release. Nature Communications. 2025;16. doi:10.1038/s41467-025-60668-7
apa: Kiernan, K., & Taylor, D. W. (2025). Visualization of a multi-turnover
Cas9 after product release. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-025-60668-7
chicago: Kiernan, Kaitlyn, and David W. Taylor. “Visualization of a Multi-Turnover
Cas9 after Product Release.” Nature Communications. Springer Nature, 2025.
https://doi.org/10.1038/s41467-025-60668-7.
ieee: K. Kiernan and D. W. Taylor, “Visualization of a multi-turnover Cas9 after
product release,” Nature Communications, vol. 16. Springer Nature, 2025.
ista: Kiernan K, Taylor DW. 2025. Visualization of a multi-turnover Cas9 after product
release. Nature Communications. 16, 5681.
mla: Kiernan, Kaitlyn, and David W. Taylor. “Visualization of a Multi-Turnover Cas9
after Product Release.” Nature Communications, vol. 16, 5681, Springer
Nature, 2025, doi:10.1038/s41467-025-60668-7.
short: K. Kiernan, D.W. Taylor, Nature Communications 16 (2025).
date_created: 2025-07-13T22:01:21Z
date_published: 2025-07-01T00:00:00Z
date_updated: 2025-07-14T08:30:06Z
day: '01'
ddc:
- '570'
department:
- _id: LeSa
doi: 10.1038/s41467-025-60668-7
external_id:
pmid:
- '40593576'
file:
- access_level: open_access
checksum: fa9a1eaa7e2e60467768cbaed307aceb
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T08:28:25Z
date_updated: 2025-07-14T08:28:25Z
file_id: '20018'
file_name: 2025_NatureComm_Kiernan.pdf
file_size: 6875712
relation: main_file
success: 1
file_date_updated: 2025-07-14T08:28:25Z
has_accepted_license: '1'
intvolume: ' 16'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Visualization of a multi-turnover Cas9 after product release
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: 16
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: diamond
PlanS_conform: '1'
_id: '20003'
abstract:
- lang: eng
text: The problem of mobile impurities in quantum baths is of fundamental importance
in many-body physics. There has recently been significant progress regarding our
understanding of this due to cold atom experiments, but so far it has mainly been
concerned with cases where the bath has no or only weak interactions, or the impurity
interacts weakly with the bath. Here, we address this gap by developing a new
theoretical framework for exploring a mobile impurity interacting strongly with
a highly correlated bath of bosons in the quantum critical regime of a Mott insulator
(MI) to superfluid (SF) quantum phase transition. Our framework is based on a
powerful quantum Gutzwiller (QGW) description of the bosonic bath combined with
diagrammatic field theory for the impurity-bath interactions. By resumming a selected
class of diagrams to infinite order, a rich picture emerges where the impurity
is dressed by the fundamental modes of the bath, which change character from gapped
particle-hole excitations in the MI to Higgs and gapless Goldstone modes in the
SF. This gives rise to the existence of several quasiparticle (polaron) branches
with properties reflecting the strongly correlated environment. In particular,
one polaron branch exhibits a sharp cusp in its energy, while a new ground-state
polaron emerges at the O(2) quantum phase transition point for integer filling,
which reflects the nonanalytic behavior at the transition and the appearance of
the Goldstone mode in the SF phase. Smooth versions of these features are inherited
in the polaron spectrum away from integer filling due to the influence of Mott
physics on the bosonic bath. We furthermore compare our diagrammatic results with
quantum Monte Carlo calculations, obtaining excellent agreement. This accuracy
is quite remarkable for such a highly non-trivial case of strong interactions
between the impurity and bosons in a maximally correlated quantum critical regime,
and it establishes the utility of our framework. Finally, our results show how
impurities can be used as quantum sensors and highlight fundamental differences
between experiments performed at a fixed particle number or a fixed chemical potential.
article_number: '002'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Ragheed
full_name: Al Hyder, Ragheed
id: d1c405be-ae15-11ed-8510-ccf53278162e
last_name: Al Hyder
- first_name: Victor E.
full_name: Colussi, Victor E.
last_name: Colussi
- first_name: Matija
full_name: Čufar, Matija
last_name: Čufar
- first_name: Joachim
full_name: Brand, Joachim
last_name: Brand
- first_name: Alessio
full_name: Recati, Alessio
last_name: Recati
- first_name: Georg M.
full_name: Bruun, Georg M.
last_name: Bruun
citation:
ama: Al Hyder R, Colussi VE, Čufar M, Brand J, Recati A, Bruun GM. Lattice Bose
polarons at strong coupling and quantum criticality. Scipost Physics. 2025;19(1).
doi:10.21468/SciPostPhys.19.1.002
apa: Al Hyder, R., Colussi, V. E., Čufar, M., Brand, J., Recati, A., & Bruun,
G. M. (2025). Lattice Bose polarons at strong coupling and quantum criticality.
Scipost Physics. SciPost Foundation. https://doi.org/10.21468/SciPostPhys.19.1.002
chicago: Al Hyder, Ragheed, Victor E. Colussi, Matija Čufar, Joachim Brand, Alessio
Recati, and Georg M. Bruun. “Lattice Bose Polarons at Strong Coupling and Quantum
Criticality.” Scipost Physics. SciPost Foundation, 2025. https://doi.org/10.21468/SciPostPhys.19.1.002.
ieee: R. Al Hyder, V. E. Colussi, M. Čufar, J. Brand, A. Recati, and G. M. Bruun,
“Lattice Bose polarons at strong coupling and quantum criticality,” Scipost
Physics, vol. 19, no. 1. SciPost Foundation, 2025.
ista: Al Hyder R, Colussi VE, Čufar M, Brand J, Recati A, Bruun GM. 2025. Lattice
Bose polarons at strong coupling and quantum criticality. Scipost Physics. 19(1),
002.
mla: Al Hyder, Ragheed, et al. “Lattice Bose Polarons at Strong Coupling and Quantum
Criticality.” Scipost Physics, vol. 19, no. 1, 002, SciPost Foundation,
2025, doi:10.21468/SciPostPhys.19.1.002.
short: R. Al Hyder, V.E. Colussi, M. Čufar, J. Brand, A. Recati, G.M. Bruun, Scipost
Physics 19 (2025).
corr_author: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-07-01T00:00:00Z
date_updated: 2025-09-30T14:00:26Z
day: '01'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.21468/SciPostPhys.19.1.002
external_id:
arxiv:
- '2412.07597'
isi:
- '001523515000002'
file:
- access_level: open_access
checksum: a2ce71aab685b7ea29e7abcf81e2fcc1
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T07:02:38Z
date_updated: 2025-07-14T07:02:38Z
file_id: '20014'
file_name: 2025_SciPostPhys_AlHyder.pdf
file_size: 9769204
relation: main_file
success: 1
file_date_updated: 2025-07-14T07:02:38Z
has_accepted_license: '1'
intvolume: ' 19'
isi: 1
issue: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: Scipost Physics
publication_identifier:
eissn:
- 2542-4653
publication_status: published
publisher: SciPost Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: Lattice Bose polarons at strong coupling and quantum criticality
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 19
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20004'
abstract:
- lang: eng
text: "A long-standing conjecture of Eckhoff, Linhart, and Welzl, which would generalize
McMullen’s Upper Bound Theorem for polytopes and refine asymptotic bounds due
to Clarkson, asserts that for k ⩽ ⌊(n-d-2)/2⌋, the complexity of the (⩽ k)-level
in a simple arrangement of n hemispheres in S^d is maximized for arrangements
that are polar duals of neighborly d-polytopes. We prove this conjecture in the
case n = d+4. By Gale duality, this implies the following result about crossing
numbers: In every spherical arc drawing of K_n in S² (given by a set V ⊂ S² of
n unit vectors connected by spherical arcs), the number of crossings is at least
1/4 ⌊n/2⌋ ⌊(n-1)/2⌋ ⌊(n-2)/2⌋ ⌊(n-3)/2⌋. This lower bound is attained if every
open linear halfspace contains at least ⌊(n-2)/2⌋ of the vectors in V.\r\nMoreover,
we determine the space of all linear and affine relations that hold between the
face numbers of levels in simple arrangements of n hemispheres in S^d. This completes
a long line of research on such relations, answers a question posed by Andrzejak
and Welzl in 2003, and generalizes the classical fact that the Dehn-Sommerville
relations generate all linear relations between the face numbers of simple polytopes
(which correspond to the 0-level).\r\nTo prove these results, we introduce the
notion of the g-matrix, which encodes the face numbers of levels in an arrangement
and generalizes the classical g-vector of a polytope."
alternative_title:
- LIPIcs
article_number: '75'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Elizaveta
full_name: Streltsova, Elizaveta
id: 57a170da-dc96-11ea-b7c8-ab3565071bf7
last_name: Streltsova
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: 'Streltsova E, Wagner U. Levels in arrangements: Linear relations, the g-matrix,
and applications to crossing numbers. In: 41st International Symposium on
Computational Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik;
2025. doi:10.4230/LIPIcs.SoCG.2025.75'
apa: 'Streltsova, E., & Wagner, U. (2025). Levels in arrangements: Linear relations,
the g-matrix, and applications to crossing numbers. In 41st International
Symposium on Computational Geometry (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2025.75'
chicago: 'Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear
Relations, the g-Matrix, and Applications to Crossing Numbers.” In 41st International
Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.75.'
ieee: 'E. Streltsova and U. Wagner, “Levels in arrangements: Linear relations, the
g-matrix, and applications to crossing numbers,” in 41st International Symposium
on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.'
ista: 'Streltsova E, Wagner U. 2025. Levels in arrangements: Linear relations, the
g-matrix, and applications to crossing numbers. 41st International Symposium
on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs,
vol. 332, 75.'
mla: 'Streltsova, Elizaveta, and Uli Wagner. “Levels in Arrangements: Linear Relations,
the g-Matrix, and Applications to Crossing Numbers.” 41st International Symposium
on Computational Geometry, vol. 332, 75, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.75.'
short: E. Streltsova, U. Wagner, in:, 41st International Symposium on Computational
Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
conference:
end_date: 2025-06-27
location: Kanazawa, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2025-06-23
corr_author: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2025-07-14T07:19:19Z
day: '20'
ddc:
- '510'
department:
- _id: UlWa
doi: 10.4230/LIPIcs.SoCG.2025.75
external_id:
arxiv:
- '2504.07752'
- '2504.07770'
file:
- access_level: open_access
checksum: a8f7feb1aa3b896e31195841a989d622
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T07:11:04Z
date_updated: 2025-07-14T07:11:04Z
file_id: '20015'
file_name: 2025_LIPIcs.SoCG_Streltsova.pdf
file_size: 952807
relation: main_file
success: 1
file_date_updated: 2025-07-14T07:11:04Z
has_accepted_license: '1'
intvolume: ' 332'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: ' 41st International Symposium on Computational Geometry'
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773706'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Levels in arrangements: Linear relations, the g-matrix, and applications to
crossing numbers'
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: 332
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20005'
abstract:
- lang: eng
text: "We generalize a classical result by Boris Delaunay that introduced Delaunay
triangulations. In particular, we prove that for a locally finite and coarsely
dense generic point set A in ℝ^d, every generic point of ℝ^d belongs to exactly
binom(d+k,d) simplices whose vertices belong to A and whose circumspheres enclose
exactly k points of A. We extend this result to the cases in which the points
are weighted, and when A contains only finitely many points in ℝ^d or in \U0001D54A^d.
Furthermore, we use the result to give a new geometric proof for the fact that
volumes of hypersimplices are Eulerian numbers."
acknowledgement: "Herbert Edelsbrunner: partially supported by the Wittgenstein Prize,
Austrian Science\r\nFund (FWF), grant no. Z 342-N31, and by the DFG Collaborative
Research Center TRR 109,\r\nAustrian Science Fund (FWF), grant no. I 02979-N35.\r\nAlexey
Garber: partially supported by the Simons Foundation.\r\nMorteza Saghafian: partially
supported by the Wittgenstein Prize, Austrian Science Fund (FWF),\r\ngrant no. Z
342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science\r\nFund
(FWF), grant no. I 02979-N35"
alternative_title:
- LIPIcs
article_number: '43'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Alexey
full_name: Garber, Alexey
last_name: Garber
- first_name: Morteza
full_name: Saghafian, Morteza
id: f86f7148-b140-11ec-9577-95435b8df824
last_name: Saghafian
citation:
ama: 'Edelsbrunner H, Garber A, Saghafian M. On spheres with k points inside. In:
41st International Symposium on Computational Geometry. Vol 332. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.SoCG.2025.43'
apa: 'Edelsbrunner, H., Garber, A., & Saghafian, M. (2025). On spheres with
k points inside. In 41st International Symposium on Computational Geometry
(Vol. 332). Kanazawa, Japan: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.SoCG.2025.43'
chicago: Edelsbrunner, Herbert, Alexey Garber, and Morteza Saghafian. “On Spheres
with k Points Inside.” In 41st International Symposium on Computational Geometry,
Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.43.
ieee: H. Edelsbrunner, A. Garber, and M. Saghafian, “On spheres with k points inside,”
in 41st International Symposium on Computational Geometry, Kanazawa, Japan,
2025, vol. 332.
ista: 'Edelsbrunner H, Garber A, Saghafian M. 2025. On spheres with k points inside.
41st International Symposium on Computational Geometry. SoCG: Symposium on Computational
Geometry, LIPIcs, vol. 332, 43.'
mla: Edelsbrunner, Herbert, et al. “On Spheres with k Points Inside.” 41st International
Symposium on Computational Geometry, vol. 332, 43, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.43.
short: H. Edelsbrunner, A. Garber, M. Saghafian, in:, 41st International Symposium
on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2025.
conference:
end_date: 2025-06-27
location: Kanazawa, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2025-06-23
corr_author: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2025-07-14T07:26:14Z
day: '20'
ddc:
- '510'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2025.43
external_id:
arxiv:
- '2410.21204'
file:
- access_level: open_access
checksum: b5313ed8575ea87913c71a6e3c7513c8
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T07:24:22Z
date_updated: 2025-07-14T07:24:22Z
file_id: '20016'
file_name: 2025_LIPIcs.SoCG_Edelsbrunner.pdf
file_size: 661893
relation: main_file
success: 1
file_date_updated: 2025-07-14T07:24:22Z
has_accepted_license: '1'
intvolume: ' 332'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
publication: 41st International Symposium on Computational Geometry
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773706'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: On spheres with k points inside
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: 332
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20006'
abstract:
- lang: eng
text: In numerous fields, dynamic time series data require continuous updates, necessitating
efficient data processing techniques for accurate analysis. This paper examines
the banana tree data structure, specifically designed to efficiently maintain
the multi-scale topological descriptor commonly known as persistent homology for
dynamically changing time series data. We implement this data structure and conduct
an experimental study to assess its properties and runtime for update operations.
Our findings indicate that banana trees are highly effective with unbiased random
data, outperforming state-of-the-art static algorithms in these scenarios. Additionally,
our results show that real-world time series share structural properties with
unbiased random walks, suggesting potential practical utility for our implementation.
acknowledgement: "Lara Ost: Supported by the Vienna Graduate School on Computational
Optimization\r\n(VGSCO), FWF project no. W1260-N35.\r\nSebastiano Cultrera di Montesano:
Supported by the Eric and Wendy Schmidt Center at the Broad Institute of MIT and
Harvard.\r\nHerbert Edelsbrunner: Partially supported by the Wittgenstein Prize,
FWF grant no. Z 342-N31,\r\nand by the DFG Collaborative Research Center TRR 109,
FWF grant no. I 02979-N35."
alternative_title:
- LIPIcs
article_number: '71'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Lara
full_name: Ost, Lara
last_name: Ost
- first_name: Sebastiano
full_name: Cultrera di Montesano, Sebastiano
id: 34D2A09C-F248-11E8-B48F-1D18A9856A87
last_name: Cultrera di Montesano
orcid: 0000-0001-6249-0832
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
citation:
ama: 'Ost L, Cultrera di Montesano S, Edelsbrunner H. Banana trees for the persistence
in time series experimentally. In: 41st International Symposium on Computational
Geometry. Vol 332. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025.
doi:10.4230/LIPIcs.SoCG.2025.71'
apa: 'Ost, L., Cultrera di Montesano, S., & Edelsbrunner, H. (2025). Banana
trees for the persistence in time series experimentally. In 41st International
Symposium on Computational Geometry (Vol. 332). Kanazawa, Japan: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2025.71'
chicago: Ost, Lara, Sebastiano Cultrera di Montesano, and Herbert Edelsbrunner.
“Banana Trees for the Persistence in Time Series Experimentally.” In 41st International
Symposium on Computational Geometry, Vol. 332. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2025. https://doi.org/10.4230/LIPIcs.SoCG.2025.71.
ieee: L. Ost, S. Cultrera di Montesano, and H. Edelsbrunner, “Banana trees for the
persistence in time series experimentally,” in 41st International Symposium
on Computational Geometry, Kanazawa, Japan, 2025, vol. 332.
ista: 'Ost L, Cultrera di Montesano S, Edelsbrunner H. 2025. Banana trees for the
persistence in time series experimentally. 41st International Symposium on Computational
Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 332, 71.'
mla: Ost, Lara, et al. “Banana Trees for the Persistence in Time Series Experimentally.”
41st International Symposium on Computational Geometry, vol. 332, 71, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.SoCG.2025.71.
short: L. Ost, S. Cultrera di Montesano, H. Edelsbrunner, in:, 41st International
Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2025.
conference:
end_date: 2025-06-27
location: Kanazawa, Japan
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2025-06-23
corr_author: '1'
date_created: 2025-07-13T22:01:22Z
date_published: 2025-06-20T00:00:00Z
date_updated: 2025-12-30T11:04:33Z
day: '20'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2025.71
external_id:
arxiv:
- '2405.17920'
file:
- access_level: open_access
checksum: 3a4a7a707a56e0cfdf51428782dee55a
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T08:23:38Z
date_updated: 2025-07-14T08:23:38Z
file_id: '20017'
file_name: 2025_LIPIcs.SoCG_Ost.pdf
file_size: 834623
relation: main_file
success: 1
file_date_updated: 2025-07-14T08:23:38Z
has_accepted_license: '1'
intvolume: ' 332'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
publication: 41st International Symposium on Computational Geometry
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773706'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/laraost/BananaPersist
scopus_import: '1'
status: public
title: Banana trees for the persistence in time series experimentally
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: 332
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20007'
abstract:
- lang: eng
text: 'There is no known polynomial-time algorithm for graph isomorphism testing,
but elementary combinatorial “refinement” algorithms seem to be very efficient
in practice. Some philosophical justification for this phenomenon is provided
by a classical theorem of Babai, Erdős and Selkow: an extremely simple polynomial-time
combinatorial algorithm (variously known as “naïve refinement”, “naïve vertex
classification”, “colour refinement” or the “1-dimensional Weisfeiler–Leman algorithm”)
yields a so-called canonical labelling scheme for “almost all graphs”. More precisely,
for a typical outcome of a random graph G(n,1/2), this simple combinatorial algorithm
assigns labels to vertices in a way that easily permits isomorphism-testing against
any other graph.'
acknowledgement: All authors were supported by ERC Starting Grant “RANDSTRUCT” No.
101076777. Michael Anastos was also supported in part by the Austrian Science Fund
(FWF)[10.55776/ESP3863424] and by the European Union’s Horizon 2020 research and
innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.
For Open Access purposes, the authors have applied a CC BY public copyright license
to any author accepted manuscript version arising from this submission.
article_processing_charge: Yes (via OA deal)
arxiv: 1
author:
- first_name: Michael
full_name: Anastos, Michael
id: 0b2a4358-bb35-11ec-b7b9-e3279b593dbb
last_name: Anastos
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Benjamin
full_name: Moore, Benjamin
id: 6dc1a1be-bf1c-11ed-8d2b-d044840f49d6
last_name: Moore
citation:
ama: 'Anastos M, Kwan MA, Moore B. Smoothed analysis for graph isomorphism. In:
Proceedings of the 57th Annual ACM Symposium on Theory of Computing. Association
for Computing Machinery; 2025:2098-2106. doi:10.1145/3717823.3718173'
apa: 'Anastos, M., Kwan, M. A., & Moore, B. (2025). Smoothed analysis for graph
isomorphism. In Proceedings of the 57th Annual ACM Symposium on Theory of Computing
(pp. 2098–2106). Prague, Czechia: Association for Computing Machinery. https://doi.org/10.1145/3717823.3718173'
chicago: Anastos, Michael, Matthew Alan Kwan, and Benjamin Moore. “Smoothed Analysis
for Graph Isomorphism.” In Proceedings of the 57th Annual ACM Symposium on
Theory of Computing, 2098–2106. Association for Computing Machinery, 2025.
https://doi.org/10.1145/3717823.3718173.
ieee: M. Anastos, M. A. Kwan, and B. Moore, “Smoothed analysis for graph isomorphism,”
in Proceedings of the 57th Annual ACM Symposium on Theory of Computing,
Prague, Czechia, 2025, pp. 2098–2106.
ista: 'Anastos M, Kwan MA, Moore B. 2025. Smoothed analysis for graph isomorphism.
Proceedings of the 57th Annual ACM Symposium on Theory of Computing. STOC: Symposium
on Theory of Computing, 2098–2106.'
mla: Anastos, Michael, et al. “Smoothed Analysis for Graph Isomorphism.” Proceedings
of the 57th Annual ACM Symposium on Theory of Computing, Association for Computing
Machinery, 2025, pp. 2098–106, doi:10.1145/3717823.3718173.
short: M. Anastos, M.A. Kwan, B. Moore, in:, Proceedings of the 57th Annual ACM
Symposium on Theory of Computing, Association for Computing Machinery, 2025, pp.
2098–2106.
conference:
end_date: 2025-06-27
location: Prague, Czechia
name: 'STOC: Symposium on Theory of Computing'
start_date: 2025-06-23
corr_author: '1'
date_created: 2025-07-13T22:01:23Z
date_published: 2025-06-15T00:00:00Z
date_updated: 2025-07-14T06:33:50Z
day: '15'
ddc:
- '000'
department:
- _id: MaKw
doi: 10.1145/3717823.3718173
ec_funded: 1
external_id:
arxiv:
- '2410.06095'
file:
- access_level: open_access
checksum: cf0ab9cb9c6abda188de13dc3f9a4c9b
content_type: application/pdf
creator: dernst
date_created: 2025-07-14T06:13:10Z
date_updated: 2025-07-14T06:13:10Z
file_id: '20012'
file_name: 2025_STOC_Anastos.pdf
file_size: 706445
relation: main_file
success: 1
file_date_updated: 2025-07-14T06:13:10Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 2098-2106
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
- _id: 8f906bd2-16d5-11f0-9cad-e07be8aa9ac9
grant_number: ESP3863424
name: Combinatorial Optimisation Problems on Sparse Random Graphs
publication: Proceedings of the 57th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9798400715105'
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Smoothed analysis for graph isomorphism
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '20009'
abstract:
- lang: eng
text: The suppression of recombination between young X and Y chromosomes is a crucial
step in their evolution, but why it occurs is not known. The detailed characterization
of the polymorphic sex chromosomes of the fourspine stickleback by Liu et al.
promises to shed new light on this longstanding question.
acknowledgement: I thank the Vicoso group for in-depth discussions of the original
article highlighted here. This work was supported by an Austrian Research Fund (FWF)
grant to B.V. (PAT 8748323).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Vicoso B. Sex chromosome evolution in action in fourspine sticklebacks. Trends
in Ecology and Evolution. 2025;40(8):728-730. doi:10.1016/j.tree.2025.06.010
apa: Vicoso, B. (2025). Sex chromosome evolution in action in fourspine sticklebacks.
Trends in Ecology and Evolution. Elsevier. https://doi.org/10.1016/j.tree.2025.06.010
chicago: Vicoso, Beatriz. “Sex Chromosome Evolution in Action in Fourspine Sticklebacks.”
Trends in Ecology and Evolution. Elsevier, 2025. https://doi.org/10.1016/j.tree.2025.06.010.
ieee: B. Vicoso, “Sex chromosome evolution in action in fourspine sticklebacks,”
Trends in Ecology and Evolution, vol. 40, no. 8. Elsevier, pp. 728–730,
2025.
ista: Vicoso B. 2025. Sex chromosome evolution in action in fourspine sticklebacks.
Trends in Ecology and Evolution. 40(8), 728–730.
mla: Vicoso, Beatriz. “Sex Chromosome Evolution in Action in Fourspine Sticklebacks.”
Trends in Ecology and Evolution, vol. 40, no. 8, Elsevier, 2025, pp. 728–30,
doi:10.1016/j.tree.2025.06.010.
short: B. Vicoso, Trends in Ecology and Evolution 40 (2025) 728–730.
corr_author: '1'
date_created: 2025-07-13T22:01:23Z
date_published: 2025-08-01T00:00:00Z
date_updated: 2025-12-30T09:22:29Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1016/j.tree.2025.06.010
external_id:
isi:
- '001550437400006'
file:
- access_level: open_access
checksum: 0a7c6e8600c878dac7082681e4409b50
content_type: application/pdf
creator: dernst
date_created: 2025-12-30T09:21:14Z
date_updated: 2025-12-30T09:21:14Z
file_id: '20905'
file_name: 2025_TrendsEcoloEvolution_Vicoso.pdf
file_size: 699156
relation: main_file
success: 1
file_date_updated: 2025-12-30T09:21:14Z
has_accepted_license: '1'
intvolume: ' 40'
isi: 1
issue: '8'
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
page: 728-730
project:
- _id: 8ed82125-16d5-11f0-9cad-fbcae312235b
grant_number: PAT 8748323
name: Sex chromosomes in evolution and development
publication: Trends in Ecology and Evolution
publication_identifier:
issn:
- 0169-5347
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sex chromosome evolution in action in fourspine sticklebacks
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: 40
year: '2025'
...