---
OA_place: repository
OA_type: green
_id: '22302'
abstract:
- lang: eng
text: "Speculative generation has emerged as a promising technique to accelerate
inference in large language models (LLMs) by leveraging parallelism to verify
multiple draft tokens simultaneously. However, the fundamental limits on the achievable
speedup remain poorly understood. In this work, we establish the first “tight”
lower bounds on the runtime of any deterministic speculative generation algorithm.
This is achieved by drawing a parallel between the token generation process and
branching random walks, which allows us to analyze the optimal draft tree selection
problem. We prove, under basic assumptions, that the expected number of tokens
successfully predicted per speculative iteration is bounded as \\mathbb{E}[X]
≤ (\U0001D707 + \U0001D707(2))log(B )/\U0001D7072 + O(1), where B is the verifier’s
batch size, \U0001D707 is the expected entropy of the verifier’s output distribution,
and \U0001D707(2) is this entropy’s second moment. This result provides new insights
into the limits of parallel token generation, and could guide the design of future
speculative decoding systems. Empirical evaluations on Llama models validate our
theoretical predictions, confirming the tightness of our bounds in practical settings."
article_processing_charge: No
arxiv: 1
author:
- first_name: Sergei
full_name: Pankratov, Sergei
id: f773bf05-72ef-11ef-b75a-a383d22f454b
last_name: Pankratov
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Pankratov S, Alistarh D-A. Speculative decoding speed-of-light: Optimal lower
bounds via branching random walks. In: Proceedings of the 19th Conference of
the European Chapter of the Association for Computational Linguistics. Association
for Computational Linguistics; 2026:6404–6418. doi:10.18653/v1/2026.eacl-long.301'
apa: 'Pankratov, S., & Alistarh, D.-A. (2026). Speculative decoding speed-of-light:
Optimal lower bounds via branching random walks. In Proceedings of the 19th
Conference of the European Chapter of the Association for Computational Linguistics
(pp. 6404–6418). Rabat, Morocco: Association for Computational Linguistics. https://doi.org/10.18653/v1/2026.eacl-long.301'
chicago: 'Pankratov, Sergei, and Dan-Adrian Alistarh. “Speculative Decoding Speed-of-Light:
Optimal Lower Bounds via Branching Random Walks.” In Proceedings of the 19th
Conference of the European Chapter of the Association for Computational Linguistics,
6404–6418. Association for Computational Linguistics, 2026. https://doi.org/10.18653/v1/2026.eacl-long.301.'
ieee: 'S. Pankratov and D.-A. Alistarh, “Speculative decoding speed-of-light: Optimal
lower bounds via branching random walks,” in Proceedings of the 19th Conference
of the European Chapter of the Association for Computational Linguistics,
Rabat, Morocco, 2026, pp. 6404–6418.'
ista: 'Pankratov S, Alistarh D-A. 2026. Speculative decoding speed-of-light: Optimal
lower bounds via branching random walks. Proceedings of the 19th Conference of
the European Chapter of the Association for Computational Linguistics. EACL:
Conference of the European Chapter of the Association for Computational Linguistics,
6404–6418.'
mla: 'Pankratov, Sergei, and Dan-Adrian Alistarh. “Speculative Decoding Speed-of-Light:
Optimal Lower Bounds via Branching Random Walks.” Proceedings of the 19th Conference
of the European Chapter of the Association for Computational Linguistics,
Association for Computational Linguistics, 2026, pp. 6404–6418, doi:10.18653/v1/2026.eacl-long.301.'
short: S. Pankratov, D.-A. Alistarh, in:, Proceedings of the 19th Conference of
the European Chapter of the Association for Computational Linguistics, Association
for Computational Linguistics, 2026, pp. 6404–6418.
conference:
end_date: 2026-03-29
location: Rabat, Morocco
name: 'EACL: Conference of the European Chapter of the Association for Computational
Linguistics'
start_date: 2026-03-24
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-13T10:48:03Z
date_published: 2026-04-01T00:00:00Z
date_updated: 2026-07-14T06:18:11Z
day: '01'
department:
- _id: DaAl
- _id: GradSch
doi: 10.18653/v1/2026.eacl-long.301
external_id:
arxiv:
- '2512.11718'
fulldoi: https://doi.org/10.18653/v1/2026.eacl-long.301
language:
- iso: eng
month: '04'
oa_version: Preprint
page: 6404–6418
publication: Proceedings of the 19th Conference of the European Chapter of the Association
for Computational Linguistics
publication_status: published
publisher: Association for Computational Linguistics
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Speculative decoding speed-of-light: Optimal lower bounds via branching random
walks'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: green
_id: '22276'
abstract:
- lang: eng
text: Tissue tension is a key determinant of tissue shape, and its regulation is
essential for both morphogenesis and the maintenance of tissue integrity. During
zebrafish embryogenesis, the enveloping layer (EVL) – an epithelial monolayer
covering the blastoderm – undergoes extensive spreading that is driven by pulling
forces exerted at its margin and more than doubles its surface area. Yet whether
and how the EVL actively regulates its tissue tension during this process remains
unclear. Here, we show that the EVL maintains constant tissue tension while spreading,
and that it achieves this by reducing apical cell contractility in response to
the same pulling forces that drive its spreading. We identify a mechanosensitive
pathway underlying this response, mediated by the scaffold/adaptor protein Kibra
regulating the activity of atypical protein kinase C (aPKC) at the apical domain
of EVL cells. Under low mechanical stretch, Kibra forms condensates at the base
of actin-based apical projections, where it activates Myosin II to increase apical
contractility through aPKC downregulation. As mechanical stretch increases, apical
projections disassemble, Kibra condensates dissolve, and aPKC activity rises.
Elevated aPKC activity in turn reduces apical contractility by reducing Myosin
II activity, thereby maintaining constant tissue tension despite increased mechanical
stretch. Together, these findings reveal a mechanosensitive mechanism that enables
robust adaptation of tissue tension to changing mechanical stretch, ensuring efficient
tissue spreading and morphogenesis.
acknowledged_ssus:
- _id: Bio
- _id: LifeSc
- _id: EM-Fac
acknowledgement: We thank all members of the Heisenberg group for discussion and feedback
on the manuscript, and the Imaging and Optics Facility, the Life Science Support
Facility and the Electron Microscopy Facility of the Institute of Science and Technology
Austria (ISTA) for their continued support. We are grateful to M. Sonawane (Tata
Institute of Fundamental Research, India) for providing the pCS2-HA-aPKC (PKCι)-V260F
(DN) and pCS2-HA-aPKC (PKCι)-A122E (CA) plasmids, and to I. Mayer for the discussion.
Molecular graphics and analyses were performed with UCSF ChimeraX, developed by
the Resource for Biocomputing, Visualization, and Informatics at the University
of California, San Francisco, with support from National Institutes of Health R01-GM129325
and the Office of Cyber Infrastructure and Computational Biology, National Institute
of Allergy and Infectious Diseases. This research was funded in whole or in part
by the Austrian Science Fund (FWF; grant no. PAT5044023) to C.-P.H., and by a JSPS
Overseas Research Fellowship and an EMBO Postdoctoral Fellowship (ALTF 16-2022)
to N.H.
article_processing_charge: No
author:
- first_name: Naoya
full_name: Hino, Naoya
id: 5299a9ce-7679-11eb-a7bc-d1e62b936307
last_name: Hino
- first_name: Tushna
full_name: Kapoor, Tushna
id: e3b3eda7-fd4d-11eb-8fd8-c40af7a478b1
last_name: Kapoor
- first_name: Uday R
full_name: Gubbala, Uday R
id: bb4a0dc4-32c9-11ee-b5ce-a97ceedd5924
last_name: Gubbala
- first_name: Edouard B
full_name: Hannezo, Edouard B
id: 3A9DB764-F248-11E8-B48F-1D18A9856A87
last_name: Hannezo
orcid: 0000-0001-6005-1561
- first_name: Carl-Philipp J
full_name: Heisenberg, Carl-Philipp J
id: 39427864-F248-11E8-B48F-1D18A9856A87
last_name: Heisenberg
orcid: 0000-0002-0912-4566
citation:
ama: Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation
regulates tissue tension homeostasis.
apa: Hino, N., Kapoor, T., Gubbala, U. R., Hannezo, E. B., & Heisenberg, C.-P.
J. (n.d.). Apical domain mechanosensation regulates tissue tension homeostasis.
Institute of Science and Technology Austria.
chicago: Hino, Naoya, Tushna Kapoor, Uday R Gubbala, Edouard B Hannezo, and Carl-Philipp
J Heisenberg. “Apical Domain Mechanosensation Regulates Tissue Tension Homeostasis.”
Institute of Science and Technology Austria, n.d.
ieee: N. Hino, T. Kapoor, U. R. Gubbala, E. B. Hannezo, and C.-P. J. Heisenberg,
“Apical domain mechanosensation regulates tissue tension homeostasis.” Institute
of Science and Technology Austria.
ista: Hino N, Kapoor T, Gubbala UR, Hannezo EB, Heisenberg C-PJ. Apical domain mechanosensation
regulates tissue tension homeostasis.
mla: Hino, Naoya, et al. Apical Domain Mechanosensation Regulates Tissue Tension
Homeostasis. Institute of Science and Technology Austria.
short: N. Hino, T. Kapoor, U.R. Gubbala, E.B. Hannezo, C.-P.J. Heisenberg, (n.d.).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "The MATLAB code for image analysis, and the full model
code, including all parameter values\r\nand condition-specific settings, are available
on GitHub at https://github.com/uday2607/EVL-tension-homeostasis.git."
date_created: 2026-07-13T09:03:26Z
date_published: 2026-07-14T00:00:00Z
date_updated: 2026-07-14T07:07:41Z
day: '14'
ddc:
- '570'
department:
- _id: CaHe
- _id: EdHa
- _id: GradSch
file:
- access_level: open_access
checksum: 66444afd243dce7d383d52d44e8d34a4
content_type: application/pdf
creator: nhino
date_created: 2026-07-13T09:16:20Z
date_updated: 2026-07-13T09:16:20Z
file_id: '22283'
file_name: Main_text_and_figures.pdf
file_size: 12477675
relation: main_file
success: 1
- access_level: open_access
checksum: 90bceb34de64ec792c5de117f0890d05
content_type: application/pdf
creator: nhino
date_created: 2026-07-13T09:16:25Z
date_updated: 2026-07-13T09:16:25Z
file_id: '22284'
file_name: Supplementary_figures.pdf
file_size: 4545901
relation: main_file
success: 1
- access_level: open_access
checksum: 9d9ab89c372142f2ffb6c8c625334d7f
content_type: video/mp4
creator: nhino
date_created: 2026-07-13T09:16:28Z
date_updated: 2026-07-13T09:16:28Z
file_id: '22285'
file_name: Supplementary_Video1.mp4
file_size: 10349451
relation: main_file
success: 1
file_date_updated: 2026-07-13T09:16:28Z
has_accepted_license: '1'
keyword:
- Epithelial spreading
- tissue tension
- mechanosensation
- aPKC
- Kibra
- zebrafish
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '07'
oa: 1
oa_version: Preprint
project:
- _id: 8f060199-16d5-11f0-9cad-f3253b266c46
grant_number: PAT 5044023
name: Keratins in epithelial tissue spreading
- _id: 34dd7f3b-11ca-11ed-8bc3-856f2c87f5da
grant_number: LTF 16-2022
name: Mechanosensitive signaling activation in the crosstalk between mechanical
force and tissuefluidity
publication_status: draft
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '21864'
relation: earlier_version
status: public
researchdata_availability: yes
status: public
supplementarymaterial: yes
title: Apical domain mechanosensation regulates tissue tension homeostasis
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: preprint
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22322'
abstract:
- lang: eng
text: "We study the problem of continually releasing statistics of an evolving dataset
under differential privacy. In the event-level setting, we show the first polynomial
lower bounds on the additive error for insertions-only graph problems such as
maximum matching, degree histogram and k-core number computation. These results
represent an exponential improvement on the polylogarithmic lower bounds of Fichtenberger,
Henzinger and Ost [ESA 2021] for the former two problems, and are the first lower
bounds in the continual release setting for the latter problem. Our results run
counter to the intuition that the difference between insertions-only vs fully
dynamic updates causes the gap between polylogarithmic and polynomial additive
error. Indeed, we show that for estimating the size of the maximum matching or
k-core number of a vertex, allowing small multiplicative approximations is what
brings the additive error down to polylogarithmic. We complement these results
with improved upper bounds on the additive error when no multiplicative approximation
is allowed.\r\nBeyond graphs, our techniques also show that polynomial additive
error is unavoidable for the Simultaneous Norm Estimation problem in the insertions-only
setting. When multiplicative approximations are allowed, we circumvent this lower
bound by giving the first continual mechanism with polylogarithmic additive error
under (1 + ζ) multiplicative approximations, for any ζ > 0, for estimating all
monotone symmetric norms simultaneously.\r\nIn the item-level setting, we show
polynomial lower bounds on the product of the multiplicative and the additive
error of continual mechanisms for a large range of graph problems. To the best
of our knowledge, these are the first lower bounds shown for any differentially
private mechanism under continual release with multiplicative error. To obtain
these results, we prove a new lower bound on the product of multiplicative and
additive error for the 1-Way-Marginals problem, and give reductions from 1-Way-Marginals
to our desired graph problems. This generalizes the prior results of Hardt and
Talwar [STOC 2010] and Bun, Ullman and Vadhan [STOC 2014, SIAM J. Comput. 2018],
who gave lower bounds on the additive error for the special case of mechanisms
with no multiplicative error."
acknowledgement: "Bardiya Aryanfard and Monika Henzinger were supported by the European
Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation
programme (Grant agreement\r\nNo. 101019564). For open access purposes, the author
has applied a CC BY public copyright\r\nlicense to any author-accepted manuscript
version arising from this submission. Funded by the\r\nEuropean union. Views and
opinions expressed are however those of the author(s) only and do\r\nnot necessarily
reflect those of the European Union or the European Research Council Executive\r\nAgency.
Neither the European Union nor the granting authority can be held responsible for
them"
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Bardiya
full_name: Aryanfard, Bardiya
id: 1e8f4084-31df-11ee-b195-f706b4b77091
last_name: Aryanfard
- 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: David
full_name: Saulpic, David
id: f8e48cf0-b0ff-11ed-b0e9-b4c35598f964
last_name: Saulpic
- first_name: A. R.
full_name: Sricharan, A. R.
last_name: Sricharan
citation:
ama: Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. Improved lower bounds for
privacy under continual release. Proceedings of the ACM on Management of Data.
2026;4(2):1-27. doi:10.1145/3801903
apa: Aryanfard, B., Henzinger, M., Saulpic, D., & Sricharan, A. R. (2026). Improved
lower bounds for privacy under continual release. Proceedings of the ACM on
Management of Data. Association for Computing Machinery. https://doi.org/10.1145/3801903
chicago: Aryanfard, Bardiya, Monika Henzinger, David Saulpic, and A. R. Sricharan.
“Improved Lower Bounds for Privacy under Continual Release.” Proceedings of
the ACM on Management of Data. Association for Computing Machinery, 2026.
https://doi.org/10.1145/3801903.
ieee: B. Aryanfard, M. Henzinger, D. Saulpic, and A. R. Sricharan, “Improved lower
bounds for privacy under continual release,” Proceedings of the ACM on Management
of Data, vol. 4, no. 2. Association for Computing Machinery, pp. 1–27, 2026.
ista: Aryanfard B, Henzinger M, Saulpic D, Sricharan AR. 2026. Improved lower bounds
for privacy under continual release. Proceedings of the ACM on Management of Data.
4(2), 1–27.
mla: Aryanfard, Bardiya, et al. “Improved Lower Bounds for Privacy under Continual
Release.” Proceedings of the ACM on Management of Data, vol. 4, no. 2,
Association for Computing Machinery, 2026, pp. 1–27, doi:10.1145/3801903.
short: B. Aryanfard, M. Henzinger, D. Saulpic, A.R. Sricharan, Proceedings of the
ACM on Management of Data 4 (2026) 1–27.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-14T05:33:58Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-07-16T09:30:31Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
- _id: GradSch
doi: 10.1145/3801903
ec_funded: 1
external_id:
arxiv:
- '2512.15981'
file:
- access_level: open_access
checksum: 21a48a620e415a31a3874077c55bc6c3
content_type: application/pdf
creator: dernst
date_created: 2026-07-16T09:29:08Z
date_updated: 2026-07-16T09:29:08Z
file_id: '22349'
file_name: 2026_ACMMgmtData_Aryanfard.pdf
file_size: 934963
relation: main_file
success: 1
file_date_updated: 2026-07-16T09:29:08Z
fulldoi: https://doi.org/10.1145/3801903
has_accepted_license: '1'
intvolume: ' 4'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1-27
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
publication: Proceedings of the ACM on Management of Data
publication_identifier:
issn:
- 2836-6573
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Improved lower bounds for privacy under continual 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: 4
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22326'
abstract:
- lang: eng
text: In many developmental systems, cells differentiate into a tissue by reading
out morphogen concentration fields, a process fundamentally limited by noise.
How much can the precision of this process be improved by nonlocal information,
e.g., via cell-cell communication? Using a Bayes-optimal framework, we show that
positional inference depends crucially on morphogen spatial correlations and on
the "structural prior" that encodes the geometry of the cellular lattice performing
the readout, thereby determining what a cell can reliably assume about the position
of its neighbors when interpreting nonlocal morphogen signals. We derive upper
bounds on positional information gain due to nonlocal readout and identify signal
processing algorithms that approximate optimal positional inference, as well as
simple chemical reaction schemes which implement such algorithms. Our theory suggests
that correlational information can be exploited to significantly enhance developmental
precision.
acknowledgement: "This work was supported in part\r\nby European Research Council
No. ERC-2023-SyG\r\n“DynaTrans” Grant No. 101118866 (G. T.). We thank\r\nPieter
Rein ten Wolde and Vahe Galstyan for stimulating\r\ndiscussions."
article_number: '038401'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Chen Y
full_name: Zhang, Chen Y
id: 81b43fb8-c9d5-11ef-bf68-ade532a1f204
last_name: Zhang
- first_name: Pablo
full_name: Mateu Hoyos, Pablo
id: 50b236c7-50c1-11ef-bb9a-a2375694f8b5
last_name: Mateu Hoyos
- first_name: David
full_name: Brückner, David
id: e1e86031-6537-11eb-953a-f7ab92be508d
last_name: Brückner
orcid: 0000-0001-7205-2975
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
citation:
ama: Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. Nonlocal decoding of positional
and correlational information during development. Physical Review Letters.
2026;137. doi:10.1103/mbjk-v4ym
apa: Zhang, C. Y., Mateu Hoyos, P., Brückner, D., & Tkačik, G. (2026). Nonlocal
decoding of positional and correlational information during development. Physical
Review Letters. American Physical Society. https://doi.org/10.1103/mbjk-v4ym
chicago: Zhang, Chen Y, Pablo Mateu Hoyos, David Brückner, and Gašper Tkačik. “Nonlocal
Decoding of Positional and Correlational Information during Development.” Physical
Review Letters. American Physical Society, 2026. https://doi.org/10.1103/mbjk-v4ym.
ieee: C. Y. Zhang, P. Mateu Hoyos, D. Brückner, and G. Tkačik, “Nonlocal decoding
of positional and correlational information during development,” Physical Review
Letters, vol. 137. American Physical Society, 2026.
ista: Zhang CY, Mateu Hoyos P, Brückner D, Tkačik G. 2026. Nonlocal decoding of
positional and correlational information during development. Physical Review Letters.
137, 038401.
mla: Zhang, Chen Y., et al. “Nonlocal Decoding of Positional and Correlational Information
during Development.” Physical Review Letters, vol. 137, 038401, American
Physical Society, 2026, doi:10.1103/mbjk-v4ym.
short: C.Y. Zhang, P. Mateu Hoyos, D. Brückner, G. Tkačik, Physical Review Letters
137 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "Code to evaluate PI, to run algorithmic implementations
of ALP and RLP decoding, and to\r\nperform simulations is publicly available at
https://github.com/alex-chenyi-zhang/nonlocdec_pici."
date_created: 2026-07-14T05:38:28Z
date_published: 2026-07-15T00:00:00Z
date_updated: 2026-07-16T09:58:04Z
day: '15'
ddc:
- '530'
department:
- _id: GaTk
- _id: EdHa
- _id: GradSch
doi: 10.1103/mbjk-v4ym
file:
- access_level: open_access
checksum: 28861d31d0f6cf541aaca04faaed1767
content_type: application/pdf
creator: dernst
date_created: 2026-07-16T09:54:55Z
date_updated: 2026-07-16T09:54:55Z
file_id: '22352'
file_name: 2026_PhysicalReviewLetters_Zhang.pdf
file_size: 2550345
relation: main_file
success: 1
file_date_updated: 2026-07-16T09:54:55Z
fulldoi: https://doi.org/10.1103/mbjk-v4ym
has_accepted_license: '1'
intvolume: ' 137'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 7bfe6a29-9f16-11ee-852c-c0da5e2045d9
grant_number: '101118866'
name: 'Transcription in 4D: the dynamic interplay between chromatin architecture
and gene expression in developing pseudo-embryos'
publication: Physical Review Letters
publication_identifier:
eissn:
- ' 1079-7114'
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Nonlocal decoding of positional and correlational information during development
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: 137
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '21777'
abstract:
- lang: eng
text: The advantageous characteristics attributed to the 19F nucleus have made it
a popular target for nuclear magnetic resonance (NMR) once again in recent years.
Aside from solution NMR, an increasing number of studies have been conducted applying
solid-state magic-angle spinning (MAS) NMR to fluorine-labelled samples. Here,
the high chemical shift anisotropy and strong dipolar couplings can be utilised
to get structural insights into proteins and measure long distances. Despite increasing
popularity and promising benefits, the sensitivity of biomolecular 19F MAS NMR
often suffers from slow longitudinal T1 relaxation and therefore long recycle
delays. In this work, we expand paramagnetic doping, an approach commonly used
to reduce proton T1 relaxation times, to 19F-labelled biological samples. We study
the effect of Gd(DTPA) and Gd(DTPA-BMA) on 19F T1 and T2, and 13C T1 and T2 relaxation
in a [5-19F13C]-tryptophan-labelled protein via 19F-detected MAS NMR experiments.
The observed paramagnetic relaxation enhancement substantially reduces measurement
times of 19F MAS NMR experiments without compromising resolution. Additionally,
we report the chemical shift assignments of all four fluorotryptophan signals
in the 12×39 kDa-large protein TET2 using a mutagenesis approach.
acknowledged_ssus:
- _id: NMR
- _id: LifeSc
acknowledgement: We thank Ben P. Tatman for insightful discussions. This research
was supported by the Scientific Service Units (SSUs) of ISTA through resources provided
by the Nuclear Magnetic Resonance Facility and the Lab Support Facility. We thank
Prof. Tobias Madl (Medical University Graz) for a sample of Omniscan. Lea M. Becker
is the recipient of a DOC fellowship of the Austrian Academy of Sciences at the
Institute of Science and Technology Austria (grant no. PR10660EAW01).
article_processing_charge: Yes
article_type: original
author:
- first_name: Lea Marie
full_name: Becker, Lea Marie
id: 36336939-eb97-11eb-a6c2-c83f1214ca79
last_name: Becker
orcid: 0000-0002-6401-5151
- first_name: Giorgia
full_name: Toscano, Giorgia
id: 334a5e40-8747-11f0-b671-ba1f5154b4b4
last_name: Toscano
- first_name: Anna
full_name: Kapitonova, Anna
id: 9fb2a840-89e1-11ee-a8b7-cc5c7ba62471
last_name: Kapitonova
- first_name: Rajkumar
full_name: Singh, Rajkumar
id: a3089acd-6806-11ee-bacc-f0c7d500ad20
last_name: Singh
- first_name: Undina
full_name: Guillerm, Undina
id: bb74f472-ae54-11eb-9835-bc9c22fb1183
last_name: Guillerm
- first_name: Roman J.
full_name: Lichtenecker, Roman J.
last_name: Lichtenecker
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: Becker LM, Toscano G, Kapitonova A, et al. Accelerated 19F biomolecular magic-angle
spinning NMR with paramagnetic dopants. Magnetic Resonance. 2026;7(1):29-37.
doi:10.5194/mr-7-29-2026
apa: Becker, L. M., Toscano, G., Kapitonova, A., Singh, R., Guillerm, U., Lichtenecker,
R. J., & Schanda, P. (2026). Accelerated 19F biomolecular magic-angle spinning
NMR with paramagnetic dopants. Magnetic Resonance. Copernicus Publications.
https://doi.org/10.5194/mr-7-29-2026
chicago: Becker, Lea Marie, Giorgia Toscano, Anna Kapitonova, Rajkumar Singh, Undina
Guillerm, Roman J. Lichtenecker, and Paul Schanda. “Accelerated 19F Biomolecular
Magic-Angle Spinning NMR with Paramagnetic Dopants.” Magnetic Resonance.
Copernicus Publications, 2026. https://doi.org/10.5194/mr-7-29-2026.
ieee: L. M. Becker et al., “Accelerated 19F biomolecular magic-angle spinning
NMR with paramagnetic dopants,” Magnetic Resonance, vol. 7, no. 1. Copernicus
Publications, pp. 29–37, 2026.
ista: Becker LM, Toscano G, Kapitonova A, Singh R, Guillerm U, Lichtenecker RJ,
Schanda P. 2026. Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic
dopants. Magnetic Resonance. 7(1), 29–37.
mla: Becker, Lea Marie, et al. “Accelerated 19F Biomolecular Magic-Angle Spinning
NMR with Paramagnetic Dopants.” Magnetic Resonance, vol. 7, no. 1, Copernicus
Publications, 2026, pp. 29–37, doi:10.5194/mr-7-29-2026.
short: L.M. Becker, G. Toscano, A. Kapitonova, R. Singh, U. Guillerm, R.J. Lichtenecker,
P. Schanda, Magnetic Resonance 7 (2026) 29–37.
corr_author: '1'
date_created: 2026-05-03T22:01:36Z
date_published: 2026-04-16T00:00:00Z
date_updated: 2026-07-20T09:49:12Z
day: '16'
ddc:
- '540'
department:
- _id: PaSc
- _id: GradSch
doi: 10.5194/mr-7-29-2026
external_id:
pmid:
- '42057802'
fulldoi: https://doi.org/10.5194/mr-7-29-2026
has_accepted_license: '1'
intvolume: ' 7'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.5194/mr-7-29-2026
month: '04'
oa: 1
oa_version: Published Version
page: 29-37
pmid: 1
project:
- _id: B67AFEDC-15C9-11EA-A837-991A96BB2854
name: IST Austria Open Access Fund
- _id: 7be609c4-9f16-11ee-852c-85015ce2b9b0
grant_number: '26777'
name: Exploring protein dynamics by solid-state MAS NMR through specific labeling
approaches
publication: Magnetic Resonance
publication_identifier:
eissn:
- 2699-0016
publication_status: published
publisher: Copernicus Publications
quality_controlled: '1'
related_material:
record:
- id: '22334'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Accelerated 19F biomolecular magic-angle spinning NMR with paramagnetic dopants
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 7
year: '2026'
...
---
OA_place: publisher
_id: '22255'
abstract:
- lang: eng
text: "This thesis studies spectral rigidity and nonrigidity phenomena in dynamical
systems. The central question is whether a dynamical system can be determined,
up to a natural conjugacy, from its spectrum. We consider three related spectra:
the length spectrum, the action spectrum, and the Lyapunov spectrum.\r\n\r\nThe
first part of the thesis concerns Liouville metrics on the two-dimensional torus.
It is a long-standing folklore conjecture that Liouville metrics are the only
integrable metrics on the torus. We prove a length-spectral rigidity result for
linear conformal deformations of Liouville metrics by exploiting the dynamical
properties of the rational tori -- analogues of the resonant convex caustics in
billiards. We also establish a complementary classification result showing that
marked-length-isospectral Liouville metrics are characterized by rearrangements
of the one-dimensional functions appearing in their conformal factors, generalizing
a theorem of Abbondandolo-Mazzucchelli. In particular, the second result gives
nonrigidity examples within the class of Liouville metrics.\r\n\r\nThe second
part of the thesis studies the standard map from the viewpoint of action and Lyapunov
spectra. We construct nontrivial deformations of the standard map which preserve
the symplectic actions (respectively, the Lyapunov exponents) of infinitely many
periodic orbits accumulating on an invariant curve. The proof combines a resonant
normal form construction with Picard iteration schemes to obtain a sequence of
periodic orbits accumulating on an invariant curve with a Liouville rotation number.
Within the resonant normal forms we capture the dependence of these periodic orbits
on the resonant Fourier coefficients of the dynamics on the invariant curve and,
using the contraction mapping principle, obtain a suitable deformation achieving
the prescribed spectral data associated with this sequence of orbits. The result
can be viewed as a symplectic twist-map analogue of a length-spectral nonrigidity
phenomenon for Riemannian manifolds and convex billiards, and it motivates the
existence problem for similar 'partially length-isospectral' deformations of strictly
convex billiard tables.\r\n"
acknowledged_ssus:
- _id: E-Lib
- _id: CampIT
acknowledgement: "The financial support of the ERC grant SPERIG #885707 is gratefully
acknowledged.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Yunzhe
full_name: Li, Yunzhe
id: 41cb05d3-f128-11eb-9611-e4e2b3cfba31
last_name: Li
citation:
ama: Li Y. Spectral rigidity and nonrigidity of dynamical systems. 2026. doi:10.15479/AT-ISTA-22255
apa: Li, Y. (2026). Spectral rigidity and nonrigidity of dynamical systems.
Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-22255
chicago: Li, Yunzhe. “Spectral Rigidity and Nonrigidity of Dynamical Systems.” Institute
of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-22255.
ieee: Y. Li, “Spectral rigidity and nonrigidity of dynamical systems,” Institute
of Science and Technology Austria, 2026.
ista: Li Y. 2026. Spectral rigidity and nonrigidity of dynamical systems. Institute
of Science and Technology Austria.
mla: Li, Yunzhe. Spectral Rigidity and Nonrigidity of Dynamical Systems.
Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-22255.
short: Y. Li, Spectral Rigidity and Nonrigidity of Dynamical Systems, Institute
of Science and Technology Austria, 2026.
corr_author: '1'
date_created: 2026-07-08T12:44:31Z
date_published: 2026-07-11T00:00:00Z
date_updated: 2026-07-20T14:58:23Z
day: '11'
ddc:
- '515'
degree_awarded: PhD
department:
- _id: GradSch
- _id: VaKa
doi: 10.15479/AT-ISTA-22255
doi_confirm: '1'
ec_funded: 1
file:
- access_level: open_access
checksum: 8201cb5a427656a41828ecde8a85c04b
content_type: application/pdf
creator: yli
date_created: 2026-07-14T10:48:45Z
date_updated: 2026-07-14T10:48:45Z
file_id: '22337'
file_name: 2026_Li_Yunzhe_Thesis.pdf
file_size: 1260717
relation: main_file
- access_level: closed
checksum: 19ee8461ed77f5b7980fc9461f778b6f
content_type: application/x-zip-compressed
creator: yli
date_created: 2026-07-14T11:07:18Z
date_updated: 2026-07-20T14:00:33Z
file_id: '22339'
file_name: 2026_Li_Yunzhe_Thesis.zip
file_size: 418752
relation: source_file
file_date_updated: 2026-07-20T14:00:33Z
fulldoi: https://doi.org/10.15479/AT-ISTA-22255
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '131'
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
call_identifier: H2020
grant_number: '885707'
name: Spectral rigidity and integrability for billiards and geodesic flows
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22340'
relation: part_of_dissertation
status: public
- id: '22341'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Vadim
full_name: Kaloshin, Vadim
id: FE553552-CDE8-11E9-B324-C0EBE5697425
last_name: Kaloshin
orcid: 0000-0002-6051-2628
title: Spectral rigidity and nonrigidity of dynamical systems
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22370'
abstract:
- lang: eng
text: We report a unified method for the synthesis of α-polyhalomethyl amines from
alkenes and alkynes, enabled by readily available hemiaminal reagents. This operationally
simple transformation allows for the introduction of not only well-established
CF3 and CF2H groups, but also the synthetically (and medicinally) underexplored
CF2Cl and CFClH motifs—thereby broadening access to previously inaccessible chemical
space of halogenated amine scaffolds. The method displays broad substrate scope
and functional-group tolerance while operating under mild conditions. Late-stage
functionalization of drug-like derivatives of Oxaprozin, Erlotinib, and Ibuprofen
(among others) is reported.
acknowledgement: "Funded by the European Union (ERC, C-HANCE, 101142915 to N.M.).
Views and opinions expressed are, however, those of the author(s) only and do not
necessarily reflect those of the European Union or the European Research Council.
This research was funded in full or in part by the Austrian Science Fund (FWF, 10.55776/P37182
to N.M.). The technical staff of the NMR Centre of the Faculty of Chemistry (University
of Vienna) are acknowledged for crucial NMR measurements and expert advice with
spectral analysis. The authors thank the Core Facility Crystal Structure Analysis
(U. Vienna) for determination of the crystal structures. The authors are also grateful
to the University of Vienna for its continued support of our research programs.\r\n\r\nOpen
Access funding provided by Universität Wien."
article_number: e1233707
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Angela K.
full_name: Hofmeister, Angela K.
last_name: Hofmeister
- first_name: Giulia
full_name: Iannelli, Giulia
last_name: Iannelli
- first_name: Péter
full_name: Angyal, Péter
last_name: Angyal
- first_name: Augustin
full_name: Malandain, Augustin
last_name: Malandain
- first_name: Daniel
full_name: Kaiser, Daniel
last_name: Kaiser
- first_name: Boris
full_name: Maryasin, Boris
last_name: Maryasin
- first_name: Hanspeter
full_name: Kählig, Hanspeter
last_name: Kählig
- first_name: Matteo
full_name: Barel, Matteo
id: 8959927b-2236-11ed-bd6e-ea83d94ade0e
last_name: Barel
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Nuno
full_name: Maulide, Nuno
last_name: Maulide
citation:
ama: Hofmeister AK, Iannelli G, Angyal P, et al. Unified synthesis of unconventional
α-polyhalogenated amines through hydroaminoalkylation. Angewandte Chemie International
Edition. 2026. doi:10.1002/anie.1233707
apa: Hofmeister, A. K., Iannelli, G., Angyal, P., Malandain, A., Kaiser, D., Maryasin,
B., … Maulide, N. (2026). Unified synthesis of unconventional α-polyhalogenated
amines through hydroaminoalkylation. Angewandte Chemie International Edition.
Wiley. https://doi.org/10.1002/anie.1233707
chicago: Hofmeister, Angela K., Giulia Iannelli, Péter Angyal, Augustin Malandain,
Daniel Kaiser, Boris Maryasin, Hanspeter Kählig, Matteo Barel, Gaia Novarino,
and Nuno Maulide. “Unified Synthesis of Unconventional α-Polyhalogenated Amines
through Hydroaminoalkylation.” Angewandte Chemie International Edition.
Wiley, 2026. https://doi.org/10.1002/anie.1233707.
ieee: A. K. Hofmeister et al., “Unified synthesis of unconventional α-polyhalogenated
amines through hydroaminoalkylation,” Angewandte Chemie International Edition.
Wiley, 2026.
ista: Hofmeister AK, Iannelli G, Angyal P, Malandain A, Kaiser D, Maryasin B, Kählig
H, Barel M, Novarino G, Maulide N. 2026. Unified synthesis of unconventional α-polyhalogenated
amines through hydroaminoalkylation. Angewandte Chemie International Edition.,
e1233707.
mla: Hofmeister, Angela K., et al. “Unified Synthesis of Unconventional α-Polyhalogenated
Amines through Hydroaminoalkylation.” Angewandte Chemie International Edition,
e1233707, Wiley, 2026, doi:10.1002/anie.1233707.
short: A.K. Hofmeister, G. Iannelli, P. Angyal, A. Malandain, D. Kaiser, B. Maryasin,
H. Kählig, M. Barel, G. Novarino, N. Maulide, Angewandte Chemie International
Edition (2026).
das_tickbox: '1'
dataavailabilitystatement: The data that supports the findings of this study are available
in the supplementary material of this article.
date_created: 2026-07-19T22:01:48Z
date_published: 2026-07-10T00:00:00Z
date_updated: 2026-07-21T07:19:26Z
day: '10'
ddc:
- '570'
- '540'
department:
- _id: GaNo
- _id: GradSch
doi: 10.1002/anie.1233707
external_id:
pmid:
- '42429166'
fulldoi: https://doi.org/10.1002/anie.1233707
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa_version: Published Version
pmid: 1
publication: Angewandte Chemie International Edition
publication_identifier:
eissn:
- 1521-3773
issn:
- 1433-7851
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Unified synthesis of unconventional α-polyhalogenated amines through hydroaminoalkylation
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22323'
abstract:
- lang: eng
text: Arrays of Josephson junctions can be tuned through anomalous metallic, quantum-critical,
and insulating regimes. We introduce an alternative experimental probe, capturing
microwave radiation across all three regimes, using a two-dimensional array of
superconductor-semiconductor hybrid Josephson junctions as a model system. Our
approach allows calibration of the sample’s circuit parameters and provides isolation
from measurement back-action effects. We measure the radiation temperature of
the anomalous metal and find that it is hotter than both the quantum-critical
and insulating regimes. We further show that the anomalous metallic regime is
more susceptible to additional heating than other regimes, explaining its emergence
in otherwise thermalized systems. Turning to the quantum-critical regime, we discover
nonlinear scaling of radiative noise with applied bias, consistent with theoretical
predictions of universal nonequilibrium behavior at quantum-critical points.
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
acknowledgement: "We gratefully acknowledge feedback on the preprint\r\nfrom Charles
Marcus, Vadim Khrapai, Joel Moore,\r\nAndrew Green, Shivaji Sondhi, Rufus Boyack,
and\r\nLuca Delacr´etaz. This work was primarily supported by\r\nthe NOMIS foundation.
This work was partially supported\r\nby the University of Chicago Materials Research
Science\r\nand Engineering Center, which is funded by the National\r\nScience Foundation
under Award No. DMR-2011854, and\r\nby the SFB Q-M&S funded by the Austrian Science
Fund\r\n(FWF). We acknowledge technical support from the\r\nNanofabrication Facility
and the MIBA machine shop at\r\nIST Austria."
article_number: '014031'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Kristen W
full_name: Galvin, Kristen W
id: 41737c86-5355-11ee-ae5a-d2146bfd0877
last_name: Galvin
- first_name: Anton
full_name: Bubis, Anton
id: 1f6212b5-f795-11ec-9c0c-de4780302890
last_name: Bubis
- first_name: Melissa
full_name: Mikalsen, Melissa
last_name: Mikalsen
- first_name: William F.
full_name: Schiela, William F.
last_name: Schiela
- first_name: Bassel H.
full_name: Elfeky, Bassel H.
last_name: Elfeky
- first_name: William M.
full_name: Strickland, William M.
last_name: Strickland
- first_name: Duc T
full_name: Phan, Duc T
id: 29C8C0B4-F248-11E8-B48F-1D18A9856A87
last_name: Phan
- first_name: Javad
full_name: Shabani, Javad
last_name: Shabani
- first_name: Andrew P
full_name: Higginbotham, Andrew P
id: 4AD6785A-F248-11E8-B48F-1D18A9856A87
last_name: Higginbotham
orcid: 0000-0003-2607-2363
citation:
ama: Léonard KW, Bubis A, Mikalsen M, et al. Microwave radiometry of a quantum-critical
hybrid Josephson array. Physical Review Applied. 2026;26. doi:10.1103/75bl-mm3b
apa: Léonard, K. W., Bubis, A., Mikalsen, M., Schiela, W. F., Elfeky, B. H., Strickland,
W. M., … Higginbotham, A. P. (2026). Microwave radiometry of a quantum-critical
hybrid Josephson array. Physical Review Applied. American Physical Society.
https://doi.org/10.1103/75bl-mm3b
chicago: Léonard, Kristen Williams, Anton Bubis, Melissa Mikalsen, William F. Schiela,
Bassel H. Elfeky, William M. Strickland, Duc T Phan, Javad Shabani, and Andrew
P Higginbotham. “Microwave Radiometry of a Quantum-Critical Hybrid Josephson Array.”
Physical Review Applied. American Physical Society, 2026. https://doi.org/10.1103/75bl-mm3b.
ieee: K. W. Léonard et al., “Microwave radiometry of a quantum-critical hybrid
Josephson array,” Physical Review Applied, vol. 26. American Physical Society,
2026.
ista: Léonard KW, Bubis A, Mikalsen M, Schiela WF, Elfeky BH, Strickland WM, Phan
DT, Shabani J, Higginbotham AP. 2026. Microwave radiometry of a quantum-critical
hybrid Josephson array. Physical Review Applied. 26, 014031.
mla: Léonard, Kristen Williams, et al. “Microwave Radiometry of a Quantum-Critical
Hybrid Josephson Array.” Physical Review Applied, vol. 26, 014031, American
Physical Society, 2026, doi:10.1103/75bl-mm3b.
short: K.W. Léonard, A. Bubis, M. Mikalsen, W.F. Schiela, B.H. Elfeky, W.M. Strickland,
D.T. Phan, J. Shabani, A.P. Higginbotham, Physical Review Applied 26 (2026).
corr_author: '1'
dataavailabilitystatement: "The data that support the findings of this article are
openly available under 10.5281/zenodo\r\n.19615009. "
date_created: 2026-07-14T05:35:24Z
date_published: 2026-07-10T00:00:00Z
date_updated: 2026-07-21T12:01:49Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: AnHi
- _id: GeKa
doi: 10.1103/75bl-mm3b
external_id:
arxiv:
- '2409.09835'
file:
- access_level: open_access
checksum: d872ca35d9d2c7821642fda520be2c15
content_type: application/pdf
creator: dernst
date_created: 2026-07-16T09:39:37Z
date_updated: 2026-07-16T09:39:37Z
file_id: '22350'
file_name: 2026_PhysicalReviewApplied_Leonard.pdf
file_size: 2750867
relation: main_file
success: 1
file_date_updated: 2026-07-16T09:39:37Z
fulldoi: https://doi.org/10.1103/75bl-mm3b
has_accepted_license: '1'
intvolume: ' 26'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 34a66131-11ca-11ed-8bc3-a31681c6b03e
grant_number: F8606
name: 'Center for Correlated Quantum Materials and Solid State Quantum Systems:
Conventional and unconventional topological superconductors'
publication: Physical Review Applied
publication_identifier:
issn:
- 2331-7019
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: no
title: Microwave radiometry of a quantum-critical hybrid Josephson array
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: 26
year: '2026'
...
---
OA_place: publisher
_id: '21021'
abstract:
- lang: eng
text: This thesis examines how geometry and topology intersect in the representation,
transformation, and analysis of complex shapes. It considers how continuous manifolds
relate to their discrete analogues, how topological structures evolve in persistence
vineyards, and how tools from topological data analysis can illuminate problems
in mathematical physics. Central to this exploration is the question of how structure,
both geometric and topological, persists or changes under approximation, sampling,
or deformation. The work develops new approaches to skeletal and grid-based representations
of surfaces, reveals the full expressive capacity of persistence vineyards, and
applies topological methods to the longstanding problem of equilibria in electrostatic
fields. These threads braid together into a broader understanding of how topology
and geometry inform one another across theory, computation, and application.
acknowledged_ssus:
- _id: M-Shop
- _id: ScienComp
acknowledgement: "The research presented in this thesis was funded by the DFG Collaborative
Research\r\nCenter TRR 109, ‘Discretization in Geometry and Dynamics’.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Christopher D
full_name: Fillmore, Christopher D
id: 35638A5C-AAC7-11E9-B0BF-5503E6697425
last_name: Fillmore
citation:
ama: Fillmore CD. Braiding geometry and topology to study shapes and data. 2026.
doi:10.15479/AT-ISTA-21021
apa: Fillmore, C. D. (2026). Braiding geometry and topology to study shapes and
data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21021
chicago: Fillmore, Christopher D. “Braiding Geometry and Topology to Study Shapes
and Data.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21021.
ieee: C. D. Fillmore, “Braiding geometry and topology to study shapes and data,”
Institute of Science and Technology Austria, 2026.
ista: Fillmore CD. 2026. Braiding geometry and topology to study shapes and data.
Institute of Science and Technology Austria.
mla: Fillmore, Christopher D. Braiding Geometry and Topology to Study Shapes
and Data. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21021.
short: C.D. Fillmore, Braiding Geometry and Topology to Study Shapes and Data, Institute
of Science and Technology Austria, 2026.
corr_author: '1'
date_created: 2026-01-20T21:38:40Z
date_published: 2026-01-21T00:00:00Z
date_updated: 2026-07-22T06:33:54Z
day: '21'
ddc:
- '514'
- '516'
degree_awarded: PhD
department:
- _id: GradSch
- _id: HeEd
- _id: UlWa
doi: 10.15479/AT-ISTA-21021
file:
- access_level: open_access
checksum: 4c0889130095c31d4e5088c5b8dfd607
content_type: application/pdf
creator: cfillmor
date_created: 2026-01-26T19:44:46Z
date_updated: 2026-01-30T11:40:09Z
file_id: '21046'
file_name: 2025_Fillmore_Christopher_Thesis.pdf
file_size: 55954297
relation: main_file
- access_level: closed
checksum: d69afb71d82ab98f856886126ee7303a
content_type: application/x-zip-compressed
creator: cfillmor
date_created: 2026-01-26T19:46:20Z
date_updated: 2026-01-26T19:46:20Z
file_id: '21047'
file_name: Thesis.zip
file_size: 166080788
relation: source_file
file_date_updated: 2026-01-30T11:40:09Z
fulldoi: https://doi.org/10.15479/AT-ISTA-21021
has_accepted_license: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: '122'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '20260'
relation: part_of_dissertation
status: public
- id: '21051'
relation: part_of_dissertation
status: public
- id: '21050'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Herbert
full_name: Edelsbrunner, Herbert
id: 3FB178DA-F248-11E8-B48F-1D18A9856A87
last_name: Edelsbrunner
orcid: 0000-0002-9823-6833
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
title: Braiding geometry and topology to study shapes and data
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22327'
abstract:
- lang: eng
text: "Population protocols are a model of distributed computing where\r\n\U0001D45B
agents, each a simple finite-state machine, interact in pairs to\r\nsolve a common
task against a (adversarial) interaction scheduler.\r\nThis model was intensively
studied in recent years; in particular,\r\nthe problem of relative majority received
much attention: Each\r\nagent starts with an input opinion (or color) out of \U0001D458
possibilities,\r\nand the goal is for each agent to eventually output the color
with\r\nthe largest support in the population. Before our work, the state\r\ncomplexity
(the minimum number of states required per agent) was\r\nonly known to be between
Ω(\U0001D458\r\n2\r\n) and\U0001D442(\U0001D458\r\n7\r\n). Our main contribution\r\nis
a population protocol that solves the relative majority problem\r\nwith \U0001D458\r\n3\r\nstates.
We achieve this result with a new protocol called\r\nCircles. While prior approaches
in the literature relied on duels of\r\nagents to find the majority color — an
approach that proved effective\r\nfor the case with two colors — Circles partitions
the agents into\r\ncircular linked lists of decreasing sizes, with the property
that no\r\ntwo agents with the same initial color lie in the same circle. We\r\nshow
that Circles always correctly computes the desired structure\r\nagainst the most
adversarial of schedulers (weakly fair). We then\r\nshow that a trivial extension
of Circles solves the relative majority\r\nproblem. We extend our protocol to
handle various tie-breaking\r\nmechanisms or to support the case where the agents
do not share a\r\nprior ordering of the colors. Finally, we show that a modification
of\r\nCircles solves the ranking problem with 2 · \U0001D458^4\r\nstates, where
each\r\nagent must output the rank of its initial color in the population."
acknowledgement: "Funded by the European union. Views and opinions expressed are\r\nhowever
those of the author(s) only and do not necessarily reflect\r\nthose of the European
Union or the European Research Council\r\nExecutive Agency. Neither the European
Union nor the granting authority can be held responsible for them. This project
has received\r\nfunding from the European Research Council (ERC) under the European
Union’s Horizon 2020 research and innovation programme\r\n(MoDynStruct, No. 101019564)
and the Austrian Science\r\nFund (FWF) grant DOI 10.55776/I5982. For open access
purposes,\r\nthe author has applied a CC BY public copyright license to any\r\nauthor-accepted
manuscript version arising from this submission."
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Tom-Lukas
full_name: Breitkopf, Tom-Lukas
last_name: Breitkopf
- first_name: Julien
full_name: Dallot, Julien
last_name: Dallot
- 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: Stefan
full_name: Schmid, Stefan
last_name: Schmid
citation:
ama: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. Ranking opinions with few states
in population protocols. In: Proceedings of the ACM Symposium on Principles
of Distributed Computing. Association for Computing Machinery; 2026:414-424.
doi:10.1145/3796701.3815913'
apa: 'Breitkopf, T.-L., Dallot, J., El-Hayek, A., & Schmid, S. (2026). Ranking
opinions with few states in population protocols. In Proceedings of the ACM
Symposium on Principles of Distributed Computing (pp. 414–424). Egham, United
Kingdom: Association for Computing Machinery. https://doi.org/10.1145/3796701.3815913'
chicago: Breitkopf, Tom-Lukas, Julien Dallot, Antoine El-Hayek, and Stefan Schmid.
“Ranking Opinions with Few States in Population Protocols.” In Proceedings
of the ACM Symposium on Principles of Distributed Computing, 414–24. Association
for Computing Machinery, 2026. https://doi.org/10.1145/3796701.3815913.
ieee: T.-L. Breitkopf, J. Dallot, A. El-Hayek, and S. Schmid, “Ranking opinions
with few states in population protocols,” in Proceedings of the ACM Symposium
on Principles of Distributed Computing, Egham, United Kingdom, 2026, pp. 414–424.
ista: 'Breitkopf T-L, Dallot J, El-Hayek A, Schmid S. 2026. Ranking opinions with
few states in population protocols. Proceedings of the ACM Symposium on Principles
of Distributed Computing. PODC: Symposium on Principles of Distributed Computing,
414–424.'
mla: Breitkopf, Tom-Lukas, et al. “Ranking Opinions with Few States in Population
Protocols.” Proceedings of the ACM Symposium on Principles of Distributed Computing,
Association for Computing Machinery, 2026, pp. 414–24, doi:10.1145/3796701.3815913.
short: T.-L. Breitkopf, J. Dallot, A. El-Hayek, S. Schmid, in:, Proceedings of the
ACM Symposium on Principles of Distributed Computing, Association for Computing
Machinery, 2026, pp. 414–424.
conference:
end_date: 2026-07-10
location: Egham, United Kingdom
name: 'PODC: Symposium on Principles of Distributed Computing'
start_date: 2026-07-06
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-14T05:40:17Z
date_published: 2026-07-01T00:00:00Z
date_updated: 2026-07-22T07:49:22Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
- _id: GradSch
doi: 10.1145/3796701.3815913
ec_funded: 1
external_id:
arxiv:
- '2605.18707'
file:
- access_level: open_access
checksum: e56da70c1b2e7e663d2d8106cf07a30a
content_type: application/pdf
creator: dernst
date_created: 2026-07-16T11:18:44Z
date_updated: 2026-07-16T11:18:44Z
file_id: '22353'
file_name: 2026_ACMPODC_Breitkopf.pdf
file_size: 702140
relation: main_file
success: 1
file_date_updated: 2026-07-16T11:18:44Z
fulldoi: https://doi.org/10.1145/3796701.3815913
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 414 - 424
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: Proceedings of the ACM Symposium on Principles of Distributed Computing
publication_identifier:
isbn:
- '9798400725128'
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Ranking opinions with few states in population protocols
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: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '14278'
abstract:
- lang: eng
text: 'The Birkhoff conjecture says that the boundary of a strictly convex integrable
billiard table is necessarily an ellipse. In this article, we consider a stronger
notion of integrability, namely, integrability close to the boundary, and prove
a local version of this conjecture: a small perturbation of almost every ellipse
that preserves integrability near the boundary, is itself an ellipse. We apply
this result to study local spectral uniqueness of ellipses using the connection
between the wave trace of the Laplacian and the dynamics near the boundary and
establish local uniqueness for almost all of them.'
acknowledgement: 'The author acknowledges the partial support of the European Research
Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the
project and greatly aiding the implementation. The author is also grateful to Hamid
Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok
Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges
partial support of ISTern summer program. The project started in the summer of 2021,
when the author was an intern at ISTA. Open access funding provided by Institute
of Science and Technology (IST Austria).'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Illya
full_name: Koval, Illya
id: 2eed1f3b-896a-11ed-bdf8-93c7c4bf159e
last_name: Koval
citation:
ama: Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost
every ellipse. Inventiones Mathematicae. 2026;244:221-298. doi:10.1007/s00222-025-01397-y
apa: Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity
of almost every ellipse. Inventiones Mathematicae. Springer Nature. https://doi.org/10.1007/s00222-025-01397-y
chicago: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
of Almost Every Ellipse.” Inventiones Mathematicae. Springer Nature, 2026.
https://doi.org/10.1007/s00222-025-01397-y.
ieee: I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of
almost every ellipse,” Inventiones Mathematicae, vol. 244. Springer Nature,
pp. 221–298, 2026.
ista: Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity
of almost every ellipse. Inventiones Mathematicae. 244, 221–298.
mla: Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity
of Almost Every Ellipse.” Inventiones Mathematicae, vol. 244, Springer
Nature, 2026, pp. 221–98, doi:10.1007/s00222-025-01397-y.
short: I. Koval, Inventiones Mathematicae 244 (2026) 221–298.
corr_author: '1'
das_tickbox: '0'
date_created: 2023-09-06T08:35:43Z
date_published: 2026-04-01T00:00:00Z
date_updated: 2026-07-23T10:58:59Z
day: '01'
ddc:
- '510'
department:
- _id: GradSch
- _id: VaKa
doi: 10.1007/s00222-025-01397-y
ec_funded: 1
external_id:
arxiv:
- '2111.12171'
file:
- access_level: open_access
checksum: 487fa9113e1bbf32a6c70e6d1e8f63bc
content_type: application/pdf
creator: dernst
date_created: 2026-07-23T10:55:24Z
date_updated: 2026-07-23T10:55:24Z
file_id: '22394'
file_name: 2026_InventionesMath_Koval.pdf
file_size: 2256345
relation: main_file
success: 1
file_date_updated: 2026-07-23T10:55:24Z
fulldoi: https://doi.org/10.1007/s00222-025-01397-y
has_accepted_license: '1'
intvolume: ' 244'
language:
- iso: eng
mathsc:
- 37C83
- 35J05
- 37J70
- 74J25
month: '04'
oa: 1
oa_version: Published Version
page: 221-298
project:
- _id: 9B8B92DE-BA93-11EA-9121-9846C619BF3A
call_identifier: H2020
grant_number: '885707'
name: Spectral rigidity and integrability for billiards and geodesic flows
publication: Inventiones Mathematicae
publication_identifier:
eissn:
- 1432-1297
issn:
- 0020-9910
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Local strong Birkhoff conjecture and local spectral rigidity of almost every
ellipse
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: 244
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '21720'
abstract:
- lang: eng
text: "We present an exact fully-dynamic minimum cut algorithm that runs in \U0001D45B\U0001D45C(1)
deterministic update time when the minimum cut size is at most 2Θ(log3/4−\U0001D450\U0001D45B)
for any \U0001D450 >0, improving on the previous algorithm of Jin, Sun, and Thorup
(SODA 2024) whose minimum cut size limit is (log\U0001D45B)\U0001D45C(1). Combined
with graph sparsification, we obtain the first (1 +\U0001D716)-approximate fully-dynamic
minimum cut algorithm on weighted graphs, for any \U0001D716 ≥2−Θ(log3/4−\U0001D450\U0001D45B),
in \U0001D45B\U0001D45C(1) randomized update time.\r\nOur main technical contribution
is a deterministic local minimum cut algorithm, which replaces the randomized
LocalKCut procedure from El-Hayek, Henzinger, and Li (SODA 2025)."
acknowledgement: Funded by the European union. Views and opinions expressed are however
those of the author(s) only and do not necessarily reflect those of the European
Union or the European Research Council Executive Agency. Neither the European Union
nor the granting authority can be held responsible for them. This project has received
funding from the European Research Council (ERC) under the European Union’s Horizon
2020 research and innovation programme (MoDynStruct, No. 101019564) and the Austrian
Science Fund (FWF) grant DOI 10.55776/I5982. For open access purposes, the author
has applied a CC BY public copyright license to any author-accepted manuscript version
arising from this submission.
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. Deterministic and exact fully-dynamic minimum
cut of superpolylogarithmic size in subpolynomial time. In: Proceedings of
the Annual ACM SIAM Symposium on Discrete Algorithms. Vol 2026. Society for
Industrial and Applied Mathematics; 2026:613-663. doi:10.1137/1.9781611978971.25'
apa: 'El-Hayek, A., Henzinger, M., & Li, J. (2026). Deterministic and exact
fully-dynamic minimum cut of superpolylogarithmic size in subpolynomial time.
In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
(Vol. 2026, pp. 613–663). Vancouver, Canada: Society for Industrial and Applied
Mathematics. https://doi.org/10.1137/1.9781611978971.25'
chicago: El-Hayek, Antoine, Monika Henzinger, and Jason Li. “Deterministic and Exact
Fully-Dynamic Minimum Cut of Superpolylogarithmic Size in Subpolynomial Time.”
In Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms,
2026:613–63. Society for Industrial and Applied Mathematics, 2026. https://doi.org/10.1137/1.9781611978971.25.
ieee: A. El-Hayek, M. Henzinger, and J. Li, “Deterministic and exact fully-dynamic
minimum cut of superpolylogarithmic size in subpolynomial time,” in Proceedings
of the Annual ACM SIAM Symposium on Discrete Algorithms, Vancouver, Canada,
2026, vol. 2026, pp. 613–663.
ista: 'El-Hayek A, Henzinger M, Li J. 2026. Deterministic and exact fully-dynamic
minimum cut of superpolylogarithmic size in subpolynomial time. Proceedings of
the Annual ACM SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete
Algorithms vol. 2026, 613–663.'
mla: El-Hayek, Antoine, et al. “Deterministic and Exact Fully-Dynamic Minimum Cut
of Superpolylogarithmic Size in Subpolynomial Time.” Proceedings of the Annual
ACM SIAM Symposium on Discrete Algorithms, vol. 2026, Society for Industrial
and Applied Mathematics, 2026, pp. 613–63, doi:10.1137/1.9781611978971.25.
short: A. El-Hayek, M. Henzinger, J. Li, in:, Proceedings of the Annual ACM SIAM
Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics,
2026, pp. 613–663.
conference:
end_date: 2026-01-14
location: Vancouver, Canada
name: 'SODA: Symposium on Discrete Algorithms'
start_date: 2026-01-11
date_created: 2026-04-12T22:01:51Z
date_published: 2026-01-07T00:00:00Z
date_updated: 2026-07-24T12:48:29Z
day: '07'
department:
- _id: MoHe
- _id: GradSch
doi: 10.1137/1.9781611978971.25
ec_funded: 1
external_id:
arxiv:
- '2512.13105'
fulldoi: https://doi.org/10.1137/1.9781611978971.25
intvolume: ' 2026'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2512.13105
month: '01'
oa: 1
oa_version: Preprint
page: 613-663
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: Proceedings of the Annual ACM SIAM Symposium on Discrete Algorithms
publication_identifier:
eisbn:
- '9781611978971'
eissn:
- 1557-9468
issn:
- 1071-9040
publication_status: published
publisher: Society for Industrial and Applied Mathematics
quality_controlled: '1'
related_material:
record:
- id: '22281'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Deterministic and exact fully-dynamic minimum cut of superpolylogarithmic size
in subpolynomial time
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2026
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22403'
abstract:
- lang: eng
text: Linear phase‐contrast scanning transmission electron microscopy (STEM) techniques
compatible with high‐throughput 4D‐STEM acquisition are widely used to enhance
phase contrast in weakly scattering and beam‐sensitive materials. In these modalities,
contrast transfer is often suppressed at low spatial frequencies, resulting in
a characteristic contrast gap that limits contrast. Approaches that retain low‐frequency
phase contrast exist but typically require substantially increased experimental
complexity, restricting routine use. Dark‐field STEM imaging captures this missing
low‐frequency information through electrons scattered outside the bright‐field
disk, but discards a large fraction of the scattered signal and is therefore dose‐inefficient.
Fused Full‐field STEM (FF‐STEM) is introduced as a 4D‐STEM imaging modality that
overcomes these limitations by combining ptychographic phase reconstruction with
tilt‐corrected dark‐field imaging within a single acquisition. Bright‐field data
are used to estimate probe aberrations and reconstruct a high‐resolution phase
image, while dark‐field data provide complementary low‐frequency contrast. The
two channels are fused in Fourier space using Wiener‐band weighting based on the
spectral signal‐to‐noise ratio, yielding transfer‐gap‐free images with high contrast.
FF‐STEM preserves the upsampling and depth‐sectioning capabilities of ptychography,
adds robust low‐frequency contrast characteristic of dark‐field imaging, and enables
dose‐efficient, near–real‐time reconstruction.
acknowledgement: 'We thank Tadahiro Yokosawa for support and discussions during the
experiments. This project has received funding from the European Research Council
(ERC) under the European Union''s Horizon 2020 research and innovation programme
(Project HyperScaleEM, Grant agreement No. 101164581) and from the Deutsche Forschungsgemeinschaft
(DFG, German Research Foundation) through the Research Training Group GRK 3103 CorMic:
Korrelative Materialmikroskopie – Von nanostrukturierten funktionalen Filmen zu
hierarchischen Funktionsmaterialien (project number 537140136). B.Z. and X.Y. were
supported by the U.S. National Science Foundation under award CHE-2404338. X.Y.
also thanks the Principal Investigator Development in Sustainability Grant from
the American Chemical Society.'
article_number: e76620
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Shengbo
full_name: You, Shengbo
last_name: You
- first_name: Georgios
full_name: Varnavides, Georgios
last_name: Varnavides
- first_name: Sagar
full_name: Khavnekar, Sagar
last_name: Khavnekar
- first_name: Nikita
full_name: Palatkin, Nikita
last_name: Palatkin
- first_name: Sihan
full_name: Shao, Sihan
last_name: Shao
- first_name: Mingjian
full_name: Wu, Mingjian
last_name: Wu
- first_name: Daniel
full_name: Stroppa, Daniel
last_name: Stroppa
- first_name: Darya
full_name: Chernikova, Darya
id: 7dbaf460-fa9e-11eb-b0ca-bc7c7ff21ad0
last_name: Chernikova
- first_name: Baixu
full_name: Zhu, Baixu
last_name: Zhu
- first_name: Ricardo
full_name: Egoavil, Ricardo
last_name: Egoavil
- first_name: Stefano
full_name: Vespucci, Stefano
last_name: Vespucci
- first_name: Dileep
full_name: Krishnan, Dileep
last_name: Krishnan
- first_name: Xingchen
full_name: Ye, Xingchen
last_name: Ye
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
- first_name: Erdmann
full_name: Spiecker, Erdmann
last_name: Spiecker
- first_name: Philipp
full_name: Pelz, Philipp
last_name: Pelz
citation:
ama: You S, Varnavides G, Khavnekar S, et al. Gap‐free information transfer in 4D‐STEM
via fusion of complementary scattering channels. Advanced Science. 2026.
doi:10.1002/advs.76620
apa: You, S., Varnavides, G., Khavnekar, S., Palatkin, N., Shao, S., Wu, M., … Pelz,
P. (2026). Gap‐free information transfer in 4D‐STEM via fusion of complementary
scattering channels. Advanced Science. Wiley. https://doi.org/10.1002/advs.76620
chicago: You, Shengbo, Georgios Varnavides, Sagar Khavnekar, Nikita Palatkin, Sihan
Shao, Mingjian Wu, Daniel Stroppa, et al. “Gap‐free Information Transfer in 4D‐STEM
via Fusion of Complementary Scattering Channels.” Advanced Science. Wiley,
2026. https://doi.org/10.1002/advs.76620.
ieee: S. You et al., “Gap‐free information transfer in 4D‐STEM via fusion
of complementary scattering channels,” Advanced Science. Wiley, 2026.
ista: You S, Varnavides G, Khavnekar S, Palatkin N, Shao S, Wu M, Stroppa D, Chernikova
D, Zhu B, Egoavil R, Vespucci S, Krishnan D, Ye X, Schur FK, Spiecker E, Pelz
P. 2026. Gap‐free information transfer in 4D‐STEM via fusion of complementary
scattering channels. Advanced Science., e76620.
mla: You, Shengbo, et al. “Gap‐free Information Transfer in 4D‐STEM via Fusion of
Complementary Scattering Channels.” Advanced Science, e76620, Wiley, 2026,
doi:10.1002/advs.76620.
short: S. You, G. Varnavides, S. Khavnekar, N. Palatkin, S. Shao, M. Wu, D. Stroppa,
D. Chernikova, B. Zhu, R. Egoavil, S. Vespucci, D. Krishnan, X. Ye, F.K. Schur,
E. Spiecker, P. Pelz, Advanced Science (2026).
das_tickbox: '1'
dataavailabilitystatement: The data that support the findings of this study are openly
available in Zenodo at https://doi.org/10.5281/zenodo.18008901. The reconstruction
code is available as an open-source repository at the scatterem github repo.
date_created: 2026-07-26T19:01:34Z
date_published: 2026-07-23T00:00:00Z
date_updated: 2026-07-27T06:04:57Z
day: '23'
ddc:
- '570'
- '600'
department:
- _id: FlSc
- _id: GradSch
doi: 10.1002/advs.76620
external_id:
arxiv:
- '2512.19460'
fulldoi: https://doi.org/10.1002/advs.76620
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/advs.76620
month: '07'
oa: 1
oa_version: Published Version
publication: Advanced Science
publication_identifier:
eissn:
- 2198-3844
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Gap‐free information transfer in 4D‐STEM via fusion of complementary scattering
channels
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21006'
abstract:
- lang: eng
text: Modern experimental methods in programmable self-assembly make it possible
to precisely design particle concentrations, shapes and interactions. However,
more physical insight is needed before we can take full advantage of this vast
design space to assemble nanostructures with complex form and function. Here we
show how a substantial part of this design space can be quickly and comprehensively
understood by identifying a class of thermodynamic constraints that act on it.
These thermodynamic constraints form a high-dimensional convex polyhedron that
determines which nanostructures can be assembled at high equilibrium yield and
reveals limitations that govern the coexistence of structures. We validate our
predictions through detailed, quantitative assembly experiments of nanoscale particles
synthesized using DNA origami. Our results uncover physical relationships underpinning
many-component programmable self-assembly in equilibrium and form the basis for
robust inverse design, applicable to various systems from biological protein complexes
to synthetic nanomachines.
acknowledgement: We thank B. Isaac and A. Tiano for their technical support with the
electron microscopy and S. Waitukaitis for helpful comments on the manuscript. The
TEM images were prepared and imaged at the Brandeis Electron Microscopy facility.
This work was supported by the Gesellschaft für Forschungsförderung Niederösterreich
under project FTI23-G-011 (M.C.H. and C.P.G.), the Brandeis University Materials
Research Science and Engineering Center (MRSEC) under grant number NSF DMR-2011846
(T.E.V., D.H. and W.B.R.) and the Smith Family Foundation (W.B.R.). Open access
funding provided by Institute of Science and Technology (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Maximilian
full_name: Hübl, Maximilian
id: 5eb8629e-15b2-11ec-abd3-e6f3e5e01f32
last_name: Hübl
- first_name: Thomas E.
full_name: Videbæk, Thomas E.
last_name: Videbæk
- first_name: Daichi
full_name: Hayakawa, Daichi
last_name: Hayakawa
- first_name: W. Benjamin
full_name: Rogers, W. Benjamin
last_name: Rogers
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. A polyhedral structure
controls programmable self-assembly. Nature Physics. 2026;22:294-301. doi:10.1038/s41567-025-03120-3
apa: Hübl, M., Videbæk, T. E., Hayakawa, D., Rogers, W. B., & Goodrich, C. P.
(2026). A polyhedral structure controls programmable self-assembly. Nature
Physics. Springer Nature. https://doi.org/10.1038/s41567-025-03120-3
chicago: Hübl, Maximilian, Thomas E. Videbæk, Daichi Hayakawa, W. Benjamin Rogers,
and Carl Peter Goodrich. “A Polyhedral Structure Controls Programmable Self-Assembly.”
Nature Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03120-3.
ieee: M. Hübl, T. E. Videbæk, D. Hayakawa, W. B. Rogers, and C. P. Goodrich, “A
polyhedral structure controls programmable self-assembly,” Nature Physics,
vol. 22. Springer Nature, pp. 294–301, 2026.
ista: Hübl M, Videbæk TE, Hayakawa D, Rogers WB, Goodrich CP. 2026. A polyhedral
structure controls programmable self-assembly. Nature Physics. 22, 294–301.
mla: Hübl, Maximilian, et al. “A Polyhedral Structure Controls Programmable Self-Assembly.”
Nature Physics, vol. 22, Springer Nature, 2026, pp. 294–301, doi:10.1038/s41567-025-03120-3.
short: M. Hübl, T.E. Videbæk, D. Hayakawa, W.B. Rogers, C.P. Goodrich, Nature Physics
22 (2026) 294–301.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "Design files and folding conditions of DNA origami used
in this work are provided in the repository Nanobase68 and are accessible at https://nanobase.org/structures/247.
All the TEM images and associated experimental data are available via Zenodo at
https://doi.org/10.5281/zenodo.17314727 (ref. 70).\r\nStructure enumeration was
performed using the Roly.jl27,71 (v.0.1.0) package developed by M.C.H. and C.P.G.,
which is available via GitHub at https://github.com/mxhbl/Roly.jl. Polyhedral computation
and linear programming were performed using the freely available Convex.jl72 (v.0.16.4)
package, Polyhedra.jl73 (v.0.7.8) package and cddlib63 (v.0.9.4) library. The example
code reproducing the calculations done on the three rings and reconfigurable squares
is available via GitHub at https://github.com/mxhbl/PolyhedralStructureOfSelfAssembly.
An implementation of the lattice Monte Carlo sampler is available via GitHub at
https://github.com/mxhbl/LatticeSampler. Fitting of the yield curves was achieved
using the freely available Optim.jl74 (v.1.12.0) package."
date_created: 2026-01-20T10:02:19Z
date_published: 2026-02-01T00:00:00Z
date_updated: 2026-07-27T10:59:15Z
day: '01'
ddc:
- '570'
- '540'
department:
- _id: CaGo
- _id: GradSch
doi: 10.1038/s41567-025-03120-3
file:
- access_level: open_access
checksum: f4e3123d5d9dfcd22324e2c2de02e9a2
content_type: application/pdf
creator: dernst
date_created: 2026-07-27T10:57:57Z
date_updated: 2026-07-27T10:57:57Z
file_id: '22417'
file_name: 2026_NaturePhysics_Huebl.pdf
file_size: 2802534
relation: main_file
success: 1
file_date_updated: 2026-07-27T10:57:57Z
fulldoi: https://doi.org/10.1038/s41567-025-03120-3
has_accepted_license: '1'
intvolume: ' 22'
language:
- iso: eng
month: '02'
oa: 1
oa_version: Published Version
page: 294-301
project:
- _id: 8dd93da8-16d5-11f0-9cad-d2c70200d9a5
grant_number: FTI23-G-011
name: Dynamically reconfigurable self-assembly with triangular DNA-origami bricks
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- description: News on ISTA website
relation: press_release
url: https://ista.ac.at/en/news/behind-natures-blueprints/
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: A polyhedral structure controls programmable self-assembly
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: 22
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21295'
abstract:
- lang: eng
text: 'Depending on the type of flow, the transition to turbulence can take one
of two forms: either turbulence arises from a sequence of instabilities or from
the spatial proliferation of transiently chaotic domains, a process analogous
to directed percolation. The former scenario is commonly referred to as a supercritical
transition and frequently encountered in flows destabilized by body forces, whereas
the latter subcritical transition is common in shear flows. Both cases are inherently
continuous in a sense that the transformation from ordered laminar to fully turbulent
fluid motion is only accomplished gradually with flow speed. Here we show that
these established transition types do not account for the more general setting
of shear flows subject to body forces. The combination of the two continuous scenarios
leads to the attenuation of spatial coupling; with increasing forcing amplitude,
the transition becomes increasingly sharp and eventually discontinuous. We argue
that the suppression of laminar–turbulent coexistence and the approach towards
a discontinuous phase transition potentially apply to a broad range of situations
including flows subject to, for example, buoyancy, centrifugal or electromagnetic
forces.'
acknowledgement: The work was supported by the Simons Foundation (grant number 662960,
to B.H.). Open access funding provided by Institute of Science and Technology (IST
Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Bowen
full_name: Yang, Bowen
id: 71b6ff4b-15b2-11ec-abd3-aef6b028cf7e
last_name: Yang
orcid: 0000-0002-4843-6853
- first_name: Yi
full_name: Zhuang, Yi
id: 3677B57C-F248-11E8-B48F-1D18A9856A87
last_name: Zhuang
- first_name: Gökhan
full_name: Yalniz, Gökhan
id: 66E74FA2-D8BF-11E9-8249-8DE2E5697425
last_name: Yalniz
orcid: 0000-0002-8490-9312
- first_name: Mukund
full_name: Vasudevan, Mukund
id: 3C5A959A-F248-11E8-B48F-1D18A9856A87
last_name: Vasudevan
- first_name: Elena
full_name: Marensi, Elena
id: 0BE7553A-1004-11EA-B805-18983DDC885E
last_name: Marensi
orcid: 0000-0001-7173-4923
- first_name: Björn
full_name: Hof, Björn
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. Discontinuous transition
to shear flow turbulence. Nature Physics. 2026;22:424-429. doi:10.1038/s41567-025-03166-3
apa: Yang, B., Zhuang, Y., Yalniz, G., Vasudevan, M., Marensi, E., & Hof, B.
(2026). Discontinuous transition to shear flow turbulence. Nature Physics.
Springer Nature. https://doi.org/10.1038/s41567-025-03166-3
chicago: Yang, Bowen, Yi Zhuang, Gökhan Yalniz, Mukund Vasudevan, Elena Marensi,
and Björn Hof. “Discontinuous Transition to Shear Flow Turbulence.” Nature
Physics. Springer Nature, 2026. https://doi.org/10.1038/s41567-025-03166-3.
ieee: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, and B. Hof, “Discontinuous
transition to shear flow turbulence,” Nature Physics, vol. 22. Springer
Nature, pp. 424–429, 2026.
ista: Yang B, Zhuang Y, Yalniz G, Vasudevan M, Marensi E, Hof B. 2026. Discontinuous
transition to shear flow turbulence. Nature Physics. 22, 424–429.
mla: Yang, Bowen, et al. “Discontinuous Transition to Shear Flow Turbulence.” Nature
Physics, vol. 22, Springer Nature, 2026, pp. 424–29, doi:10.1038/s41567-025-03166-3.
short: B. Yang, Y. Zhuang, G. Yalniz, M. Vasudevan, E. Marensi, B. Hof, Nature Physics
22 (2026) 424–429.
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Source data are available via Zenodo at https://doi.org/10.5281/zenodo.17514317
(ref. 51). The numerical simulations were carried out using the open-source codes
openpipeflow41 and nsPipeflow45.
date_created: 2026-02-17T11:38:41Z
date_published: 2026-03-01T00:00:00Z
date_updated: 2026-07-27T11:13:48Z
day: '01'
ddc:
- '532'
department:
- _id: GradSch
- _id: BjHo
doi: 10.1038/s41567-025-03166-3
external_id:
arxiv:
- '2311.11474'
file:
- access_level: open_access
checksum: 0636abba74896c467a7237411fa2369b
content_type: application/pdf
creator: dernst
date_created: 2026-07-27T11:12:46Z
date_updated: 2026-07-27T11:12:46Z
file_id: '22420'
file_name: 2026_NaturePhysics_Yang.pdf
file_size: 5152735
relation: main_file
success: 1
file_date_updated: 2026-07-27T11:12:46Z
fulldoi: https://doi.org/10.1038/s41567-025-03166-3
has_accepted_license: '1'
intvolume: ' 22'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
page: 424-429
project:
- _id: 238598C6-32DE-11EA-91FC-C7463DDC885E
grant_number: '662960'
name: Revisiting the Turbulence Problem Using Statistical Mechanics
publication: Nature Physics
publication_identifier:
eissn:
- 1745-2481
issn:
- 1745-2473
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Discontinuous transition to shear flow turbulence
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: 22
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21483'
abstract:
- lang: eng
text: 'Embryogenesis in the model plant Arabidopsis thaliana provides a framework
for understanding how cell polarity and patterning coordinate with hormonal signalling
to establish the plant body plan. Following fertilisation, the zygote divides
asymmetrically to generate apical and basal lineages, establishing the apical–basal
axis that defines future shoot and root poles. Genetic and molecular analyses
of classical mutants including gnom, monopteros (mp), bodenlos (bdl) and topless
revealed that localised auxin biosynthesis, directional transport and downstream
transcriptional responses are central to apical–basal axis establishment and organ
initiation. The main components of this regulation are polarly localised PIN auxin
transporters and downstream modules involving MONOPTEROS and WUSCHEL-RELATED HOMEOBOX
transcription factors. Advances in microscopy have transformed the study of Arabidopsis
embryogenesis: fluorescence-compatible clearing reagents and three-dimensional
reconstructions now permit quantitative analyses of cell geometry, division orientation,
and cytoskeletal dynamics. Live ovule imaging setups with confocal laser scanning
and multiphoton microscopes enable real-time observation of embryo development,
while laser-assisted cell ablation can be used to probe cell-to-cell communication
and fate plasticity. Together, these methodological breakthroughs position Arabidopsis
embryos as a prime model for dissecting the chemical and biophysical cues that
shape plant development.'
acknowledgement: The authors would like to acknowledge the many colleagues whose valuable
contributions to the field could not be included in this review due to space limitations
and reference constraints. Open Access funding provided by Institute of Science
and Technology Austria/KEMÖ.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: David
full_name: Babic, David
id: db566d23-f6e0-11ea-865d-e6f270e968e7
last_name: Babic
- first_name: Milan
full_name: Zupunski, Milan
id: f6a21fce-573e-11f0-a150-a8d96aee2539
last_name: Zupunski
- first_name: Jiří
full_name: Friml, Jiří
id: 4159519E-F248-11E8-B48F-1D18A9856A87
last_name: Friml
orcid: 0000-0002-8302-7596
citation:
ama: Babic D, Zupunski M, Friml J. Imaging and genetic toolbox to study Arabidopsis
embryogenesis. New Phytologist. 2026;250(3):1483-1491. doi:10.1111/nph.71072
apa: Babic, D., Zupunski, M., & Friml, J. (2026). Imaging and genetic toolbox
to study Arabidopsis embryogenesis. New Phytologist. Wiley. https://doi.org/10.1111/nph.71072
chicago: Babic, David, Milan Zupunski, and Jiří Friml. “Imaging and Genetic Toolbox
to Study Arabidopsis Embryogenesis.” New Phytologist. Wiley, 2026. https://doi.org/10.1111/nph.71072.
ieee: D. Babic, M. Zupunski, and J. Friml, “Imaging and genetic toolbox to study
Arabidopsis embryogenesis,” New Phytologist, vol. 250, no. 3. Wiley, pp.
1483–1491, 2026.
ista: Babic D, Zupunski M, Friml J. 2026. Imaging and genetic toolbox to study Arabidopsis
embryogenesis. New Phytologist. 250(3), 1483–1491.
mla: Babic, David, et al. “Imaging and Genetic Toolbox to Study Arabidopsis Embryogenesis.”
New Phytologist, vol. 250, no. 3, Wiley, 2026, pp. 1483–91, doi:10.1111/nph.71072.
short: D. Babic, M. Zupunski, J. Friml, New Phytologist 250 (2026) 1483–1491.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-03-23T14:59:06Z
date_published: 2026-05-01T00:00:00Z
date_updated: 2026-07-27T11:47:24Z
day: '01'
ddc:
- '580'
department:
- _id: JiFr
- _id: GradSch
doi: 10.1111/nph.71072
external_id:
pmid:
- '41808651'
file:
- access_level: open_access
checksum: 67513dde983631bed9613fdaadbbee06
content_type: application/pdf
creator: dernst
date_created: 2026-07-27T11:46:25Z
date_updated: 2026-07-27T11:46:25Z
file_id: '22424'
file_name: 2026_NewPhytologist_Babic.pdf
file_size: 1708392
relation: main_file
success: 1
file_date_updated: 2026-07-27T11:46:25Z
fulldoi: https://doi.org/10.1111/nph.71072
has_accepted_license: '1'
intvolume: ' 250'
issue: '3'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 1483-1491
pmid: 1
publication: New Phytologist
publication_identifier:
eissn:
- 1469-8137
issn:
- 0028-646X
publication_status: published
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Imaging and genetic toolbox to study Arabidopsis embryogenesis
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: 250
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '21486'
abstract:
- lang: eng
text: Sex-chromosome systems are highly variable across animals, but how they transition
from one to another is not well understood. Diptera have undergone multiple sex-chromosome
turnovers and expansions while maintaining their general chromosomal content,
which makes them an ideal clade to study such transitions. We analyzed more than
100 dipteran whole-genome assemblies and identified 4 new lineages that underwent
sex-chromosome turnover (in addition to the 5 previously reported). We find that
the majority of turnovers happened in the group Schizophora, which tend to have
fewer genes on Muller element F (the chromosome homologous to the ancestral insect
X chromosome) than lower dipterans, a factor previously hypothesized to facilitate
turnover. Most derived X chromosomes have higher GC content than autosomes, consistent
with a high prevalence of male achiasmy in Diptera. In addition, an excess of
gene movement out of the X is detected for most of these new X chromosomes, and
many of these moved genes have high testis expression in Drosophila, suggesting
that out-of-X gene movement contributes to the long-term demasculinization of
X chromosomes.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: This work was supported by a grant from the Austrian Science Fund
(FWF, grant number PAT 8748323) to B.V. We thank the Vicoso group for their feedback
on an early version of the manuscript. We are grateful to Kamil Jaron and Julia
Gries for helpful discussions and for sharing their unpublished work. Computational
resources and support were provided by the Scientific Computing Unit at ISTA.
article_number: qrag003
article_processing_charge: Yes
article_type: original
author:
- first_name: Lorena Alexandra
full_name: Layana Franco, Lorena Alexandra
id: 02814589-eb8f-11eb-b029-a70074f3f18f
last_name: Layana Franco
orcid: 0000-0002-1253-6297
- first_name: Melissa A
full_name: Toups, Melissa A
id: 4E099E4E-F248-11E8-B48F-1D18A9856A87
last_name: Toups
orcid: 0000-0002-9752-7380
- first_name: Beatriz
full_name: Vicoso, Beatriz
id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
last_name: Vicoso
orcid: 0000-0002-4579-8306
citation:
ama: Layana Franco LA, Toups MA, Vicoso B. Causes and consequences of sex-chromosome
turnovers in Diptera. Evolution Letters. 2026;10(3). doi:10.1093/evlett/qrag003
apa: Layana Franco, L. A., Toups, M. A., & Vicoso, B. (2026). Causes and consequences
of sex-chromosome turnovers in Diptera. Evolution Letters. Oxford University
Press. https://doi.org/10.1093/evlett/qrag003
chicago: Layana Franco, Lorena Alexandra, Melissa A Toups, and Beatriz Vicoso. “Causes
and Consequences of Sex-Chromosome Turnovers in Diptera.” Evolution Letters.
Oxford University Press, 2026. https://doi.org/10.1093/evlett/qrag003.
ieee: L. A. Layana Franco, M. A. Toups, and B. Vicoso, “Causes and consequences
of sex-chromosome turnovers in Diptera,” Evolution Letters, vol. 10, no.
3. Oxford University Press, 2026.
ista: Layana Franco LA, Toups MA, Vicoso B. 2026. Causes and consequences of sex-chromosome
turnovers in Diptera. Evolution Letters. 10(3), qrag003.
mla: Layana Franco, Lorena Alexandra, et al. “Causes and Consequences of Sex-Chromosome
Turnovers in Diptera.” Evolution Letters, vol. 10, no. 3, qrag003, Oxford
University Press, 2026, doi:10.1093/evlett/qrag003.
short: L.A. Layana Franco, M.A. Toups, B. Vicoso, Evolution Letters 10 (2026).
corr_author: '1'
dataavailabilitystatement: Scripts, Supplementary Datasets 1–7, and Tables S1, S2,
S5 and S6 are also available at https://doi.org/10.15479/AT-ISTA-21116. Pipelines
are available at https://git.ista.ac.at/llayanaf/transitions_diptera.
date_created: 2026-03-23T15:05:42Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-07-27T12:00:11Z
day: '01'
ddc:
- '570'
department:
- _id: BeVi
- _id: GradSch
doi: 10.1093/evlett/qrag003
file:
- access_level: open_access
checksum: 7c929e78c369a5e6e064bcf263e955ad
content_type: application/pdf
creator: dernst
date_created: 2026-07-27T11:59:40Z
date_updated: 2026-07-27T11:59:40Z
file_id: '22426'
file_name: 2026_EvolutionLetters_Layana.pdf
file_size: 1895786
relation: main_file
success: 1
file_date_updated: 2026-07-27T11:59:40Z
fulldoi: https://doi.org/10.1093/evlett/qrag003
has_accepted_license: '1'
intvolume: ' 10'
issue: '3'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 8ed82125-16d5-11f0-9cad-fbcae312235b
grant_number: PAT 8748323
name: Sex chromosomes in evolution and development
publication: Evolution Letters
publication_identifier:
eissn:
- 2056-3744
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: yes
status: public
supplementarymaterial: yes
title: Causes and consequences of sex-chromosome turnovers in Diptera
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: 10
year: '2026'
...
---
OA_place: publisher
OA_type: green
_id: '21857'
abstract:
- lang: eng
text: "The availability of powerful open-source large language models (LLMs) opens
exciting use cases, such as using personal data to fine-tune these models to imitate
a user’s unique writing style. Two key requirements for this functionality are
personalization–in the sense that the output should recognizably reflect the user’s
own writing style—and privacy–users may justifiably be wary of uploading extremely
personal data, such as their email archive, to a third-party service. In this
paper, we demonstrate the feasibility of training and running such an assistant,
which we call Panza, on commodity hardware, for the specific use case of email
generation. Panza’s personalization features are based on a combination of parameter-efficient
fine-tuning using a variant of the Reverse Instructions technique [1] and Retrieval-Augmented
Generation (RAG) [2]. We demonstrate that this combination allows us to fine-tune
an LLM to reflect a user’s writing style using limited data, while executing on
extremely limited resources, e.g. on a free Google Colab instance. Our key methodological
contribution is the first detailed study of evaluation metrics for this task,
and\r\nof how different choices of system components–the use of RAG and of different
fine-tuning approaches–impact the system’s performance. Additionally, we demonstrate
that very little data - under 100 email samples - are sufficient to create models
that convincingly imitate humans, showcasing a previously unknown attack vector
in language models. We are releasing the full Panza code as well as three new
email datasets licensed for research use."
article_number: '81'
article_processing_charge: No
author:
- first_name: Armand
full_name: Nicolicioiu, Armand
last_name: Nicolicioiu
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Andrej
full_name: Jovanovic, Andrej
last_name: Jovanovic
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Andrei
full_name: Panferov, Andrei
id: 2c18daae-4dbe-11ef-8491-98ce2d960f09
last_name: Panferov
- first_name: Ilia
full_name: Markov, Ilia
id: D0CF4148-C985-11E9-8066-0BDEE5697425
last_name: Markov
- first_name: Nir
full_name: Shavit, Nir
last_name: Shavit
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nicolicioiu A, Iofinova EB, Jovanovic A, et al. Panza: Investigating the
Feasibility of Fully-Local Personalized Text Generation. OpenReview; 2026.'
apa: 'Nicolicioiu, A., Iofinova, E. B., Jovanovic, A., Kurtic, E., Nikdan, M., Panferov,
A., … Alistarh, D.-A. (2026). Panza: Investigating the feasibility of fully-local
personalized text generation. Third Conference on Parsimony and Learning
(Proceedings Track). Tübíngen, Germany: OpenReview.'
chicago: 'Nicolicioiu, Armand, Eugenia B Iofinova, Andrej Jovanovic, Eldar Kurtic,
Mahdi Nikdan, Andrei Panferov, Ilia Markov, Nir Shavit, and Dan-Adrian Alistarh.
Panza: Investigating the Feasibility of Fully-Local Personalized Text Generation.
Third Conference on Parsimony and Learning (Proceedings Track). OpenReview,
2026.'
ieee: 'A. Nicolicioiu et al., Panza: Investigating the feasibility of
fully-local personalized text generation. OpenReview, 2026.'
ista: 'Nicolicioiu A, Iofinova EB, Jovanovic A, Kurtic E, Nikdan M, Panferov A,
Markov I, Shavit N, Alistarh D-A. 2026. Panza: Investigating the feasibility of
fully-local personalized text generation, OpenReview,p.'
mla: 'Nicolicioiu, Armand, et al. “Panza: Investigating the Feasibility of Fully-Local
Personalized Text Generation.” Third Conference on Parsimony and Learning (Proceedings
Track), 81, OpenReview, 2026.'
short: 'A. Nicolicioiu, E.B. Iofinova, A. Jovanovic, E. Kurtic, M. Nikdan, A. Panferov,
I. Markov, N. Shavit, D.-A. Alistarh, Panza: Investigating the Feasibility of
Fully-Local Personalized Text Generation, OpenReview, 2026.'
conference:
end_date: 2026-03-26
location: Tübíngen, Germany
name: 'CPAL: Conference on Parsimony and Learning'
start_date: 2026-03-23
corr_author: '1'
date_created: 2026-05-11T08:50:28Z
date_published: 2026-03-06T00:00:00Z
date_updated: 2026-07-27T12:50:03Z
day: '06'
department:
- _id: GradSch
- _id: DaAl
keyword:
- LLMs
- PEFT
- LoRA
- personalization
- efficient ML
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://openreview.net/pdf?id=soFWnTqd23
month: '03'
oa: 1
oa_version: Accepted Version
publication: Third Conference on Parsimony and Learning (Proceedings Track)
publication_status: published
publisher: OpenReview
quality_controlled: '1'
related_material:
record:
- id: '21854'
relation: dissertation_contains
status: public
status: public
title: 'Panza: Investigating the feasibility of fully-local personalized text generation'
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_poster
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '21859'
abstract:
- lang: eng
text: As artificial neural networks, and specifically large language models, have
improved rapidly in capabilities and quality, they have increasingly been deployed
in real-world applications, from customer service to Google search, despite the
fact that they frequently make factually incorrect or undesirable statements.
This trend has inspired practical and academic interest in model editing, that
is, in adjusting the weights of the model to modify its likely outputs for queries
relating to a specific fact or set of facts. This may be done either to amend
a fact or set of facts, for instance, to fix a frequent error in the training
data, or to suppress a fact or set of facts entirely, for instance, in case of
dangerous knowledge. Multiple methods have been proposed to do such edits. However,
at the same time, it has been shown that such model editing can be brittle and
incomplete. Moreover the effectiveness of any model editing method necessarily
depends on the data on which the model is trained, and, therefore, a good understanding
of the interaction of the training data distribution and the way it is stored
in the network is necessary and helpful to reliably perform model editing. However,
working with large language models trained on real-world data does not allow us
to understand this relationship or fully measure the effects of model editing.
We therefore propose Behemoth, a fully synthetic data generation framework. To
demonstrate the practical insights from the framework, we explore model editing
in the context of simple tabular data, demonstrating surprising findings that,
in some cases, echo real-world results, for instance, that in some cases restricting
the update rank results in a more effective update.
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "EI thanks Weiwei Yang, Janardhan Kulkani, and Kate Lytvynets for
their advice and support in\r\ndeveloping an earlier version of the Behemoth library.
This research was supported by the Scientific\r\nService Units (SSU) of IST Austria
through resources provided by Scientific Computing (SciComp).\r\nEI was supported
in part by the FWF DK VGSCO, grant agreement number W1260-N35.\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using
fully synthetic data. arXiv. doi:10.48550/arXiv.2601.23153'
apa: 'Iofinova, E. B., & Alistarh, D.-A. (n.d.). Behemoth: Benchmarking unlearning
in LLMs using fully synthetic data. arXiv. https://doi.org/10.48550/arXiv.2601.23153'
chicago: 'Iofinova, Eugenia B, and Dan-Adrian Alistarh. “Behemoth: Benchmarking
Unlearning in LLMs Using Fully Synthetic Data.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2601.23153.'
ieee: 'E. B. Iofinova and D.-A. Alistarh, “Behemoth: Benchmarking unlearning in
LLMs using fully synthetic data,” arXiv. .'
ista: 'Iofinova EB, Alistarh D-A. Behemoth: Benchmarking unlearning in LLMs using
fully synthetic data. arXiv, 10.48550/arXiv.2601.23153.'
mla: 'Iofinova, Eugenia B., and Dan-Adrian Alistarh. “Behemoth: Benchmarking Unlearning
in LLMs Using Fully Synthetic Data.” ArXiv, doi:10.48550/arXiv.2601.23153.'
short: E.B. Iofinova, D.-A. Alistarh, ArXiv (n.d.).
corr_author: '1'
date_created: 2026-05-11T08:58:07Z
date_published: 2026-01-30T00:00:00Z
date_updated: 2026-07-27T12:50:03Z
day: '30'
department:
- _id: GradSch
- _id: DaAl
doi: 10.48550/arXiv.2601.23153
external_id:
arxiv:
- '2601.23153'
fulldoi: https://doi.org/10.48550/arXiv.2601.23153
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2601.23153
month: '01'
oa: 1
oa_version: Preprint
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
publication: arXiv
publication_status: draft
related_material:
record:
- id: '21854'
relation: dissertation_contains
status: public
status: public
title: 'Behemoth: Benchmarking unlearning in LLMs using fully synthetic data'
type: preprint
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...
---
OA_place: publisher
_id: '21957'
abstract:
- lang: eng
text: "This thesis investigates algorithmic certification and approximation methods
for degenerate semidefinite programs (SDPs) and the singular roots of polynomial
systems. In the first part, we present a hybrid symbolic-numeric algorithm for
certifying the feasibility of weakly feasible, degenerate SDPs. By reformulating
linear matrix inequalities (LMIs) into a structured polynomial system via facial
reduction and incidence varieties, we guarantee the existence of an isolated exact
solution. This algebraic reduction enables the certification of maximum-rank numerical
approximations using methods from algebraic geometry.\r\n\r\nIn the second part,
we address the severe ill-conditioning and loss of quadratic convergence that
plague standard path-tracking methods near isolated singular roots. To overcome
this, we propose tracking algorithms that achieve superlinear convergence without
the computational bloat characteristic of classical deflation techniques. By modeling
the solution path as a generalized fractional Puiseux series, our approach combines
an explicitly derived algebraic predictor with a localized hyperplane desingularization
phase during the corrector step. Furthermore, we introduce a continuous path-limit
method and an extension of the geometric sequence rule to directly extract exact
fractional exponents. This bypasses traditional heuristic trial-and-error methods
and explicitly accommodates sparse series expansions. Numerical experiments confirm
that our method significantly reduces the cumulative number of matrix inversions
while achieving high-accuracy root approximations, even for heavily degenerate
systems exhibiting higher coranks."
acknowledgement: 'Funding: Vienna Graduate School on Computational Optimization (FWF),
grant DOI: 10.55776/W1260.'
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Jeferson
full_name: Zapata, Jeferson
id: 00223538-AF8F-11E9-A4C7-F729E6697425
last_name: Zapata
citation:
ama: 'Zapata J. Overcoming degeneracy and singularity: Techniques for semidefinite
programs and homotopy continuation endgames. 2026. doi:10.15479/AT-ISTA-21957'
apa: 'Zapata, J. (2026). Overcoming degeneracy and singularity: Techniques for
semidefinite programs and homotopy continuation endgames. Institute of Science
and Technology Austria. https://doi.org/10.15479/AT-ISTA-21957'
chicago: 'Zapata, Jeferson. “Overcoming Degeneracy and Singularity: Techniques for
Semidefinite Programs and Homotopy Continuation Endgames.” Institute of Science
and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21957.'
ieee: 'J. Zapata, “Overcoming degeneracy and singularity: Techniques for semidefinite
programs and homotopy continuation endgames,” Institute of Science and Technology
Austria, 2026.'
ista: 'Zapata J. 2026. Overcoming degeneracy and singularity: Techniques for semidefinite
programs and homotopy continuation endgames. Institute of Science and Technology
Austria.'
mla: 'Zapata, Jeferson. Overcoming Degeneracy and Singularity: Techniques for
Semidefinite Programs and Homotopy Continuation Endgames. Institute of Science
and Technology Austria, 2026, doi:10.15479/AT-ISTA-21957.'
short: 'J. Zapata, Overcoming Degeneracy and Singularity: Techniques for Semidefinite
Programs and Homotopy Continuation Endgames, Institute of Science and Technology
Austria, 2026.'
corr_author: '1'
das_tickbox: '1'
date_created: 2026-06-08T13:29:52Z
date_published: 2026-06-09T00:00:00Z
date_updated: 2026-07-27T14:30:42Z
day: '09'
ddc:
- '500'
degree_awarded: PhD
department:
- _id: GradSch
- _id: VlKo
doi: 10.15479/AT-ISTA-21957
doi_confirm: '1'
file:
- access_level: closed
checksum: b11a959e99d3dcf61040282b5c837141
content_type: application/zip
creator: jzapata
date_created: 2026-06-08T13:20:02Z
date_updated: 2026-06-08T13:20:02Z
file_id: '21958'
file_name: istaustriathesis_JZapata.zip
file_size: 40811933
relation: source_file
- access_level: open_access
checksum: edf1e5899b2e31505cd1aa3fe8bd4b7f
content_type: application/pdf
creator: jzapata
date_created: 2026-06-10T13:33:25Z
date_updated: 2026-06-10T13:33:25Z
file_id: '21992'
file_name: 4_Final_Thesis_JZapata_REX.pdf
file_size: 2207892
relation: main_file
success: 1
file_date_updated: 2026-06-10T13:33:25Z
fulldoi: https://doi.org/10.15479/AT-ISTA-21957
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: '89'
project:
- _id: 9B9290DE-BA93-11EA-9121-9846C619BF3A
grant_number: W1260-N35
name: Vienna Graduate School on Computational Optimization
publication_identifier:
isbn:
- 978-3-99078-079-4
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '21144'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Vladimir
full_name: Kolmogorov, Vladimir
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
title: 'Overcoming degeneracy and singularity: Techniques for semidefinite programs
and homotopy continuation endgames'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9
year: '2026'
...