---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22306'
abstract:
- lang: eng
text: "The AP3 complex mediates cargo sorting and carrier assembly for the trafficking
of transmembrane proteins from endosomes to lysosomes. AP3 is generally believed
to localize to clathrin-free, ARF1-positive, elongated carriers in cells, but
the architecture of AP3-based coats was unknown. Using in vitro reconstitution
and cryo–electron tomography, we demonstrate that AP3:ARF1 spontaneously remodels
membranes containing cargo and the phosphoinositide PI(3,5)P\r\n 2\r\n
\ into tubular structures coated in spiraling rows of AP3 arches
and ARF1 dimers. Targeted point mutations disrupting critical AP3:ARF1 and AP3:AP3
lattice interfaces disrupt AP3 recruitment, carrier formation, and lysosomal cargo
trafficking in cells. We propose that AP3 generates tubular carriers on endosomes
by organizing ARF1 dimers into elongated membrane-deforming arrays while simultaneously
selecting cargo. By demonstrating that AP3:ARF1 can generate carriers without
using a clathrin lattice, we explain the clathrin independence of AP3-mediated
trafficking."
acknowledgement: "We thank P. Luzio, N. Bright, and M. S. Robinson for helpful discussions;\r\nJ.
Stacey and Y. Fujiharu for technical discussions and assistance; F. Beck for assistance
with\r\ncomputing infrastructure; and M. Riggi for discussion of data presentation
and figure design.\r\nCryo-E\r\nM data was collected at the Department of Cell and
Virus Structure, Max Planck Institute\r\nof Biochemistry. Funding: This work was
funded by: the Wellcome Trust, Wellcome Discovery\r\nAward 227915/Z/23/Z (to D.J.O.,
J.A.G.B., and D.G.S.) and Wellcome PRF 207455/Z/17/Z (to\r\nD.J.O.); the Max Planck
Society (to J.A.G.B.); the Medical Research Council (UKRI) MC_\r\nUP_1201/16 (to
J.A.G.B.) and MRC DT P MR/N013433/1 (to J.G.G.K.); EMBO Long-term\r\nPostdoctoral
Fellowship ALT F-383-\r\n2022\r\n(to G.T.); and the Wellcome Trust/Royal Society,
Sir\r\nHenry Dale Fellowship 210481 (to D.C.G) and the Biotechnology and Biological
Sciences\r\nResearch Council (UKRI) responsive mode grants BB/W005905/1 and UKRI715
(to D.C.G.)."
article_number: eaed1529
article_processing_charge: Yes
article_type: original
author:
- first_name: Jonathan G.G.
full_name: Kaufman, Jonathan G.G.
last_name: Kaufman
- first_name: Grigory
full_name: Tagiltsev, Grigory
last_name: Tagiltsev
- first_name: Danièle S.
full_name: Stalder, Danièle S.
last_name: Stalder
- first_name: Rebecca J.
full_name: Taylor, Rebecca J.
last_name: Taylor
- first_name: Ioana
full_name: Sava, Ioana
last_name: Sava
- first_name: Hui
full_name: Guo, Hui
last_name: Guo
- first_name: Katarzyna A.
full_name: Ciazynska, Katarzyna A.
last_name: Ciazynska
- first_name: Nathan R.
full_name: Zaccai, Nathan R.
last_name: Zaccai
- first_name: Sally R.
full_name: Gray, Sally R.
last_name: Gray
- first_name: Yvonne
full_name: Vallis, Yvonne
id: 05A2795C-31B5-11EA-83A7-7DA23DDC885E
last_name: Vallis
orcid: 0000-0002-5408-5906
- first_name: Stefan
full_name: Höning, Stefan
last_name: Höning
- first_name: Bernard T.
full_name: Kelly, Bernard T.
last_name: Kelly
- first_name: David C.
full_name: Gershlick, David C.
last_name: Gershlick
- first_name: John A.G.
full_name: Briggs, John A.G.
last_name: Briggs
- first_name: David J.
full_name: Owen, David J.
last_name: Owen
citation:
ama: Kaufman JGG, Tagiltsev G, Stalder DS, et al. Architecture of clathrin-independent
AP3:ARF1-coated carriers. Science Advances. 2026;12(20). doi:10.1126/sciadv.aed1529
apa: Kaufman, J. G. G., Tagiltsev, G., Stalder, D. S., Taylor, R. J., Sava, I.,
Guo, H., … Owen, D. J. (2026). Architecture of clathrin-independent AP3:ARF1-coated
carriers. Science Advances. American Association for the Advancement of
Science. https://doi.org/10.1126/sciadv.aed1529
chicago: Kaufman, Jonathan G.G., Grigory Tagiltsev, Danièle S. Stalder, Rebecca
J. Taylor, Ioana Sava, Hui Guo, Katarzyna A. Ciazynska, et al. “Architecture of
Clathrin-Independent AP3:ARF1-Coated Carriers.” Science Advances. American
Association for the Advancement of Science, 2026. https://doi.org/10.1126/sciadv.aed1529.
ieee: J. G. G. Kaufman et al., “Architecture of clathrin-independent AP3:ARF1-coated
carriers,” Science Advances, vol. 12, no. 20. American Association for
the Advancement of Science, 2026.
ista: Kaufman JGG, Tagiltsev G, Stalder DS, Taylor RJ, Sava I, Guo H, Ciazynska
KA, Zaccai NR, Gray SR, Vallis Y, Höning S, Kelly BT, Gershlick DC, Briggs JAG,
Owen DJ. 2026. Architecture of clathrin-independent AP3:ARF1-coated carriers.
Science Advances. 12(20), eaed1529.
mla: Kaufman, Jonathan G. G., et al. “Architecture of Clathrin-Independent AP3:ARF1-Coated
Carriers.” Science Advances, vol. 12, no. 20, eaed1529, American Association
for the Advancement of Science, 2026, doi:10.1126/sciadv.aed1529.
short: J.G.G. Kaufman, G. Tagiltsev, D.S. Stalder, R.J. Taylor, I. Sava, H. Guo,
K.A. Ciazynska, N.R. Zaccai, S.R. Gray, Y. Vallis, S. Höning, B.T. Kelly, D.C.
Gershlick, J.A.G. Briggs, D.J. Owen, Science Advances 12 (2026).
das_tickbox: '1'
dataavailabilitystatement: "Structures determined by electron microscopy are deposited
in the Electron\r\nMicroscopy Data Bank under accession codes EMD-54255,\r\nEMD-54256,\r\nEMD-54257,\r\nand\r\nEMD-54258.\r\nCorresponding
molecular models are deposited in the Protein Data Bank under\r\naccession codes
9RTW, 9RTX, 9RTY, and 9RTZ. All additional data and code required to\r\nevaluate
and reproduce the results in the paper are present in the paper and/or the\r\nsupplementary
materials. Any code used is explicitly stated and available in the original\r\npublications.
Plasmids and cell lines can be requested by writing to D.C.G. (dg553@ cam. ac. uk)\r\nor
D.J.O. (djo30@ cam. ac. uk). All reasonable requests for materials will be honored."
date_created: 2026-07-13T10:52:15Z
date_published: 2026-05-15T00:00:00Z
date_updated: 2026-07-14T06:52:00Z
day: '15'
ddc:
- '570'
department:
- _id: MaDe
doi: 10.1126/sciadv.aed1529
file:
- access_level: open_access
checksum: 461b5f73941fe6b5df2a129c7563601f
content_type: application/pdf
creator: dernst
date_created: 2026-07-14T06:45:37Z
date_updated: 2026-07-14T06:45:37Z
file_id: '22331'
file_name: 2026_ScienceAdv_Kaufman.pdf
file_size: 8269526
relation: main_file
success: 1
file_date_updated: 2026-07-14T06:45:37Z
has_accepted_license: '1'
intvolume: ' 12'
issue: '20'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Science Advances
publication_identifier:
eissn:
- 2375-2548
publication_status: published
publisher: American Association for the Advancement of Science
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Architecture of clathrin-independent AP3:ARF1-coated carriers
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: 12
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22304'
abstract:
- lang: eng
text: We derive an analog of the Lellouch-Lüscher (LL) relation for few-body bosonic
systems, linking few-body scattering loss rates to the energies and widths of
the corresponding harmonically trapped few-body states. Three-body numerical simulations
show that the LL relation applies across a broad range of interaction strengths
and energies and allows the determination of scattering rates within a single
partial wave. Our Letter establishes a robust theoretical framework for understanding
the role of the finite-volume effect in few-body observables in optical lattice
and tweezer experiments, enabling precise determination of multibody scattering
rates.
acknowledgement: "This work was supported by the\r\nBaden-Württemberg Stiftung through
the Internationale\r\nSpitzenforschung program (BWST, Contract\r\nNo. ISF2017-061)
and by the German Research\r\nFoundation (DFG, Deutsche Forschungsgemeinschaft,\r\nContract
No. 399903135). The authors acknowledge support\r\nby the state of Baden-Württemberg
through bwHPC\r\nand the German Research Foundation (DFG) through\r\nGrant No. INST
40/575-1 FUGG (JUSTUS 2 cluster).\r\nJ. H. D and J. P. D. acknowledge funding by
Q-DYNAMO\r\n(EU HORIZON-MSCA-2022- SE-01) within Project\r\nNo. 101131418. J. P.
D. also acknowledges partial support\r\nfrom the U.S. National Science Foundation
(PHY-\r\n2308791/PHYS-2452751) and the Office of Naval\r\nResearch (ONR) Grant No.
N00014-21-1-2594."
article_number: '203401'
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Jinglun
full_name: Li, Jinglun
id: ff19510a-0d2c-11ef-b018-c338ad2f4325
last_name: Li
- first_name: Paul S.
full_name: Julienne, Paul S.
last_name: Julienne
- first_name: Johannes Hecker
full_name: Denschlag, Johannes Hecker
last_name: Denschlag
- first_name: José P.
full_name: D’Incao, José P.
last_name: D’Incao
citation:
ama: Li J, Julienne PS, Denschlag JH, D’Incao JP. Lellouch-Lüscher relation for
ultracold few-atom systems under confinement. Physical Review Letters.
2026;136(20). doi:10.1103/pzlp-7k8d
apa: Li, J., Julienne, P. S., Denschlag, J. H., & D’Incao, J. P. (2026). Lellouch-Lüscher
relation for ultracold few-atom systems under confinement. Physical Review
Letters. American Physical Society. https://doi.org/10.1103/pzlp-7k8d
chicago: Li, Jinglun, Paul S. Julienne, Johannes Hecker Denschlag, and José P. D’Incao.
“Lellouch-Lüscher Relation for Ultracold Few-Atom Systems under Confinement.”
Physical Review Letters. American Physical Society, 2026. https://doi.org/10.1103/pzlp-7k8d.
ieee: J. Li, P. S. Julienne, J. H. Denschlag, and J. P. D’Incao, “Lellouch-Lüscher
relation for ultracold few-atom systems under confinement,” Physical Review
Letters, vol. 136, no. 20. American Physical Society, 2026.
ista: Li J, Julienne PS, Denschlag JH, D’Incao JP. 2026. Lellouch-Lüscher relation
for ultracold few-atom systems under confinement. Physical Review Letters. 136(20),
203401.
mla: Li, Jinglun, et al. “Lellouch-Lüscher Relation for Ultracold Few-Atom Systems
under Confinement.” Physical Review Letters, vol. 136, no. 20, 203401,
American Physical Society, 2026, doi:10.1103/pzlp-7k8d.
short: J. Li, P.S. Julienne, J.H. Denschlag, J.P. D’Incao, Physical Review Letters
136 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "The data that support the findings of this article are
openly available 10.5281/zenodo.\r\n19690988"
date_created: 2026-07-13T10:50:49Z
date_published: 2026-05-19T00:00:00Z
date_updated: 2026-07-14T06:33:11Z
day: '19'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/pzlp-7k8d
external_id:
arxiv:
- '2511.11906'
file:
- access_level: open_access
checksum: 745836cbb77c479a3344b477bbbd7de9
content_type: application/pdf
creator: dernst
date_created: 2026-07-14T06:31:13Z
date_updated: 2026-07-14T06:31:13Z
file_id: '22330'
file_name: 2026_PhysicalReviewLetters_Li.pdf
file_size: 643101
relation: main_file
success: 1
file_date_updated: 2026-07-14T06:31:13Z
has_accepted_license: '1'
intvolume: ' 136'
issue: '20'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Lellouch-Lüscher relation for ultracold few-atom systems under confinement
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: 136
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22307'
abstract:
- lang: eng
text: We investigate magnetic active matter in confined geometries using both experiments
with magnetic toy robots, Hexbugs, and simulations of elongated magnetic active
Brownian particles in circular domains. Standard active particles tend to accumulate
at boundaries, forming clusters even at relatively low densities. In the presence
of magnetic interactions, we provide evidence for a effect that inhibits clustering
and shifts its onset to higher packing fractions. Moreover, magnetic dipolar interactions
give rise to collective behaviors such as train-like formations, rotating pairs,
and rotating clusters.
acknowledgement: "The authors acknowledge discussions with Lorenzo\r\nCaprini. A.G.,
M.P., and A.P. acknowledge funding from the\r\nItalianMinistero dell’Università
e della Ricerca under the program\r\nPRIN 2022 (“Re-ranking of the final lists”),
Grants No.\r\n2022KWTEB7 with CUP No. B53C24006470006. L.A. acknowledges\r\nfunding
from the ItalianMinistero dell’Università\r\ne della Ricerca under the program PRIN
2020, Grant No.\r\n2020PFCXPE."
article_number: '055413'
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Marco
full_name: Musacchio, Marco
last_name: Musacchio
- first_name: Markus
full_name: Felber, Markus
id: c12d7e3a-4e8f-11ef-ad48-ffba54b8aa10
last_name: Felber
- first_name: Matteo
full_name: Paoluzzi, Matteo
last_name: Paoluzzi
- first_name: Andrea
full_name: Gnoli, Andrea
last_name: Gnoli
- first_name: Andrea
full_name: Puglisi, Andrea
last_name: Puglisi
- first_name: Luca
full_name: Angelani, Luca
last_name: Angelani
citation:
ama: Musacchio M, Felber M, Paoluzzi M, Gnoli A, Puglisi A, Angelani L. Fluidization
induced by magnetic interactions in confined active matter. Physical Review
E. 2026;113(5). doi:10.1103/hylm-ljlf
apa: Musacchio, M., Felber, M., Paoluzzi, M., Gnoli, A., Puglisi, A., & Angelani,
L. (2026). Fluidization induced by magnetic interactions in confined active matter.
Physical Review E. American Physical Society. https://doi.org/10.1103/hylm-ljlf
chicago: Musacchio, Marco, Markus Felber, Matteo Paoluzzi, Andrea Gnoli, Andrea
Puglisi, and Luca Angelani. “Fluidization Induced by Magnetic Interactions in
Confined Active Matter.” Physical Review E. American Physical Society,
2026. https://doi.org/10.1103/hylm-ljlf.
ieee: M. Musacchio, M. Felber, M. Paoluzzi, A. Gnoli, A. Puglisi, and L. Angelani,
“Fluidization induced by magnetic interactions in confined active matter,” Physical
Review E, vol. 113, no. 5. American Physical Society, 2026.
ista: Musacchio M, Felber M, Paoluzzi M, Gnoli A, Puglisi A, Angelani L. 2026. Fluidization
induced by magnetic interactions in confined active matter. Physical Review E.
113(5), 055413.
mla: Musacchio, Marco, et al. “Fluidization Induced by Magnetic Interactions in
Confined Active Matter.” Physical Review E, vol. 113, no. 5, 055413, American
Physical Society, 2026, doi:10.1103/hylm-ljlf.
short: M. Musacchio, M. Felber, M. Paoluzzi, A. Gnoli, A. Puglisi, L. Angelani,
Physical Review E 113 (2026).
dataavailabilitystatement: "The data that support the findings of this article are
not\r\npublicly available upon publication because it is not technically\r\nfeasible
and/or the cost of preparing, depositing, and\r\nhosting the data would be prohibitive
within the terms of this\r\nresearch project. The data are available from the authors
upon\r\nreasonable request."
date_created: 2026-07-13T10:53:06Z
date_published: 2026-05-18T00:00:00Z
date_updated: 2026-07-14T07:00:17Z
day: '18'
ddc:
- '530'
department:
- _id: ScWa
- _id: GradSch
doi: 10.1103/hylm-ljlf
external_id:
arxiv:
- '2511.21472'
file:
- access_level: open_access
checksum: f029efcf6dd51e10e3bc7623b5365da6
content_type: application/pdf
creator: dernst
date_created: 2026-07-14T06:58:35Z
date_updated: 2026-07-14T06:58:35Z
file_id: '22332'
file_name: 2026_PhysicalReviewE_Musacchio.pdf
file_size: 1836050
relation: main_file
success: 1
file_date_updated: 2026-07-14T06:58:35Z
has_accepted_license: '1'
intvolume: ' 113'
issue: '5'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
publication: Physical Review E
publication_identifier:
eissn:
- 2470-0053
issn:
- 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Fluidization induced by magnetic interactions in confined active matter
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2026'
...
---
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'
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_type: closed access
_id: '22305'
abstract:
- lang: eng
text: Active dendrites enrich the repertoire of single-neuron computations. Whereas
a lot is known about the function of dendrites in vitro, information about their
in vivo properties is limited. A new study1 uses advanced imaging to study hippocampal
CA1 pyramidal neuron dendrites in head-fixed, awake animals.
article_processing_charge: No
article_type: letter_note
author:
- first_name: Subhodeep
full_name: Bhattacharya, Subhodeep
id: 45f74010-66f6-11f0-a7d4-c441fa3685ff
last_name: Bhattacharya
orcid: 0009-0009-0334-9068
- first_name: Peter M
full_name: Jonas, Peter M
id: 353C1B58-F248-11E8-B48F-1D18A9856A87
last_name: Jonas
orcid: 0000-0001-5001-4804
citation:
ama: Bhattacharya S, Jonas PM. Mission impossible? Quantitative analysis of dendritic
computations in vivo. Neuron. 2026;114(10):1706-1708. doi:10.1016/j.neuron.2026.04.002
apa: Bhattacharya, S., & Jonas, P. M. (2026). Mission impossible? Quantitative
analysis of dendritic computations in vivo. Neuron. Elsevier. https://doi.org/10.1016/j.neuron.2026.04.002
chicago: Bhattacharya, Subhodeep, and Peter M Jonas. “Mission Impossible? Quantitative
Analysis of Dendritic Computations in Vivo.” Neuron. Elsevier, 2026. https://doi.org/10.1016/j.neuron.2026.04.002.
ieee: S. Bhattacharya and P. M. Jonas, “Mission impossible? Quantitative analysis
of dendritic computations in vivo,” Neuron, vol. 114, no. 10. Elsevier,
pp. 1706–1708, 2026.
ista: Bhattacharya S, Jonas PM. 2026. Mission impossible? Quantitative analysis
of dendritic computations in vivo. Neuron. 114(10), 1706–1708.
mla: Bhattacharya, Subhodeep, and Peter M. Jonas. “Mission Impossible? Quantitative
Analysis of Dendritic Computations in Vivo.” Neuron, vol. 114, no. 10,
Elsevier, 2026, pp. 1706–08, doi:10.1016/j.neuron.2026.04.002.
short: S. Bhattacharya, P.M. Jonas, Neuron 114 (2026) 1706–1708.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-13T10:51:27Z
date_published: 2026-05-20T00:00:00Z
date_updated: 2026-07-14T06:39:59Z
day: '20'
department:
- _id: PeJo
doi: 10.1016/j.neuron.2026.04.002
external_id:
pmid:
- '42161246'
intvolume: ' 114'
issue: '10'
language:
- iso: eng
month: '05'
oa_version: None
page: 1706-1708
pmid: 1
publication: Neuron
publication_identifier:
issn:
- 0896-6273
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Mission impossible? Quantitative analysis of dendritic computations in vivo
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 114
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
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'
...
---
_id: '21864'
alternative_title:
- ISTA Technical Report
article_processing_charge: No
author:
- first_name: '1'
full_name: Anonymous, 1
last_name: Anonymous
- first_name: '2'
full_name: Anonymous, 2
last_name: Anonymous
- first_name: '3'
full_name: Anonymous, 3
last_name: Anonymous
citation:
ama: Anonymous 1, Anonymous 2, Anonymous 3. Mechanism of Tissue Tension Homeostasis
during Embryogenesis. Institute of Science and Technology Austria
apa: Anonymous, 1, Anonymous, 2, & Anonymous, 3. (n.d.). Mechanism of tissue
tension homeostasis during embryogenesis. Institute of Science and Technology
Austria.
chicago: Anonymous, 1, 2 Anonymous, and 3 Anonymous. Mechanism of Tissue Tension
Homeostasis during Embryogenesis. Institute of Science and Technology Austria,
n.d.
ieee: 1 Anonymous, 2 Anonymous, and 3 Anonymous, Mechanism of tissue tension
homeostasis during embryogenesis. Institute of Science and Technology Austria.
ista: Anonymous 1, Anonymous 2, Anonymous 3. Mechanism of tissue tension homeostasis
during embryogenesis, Institute of Science and Technology Austria, 32p.
mla: Anonymous, 1, et al. Mechanism of Tissue Tension Homeostasis during Embryogenesis.
Institute of Science and Technology Austria.
short: 1 Anonymous, 2 Anonymous, 3 Anonymous, Mechanism of Tissue Tension Homeostasis
during Embryogenesis, Institute of Science and Technology Austria, n.d.
date_created: 2026-05-12T12:52:44Z
date_published: 2026-05-13T00:00:00Z
date_updated: 2026-07-14T07:07:41Z
day: '13'
ddc:
- '570'
file:
- access_level: open_access
checksum: 1512170d78f9f31025c87b3a03c62f0c
content_type: application/pdf
creator: nhino
date_created: 2026-05-12T12:43:32Z
date_updated: 2026-05-12T12:43:32Z
file_id: '21865'
file_name: Main_text_and_figures.pdf
file_size: 10079104
relation: main_file
success: 1
- access_level: open_access
checksum: bee92c26b42433e4ff5ca3f17e3f0640
content_type: application/pdf
creator: nhino
date_created: 2026-05-12T12:44:02Z
date_updated: 2026-05-12T12:44:02Z
file_id: '21866'
file_name: Supplementary_figures.pdf
file_size: 1820979
relation: main_file
success: 1
- access_level: open_access
checksum: 9d9ab89c372142f2ffb6c8c625334d7f
content_type: video/mp4
creator: nhino
date_created: 2026-05-12T12:44:09Z
date_updated: 2026-05-12T12:44:09Z
file_id: '21867'
file_name: Supplementary_Video1.mp4
file_size: 10349451
relation: main_file
success: 1
- access_level: closed
checksum: 3e220d1cc8f883bef02eaf5d810cd911
content_type: text/plain
creator: dernst
date_created: 2026-05-13T06:11:26Z
date_updated: 2026-05-13T06:11:26Z
file_id: '21874'
file_name: authors.txt
file_size: 91
relation: main_file
file_date_updated: 2026-05-13T06:11:26Z
has_accepted_license: '1'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Preprint
page: '32'
publication_identifier:
eissn:
- 2664-1690
publication_status: draft
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22276'
relation: later_version
status: public
status: public
title: Mechanism of tissue tension homeostasis during embryogenesis
type: technical_report
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22308'
abstract:
- lang: eng
text: This article is a collection of contributions from speakers at the 2025 DEAMN
workshop at the Majorana Centre in Erice. Not ordinary contributions to a conference
proceeding, this gives a new and different perspective on the work done by the
workshop participants.
article_number: '50'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Klavs
full_name: Hansen, Klavs
last_name: Hansen
- first_name: Vitaly
full_name: Kresin, Vitaly
last_name: Kresin
- first_name: Ragheed
full_name: Al Hyder, Ragheed
id: d1c405be-ae15-11ed-8510-ccf53278162e
last_name: Al Hyder
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
- first_name: Michal
full_name: Fárník, Michal
last_name: Fárník
- first_name: Juraj
full_name: Fedor, Juraj
last_name: Fedor
- first_name: Piero
full_name: Ferrari, Piero
last_name: Ferrari
- first_name: Laura X.
full_name: Worutowicz, Laura X.
last_name: Worutowicz
- first_name: Rick J.
full_name: Louwerse, Rick J.
last_name: Louwerse
- first_name: Denis
full_name: Kiawi, Denis
last_name: Kiawi
- first_name: Laurens B. F. M.
full_name: Waters, Laurens B. F. M.
last_name: Waters
- first_name: Sandra M.
full_name: Lang, Sandra M.
last_name: Lang
- first_name: Joost M.
full_name: Bakker, Joost M.
last_name: Bakker
- first_name: Bernd
full_name: von Issendorff, Bernd
last_name: von Issendorff
- first_name: Wei
full_name: Kong, Wei
last_name: Kong
- first_name: Jannik
full_name: Mehmel, Jannik
last_name: Mehmel
- first_name: Rolf
full_name: Schäfer, Rolf
last_name: Schäfer
- first_name: Sebastian
full_name: Pedalino, Sebastian
last_name: Pedalino
- first_name: Bruno E.
full_name: Ramírez-Galindo, Bruno E.
last_name: Ramírez-Galindo
- first_name: Richard
full_name: Ferstl, Richard
last_name: Ferstl
- first_name: Severin
full_name: Sindelar, Severin
last_name: Sindelar
- first_name: Stefan
full_name: Gerlich, Stefan
last_name: Gerlich
- first_name: Markus
full_name: Arndt, Markus
last_name: Arndt
- first_name: Scott G.
full_name: Sayres, Scott G.
last_name: Sayres
- first_name: Lai-Sheng
full_name: Wang, Lai-Sheng
last_name: Wang
citation:
ama: Hansen K, Kresin V, Al Hyder R, et al. Reflections on future problems in cluster
science. The European Physical Journal D. 2026;80(5). doi:10.1140/epjd/s10053-026-01126-x
apa: Hansen, K., Kresin, V., Al Hyder, R., Lemeshko, M., Fárník, M., Fedor, J.,
… Wang, L.-S. (2026). Reflections on future problems in cluster science. The
European Physical Journal D. Springer Nature. https://doi.org/10.1140/epjd/s10053-026-01126-x
chicago: Hansen, Klavs, Vitaly Kresin, Ragheed Al Hyder, Mikhail Lemeshko, Michal
Fárník, Juraj Fedor, Piero Ferrari, et al. “Reflections on Future Problems in
Cluster Science.” The European Physical Journal D. Springer Nature, 2026.
https://doi.org/10.1140/epjd/s10053-026-01126-x.
ieee: K. Hansen et al., “Reflections on future problems in cluster science,”
The European Physical Journal D, vol. 80, no. 5. Springer Nature, 2026.
ista: Hansen K, Kresin V, Al Hyder R, Lemeshko M, Fárník M, Fedor J, Ferrari P,
Worutowicz LX, Louwerse RJ, Kiawi D, Waters LBFM, Lang SM, Bakker JM, von Issendorff
B, Kong W, Mehmel J, Schäfer R, Pedalino S, Ramírez-Galindo BE, Ferstl R, Sindelar
S, Gerlich S, Arndt M, Sayres SG, Wang L-S. 2026. Reflections on future problems
in cluster science. The European Physical Journal D. 80(5), 50.
mla: Hansen, Klavs, et al. “Reflections on Future Problems in Cluster Science.”
The European Physical Journal D, vol. 80, no. 5, 50, Springer Nature, 2026,
doi:10.1140/epjd/s10053-026-01126-x.
short: K. Hansen, V. Kresin, R. Al Hyder, M. Lemeshko, M. Fárník, J. Fedor, P. Ferrari,
L.X. Worutowicz, R.J. Louwerse, D. Kiawi, L.B.F.M. Waters, S.M. Lang, J.M. Bakker,
B. von Issendorff, W. Kong, J. Mehmel, R. Schäfer, S. Pedalino, B.E. Ramírez-Galindo,
R. Ferstl, S. Sindelar, S. Gerlich, M. Arndt, S.G. Sayres, L.-S. Wang, The European
Physical Journal D 80 (2026).
das_tickbox: '0'
date_created: 2026-07-13T10:53:35Z
date_published: 2026-05-04T00:00:00Z
date_updated: 2026-07-14T08:03:03Z
day: '04'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1140/epjd/s10053-026-01126-x
external_id:
arxiv:
- '2605.03402'
has_accepted_license: '1'
intvolume: ' 80'
issue: '5'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2605.03402
month: '05'
oa: 1
oa_version: Preprint
publication: The European Physical Journal D
publication_identifier:
eissn:
- 1434-6079
issn:
- 1434-6060
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
researchdata_availability: not applicable
scopus_import: '1'
status: public
supplementarymaterial: no
title: Reflections on future problems in cluster science
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 80
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22167'
abstract:
- lang: eng
text: "Given a vertex-ordered graph G, the ordered Ramsey number\r\nr<(G) is the
minimum integer N such that every 2-coloring of the edges of\r\nthe complete ordered
graph KN contains a monochromatic ordered copy of G.\r\nMotivated by a similar
question posed by Erd˝os and Graham [On partition\r\ntheorems for finite graphs,
Infinite and finite sets (Colloq., Keszthely, 1973),\r\nNorth-Holland, Amsterdam-London,
pp. 515–527] in the unordered setting,\r\nwe study the problem of bounding the
ordered Ramsey number of any ordered graph G with m edges and no isolated vertices.
We prove that r<(G) ≤\r\ne109√m(log log m)3/2\r\nfor any such G, which is tight
up to the (log log m)3/2\r\nfactor in the exponent. As a corollary, we obtain
the corresponding bound for\r\nthe oriented Ramsey number of a directed graph
with m edges."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Domagoj
full_name: Bradač, Domagoj
last_name: Bradač
- first_name: Patryk
full_name: Morawski, Patryk
last_name: Morawski
- first_name: Benny
full_name: Sudakov, Benny
last_name: Sudakov
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: "Bradač D, Morawski P, Sudakov B, Wigderson Y. Ordered Ramsey numbers of graphs
with \U0001D45A edges. Proceedings of the American Mathematical Society.
2026;154(3):927-942. doi:10.1090/proc/17442"
apa: "Bradač, D., Morawski, P., Sudakov, B., & Wigderson, Y. (2026). Ordered
Ramsey numbers of graphs with \U0001D45A edges. Proceedings of the American
Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/17442"
chicago: "Bradač, Domagoj, Patryk Morawski, Benny Sudakov, and Yuval Wigderson.
“Ordered Ramsey Numbers of Graphs with \U0001D45A Edges.” Proceedings of the
American Mathematical Society. American Mathematical Society, 2026. https://doi.org/10.1090/proc/17442."
ieee: "D. Bradač, P. Morawski, B. Sudakov, and Y. Wigderson, “Ordered Ramsey numbers
of graphs with \U0001D45A edges,” Proceedings of the American Mathematical
Society, vol. 154, no. 3. American Mathematical Society, pp. 927–942, 2026."
ista: "Bradač D, Morawski P, Sudakov B, Wigderson Y. 2026. Ordered Ramsey numbers
of graphs with \U0001D45A edges. Proceedings of the American Mathematical Society.
154(3), 927–942."
mla: "Bradač, Domagoj, et al. “Ordered Ramsey Numbers of Graphs with \U0001D45A
Edges.” Proceedings of the American Mathematical Society, vol. 154, no.
3, American Mathematical Society, 2026, pp. 927–42, doi:10.1090/proc/17442."
short: D. Bradač, P. Morawski, B. Sudakov, Y. Wigderson, Proceedings of the American
Mathematical Society 154 (2026) 927–942.
date_created: 2026-06-29T10:54:32Z
date_published: 2026-01-16T00:00:00Z
date_updated: 2026-07-14T08:34:43Z
day: '16'
doi: 10.1090/proc/17442
extern: '1'
external_id:
arxiv:
- '2412.17599'
intvolume: ' 154'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2412.17599
month: '01'
oa: 1
oa_version: Preprint
page: 927-942
publication: Proceedings of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6826
issn:
- 0002-9939
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: "Ordered Ramsey numbers of graphs with \U0001D45A edges"
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 154
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22183'
abstract:
- lang: eng
text: "A partition of a (hyper)graph is ε-homogeneous if the edge densities between
almost all clusters are\r\neither at most ε or at least 1 − ε. Suppose a 3-graph
has the property that the link of every vertex has\r\nan ε-homogeneous partition
of size poly(1/ε). Does this guarantee that the 3-graph also has a small\r\nhomogeneous
partition? Terry and Wolf proved that such a 3-graph has an ε-homogeneous partition\r\nof
size given by a wowzer-type function. Terry recently improved this to a double
exponential bound,\r\nand conjectured that this bound is tight. Our first result
in this paper disproves this conjecture by\r\ngiving an improved (single) exponential
bound, which is best possible. We further obtain an analogous\r\nresult for k-graphs
of all uniformities k 3. The above problem is part of a much broader programme,\r\nwhich
seeks to understand the conditions under which a (hyper)graph has small ε-regular
partitions.\r\nWhile this problem is fairly well understood for graphs, the situation
is (as always) much more\r\ninvolved already for 3-graphs. For example, it is
natural to ask if one can strengthen our first result\r\nby only requiring each
link to have ε-regular partitions of size poly(1/ε). Our second result shows that\r\nsurprisingly
the answer is “no”, namely, a 3-graph might only have regular partitions of tower-type
size,\r\neven though the link of every vertex has an ε-regular partition of polynomial
size."
article_number: rnag018
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Lior
full_name: Gishboliner, Lior
last_name: Gishboliner
- first_name: Asaf
full_name: Shapira, Asaf
last_name: Shapira
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: Gishboliner L, Shapira A, Wigderson Y. Is it easy to regularize a hypergraph
with easy links? International Mathematics Research Notices. 2026;2026(4).
doi:10.1093/imrn/rnag018
apa: Gishboliner, L., Shapira, A., & Wigderson, Y. (2026). Is it easy to regularize
a hypergraph with easy links? International Mathematics Research Notices.
Oxford University Press. https://doi.org/10.1093/imrn/rnag018
chicago: Gishboliner, Lior, Asaf Shapira, and Yuval Wigderson. “Is It Easy to Regularize
a Hypergraph with Easy Links?” International Mathematics Research Notices.
Oxford University Press, 2026. https://doi.org/10.1093/imrn/rnag018.
ieee: L. Gishboliner, A. Shapira, and Y. Wigderson, “Is it easy to regularize a
hypergraph with easy links?,” International Mathematics Research Notices,
vol. 2026, no. 4. Oxford University Press, 2026.
ista: Gishboliner L, Shapira A, Wigderson Y. 2026. Is it easy to regularize a hypergraph
with easy links? International Mathematics Research Notices. 2026(4), rnag018.
mla: Gishboliner, Lior, et al. “Is It Easy to Regularize a Hypergraph with Easy
Links?” International Mathematics Research Notices, vol. 2026, no. 4, rnag018,
Oxford University Press, 2026, doi:10.1093/imrn/rnag018.
short: L. Gishboliner, A. Shapira, Y. Wigderson, International Mathematics Research
Notices 2026 (2026).
date_created: 2026-06-29T12:02:25Z
date_published: 2026-02-01T00:00:00Z
date_updated: 2026-07-14T09:25:22Z
day: '01'
doi: 10.1093/imrn/rnag018
extern: '1'
external_id:
arxiv:
- '2506.15582'
intvolume: ' 2026'
issue: '4'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2506.15582
month: '02'
oa: 1
oa_version: Preprint
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Is it easy to regularize a hypergraph with easy links?
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2026
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22184'
abstract:
- lang: eng
text: "Ramsey's theorem states that if N\r\n is sufficiently large, then no matter
how one colors the edges among N\r\n vertices with two colors, there are always
k\r\n vertices spanning edges in only one color. Given this theorem, it is natural
to ask \"how large is sufficiently large?\" Ramsey's original proof showed that
N=k!\r\n is sufficient, and five years later Erdős and Szekeres improved this
bound to N=4^k\r\n. And then progress stalled for almost 90 years.\r\n\r\nIn this
survey, I present the history of the problem, and discuss some of the ideas used
in the recent breakthrough of Campos–Griffiths–Morris–Sahasrabudhe, who proved
that N=3.993^k\r\n is sufficient. In addition, I discuss the subsequent work of
Balister, Bollobás, Campos, Griffiths, Hurley, Morris, Sahasrabudhe, and Tiba,
who gave an alternative, and more conceptual, proof."
- lang: fre
text: "Le théorème de Ramsey stipule que si N\r\n est suffisamment grand, alors
quelle que soit la manière dont l'on colore les arêtes entre N\r\n sommets avec
deux couleurs, il y a toujours k\r\n sommets dont les arêtes ne sont colorées
que d'une seule couleur. Compte tenu de ce théorème, il est naturel de se demander
\"À quel point N\r\n doit être grand ?\" La preuve originale de Ramsey a montré
que N=k!\r\n suffit, et cinq ans plus tard, Erdős et Szekeres ont amélioré cette
borne à N=4k\r\n. Puis le progrès s'est arrêté pendant près de 90 ans.\r\n\r\nDans
cet exposé, je présente l'histoire du problème et je discute certaines idées utilisées
dans la percée récente de Campos--Griffiths-Morris--Sahasrabudhe, qui ont prouvé
que N=3,993k\r\n suffit. De plus, je discute le travail suivant de Balister, Bollobás,
Campos, Griffiths, Hurley, Morris, Sahasrabudhe, et Tiba, qui ont donné une preuve
alternative et plus conceptuelle."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yuval
full_name: Wigderson, Yuval
id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
last_name: Wigderson
citation:
ama: 'Wigderson Y. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers
(after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque. 2026:85-138.
doi:10.24033/ast.1255'
apa: 'Wigderson, Y. (2026). Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey
numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque.
Societe Mathematique de France. https://doi.org/10.24033/ast.1255'
chicago: 'Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey
Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” Astérisque.
Societe Mathematique de France, 2026. https://doi.org/10.24033/ast.1255.'
ieee: 'Y. Wigderson, “Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers
(after Campos, Griffiths, Morris, and Sahasrabudhe),” Astérisque. Societe
Mathematique de France, pp. 85–138, 2026.'
ista: 'Wigderson Y. 2026. Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey
numbers (after Campos, Griffiths, Morris, and Sahasrabudhe). Astérisque., 85–138.'
mla: 'Wigderson, Yuval. “Exposé Bourbaki 1230 : Upper Bounds on Diagonal Ramsey
Numbers (after Campos, Griffiths, Morris, and Sahasrabudhe).” Astérisque,
Societe Mathematique de France, 2026, pp. 85–138, doi:10.24033/ast.1255.'
short: Y. Wigderson, Astérisque (2026) 85–138.
date_created: 2026-06-29T12:02:59Z
date_published: 2026-01-01T00:00:00Z
date_updated: 2026-07-14T09:53:07Z
day: '01'
doi: 10.24033/ast.1255
extern: '1'
external_id:
arxiv:
- '2411.09321'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: 'https://doi.org/10.48550/arXiv.2411.09321 '
mathsc:
- 05D10
- 05C55
month: '01'
oa: 1
oa_version: Preprint
page: 85-138
publication: Astérisque
publication_identifier:
issn:
- 0303-1179
- 2492-5926
publication_status: published
publisher: Societe Mathematique de France
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Exposé Bourbaki 1230 : Upper bounds on diagonal Ramsey numbers (after Campos,
Griffiths, Morris, and Sahasrabudhe)'
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22218'
abstract:
- lang: eng
text: 'Physiological void spaces exist at every scale of the human body, from organs
to molecules, facilitating transport, signal propagation, and localized biochemical
activity. Constriction of these spaces (e.g., arterial occlusion, fibrosis) highlights
their importance, making their mimicry essential in tissue engineering (TE). This
review examines four key strategies for introducing porosity into hydrogels across
multiple length scales: templating, microgels, phase separation, and 3D printing.
The first three methods enable the engineering of physiological environments at
the nano‐ to micro‐scale, mimicking tissue‐ and extracellular matrix (ECM)‐level
spaces. Templating involves embedding and removal of gas, liquid, or solid phases,
leaving behind pores. Microgel annealing generates inherent interstitial voids.
Liquid–liquid phase separation (LLPS) creates biphasic networks reminiscent of
native ECM. The fourth approach, extrusion‐ and light‐based 3D printing techniques,
enables the fabrication of larger‐scale spaces, such as luminal structures (e.g.,
vasculature, airways, and ducts). Combining these methods enables the creation
of hierarchical architectures from the nano‐ to centimeter scale. The review also
highlights Filamented Light (FLight) technology, which creates internal microstructural
voids relevant to anisotropic tissues. This review offers insights into current
methods and their convergence for generating biomimetic void spaces to meet the
physiological demands of cells, tissues, and organs.'
article_number: e07385
article_processing_charge: No
article_type: original
author:
- first_name: Anna
full_name: Puiggalí‐Jou, Anna
last_name: Puiggalí‐Jou
- first_name: Isabel B.
full_name: Hui, Isabel B.
last_name: Hui
- first_name: Carla
full_name: Fernández-Rico, Carla
id: 492def71-6250-11f0-b278-d41dbd241b62
last_name: Fernández-Rico
- first_name: Marcy
full_name: Zenobi‐Wong, Marcy
last_name: Zenobi‐Wong
citation:
ama: 'Puiggalí‐Jou A, Hui IB, Fernández-Rico C, Zenobi‐Wong M. The space within:
How architected voids promote tissue formation. Advanced Materials. 2026;38(7).
doi:10.1002/adma.202507385'
apa: 'Puiggalí‐Jou, A., Hui, I. B., Fernández-Rico, C., & Zenobi‐Wong, M. (2026).
The space within: How architected voids promote tissue formation. Advanced
Materials. Wiley. https://doi.org/10.1002/adma.202507385'
chicago: 'Puiggalí‐Jou, Anna, Isabel B. Hui, Carla Fernández-Rico, and Marcy Zenobi‐Wong.
“The Space within: How Architected Voids Promote Tissue Formation.” Advanced
Materials. Wiley, 2026. https://doi.org/10.1002/adma.202507385.'
ieee: 'A. Puiggalí‐Jou, I. B. Hui, C. Fernández-Rico, and M. Zenobi‐Wong, “The space
within: How architected voids promote tissue formation,” Advanced Materials,
vol. 38, no. 7. Wiley, 2026.'
ista: 'Puiggalí‐Jou A, Hui IB, Fernández-Rico C, Zenobi‐Wong M. 2026. The space
within: How architected voids promote tissue formation. Advanced Materials. 38(7),
e07385.'
mla: 'Puiggalí‐Jou, Anna, et al. “The Space within: How Architected Voids Promote
Tissue Formation.” Advanced Materials, vol. 38, no. 7, e07385, Wiley, 2026,
doi:10.1002/adma.202507385.'
short: A. Puiggalí‐Jou, I.B. Hui, C. Fernández-Rico, M. Zenobi‐Wong, Advanced Materials
38 (2026).
date_created: 2026-06-30T06:36:20Z
date_published: 2026-02-02T00:00:00Z
date_updated: 2026-07-15T08:08:38Z
day: '02'
ddc:
- '540'
doi: 10.1002/adma.202507385
extern: '1'
external_id:
pmid:
- '41312612'
has_accepted_license: '1'
intvolume: ' 38'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1002/adma.202507385
month: '02'
oa: 1
oa_version: Published Version
pmid: 1
publication: Advanced Materials
publication_identifier:
eissn:
- 1521-4095
issn:
- 0935-9648
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'The space within: How architected voids promote tissue formation'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 38
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22215'
abstract:
- lang: eng
text: Elastic MicroPhase separation (EMPS) provides a simple route to create soft
materials with homogeneous microstructures by leveraging the supersaturation of
crosslinked polymer networks with liquids. At low supersaturation, network elasticity
stabilizes a uniform mixture, but beyond a critical threshold, metastable microphase-separated
domains emerge. While previous theories have focused on describing qualitative
features about the size and morphology of these domains, they do not make quantitative
predictions about EMPS phase diagrams. In this work, we extend Flory–Huggins theory
to quantitatively capture EMPS phase diagrams by incorporating strain-stiffening
effects. This model requires no fitting parameters and relies solely on independently
measured solubility parameters and large-deformation mechanical responses. Our
results confirm that strain-stiffening enables metastable microphase separation
within the swelling equilibrium state and reveal why the microstructures can range
from discrete droplets to bicontinuous networks. This works highlights the critical
role of nonlinear elasticity in controlling phase-separated morphologies in polymer
gels.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Carla
full_name: Fernández-Rico, Carla
id: 492def71-6250-11f0-b278-d41dbd241b62
last_name: Fernández-Rico
- first_name: Robert W.
full_name: Style, Robert W.
last_name: Style
- first_name: Stefanie
full_name: Heyden, Stefanie
last_name: Heyden
- first_name: Shichen
full_name: Wang, Shichen
last_name: Wang
- first_name: Peter D.
full_name: Olmsted, Peter D.
last_name: Olmsted
- first_name: Eric R.
full_name: Dufresne, Eric R.
last_name: Dufresne
citation:
ama: Fernández-Rico C, Style RW, Heyden S, Wang S, Olmsted PD, Dufresne ER. Thermodynamics
of microphase separation in a swollen, strain-stiffening polymer network. Soft
Matter. 2026;22(2):330-342. doi:10.1039/d5sm00594a
apa: Fernández-Rico, C., Style, R. W., Heyden, S., Wang, S., Olmsted, P. D., &
Dufresne, E. R. (2026). Thermodynamics of microphase separation in a swollen,
strain-stiffening polymer network. Soft Matter. Royal Society of Chemistry.
https://doi.org/10.1039/d5sm00594a
chicago: Fernández-Rico, Carla, Robert W. Style, Stefanie Heyden, Shichen Wang,
Peter D. Olmsted, and Eric R. Dufresne. “Thermodynamics of Microphase Separation
in a Swollen, Strain-Stiffening Polymer Network.” Soft Matter. Royal Society
of Chemistry, 2026. https://doi.org/10.1039/d5sm00594a.
ieee: C. Fernández-Rico, R. W. Style, S. Heyden, S. Wang, P. D. Olmsted, and E.
R. Dufresne, “Thermodynamics of microphase separation in a swollen, strain-stiffening
polymer network,” Soft Matter, vol. 22, no. 2. Royal Society of Chemistry,
pp. 330–342, 2026.
ista: Fernández-Rico C, Style RW, Heyden S, Wang S, Olmsted PD, Dufresne ER. 2026.
Thermodynamics of microphase separation in a swollen, strain-stiffening polymer
network. Soft Matter. 22(2), 330–342.
mla: Fernández-Rico, Carla, et al. “Thermodynamics of Microphase Separation in a
Swollen, Strain-Stiffening Polymer Network.” Soft Matter, vol. 22, no.
2, Royal Society of Chemistry, 2026, pp. 330–42, doi:10.1039/d5sm00594a.
short: C. Fernández-Rico, R.W. Style, S. Heyden, S. Wang, P.D. Olmsted, E.R. Dufresne,
Soft Matter 22 (2026) 330–342.
date_created: 2026-06-30T06:33:11Z
date_published: 2026-01-14T00:00:00Z
date_updated: 2026-07-15T07:42:04Z
day: '14'
ddc:
- '540'
doi: 10.1039/d5sm00594a
extern: '1'
external_id:
arxiv:
- '2506.08958'
pmid:
- '41400267'
has_accepted_license: '1'
intvolume: ' 22'
issue: '2'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1039/d5sm00594a
month: '01'
oa: 1
oa_version: Published Version
page: 330-342
pmid: 1
publication: Soft Matter
publication_identifier:
eissn:
- 1744-6848
issn:
- 1744-683X
publication_status: published
publisher: Royal Society of Chemistry
quality_controlled: '1'
scopus_import: '1'
status: public
title: Thermodynamics of microphase separation in a swollen, strain-stiffening polymer
network
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 22
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21002'
abstract:
- lang: eng
text: The Davenport–Heilbronn method is a version of the circle method that was
developed for studying Diophantine inequalities in the paper (Davenport and Heilbronn,
J. Lond. Math. Soc. (1) 21 (1946), 185–193). We discuss the main ideas in the
paper, together with an account of the development of the subject in the intervening
80 years.
acknowledgement: "The author is very grateful to Jörg Brüdern, Simon Rydin Myerson
and Trevor Wooley for their help and advice with preparing this survey, in addition
to Vinay Kumaraswamy, Victor Wang and the anonymous referee for useful comments
on an earlier draft. This work was supported by a FWF Grant (DOI 10.55776/P36278).\r\nOpen
Access funding provided by Institute of Science and Technology Austria/KEMÖ."
article_number: e70371
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Timothy D
full_name: Browning, Timothy D
id: 35827D50-F248-11E8-B48F-1D18A9856A87
last_name: Browning
orcid: 0000-0002-8314-0177
citation:
ama: 'Browning TD. The Davenport–Heilbronn method: 80 years on. Journal of the
London Mathematical Society. 2026;113(1). doi:10.1112/jlms.70371'
apa: 'Browning, T. D. (2026). The Davenport–Heilbronn method: 80 years on. Journal
of the London Mathematical Society. Wiley. https://doi.org/10.1112/jlms.70371'
chicago: 'Browning, Timothy D. “The Davenport–Heilbronn Method: 80 Years On.” Journal
of the London Mathematical Society. Wiley, 2026. https://doi.org/10.1112/jlms.70371.'
ieee: 'T. D. Browning, “The Davenport–Heilbronn method: 80 years on,” Journal
of the London Mathematical Society, vol. 113, no. 1. Wiley, 2026.'
ista: 'Browning TD. 2026. The Davenport–Heilbronn method: 80 years on. Journal of
the London Mathematical Society. 113(1), e70371.'
mla: 'Browning, Timothy D. “The Davenport–Heilbronn Method: 80 Years On.” Journal
of the London Mathematical Society, vol. 113, no. 1, e70371, Wiley, 2026,
doi:10.1112/jlms.70371.'
short: T.D. Browning, Journal of the London Mathematical Society 113 (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-01-18T23:02:44Z
date_published: 2026-01-06T00:00:00Z
date_updated: 2026-07-16T08:33:56Z
day: '06'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1112/jlms.70371
file:
- access_level: open_access
checksum: 3b05bd625c81d038259a14f7e2ddd57c
content_type: application/pdf
creator: dernst
date_created: 2026-01-19T08:19:46Z
date_updated: 2026-01-19T08:19:46Z
file_id: '21004'
file_name: 2026_JourLondonMathSoc_Browning.pdf
file_size: 235238
relation: main_file
success: 1
file_date_updated: 2026-01-19T08:19:46Z
has_accepted_license: '1'
intvolume: ' 113'
issue: '1'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: bd8a4fdc-d553-11ed-ba76-80a0167441a3
grant_number: P36278
name: Rational curves via function field analytic number theory
publication: Journal of the London Mathematical Society
publication_identifier:
eissn:
- 1469-7750
issn:
- 0024-6107
publication_status: published
publisher: Wiley
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'The Davenport–Heilbronn method: 80 years on'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 113
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21385'
abstract:
- lang: eng
text: 'We prove that the average size of a mixed character sum (math. formular)
(for a suitable smooth function w) is on the order of √x for all irrational real
θ satisfying a weak Diophantine condition, where χ is drawn from the family of
Dirichlet characters modulo a large prime r and where x 6 r. In contrast, it was
proved by Harper that the average size is o(√x) for rational θ. Certain quadratic
Diophantine equations play a key role in the present paper. '
acknowledgement: "We thank Ofir Gorodetsky, Andrew Granville, Adam Harper, Youness
Lamzouri,\r\nKannan Soundararajan, Ping Xi, and Matt Young for their interest, helpful
discussions, and comments. Special thanks are due to Jonathan Bober, Oleksiy Klurman,\r\nand
Besfort Shala for sending us a letter about Question 1.3, and to Hung Bui\r\nfor
informing us of [7]. V.W. thanks Stanford University for its hospitality and is
supported by the European Union’s Horizon 2020 research and innovation program\r\nunder
the Marie Skłodowska–Curie Grant Agreement No. 101034413. M.X. is supported by a
Simons Junior Fellowship from the Simons Society of Fellows at the\r\nSimons Foundation."
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Victor
full_name: Wang, Victor
id: 76096395-aea4-11ed-a680-ab8ebbd3f1b9
last_name: Wang
orcid: 0000-0002-0704-7026
- first_name: Max
full_name: Xu, Max
last_name: Xu
citation:
ama: 'Wang V, Xu M. Average sizes of mixed character sums. Proceedings of the
Royal Society of Edinburgh: Section A Mathematics. 2026:1-15. doi:10.1017/prm.2026.10123'
apa: 'Wang, V., & Xu, M. (2026). Average sizes of mixed character sums. Proceedings
of the Royal Society of Edinburgh: Section A Mathematics. Cambridge University
Press. https://doi.org/10.1017/prm.2026.10123'
chicago: 'Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” Proceedings
of the Royal Society of Edinburgh: Section A Mathematics. Cambridge University
Press, 2026. https://doi.org/10.1017/prm.2026.10123.'
ieee: 'V. Wang and M. Xu, “Average sizes of mixed character sums,” Proceedings
of the Royal Society of Edinburgh: Section A Mathematics. Cambridge University
Press, pp. 1–15, 2026.'
ista: 'Wang V, Xu M. 2026. Average sizes of mixed character sums. Proceedings of
the Royal Society of Edinburgh: Section A Mathematics., 1–15.'
mla: 'Wang, Victor, and Max Xu. “Average Sizes of Mixed Character Sums.” Proceedings
of the Royal Society of Edinburgh: Section A Mathematics, Cambridge University
Press, 2026, pp. 1–15, doi:10.1017/prm.2026.10123.'
short: 'V. Wang, M. Xu, Proceedings of the Royal Society of Edinburgh: Section A
Mathematics (2026) 1–15.'
corr_author: '1'
das_tickbox: '0'
date_created: 2026-03-02T10:09:23Z
date_published: 2026-01-01T00:00:00Z
date_updated: 2026-07-16T08:39:57Z
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/prm.2026.10123
ec_funded: 1
external_id:
arxiv:
- '2411.14181'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1017/prm.2026.10123
month: '01'
oa: 1
oa_version: Published Version
page: 1-15
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 'Proceedings of the Royal Society of Edinburgh: Section A Mathematics'
publication_identifier:
eissn:
- 1473-7124
issn:
- 0308-2105
publication_status: epub_ahead
publisher: Cambridge University Press
quality_controlled: '1'
researchdata_availability: no
status: public
supplementarymaterial: no
title: Average sizes of mixed character sums
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '21242'
abstract:
- lang: eng
text: We obtain an asymptotic formula for the number of integral solutions to a
system of diagonal equations. We obtain an asymptotic formula for the number of
solutions with variables restricted to smooth numbers as well. We improve the
required number of variables compared to previous results by incorporating recent
progress on Waring’s problem and the resolution of the main conjecture in Vinogradov’s
mean value theorem.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Nick
full_name: Rome, Nick
last_name: Rome
- first_name: Shuntaro
full_name: Yamagishi, Shuntaro
id: 0c3fbc5c-f7a6-11ec-8d70-9485e75b416b
last_name: Yamagishi
citation:
ama: Rome N, Yamagishi S. Integral solutions to systems of diagonal equations. Pacific
Journal of Mathematics. 2026;340(1):179-198. doi:10.2140/pjm.2026.340.179
apa: Rome, N., & Yamagishi, S. (2026). Integral solutions to systems of diagonal
equations. Pacific Journal of Mathematics. Mathematical Sciences Publishers.
https://doi.org/10.2140/pjm.2026.340.179
chicago: Rome, Nick, and Shuntaro Yamagishi. “Integral Solutions to Systems of Diagonal
Equations.” Pacific Journal of Mathematics. Mathematical Sciences Publishers,
2026. https://doi.org/10.2140/pjm.2026.340.179.
ieee: N. Rome and S. Yamagishi, “Integral solutions to systems of diagonal equations,”
Pacific Journal of Mathematics, vol. 340, no. 1. Mathematical Sciences
Publishers, pp. 179–198, 2026.
ista: Rome N, Yamagishi S. 2026. Integral solutions to systems of diagonal equations.
Pacific Journal of Mathematics. 340(1), 179–198.
mla: Rome, Nick, and Shuntaro Yamagishi. “Integral Solutions to Systems of Diagonal
Equations.” Pacific Journal of Mathematics, vol. 340, no. 1, Mathematical
Sciences Publishers, 2026, pp. 179–98, doi:10.2140/pjm.2026.340.179.
short: N. Rome, S. Yamagishi, Pacific Journal of Mathematics 340 (2026) 179–198.
das_tickbox: '0'
date_created: 2026-02-16T15:17:27Z
date_published: 2026-01-01T00:00:00Z
date_updated: 2026-07-16T08:36:20Z
day: '01'
department:
- _id: TiBr
doi: 10.2140/pjm.2026.340.179
external_id:
arxiv:
- '2406.09256'
intvolume: ' 340'
issue: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2406.09256
month: '01'
oa: 1
oa_version: Preprint
page: 179-198
publication: Pacific Journal of Mathematics
publication_identifier:
eissn:
- 1945-5844
issn:
- 0030-8730
publication_status: published
publisher: Mathematical Sciences Publishers
quality_controlled: '1'
researchdata_availability: no
status: public
supplementarymaterial: no
title: Integral solutions to systems of diagonal equations
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 340
year: '2026'
...
---
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22318'
abstract:
- lang: eng
text: "Many intended uses of differential privacy involve a continual mechanism
that is set up to run continuously\r\nover a long period of time, making more
statistical releases as either queries come in or the dataset is updated.\r\nIn
this paper, we give the first general treatment of privacy against adaptive adversaries
for mechanisms that\r\nsupport dataset updates and a variety of queries, all arbitrarily
interleaved. It also models a very general notion\r\nof neighboring, that includes
both event-level and user-level privacy. We prove several concurrent composition\r\ntheorems
for continual mechanisms, which ensure privacy even when an adversary can interleave
its queries\r\nand dataset updates to the different composed mechanisms. Previous
concurrent composition theorems for\r\ndifferential privacy were only for the
case when the dataset is static, with no adaptive updates. We also give\r\nthe
first interactive and continual generalizations of the “parallel composition theorem”
for noninteractive\r\ndifferential privacy. Specifically, we show that the analogue
of the noninteractive parallel composition theorem\r\nholds if either there are
no adaptive dataset updates or each of the composed mechanisms satisfies pure\r\ndifferential
privacy, but it fails to hold for composing approximately differentially private
mechanisms with\r\ndataset updates. Thus, we prove a tight new composition theorem
for this case. In addition, we prove concurrent\r\nfilter compositions theorems
for the scenarios in which the privacy parameters are adaptively chosen. We\r\nextend
these results to other measures of differential privacy, including Rényi DP and
\U0001D453 -DP.\r\nWe then formalize a set of general conditions on a continual
mechanism M that runs multiple continual submechanisms such that the privacy guarantees
of M follow directly using the above concurrent composition\r\ntheorems on the
sub-mechanisms, without further privacy loss. This enables us to give a simpler
and modular\r\nprivacy analysis of a recent continual histogram mechanism of Henzinger,
Sricharan, and Steiner. In the\r\ncase of approximate DP, ours is the first proof
that shows that its privacy holds against adaptive adversaries.\r\nWe also provide
a framework that simplifies the analysis of local differential privacy when the
protocol\r\nincludes multi-round server-user interactions. Using this result,
we simplify the privacy analysis of the core\r\ndecomposition protocol of Dhulipala,
Henzinger, Li, Liu, Sricharan, and Zhu [5]."
acknowledgement: "1Salil Vadhan was supported by NSF grant BCS-2218803, a grant from
the Sloan Foundation, and\r\na Simons Investigator Award. Work began while a Visiting
Researcher at the Bocconi University\r\nDepartment of Computing Sciences, supported
by Luca Trevisan’s ERC Project GA-834861.\r\n2Monika Henzinger and Roodabeh Safavi
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),
and the Austrian Science Fund (FWF) under grants DOI 10.55776/Z422, DOI\r\n10.55776/I5982,
and DOI 10.55776/P33775. For open access purposes, the author has applied a CC BY\r\npublic
copyright license to any author-accepted manuscript version arising from this submission.\r\nViews
and opinions expressed are however those of the author(s)\r\nonly and do not necessarily
reflect those of the European Union\r\nor the European Research Council Executive
Agency. Neither the\r\nEuropean Union nor the granting authority can be held responsible
for them."
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Roodabeh
full_name: Safavi Hemami, Roodabeh
id: 72ed2640-8972-11ed-ae7b-f9c81ec75154
last_name: Safavi Hemami
- first_name: Salil
full_name: Vadhan, Salil
last_name: Vadhan
citation:
ama: Henzinger M, Safavi Hemami R, Vadhan S. Concurrent composition for differentially
private continual mechanisms. Proceedings of the ACM on Management of Data.
2026;4(2):1-26. doi:10.1145/3801895
apa: Henzinger, M., Safavi Hemami, R., & Vadhan, S. (2026). Concurrent composition
for differentially private continual mechanisms. Proceedings of the ACM on
Management of Data. Association for Computing Machinery. https://doi.org/10.1145/3801895
chicago: Henzinger, Monika, Roodabeh Safavi Hemami, and Salil Vadhan. “Concurrent
Composition for Differentially Private Continual Mechanisms.” Proceedings of
the ACM on Management of Data. Association for Computing Machinery, 2026.
https://doi.org/10.1145/3801895.
ieee: M. Henzinger, R. Safavi Hemami, and S. Vadhan, “Concurrent composition for
differentially private continual mechanisms,” Proceedings of the ACM on Management
of Data, vol. 4, no. 2. Association for Computing Machinery, pp. 1–26, 2026.
ista: Henzinger M, Safavi Hemami R, Vadhan S. 2026. Concurrent composition for differentially
private continual mechanisms. Proceedings of the ACM on Management of Data. 4(2),
1–26.
mla: Henzinger, Monika, et al. “Concurrent Composition for Differentially Private
Continual Mechanisms.” Proceedings of the ACM on Management of Data, vol.
4, no. 2, Association for Computing Machinery, 2026, pp. 1–26, doi:10.1145/3801895.
short: M. Henzinger, R. Safavi Hemami, S. Vadhan, Proceedings of the ACM on Management
of Data 4 (2026) 1–26.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-13T14:59:14Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-07-16T09:14:49Z
day: '01'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.1145/3801895
ec_funded: 1
external_id:
arxiv:
- '2411.03299'
file:
- access_level: open_access
checksum: c6c5e256d02b90682c0690c3bee94040
content_type: application/pdf
creator: dernst
date_created: 2026-07-16T09:09:53Z
date_updated: 2026-07-16T09:09:53Z
file_id: '22345'
file_name: 2026_ACMMgmtData_Henzinger.pdf
file_size: 655405
relation: main_file
success: 1
file_date_updated: 2026-07-16T09:09:53Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '2'
keyword:
- differential privacy
- concurrent composition
- continual release
- continual observation
- data streaming
- continual mechanisms
- concurrent parallel composition
- concurrent filter composition
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1-26
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
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
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: Concurrent composition for differentially private continual mechanisms
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: repository
OA_type: green
_id: '22294'
abstract:
- lang: eng
text: 'Modern computer systems store vast amounts of personal data, enabling advances
in AI and ML but risking user privacy and trust. For privacy reasons, it is sometimes
desired for an ML model to forget part of the data it was trained on. In this
paper, we introduce a novel unlearning approach based on Forgetting Neural Networks
(FNNs), a neuroscience-inspired architecture that explicitly encodes forgetting
through multiplicative decay factors. While FNNs had previously been studied as
a theoretical construct, we provide the first concrete implementation and demonstrate
their effectiveness for targeted unlearning. We propose several variants with
per-neuron forgetting factors, including rank-based assignments guided by activation
levels, and evaluate them on MNIST and Fashion-MNIST benchmarks. Our method systematically
removes information associated with forget sets while preserving performance on
retained data. Membership inference attacks confirm the effectiveness of FNN-based
unlearning in erasing information about the training data from the neural network.
These results establish FNNs as a promising foundation for efficient and interpretable
unlearning. '
article_processing_charge: No
arxiv: 1
author:
- first_name: Amartya
full_name: Hatua, Amartya
last_name: Hatua
- first_name: Trung
full_name: Nguyen, Trung
last_name: Nguyen
- first_name: Filip
full_name: Cano Cordoba, Filip
id: 708cad98-e86a-11ef-8098-bdae2d7c6af1
last_name: Cano Cordoba
orcid: 0000-0002-0783-904X
- first_name: Andrew
full_name: Sung, Andrew
last_name: Sung
citation:
ama: 'Hatua A, Nguyen T, Cano Cordoba F, Sung A. Machine unlearning using forgetting
neural networks. In: Proceedings of the 18th International Conference on Agents
and Artificial Intelligence. Vol 2. SciTePress; 2026:1536-1546. doi:10.5220/0014326500004052'
apa: 'Hatua, A., Nguyen, T., Cano Cordoba, F., & Sung, A. (2026). Machine unlearning
using forgetting neural networks. In Proceedings of the 18th International
Conference on Agents and Artificial Intelligence (Vol. 2, pp. 1536–1546).
Marbella, Spain: SciTePress. https://doi.org/10.5220/0014326500004052'
chicago: Hatua, Amartya, Trung Nguyen, Filip Cano Cordoba, and Andrew Sung. “Machine
Unlearning Using Forgetting Neural Networks.” In Proceedings of the 18th International
Conference on Agents and Artificial Intelligence, 2:1536–46. SciTePress, 2026.
https://doi.org/10.5220/0014326500004052.
ieee: A. Hatua, T. Nguyen, F. Cano Cordoba, and A. Sung, “Machine unlearning using
forgetting neural networks,” in Proceedings of the 18th International Conference
on Agents and Artificial Intelligence, Marbella, Spain, 2026, vol. 2, pp.
1536–1546.
ista: 'Hatua A, Nguyen T, Cano Cordoba F, Sung A. 2026. Machine unlearning using
forgetting neural networks. Proceedings of the 18th International Conference on
Agents and Artificial Intelligence. ICAART: International Conference on Agents
and Artificial Intelligence vol. 2, 1536–1546.'
mla: Hatua, Amartya, et al. “Machine Unlearning Using Forgetting Neural Networks.”
Proceedings of the 18th International Conference on Agents and Artificial Intelligence,
vol. 2, SciTePress, 2026, pp. 1536–46, doi:10.5220/0014326500004052.
short: A. Hatua, T. Nguyen, F. Cano Cordoba, A. Sung, in:, Proceedings of the 18th
International Conference on Agents and Artificial Intelligence, SciTePress, 2026,
pp. 1536–1546.
conference:
end_date: 2026-03-08
location: Marbella, Spain
name: 'ICAART: International Conference on Agents and Artificial Intelligence'
start_date: 2026-03-05
das_tickbox: '1'
date_created: 2026-07-13T09:46:46Z
date_published: 2026-06-30T00:00:00Z
date_updated: 2026-07-16T09:02:53Z
day: '30'
department:
- _id: ToHe
doi: 10.5220/0014326500004052
external_id:
arxiv:
- '2410.22374'
intvolume: ' 2'
keyword:
- Machine Unlearning
- Neuroscience-Inspired Machine Learning
- Membership Inference Attacks
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2410.22374
month: '06'
oa: 1
oa_version: Preprint
page: 1536-1546
publication: Proceedings of the 18th International Conference on Agents and Artificial
Intelligence
publication_identifier:
eissn:
- 2184-433X
isbn:
- '9789897587962'
publication_status: published
publisher: SciTePress
quality_controlled: '1'
scopus_import: '1'
status: public
title: Machine unlearning using forgetting neural networks
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
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
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
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'
...