---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '20482'
abstract:
- lang: eng
text: 'In his study of graph codes, Alon introduced the concept of the odd-Ramsey
number of a family of graphs H in Kn, defined as the minimum number of colours
needed to colour the edges of K so that every copy of a graph H E H intersects
some colour class in an odd number of edges. In this paper, we focus on complete
bipartite graphs. First, we completely resolve the problem when H is the family
of all spanning complete bipartite graphs on n vertices. We then focus on its
subfamilies, that is, {Kt,n-t : t E T} for a fixed set of integers T c [[n/2]].
We prove that the odd-Ramsey problem is equivalent to determining the maximum
dimension of a linear binary code avoiding codewords of given weights, and leverage
known results from coding theory to deduce asymptotically tight bounds in our
setting. We conclude with bounds for the odd-Ramsey numbers of fixed (that is,
non-spanning) complete bipartite subgraphs.'
acknowledgement: "The authors would like to thank Gilles Zémor for a helpful clarification
on [3], Deepak Bal and Patrick Bennett for bringing [25] to their attention, and
both referees for several helpful comments.\r\nS.B.: Most of this research was conducted
while the author was at the School of Mathematics, University of Birmingham, Birmingham,
United Kingdom. The research leading to these results was supported by EPSRC, United
Kingdom, grant no. EP/V048287/1 and by ERC Advanced Grants “GeoScape”, no. 882971
and “ERMiD”, no. 101054936. There are no additional data beyond that contained within
the main manuscript.\r\nS.D.: Research supported by Taiwan NSTC grants 111-2115-M-002-009-MY2
and 113-2628-M-002-008-MY4.\r\nK.P.: This project has received funding from the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No 101034413. Parts of this research was conducted
while K.P. was at the Department of Computer Science, ETH Zürich, Switzerland, supported
by Swiss National Science Foundation, Switzerland , grant no. CRSII5 173721."
article_number: '104235'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Simona
full_name: Boyadzhiyska, Simona
last_name: Boyadzhiyska
- first_name: Shagnik
full_name: Das, Shagnik
last_name: Das
- first_name: Thomas
full_name: Lesgourgues, Thomas
last_name: Lesgourgues
- first_name: Kalina H
full_name: Petrova, Kalina H
id: 554ff4e4-f325-11ee-b0c4-a10dbd523381
last_name: Petrova
citation:
ama: Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. Odd-Ramsey numbers of complete
bipartite graphs. European Journal of Combinatorics. 2026;131. doi:10.1016/j.ejc.2025.104235
apa: Boyadzhiyska, S., Das, S., Lesgourgues, T., & Petrova, K. H. (2026). Odd-Ramsey
numbers of complete bipartite graphs. European Journal of Combinatorics.
Elsevier. https://doi.org/10.1016/j.ejc.2025.104235
chicago: Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova.
“Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics.
Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104235.
ieee: S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers
of complete bipartite graphs,” European Journal of Combinatorics, vol.
131. Elsevier, 2026.
ista: Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. 2026. Odd-Ramsey numbers
of complete bipartite graphs. European Journal of Combinatorics. 131, 104235.
mla: Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.”
European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2026, doi:10.1016/j.ejc.2025.104235.
short: S. Boyadzhiyska, S. Das, T. Lesgourgues, K.H. Petrova, European Journal of
Combinatorics 131 (2026).
corr_author: '1'
date_created: 2025-10-16T13:14:34Z
date_published: 2026-01-01T00:00:00Z
date_updated: 2026-01-05T13:34:48Z
day: '01'
ddc:
- '500'
department:
- _id: MaKw
doi: 10.1016/j.ejc.2025.104235
ec_funded: 1
external_id:
arxiv:
- '2410.05887'
isi:
- '001573380700001'
file:
- access_level: open_access
checksum: 52883daa217398396cbf9b8ad9ddae92
content_type: application/pdf
creator: dernst
date_created: 2026-01-05T13:34:40Z
date_updated: 2026-01-05T13:34:40Z
file_id: '20954'
file_name: 2026_EuropJourCombinatorics_Boyadzhiyska.pdf
file_size: 563029
relation: main_file
success: 1
file_date_updated: 2026-01-05T13:34:40Z
has_accepted_license: '1'
intvolume: ' 131'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: European Journal of Combinatorics
publication_identifier:
issn:
- 0195-6698
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Odd-Ramsey numbers of complete bipartite graphs
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 131
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22103'
abstract:
- lang: eng
text: "Modern AI systems increasingly rely on opaque, highly complex models whose
inner workings remain inaccessible even to experts. This opacity creates challenges
for trust, accountability, and compliance with\r\nemerging regulatory expectations
such as the “right to an explanation”. While traditional explainability methods—feature
attributions, counterfactuals, surrogate models—and interpretable model classes
provide valuable insights for engineers, they often fall short of delivering the
contextual, conversational explanations that\r\nreal users expect. Large Language
Models (LLMs) offer a promising new avenue for explanation due to their\r\nability
to engage interactively, adapt to user needs, and translate technical outputs
into more accessible reasoning. However, their tendencies toward hallucination,
conflict avoidance, and oversimplification introduce\r\nserious risks when used
as explanatory agents. This paper analyzes these opportunities and limitations,
examines verification strategies for ensuring explanation fidelity, and situates
LLM-generated explanations within\r\nbroader concerns about public trust. The
paper concludes by outlining best practices and future research directions for
building robust, verifiable, and human-aligned explanation systems."
acknowledgement: "This work has been supported by the European Research Council under
Grant No.: ERC-2020-AdG\r\n101020093. LLM–based tools have been used as\r\nwriting
assistance to help improve presentation.\r\n"
article_processing_charge: No
author:
- first_name: Filip
full_name: Cano Cordoba, Filip
id: 708cad98-e86a-11ef-8098-bdae2d7c6af1
last_name: Cano Cordoba
orcid: 0000-0002-0783-904X
citation:
ama: 'Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities
and risks of LLMs as explainability assistants. In: Proceedings of the 18th
International Conference on Agents and Artificial Intelligence. Vol 5. Science
and Technology Publications; 2026:4689-4696. doi:10.5220/0014483200004052'
apa: 'Cano Cordoba, F. (2026). Explaining decisions one conversation at a time:
Opportunities and risks of LLMs as explainability assistants. In Proceedings
of the 18th International Conference on Agents and Artificial Intelligence
(Vol. 5, pp. 4689–4696). Marbella, Spain: Science and Technology Publications.
https://doi.org/10.5220/0014483200004052'
chicago: 'Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time:
Opportunities and Risks of LLMs as Explainability Assistants.” In Proceedings
of the 18th International Conference on Agents and Artificial Intelligence,
5:4689–96. Science and Technology Publications, 2026. https://doi.org/10.5220/0014483200004052.'
ieee: 'F. Cano Cordoba, “Explaining decisions one conversation at a time: Opportunities
and risks of LLMs as explainability assistants,” in Proceedings of the 18th
International Conference on Agents and Artificial Intelligence, Marbella,
Spain, 2026, vol. 5, pp. 4689–4696.'
ista: 'Cano Cordoba F. 2026. Explaining decisions one conversation at a time: Opportunities
and risks of LLMs as explainability assistants. Proceedings of the 18th International
Conference on Agents and Artificial Intelligence. ICAART: International Conference
on Agents and Artificial Intelligence vol. 5, 4689–4696.'
mla: 'Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities
and Risks of LLMs as Explainability Assistants.” Proceedings of the 18th International
Conference on Agents and Artificial Intelligence, vol. 5, Science and Technology
Publications, 2026, pp. 4689–96, doi:10.5220/0014483200004052.'
short: F. Cano Cordoba, in:, Proceedings of the 18th International Conference on
Agents and Artificial Intelligence, Science and Technology Publications, 2026,
pp. 4689–4696.
conference:
end_date: 2026-03-08
location: Marbella, Spain
name: 'ICAART: International Conference on Agents and Artificial Intelligence'
start_date: 2026-03-05
corr_author: '1'
das_tickbox: '0'
date_created: 2026-06-21T22:03:00Z
date_published: 2026-04-01T00:00:00Z
date_updated: 2026-06-24T08:37:00Z
day: '01'
department:
- _id: ToHe
doi: 10.5220/0014483200004052
ec_funded: 1
intvolume: ' 5'
keyword:
- Explainable AI
- Large Language Models
- Trust in AI
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://filipcano.org/files/icaart26llm.pdf
month: '04'
oa: 1
oa_version: Accepted Version
page: 4689-4696
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Proceedings of the 18th International Conference on Agents and Artificial
Intelligence
publication_identifier:
eissn:
- 2184-433X
isbn:
- '9789897587962'
issn:
- 2184-3589
publication_status: published
publisher: Science and Technology Publications
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Explaining decisions one conversation at a time: Opportunities and risks of
LLMs as explainability assistants'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2026'
...
---
OA_type: closed access
_id: '22116'
abstract:
- lang: eng
text: "Magnets with isotropic easy-plane symmetry host Goldstone modes that can
be leveraged for efficient\r\nspin transport. Here, we present a time-resolved
optical polarimetry technique that allows us to detect and\r\ncharacterize such
low-frequency modes, and use it to observe the Goldstone mode in the multi-Q broken
helix\r\nphase of EuIn2As2. The strength of our technique comes from the ability
to distinguish between nematic and\r\nmagnetization dynamics in order to yield
information about the mode structure, in addition to its frequency. We\r\nfind
that the nearly uniform spin precession characteristic of a Goldstone mode is
realized only when a small\r\nmagnetic field is used to unpin the broken helix
from local strain generated during crystal growth. In this regime,\r\nthe mode
frequency scales linearly with the applied field due to the ground state C2z symmetry
of the broken\r\nhelix. Our work shows how optical polarimetry can be used to
study the Goldstone modes of complex magnets."
acknowledgement: "We would like to thank Ehud Altman for helpful discussions. This
research was primarily funded by the Quantum\r\nMaterials (KC2202) program under
the U.S. Department of\r\nEnergy, Office of Science, Office of Basic Energy Sciences,\r\nMaterials
Sciences and Engineering Division under Contract\r\nNo. DE-AC02-05CH11231, which
supported the experimental and theoretical work at the Lawrence Berkeley National\r\nLaboratory
and UC Berkeley. D.P. and A.T.B. would like to\r\nacknowledge the Engineering and
Physical Sciences Research\r\nCouncil, UK and the Oxford- ShanghaiTech collaboration\r\nproject
for financial support. J.O. received support from\r\nthe Gordon and Betty Moore
Foundation’s EPiQS Initiative\r\nthrough Grant No. GBMF4537 to J.O. at UC Berkeley.
V.S.\r\nis supported by the Miller Institute for Basic Research in\r\nScience, UC
Berkeley. S.J.G. was supported by the Gordon\r\nand Betty Moore Foundation."
article_number: '224401'
article_processing_charge: No
article_type: original
author:
- first_name: A.
full_name: Liebman-Peláez, A.
last_name: Liebman-Peláez
- first_name: S. J.
full_name: Garratt, S. J.
last_name: Garratt
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: Y.
full_name: Sun, Y.
last_name: Sun
- first_name: J. R.
full_name: Soh, J. R.
last_name: Soh
- first_name: D.
full_name: Prabhakaran, D.
last_name: Prabhakaran
- first_name: A. T.
full_name: Boothroyd, A. T.
last_name: Boothroyd
- first_name: J.
full_name: Orenstein, J.
last_name: Orenstein
citation:
ama: Liebman-Peláez A, Garratt SJ, Sunko V, et al. Observation of a Goldstone mode
in the broken helix by time-resolved optical polarimetry. Physical Review B.
2026;113(22). doi:10.1103/b48p-kw5l
apa: Liebman-Peláez, A., Garratt, S. J., Sunko, V., Sun, Y., Soh, J. R., Prabhakaran,
D., … Orenstein, J. (2026). Observation of a Goldstone mode in the broken helix
by time-resolved optical polarimetry. Physical Review B. American Physical
Society. https://doi.org/10.1103/b48p-kw5l
chicago: Liebman-Peláez, A., S. J. Garratt, Veronika Sunko, Y. Sun, J. R. Soh, D.
Prabhakaran, A. T. Boothroyd, and J. Orenstein. “Observation of a Goldstone Mode
in the Broken Helix by Time-Resolved Optical Polarimetry.” Physical Review
B. American Physical Society, 2026. https://doi.org/10.1103/b48p-kw5l.
ieee: A. Liebman-Peláez et al., “Observation of a Goldstone mode in the broken
helix by time-resolved optical polarimetry,” Physical Review B, vol. 113,
no. 22. American Physical Society, 2026.
ista: Liebman-Peláez A, Garratt SJ, Sunko V, Sun Y, Soh JR, Prabhakaran D, Boothroyd
AT, Orenstein J. 2026. Observation of a Goldstone mode in the broken helix by
time-resolved optical polarimetry. Physical Review B. 113(22), 224401.
mla: Liebman-Peláez, A., et al. “Observation of a Goldstone Mode in the Broken Helix
by Time-Resolved Optical Polarimetry.” Physical Review B, vol. 113, no.
22, 224401, American Physical Society, 2026, doi:10.1103/b48p-kw5l.
short: A. Liebman-Peláez, S.J. Garratt, V. Sunko, Y. Sun, J.R. Soh, D. Prabhakaran,
A.T. Boothroyd, J. Orenstein, Physical Review B 113 (2026).
das_tickbox: '1'
dataavailabilitystatement: "The data that support the findings of this article are
openly\r\navailable [27 - https://doi.org/10.7910/dvn/rqp3az], embargo periods
may apply."
date_created: 2026-06-22T08:52:01Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-06-24T09:49:27Z
day: '01'
doi: 10.1103/b48p-kw5l
extern: '1'
intvolume: ' 113'
issue: '22'
language:
- iso: eng
month: '06'
oa_version: None
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: yes
status: public
supplementarymaterial: no
title: Observation of a Goldstone mode in the broken helix by time-resolved optical
polarimetry
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 113
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '21437'
abstract:
- lang: eng
text: Altermagnets are a class of collinear magnets that exhibit non-relativistic
spin splitting (NRSS) of electronic bands in the absence of net magnetization.
Their potential to generate large spin polarization without spin-orbit coupling
has created strong interest in probes that access the underlying order parameter
directly. In this Perspective, we show that linear magneto-birefringence (LMB)
provides a natural and broadly applicable route to detecting altermagnetic order.
Building on the correspondence between the momentum-space structure of NRSS and
the ferroic ordering of magnetic multipoles in real space, we demonstrate how
$d$-wave and $g$-wave NRSS textures yield distinct LMB responses. We present a
symmetry-based framework that identifies the optical geometries and field configurations
required to isolate specific multipole components, enabling domain imaging and
providing benchmarks for theoretical models of LMB.
acknowledgement: We thank Nicola Spaldin and Marc Vila for valuable discussions. J.O.
received support from the Quantum Materials (KC2202) program under the U.S. Department
of Energy, Office of Science, Office of Basic Energy Sciences, Materials Sciences
and Engineering Division under Contract No. DE-AC02-05CH11231, and the Gordon and
Betty Moore Foundation's EPiQS Initiative through Grant GBMF4537 to J.O. at UC Berkeley.
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Veronika
full_name: Sunko, Veronika
id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3
last_name: Sunko
orcid: 0000-0003-2724-3523
- first_name: J.
full_name: Orenstein, J.
last_name: Orenstein
citation:
ama: Sunko V, Orenstein J. Linear magneto-birefringence as a probe of altermagnetism.
npj Quantum Materials. 2026. doi:10.1038/s41535-026-00901-8
apa: Sunko, V., & Orenstein, J. (2026). Linear magneto-birefringence as a probe
of altermagnetism. Npj Quantum Materials. Springer Nature. https://doi.org/10.1038/s41535-026-00901-8
chicago: Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe
of Altermagnetism.” Npj Quantum Materials. Springer Nature, 2026. https://doi.org/10.1038/s41535-026-00901-8.
ieee: V. Sunko and J. Orenstein, “Linear magneto-birefringence as a probe of altermagnetism,”
npj Quantum Materials. Springer Nature, 2026.
ista: Sunko V, Orenstein J. 2026. Linear magneto-birefringence as a probe of altermagnetism.
npj Quantum Materials.
mla: Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe
of Altermagnetism.” Npj Quantum Materials, Springer Nature, 2026, doi:10.1038/s41535-026-00901-8.
short: V. Sunko, J. Orenstein, Npj Quantum Materials (2026).
corr_author: '1'
date_created: 2026-03-11T10:40:08Z
date_published: 2026-05-30T00:00:00Z
date_updated: 2026-06-24T10:31:05Z
day: '30'
ddc:
- '530'
department:
- _id: VeSu
doi: 10.1038/s41535-026-00901-8
external_id:
arxiv:
- '2511.16421'
has_accepted_license: '1'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.1038/s41535-026-00901-8
month: '05'
oa: 1
oa_version: Published Version
publication: npj Quantum Materials
publication_identifier:
eissn:
- 2397-4648
publication_status: epub_ahead
publisher: Springer Nature
status: public
title: Linear magneto-birefringence as a probe of altermagnetism
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
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22146'
abstract:
- lang: eng
text: We study differentially private model training with stochastic gradient descent
under learning rate scheduling and correlated noise. Although correlated noise,
in particular via matrix factorizations, has been shown to improve accuracy, prior
theoretical work focused primarily on the prefix-sum workload. That workload assumes
a constant learning rate, whereas in practice learning rate schedules are widely
used to accelerate training and improve convergence. We close this gap by deriving
general upper and lower bounds for a broad class of learning rate schedules in
both single- and multi-epoch settings. Building on these results, we propose a
learning-rate-aware factorization that achieves improvements over prefix-sum factorizations
under both MaxSE and MeanSE error metrics. Our theoretical analysis yields memory-efficient
constructions suitable for practical deployment, and experiments on CIFAR-10 and
IMDB datasets confirm that schedule-aware factorizations improve accuracy in private
training.
acknowledgement: "We thank Rasmus Pagh, Christoph Lampert and Jalaj Upadhyay for valuable\r\ncomments
on an early draft. We thank Ryan Mckenna for a fruitful discussion on the experiment\r\ndesign.
We thank Antti Honkela for sharing insights on learning rate scheduling and DP.\r\nNikita
P. Kalinin: Funded in part by the Austrian Science Fund (FWF) [10.55776/COE12].\r\nJoel
Daniel Andersson: Funded by the European Union. Views and opinions expressed are
however\r\nthose of the author(s) only and do not necessarily reflect those of the
European Union or the European\r\nResearch Council Executive Agency. Neither the
European Union nor the granting authority can be\r\nheld responsible for them. This
project has received funding from the European Research Council\r\n(ERC) under the
European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo.
101019564). Additional funding by Providentia, a Data Science Distinguished Investigator
grant\r\nfrom Novo Nordisk Fonden, with additional support from VILLUM Investigator
grant 54451.\r\n"
alternative_title:
- LIPIcs
article_number: 2:1-2:21
article_processing_charge: No
arxiv: 1
author:
- first_name: Nikita
full_name: Kalinin, Nikita
id: 4b14526e-14d2-11ed-ba64-c14c9553d137
last_name: Kalinin
- first_name: Joel D
full_name: Andersson, Joel D
id: 4a893819-d954-11f0-89b1-e360bad9ccc5
last_name: Andersson
citation:
ama: 'Kalinin N, Andersson JD. Learning rate scheduling with matrix factorization
for private training. In: 7th Symposium on Foundations of Responsible Computing.
Vol 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2026. doi:10.4230/LIPIcs.FORC.2026.2'
apa: 'Kalinin, N., & Andersson, J. D. (2026). Learning rate scheduling with
matrix factorization for private training. In 7th Symposium on Foundations
of Responsible Computing (Vol. 368). Cambridge, MA; United States: Schloss
Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.FORC.2026.2'
chicago: Kalinin, Nikita, and Joel D Andersson. “Learning Rate Scheduling with Matrix
Factorization for Private Training.” In 7th Symposium on Foundations of Responsible
Computing, Vol. 368. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
https://doi.org/10.4230/LIPIcs.FORC.2026.2.
ieee: N. Kalinin and J. D. Andersson, “Learning rate scheduling with matrix factorization
for private training,” in 7th Symposium on Foundations of Responsible Computing,
Cambridge, MA; United States, 2026, vol. 368.
ista: 'Kalinin N, Andersson JD. 2026. Learning rate scheduling with matrix factorization
for private training. 7th Symposium on Foundations of Responsible Computing. FORC:
Symposium on Foundations of Responsible Computing, LIPIcs, vol. 368, 2:1-2:21.'
mla: Kalinin, Nikita, and Joel D. Andersson. “Learning Rate Scheduling with Matrix
Factorization for Private Training.” 7th Symposium on Foundations of Responsible
Computing, vol. 368, 2:1-2:21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2026, doi:10.4230/LIPIcs.FORC.2026.2.
short: N. Kalinin, J.D. Andersson, in:, 7th Symposium on Foundations of Responsible
Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2026.
conference:
end_date: 2026-06-05
location: Cambridge, MA; United States
name: 'FORC: Symposium on Foundations of Responsible Computing'
start_date: 2026-06-03
corr_author: '1'
das_tickbox: '0'
date_created: 2026-06-28T22:01:34Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-06-29T06:56:34Z
day: '01'
ddc:
- '000'
department:
- _id: ChLa
- _id: GradSch
- _id: MoHe
doi: 10.4230/LIPIcs.FORC.2026.2
ec_funded: 1
external_id:
arxiv:
- '2511.17994'
file:
- access_level: open_access
checksum: c661f016d3861a1c1b590b87a744d087
content_type: application/pdf
creator: dernst
date_created: 2026-06-29T06:55:23Z
date_updated: 2026-06-29T06:55:23Z
file_id: '22149'
file_name: 2026_LIPIcsFORC_Kalinin.pdf
file_size: 1231914
relation: main_file
success: 1
file_date_updated: 2026-06-29T06:55:23Z
has_accepted_license: '1'
intvolume: ' 368'
keyword:
- differential privacy
- machine learning
- matrix factorization
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
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: 7th Symposium on Foundations of Responsible Computing
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959774192'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Learning rate scheduling with matrix factorization for private training
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 368
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22145'
abstract:
- lang: eng
text: An in-operando electro-intercalation method for the on-chip synthesis of alkali-metal-intercalated
materials and their Raman spectroscopic and transport characterization in ultrahigh
vacuum (UHV) is developed. We apply this method to synthesize fulleride superconductors
via Rb+ intercalation into a C60 film. During the intercalation, we monitor the
stoichiometry via UHV-Raman spectroscopy and probe superconductivity via transport
measurements. An increase of the superconducting transition temperature from 7.0
K to 14.5 K is observed when the stoichiometry is tuned from Rb2.7C60 to Rb3C60.
In our experiment, an ionic Rb+ flux into the host material is induced by an applied
electronic current via a Butler–Volmer-type mechanism. Electro-intercalation captivates
through improved stoichiometric precision, the ability to smoothly vary stoichiometry
via duration of current application, and the absence of a lower limit of the volume
of the host material. It represents a powerful concept for the on-chip synthesis
of intercalated materials, battery research, and beyond.
acknowledgement: 'A.G. and K.P.S. acknowledge the DFG through CRC 1238 (277146847,
A01) and DFG project SE 2575. K.P.S., P.S., and A.G. would like to thank the Center
for Micro- and Nanostructures (ZMNS) for providing the cleanroom facilities. K.P.S.
thanks Daniele Nazari for help with ALD of Al2O3 films. Financial support from FFG
Austria (CrystalGate) is acknowledged. A.G. thanks John Weaver for discussions about
the structure of RbxC60. B.C. acknowledges support from the NOMIS Foundation. First-principles
simulations were supported as part of user project CNMS2025-R-03182 at the Center
for Nanophase Materials Sciences (CNMS), which is a US Department of Energy, Office
of Science User Facility at Oak Ridge National Laboratory. J.J. and J.H. acknowledge
the computational resources provided by the ACCESS (Advanced Cyberinfrastructure
Coordination Ecosystem: Services & Support) program through allocation TG-DMR110037;
the National Energy Research Scientific Computing Center (NERSC), a DOE Office of
Science User Facility supported under Contract No. DE-AC02-05CH11231, through NERSC
award BES-ERCAP0031261; and the Compute and Data Environment for Science (CADES)
Baseline at Oak Ridge National Laboratory, supported by the Office of Science of
the U.S. Department of Energy under Contract No. DE-AC05-00OR22725. The authors
acknowledge TU Wien Bibliothek for financial support through its Open access funding
provided by Technische Universitat Wien.'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Konstantin P.
full_name: Shchukin, Konstantin P.
last_name: Shchukin
- first_name: Oliver N.
full_name: Gallego Lacey, Oliver N.
last_name: Gallego Lacey
- first_name: Baptiste
full_name: Coquinot, Baptiste
id: f8417bd4-f599-11ee-a482-b927e3ed1e8e
last_name: Coquinot
orcid: 0000-0001-5524-596X
- first_name: Jacek
full_name: Jakowski, Jacek
last_name: Jakowski
- first_name: Jingsong
full_name: Huang, Jingsong
last_name: Huang
- first_name: Patrik
full_name: Staudenmayer, Patrik
last_name: Staudenmayer
- first_name: Yannic
full_name: Falke, Yannic
last_name: Falke
- first_name: Ram Prakash
full_name: Pandeya, Ram Prakash
last_name: Pandeya
- first_name: Alexander
full_name: Grüneis, Alexander
last_name: Grüneis
citation:
ama: Shchukin KP, Gallego Lacey ON, Coquinot B, et al. On-chip tuning of superconductivity
in fullerides via current-driven Rb+ intercalation. ACS Nano. 2026;20(24):17360-17372.
doi:10.1021/acsnano.6c02466
apa: Shchukin, K. P., Gallego Lacey, O. N., Coquinot, B., Jakowski, J., Huang, J.,
Staudenmayer, P., … Grüneis, A. (2026). On-chip tuning of superconductivity in
fullerides via current-driven Rb+ intercalation. ACS Nano. American Chemical
Society. https://doi.org/10.1021/acsnano.6c02466
chicago: Shchukin, Konstantin P., Oliver N. Gallego Lacey, Baptiste Coquinot, Jacek
Jakowski, Jingsong Huang, Patrik Staudenmayer, Yannic Falke, Ram Prakash Pandeya,
and Alexander Grüneis. “On-Chip Tuning of Superconductivity in Fullerides via
Current-Driven Rb+ Intercalation.” ACS Nano. American Chemical Society,
2026. https://doi.org/10.1021/acsnano.6c02466.
ieee: K. P. Shchukin et al., “On-chip tuning of superconductivity in fullerides
via current-driven Rb+ intercalation,” ACS Nano, vol. 20, no. 24. American
Chemical Society, pp. 17360–17372, 2026.
ista: Shchukin KP, Gallego Lacey ON, Coquinot B, Jakowski J, Huang J, Staudenmayer
P, Falke Y, Pandeya RP, Grüneis A. 2026. On-chip tuning of superconductivity in
fullerides via current-driven Rb+ intercalation. ACS Nano. 20(24), 17360–17372.
mla: Shchukin, Konstantin P., et al. “On-Chip Tuning of Superconductivity in Fullerides
via Current-Driven Rb+ Intercalation.” ACS Nano, vol. 20, no. 24, American
Chemical Society, 2026, pp. 17360–72, doi:10.1021/acsnano.6c02466.
short: K.P. Shchukin, O.N. Gallego Lacey, B. Coquinot, J. Jakowski, J. Huang, P.
Staudenmayer, Y. Falke, R.P. Pandeya, A. Grüneis, ACS Nano 20 (2026) 17360–17372.
das_tickbox: '0'
date_created: 2026-06-28T22:01:34Z
date_published: 2026-06-23T00:00:00Z
date_updated: 2026-06-29T09:00:33Z
day: '23'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1021/acsnano.6c02466
external_id:
pmid:
- '42260723'
file:
- access_level: open_access
checksum: 01ec8ee6fab7bf563df7af13f6b43045
content_type: application/pdf
creator: dernst
date_created: 2026-06-29T08:58:12Z
date_updated: 2026-06-29T08:58:12Z
file_id: '22150'
file_name: 2026_ACSNano_Shchukin.pdf
file_size: 6290296
relation: main_file
success: 1
file_date_updated: 2026-06-29T08:58:12Z
has_accepted_license: '1'
intvolume: ' 20'
issue: '24'
keyword:
- fulleride
- intercalation
- alkali metal
- superconductivity
- Raman
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 17360-17372
pmid: 1
publication: ACS Nano
publication_identifier:
eissn:
- 1936-086X
issn:
- 1936-0851
publication_status: published
publisher: American Chemical Society
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: yes
title: On-chip tuning of superconductivity in fullerides via current-driven Rb+ intercalation
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: 20
year: '2026'
...
---
OA_type: closed access
_id: '22141'
abstract:
- lang: eng
text: Molecular electrocatalysis is commonly interpreted through electronic descriptors,
implicitly treating catalysts as mechanically passive during redox cycling. Yet,
electron transfer often imposes structural demands on molecular scaffolds, raising
the question of whether internal mechanical constraints can directly regulate
access to reactive states and, in turn, catalytic outcomes. Addressing this question
has remained challenging because mechanical effects are typically inseparable
from changes in composition or electronic structure. Here, we achieve this separation
by exploiting two constitutionally identical molecular catalysts whose only distinction
is ligand geometry. This minimal geometric variation enables or suppresses intramolecular
hydrogen bonding, thereby encoding distinct mechanical constraints that isolate
molecular mechanics as a variable in redox accessibility. In the α isomer, molecular
constraints impose a mechanically enforced barrier that severely limits access
to the reactive redox state. This disrupts the temporal ordering of elementary
steps, and diverts reactivity toward competing hydrogen evolution, eroding both
selectivity and stability. In contrast, mechanical compliance in the β isomer
enables facile access to the redox-active state, allowing CO2 activation to intrinsically
outpace water activation and yielding CO selectivities exceeding 92%. Operando
spectroscopy and real-time mass spectrometry, combined with computational simulation,
directly resolve this mechanically gated reaction sequence as it unfolds. Molecular
mechanics thus emerge as determinants that link electron flow to reaction sequencing
and catalytic selectivity, revealing that constitutionally similar catalysts can
be mechanically, and therefore catalytically, distinct.
article_number: jacs.6c02632
article_processing_charge: No
article_type: original
author:
- first_name: Rahul Mahadeo
full_name: Mendhe, Rahul Mahadeo
last_name: Mendhe
- first_name: Neethu
full_name: Christudas Dargily, Neethu
id: 19edef5c-384c-11ef-8188-c73c9c31d601
last_name: Christudas Dargily
- first_name: Alagar Raja
full_name: Kottaichamy, Alagar Raja
last_name: Kottaichamy
- first_name: Shifali
full_name: Dutt, Shifali
last_name: Dutt
- first_name: Mukaddar
full_name: Sk, Mukaddar
last_name: Sk
- first_name: Harish
full_name: Makri Nimbegondi Kotresh, Harish
last_name: Makri Nimbegondi Kotresh
- first_name: Musthafa
full_name: Ottakam Thotiyl, Musthafa
last_name: Ottakam Thotiyl
citation:
ama: Mendhe RM, Christudas Dargily N, Kottaichamy AR, et al. Mechanical gating of
redox access in molecular electrocatalysis. Journal of the American Chemical
Society. 2026. doi:10.1021/jacs.6c02632
apa: Mendhe, R. M., Christudas Dargily, N., Kottaichamy, A. R., Dutt, S., Sk, M.,
Makri Nimbegondi Kotresh, H., & Ottakam Thotiyl, M. (2026). Mechanical gating
of redox access in molecular electrocatalysis. Journal of the American Chemical
Society. American Chemical Society. https://doi.org/10.1021/jacs.6c02632
chicago: Mendhe, Rahul Mahadeo, Neethu Christudas Dargily, Alagar Raja Kottaichamy,
Shifali Dutt, Mukaddar Sk, Harish Makri Nimbegondi Kotresh, and Musthafa Ottakam
Thotiyl. “Mechanical Gating of Redox Access in Molecular Electrocatalysis.” Journal
of the American Chemical Society. American Chemical Society, 2026. https://doi.org/10.1021/jacs.6c02632.
ieee: R. M. Mendhe et al., “Mechanical gating of redox access in molecular
electrocatalysis,” Journal of the American Chemical Society. American Chemical
Society, 2026.
ista: Mendhe RM, Christudas Dargily N, Kottaichamy AR, Dutt S, Sk M, Makri Nimbegondi
Kotresh H, Ottakam Thotiyl M. 2026. Mechanical gating of redox access in molecular
electrocatalysis. Journal of the American Chemical Society., jacs. 6c02632.
mla: Mendhe, Rahul Mahadeo, et al. “Mechanical Gating of Redox Access in Molecular
Electrocatalysis.” Journal of the American Chemical Society, jacs. 6c02632,
American Chemical Society, 2026, doi:10.1021/jacs.6c02632.
short: R.M. Mendhe, N. Christudas Dargily, A.R. Kottaichamy, S. Dutt, M. Sk, H.
Makri Nimbegondi Kotresh, M. Ottakam Thotiyl, Journal of the American Chemical
Society (2026).
date_created: 2026-06-24T18:29:56Z
date_published: 2026-06-19T00:00:00Z
date_updated: 2026-06-29T06:39:21Z
day: '19'
doi: 10.1021/jacs.6c02632
extern: '1'
external_id:
pmid:
- '42319128'
language:
- iso: eng
month: '06'
oa_version: None
pmid: 1
publication: Journal of the American Chemical Society
publication_identifier:
eissn:
- 1520-5126
issn:
- 0002-7863
publication_status: epub_ahead
publisher: American Chemical Society
quality_controlled: '1'
status: public
title: Mechanical gating of redox access in molecular electrocatalysis
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_type: closed access
_id: '22144'
abstract:
- lang: eng
text: Most cells polarize and migrate in response to electrical fields. In this
issue of Cell, Belliveau et al. identify TMEM154/Galvanin, a receptor that serves
as a cellular antenna to sense electrical gradients and guide migration toward
the cathode.
article_processing_charge: No
article_type: comment
author:
- first_name: Michael
full_name: Riedl, Michael
id: 3BE60946-F248-11E8-B48F-1D18A9856A87
last_name: Riedl
orcid: 0000-0003-4844-6311
- first_name: Michael K
full_name: Sixt, Michael K
id: 41E9FBEA-F248-11E8-B48F-1D18A9856A87
last_name: Sixt
orcid: 0000-0002-6620-9179
citation:
ama: Riedl M, Sixt MK. A new sense for electrical fields. Cell. 2026;189(13):3845-3846.
doi:10.1016/j.cell.2026.05.038
apa: Riedl, M., & Sixt, M. K. (2026). A new sense for electrical fields. Cell.
Elsevier. https://doi.org/10.1016/j.cell.2026.05.038
chicago: Riedl, Michael, and Michael K Sixt. “A New Sense for Electrical Fields.”
Cell. Elsevier, 2026. https://doi.org/10.1016/j.cell.2026.05.038.
ieee: M. Riedl and M. K. Sixt, “A new sense for electrical fields,” Cell,
vol. 189, no. 13. Elsevier, pp. 3845–3846, 2026.
ista: Riedl M, Sixt MK. 2026. A new sense for electrical fields. Cell. 189(13),
3845–3846.
mla: Riedl, Michael, and Michael K. Sixt. “A New Sense for Electrical Fields.” Cell,
vol. 189, no. 13, Elsevier, 2026, pp. 3845–46, doi:10.1016/j.cell.2026.05.038.
short: M. Riedl, M.K. Sixt, Cell 189 (2026) 3845–3846.
corr_author: '1'
das_tickbox: '0'
date_created: 2026-06-28T22:01:34Z
date_published: 2026-06-25T00:00:00Z
date_updated: 2026-06-29T09:04:49Z
day: '25'
department:
- _id: MiSi
doi: 10.1016/j.cell.2026.05.038
intvolume: ' 189'
issue: '13'
language:
- iso: eng
month: '06'
oa_version: None
page: 3845-3846
publication: Cell
publication_identifier:
eissn:
- 1097-4172
issn:
- 0092-8674
publication_status: published
publisher: Elsevier
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: A new sense for electrical fields
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 189
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22147'
abstract:
- lang: eng
text: "Let 1 ≤ k ≤ n and M be a random n × n matrix with independent uniformly random
{±1}-entries. We\r\nshow that there exists an absolute constant c > 0 such that\r\nP[rank(M)
≤ n − k] ≤ exp(−cnk).\r\nThis confirms a well-known prediction in the area, extending
a result of Rudelson (who previously\r\nproved this same result under the restriction
k ≤ √n, via different methods)."
acknowledgement: "Z.H. was supported by SNSF grant 200021-228014. M.K. was supported
by ERC Starting Grant “RANDSTRUCT” No. 101076777. L.S. was supported by the Deutsche
Forschungsgemeinschaft (DFG, German\r\nResearch Foundation)—CRC 1720–539309657.
This research was conducted during the period M.S. served\r\nas a Clay Research
Fellow. This work began when the authors were visiting Mathematisches Forschungsinstitut
Oberwolfach, which\r\nprovided ideal working conditions. M.S. thanks Vishesh Jain
for initial discussions regarding the problem.\r\nWe also thank the anonymous referee
for helpful comments."
article_number: rnag126
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Zach
full_name: Hunter, Zach
last_name: Hunter
- first_name: Matthew Alan
full_name: Kwan, Matthew Alan
id: 5fca0887-a1db-11eb-95d1-ca9d5e0453b3
last_name: Kwan
orcid: 0000-0002-4003-7567
- first_name: Lisa
full_name: Sauermann, Lisa
last_name: Sauermann
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Hunter Z, Kwan MA, Sauermann L, Sawhney M. On random matrices with large corank.
International Mathematics Research Notices. 2026;2026(12). doi:10.1093/imrn/rnag126
apa: Hunter, Z., Kwan, M. A., Sauermann, L., & Sawhney, M. (2026). On random
matrices with large corank. International Mathematics Research Notices.
Oxford University Press. https://doi.org/10.1093/imrn/rnag126
chicago: Hunter, Zach, Matthew Alan Kwan, Lisa Sauermann, and Mehtaab Sawhney. “On
Random Matrices with Large Corank.” International Mathematics Research Notices.
Oxford University Press, 2026. https://doi.org/10.1093/imrn/rnag126.
ieee: Z. Hunter, M. A. Kwan, L. Sauermann, and M. Sawhney, “On random matrices with
large corank,” International Mathematics Research Notices, vol. 2026, no.
12. Oxford University Press, 2026.
ista: Hunter Z, Kwan MA, Sauermann L, Sawhney M. 2026. On random matrices with large
corank. International Mathematics Research Notices. 2026(12), rnag126.
mla: Hunter, Zach, et al. “On Random Matrices with Large Corank.” International
Mathematics Research Notices, vol. 2026, no. 12, rnag126, Oxford University
Press, 2026, doi:10.1093/imrn/rnag126.
short: Z. Hunter, M.A. Kwan, L. Sauermann, M. Sawhney, International Mathematics
Research Notices 2026 (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-06-28T22:01:35Z
date_published: 2026-06-01T00:00:00Z
date_updated: 2026-06-29T09:19:14Z
day: '01'
ddc:
- '500'
department:
- _id: MaKw
doi: 10.1093/imrn/rnag126
external_id:
arxiv:
- '2510.12933'
file:
- access_level: open_access
checksum: 396b47d0532d7ea509f8cd30f11392a8
content_type: application/pdf
creator: dernst
date_created: 2026-06-29T09:15:15Z
date_updated: 2026-06-29T09:15:15Z
file_id: '22151'
file_name: 2026_IMRN_Hunter.pdf
file_size: 524993
relation: main_file
success: 1
file_date_updated: 2026-06-29T09:15:15Z
has_accepted_license: '1'
intvolume: ' 2026'
issue: '12'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: On random matrices with large corank
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: 2026
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22097'
abstract:
- lang: eng
text: We consider the cubic defocusing nonlinear Schrödinger equation in one dimension
with the nonlinearity concentrated at a single point. We prove global well-posedness
in the scaling-critical space L^2(R) and scattering for all such solutions. Moreover,
we demonstrate that the same phenomenology holds whenever nonlinear effects are
sufficiently concentrated in space.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Benjamin
full_name: Harrop-Griffiths, Benjamin
last_name: Harrop-Griffiths
- first_name: Rowan
full_name: Killip, Rowan
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Harrop-Griffiths B, Killip R, Vişan M. Scattering for the nonlinear Schrödinger
equation with concentrated nonlinearity. Proceedings of the American Mathematical
Society. 2026. doi:10.1090/proc/17760
apa: Harrop-Griffiths, B., Killip, R., & Vişan, M. (2026). Scattering for the
nonlinear Schrödinger equation with concentrated nonlinearity. Proceedings
of the American Mathematical Society. American Mathematical Society. https://doi.org/10.1090/proc/17760
chicago: Harrop-Griffiths, Benjamin, Rowan Killip, and Monica Vişan. “Scattering
for the Nonlinear Schrödinger Equation with Concentrated Nonlinearity.” Proceedings
of the American Mathematical Society. American Mathematical Society, 2026.
https://doi.org/10.1090/proc/17760.
ieee: B. Harrop-Griffiths, R. Killip, and M. Vişan, “Scattering for the nonlinear
Schrödinger equation with concentrated nonlinearity,” Proceedings of the American
Mathematical Society. American Mathematical Society, 2026.
ista: Harrop-Griffiths B, Killip R, Vişan M. 2026. Scattering for the nonlinear
Schrödinger equation with concentrated nonlinearity. Proceedings of the American
Mathematical Society.
mla: Harrop-Griffiths, Benjamin, et al. “Scattering for the Nonlinear Schrödinger
Equation with Concentrated Nonlinearity.” Proceedings of the American Mathematical
Society, American Mathematical Society, 2026, doi:10.1090/proc/17760.
short: B. Harrop-Griffiths, R. Killip, M. Vişan, Proceedings of the American Mathematical
Society (2026).
das_tickbox: '1'
date_created: 2026-06-19T08:59:17Z
date_published: 2026-06-12T00:00:00Z
date_updated: 2026-06-30T11:13:33Z
day: '12'
doi: 10.1090/proc/17760
extern: '1'
external_id:
arxiv:
- '2507.14571'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2507.14571
month: '06'
oa: 1
oa_version: Preprint
publication: Proceedings of the American Mathematical Society
publication_identifier:
eissn:
- 1088-6826
issn:
- 0002-9939
publication_status: epub_ahead
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scattering for the nonlinear Schrödinger equation with concentrated nonlinearity
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22229'
abstract:
- lang: eng
text: Hippocampal CA3 pyramidal neurons (PNs) form the largest autoassociative network
in the mammalian brain. Whether CA3–CA3 recurrent connectivity is genetically
preconfigured or environmentally shaped during ongoing memory storage is currently
unknown. To address this question, we performed multicellular patch-clamp-based
circuit mapping of up to eight CA3 PNs in the mouse hippocampus at multiple postnatal
time points (P7–8, P18–25, and P45–50). Here, we show that the hippocampal CA3
network undergoes a developmental transformation from local, dense, and random
connectivity to a distributed, sparse, and structured configuration. Thus, sparse
and structured connectivity may emerge via experience-dependent mechanisms. In
parallel, the strength of single synapses is downregulated; single synaptic events
are sufficient to trigger postsynaptic spiking early in development, whereas spatial
summation of several inputs is required at later time points. Biologically inspired
models of memory storage by Hebbian synaptic plasticity and retrieval via pattern
completion suggest that developmental changes improve specific aspects of memory
storage and retrieval. Our results imply a developmental transformation of the
neuronal code and the memory functions in the hippocampal CA3 network.
acknowledged_ssus:
- _id: PreCl
- _id: Bio
- _id: M-Shop
- _id: ScienComp
acknowledgement: 'We thank Jose Guzman, Simon Hippenmeyer, and Tim Vogels for critically
reading the manuscript, Jozsef Csicsvari for useful discussions, Florian Marr for
technical assistance, and Eleftheria Kralli-Beller for manuscript editing. This
research was supported by the Scientific Services Units (SSUs) of ISTA: the preclinical
facility (PCF) provided housing and breeding of the animals, the imaging and optics
facility (IOF) offered technical training and state of the art equipment, the Miba
machine shop contributed to the construction and maintenance of multicellular recording
setups, and the scientific computing unit helped with the large-scale simulations.
The project received funding from the European Union’s Horizon 2020 research and
innovation programme (ERC Advanced Grants No 692692 GIANTSYN and 101199096 CA3-SYNGRAM
to P.J.; Marie Skłodowska-Curie Grant 754411 to V.V.B.; Marie Skłodowska-Curie Grant
101026635 to J.F.W.), the Fond zur Förderung der Wissenschaftlichen Forschung (P
36232-B, PAT4178023, and 10.55776/CoE16 to P.J.), and the Nomis Foundation (fellowship
to A.N.-O.). V.V.B. received funding from a CONACyT fellowship (289638).'
article_number: '5540'
article_processing_charge: Yes
article_type: original
author:
- first_name: Victor M
full_name: Vargas Barroso, Victor M
id: 2F55A9DE-F248-11E8-B48F-1D18A9856A87
last_name: Vargas Barroso
- first_name: Jake
full_name: Watson, Jake
id: 63836096-4690-11EA-BD4E-32803DDC885E
last_name: Watson
orcid: 0000-0002-8698-3823
- first_name: Andrea C
full_name: Navas Olivé, Andrea C
id: 739d26c9-52e8-11ee-8d72-f14d3893b4ce
last_name: Navas Olivé
orcid: 0000-0002-9280-8597
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
- 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: Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. Developmental
emergence of sparse and structured synaptic connectivity in the hippocampal CA3
memory circuit. Nature Communications. 2026;17. doi:10.1038/s41467-026-71914-x
apa: Vargas Barroso, V. M., Watson, J., Navas Olivé, A. C., Schlögl, A., & Jonas,
P. M. (2026). Developmental emergence of sparse and structured synaptic connectivity
in the hippocampal CA3 memory circuit. Nature Communications. Springer
Nature. https://doi.org/10.1038/s41467-026-71914-x
chicago: Vargas Barroso, Victor M, Jake Watson, Andrea C Navas Olivé, Alois Schlögl,
and Peter M Jonas. “Developmental Emergence of Sparse and Structured Synaptic
Connectivity in the Hippocampal CA3 Memory Circuit.” Nature Communications.
Springer Nature, 2026. https://doi.org/10.1038/s41467-026-71914-x.
ieee: V. M. Vargas Barroso, J. Watson, A. C. Navas Olivé, A. Schlögl, and P. M.
Jonas, “Developmental emergence of sparse and structured synaptic connectivity
in the hippocampal CA3 memory circuit,” Nature Communications, vol. 17.
Springer Nature, 2026.
ista: Vargas Barroso VM, Watson J, Navas Olivé AC, Schlögl A, Jonas PM. 2026. Developmental
emergence of sparse and structured synaptic connectivity in the hippocampal CA3
memory circuit. Nature Communications. 17, 5540.
mla: Vargas Barroso, Victor M., et al. “Developmental Emergence of Sparse and Structured
Synaptic Connectivity in the Hippocampal CA3 Memory Circuit.” Nature Communications,
vol. 17, 5540, Springer Nature, 2026, doi:10.1038/s41467-026-71914-x.
short: V.M. Vargas Barroso, J. Watson, A.C. Navas Olivé, A. Schlögl, P.M. Jonas,
Nature Communications 17 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: Source data are provided with this paper. Additional original
data are available from the corresponding author upon request. Code is available
from https://doi.org/10.15479/AT-ISTA-21442 under the link https://research-explorer.ista.ac.at/download/21442/21443/ca3simu-vargas2026v1.tar.gz
date_created: 2026-06-30T13:05:52Z
date_published: 2026-06-23T00:00:00Z
date_updated: 2026-07-01T06:47:49Z
day: '23'
ddc:
- '570'
department:
- _id: PeJo
- _id: ScienComp
doi: 10.1038/s41467-026-71914-x
ec_funded: 1
external_id:
pmid:
- '42014695'
file:
- access_level: open_access
checksum: d0b0093493926985b4c268662ff4d556
content_type: application/pdf
creator: dernst
date_created: 2026-07-01T06:46:06Z
date_updated: 2026-07-01T06:46:06Z
file_id: '22231'
file_name: 2026_NatureComm_VargasBarroso.pdf
file_size: 18304997
relation: main_file
success: 1
file_date_updated: 2026-07-01T06:46:06Z
has_accepted_license: '1'
intvolume: ' 17'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
- _id: e62b56fe-ab3c-11f0-94c7-d181dd352b3b
grant_number: '101199096'
name: Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc2be41b-9c52-11eb-aca3-faa90aa144e9
call_identifier: H2020
grant_number: '101026635'
name: Synaptic computations of the hippocampal CA3 circuitry
- _id: bd88be38-d553-11ed-ba76-81d5a70a6ef5
grant_number: P36232
name: Mechanisms of GABA release in hippocampal circuits
- _id: 8d9195e9-16d5-11f0-9cad-d075be887a1e
grant_number: PAT 4178023
name: Synaptic networks of human brain
- _id: 26366136-B435-11E9-9278-68D0E5697425
name: Reglas de Conectividad funcional en el hipocampo
publication: Nature Communications
publication_identifier:
eissn:
- 2041-1723
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '21442'
relation: research_data
status: public
researchdata_availability: yes
scopus_import: '1'
status: public
supplementarymaterial: yes
title: Developmental emergence of sparse and structured synaptic connectivity in the
hippocampal CA3 memory circuit
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: 17
year: '2026'
...
---
_id: '21442'
author:
- first_name: Alois
full_name: Schlögl, Alois
id: 45BF87EE-F248-11E8-B48F-1D18A9856A87
last_name: Schlögl
orcid: 0000-0002-5621-8100
citation:
ama: Schlögl A. CA3Simu v1.06 (vargas2026v1). 2026. doi:10.15479/AT-ISTA-21442
apa: Schlögl, A. (2026). CA3Simu v1.06 (vargas2026v1). Institute of Science and
Technology Austria. https://doi.org/10.15479/AT-ISTA-21442
chicago: Schlögl, Alois. “CA3Simu v1.06 (Vargas2026v1).” Institute of Science and
Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21442.
ieee: A. Schlögl, “CA3Simu v1.06 (vargas2026v1).” Institute of Science and Technology
Austria, 2026.
ista: Schlögl A. 2026. CA3Simu v1.06 (vargas2026v1), Institute of Science and Technology
Austria, 10.15479/AT-ISTA-21442.
mla: Schlögl, Alois. CA3Simu v1.06 (Vargas2026v1). Institute of Science and
Technology Austria, 2026, doi:10.15479/AT-ISTA-21442.
short: A. Schlögl, (2026).
corr_author: '1'
date_created: 2026-03-12T08:20:46Z
date_published: 2026-03-12T00:00:00Z
date_updated: 2026-07-01T06:47:49Z
day: '12'
department:
- _id: ScienComp
- _id: PeJo
doi: 10.15479/AT-ISTA-21442
ec_funded: 1
file:
- access_level: open_access
checksum: 441c8827717dcda05f91c127d15cf1e9
content_type: application/gzip
creator: schloegl
date_created: 2026-03-12T08:19:14Z
date_updated: 2026-03-12T08:19:14Z
file_id: '21443'
file_name: ca3simu-vargas2026v1.tar.gz
file_size: 160410
relation: main_file
success: 1
- access_level: open_access
checksum: 3c0092076228a15c0a7ae703192d43ea
content_type: text/markdown
creator: schloegl
date_created: 2026-03-12T10:24:45Z
date_updated: 2026-03-12T10:24:45Z
file_id: '21445'
file_name: README.md
file_size: 10923
relation: main_file
success: 1
file_date_updated: 2026-03-12T10:24:45Z
has_accepted_license: '1'
keyword:
- hypocampus
- ca3 simulations
- modelling
license: https://opensource.org/licenses/GPL-3.0
month: '03'
oa: 1
project:
- _id: e62b56fe-ab3c-11f0-94c7-d181dd352b3b
grant_number: '101199096'
name: Synaptic mechanisms of engram storage and retrieval in CA3 hippocampal microcircuits
- _id: bd88be38-d553-11ed-ba76-81d5a70a6ef5
grant_number: P36232
name: Mechanisms of GABA release in hippocampal circuits
- _id: 8d9195e9-16d5-11f0-9cad-d075be887a1e
grant_number: PAT 4178023
name: Synaptic networks of human brain
- _id: 25B7EB9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '692692'
name: Biophysics and circuit function of a giant cortical glutamatergic synapse
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '22229'
relation: used_in_publication
status: public
status: public
title: CA3Simu v1.06 (vargas2026v1)
tmp:
legal_code_url: https://www.gnu.org/licenses/gpl-3.0.en.html
name: GNU General Public License 3.0
short: GPL 3.0
type: software
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2026'
...
---
OA_place: repository
OA_type: green
_id: '22096'
abstract:
- lang: eng
text: "We prove uniform-in-time a priori Hs bounds for solutions to the intermediate
longwave equation\r\nposed both on the line and on the circle, covering the range
−1\r\n2 < s ≤ 0. Additionally, we prove that the\r\nset of orbits emanating from
a bounded and equicontinuous set in Hs is also bounded and equicontinuous\r\nin
Hs . Our proof is based on the identification of a suitable Lax pair formulation
for the intermediate long\r\nwave equation."
article_number: '81'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: B.
full_name: Harrop-Griffiths, B.
last_name: Harrop-Griffiths
- first_name: R.
full_name: Killip, R.
last_name: Killip
- first_name: Monica
full_name: Visan, Monica
id: 056daca0-b8d1-11f0-964f-f91054abf8ca
last_name: Visan
citation:
ama: Harrop-Griffiths B, Killip R, Vişan M. A priori bounds and equicontinuity of
orbits for the intermediate long wave equation. Journal of Evolution Equations.
2026;26(3). doi:10.1007/s00028-026-01228-4
apa: Harrop-Griffiths, B., Killip, R., & Vişan, M. (2026). A priori bounds and
equicontinuity of orbits for the intermediate long wave equation. Journal of
Evolution Equations. Springer Nature. https://doi.org/10.1007/s00028-026-01228-4
chicago: Harrop-Griffiths, B., R. Killip, and Monica Vişan. “A Priori Bounds and
Equicontinuity of Orbits for the Intermediate Long Wave Equation.” Journal
of Evolution Equations. Springer Nature, 2026. https://doi.org/10.1007/s00028-026-01228-4.
ieee: B. Harrop-Griffiths, R. Killip, and M. Vişan, “A priori bounds and equicontinuity
of orbits for the intermediate long wave equation,” Journal of Evolution Equations,
vol. 26, no. 3. Springer Nature, 2026.
ista: Harrop-Griffiths B, Killip R, Vişan M. 2026. A priori bounds and equicontinuity
of orbits for the intermediate long wave equation. Journal of Evolution Equations.
26(3), 81.
mla: Harrop-Griffiths, B., et al. “A Priori Bounds and Equicontinuity of Orbits
for the Intermediate Long Wave Equation.” Journal of Evolution Equations,
vol. 26, no. 3, 81, Springer Nature, 2026, doi:10.1007/s00028-026-01228-4.
short: B. Harrop-Griffiths, R. Killip, M. Vişan, Journal of Evolution Equations
26 (2026).
das_tickbox: '1'
date_created: 2026-06-19T08:58:33Z
date_published: 2026-06-08T00:00:00Z
date_updated: 2026-07-02T06:02:36Z
day: '08'
doi: 10.1007/s00028-026-01228-4
extern: '1'
external_id:
arxiv:
- '2506.23868'
intvolume: ' 26'
issue: '3'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2506.23868
month: '06'
oa: 1
oa_version: Preprint
publication: Journal of Evolution Equations
publication_identifier:
eissn:
- 1424-3202
issn:
- 1424-3199
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A priori bounds and equicontinuity of orbits for the intermediate long wave
equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 26
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22119'
article_number: EGU26-19367
article_processing_charge: No
author:
- first_name: José M
full_name: Muñoz Hermosilla, José M
id: e1037a6d-646e-11ef-b402-e0ed9ab0901e
last_name: Muñoz Hermosilla
orcid: 0000-0002-1990-8508
- first_name: Evan
full_name: Miles, Evan
last_name: Miles
- first_name: Michael
full_name: McCarthy, Michael
id: 22a2674a-61ce-11ee-94b5-d18813baf16f
last_name: McCarthy
- first_name: Juan Vicente
full_name: Melo Velasco, Juan Vicente
id: 2611dec0-b9c6-11ed-9bea-a81c2b17a549
last_name: Melo Velasco
- first_name: Florian
full_name: Hardmeier, Florian
last_name: Hardmeier
- first_name: PRATEEK
full_name: GANTAYAT, PRATEEK
id: 02734268-3e8d-11ef-80a1-cec4a088d004
last_name: GANTAYAT
- first_name: Adrià
full_name: Fontrodona-Bach, Adrià
id: f06891fd-9f42-11ee-8632-a20971c43046
last_name: Fontrodona-Bach
- first_name: Guillaume
full_name: Jouvet, Guillaume
last_name: Jouvet
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Muñoz Hermosilla JM, Miles E, McCarthy M, et al. Constraining debris input
to Oberaletsch Glacier using ensemble-based Lagrangian modelling. In: EGU General
Assembly 2026. European Geosciences Union; 2026. doi:10.5194/egusphere-egu26-19367'
apa: 'Muñoz Hermosilla, J. M., Miles, E., McCarthy, M., Melo Velasco, J. V., Hardmeier,
F., GANTAYAT, P., … Pellicciotti, F. (2026). Constraining debris input to Oberaletsch
Glacier using ensemble-based Lagrangian modelling. In EGU General Assembly
2026. Vienna, Austria & Virtual: European Geosciences Union. https://doi.org/10.5194/egusphere-egu26-19367'
chicago: Muñoz Hermosilla, José M, Evan Miles, Michael McCarthy, Juan Vicente Melo
Velasco, Florian Hardmeier, PRATEEK GANTAYAT, Adrià Fontrodona-Bach, Guillaume
Jouvet, and Francesca Pellicciotti. “Constraining Debris Input to Oberaletsch
Glacier Using Ensemble-Based Lagrangian Modelling.” In EGU General Assembly
2026. European Geosciences Union, 2026. https://doi.org/10.5194/egusphere-egu26-19367.
ieee: J. M. Muñoz Hermosilla et al., “Constraining debris input to Oberaletsch
Glacier using ensemble-based Lagrangian modelling,” in EGU General Assembly
2026, Vienna, Austria & Virtual, 2026.
ista: Muñoz Hermosilla JM, Miles E, McCarthy M, Melo Velasco JV, Hardmeier F, GANTAYAT
P, Fontrodona-Bach A, Jouvet G, Pellicciotti F. 2026. Constraining debris input
to Oberaletsch Glacier using ensemble-based Lagrangian modelling. EGU General
Assembly 2026. EGU General Assembly, EGU26-19367.
mla: Muñoz Hermosilla, José M., et al. “Constraining Debris Input to Oberaletsch
Glacier Using Ensemble-Based Lagrangian Modelling.” EGU General Assembly 2026,
EGU26-19367, European Geosciences Union, 2026, doi:10.5194/egusphere-egu26-19367.
short: J.M. Muñoz Hermosilla, E. Miles, M. McCarthy, J.V. Melo Velasco, F. Hardmeier,
P. GANTAYAT, A. Fontrodona-Bach, G. Jouvet, F. Pellicciotti, in:, EGU General
Assembly 2026, European Geosciences Union, 2026.
conference:
end_date: 2026-05-08
location: Vienna, Austria & Virtual
name: EGU General Assembly
start_date: 2026-05-03
corr_author: '1'
date_created: 2026-06-22T12:16:50Z
date_published: 2026-07-02T00:00:00Z
date_updated: 2026-07-02T06:42:37Z
day: '02'
ddc:
- '550'
department:
- _id: FrPe
- _id: GradSch
doi: 10.5194/egusphere-egu26-19367
file:
- access_level: open_access
checksum: 2ea3e691cfa53176d0e801b9172842d6
content_type: application/pdf
creator: dernst
date_created: 2026-07-02T06:22:50Z
date_updated: 2026-07-02T06:22:50Z
file_id: '22233'
file_name: 2026_EGU26_MunozHermosilla.pdf
file_size: 284023
relation: main_file
success: 1
file_date_updated: 2026-07-02T06:22:50Z
has_accepted_license: '1'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
publication: EGU General Assembly 2026
publication_status: published
publisher: European Geosciences Union
status: public
title: Constraining debris input to Oberaletsch Glacier using ensemble-based Lagrangian
modelling
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference_abstract
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22245'
abstract:
- lang: eng
text: "A single-commodity congestion approximator for a graph is a compact data
structure that approximately predicts the edge congestion required to route any
set of single-commodity flow demands in a network. A hierarchical congestion approximator
(HCA) consists of a laminar family of cuts in the graph and has numerous applications
in approximating cut and flow problems in graphs, designing efficient routing
schemes, and managing distributed networks.\r\nThere is a tradeoff between the
running time for computing an HCA and its approximation quality. The best polynomial-time
construction in an n-node graph gives an HCA with approximation quality O(log1.5n
loglogn). Among near-linear time algorithms, the best previous result achieves
approximation quality O(log4 n). We improve upon the latter result by giving the
first near-linear time algorithm for computing an HCA with approximation quality
O(log2 n loglogn). Additionally, our algorithm can be implemented in the parallel
setting with polylogarithmic span and near-linear work, achieving the same approximation
quality. This improves upon the best previous such algorithm, which has an O(log9n)
approximation quality. We also present a lower bound of Ω(logn) for the approximation
guarantee of hierarchical congestion approximators.\r\nCrucial for achieving a
near-linear running time is a new partitioning routine that, unlike previous such
routines, manages to avoid recursing on large subgraphs. To achieve the improved
approximation quality, we introduce the new concept of border routability of a
cut and provide an improved sparsest cut oracle for general vertex weights."
acknowledgement: "We thank Evangelos Kosinas for helpful discussions on this topic.\r\nFunded
by the European Union. Views and opinions expressed\r\nare however those of the
author(s) only and do not necessarily\r\nreflect those of the European Union or
the European Research\r\nCouncil Executive Agency. Neither the European Union nor
the\r\ngranting authority can be held responsible for them.\r\nThis project has
received funding from the European Research\r\nCouncil (ERC) under the European
Union’s Horizon 2020 research\r\nand innovation programme (MoDynStruct, No. 101019564)\r\nand
the Austrian Science Fund (FWF) grant DOI 10.55776/I5982. For\r\nopen access purposes,
the author has applied a CC BY public copyright license to any author-accepted manuscript
version arising\r\nfrom this submission.\r\nThis project has received funding from
the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858."
article_processing_charge: No
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: Robin
full_name: Münk, Robin
last_name: Münk
- first_name: Harald
full_name: Räcke, Harald
last_name: Räcke
citation:
ama: 'Henzinger M, Münk R, Räcke H. An improved quality hierarchical congestion
approximator in near-linear time. In: 58th Annual ACM Symposium on Theory of
Computing. Association for Computing Machinery; 2026:1417-1428. doi:10.1145/3798129.3800851'
apa: 'Henzinger, M., Münk, R., & Räcke, H. (2026). An improved quality hierarchical
congestion approximator in near-linear time. In 58th Annual ACM Symposium on
Theory of Computing (pp. 1417–1428). Salt Lake City, UT, United States: Association
for Computing Machinery. https://doi.org/10.1145/3798129.3800851'
chicago: Henzinger, Monika, Robin Münk, and Harald Räcke. “An Improved Quality Hierarchical
Congestion Approximator in Near-Linear Time.” In 58th Annual ACM Symposium
on Theory of Computing, 1417–28. Association for Computing Machinery, 2026.
https://doi.org/10.1145/3798129.3800851.
ieee: M. Henzinger, R. Münk, and H. Räcke, “An improved quality hierarchical congestion
approximator in near-linear time,” in 58th Annual ACM Symposium on Theory of
Computing, Salt Lake City, UT, United States, 2026, pp. 1417–1428.
ista: 'Henzinger M, Münk R, Räcke H. 2026. An improved quality hierarchical congestion
approximator in near-linear time. 58th Annual ACM Symposium on Theory of Computing.
STOC: Symposium on the Theory of Computing, 1417–1428.'
mla: Henzinger, Monika, et al. “An Improved Quality Hierarchical Congestion Approximator
in Near-Linear Time.” 58th Annual ACM Symposium on Theory of Computing,
Association for Computing Machinery, 2026, pp. 1417–28, doi:10.1145/3798129.3800851.
short: M. Henzinger, R. Münk, H. Räcke, in:, 58th Annual ACM Symposium on Theory
of Computing, Association for Computing Machinery, 2026, pp. 1417–1428.
conference:
end_date: 2026-06-26
location: Salt Lake City, UT, United States
name: 'STOC: Symposium on the Theory of Computing'
start_date: 2026-06-22
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-05T22:01:36Z
date_published: 2026-06-09T00:00:00Z
date_updated: 2026-07-06T06:59:52Z
day: '09'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.1145/3798129.3800851
ec_funded: 1
external_id:
arxiv:
- '2511.03716'
file:
- access_level: open_access
checksum: 2bef46be8da6d19a641697bb0d8ade65
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T06:57:16Z
date_updated: 2026-07-06T06:57:16Z
file_id: '22250'
file_name: 2026_STOC_HenzingerMo.pdf
file_size: 919005
relation: main_file
success: 1
file_date_updated: 2026-07-06T06:57:16Z
has_accepted_license: '1'
keyword:
- Congestion Approximators
- Hierarchical Graph Decompositions
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 1417-1428
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
publication: 58th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9798400725364'
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: An improved quality hierarchical congestion approximator in near-linear time
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '22241'
abstract:
- lang: eng
text: We revisit the computation of 3D generalized winding numbers, a useful measure
for inside-outside classification on triangle meshes with gaps, self-intersections,
and open boundaries. At the core of our new method is an analytical reduction
of the surface integral that defines the winding number, resulting in a single
ray-mesh intersection test and an elementary sum over boundary edges per evaluation.
This construction is orders of magnitude more efficient than the state of the
art in practice, which we show in an extensive performance benchmark. Conveniently,
the method also reduces to the best-available asymptotic complexity in the worst
case, and it introduces no approximations apart from floating-point errors. Our
algorithm is conceptually simple to understand, straightforward to implement and
debug, and it works reliably even on extremely noisy and corrupt input geometry.
acknowledgement: "We thank Sadashige Ishida and Ryusuke Sugimoto for their insightful
discussions and proofreading and other members of the ISTA\r\nVisual Computing Group
for their general feedback. This project was\r\nfunded in part by the European Research
Council (ERC Consolidator\r\nGrant 101045083 CoDiNA)."
article_number: '41'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Peiyuan
full_name: Xie, Peiyuan
id: 488e236c-6bad-11f0-9831-859175c78e8a
last_name: Xie
- first_name: Christian
full_name: Hafner, Christian
id: 400429CC-F248-11E8-B48F-1D18A9856A87
last_name: Hafner
- first_name: Christopher J
full_name: Wojtan, Christopher J
id: 3C61F1D2-F248-11E8-B48F-1D18A9856A87
last_name: Wojtan
orcid: 0000-0001-6646-5546
citation:
ama: Xie P, Hafner C, Wojtan C. Fast and exact winding numbers for triangle meshes.
ACM Transactions on Graphics. 2026;45(4). doi:10.1145/3811339
apa: Xie, P., Hafner, C., & Wojtan, C. (2026). Fast and exact winding numbers
for triangle meshes. ACM Transactions on Graphics. Association for Computing
Machinery. https://doi.org/10.1145/3811339
chicago: Xie, Peiyuan, Christian Hafner, and Chris Wojtan. “Fast and Exact Winding
Numbers for Triangle Meshes.” ACM Transactions on Graphics. Association
for Computing Machinery, 2026. https://doi.org/10.1145/3811339.
ieee: P. Xie, C. Hafner, and C. Wojtan, “Fast and exact winding numbers for triangle
meshes,” ACM Transactions on Graphics, vol. 45, no. 4. Association for
Computing Machinery, 2026.
ista: Xie P, Hafner C, Wojtan C. 2026. Fast and exact winding numbers for triangle
meshes. ACM Transactions on Graphics. 45(4), 41.
mla: Xie, Peiyuan, et al. “Fast and Exact Winding Numbers for Triangle Meshes.”
ACM Transactions on Graphics, vol. 45, no. 4, 41, Association for Computing
Machinery, 2026, doi:10.1145/3811339.
short: P. Xie, C. Hafner, C. Wojtan, ACM Transactions on Graphics 45 (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-03T21:03:48Z
date_published: 2026-07-03T00:00:00Z
date_updated: 2026-07-06T06:14:18Z
day: '03'
ddc:
- '000'
department:
- _id: GradSch
- _id: ChWo
doi: 10.1145/3811339
file:
- access_level: open_access
checksum: 7e36e69f377b680a893e65b620b43813
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T06:13:12Z
date_updated: 2026-07-06T06:13:12Z
file_id: '22249'
file_name: 2026_TransactionsGraphics_Xie.pdf
file_size: 5212838
relation: main_file
success: 1
file_date_updated: 2026-07-06T06:13:12Z
has_accepted_license: '1'
intvolume: ' 45'
issue: '4'
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
project:
- _id: 34bc2376-11ca-11ed-8bc3-9a3b3961a088
grant_number: '101045083'
name: Computational Discovery of Numerical Algorithms for Animation and Simulation
of Natural Phenomena
publication: ACM Transactions on Graphics
publication_identifier:
eissn:
- 1557-7368
issn:
- 0730-0301
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Fast and exact winding numbers for triangle meshes
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: 45
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22248'
abstract:
- lang: eng
text: Many living and artificial systems improve their fitness or performance by
adapting to changing environments or diverse training data. However, it remains
unclear how environmental variation shapes adaptation, what is learned, and when
memory of past conditions is retained. Here we show how cyclic environmental change
can produce robust memory. Using a model athermal disordered solid trained by
inverse design to attain target elastic properties over a prescribed range, we
find that the system evolves toward a marginally absorbing manifold (MAM), meaning
that training is reversible within the training range but not beyond it, which
encodes a memory of that range. We further propose a general mechanism for MAM
formation and memory encoding based on discontinuities in the gradient of the
trained quantity. These results provide a simple, broadly applicable physical
framework for how adaptive systems learn under changing environments and retain
memory of past conditions.
acknowledgement: "We thank Nathan Keim, Aayush Desai, Nicholas Barton,\r\nand Gašper
Tkacik for important and stimulating discussions. ˇ\r\nThe work was funded by the
Institute of Science and Technology Austria."
article_number: '023029'
article_processing_charge: Yes
article_type: original
author:
- first_name: Mengjie
full_name: Zu, Mengjie
id: 26dd9e7c-e86a-11eb-a854-82ac731c9ae2
last_name: Zu
- first_name: Carl Peter
full_name: Goodrich, Carl Peter
id: EB352CD2-F68A-11E9-89C5-A432E6697425
last_name: Goodrich
orcid: 0000-0002-1307-5074
citation:
ama: 'Zu M, Goodrich CP. Learning by Training: Emergent physical memory from cyclically
tuning disordered sphere packings. PRX Life. 2026;4(2). doi:10.1103/48k2-cw3b'
apa: 'Zu, M., & Goodrich, C. P. (2026). Learning by Training: Emergent physical
memory from cyclically tuning disordered sphere packings. PRX Life. American
Physical Society. https://doi.org/10.1103/48k2-cw3b'
chicago: 'Zu, Mengjie, and Carl Peter Goodrich. “Learning by Training: Emergent
Physical Memory from Cyclically Tuning Disordered Sphere Packings.” PRX Life.
American Physical Society, 2026. https://doi.org/10.1103/48k2-cw3b.'
ieee: 'M. Zu and C. P. Goodrich, “Learning by Training: Emergent physical memory
from cyclically tuning disordered sphere packings,” PRX Life, vol. 4, no.
2. American Physical Society, 2026.'
ista: 'Zu M, Goodrich CP. 2026. Learning by Training: Emergent physical memory from
cyclically tuning disordered sphere packings. PRX Life. 4(2), 023029.'
mla: 'Zu, Mengjie, and Carl Peter Goodrich. “Learning by Training: Emergent Physical
Memory from Cyclically Tuning Disordered Sphere Packings.” PRX Life, vol.
4, no. 2, 023029, American Physical Society, 2026, doi:10.1103/48k2-cw3b.'
short: M. Zu, C.P. Goodrich, PRX Life 4 (2026).
corr_author: '1'
das_tickbox: '1'
dataavailabilitystatement: "The data that support the findings of this article are
not\r\npublicly available. The data are available from the authors\r\nupon reasonable
request."
date_created: 2026-07-05T22:01:37Z
date_published: 2026-06-18T00:00:00Z
date_updated: 2026-07-06T07:28:45Z
day: '18'
ddc:
- '570'
department:
- _id: CaGo
doi: 10.1103/48k2-cw3b
file:
- access_level: open_access
checksum: e2d13c30bf9c036951fd2ba3455cf72a
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T07:24:43Z
date_updated: 2026-07-06T07:24:43Z
file_id: '22251'
file_name: 2026_PRXLife_Zu.pdf
file_size: 2758728
relation: main_file
success: 1
file_date_updated: 2026-07-06T07:24:43Z
has_accepted_license: '1'
intvolume: ' 4'
issue: '2'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
publication: PRX Life
publication_identifier:
eissn:
- 2835-8279
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
researchdata_availability: upon request
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Learning by Training: Emergent physical memory from cyclically tuning disordered
sphere packings'
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: '22244'
abstract:
- lang: eng
text: The sensitivity of a mechanical transducer is ultimately limited by its inherent
quantum fluctuations. Here, we use an optically levitated nanoparticle to measure
impulsive forces smaller than the particle’s zero-point momentum uncertainty.
Our approach relies on reversibly squeezing the levitated particle’s center-of-mass
motion to coherently amplify the perturbation. We demonstrate an impulsive-force
resolution as small as 6.9 keV/c, a value 0.6 dB below the sensor’s zero-point
value.
acknowledgement: We thank Oscar Schmitt Kremer for his help with the Kalman filter
and the rest of our colleagues at the ETH Photonics Laboratory for fruitful discussions.
This research has been supported by the Swiss SERI Quantum Initiative (Grants No.
UeM019-2 and No. UeM029-3), the Swiss National Science Foundation (Grant No. 51NF40-160591),
and the European Research Council (ERC) under the Grant Agreement No. [951234] (Q-Xtreme
ERC-2020-SyG). M. C. S. acknowledges support through an SNSF Fellowship (Grant No.
224465).
article_number: '233604'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Martynas
full_name: Skrabulis, Martynas
last_name: Skrabulis
- first_name: Martin Colombano
full_name: Sosa, Martin Colombano
last_name: Sosa
- first_name: Nicola Carlon
full_name: Zambon, Nicola Carlon
last_name: Zambon
- first_name: Andrei
full_name: Militaru, Andrei
id: d67706f8-8eb1-11ee-ad1b-9c30dfa19e0b
last_name: Militaru
- first_name: Massimiliano
full_name: Rossi, Massimiliano
last_name: Rossi
- first_name: Martin
full_name: Frimmer, Martin
last_name: Frimmer
- first_name: Lukas
full_name: Novotny, Lukas
last_name: Novotny
citation:
ama: Skrabulis M, Sosa MC, Zambon NC, et al. Nanomechanical sensor resolving impulsive
forces below its zero-point fluctuations. Physical Review Letters. 2026;136(23).
doi:10.1103/9wzm-3qyb
apa: Skrabulis, M., Sosa, M. C., Zambon, N. C., Militaru, A., Rossi, M., Frimmer,
M., & Novotny, L. (2026). Nanomechanical sensor resolving impulsive forces
below its zero-point fluctuations. Physical Review Letters. American Physical
Society. https://doi.org/10.1103/9wzm-3qyb
chicago: Skrabulis, Martynas, Martin Colombano Sosa, Nicola Carlon Zambon, Andrei
Militaru, Massimiliano Rossi, Martin Frimmer, and Lukas Novotny. “Nanomechanical
Sensor Resolving Impulsive Forces below Its Zero-Point Fluctuations.” Physical
Review Letters. American Physical Society, 2026. https://doi.org/10.1103/9wzm-3qyb.
ieee: M. Skrabulis et al., “Nanomechanical sensor resolving impulsive forces
below its zero-point fluctuations,” Physical Review Letters, vol. 136,
no. 23. American Physical Society, 2026.
ista: Skrabulis M, Sosa MC, Zambon NC, Militaru A, Rossi M, Frimmer M, Novotny L.
2026. Nanomechanical sensor resolving impulsive forces below its zero-point fluctuations.
Physical Review Letters. 136(23), 233604.
mla: Skrabulis, Martynas, et al. “Nanomechanical Sensor Resolving Impulsive Forces
below Its Zero-Point Fluctuations.” Physical Review Letters, vol. 136,
no. 23, 233604, American Physical Society, 2026, doi:10.1103/9wzm-3qyb.
short: M. Skrabulis, M.C. Sosa, N.C. Zambon, A. Militaru, M. Rossi, M. Frimmer,
L. Novotny, Physical Review Letters 136 (2026).
das_tickbox: '1'
dataavailabilitystatement: The data that support the findings of this article are
openly available DOI 10.3929/ethz-c-000798807
date_created: 2026-07-05T22:01:36Z
date_published: 2026-06-12T00:00:00Z
date_updated: 2026-07-06T07:07:24Z
day: '12'
department:
- _id: JoFi
doi: 10.1103/9wzm-3qyb
external_id:
arxiv:
- '2601.19392'
intvolume: ' 136'
issue: '23'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2601.19392
month: '06'
oa: 1
oa_version: Preprint
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: Nanomechanical sensor resolving impulsive forces below its zero-point fluctuations
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 136
year: '2026'
...
---
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '22247'
abstract:
- lang: eng
text: "A linearly ordered (LO) k-colouring of a hypergraph is a colouring of its
vertices with colours 1, …, k such that each edge contains a unique maximal colour.
Deciding whether an input hypergraph admits LO k-colouring with a fixed number
of colours is NP-complete (and in the special case of graphs, LO colouring coincides
with the usual graph colouring).\r\nHere, we investigate the complexity of approximating
the “linearly ordered chromatic number” of a hypergraph. We prove that the following
promise problem is NP-complete: Given a 3-uniform hypergraph, distinguish between
the case that it is LO 3-colourable, and the case that it is not even LO 4-colourable.
We prove this result by a combination of algebraic, topological, and combinatorial
methods, building on and extending a topological approach for studying approximate
graph colouring introduced by Krokhin, Opršal, Wrochna, and Živný (2023)."
acknowledgement: "This research was supported by the Charles University project PRIMUS/21/SCI/014,
by the Ministry of Education, Youth\r\nand Sports of the Czech Republic under the
project MSCAfellow5_MUNI (CZ.02.01.01/00/22_010/0003229), and by the\r\nAustrian
Science Fund (FWF project P31312-N35). This research was funded by UKRI EP/X024431/1
and by a Clarendon\r\nFund Scholarship. This project has received funding from the
European Union’s Horizon 2020 research and innovation\r\nprogramme under the Marie
Skłodowska-Curie Grant Agreement No 101034413.\r\n"
article_number: '10'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Marek
full_name: Filakovský, Marek
id: 3E8AF77E-F248-11E8-B48F-1D18A9856A87
last_name: Filakovský
- first_name: Tamio Vesa
full_name: Nakajima, Tamio Vesa
last_name: Nakajima
- first_name: Jakub
full_name: Opršal, Jakub
id: ec596741-c539-11ec-b829-c79322a91242
last_name: Opršal
orcid: 0000-0003-1245-3456
- first_name: Gianluca
full_name: Tasinato, Gianluca
id: 0433290C-AF8F-11E9-A4C7-F729E6697425
last_name: Tasinato
- first_name: Uli
full_name: Wagner, Uli
id: 36690CA2-F248-11E8-B48F-1D18A9856A87
last_name: Wagner
orcid: 0000-0002-1494-0568
citation:
ama: Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. Hardness of linearly
ordered 4-colouring of 3-colourable 3-uniform hypergraphs. ACM Transactions
on Computation Theory. 2026;18(2). doi:10.1145/3779121
apa: Filakovský, M., Nakajima, T. V., Opršal, J., Tasinato, G., & Wagner, U.
(2026). Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs.
ACM Transactions on Computation Theory. Association for Computing Machinery.
https://doi.org/10.1145/3779121
chicago: Filakovský, Marek, Tamio Vesa Nakajima, Jakub Opršal, Gianluca Tasinato,
and Uli Wagner. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable 3-Uniform
Hypergraphs.” ACM Transactions on Computation Theory. Association for Computing
Machinery, 2026. https://doi.org/10.1145/3779121.
ieee: M. Filakovský, T. V. Nakajima, J. Opršal, G. Tasinato, and U. Wagner, “Hardness
of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs,” ACM
Transactions on Computation Theory, vol. 18, no. 2. Association for Computing
Machinery, 2026.
ista: Filakovský M, Nakajima TV, Opršal J, Tasinato G, Wagner U. 2026. Hardness
of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs. ACM Transactions
on Computation Theory. 18(2), 10.
mla: Filakovský, Marek, et al. “Hardness of Linearly Ordered 4-Colouring of 3-Colourable
3-Uniform Hypergraphs.” ACM Transactions on Computation Theory, vol. 18,
no. 2, 10, Association for Computing Machinery, 2026, doi:10.1145/3779121.
short: M. Filakovský, T.V. Nakajima, J. Opršal, G. Tasinato, U. Wagner, ACM Transactions
on Computation Theory 18 (2026).
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-05T22:01:37Z
date_published: 2026-05-04T00:00:00Z
date_updated: 2026-07-06T09:06:29Z
day: '04'
ddc:
- '500'
department:
- _id: UlWa
doi: 10.1145/3779121
ec_funded: 1
external_id:
arxiv:
- '2312.12981'
file:
- access_level: open_access
checksum: 0399ab94085878fc810084845eabd627
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T09:03:02Z
date_updated: 2026-07-06T09:03:02Z
file_id: '22252'
file_name: 2026_TransactionsGraphics_Filakovsky.pdf
file_size: 941518
relation: main_file
success: 1
file_date_updated: 2026-07-06T09:03:02Z
has_accepted_license: '1'
intvolume: ' 18'
issue: '2'
keyword:
- Constraint satisfaction problem
- hypergraph colouring
- promise problem
- topological methods
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
project:
- _id: 26611F5C-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: P31312
name: Algorithms for Embeddings and Homotopy Theory
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: ACM Transactions on Computation Theory
publication_identifier:
eissn:
- 1942-3462
issn:
- 1942-3454
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
related_material:
record:
- id: '15168'
relation: earlier_version
status: public
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: Hardness of linearly ordered 4-colouring of 3-colourable 3-uniform hypergraphs
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: 18
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22246'
abstract:
- lang: eng
text: "In this paper we construct distance sketches for intersection graphs of arbitrary
path-connected regions in the plane (known as the string graphs) in the constant
and 1+ε distortion regimes. Furthermore, the distance sketches themselves are
planar graphs. First, we show that every unweighted string graph G has an O(1)-distortion
planar emulator: that is, there exists an edge-weighted planar graph H containing
every vertex in G, such that every pair of vertices (u,v) satisfies δG(u,v) ≤
δH(u,v) ≤ O(1) · δG(u,v). Furthermore, we show that for any constant ε > 0, there
is an edge-weighted planar graph H′ such that every pair of vertices (u,v) satisfies
δG(u,v) ≤ δH′(u,v) ≤ (1+ε) · δG(u,v) + O(ε−4polylogn). No previous constructions
of sparse distance sketches were known even for intersection graphs of simple
shapes like axis-parallel rectangles or fat convex polygons.\r\nAs applications,
we construct the first (1+ε, +O(1)) mixed-distortion tree cover and distance oracle
for arbitrary string graphs, as well as the first additive +(εΔ+O(1))-distortion
embedding of string graphs G with diameter Δ into graphs of constant treewidth
O(ε−4)."
acknowledgement: "Hsien-Chih Chang and Jonathan Conroy are supported by the U.S.\r\nNational
Science Foundation CAREER Award under the Grant No.\r\nCCF-2443017."
article_processing_charge: No
arxiv: 1
author:
- first_name: Hsien Chih
full_name: Chang, Hsien Chih
last_name: Chang
- first_name: Jonathan
full_name: Conroy, Jonathan
last_name: Conroy
- first_name: Zihan
full_name: Tan, Zihan
last_name: Tan
- first_name: Da Wei
full_name: Zheng, Da Wei
id: af77956b-e859-11ef-8dc9-d301b898e32f
last_name: Zheng
citation:
ama: 'Chang HC, Conroy J, Tan Z, Zheng DW. Cutting planarians: Planar emulators
for string graphs. In: 58th Annual ACM Symposium on Theory of Computing.
Association for Computing Machinery; 2026:2140-2151. doi:10.1145/3798129.3800917'
apa: 'Chang, H. C., Conroy, J., Tan, Z., & Zheng, D. W. (2026). Cutting planarians:
Planar emulators for string graphs. In 58th Annual ACM Symposium on Theory
of Computing (pp. 2140–2151). Salt Lake City, UT, United States: Association
for Computing Machinery. https://doi.org/10.1145/3798129.3800917'
chicago: 'Chang, Hsien Chih, Jonathan Conroy, Zihan Tan, and Da Wei Zheng. “Cutting
Planarians: Planar Emulators for String Graphs.” In 58th Annual ACM Symposium
on Theory of Computing, 2140–51. Association for Computing Machinery, 2026.
https://doi.org/10.1145/3798129.3800917.'
ieee: 'H. C. Chang, J. Conroy, Z. Tan, and D. W. Zheng, “Cutting planarians: Planar
emulators for string graphs,” in 58th Annual ACM Symposium on Theory of Computing,
Salt Lake City, UT, United States, 2026, pp. 2140–2151.'
ista: 'Chang HC, Conroy J, Tan Z, Zheng DW. 2026. Cutting planarians: Planar emulators
for string graphs. 58th Annual ACM Symposium on Theory of Computing. STOC: Symposium
on the Theory of Computing, 2140–2151.'
mla: 'Chang, Hsien Chih, et al. “Cutting Planarians: Planar Emulators for String
Graphs.” 58th Annual ACM Symposium on Theory of Computing, Association
for Computing Machinery, 2026, pp. 2140–51, doi:10.1145/3798129.3800917.'
short: H.C. Chang, J. Conroy, Z. Tan, D.W. Zheng, in:, 58th Annual ACM Symposium
on Theory of Computing, Association for Computing Machinery, 2026, pp. 2140–2151.
conference:
end_date: 2026-06-26
location: Salt Lake City, UT, United States
name: 'STOC: Symposium on the Theory of Computing'
start_date: 2026-06-22
corr_author: '1'
das_tickbox: '0'
date_created: 2026-07-05T22:01:37Z
date_published: 2026-06-09T00:00:00Z
date_updated: 2026-07-06T10:25:23Z
day: '09'
ddc:
- '500'
- '000'
department:
- _id: MoHe
doi: 10.1145/3798129.3800917
external_id:
arxiv:
- '2510.21700'
file:
- access_level: open_access
checksum: c184596a3e18fee912caef4c7751a96d
content_type: application/pdf
creator: dernst
date_created: 2026-07-06T10:23:09Z
date_updated: 2026-07-06T10:23:09Z
file_id: '22253'
file_name: 2026_STOC_Chang.pdf
file_size: 2015699
relation: main_file
success: 1
file_date_updated: 2026-07-06T10:23:09Z
has_accepted_license: '1'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
page: 2140-2151
publication: 58th Annual ACM Symposium on Theory of Computing
publication_identifier:
isbn:
- '9798400725364'
issn:
- 0737-8017
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
researchdata_availability: no
scopus_import: '1'
status: public
supplementarymaterial: no
title: 'Cutting planarians: Planar emulators for string graphs'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...