---
_id: '14456'
abstract:
- lang: eng
text: In this paper, we present novel algorithms that efficiently compute a shortest
reconfiguration sequence between two given dominating sets in trees and interval
graphs under the TOKEN SLIDING model. In this problem, a graph is provided along
with its two dominating sets, which can be imagined as tokens placed on vertices.
The objective is to find a shortest sequence of dominating sets that transforms
one set into the other, with each set in the sequence resulting from sliding a
single token in the previous set. While identifying any sequence has been well
studied, our work presents the first polynomial algorithms for this optimization
variant in the context of dominating sets.
alternative_title:
- LNCS
article_processing_charge: No
arxiv: 1
author:
- first_name: Jan Matyáš
full_name: Křišťan, Jan Matyáš
last_name: Křišťan
- first_name: Jakub
full_name: Svoboda, Jakub
id: 130759D2-D7DD-11E9-87D2-DE0DE6697425
last_name: Svoboda
orcid: 0000-0002-1419-3267
citation:
ama: 'Křišťan JM, Svoboda J. Shortest dominating set reconfiguration under token
sliding. In: 24th International Symposium on Fundamentals of Computation Theory.
Vol 14292. Springer Nature; 2023:333-347. doi:10.1007/978-3-031-43587-4_24'
apa: 'Křišťan, J. M., & Svoboda, J. (2023). Shortest dominating set reconfiguration
under token sliding. In 24th International Symposium on Fundamentals of Computation
Theory (Vol. 14292, pp. 333–347). Trier, Germany: Springer Nature. https://doi.org/10.1007/978-3-031-43587-4_24'
chicago: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” In 24th International Symposium on Fundamentals of Computation
Theory, 14292:333–47. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-43587-4_24.
ieee: J. M. Křišťan and J. Svoboda, “Shortest dominating set reconfiguration under
token sliding,” in 24th International Symposium on Fundamentals of Computation
Theory, Trier, Germany, 2023, vol. 14292, pp. 333–347.
ista: 'Křišťan JM, Svoboda J. 2023. Shortest dominating set reconfiguration under
token sliding. 24th International Symposium on Fundamentals of Computation Theory.
FCT: Fundamentals of Computation Theory, LNCS, vol. 14292, 333–347.'
mla: Křišťan, Jan Matyáš, and Jakub Svoboda. “Shortest Dominating Set Reconfiguration
under Token Sliding.” 24th International Symposium on Fundamentals of Computation
Theory, vol. 14292, Springer Nature, 2023, pp. 333–47, doi:10.1007/978-3-031-43587-4_24.
short: J.M. Křišťan, J. Svoboda, in:, 24th International Symposium on Fundamentals
of Computation Theory, Springer Nature, 2023, pp. 333–347.
conference:
end_date: 2023-09-21
location: Trier, Germany
name: 'FCT: Fundamentals of Computation Theory'
start_date: 2023-09-18
date_created: 2023-10-29T23:01:16Z
date_published: 2023-09-21T00:00:00Z
date_updated: 2025-09-09T13:07:40Z
day: '21'
department:
- _id: KrCh
doi: 10.1007/978-3-031-43587-4_24
external_id:
arxiv:
- '2307.10847'
isi:
- '001162288800024'
intvolume: ' 14292'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2307.10847
month: '09'
oa: 1
oa_version: Preprint
page: 333-347
publication: 24th International Symposium on Fundamentals of Computation Theory
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031435867'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
link:
- relation: erratum
url: https://doi.org/10.1007/978-3-031-43587-4_31
scopus_import: '1'
status: public
title: Shortest dominating set reconfiguration under token sliding
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14292
year: '2023'
...
---
_id: '14457'
abstract:
- lang: eng
text: "Threshold secret sharing allows a dealer to split a secret s into n shares,
such that any t shares allow for reconstructing s, but no t-1 shares reveal any
information about s. Leakage-resilient secret sharing requires that the secret
remains hidden, even when an adversary additionally obtains a limited amount of
leakage from every share. Benhamouda et al. (CRYPTO’18) proved that Shamir’s secret
sharing scheme is one bit leakage-resilient for reconstruction threshold t≥0.85n
and conjectured that the same holds for t = c.n for any constant 0≤c≤1. Nielsen
and Simkin (EUROCRYPT’20) showed that this is the best one can hope for by proving
that Shamir’s scheme is not secure against one-bit leakage when t0c.n/log(n).\r\nIn
this work, we strengthen the lower bound of Nielsen and Simkin. We consider noisy
leakage-resilience, where a random subset of leakages is replaced by uniformly
random noise. We prove a lower bound for Shamir’s secret sharing, similar to that
of Nielsen and Simkin, which holds even when a constant fraction of leakages is
replaced by random noise. To this end, we first prove a lower bound on the share
size of any noisy-leakage-resilient sharing scheme. We then use this lower bound
to show that there exist universal constants c1, c2, such that for sufficiently
large n it holds that Shamir’s secret sharing scheme is not noisy-leakage-resilient
for t≤c1.n/log(n), even when a c2 fraction of leakages are replaced by random
noise.\r\n\r\n\r\n\r\n"
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Charlotte
full_name: Hoffmann, Charlotte
id: 0f78d746-dc7d-11ea-9b2f-83f92091afe7
last_name: Hoffmann
orcid: 0000-0003-2027-5549
- first_name: Mark
full_name: Simkin, Mark
last_name: Simkin
citation:
ama: 'Hoffmann C, Simkin M. Stronger lower bounds for leakage-resilient secret sharing.
In: 8th International Conference on Cryptology and Information Security in
Latin America. Vol 14168. Springer Nature; 2023:215-228. doi:10.1007/978-3-031-44469-2_11'
apa: 'Hoffmann, C., & Simkin, M. (2023). Stronger lower bounds for leakage-resilient
secret sharing. In 8th International Conference on Cryptology and Information
Security in Latin America (Vol. 14168, pp. 215–228). Quito, Ecuador: Springer
Nature. https://doi.org/10.1007/978-3-031-44469-2_11'
chicago: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” In 8th International Conference on Cryptology and Information
Security in Latin America, 14168:215–28. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-44469-2_11.
ieee: C. Hoffmann and M. Simkin, “Stronger lower bounds for leakage-resilient secret
sharing,” in 8th International Conference on Cryptology and Information Security
in Latin America, Quito, Ecuador, 2023, vol. 14168, pp. 215–228.
ista: 'Hoffmann C, Simkin M. 2023. Stronger lower bounds for leakage-resilient secret
sharing. 8th International Conference on Cryptology and Information Security in
Latin America. LATINCRYPT: Cryptology and Information Security in Latin America,
LNCS, vol. 14168, 215–228.'
mla: Hoffmann, Charlotte, and Mark Simkin. “Stronger Lower Bounds for Leakage-Resilient
Secret Sharing.” 8th International Conference on Cryptology and Information
Security in Latin America, vol. 14168, Springer Nature, 2023, pp. 215–28,
doi:10.1007/978-3-031-44469-2_11.
short: C. Hoffmann, M. Simkin, in:, 8th International Conference on Cryptology and
Information Security in Latin America, Springer Nature, 2023, pp. 215–228.
conference:
end_date: 2023-10-06
location: Quito, Ecuador
name: 'LATINCRYPT: Cryptology and Information Security in Latin America'
start_date: 2023-10-03
corr_author: '1'
date_created: 2023-10-29T23:01:16Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2025-09-09T13:09:21Z
day: '01'
department:
- _id: KrPi
doi: 10.1007/978-3-031-44469-2_11
external_id:
isi:
- '001157041900011'
intvolume: ' 14168'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2023/1017
month: '10'
oa: 1
oa_version: Preprint
page: 215-228
publication: 8th International Conference on Cryptology and Information Security in
Latin America
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031444685'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Stronger lower bounds for leakage-resilient secret sharing
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14168
year: '2023'
...
---
_id: '14460'
abstract:
- lang: eng
text: We provide an efficient implementation of the backpropagation algorithm, specialized
to the case where the weights of the neural network being trained are sparse.
Our algorithm is general, as it applies to arbitrary (unstructured) sparsity and
common layer types (e.g., convolutional or linear). We provide a fast vectorized
implementation on commodity CPUs, and show that it can yield speedups in end-to-end
runtime experiments, both in transfer learning using already-sparsified networks,
and in training sparse networks from scratch. Thus, our results provide the first
support for sparse training on commodity hardware.
acknowledgement: 'We would like to thank Elias Frantar for his valuable assistance
and support at the outset of this project, and the anonymous ICML and SNN reviewers
for very constructive feedback. EI was supported in part by the FWF DK VGSCO, grant
agreement number W1260-N35. DA acknowledges generous ERC support, via Starting Grant
805223 ScaleML. '
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Mahdi
full_name: Nikdan, Mahdi
id: 66374281-f394-11eb-9cf6-869147deecc0
last_name: Nikdan
- first_name: Tommaso
full_name: Pegolotti, Tommaso
last_name: Pegolotti
- first_name: Eugenia B
full_name: Iofinova, Eugenia B
id: f9a17499-f6e0-11ea-865d-fdf9a3f77117
last_name: Iofinova
orcid: 0000-0002-7778-3221
- first_name: Eldar
full_name: Kurtic, Eldar
id: 47beb3a5-07b5-11eb-9b87-b108ec578218
last_name: Kurtic
- first_name: Dan-Adrian
full_name: Alistarh, Dan-Adrian
id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
last_name: Alistarh
orcid: 0000-0003-3650-940X
citation:
ama: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. SparseProp: Efficient
sparse backpropagation for faster training of neural networks at the edge. In:
Proceedings of the 40th International Conference on Machine Learning. Vol
202. ML Research Press; 2023:26215-26227.'
apa: 'Nikdan, M., Pegolotti, T., Iofinova, E. B., Kurtic, E., & Alistarh, D.-A.
(2023). SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge. In Proceedings of the 40th International Conference on
Machine Learning (Vol. 202, pp. 26215–26227). Honolulu, Hawaii, HI, United
States: ML Research Press.'
chicago: 'Nikdan, Mahdi, Tommaso Pegolotti, Eugenia B Iofinova, Eldar Kurtic, and
Dan-Adrian Alistarh. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” In Proceedings of the 40th International
Conference on Machine Learning, 202:26215–27. ML Research Press, 2023.'
ieee: 'M. Nikdan, T. Pegolotti, E. B. Iofinova, E. Kurtic, and D.-A. Alistarh, “SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge,” in Proceedings of the 40th International Conference on Machine Learning,
Honolulu, Hawaii, HI, United States, 2023, vol. 202, pp. 26215–26227.'
ista: 'Nikdan M, Pegolotti T, Iofinova EB, Kurtic E, Alistarh D-A. 2023. SparseProp:
Efficient sparse backpropagation for faster training of neural networks at the
edge. Proceedings of the 40th International Conference on Machine Learning. ICML:
International Conference on Machine Learning, PMLR, vol. 202, 26215–26227.'
mla: 'Nikdan, Mahdi, et al. “SparseProp: Efficient Sparse Backpropagation for Faster
Training of Neural Networks at the Edge.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 26215–27.'
short: M. Nikdan, T. Pegolotti, E.B. Iofinova, E. Kurtic, D.-A. Alistarh, in:, Proceedings
of the 40th International Conference on Machine Learning, ML Research Press, 2023,
pp. 26215–26227.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-04-14T07:49:12Z
day: '30'
department:
- _id: DaAl
ec_funded: 1
external_id:
arxiv:
- '2302.04852'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2302.04852
month: '07'
oa: 1
oa_version: Preprint
page: 26215-26227
project:
- _id: 268A44D6-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '805223'
name: Elastic Coordination for Scalable Machine Learning
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SparseProp: Efficient sparse backpropagation for faster training of neural
networks at the edge'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14462'
abstract:
- lang: eng
text: "We study fine-grained error bounds for differentially private algorithms
for counting under continual observation. Our main insight is that the matrix
mechanism when using lower-triangular matrices can be used in the continual observation
model. More specifically, we give an explicit factorization for the counting matrix
Mcount and upper bound the error explicitly. We also give a fine-grained analysis,
specifying the exact constant in the upper bound. Our analysis is based on upper
and lower bounds of the completely bounded norm (cb-norm) of Mcount\r\n. Along
the way, we improve the best-known bound of 28 years by Mathias (SIAM Journal
on Matrix Analysis and Applications, 1993) on the cb-norm of Mcount for a large
range of the dimension of Mcount. Furthermore, we are the first to give concrete
error bounds for various problems under continual observation such as binary counting,
maintaining a histogram, releasing an approximately cut-preserving synthetic graph,
many graph-based statistics, and substring and episode counting. Finally, we note
that our result can be used to get a fine-grained error bound for non-interactive
local learning and the first lower bounds on the additive error for (ϵ,δ)-differentially-private
counting under continual observation. Subsequent to this work, Henzinger et al.
(SODA, 2023) showed that our factorization also achieves fine-grained mean-squared
error."
acknowledgement: "This project has received funding from the European Research Council
(ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant agreement No.\r\n101019564 “The Design of Modern Fully Dynamic Data Structures
(MoDynStruct)” and from the Austrian Science Fund (FWF) project Z 422-N, and project
“Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional
funding from the netidee SCIENCE Stiftung, 2020–2024. 2020–2024. JU’s research was
funded by Decanal Research Grant. A part of this work was done when JU was visiting
Indian Statistical Institute, Delhi. The authors would like to thank Rajat Bhatia,
Aleksandar Nikolov, Shanta Laisharam, Vern Paulsen, Ryan Rogers, Abhradeep Thakurta,
and Sarvagya Upadhyay for useful discussions."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Hendrik
full_name: Fichtenberger, Hendrik
last_name: Fichtenberger
- 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: Jalaj
full_name: Upadhyay, Jalaj
last_name: Upadhyay
citation:
ama: 'Fichtenberger H, Henzinger M, Upadhyay J. Constant matters: Fine-grained error
bound on differentially private continual observation. In: Proceedings of the
40th International Conference on Machine Learning. Vol 202. ML Research Press;
2023:10072-10092.'
apa: 'Fichtenberger, H., Henzinger, M., & Upadhyay, J. (2023). Constant matters:
Fine-grained error bound on differentially private continual observation. In Proceedings
of the 40th International Conference on Machine Learning (Vol. 202, pp. 10072–10092).
Honolulu, Hawaii, HI, United States: ML Research Press.'
chicago: 'Fichtenberger, Hendrik, Monika Henzinger, and Jalaj Upadhyay. “Constant
Matters: Fine-Grained Error Bound on Differentially Private Continual Observation.”
In Proceedings of the 40th International Conference on Machine Learning,
202:10072–92. ML Research Press, 2023.'
ieee: 'H. Fichtenberger, M. Henzinger, and J. Upadhyay, “Constant matters: Fine-grained
error bound on differentially private continual observation,” in Proceedings
of the 40th International Conference on Machine Learning, Honolulu, Hawaii,
HI, United States, 2023, vol. 202, pp. 10072–10092.'
ista: 'Fichtenberger H, Henzinger M, Upadhyay J. 2023. Constant matters: Fine-grained
error bound on differentially private continual observation. Proceedings of the
40th International Conference on Machine Learning. ICML: International Conference
on Machine Learning, PMLR, vol. 202, 10072–10092.'
mla: 'Fichtenberger, Hendrik, et al. “Constant Matters: Fine-Grained Error Bound
on Differentially Private Continual Observation.” Proceedings of the 40th International
Conference on Machine Learning, vol. 202, ML Research Press, 2023, pp. 10072–92.'
short: H. Fichtenberger, M. Henzinger, J. Upadhyay, in:, Proceedings of the 40th
International Conference on Machine Learning, ML Research Press, 2023, pp. 10072–10092.
conference:
end_date: 2023-07-29
location: Honolulu, Hawaii, HI, United States
name: 'ICML: International Conference on Machine Learning'
start_date: 2023-07-23
corr_author: '1'
date_created: 2023-10-29T23:01:17Z
date_published: 2023-07-30T00:00:00Z
date_updated: 2025-05-19T10:59:58Z
day: '30'
department:
- _id: MoHe
ec_funded: 1
external_id:
arxiv:
- '2202.11205'
intvolume: ' 202'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://proceedings.mlr.press/v202/fichtenberger23a/fichtenberger23a.pdf
month: '07'
oa: 1
oa_version: Published Version
page: 10072-10092
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: Proceedings of the 40th International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Constant matters: Fine-grained error bound on differentially private continual
observation'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 202
year: '2023'
...
---
_id: '14464'
abstract:
- lang: eng
text: 'Given a triangle Δ, we study the problem of determining the smallest enclosing
and largest embedded isosceles triangles of Δ with respect to area and perimeter.
This problem was initially posed by Nandakumar [17, 22] and was first studied
by Kiss, Pach, and Somlai [13], who showed that if Δ′ is the smallest area isosceles
triangle containing Δ, then Δ′ and Δ share a side and an angle. In the present
paper, we prove that for any triangle Δ, every maximum area isosceles triangle
embedded in Δ and every maximum perimeter isosceles triangle embedded in Δ shares
a side and an angle with Δ. Somewhat surprisingly, the case of minimum perimeter
enclosing triangles is different: there are infinite families of triangles Δ whose
minimum perimeter isosceles containers do not share a side and an angle with Δ.'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Áron
full_name: Ambrus, Áron
last_name: Ambrus
- first_name: Mónika
full_name: Csikós, Mónika
last_name: Csikós
- first_name: Gergely
full_name: Kiss, Gergely
last_name: Kiss
- first_name: János
full_name: Pach, János
id: E62E3130-B088-11EA-B919-BF823C25FEA4
last_name: Pach
- first_name: Gábor
full_name: Somlai, Gábor
last_name: Somlai
citation:
ama: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
2023;34(7):737-760. doi:10.1142/S012905412342008X
apa: Ambrus, Á., Csikós, M., Kiss, G., Pach, J., & Somlai, G. (2023). Optimal
embedded and enclosing isosceles triangles. International Journal of Foundations
of Computer Science. World Scientific Publishing. https://doi.org/10.1142/S012905412342008X
chicago: Ambrus, Áron, Mónika Csikós, Gergely Kiss, János Pach, and Gábor Somlai.
“Optimal Embedded and Enclosing Isosceles Triangles.” International Journal
of Foundations of Computer Science. World Scientific Publishing, 2023. https://doi.org/10.1142/S012905412342008X.
ieee: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, and G. Somlai, “Optimal embedded and
enclosing isosceles triangles,” International Journal of Foundations of Computer
Science, vol. 34, no. 7. World Scientific Publishing, pp. 737–760, 2023.
ista: Ambrus Á, Csikós M, Kiss G, Pach J, Somlai G. 2023. Optimal embedded and enclosing
isosceles triangles. International Journal of Foundations of Computer Science.
34(7), 737–760.
mla: Ambrus, Áron, et al. “Optimal Embedded and Enclosing Isosceles Triangles.”
International Journal of Foundations of Computer Science, vol. 34, no.
7, World Scientific Publishing, 2023, pp. 737–60, doi:10.1142/S012905412342008X.
short: Á. Ambrus, M. Csikós, G. Kiss, J. Pach, G. Somlai, International Journal
of Foundations of Computer Science 34 (2023) 737–760.
date_created: 2023-10-29T23:01:18Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2023-12-13T13:04:55Z
day: '05'
department:
- _id: HeEd
doi: 10.1142/S012905412342008X
external_id:
arxiv:
- '2205.11637'
isi:
- '001080874400001'
intvolume: ' 34'
isi: 1
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2205.11637
month: '10'
oa: 1
oa_version: Preprint
page: 737-760
publication: International Journal of Foundations of Computer Science
publication_identifier:
eissn:
- 1793-6373
issn:
- 0129-0541
publication_status: published
publisher: World Scientific Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Optimal embedded and enclosing isosceles triangles
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 34
year: '2023'
...
---
_id: '14472'
abstract:
- lang: eng
text: "Data related to the following paper:\r\n\"Stress granules plug and stabilize
damaged endolysosomal membranes\" (https://doi.org/10.1038/s41586-023-06726-w)\r\n\r\nAbstract:
\r\nEndomembrane damage represents a form of stress that is detrimental for eukaryotic
cells. To cope with this threat, cells possess mechanisms that repair the damage
and restore cellular homeostasis. Endomembrane damage also results in organelle
instability and the mechanisms by which cells stabilize damaged endomembranes
to enable membrane repair remains unknown. In this work we use a minimal coarse-grained
molecular dynamics system to explore how lipid vesicles undergoing poration in
a protein-rich medium can be plugged and stabilised by condensate formation. The
solution of proteins in and out of the vesicle is described by beads dispersed
in implicit solvent. The membrane is described as a one-bead-thick fluid elastic
layer of mechanical properties that mimic biological membranes. We tune the interactions
between solution beads in the different compartments to capture the differences
between the cytoplasmic and endosomal protein solutions and explore how the system
responds to different degrees of membrane poration. We find that, in the right
interaction regime, condensates form rapidly at the damage site upon solution
mixing and act as a plug that prevents futher mixing and destabilisation of the
vesicle. Further, when the condensate can interact with the membrane (wetting
interactions) we find that it mediates pore sealing and membrane repair. This
research is part of the work published in \"Stress granules plug and stabilize
damaged endolysosomal membranes\", Bussi et al, Nature, 2023 - 10.1038/s41586-023-06726-w."
article_processing_charge: No
author:
- first_name: Christian Eduardo
full_name: Vanhille-Campos, Christian Eduardo
id: 3adeca52-9313-11ed-b1ac-c170b2505714
last_name: Vanhille-Campos
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
citation:
ama: Vanhille-Campos CE, Šarić A. Stress granules plug and stabilize damaged endolysosomal
membranes. 2023. doi:10.15479/AT:ISTA:14472
apa: Vanhille-Campos, C. E., & Šarić, A. (2023). Stress granules plug and stabilize
damaged endolysosomal membranes. Institute of Science and Technology Austria.
https://doi.org/10.15479/AT:ISTA:14472
chicago: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. “Stress Granules
Plug and Stabilize Damaged Endolysosomal Membranes.” Institute of Science and
Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:14472.
ieee: C. E. Vanhille-Campos and A. Šarić, “Stress granules plug and stabilize damaged
endolysosomal membranes.” Institute of Science and Technology Austria, 2023.
ista: Vanhille-Campos CE, Šarić A. 2023. Stress granules plug and stabilize damaged
endolysosomal membranes, Institute of Science and Technology Austria, 10.15479/AT:ISTA:14472.
mla: Vanhille-Campos, Christian Eduardo, and Anđela Šarić. Stress Granules Plug
and Stabilize Damaged Endolysosomal Membranes. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14472.
short: C.E. Vanhille-Campos, A. Šarić, (2023).
corr_author: '1'
date_created: 2023-10-30T16:38:32Z
date_published: 2023-10-31T00:00:00Z
date_updated: 2025-09-09T13:30:33Z
day: '31'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.15479/AT:ISTA:14472
file:
- access_level: open_access
checksum: a18706e952e8660c51ede52a167270b7
content_type: application/zip
creator: ipalaia
date_created: 2023-10-30T16:31:08Z
date_updated: 2023-10-30T16:31:08Z
file_id: '14473'
file_name: SGporecondensation-main.zip
file_size: 62821432
relation: main_file
success: 1
- access_level: open_access
checksum: 389eab31c6509dbc05795017fb618758
content_type: text/plain
creator: dernst
date_created: 2023-10-31T08:57:50Z
date_updated: 2023-10-31T08:57:50Z
file_id: '14474'
file_name: README.txt
file_size: 1697
relation: main_file
success: 1
file_date_updated: 2023-10-31T08:57:50Z
has_accepted_license: '1'
license: https://creativecommons.org/publicdomain/zero/1.0/
month: '10'
oa: 1
oa_version: Published Version
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '14610'
relation: used_in_publication
status: public
status: public
title: Stress granules plug and stabilize damaged endolysosomal membranes
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14485'
abstract:
- lang: eng
text: "Batching is a technique that stores multiple keys/values in each node of
a data structure. In sequential search data structures, batching reduces latency
by reducing the number of cache misses and shortening the chain of pointers to
dereference. Applying batching to concurrent data structures is challenging, because
it is difficult to maintain the search property and keep contention low in the
presence of batching.\r\nIn this paper, we present a general methodology for leveraging
batching in concurrent search data structures, called BatchBoost. BatchBoost builds
a search data structure from distinct \"data\" and \"index\" layers. The data
layer’s purpose is to store a batch of key/value pairs in each of its nodes. The
index layer uses an unmodified concurrent search data structure to route operations
to a position in the data layer that is \"close\" to where the corresponding key
should exist. The requirements on the index and data layers are low: with minimal
effort, we were able to compose three highly scalable concurrent search data structures
based on three original data structures as the index layers with a batched version
of the Lazy List as the data layer. The resulting BatchBoost data structures provide
significant performance improvements over their original counterparts."
alternative_title:
- LIPIcs
article_number: '35'
article_processing_charge: Yes
author:
- first_name: Vitaly
full_name: Aksenov, Vitaly
last_name: Aksenov
- first_name: Michael
full_name: Anoprenko, Michael
last_name: Anoprenko
- first_name: Alexander
full_name: Fedorov, Alexander
id: 2e711909-896a-11ed-bdf8-eb0f5a2984c6
last_name: Fedorov
- first_name: Michael
full_name: Spear, Michael
last_name: Spear
citation:
ama: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. In: 37th International Symposium
on Distributed Computing. Vol 281. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2023. doi:10.4230/LIPIcs.DISC.2023.35'
apa: 'Aksenov, V., Anoprenko, M., Fedorov, A., & Spear, M. (2023). Brief announcement:
BatchBoost: Universal batching for concurrent data structures. In 37th International
Symposium on Distributed Computing (Vol. 281). L’Aquila, Italy: Schloss Dagstuhl
- Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.DISC.2023.35'
chicago: 'Aksenov, Vitaly, Michael Anoprenko, Alexander Fedorov, and Michael Spear.
“Brief Announcement: BatchBoost: Universal Batching for Concurrent Data Structures.”
In 37th International Symposium on Distributed Computing, Vol. 281. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.DISC.2023.35.'
ieee: 'V. Aksenov, M. Anoprenko, A. Fedorov, and M. Spear, “Brief announcement:
BatchBoost: Universal batching for concurrent data structures,” in 37th International
Symposium on Distributed Computing, L’Aquila, Italy, 2023, vol. 281.'
ista: 'Aksenov V, Anoprenko M, Fedorov A, Spear M. 2023. Brief announcement: BatchBoost:
Universal batching for concurrent data structures. 37th International Symposium
on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol.
281, 35.'
mla: 'Aksenov, Vitaly, et al. “Brief Announcement: BatchBoost: Universal Batching
for Concurrent Data Structures.” 37th International Symposium on Distributed
Computing, vol. 281, 35, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2023, doi:10.4230/LIPIcs.DISC.2023.35.'
short: V. Aksenov, M. Anoprenko, A. Fedorov, M. Spear, in:, 37th International Symposium
on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
conference:
end_date: 2023-10-13
location: L'Aquila, Italy
name: 'DISC: Symposium on Distributed Computing'
start_date: 2023-10-09
corr_author: '1'
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-10-09T21:07:14Z
day: '01'
ddc:
- '000'
department:
- _id: GradSch
doi: 10.4230/LIPIcs.DISC.2023.35
file:
- access_level: open_access
checksum: d9f8d2915cccdf2df5905b7cd1b4a560
content_type: application/pdf
creator: dernst
date_created: 2023-11-06T11:45:21Z
date_updated: 2023-11-06T11:45:21Z
file_id: '14492'
file_name: 2023_LIPIcs_Aksenov.pdf
file_size: 646665
relation: main_file
success: 1
file_date_updated: 2023-11-06T11:45:21Z
has_accepted_license: '1'
intvolume: ' 281'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: 37th International Symposium on Distributed Computing
publication_identifier:
isbn:
- '9783959773010'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Brief announcement: BatchBoost: Universal batching for concurrent data structures'
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: 281
year: '2023'
...
---
_id: '14486'
abstract:
- lang: eng
text: We present a minimal model of ferroelectric large polarons, which are suggested
as one of the mechanisms responsible for the unique charge transport properties
of hybrid perovskites. We demonstrate that short-ranged charge–rotor interactions
lead to long-range ferroelectric ordering of rotors, which strongly affects the
carrier mobility. In the nonperturbative regime, where our theory cannot be reduced
to any of the earlier models, we reveal that the polaron is characterized by large
coherence length and a roughly tenfold increase of the effective mass as compared
to the bare mass. These results are in good agreement with other theoretical predictions
for ferroelectric polarons. Our model establishes a general phenomenological framework
for ferroelectric polarons providing the starting point for future studies of
their role in the transport properties of hybrid organic-inorganic perovskites.
acknowledgement: We thank Zh. Alpichshev, A. Volosniev, and A. V. Zampetaki for fruitful
discussions and comments. This project received funding from the European Union’s
Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie
Grant Agreement No. 101034413. M.L. acknowledges support by the European Research
Council (ERC) Starting Grant No. 801770 (ANGULON).
article_number: '043016'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: Areg
full_name: Ghazaryan, Areg
id: 4AF46FD6-F248-11E8-B48F-1D18A9856A87
last_name: Ghazaryan
orcid: 0000-0001-9666-3543
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Koutentakis G, Ghazaryan A, Lemeshko M. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 2023;5(4). doi:10.1103/PhysRevResearch.5.043016
apa: Koutentakis, G., Ghazaryan, A., & Lemeshko, M. (2023). Rotor lattice model
of ferroelectric large polarons. Physical Review Research. American Physical
Society. https://doi.org/10.1103/PhysRevResearch.5.043016
chicago: Koutentakis, Georgios, Areg Ghazaryan, and Mikhail Lemeshko. “Rotor Lattice
Model of Ferroelectric Large Polarons.” Physical Review Research. American
Physical Society, 2023. https://doi.org/10.1103/PhysRevResearch.5.043016.
ieee: G. Koutentakis, A. Ghazaryan, and M. Lemeshko, “Rotor lattice model of ferroelectric
large polarons,” Physical Review Research, vol. 5, no. 4. American Physical
Society, 2023.
ista: Koutentakis G, Ghazaryan A, Lemeshko M. 2023. Rotor lattice model of ferroelectric
large polarons. Physical Review Research. 5(4), 043016.
mla: Koutentakis, Georgios, et al. “Rotor Lattice Model of Ferroelectric Large Polarons.”
Physical Review Research, vol. 5, no. 4, 043016, American Physical Society,
2023, doi:10.1103/PhysRevResearch.5.043016.
short: G. Koutentakis, A. Ghazaryan, M. Lemeshko, Physical Review Research 5 (2023).
corr_author: '1'
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-05T00:00:00Z
date_updated: 2025-04-14T07:48:54Z
day: '05'
ddc:
- '530'
department:
- _id: MiLe
doi: 10.1103/PhysRevResearch.5.043016
ec_funded: 1
external_id:
arxiv:
- '2301.09875'
file:
- access_level: open_access
checksum: cb8de8fed6e09df1a18bd5a5aec5c55c
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T07:52:46Z
date_updated: 2023-11-07T07:52:46Z
file_id: '14493'
file_name: 2023_PhysReviewResearch_Koutentakis.pdf
file_size: 1127522
relation: main_file
success: 1
file_date_updated: 2023-11-07T07:52:46Z
has_accepted_license: '1'
intvolume: ' 5'
issue: '4'
language:
- iso: eng
month: '10'
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'
- _id: 2688CF98-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '801770'
name: 'Angulon: physics and applications of a new quasiparticle'
publication: Physical Review Research
publication_identifier:
issn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rotor lattice model of ferroelectric large polarons
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: 5
year: '2023'
...
---
_id: '14487'
abstract:
- lang: eng
text: High Mountain Asia (HMA) is among the most vulnerable water towers globally
and yet future projections of water availability in and from its high-mountain
catchments remain uncertain, as their hydrologic response to ongoing environmental
changes is complex. Mechanistic modeling approaches incorporating cryospheric,
hydrological, and vegetation processes in high spatial, temporal, and physical
detail have never been applied for high-elevation catchments of HMA. We use a
land surface model at high spatial and temporal resolution (100 m and hourly)
to simulate the coupled dynamics of energy, water, and vegetation for the 350
km2 Langtang catchment (Nepal). We compare our model outputs for one hydrological
year against a large set of observations to gain insight into the partitioning
of the water balance at the subseasonal scale and across elevation bands. During
the simulated hydrological year, we find that evapotranspiration is a key component
of the total water balance, as it causes about the equivalent of 20% of all the
available precipitation or 154% of the water production from glacier melt in the
basin to return directly to the atmosphere. The depletion of the cryospheric water
budget is dominated by snow melt, but at high elevations is primarily dictated
by snow and ice sublimation. Snow sublimation is the dominant vapor flux (49%)
at the catchment scale, accounting for the equivalent of 11% of snowfall, 17%
of snowmelt, and 75% of ice melt, respectively. We conclude that simulations should
consider sublimation and other evaporative fluxes explicitly, as otherwise water
balance estimates can be ill-quantified.
acknowledgement: This project has received funding from the JSPS-SNSF (Japan Society
for the Promotion of Science and Swiss National Science Foundation) Bilateral Programmes
project (HOPE, High-ele-vation precipitation in High Mountain Asia; Grant 183633),
and the European Research Council (ERC) under the European Union's Horizon 2020
research and innovation program (RAVEN, Rapid mass losses of debris-covered glaciers
in High Mountain Asia; Grant 772751). We want to thank in particular T. Gurung,
S. Joshi, J. Shea, W. Immerzeel, and others involved, as well as ICIMOD, for their
efforts over the past years in observing the meteorology of the Langtang catchment,
collecting and organizing the data and making them publicly available. We also thank
the National Geographic Society (Grant NGS-61784R-19) and the Mount Everest Foundation
(reference 19-24) for providing fieldwork funding for C. L. Fyffe. We thank T. Kramer
for help with the WSL Hyperion cluster. We are grate-ful for comments by three anonymous
reviewers and the Associate Editor, who greatly helped to improve the manuscript
further. Open access funding provided by ETH-Bereich Forschungsanstalten.
article_number: e2022WR033841
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
orcid: 0000-0001-7640-6152
- first_name: Evan S.
full_name: Miles, Evan S.
last_name: Miles
- first_name: Michael
full_name: Mccarthy, Michael
id: 22a2674a-61ce-11ee-94b5-d18813baf16f
last_name: Mccarthy
- first_name: Catriona Louise
full_name: Fyffe, Catriona Louise
id: 001b0422-8d15-11ed-bc51-cab6c037a228
last_name: Fyffe
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Jakob
full_name: Steiner, Jakob
last_name: Steiner
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Buri P, Fatichi S, Shaw T, et al. Land surface modeling in the Himalayas:
On the importance of evaporative fluxes for the water balance of a high-elevation
catchment. Water Resources Research. 2023;59(10). doi:10.1029/2022WR033841'
apa: 'Buri, P., Fatichi, S., Shaw, T., Miles, E. S., McCarthy, M., Fyffe, C. L.,
… Pellicciotti, F. (2023). Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment. Water
Resources Research. Wiley. https://doi.org/10.1029/2022WR033841'
chicago: 'Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan S. Miles, Michael McCarthy,
Catriona Louise Fyffe, Stefan Fugger, et al. “Land Surface Modeling in the Himalayas:
On the Importance of Evaporative Fluxes for the Water Balance of a High-Elevation
Catchment.” Water Resources Research. Wiley, 2023. https://doi.org/10.1029/2022WR033841.'
ieee: 'P. Buri et al., “Land surface modeling in the Himalayas: On the importance
of evaporative fluxes for the water balance of a high-elevation catchment,” Water
Resources Research, vol. 59, no. 10. Wiley, 2023.'
ista: 'Buri P, Fatichi S, Shaw T, Miles ES, McCarthy M, Fyffe CL, Fugger S, Ren
S, Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Land surface
modeling in the Himalayas: On the importance of evaporative fluxes for the water
balance of a high-elevation catchment. Water Resources Research. 59(10), e2022WR033841.'
mla: 'Buri, Pascal, et al. “Land Surface Modeling in the Himalayas: On the Importance
of Evaporative Fluxes for the Water Balance of a High-Elevation Catchment.” Water
Resources Research, vol. 59, no. 10, e2022WR033841, Wiley, 2023, doi:10.1029/2022WR033841.'
short: P. Buri, S. Fatichi, T. Shaw, E.S. Miles, M. McCarthy, C.L. Fyffe, S. Fugger,
S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, Water
Resources Research 59 (2023).
date_created: 2023-11-05T23:00:53Z
date_published: 2023-10-25T00:00:00Z
date_updated: 2025-09-09T13:15:40Z
day: '25'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.1029/2022WR033841
external_id:
isi:
- '001091989600005'
file:
- access_level: open_access
checksum: 7ba9c87228dc09029b16bc800a0ef1a1
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T08:10:44Z
date_updated: 2023-11-07T08:10:44Z
file_id: '14495'
file_name: 2023_WaterResourcesResearch_Buri.pdf
file_size: 5554901
relation: main_file
success: 1
file_date_updated: 2023-11-07T08:10:44Z
has_accepted_license: '1'
intvolume: ' 59'
isi: 1
issue: '10'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Water Resources Research
publication_identifier:
eissn:
- 1944-7973
issn:
- 0043-1397
publication_status: published
publisher: Wiley
quality_controlled: '1'
related_material:
record:
- id: '14494'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'Land surface modeling in the Himalayas: On the importance of evaporative fluxes
for the water balance of a high-elevation catchment'
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 59
year: '2023'
...
---
_id: '14489'
abstract:
- lang: eng
text: Microwave-optics entanglement is a vital component for building hybrid quantum
networks. Here, a new mechanism for preparing stationary entanglement between
microwave and optical cavity fields in a cavity optomagnomechanical system is
proposed. It consists of a magnon mode in a ferrimagnetic crystal that couples
directly to a microwave cavity mode via the magnetic dipole interaction and indirectly
to an optical cavity through the deformation displacement of the crystal. The
mechanical displacement is induced by the magnetostrictive force and coupled to
the optical cavity via radiation pressure. Both the opto- and magnomechanical
couplings are dispersive. Magnon–phonon entanglement is created via magnomechanical
parametric down-conversion, which is further distributed to optical and microwave
photons via simultaneous optomechanical beamsplitter interaction and electromagnonic
state-swap interaction, yielding stationary microwave-optics entanglement. The
microwave-optics entanglement is robust against thermal noise, which will find
broad potential applications in quantum networks and quantum information processing
with hybrid quantum systems.
acknowledgement: This work was supported by the National Key Research and Development
Program of China (Grant no. 2022YFA1405200), the National Natural Science Foundation
of China (Nos. 92265202), and the European Research Council (ERC CoG Q-ECHOS, 101001005).
article_number: '2200866'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Zhi Yuan
full_name: Fan, Zhi Yuan
last_name: Fan
- first_name: Liu
full_name: Qiu, Liu
id: 45e99c0d-1eb1-11eb-9b96-ed8ab2983cac
last_name: Qiu
orcid: 0000-0003-4345-4267
- first_name: Simon
full_name: Gröblacher, Simon
last_name: Gröblacher
- first_name: Jie
full_name: Li, Jie
last_name: Li
citation:
ama: Fan ZY, Qiu L, Gröblacher S, Li J. Microwave-optics entanglement via cavity
optomagnomechanics. Laser and Photonics Reviews. 2023;17(12). doi:10.1002/lpor.202200866
apa: Fan, Z. Y., Qiu, L., Gröblacher, S., & Li, J. (2023). Microwave-optics
entanglement via cavity optomagnomechanics. Laser and Photonics Reviews.
Wiley. https://doi.org/10.1002/lpor.202200866
chicago: Fan, Zhi Yuan, Liu Qiu, Simon Gröblacher, and Jie Li. “Microwave-Optics
Entanglement via Cavity Optomagnomechanics.” Laser and Photonics Reviews.
Wiley, 2023. https://doi.org/10.1002/lpor.202200866.
ieee: Z. Y. Fan, L. Qiu, S. Gröblacher, and J. Li, “Microwave-optics entanglement
via cavity optomagnomechanics,” Laser and Photonics Reviews, vol. 17, no.
12. Wiley, 2023.
ista: Fan ZY, Qiu L, Gröblacher S, Li J. 2023. Microwave-optics entanglement via
cavity optomagnomechanics. Laser and Photonics Reviews. 17(12), 2200866.
mla: Fan, Zhi Yuan, et al. “Microwave-Optics Entanglement via Cavity Optomagnomechanics.”
Laser and Photonics Reviews, vol. 17, no. 12, 2200866, Wiley, 2023, doi:10.1002/lpor.202200866.
short: Z.Y. Fan, L. Qiu, S. Gröblacher, J. Li, Laser and Photonics Reviews 17 (2023).
date_created: 2023-11-05T23:00:54Z
date_published: 2023-12-01T00:00:00Z
date_updated: 2025-09-09T13:13:18Z
day: '01'
department:
- _id: JoFi
doi: 10.1002/lpor.202200866
external_id:
arxiv:
- '2208.10703'
isi:
- '001088860000001'
intvolume: ' 17'
isi: 1
issue: '12'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2208.10703
month: '12'
oa: 1
oa_version: Preprint
publication: Laser and Photonics Reviews
publication_identifier:
eissn:
- 1863-8899
issn:
- 1863-8880
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Microwave-optics entanglement via cavity optomagnomechanics
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 17
year: '2023'
...
---
_id: '14494'
abstract:
- lang: eng
text: "We provide i) gridded initial conditions (.tif), ii) modeled gridded monthly
outputs (.tif), and iii) modeled hourly outputs at the station locations (.txt)
for the hydrological year 2019. Information about the variables and units can
be found in the figures (.png) associated to each dataset. Details about the datasets
can be found in the original publication by Buri and others (2023).\r\n\r\nBuri,
P., Fatichi, S., Shaw, T. E., Miles, E. S., McCarthy, M. J., Fyffe, C. L., ...
& Pellicciotti, F. (2023). Land Surface Modeling in the Himalayas: On the Importance
of Evaporative Fluxes for the Water Balance of a High‐Elevation Catchment. Water
Resources Research, 59(10), e2022WR033841. DOI: 10.1029/2022WR033841"
article_processing_charge: No
author:
- first_name: Pascal
full_name: Buri, Pascal
last_name: Buri
- first_name: Simone
full_name: Fatichi, Simone
last_name: Fatichi
- first_name: Thomas
full_name: Shaw, Thomas
id: 3caa3f91-1f03-11ee-96ce-e0e553054d6e
last_name: Shaw
orcid: 0000-0001-7640-6152
- 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: Catriona Louise
full_name: Fyffe, Catriona Louise
id: 001b0422-8d15-11ed-bc51-cab6c037a228
last_name: Fyffe
- first_name: Stefan
full_name: Fugger, Stefan
last_name: Fugger
- first_name: Shaoting
full_name: Ren, Shaoting
last_name: Ren
- first_name: Marin
full_name: Kneib, Marin
last_name: Kneib
- first_name: Achille
full_name: Jouberton, Achille
last_name: Jouberton
- first_name: Jakob
full_name: Steiner, Jakob
last_name: Steiner
- first_name: Koji
full_name: Fujita, Koji
last_name: Fujita
- first_name: Francesca
full_name: Pellicciotti, Francesca
id: b28f055a-81ea-11ed-b70c-a9fe7f7b0e70
last_name: Pellicciotti
orcid: 0000-0002-5554-8087
citation:
ama: 'Buri P, Fatichi S, Shaw T, et al. Model output data to “Land surface modeling
in the Himalayas: on the importance of evaporative fluxes for the water balance
of a high elevation catchment.” 2023. doi:10.5281/ZENODO.8402426'
apa: 'Buri, P., Fatichi, S., Shaw, T., Miles, E., McCarthy, M., Fyffe, C. L., …
Pellicciotti, F. (2023). Model output data to “Land surface modeling in the Himalayas:
on the importance of evaporative fluxes for the water balance of a high elevation
catchment.” Zenodo. https://doi.org/10.5281/ZENODO.8402426'
chicago: 'Buri, Pascal, Simone Fatichi, Thomas Shaw, Evan Miles, Michael McCarthy,
Catriona Louise Fyffe, Stefan Fugger, et al. “Model Output Data to ‘Land Surface
Modeling in the Himalayas: On the Importance of Evaporative Fluxes for the Water
Balance of a High Elevation Catchment.’” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8402426.'
ieee: 'P. Buri et al., “Model output data to ‘Land surface modeling in the
Himalayas: on the importance of evaporative fluxes for the water balance of a
high elevation catchment.’” Zenodo, 2023.'
ista: 'Buri P, Fatichi S, Shaw T, Miles E, McCarthy M, Fyffe CL, Fugger S, Ren S,
Kneib M, Jouberton A, Steiner J, Fujita K, Pellicciotti F. 2023. Model output
data to ‘Land surface modeling in the Himalayas: on the importance of evaporative
fluxes for the water balance of a high elevation catchment’, Zenodo, 10.5281/ZENODO.8402426.'
mla: 'Buri, Pascal, et al. Model Output Data to “Land Surface Modeling in the
Himalayas: On the Importance of Evaporative Fluxes for the Water Balance of a
High Elevation Catchment.” Zenodo, 2023, doi:10.5281/ZENODO.8402426.'
short: P. Buri, S. Fatichi, T. Shaw, E. Miles, M. McCarthy, C.L. Fyffe, S. Fugger,
S. Ren, M. Kneib, A. Jouberton, J. Steiner, K. Fujita, F. Pellicciotti, (2023).
date_created: 2023-11-07T08:01:39Z
date_published: 2023-10-03T00:00:00Z
date_updated: 2025-09-09T13:15:39Z
day: '03'
ddc:
- '550'
department:
- _id: FrPe
doi: 10.5281/ZENODO.8402426
has_accepted_license: '1'
main_file_link:
- open_access: '1'
url: https://10.5281/ZENODO.8402426
month: '10'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14487'
relation: used_in_publication
status: public
status: public
title: 'Model output data to "Land surface modeling in the Himalayas: on the importance
of evaporative fluxes for the water balance of a high elevation catchment"'
tmp:
image: /images/cc_0.png
legal_code_url: https://creativecommons.org/publicdomain/zero/1.0/legalcode
name: Creative Commons Public Domain Dedication (CC0 1.0)
short: CC0 (1.0)
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14499'
abstract:
- lang: eng
text: "An n-vertex graph is called C-Ramsey if it has no clique or independent set
of size Clog2n (i.e., if it has near-optimal Ramsey behavior). In this paper,
we study edge statistics in Ramsey graphs, in particular obtaining very precise
control of the distribution of the number of edges in a random vertex subset of
a C-Ramsey graph. This brings together two ongoing lines of research: the study
of ‘random-like’ properties of Ramsey graphs and the study of small-ball probability
for low-degree polynomials of independent random variables.\r\n\r\nThe proof proceeds
via an ‘additive structure’ dichotomy on the degree sequence and involves a wide
range of different tools from Fourier analysis, random matrix theory, the theory
of Boolean functions, probabilistic combinatorics and low-rank approximation.
In particular, a key ingredient is a new sharpened version of the quadratic Carbery–Wright
theorem on small-ball probability for polynomials of Gaussians, which we believe
is of independent interest. One of the consequences of our result is the resolution
of an old conjecture of Erdős and McKay, for which Erdős reiterated in several
of his open problem collections and for which he offered one of his notorious
monetary prizes."
acknowledgement: Kwan was supported for part of this work by ERC Starting Grant ‘RANDSTRUCT’
No. 101076777. Sah and Sawhney were supported by NSF Graduate Research Fellowship
Program DGE-2141064. Sah was supported by the PD Soros Fellowship. Sauermann was
supported by NSF Award DMS-2100157, and for part of this work by a Sloan Research
Fellowship.
article_number: e21
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- 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: Ashwin
full_name: Sah, Ashwin
last_name: Sah
- first_name: Lisa
full_name: Sauermann, Lisa
last_name: Sauermann
- first_name: Mehtaab
full_name: Sawhney, Mehtaab
last_name: Sawhney
citation:
ama: Kwan MA, Sah A, Sauermann L, Sawhney M. Anticoncentration in Ramsey graphs
and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 2023;11.
doi:10.1017/fmp.2023.17
apa: Kwan, M. A., Sah, A., Sauermann, L., & Sawhney, M. (2023). Anticoncentration
in Ramsey graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics,
Pi. Cambridge University Press. https://doi.org/10.1017/fmp.2023.17
chicago: Kwan, Matthew Alan, Ashwin Sah, Lisa Sauermann, and Mehtaab Sawhney. “Anticoncentration
in Ramsey Graphs and a Proof of the Erdős–McKay Conjecture.” Forum of Mathematics,
Pi. Cambridge University Press, 2023. https://doi.org/10.1017/fmp.2023.17.
ieee: M. A. Kwan, A. Sah, L. Sauermann, and M. Sawhney, “Anticoncentration in Ramsey
graphs and a proof of the Erdős–McKay conjecture,” Forum of Mathematics, Pi,
vol. 11. Cambridge University Press, 2023.
ista: Kwan MA, Sah A, Sauermann L, Sawhney M. 2023. Anticoncentration in Ramsey
graphs and a proof of the Erdős–McKay conjecture. Forum of Mathematics, Pi. 11,
e21.
mla: Kwan, Matthew Alan, et al. “Anticoncentration in Ramsey Graphs and a Proof
of the Erdős–McKay Conjecture.” Forum of Mathematics, Pi, vol. 11, e21,
Cambridge University Press, 2023, doi:10.1017/fmp.2023.17.
short: M.A. Kwan, A. Sah, L. Sauermann, M. Sawhney, Forum of Mathematics, Pi 11
(2023).
corr_author: '1'
date_created: 2023-11-07T09:02:48Z
date_published: 2023-08-24T00:00:00Z
date_updated: 2025-09-09T13:16:15Z
day: '24'
ddc:
- '510'
department:
- _id: MaKw
doi: 10.1017/fmp.2023.17
external_id:
arxiv:
- '2208.02874'
isi:
- '001123866200001'
file:
- access_level: open_access
checksum: 54b824098d59073cc87a308d458b0a3e
content_type: application/pdf
creator: dernst
date_created: 2023-11-07T09:16:23Z
date_updated: 2023-11-07T09:16:23Z
file_id: '14500'
file_name: 2023_ForumMathematics_Kwan.pdf
file_size: 1218719
relation: main_file
success: 1
file_date_updated: 2023-11-07T09:16:23Z
has_accepted_license: '1'
intvolume: ' 11'
isi: 1
keyword:
- Discrete Mathematics and Combinatorics
- Geometry and Topology
- Mathematical Physics
- Statistics and Probability
- Algebra and Number Theory
- Analysis
language:
- iso: eng
month: '08'
oa: 1
oa_version: Published Version
project:
- _id: bd95085b-d553-11ed-ba76-e55d3349be45
grant_number: '101076777'
name: Randomness and structure in combinatorics
publication: Forum of Mathematics, Pi
publication_identifier:
issn:
- 2050-5086
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anticoncentration in Ramsey graphs and a proof of the Erdős–McKay conjecture
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 11
year: '2023'
...
---
_id: '14502'
abstract:
- lang: eng
text: A precise quantitative description of the ultrastructural characteristics
underlying biological mechanisms is often key to their understanding. This is
particularly true for dynamic extra- and intracellular filamentous assemblies,
playing a role in cell motility, cell integrity, cytokinesis, tissue formation
and maintenance. For example, genetic manipulation or modulation of actin regulatory
proteins frequently manifests in changes of the morphology, dynamics, and ultrastructural
architecture of actin filament-rich cell peripheral structures, such as lamellipodia
or filopodia. However, the observed ultrastructural effects often remain subtle
and require sufficiently large datasets for appropriate quantitative analysis.
The acquisition of such large datasets has been enabled by recent advances in
high-throughput cryo-electron tomography (cryo-ET) methods. This also necessitates
the development of complementary approaches to maximize the extraction of relevant
biological information. We have developed a computational toolbox for the semi-automatic
quantification of segmented and vectorized fila- mentous networks from pre-processed
cryo-electron tomograms, facilitating the analysis and cross-comparison of multiple
experimental conditions. GUI-based components simplify the processing of data
and allow users to obtain a large number of ultrastructural parameters describing
filamentous assemblies. We demonstrate the feasibility of this workflow by analyzing
cryo-ET data of untreated and chemically perturbed branched actin filament networks
and that of parallel actin filament arrays. In principle, the computational toolbox
presented here is applicable for data analysis comprising any type of filaments
in regular (i.e. parallel) or random arrangement. We show that it can ease the
identification of key differences between experimental groups and facilitate the
in-depth analysis of ultrastructural data in a time-efficient manner.
author:
- first_name: Georgi A
full_name: Dimchev, Georgi A
id: 38C393BE-F248-11E8-B48F-1D18A9856A87
last_name: Dimchev
orcid: 0000-0001-8370-6161
- first_name: Behnam
full_name: Amiri, Behnam
last_name: Amiri
- first_name: Florian
full_name: Fäßler, Florian
id: 404F5528-F248-11E8-B48F-1D18A9856A87
last_name: Fäßler
orcid: 0000-0001-7149-769X
- first_name: Martin
full_name: Falcke, Martin
last_name: Falcke
- first_name: Florian KM
full_name: Schur, Florian KM
id: 48AD8942-F248-11E8-B48F-1D18A9856A87
last_name: Schur
orcid: 0000-0003-4790-8078
citation:
ama: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. Computational toolbox for
ultrastructural quantitative analysis of filament networks in cryo-ET data. 2023.
doi:10.15479/AT:ISTA:14502
apa: Dimchev, G. A., Amiri, B., Fäßler, F., Falcke, M., & Schur, F. K. (2023).
Computational toolbox for ultrastructural quantitative analysis of filament networks
in cryo-ET data. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:14502
chicago: Dimchev, Georgi A, Behnam Amiri, Florian Fäßler, Martin Falcke, and Florian
KM Schur. “Computational Toolbox for Ultrastructural Quantitative Analysis of
Filament Networks in Cryo-ET Data.” Institute of Science and Technology Austria,
2023. https://doi.org/10.15479/AT:ISTA:14502.
ieee: G. A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, and F. K. Schur, “Computational
toolbox for ultrastructural quantitative analysis of filament networks in cryo-ET
data.” Institute of Science and Technology Austria, 2023.
ista: Dimchev GA, Amiri B, Fäßler F, Falcke M, Schur FK. 2023. Computational toolbox
for ultrastructural quantitative analysis of filament networks in cryo-ET data,
Institute of Science and Technology Austria, 10.15479/AT:ISTA:14502.
mla: Dimchev, Georgi A., et al. Computational Toolbox for Ultrastructural Quantitative
Analysis of Filament Networks in Cryo-ET Data. Institute of Science and Technology
Austria, 2023, doi:10.15479/AT:ISTA:14502.
short: G.A. Dimchev, B. Amiri, F. Fäßler, M. Falcke, F.K. Schur, (2023).
corr_author: '1'
date_created: 2023-11-08T19:40:54Z
date_published: 2023-11-21T00:00:00Z
date_updated: 2025-04-15T08:25:41Z
day: '21'
ddc:
- '570'
department:
- _id: FlSc
doi: 10.15479/AT:ISTA:14502
file:
- access_level: open_access
checksum: a8b9adeb53a4109dea4d5e39fa1acccf
content_type: application/zip
creator: fschur
date_created: 2023-11-08T20:23:07Z
date_updated: 2023-11-08T20:23:07Z
file_id: '14503'
file_name: Computational_Toolbox_v1.2.zip
file_size: 347641117
relation: main_file
success: 1
- access_level: open_access
checksum: 14db2addbfca61a085ba301ed6f2900b
content_type: text/plain
creator: dernst
date_created: 2023-11-21T08:20:23Z
date_updated: 2023-11-21T08:20:23Z
file_id: '14586'
file_name: Readme.txt
file_size: 1522
relation: main_file
success: 1
file_date_updated: 2023-11-21T08:20:23Z
has_accepted_license: '1'
keyword:
- cryo-electron tomography
- actin cytoskeleton
- toolbox
license: https://choosealicense.com/licenses/agpl-3.0/
month: '11'
oa: 1
project:
- _id: 9B954C5C-BA93-11EA-9121-9846C619BF3A
grant_number: P33367
name: Structure and isoform diversity of the Arp2/3 complex
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10290'
relation: used_for_analysis_in
status: public
status: public
title: Computational toolbox for ultrastructural quantitative analysis of filament
networks in cryo-ET data
tmp:
legal_code_url: https://www.gnu.org/licenses/agpl-3.0.html
name: GNU Affero General Public License v3.0
short: 'GNU AGPLv3 '
type: software
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14513'
abstract:
- lang: eng
text: Cold atomic gases have become a paradigmatic system for exploring fundamental
physics, which at the same time allows for applications in quantum technologies.
The accelerating developments in the field have led to a highly advanced set of
engineering techniques that, for example, can tune interactions, shape the external
geometry, select among a large set of atomic species with different properties,
or control the number of atoms. In particular, it is possible to operate in lower
dimensions and drive atomic systems into the strongly correlated regime. In this
review, we discuss recent advances in few-body cold atom systems confined in low
dimensions from a theoretical viewpoint. We mainly focus on bosonic systems in
one dimension and provide an introduction to the static properties before we review
the state-of-the-art research into quantum dynamical processes stimulated by the
presence of correlations. Besides discussing the fundamental physical phenomena
arising in these systems, we also provide an overview of the calculational and
numerical tools and methods that are commonly used, thus delivering a balanced
and comprehensive overview of the field. We conclude by giving an outlook on possible
future directions that are interesting to explore in these correlated systems.
acknowledgement: This review could not have been written without the many fruitful
discussions and great collaborations with colleagues throughout the years, there
are too many to mention. Here we acknowledge conversations regarding the context
of the review with Joachim Brand, Fabian Brauneis, Adolfo del Campo, Alberto Cappellaro,
Panagiotis Giannakeas, Tommaso Macrí, Oleksandr Marchukov, Lukas Rammelmüller and
Manuel Valiente. S. I. M. acknowledges support from the NSF through a grant for
ITAMP at Harvard University. T.F. acknowledges support from JSPS KAKENHI Grant Number
JP23K03290 and T.F. and Th.B. acknowledge support from the Okinawa Institute for
Science and Technology Graduate University, and JST Grant Number JPMJPF2221. A.F.
and R. E. B. acknowledge support from CNPq (Conselho Nacional de Desenvolvimento
Científico e Tecnológico) - Edital Universal 406563/2021-7. A. G. V. acknowledges
support by European Union’s Horizon 2020 research and innovation programme under
the Marie Skłodowska-Curie Grant Agreement No. 754411. P. S. is supported by the
Cluster of Excellence ‘Advanced Imaging of Matter’ of the Deutsche Forschungsgemeinschaft
(DFG) - EXC2056 - project ID 390715994. N. T. Z. is partially supported by the Independent
Research Fund Denmark .
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: S. I.
full_name: Mistakidis, S. I.
last_name: Mistakidis
- first_name: Artem
full_name: Volosniev, Artem
id: 37D278BC-F248-11E8-B48F-1D18A9856A87
last_name: Volosniev
orcid: 0000-0003-0393-5525
- first_name: R. E.
full_name: Barfknecht, R. E.
last_name: Barfknecht
- first_name: T.
full_name: Fogarty, T.
last_name: Fogarty
- first_name: Th
full_name: Busch, Th
last_name: Busch
- first_name: A.
full_name: Foerster, A.
last_name: Foerster
- first_name: P.
full_name: Schmelcher, P.
last_name: Schmelcher
- first_name: N. T.
full_name: Zinner, N. T.
last_name: Zinner
citation:
ama: Mistakidis SI, Volosniev A, Barfknecht RE, et al. Few-body Bose gases in low
dimensions - A laboratory for quantum dynamics. Physics Reports. 2023;1042:1-108.
doi:10.1016/j.physrep.2023.10.004
apa: Mistakidis, S. I., Volosniev, A., Barfknecht, R. E., Fogarty, T., Busch, T.,
Foerster, A., … Zinner, N. T. (2023). Few-body Bose gases in low dimensions -
A laboratory for quantum dynamics. Physics Reports. Elsevier. https://doi.org/10.1016/j.physrep.2023.10.004
chicago: Mistakidis, S. I., Artem Volosniev, R. E. Barfknecht, T. Fogarty, Th Busch,
A. Foerster, P. Schmelcher, and N. T. Zinner. “Few-Body Bose Gases in Low Dimensions
- A Laboratory for Quantum Dynamics.” Physics Reports. Elsevier, 2023.
https://doi.org/10.1016/j.physrep.2023.10.004.
ieee: S. I. Mistakidis et al., “Few-body Bose gases in low dimensions - A
laboratory for quantum dynamics,” Physics Reports, vol. 1042. Elsevier,
pp. 1–108, 2023.
ista: Mistakidis SI, Volosniev A, Barfknecht RE, Fogarty T, Busch T, Foerster A,
Schmelcher P, Zinner NT. 2023. Few-body Bose gases in low dimensions - A laboratory
for quantum dynamics. Physics Reports. 1042, 1–108.
mla: Mistakidis, S. I., et al. “Few-Body Bose Gases in Low Dimensions - A Laboratory
for Quantum Dynamics.” Physics Reports, vol. 1042, Elsevier, 2023, pp.
1–108, doi:10.1016/j.physrep.2023.10.004.
short: S.I. Mistakidis, A. Volosniev, R.E. Barfknecht, T. Fogarty, T. Busch, A.
Foerster, P. Schmelcher, N.T. Zinner, Physics Reports 1042 (2023) 1–108.
date_created: 2023-11-12T23:00:54Z
date_published: 2023-11-29T00:00:00Z
date_updated: 2025-09-09T13:16:58Z
day: '29'
department:
- _id: MiLe
doi: 10.1016/j.physrep.2023.10.004
ec_funded: 1
external_id:
arxiv:
- '2202.11071'
isi:
- '001109871200001'
intvolume: ' 1042'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2202.11071
month: '11'
oa: 1
oa_version: Preprint
page: 1-108
project:
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
publication: Physics Reports
publication_identifier:
issn:
- 0370-1573
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Few-body Bose gases in low dimensions - A laboratory for quantum dynamics
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 1042
year: '2023'
...
---
_id: '14514'
abstract:
- lang: eng
text: 'The elastic Leidenfrost effect occurs when a vaporizable soft solid is lowered
onto a hot surface. Evaporative flow couples to elastic deformation, giving spontaneous
bouncing or steady-state floating. The effect embodies an unexplored interplay
between thermodynamics, elasticity, and lubrication: despite being observed, its
basic theoretical description remains a challenge. Here, we provide a theory of
elastic Leidenfrost floating. As weight increases, a rigid solid sits closer to
the hot surface. By contrast, we discover an elasticity-dominated regime where
the heavier the solid, the higher it floats. This geometry-governed behavior is
reminiscent of the dynamics of large liquid Leidenfrost drops. We show that this
elastic regime is characterized by Hertzian behavior of the solid’s underbelly
and derive how the float height scales with materials parameters. Introducing
a dimensionless elastic Leidenfrost number, we capture the crossover between rigid
and Hertzian behavior. Our results provide theoretical underpinning for recent
experiments, and point to the design of novel soft machines.'
acknowledgement: "We are grateful to Dominic Vella, Jens Eggers, John Kolinski, Joshua
Dijksman, and Daniel Bonn for insightful discussions. J. B. and A. S. acknowledge
the support of the Engineering and Physical Sciences Research Council (EPSRC) through
New Investigator Award No. EP/\r\nT000961/1. A. S. acknowledges the support of Royal
Society under Grant No. RGS/R2/202135. J. E. S. acknowledges EPSRC Grants No. EP/N016602/1,
EP/S022848/1, EP/S029966/1, and EP/P031684/1."
article_number: '168201'
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jack
full_name: Binysh, Jack
last_name: Binysh
- first_name: Indrajit
full_name: Chakraborty, Indrajit
last_name: Chakraborty
- first_name: Mykyta V.
full_name: Chubynsky, Mykyta V.
last_name: Chubynsky
- first_name: Vicente L
full_name: Diaz Melian, Vicente L
id: b6798902-eea0-11ea-9cbc-a8e14286c631
last_name: Diaz Melian
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: James E.
full_name: Sprittles, James E.
last_name: Sprittles
- first_name: Anton
full_name: Souslov, Anton
last_name: Souslov
citation:
ama: Binysh J, Chakraborty I, Chubynsky MV, et al. Modeling Leidenfrost levitation
of soft elastic solids. Physical Review Letters. 2023;131(16). doi:10.1103/PhysRevLett.131.168201
apa: Binysh, J., Chakraborty, I., Chubynsky, M. V., Diaz Melian, V. L., Waitukaitis,
S. R., Sprittles, J. E., & Souslov, A. (2023). Modeling Leidenfrost levitation
of soft elastic solids. Physical Review Letters. American Physical Society.
https://doi.org/10.1103/PhysRevLett.131.168201
chicago: Binysh, Jack, Indrajit Chakraborty, Mykyta V. Chubynsky, Vicente L Diaz
Melian, Scott R Waitukaitis, James E. Sprittles, and Anton Souslov. “Modeling
Leidenfrost Levitation of Soft Elastic Solids.” Physical Review Letters.
American Physical Society, 2023. https://doi.org/10.1103/PhysRevLett.131.168201.
ieee: J. Binysh et al., “Modeling Leidenfrost levitation of soft elastic
solids,” Physical Review Letters, vol. 131, no. 16. American Physical Society,
2023.
ista: Binysh J, Chakraborty I, Chubynsky MV, Diaz Melian VL, Waitukaitis SR, Sprittles
JE, Souslov A. 2023. Modeling Leidenfrost levitation of soft elastic solids. Physical
Review Letters. 131(16), 168201.
mla: Binysh, Jack, et al. “Modeling Leidenfrost Levitation of Soft Elastic Solids.”
Physical Review Letters, vol. 131, no. 16, 168201, American Physical Society,
2023, doi:10.1103/PhysRevLett.131.168201.
short: J. Binysh, I. Chakraborty, M.V. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis,
J.E. Sprittles, A. Souslov, Physical Review Letters 131 (2023).
date_created: 2023-11-12T23:00:55Z
date_published: 2023-10-20T00:00:00Z
date_updated: 2025-09-09T13:19:07Z
day: '20'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1103/PhysRevLett.131.168201
external_id:
isi:
- '001164388300007'
pmid:
- '37925690'
file:
- access_level: open_access
checksum: 1a419e25b762aadffbcc8eb2e609bd97
content_type: application/pdf
creator: dernst
date_created: 2023-11-13T09:12:58Z
date_updated: 2023-11-13T09:12:58Z
file_id: '14524'
file_name: 2023_PhysRevLetters_Binysh.pdf
file_size: 724098
relation: main_file
success: 1
file_date_updated: 2023-11-13T09:12:58Z
has_accepted_license: '1'
intvolume: ' 131'
isi: 1
issue: '16'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
pmid: 1
publication: Physical Review Letters
publication_identifier:
eissn:
- 1079-7114
issn:
- 0031-9007
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '14523'
relation: research_data
status: public
scopus_import: '1'
status: public
title: Modeling Leidenfrost levitation of soft elastic solids
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 131
year: '2023'
...
---
_id: '14515'
abstract:
- lang: eng
text: Most natural and engineered information-processing systems transmit information
via signals that vary in time. Computing the information transmission rate or
the information encoded in the temporal characteristics of these signals requires
the mutual information between the input and output signals as a function of time,
i.e., between the input and output trajectories. Yet, this is notoriously difficult
because of the high-dimensional nature of the trajectory space, and all existing
techniques require approximations. We present an exact Monte Carlo technique called
path weight sampling (PWS) that, for the first time, makes it possible to compute
the mutual information between input and output trajectories for any stochastic
system that is described by a master equation. The principal idea is to use the
master equation to evaluate the exact conditional probability of an individual
output trajectory for a given input trajectory and average this via Monte Carlo
sampling in trajectory space to obtain the mutual information. We present three
variants of PWS, which all generate the trajectories using the standard stochastic
simulation algorithm. While direct PWS is a brute-force method, Rosenbluth-Rosenbluth
PWS exploits the analogy between signal trajectory sampling and polymer sampling,
and thermodynamic integration PWS is based on a reversible work calculation in
trajectory space. PWS also makes it possible to compute the mutual information
between input and output trajectories for systems with hidden internal states
as well as systems with feedback from output to input. Applying PWS to the bacterial
chemotaxis system, consisting of 182 coupled chemical reactions, demonstrates
not only that the scheme is highly efficient but also that the number of receptor
clusters is much smaller than hitherto believed, while their size is much larger.
acknowledgement: "We thank Bela Mulder, Tom Shimizu, Fotios Avgidis, Peter Bolhuis,
and Daan Frenkel for useful discussions and a careful reading of the manuscript,
and we thank Age Tjalma for support with obtaining the Gaussian approximation of
the chemotaxis system. This work is part of the Dutch Research Council (NWO) and
was performed at the research institute AMOLF. This project has received funding
from the European Research Council (ERC) under the European Union’s Horizon 2020
research and innovation program (Grant Agreement No. 885065) and was\r\nfinancially
supported by NWO through the “Building a Synthetic Cell (BaSyC)” Gravitation Grant
(024.003.019)."
article_number: '041017'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Manuel
full_name: Reinhardt, Manuel
last_name: Reinhardt
- first_name: Gašper
full_name: Tkačik, Gašper
id: 3D494DCA-F248-11E8-B48F-1D18A9856A87
last_name: Tkačik
orcid: 0000-0002-6699-1455
- first_name: Pieter Rein
full_name: Ten Wolde, Pieter Rein
last_name: Ten Wolde
citation:
ama: 'Reinhardt M, Tkačik G, Ten Wolde PR. Path weight sampling: Exact Monte Carlo
computation of the mutual information between stochastic trajectories. Physical
Review X. 2023;13(4). doi:10.1103/PhysRevX.13.041017'
apa: 'Reinhardt, M., Tkačik, G., & Ten Wolde, P. R. (2023). Path weight sampling:
Exact Monte Carlo computation of the mutual information between stochastic trajectories.
Physical Review X. American Physical Society. https://doi.org/10.1103/PhysRevX.13.041017'
chicago: 'Reinhardt, Manuel, Gašper Tkačik, and Pieter Rein Ten Wolde. “Path Weight
Sampling: Exact Monte Carlo Computation of the Mutual Information between Stochastic
Trajectories.” Physical Review X. American Physical Society, 2023. https://doi.org/10.1103/PhysRevX.13.041017.'
ieee: 'M. Reinhardt, G. Tkačik, and P. R. Ten Wolde, “Path weight sampling: Exact
Monte Carlo computation of the mutual information between stochastic trajectories,”
Physical Review X, vol. 13, no. 4. American Physical Society, 2023.'
ista: 'Reinhardt M, Tkačik G, Ten Wolde PR. 2023. Path weight sampling: Exact Monte
Carlo computation of the mutual information between stochastic trajectories. Physical
Review X. 13(4), 041017.'
mla: 'Reinhardt, Manuel, et al. “Path Weight Sampling: Exact Monte Carlo Computation
of the Mutual Information between Stochastic Trajectories.” Physical Review
X, vol. 13, no. 4, 041017, American Physical Society, 2023, doi:10.1103/PhysRevX.13.041017.'
short: M. Reinhardt, G. Tkačik, P.R. Ten Wolde, Physical Review X 13 (2023).
date_created: 2023-11-12T23:00:55Z
date_published: 2023-10-26T00:00:00Z
date_updated: 2025-09-09T13:18:24Z
day: '26'
ddc:
- '530'
department:
- _id: GaTk
doi: 10.1103/PhysRevX.13.041017
external_id:
arxiv:
- '2203.03461'
isi:
- '001122894200001'
file:
- access_level: open_access
checksum: 32574aeebcca7347a4152c611b66b3d5
content_type: application/pdf
creator: dernst
date_created: 2023-11-13T09:00:19Z
date_updated: 2023-11-13T09:00:19Z
file_id: '14522'
file_name: 2023_PhysReviewX_Reinhardt.pdf
file_size: 1595223
relation: main_file
success: 1
file_date_updated: 2023-11-13T09:00:19Z
has_accepted_license: '1'
intvolume: ' 13'
isi: 1
issue: '4'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
publication: Physical Review X
publication_identifier:
eissn:
- 2160-3308
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Path weight sampling: Exact Monte Carlo computation of the mutual information
between stochastic trajectories'
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 13
year: '2023'
...
---
_id: '14516'
abstract:
- lang: eng
text: 'We revisit decentralized random beacons with a focus on practical distributed
applications. Decentralized random beacons (Beaver and So, Eurocrypt''93) provide
the functionality for n parties to generate an unpredictable sequence of bits
in a way that cannot be biased, which is useful for any decentralized protocol
requiring trusted randomness. Existing beacon constructions are highly inefficient
in practical settings where protocol parties need to rejoin after crashes or disconnections,
and more significantly where smart contracts may rely on arbitrary index points
in high-volume streams. For this, we introduce a new notion of history-generating
decentralized random beacons (HGDRBs). Roughly, the history-generation property
of HGDRBs allows for previous beacon outputs to be efficiently generated knowing
only the current value and the public key. At application layers, history-generation
supports registering a sparser set of on-chain values if desired, so that apps
like lotteries can utilize on-chain values without incurring high-frequency costs,
enjoying all the benefits of DRBs implemented off-chain or with decoupled, special-purpose
chains. Unlike rollups, HG is tailored specifically to recovering and verifying
pseudorandom bit sequences and thus enjoys unique optimizations investigated in
this work. We introduce STROBE: an efficient HGDRB construction which generalizes
the original squaring-based RSA approach of Beaver and So. STROBE enjoys several
useful properties that make it suited for practical applications that use beacons:
1) history-generating: it can regenerate and verify high-throughput beacon streams,
supporting sparse (thus cost-effective) ledger entries; 2) concisely self-verifying:
NIZK-free, with state and validation employing a single ring element; 3) eco-friendly:
stake-based rather than work based; 4) unbounded: refresh-free, addressing limitations
of Beaver and So; 5) delay-free: results are immediately available. 6) storage-efficient:
the last beacon suffices to derive all past outputs, thus O(1) storage requirements
for nodes serving the whole history.'
acknowledgement: Work done when all the authors were at Novi Research, Meta.
alternative_title:
- LIPIcs
article_number: '7'
article_processing_charge: Yes
author:
- first_name: Donald
full_name: Beaver, Donald
last_name: Beaver
- first_name: Mahimna
full_name: Kelkar, Mahimna
last_name: Kelkar
- first_name: Kevin
full_name: Lewi, Kevin
last_name: Lewi
- first_name: Valeria
full_name: Nikolaenko, Valeria
last_name: Nikolaenko
- first_name: Alberto
full_name: Sonnino, Alberto
last_name: Sonnino
- first_name: Konstantinos
full_name: Chalkias, Konstantinos
last_name: Chalkias
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Ladi De
full_name: Naurois, Ladi De
last_name: Naurois
- first_name: Arnab
full_name: Roy, Arnab
last_name: Roy
citation:
ama: 'Beaver D, Kelkar M, Lewi K, et al. STROBE: Streaming Threshold Random Beacons.
In: 5th Conference on Advances in Financial Technologies. Vol 282. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.AFT.2023.7'
apa: 'Beaver, D., Kelkar, M., Lewi, K., Nikolaenko, V., Sonnino, A., Chalkias, K.,
… Roy, A. (2023). STROBE: Streaming Threshold Random Beacons. In 5th Conference
on Advances in Financial Technologies (Vol. 282). Princeton, NJ, United States:
Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.AFT.2023.7'
chicago: 'Beaver, Donald, Mahimna Kelkar, Kevin Lewi, Valeria Nikolaenko, Alberto
Sonnino, Konstantinos Chalkias, Eleftherios Kokoris Kogias, Ladi De Naurois, and
Arnab Roy. “STROBE: Streaming Threshold Random Beacons.” In 5th Conference
on Advances in Financial Technologies, Vol. 282. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2023. https://doi.org/10.4230/LIPIcs.AFT.2023.7.'
ieee: 'D. Beaver et al., “STROBE: Streaming Threshold Random Beacons,” in
5th Conference on Advances in Financial Technologies, Princeton, NJ, United
States, 2023, vol. 282.'
ista: 'Beaver D, Kelkar M, Lewi K, Nikolaenko V, Sonnino A, Chalkias K, Kokoris
Kogias E, Naurois LD, Roy A. 2023. STROBE: Streaming Threshold Random Beacons.
5th Conference on Advances in Financial Technologies. AFT: Conference on Advances
in Financial Technologies, LIPIcs, vol. 282, 7.'
mla: 'Beaver, Donald, et al. “STROBE: Streaming Threshold Random Beacons.” 5th
Conference on Advances in Financial Technologies, vol. 282, 7, Schloss Dagstuhl
- Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.AFT.2023.7.'
short: D. Beaver, M. Kelkar, K. Lewi, V. Nikolaenko, A. Sonnino, K. Chalkias, E.
Kokoris Kogias, L.D. Naurois, A. Roy, in:, 5th Conference on Advances in Financial
Technologies, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.
conference:
end_date: 2023-10-25
location: Princeton, NJ, United States
name: 'AFT: Conference on Advances in Financial Technologies'
start_date: 2023-10-23
corr_author: '1'
date_created: 2023-11-12T23:00:55Z
date_published: 2023-10-01T00:00:00Z
date_updated: 2024-10-09T21:07:17Z
day: '01'
ddc:
- '000'
department:
- _id: ElKo
doi: 10.4230/LIPIcs.AFT.2023.7
file:
- access_level: open_access
checksum: c1f98831cb5149d6c030c41999e6e960
content_type: application/pdf
creator: dernst
date_created: 2023-11-13T08:44:34Z
date_updated: 2023-11-13T08:44:34Z
file_id: '14521'
file_name: 2023_LIPIcs_Beaver.pdf
file_size: 793495
relation: main_file
success: 1
file_date_updated: 2023-11-13T08:44:34Z
has_accepted_license: '1'
intvolume: ' 282'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://eprint.iacr.org/2021/1643
month: '10'
oa: 1
oa_version: Published Version
publication: 5th Conference on Advances in Financial Technologies
publication_identifier:
isbn:
- '9783959773034'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'STROBE: Streaming Threshold Random Beacons'
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: 282
year: '2023'
...
---
_id: '14518'
abstract:
- lang: eng
text: We consider bidding games, a class of two-player zero-sum graph games. The
game proceeds as follows. Both players have bounded budgets. A token is placed
on a vertex of a graph, in each turn the players simultaneously submit bids, and
the higher bidder moves the token, where we break bidding ties in favor of Player
1. Player 1 wins the game iff the token visits a designated target vertex. We
consider, for the first time, poorman discrete-bidding in which the granularity
of the bids is restricted and the higher bid is paid to the bank. Previous work
either did not impose granularity restrictions or considered Richman bidding (bids
are paid to the opponent). While the latter mechanisms are technically more accessible,
the former is more appealing from a practical standpoint. Our study focuses on
threshold budgets, which is the necessary and sufficient initial budget required
for Player 1 to ensure winning against a given Player 2 budget. We first show
existence of thresholds. In DAGs, we show that threshold budgets can be approximated
with error bounds by thresholds under continuous-bidding and that they exhibit
a periodic behavior. We identify closed-form solutions in special cases. We implement
and experiment with an algorithm to find threshold budgets.
acknowledgement: This research was supported in part by ISF grant no. 1679/21, ERC
CoG 863818 (FoRM-SMArt) and the European Union’s Horizon 2020 research and innovation
programme under the Marie SkłodowskaCurie Grant Agreement No. 665385.
article_processing_charge: No
arxiv: 1
author:
- first_name: Guy
full_name: Avni, Guy
id: 463C8BC2-F248-11E8-B48F-1D18A9856A87
last_name: Avni
orcid: 0000-0001-5588-8287
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Suman
full_name: Sadhukhan, Suman
last_name: Sadhukhan
- first_name: Josef
full_name: Tkadlec, Josef
id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87
last_name: Tkadlec
orcid: 0000-0002-1097-9684
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: 'Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. Reachability poorman
discrete-bidding games. In: Frontiers in Artificial Intelligence and Applications.
Vol 372. IOS Press; 2023:141-148. doi:10.3233/FAIA230264'
apa: 'Avni, G., Meggendorfer, T., Sadhukhan, S., Tkadlec, J., & Zikelic, D.
(2023). Reachability poorman discrete-bidding games. In Frontiers in Artificial
Intelligence and Applications (Vol. 372, pp. 141–148). Krakow, Poland: IOS
Press. https://doi.org/10.3233/FAIA230264'
chicago: Avni, Guy, Tobias Meggendorfer, Suman Sadhukhan, Josef Tkadlec, and Dorde
Zikelic. “Reachability Poorman Discrete-Bidding Games.” In Frontiers in Artificial
Intelligence and Applications, 372:141–48. IOS Press, 2023. https://doi.org/10.3233/FAIA230264.
ieee: G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, and D. Zikelic, “Reachability
poorman discrete-bidding games,” in Frontiers in Artificial Intelligence and
Applications, Krakow, Poland, 2023, vol. 372, pp. 141–148.
ista: 'Avni G, Meggendorfer T, Sadhukhan S, Tkadlec J, Zikelic D. 2023. Reachability
poorman discrete-bidding games. Frontiers in Artificial Intelligence and Applications.
ECAI: European Conference on Artificial Intelligence vol. 372, 141–148.'
mla: Avni, Guy, et al. “Reachability Poorman Discrete-Bidding Games.” Frontiers
in Artificial Intelligence and Applications, vol. 372, IOS Press, 2023, pp.
141–48, doi:10.3233/FAIA230264.
short: G. Avni, T. Meggendorfer, S. Sadhukhan, J. Tkadlec, D. Zikelic, in:, Frontiers
in Artificial Intelligence and Applications, IOS Press, 2023, pp. 141–148.
conference:
end_date: 2023-10-04
location: Krakow, Poland
name: 'ECAI: European Conference on Artificial Intelligence'
start_date: 2023-09-30
corr_author: '1'
date_created: 2023-11-12T23:00:56Z
date_published: 2023-09-28T00:00:00Z
date_updated: 2025-03-31T16:01:09Z
day: '28'
ddc:
- '000'
department:
- _id: ToHe
- _id: KrCh
doi: 10.3233/FAIA230264
ec_funded: 1
external_id:
arxiv:
- '2307.15218'
file:
- access_level: open_access
checksum: 1390ca38480fa4cf286b0f1a42e8c12f
content_type: application/pdf
creator: dernst
date_created: 2023-11-13T10:16:10Z
date_updated: 2023-11-13T10:16:10Z
file_id: '14529'
file_name: 2023_FAIA_Avni.pdf
file_size: 501011
relation: main_file
success: 1
file_date_updated: 2023-11-13T10:16:10Z
has_accepted_license: '1'
intvolume: ' 372'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: 141-148
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Frontiers in Artificial Intelligence and Applications
publication_identifier:
isbn:
- '9781643684369'
issn:
- 0922-6389
publication_status: published
publisher: IOS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Reachability poorman discrete-bidding games
tmp:
image: /images/cc_by_nc.png
legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode
name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)
short: CC BY-NC (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 372
year: '2023'
...
---
_id: '14523'
abstract:
- lang: eng
text: see Readme file
article_processing_charge: No
author:
- first_name: Jack
full_name: Binysh, Jack
last_name: Binysh
- first_name: Indrajit
full_name: Chakraborty, Indrajit
last_name: Chakraborty
- first_name: Mykyta
full_name: Chubynsky, Mykyta
last_name: Chubynsky
- first_name: Vicente L
full_name: Diaz Melian, Vicente L
id: b6798902-eea0-11ea-9cbc-a8e14286c631
last_name: Diaz Melian
- first_name: Scott R
full_name: Waitukaitis, Scott R
id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
last_name: Waitukaitis
orcid: 0000-0002-2299-3176
- first_name: James
full_name: Sprittles, James
last_name: Sprittles
- first_name: Anton
full_name: Souslov, Anton
last_name: Souslov
citation:
ama: 'Binysh J, Chakraborty I, Chubynsky M, et al. SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
v1.0.1. 2023. doi:10.5281/ZENODO.8329143'
apa: 'Binysh, J., Chakraborty, I., Chubynsky, M., Diaz Melian, V. L., Waitukaitis,
S. R., Sprittles, J., & Souslov, A. (2023). SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
v1.0.1. Zenodo. https://doi.org/10.5281/ZENODO.8329143'
chicago: 'Binysh, Jack, Indrajit Chakraborty, Mykyta Chubynsky, Vicente L Diaz Melian,
Scott R Waitukaitis, James Sprittles, and Anton Souslov. “SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
V1.0.1.” Zenodo, 2023. https://doi.org/10.5281/ZENODO.8329143.'
ieee: 'J. Binysh et al., “SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
v1.0.1.” Zenodo, 2023.'
ista: 'Binysh J, Chakraborty I, Chubynsky M, Diaz Melian VL, Waitukaitis SR, Sprittles
J, Souslov A. 2023. SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
v1.0.1, Zenodo, 10.5281/ZENODO.8329143.'
mla: 'Binysh, Jack, et al. SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids:
V1.0.1. Zenodo, 2023, doi:10.5281/ZENODO.8329143.'
short: J. Binysh, I. Chakraborty, M. Chubynsky, V.L. Diaz Melian, S.R. Waitukaitis,
J. Sprittles, A. Souslov, (2023).
date_created: 2023-11-13T09:12:11Z
date_published: 2023-09-08T00:00:00Z
date_updated: 2025-09-09T13:19:07Z
day: '08'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.5281/ZENODO.8329143
main_file_link:
- open_access: '1'
url: https://doi.org/10.5281/ZENODO.8329143
month: '09'
oa: 1
oa_version: Published Version
publisher: Zenodo
related_material:
record:
- id: '14514'
relation: used_in_publication
status: public
status: public
title: 'SouslovLab/PRL2023-ModellingLeidenfrostLevitationofSoftElasticSolids: v1.0.1'
type: research_data_reference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2023'
...
---
_id: '14551'
abstract:
- lang: eng
text: Methylation of CG dinucleotides (mCGs), which regulates eukaryotic genome
functions, is epigenetically propagated by Dnmt1/MET1 methyltransferases. How
mCG is established and transmitted across generations despite imperfect enzyme
fidelity is unclear. Whether mCG variation in natural populations is governed
by genetic or epigenetic inheritance also remains mysterious. Here, we show that
MET1 de novo activity, which is enhanced by existing proximate methylation, seeds
and stabilizes mCG in Arabidopsis thaliana genes. MET1 activity is restricted
by active demethylation and suppressed by histone variant H2A.Z, producing localized
mCG patterns. Based on these observations, we develop a stochastic mathematical
model that precisely recapitulates mCG inheritance dynamics and predicts intragenic
mCG patterns and their population-scale variation given only CG site spacing.
Our results demonstrate that intragenic mCG establishment, inheritance, and variance
constitute a unified epigenetic process, revealing that intragenic mCG undergoes
large, millennia-long epigenetic fluctuations and can therefore mediate evolution
on this timescale.
acknowledgement: We would like to thank Xiaoqi Feng, Ander Movilla Miangolarra, and
Suzanne de Bruijn for discussions. This work was supported by BBSRC Institute Strategic
Programme GEN (BB/P013511/1) to M.H. and D.Z. and by a European Research Council
grant MaintainMeth (725746) to D.Z.
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Amy
full_name: Briffa, Amy
last_name: Briffa
- first_name: Elizabeth
full_name: Hollwey, Elizabeth
id: b8c4f54b-e484-11eb-8fdc-a54df64ef6dd
last_name: Hollwey
- first_name: Zaigham
full_name: Shahzad, Zaigham
last_name: Shahzad
- first_name: Jonathan D.
full_name: Moore, Jonathan D.
last_name: Moore
- first_name: David B.
full_name: Lyons, David B.
last_name: Lyons
- first_name: Martin
full_name: Howard, Martin
last_name: Howard
- first_name: Daniel
full_name: Zilberman, Daniel
id: 6973db13-dd5f-11ea-814e-b3e5455e9ed1
last_name: Zilberman
orcid: 0000-0002-0123-8649
citation:
ama: Briffa A, Hollwey E, Shahzad Z, et al. Millennia-long epigenetic fluctuations
generate intragenic DNA methylation variance in Arabidopsis populations. Cell
Systems. 2023;14(11):953-967. doi:10.1016/j.cels.2023.10.007
apa: Briffa, A., Hollwey, E., Shahzad, Z., Moore, J. D., Lyons, D. B., Howard, M.,
& Zilberman, D. (2023). Millennia-long epigenetic fluctuations generate intragenic
DNA methylation variance in Arabidopsis populations. Cell Systems. Elsevier.
https://doi.org/10.1016/j.cels.2023.10.007
chicago: Briffa, Amy, Elizabeth Hollwey, Zaigham Shahzad, Jonathan D. Moore, David
B. Lyons, Martin Howard, and Daniel Zilberman. “Millennia-Long Epigenetic Fluctuations
Generate Intragenic DNA Methylation Variance in Arabidopsis Populations.” Cell
Systems. Elsevier, 2023. https://doi.org/10.1016/j.cels.2023.10.007.
ieee: A. Briffa et al., “Millennia-long epigenetic fluctuations generate
intragenic DNA methylation variance in Arabidopsis populations,” Cell Systems,
vol. 14, no. 11. Elsevier, pp. 953–967, 2023.
ista: Briffa A, Hollwey E, Shahzad Z, Moore JD, Lyons DB, Howard M, Zilberman D.
2023. Millennia-long epigenetic fluctuations generate intragenic DNA methylation
variance in Arabidopsis populations. Cell Systems. 14(11), 953–967.
mla: Briffa, Amy, et al. “Millennia-Long Epigenetic Fluctuations Generate Intragenic
DNA Methylation Variance in Arabidopsis Populations.” Cell Systems, vol.
14, no. 11, Elsevier, 2023, pp. 953–67, doi:10.1016/j.cels.2023.10.007.
short: A. Briffa, E. Hollwey, Z. Shahzad, J.D. Moore, D.B. Lyons, M. Howard, D.
Zilberman, Cell Systems 14 (2023) 953–967.
corr_author: '1'
date_created: 2023-11-19T23:00:54Z
date_published: 2023-11-15T00:00:00Z
date_updated: 2025-09-09T13:28:50Z
day: '15'
ddc:
- '570'
department:
- _id: DaZi
doi: 10.1016/j.cels.2023.10.007
ec_funded: 1
external_id:
isi:
- '001113459100001'
pmid:
- '37944515'
file:
- access_level: open_access
checksum: 101fdac59e6f1102d68ef91f2b5bd51a
content_type: application/pdf
creator: dernst
date_created: 2023-11-20T11:22:52Z
date_updated: 2023-11-20T11:22:52Z
file_id: '14580'
file_name: 2023_CellSystems_Briffa.pdf
file_size: 5587897
relation: main_file
success: 1
file_date_updated: 2023-11-20T11:22:52Z
has_accepted_license: '1'
intvolume: ' 14'
isi: 1
issue: '11'
language:
- iso: eng
month: '11'
oa: 1
oa_version: Published Version
page: 953-967
pmid: 1
project:
- _id: 62935a00-2b32-11ec-9570-eff30fa39068
call_identifier: H2020
grant_number: '725746'
name: Quantitative analysis of DNA methylation maintenance with chromatin
publication: Cell Systems
publication_identifier:
eissn:
- 2405-4720
issn:
- 2405-4712
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Millennia-long epigenetic fluctuations generate intragenic DNA methylation
variance in Arabidopsis populations
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14
year: '2023'
...