---
_id: '18066'
abstract:
- lang: eng
text: 'Graph games lie at the algorithmic core of many automated design problems
in computer science. These are games usually played between two players on a given
graph, where the players keep moving a token along the edges according to pre-determined
rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite
path (aka play) traversed by the token from a given initial position. In bidding
games, the players initially get some monetary budgets which they need to use
to bid for the privilege of moving the token at each step. Each round of bidding
affects the players'' available budgets, which is the only form of update that
the budgets experience. We introduce bidding games with charging where the players
can additionally improve their budgets during the game by collecting vertex-dependent
monetary rewards, aka the "charges." Unlike traditional bidding games (where all
charges are zero), bidding games with charging allow non-trivial recurrent behaviors.
For example, a reachability objective may require multiple detours to vertices
with high charges to earn additional budget. We show that, nonetheless, the central
property of traditional bidding games generalizes to bidding games with charging:
For each vertex there exists a threshold ratio, which is the necessary and sufficient
fraction of the total budget for winning the game from that vertex. While the
thresholds of traditional bidding games correspond to unique fixed points of linear
systems of equations, in games with charging, these fixed points are no longer
unique. This significantly complicates the proof of existence and the algorithmic
computation of thresholds for infinite-duration objectives. We also provide the
lower complexity bounds for computing thresholds for Rabin and Streett objectives,
which are the first known lower bounds in any form of bidding games (with or without
charging), and we solve the following repair problem for safety and reachability
games that have unsatisfiable objectives: Can we distribute a given amount of
charge to the players in a way such that the objective can be satisfied?'
acknowledgement: This work was supported in part by the ERC projects ERC-2020-AdG
101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.
alternative_title:
- LIPIcs
article_number: '8'
article_processing_charge: Yes
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: Ehsan Kafshdar
full_name: Goharshady, Ehsan Kafshdar
last_name: Goharshady
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Kaushik
full_name: Mallik, Kaushik
id: 0834ff3c-6d72-11ec-94e0-b5b0a4fb8598
last_name: Mallik
orcid: 0000-0001-9864-7475
citation:
ama: 'Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging.
In: 35th International Conference on Concurrency Theory. Vol 311. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.8'
apa: 'Avni, G., Goharshady, E. K., Henzinger, T. A., & Mallik, K. (2024). Bidding
games with charging. In 35th International Conference on Concurrency Theory
(Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.8'
chicago: Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik.
“Bidding Games with Charging.” In 35th International Conference on Concurrency
Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.8.
ieee: G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games
with charging,” in 35th International Conference on Concurrency Theory,
Calgary, Canada, 2024, vol. 311.
ista: 'Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging.
35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency
Theory, LIPIcs, vol. 311, 8.'
mla: Avni, Guy, et al. “Bidding Games with Charging.” 35th International Conference
on Concurrency Theory, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.8.
short: G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:39Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:46:11Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2024.8
ec_funded: 1
external_id:
arxiv:
- '2407.06288'
isi:
- '001556847400008'
file:
- access_level: open_access
checksum: cb6f2254b84922cd7bf224f550b73f4a
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T09:35:03Z
date_updated: 2024-09-17T09:35:03Z
file_id: '18083'
file_name: 2024_LIPICS_Avni.pdf
file_size: 854430
relation: main_file
success: 1
file_date_updated: 2024-09-17T09:35:03Z
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Bidding games with charging
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: 311
year: '2024'
...
---
_id: '18067'
abstract:
- lang: eng
text: "An automaton \U0001D49C is history-deterministic if its nondeterminism can
be resolved on the fly, only using the prefix of the word read so far. This mild
form of nondeterminism has attracted particular attention for its applications
in synthesis problems. An automaton \U0001D49C is guidable with respect to a class
C of automata if it can fairly simulate every automaton in C, whose language is
contained in that of \U0001D49C. In other words, guidable automata are those for
which inclusion and simulation coincide, making them particularly interesting
for model-checking. We study the connection between these two notions, and specifically
the question of when they coincide. For classes of automata on which they do,
deciding guidability, an otherwise challenging decision problem, reduces to deciding
history-determinism, a problem that is starting to be well-understood for many
classes. We provide a selection of sufficient criteria for a class of automata
to guarantee the coincidence of the notions, and use them to show that the notions
coincide for the most common automata classes, among which are ω-regular automata
and many infinite-state automata with safety and reachability acceptance conditions,
including vector addition systems with states, one-counter nets, pushdown-, Parikh-,
and timed-automata. We also demonstrate that history-determinism and guidability
do not always coincide, for example, for the classes of timed automata with a
fixed number of clocks."
acknowledgement: "Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A.
Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya
Prakash: Chancellors’ International Scholarship from the University of Warwick and
Centre for Discrete Mathematics and Its Applications (DIMAP)"
alternative_title:
- LIPIcs
article_number: '12'
article_processing_charge: No
arxiv: 1
author:
- first_name: Udi
full_name: Boker, Udi
id: 31E297B6-F248-11E8-B48F-1D18A9856A87
last_name: Boker
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Karoliina
full_name: Lehtinen, Karoliina
last_name: Lehtinen
- first_name: Aditya
full_name: Prakash, Aditya
last_name: Prakash
citation:
ama: 'Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair
simulation. In: 35th International Conference on Concurrency Theory. Vol
311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.12'
apa: 'Boker, U., Henzinger, T. A., Lehtinen, K., & Prakash, A. (2024). History-determinism
vs fair simulation. In 35th International Conference on Concurrency Theory
(Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik.
https://doi.org/10.4230/LIPIcs.CONCUR.2024.12'
chicago: Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash.
“History-Determinism vs Fair Simulation.” In 35th International Conference
on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12.
ieee: U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism
vs fair simulation,” in 35th International Conference on Concurrency Theory,
Calgary, Canada, 2024, vol. 311.
ista: 'Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs
fair simulation. 35th International Conference on Concurrency Theory. CONCUR:
Conference on Concurrency Theory, LIPIcs, vol. 311, 12.'
mla: Boker, Udi, et al. “History-Determinism vs Fair Simulation.” 35th International
Conference on Concurrency Theory, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.12.
short: U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International
Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:44:54Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.4230/LIPIcs.CONCUR.2024.12
ec_funded: 1
external_id:
arxiv:
- '2407.08620'
isi:
- '001556847400012'
file:
- access_level: open_access
checksum: 66db11ef8e600a434079c278050c3f09
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T07:31:18Z
date_updated: 2024-09-17T07:31:18Z
file_id: '18080'
file_name: 2024_LIPICS_Boker.pdf
file_size: 766902
relation: main_file
success: 1
file_date_updated: 2024-09-17T07:31:18Z
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: History-determinism vs fair simulation
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: 311
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18068'
abstract:
- lang: eng
text: "We study the following refinement relation between nondeterministic state-transition
models: model ℬ strategically dominates model \U0001D49C iff every deterministic
refinement of \U0001D49C is language contained in some deterministic refinement
of ℬ. While language containment is trace inclusion, and the (fair) simulation
preorder coincides with tree inclusion, strategic dominance falls strictly between
the two and can be characterized as \"strategy inclusion\" between \U0001D49C
and ℬ: every strategy that resolves the nondeterminism of \U0001D49C is dominated
by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be
checked in 2-ExpTime by a decidable first-order Presburger logic with quantification
over words and strategies, called resolver logic. We give several other applications
of resolver logic, including checking the co-safety, co-liveness, and history-determinism
of boolean and quantitative automata, and checking the inclusion between hyperproperties
that are specified by nondeterministic boolean and quantitative automata."
acknowledgement: This work was supported in part by the ERC-2020-AdG 101020093. N.
Mazzocchi was affiliated with ISTA when this work was submitted for publication.
alternative_title:
- LIPIcs
article_number: '29'
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Thomas A
full_name: Henzinger, Thomas A
id: 40876CD8-F248-11E8-B48F-1D18A9856A87
last_name: Henzinger
orcid: 0000-0002-2985-7724
- first_name: Nicolas Adrien
full_name: Mazzocchi, Nicolas Adrien
id: b26baa86-3308-11ec-87b0-8990f34baa85
last_name: Mazzocchi
- first_name: Naci E
full_name: Sarac, Naci E
id: 8C6B42F8-C8E6-11E9-A03A-F2DCE5697425
last_name: Sarac
citation:
ama: 'Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder
for nondeterministic processes. In: 35th International Conference on Concurrency
Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024.
doi:10.4230/LIPIcs.CONCUR.2024.29'
apa: 'Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). Strategic dominance:
A new preorder for nondeterministic processes. In 35th International Conference
on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29'
chicago: 'Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic
Dominance: A New Preorder for Nondeterministic Processes.” In 35th International
Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29.'
ieee: 'T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance:
A new preorder for nondeterministic processes,” in 35th International Conference
on Concurrency Theory, Calgary, Canada, 2024, vol. 311.'
ista: 'Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder
for nondeterministic processes. 35th International Conference on Concurrency Theory.
CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.'
mla: 'Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic
Processes.” 35th International Conference on Concurrency Theory, vol. 311,
29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29.'
short: T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference
on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-09-13
location: Calgary, Canada
name: 'CONCUR: Conference on Concurrency Theory'
start_date: 2024-09-09
corr_author: '1'
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-12-02T13:45:38Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
- _id: GradSch
doi: 10.4230/LIPIcs.CONCUR.2024.29
ec_funded: 1
external_id:
arxiv:
- '2407.10473'
isi:
- '001556847400029'
file:
- access_level: open_access
checksum: 555bd343e1fb38adeab8fc465ff4fad8
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T07:48:56Z
date_updated: 2024-09-17T07:48:56Z
file_id: '18081'
file_name: 2024_LIPICS_Henzinger.pdf
file_size: 964124
relation: main_file
success: 1
file_date_updated: 2024-09-17T07:48:56Z
has_accepted_license: '1'
intvolume: ' 311'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: 35th International Conference on Concurrency Theory
publication_identifier:
isbn:
- '9783959773393'
issn:
- 1868-8969
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Strategic dominance: A new preorder for nondeterministic processes'
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: 311
year: '2024'
...
---
DOAJ_listed: '1'
_id: '18069'
abstract:
- lang: eng
text: We present results from the JWST First Reionization Epoch Spectroscopically
Complete Observations survey on the star-forming sequence (SFS) of galaxies at
1.0 < z < 1.7, around the peak of the cosmic star formation history. Star formation
rates (SFRs) are measured from the redshifted, relatively dust-insensitive Paschen-α
emission line, and stellar mass measurements include the F444W (4.4 μm; rest-frame
H) band. We find SFRs of galaxies with log(M*/M⊙) > 9.5 that are lower than found
in many earlier studies by up to 0.6 dex, but in good agreement with recent results
obtained with the Prospector fitting framework. The difference (log(SFR(Paα)-SFR(Prospector))
is −0.09 ± 0.04 dex at 1010−11M⊙. We also measure the empirical relation between
Paschen-α luminosity and rest-frame H-band magnitude and find that the scatter
is only 0.04 dex lower than that of the SFR–M* relation and is much lower than
the systematic differences among relations in the literature due to various methods
of converting observed measurements to physical properties. We additionally identify
examples of sources—that, with standard cutoffs via the UVJ diagram, would be
deemed quiescent—with significant (log(sSFR)> −11 yr−1), typically extended, Paschen-α
emission. Our results may be indicative of the potential unification of methods
used to derive the SFS with careful selection of star-forming galaxies and independent
SFR and stellar mass indicators.
acknowledgement: "The authors thank the anonymous referee whose comments and suggestions
improved the quality of this work.\r\nThis work is based on observations made with
the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski
Archive for Space Telescopes at the Space Telescope Science Institute, which is
operated by the Association of Universities for Research in Astronomy, Inc., under
NASA contract NAS 5-03127 for JWST. These observations are associated with program
No. 1895.\r\nSupport for this work was provided by NASA through grant JWST-GO-01895
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555.\r\nThis
work has received funding from the Swiss State Secretariat for Education, Research,
and Innovation (SERI) under contract No. MB22.00072, as well as from the Swiss National
Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center
(DAWN) is funded by the Danish National Research Foundation under grant No. 140.\r\nR.P.N.
acknowledges funding from JWST programs GO-1933 and GO-2279. Support for this work
was provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A
awarded by the Space Telescope Science Institute, which is operated by the Association
of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555\r\nCloud-based
data processing and file storage for this work is provided by the AWS Cloud Credits
for Research program.\r\nThis paper made use of several publicly available software
packages. We thank the respective authors for sharing their work: IPython (Pérez
& Granger 2007), matplotlib (Hunter 2007), seaborn (Waskom et al. 2018), NumPy (Harris
et al. 2020), SciPy (Virtanen et al. 2020), jupyter (Kluyver et al. 2016), Astropy
(Astropy Collaboration et al. 2013, 2018, 2022), grizli (Brammer 2018; Brammer et
al. 2022), Prospector (Leja et al. 2019, 2017; Johnson et al. 2021), FSPS (Conroy
et al. 2009a, 2010; Conroy & Gunn 2010a, 2010b; Foreman-Mackey et al. 2014), dynesty
(Speagle 2020), EAZY (Brammer et al. 2008), Bagpipes (Carnall et al. 2018), and
SExtractor (Bertin & Arnouts 1996)."
article_number: '156'
article_processing_charge: Yes
article_type: original
author:
- first_name: Chloe
full_name: Neufeld, Chloe
last_name: Neufeld
- first_name: Pieter
full_name: Van Dokkum, Pieter
last_name: Van Dokkum
- first_name: Yasmeen
full_name: Asali, Yasmeen
last_name: Asali
- first_name: Alba
full_name: Covelo-Paz, Alba
last_name: Covelo-Paz
- first_name: Joel
full_name: Leja, Joel
last_name: Leja
- first_name: Jamie
full_name: Lin, Jamie
last_name: Lin
- first_name: Jorryt J
full_name: Matthee, Jorryt J
id: 7439a258-f3c0-11ec-9501-9df22fe06720
last_name: Matthee
orcid: 0000-0003-2871-127X
- first_name: Pascal A.
full_name: Oesch, Pascal A.
last_name: Oesch
- first_name: Naveen A.
full_name: Reddy, Naveen A.
last_name: Reddy
- first_name: Irene
full_name: Shivaei, Irene
last_name: Shivaei
- first_name: Katherine E.
full_name: Whitaker, Katherine E.
last_name: Whitaker
- first_name: Stijn
full_name: Wuyts, Stijn
last_name: Wuyts
- first_name: Gabriel
full_name: Brammer, Gabriel
last_name: Brammer
- first_name: Danilo
full_name: Marchesini, Danilo
last_name: Marchesini
- first_name: Michael V.
full_name: Maseda, Michael V.
last_name: Maseda
- first_name: Rohan P.
full_name: Naidu, Rohan P.
last_name: Naidu
- first_name: Erica J.
full_name: Nelson, Erica J.
last_name: Nelson
- first_name: Anna
full_name: Velichko, Anna
last_name: Velichko
- first_name: Andrea
full_name: Weibel, Andrea
last_name: Weibel
- first_name: Mengyuan
full_name: Xiao, Mengyuan
last_name: Xiao
citation:
ama: 'Neufeld C, Van Dokkum P, Asali Y, et al. FRESCO: The Paschen-α star-forming
sequence at cosmic noon. Astrophysical Journal. 2024;972(2). doi:10.3847/1538-4357/ad6158'
apa: 'Neufeld, C., Van Dokkum, P., Asali, Y., Covelo-Paz, A., Leja, J., Lin, J.,
… Xiao, M. (2024). FRESCO: The Paschen-α star-forming sequence at cosmic noon.
Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ad6158'
chicago: 'Neufeld, Chloe, Pieter Van Dokkum, Yasmeen Asali, Alba Covelo-Paz, Joel
Leja, Jamie Lin, Jorryt J Matthee, et al. “FRESCO: The Paschen-α Star-Forming
Sequence at Cosmic Noon.” Astrophysical Journal. IOP Publishing, 2024.
https://doi.org/10.3847/1538-4357/ad6158.'
ieee: 'C. Neufeld et al., “FRESCO: The Paschen-α star-forming sequence at
cosmic noon,” Astrophysical Journal, vol. 972, no. 2. IOP Publishing, 2024.'
ista: 'Neufeld C, Van Dokkum P, Asali Y, Covelo-Paz A, Leja J, Lin J, Matthee JJ,
Oesch PA, Reddy NA, Shivaei I, Whitaker KE, Wuyts S, Brammer G, Marchesini D,
Maseda MV, Naidu RP, Nelson EJ, Velichko A, Weibel A, Xiao M. 2024. FRESCO: The
Paschen-α star-forming sequence at cosmic noon. Astrophysical Journal. 972(2),
156.'
mla: 'Neufeld, Chloe, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic
Noon.” Astrophysical Journal, vol. 972, no. 2, 156, IOP Publishing, 2024,
doi:10.3847/1538-4357/ad6158.'
short: C. Neufeld, P. Van Dokkum, Y. Asali, A. Covelo-Paz, J. Leja, J. Lin, J.J.
Matthee, P.A. Oesch, N.A. Reddy, I. Shivaei, K.E. Whitaker, S. Wuyts, G. Brammer,
D. Marchesini, M.V. Maseda, R.P. Naidu, E.J. Nelson, A. Velichko, A. Weibel, M.
Xiao, Astrophysical Journal 972 (2024).
date_created: 2024-09-15T22:01:40Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2025-09-08T09:43:41Z
day: '01'
ddc:
- '520'
department:
- _id: JoMa
doi: 10.3847/1538-4357/ad6158
external_id:
isi:
- '001305987600001'
file:
- access_level: open_access
checksum: 754b58c1d79adb9670ca76fa8c20ab16
content_type: application/pdf
creator: dernst
date_created: 2024-09-17T08:23:59Z
date_updated: 2024-09-17T08:23:59Z
file_id: '18082'
file_name: 2024_AstrophysicalJourn_Neufeld.pdf
file_size: 9960685
relation: main_file
success: 1
file_date_updated: 2024-09-17T08:23:59Z
has_accepted_license: '1'
intvolume: ' 972'
isi: 1
issue: '2'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Astrophysical Journal
publication_identifier:
eissn:
- 1538-4357
issn:
- 0004-637X
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'FRESCO: The Paschen-α star-forming sequence at cosmic noon'
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: 972
year: '2024'
...
---
_id: '18070'
abstract:
- lang: eng
text: Parallel SGD in a shared-memory setting is oft-represented by the popular
Hogwild! algorithm, in which lock-free updates are asynchronously performed by
multiple computing processes. Unfortunately, scaling Hogwild! to distributed workers
is largely unexplored. Specifically, it is unknown if any adaptation of Hogwild!
to the popular decentralized multi-GPU setting offers any competitive speedup,
either empirically or theoretically. In this work, we investigate the potential
of decentralizing Hogwild! by incorporating simultaneously (a) asynchronous local
gradient updates on the shared memory of GPUs, and (b) non-blocking asynchronous
decentralized federated averaging. A naive direct implementation shows degradation
in performance, arising from scheduling overheads and concurrent write conflicts
on GPUs. To mitigate these drawbacks, we investigate and propose a new method,
based on careful block selection rules, which update only portions of the parameter
vectors. Our experiments show that the resulting decentralized training method
exhibits improved throughput and competitive accuracy for standard image classification
benchmarks on the CIFAR-10, CIFAR-100, and Imagenet datasets. On the theoretical
side, we prove that our method guarantees sublinear ergodic convergence rates
for non-convex objectives.
article_processing_charge: No
author:
- first_name: Bapi
full_name: Chatterjee, Bapi
id: 3C41A08A-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-2742-4028
- first_name: Vyacheslav
full_name: Kungurtsev, Vyacheslav
last_name: Kungurtsev
- 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: 'Chatterjee B, Kungurtsev V, Alistarh D-A. Federated SGD with local asynchrony.
In: Proceedings of the 44th International Conference on Distributed Computing
Systems. IEEE; 2024:857-868. doi:10.1109/ICDCS60910.2024.00084'
apa: 'Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2024). Federated SGD
with local asynchrony. In Proceedings of the 44th International Conference
on Distributed Computing Systems (pp. 857–868). Jersey City, NJ, United States:
IEEE. https://doi.org/10.1109/ICDCS60910.2024.00084'
chicago: Chatterjee, Bapi, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Federated
SGD with Local Asynchrony.” In Proceedings of the 44th International Conference
on Distributed Computing Systems, 857–68. IEEE, 2024. https://doi.org/10.1109/ICDCS60910.2024.00084.
ieee: B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Federated SGD with local
asynchrony,” in Proceedings of the 44th International Conference on Distributed
Computing Systems, Jersey City, NJ, United States, 2024, pp. 857–868.
ista: 'Chatterjee B, Kungurtsev V, Alistarh D-A. 2024. Federated SGD with local
asynchrony. Proceedings of the 44th International Conference on Distributed Computing
Systems. ICDCS: International Conference on Distributed Computing Systems, 857–868.'
mla: Chatterjee, Bapi, et al. “Federated SGD with Local Asynchrony.” Proceedings
of the 44th International Conference on Distributed Computing Systems, IEEE,
2024, pp. 857–68, doi:10.1109/ICDCS60910.2024.00084.
short: B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the 44th
International Conference on Distributed Computing Systems, IEEE, 2024, pp. 857–868.
conference:
end_date: 2024-07-26
location: Jersey City, NJ, United States
name: 'ICDCS: International Conference on Distributed Computing Systems'
start_date: 2024-07-23
corr_author: '1'
date_created: 2024-09-15T22:01:41Z
date_published: 2024-07-26T00:00:00Z
date_updated: 2025-09-08T09:23:48Z
day: '26'
department:
- _id: DaAl
doi: 10.1109/ICDCS60910.2024.00084
external_id:
isi:
- '001304430200075'
isi: 1
language:
- iso: eng
month: '07'
oa_version: None
page: 857-868
publication: Proceedings of the 44th International Conference on Distributed Computing
Systems
publication_identifier:
eissn:
- 2575-8411
isbn:
- '9798350386059'
issn:
- 1063-6927
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Federated SGD with local asynchrony
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '18071'
abstract:
- lang: eng
text: Recent advancements on DAG-based consensus protocols allow for blockchains
with improved metrics and properties, such as throughput and censorship-resistance.
Variants of the Bullshark [18] consensus protocol are adopted for practical use
by the Sui blockchain, for improved latency. However, the protocol is leader-based,
and is strongly affected by crashed leaders that can lead to various performance
issues, for example, decreased transaction throughput. In this paper, we propose
HammerHead, a DAG-based consensus protocol, that is inspired by Carousel [8] and
provides Leader-Utilization. Our proposal differs from Carousel, which is built
for a chained consensus protocol; in HammerHead chain quality is inherited by
the DAG. HammerHead needs to preserve safety and liveness, despite validators
committing leader vertices asynchronously. The key idea is to update leader schedules
dynamically, based on the validators' scores during the previous schedule. We
implement HammerHead and show a minor improvement in performance for cases without
faults. The major improvements in comparison to Bullshark appear in faulty settings.
Specifically, we show a drastic, 2x-latency improvement and up to 40% increased
throughput when crash faults occur (100 validators, 33 faults).
acknowledgement: This work is supported by Mysten Labs. We thank the Mysten Labs Engineering
teams for valuable feedback broadly, and specifically to Laura Makdah for helping
implementing the early reputation score system for validators and Dmitry Perelman
for managing the overall implementation effort.
article_processing_charge: No
arxiv: 1
author:
- first_name: Giorgos
full_name: Tsimos, Giorgos
last_name: Tsimos
- first_name: Anastasios
full_name: Kichidis, Anastasios
last_name: Kichidis
- first_name: Alberto
full_name: Sonnino, Alberto
last_name: Sonnino
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
citation:
ama: 'Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. HammerHead: Leader reputation
for dynamic scheduling. In: Proceedings - International Conference on Distributed
Computing Systems. IEEE; 2024:1377-1387. doi:10.1109/ICDCS60910.2024.00129'
apa: 'Tsimos, G., Kichidis, A., Sonnino, A., & Kokoris Kogias, E. (2024). HammerHead:
Leader reputation for dynamic scheduling. In Proceedings - International Conference
on Distributed Computing Systems (pp. 1377–1387). Jersey City, NJ, United
States: IEEE. https://doi.org/10.1109/ICDCS60910.2024.00129'
chicago: 'Tsimos, Giorgos, Anastasios Kichidis, Alberto Sonnino, and Eleftherios
Kokoris Kogias. “HammerHead: Leader Reputation for Dynamic Scheduling.” In Proceedings
- International Conference on Distributed Computing Systems, 1377–87. IEEE,
2024. https://doi.org/10.1109/ICDCS60910.2024.00129.'
ieee: 'G. Tsimos, A. Kichidis, A. Sonnino, and E. Kokoris Kogias, “HammerHead: Leader
reputation for dynamic scheduling,” in Proceedings - International Conference
on Distributed Computing Systems, Jersey City, NJ, United States, 2024, pp.
1377–1387.'
ista: 'Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. 2024. HammerHead: Leader
reputation for dynamic scheduling. Proceedings - International Conference on Distributed
Computing Systems. ICDCS: International Conference on Distributed Computing Systems,
1377–1387.'
mla: 'Tsimos, Giorgos, et al. “HammerHead: Leader Reputation for Dynamic Scheduling.”
Proceedings - International Conference on Distributed Computing Systems,
IEEE, 2024, pp. 1377–87, doi:10.1109/ICDCS60910.2024.00129.'
short: G. Tsimos, A. Kichidis, A. Sonnino, E. Kokoris Kogias, in:, Proceedings -
International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–1387.
conference:
end_date: 2024-07-26
location: Jersey City, NJ, United States
name: 'ICDCS: International Conference on Distributed Computing Systems'
start_date: 2024-07-23
date_created: 2024-09-15T22:01:41Z
date_published: 2024-07-26T00:00:00Z
date_updated: 2025-09-08T09:42:36Z
day: '26'
department:
- _id: ElKo
doi: 10.1109/ICDCS60910.2024.00129
external_id:
arxiv:
- '2309.12713'
isi:
- '001304430200120'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://arxiv.org/abs/2309.12713
month: '07'
oa: 1
oa_version: Preprint
page: 1377-1387
publication: Proceedings - International Conference on Distributed Computing Systems
publication_identifier:
eissn:
- 2575-8411
isbn:
- '9798350386059'
issn:
- 1063-6927
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'HammerHead: Leader reputation for dynamic scheduling'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
_id: '18072'
abstract:
- lang: eng
text: The individualization of chromosomes during early mitosis and their clustering
upon exit from cell division are two key transitions that ensure efficient segregation
of eukaryotic chromosomes. Both processes are regulated by the surfactant-like
protein Ki-67, but how Ki-67 achieves these diametric functions has remained unknown.
Here, we report that Ki-67 radically switches from a chromosome repellent to a
chromosome attractant during anaphase in human cells. We show that Ki-67 dephosphorylation
during mitotic exit and the simultaneous exposure of a conserved basic patch induce
the RNA-dependent formation of a liquid-like condensed phase on the chromosome
surface. Experiments and coarse-grained simulations support a model in which the
coalescence of chromosome surfaces, driven by co-condensation of Ki-67 and RNA,
promotes clustering of chromosomes. Our study reveals how the switch of Ki-67
from a surfactant to a liquid-like condensed phase can generate mechanical forces
during genome segregation that are required for re-establishing nuclear-cytoplasmic
compartmentalization after mitosis.
acknowledgement: We thank Daniel W. Gerlich for providing cell lines, the EMBL Advanced
Light Microscopy Facility (ALMF) for support, Christian H. Haering and Thomas Quail
for input on the manuscript, and Martina Dees for cloning several Ki-67 constructs.
This work was supported by the German Research Foundation (DFG project number 402723784)
and the Human Frontier Science Program (CDA00045/2019). A.H.-A. and A.B. have received
PhD fellowships from the Boehringer Ingelheim Fonds, V.S. and A.Š. were supported
by the European Research Council (ERC) under the European Union’s Horizon 2020 research
and innovation programme (grant no. 802960), and Y.H. was supported by a fellowship
from the EMBL interdisciplinary Postdoc (EIPOD) program (Marie Sklodowska-Curie
Actions, COFUND grant agreement 664726).
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Alberto
full_name: Hernandez-Armendariz, Alberto
last_name: Hernandez-Armendariz
- first_name: Valerio
full_name: Sorichetti, Valerio
id: ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b
last_name: Sorichetti
orcid: 0000-0002-9645-6576
- first_name: Yuki
full_name: Hayashi, Yuki
last_name: Hayashi
- first_name: Zuzana
full_name: Koskova, Zuzana
last_name: Koskova
- first_name: Andreas
full_name: Brunner, Andreas
last_name: Brunner
- first_name: Jan
full_name: Ellenberg, Jan
last_name: Ellenberg
- first_name: Anđela
full_name: Šarić, Anđela
id: bf63d406-f056-11eb-b41d-f263a6566d8b
last_name: Šarić
orcid: 0000-0002-7854-2139
- first_name: Sara
full_name: Cuylen-Haering, Sara
last_name: Cuylen-Haering
citation:
ama: Hernandez-Armendariz A, Sorichetti V, Hayashi Y, et al. A liquid-like coat
mediates chromosome clustering during mitotic exit. Molecular Cell. 2024;84(17):P3254-3270.E9.
doi:10.1016/j.molcel.2024.07.022
apa: Hernandez-Armendariz, A., Sorichetti, V., Hayashi, Y., Koskova, Z., Brunner,
A., Ellenberg, J., … Cuylen-Haering, S. (2024). A liquid-like coat mediates chromosome
clustering during mitotic exit. Molecular Cell. Cell Press. https://doi.org/10.1016/j.molcel.2024.07.022
chicago: Hernandez-Armendariz, Alberto, Valerio Sorichetti, Yuki Hayashi, Zuzana
Koskova, Andreas Brunner, Jan Ellenberg, Anđela Šarić, and Sara Cuylen-Haering.
“A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” Molecular
Cell. Cell Press, 2024. https://doi.org/10.1016/j.molcel.2024.07.022.
ieee: A. Hernandez-Armendariz et al., “A liquid-like coat mediates chromosome
clustering during mitotic exit,” Molecular Cell, vol. 84, no. 17. Cell
Press, p. P3254–3270.E9, 2024.
ista: Hernandez-Armendariz A, Sorichetti V, Hayashi Y, Koskova Z, Brunner A, Ellenberg
J, Šarić A, Cuylen-Haering S. 2024. A liquid-like coat mediates chromosome clustering
during mitotic exit. Molecular Cell. 84(17), P3254–3270.E9.
mla: Hernandez-Armendariz, Alberto, et al. “A Liquid-like Coat Mediates Chromosome
Clustering during Mitotic Exit.” Molecular Cell, vol. 84, no. 17, Cell
Press, 2024, p. P3254–3270.E9, doi:10.1016/j.molcel.2024.07.022.
short: A. Hernandez-Armendariz, V. Sorichetti, Y. Hayashi, Z. Koskova, A. Brunner,
J. Ellenberg, A. Šarić, S. Cuylen-Haering, Molecular Cell 84 (2024) P3254–3270.E9.
date_created: 2024-09-15T22:01:41Z
date_published: 2024-09-05T00:00:00Z
date_updated: 2025-09-08T09:23:02Z
day: '05'
ddc:
- '570'
department:
- _id: AnSa
doi: 10.1016/j.molcel.2024.07.022
ec_funded: 1
external_id:
isi:
- '001309051100001'
pmid:
- '39153474'
file:
- access_level: open_access
checksum: 3f360e0287b8ec79fb2b8b02b5070360
content_type: application/pdf
creator: dernst
date_created: 2024-09-16T07:38:38Z
date_updated: 2024-09-16T07:38:38Z
file_id: '18075'
file_name: 2024_MolecularCell_HernandezArmendariz.pdf
file_size: 11654644
relation: main_file
success: 1
file_date_updated: 2024-09-16T07:38:38Z
has_accepted_license: '1'
intvolume: ' 84'
isi: 1
issue: '17'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: P3254-3270.E9
pmid: 1
project:
- _id: eba2549b-77a9-11ec-83b8-a81e493eae4e
call_identifier: H2020
grant_number: '802960'
name: 'Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines'
publication: Molecular Cell
publication_identifier:
eissn:
- 1097-4164
issn:
- 1097-2765
publication_status: published
publisher: Cell Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: A liquid-like coat mediates chromosome clustering during mitotic exit
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: 84
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18073'
abstract:
- lang: eng
text: Conserved signaling cascades monitor protein-folding homeostasis to ensure
proper cellular function. One of the evolutionary conserved key players is IRE1,
which maintains endoplasmic reticulum (ER) homeostasis through the unfolded protein
response (UPR). Upon accumulation of misfolded proteins in the ER, IRE1 forms
clusters on the ER membrane to initiate UPR signaling. What regulates IRE1 cluster
formation is not fully understood. Here, we show that the ER lumenal domain (LD)
of human IRE1α forms biomolecular condensates in vitro. IRE1α LD condensates were
stabilized both by binding to unfolded polypeptides as well as by tethering to
model membranes, suggesting their role in assembling IRE1α into signaling-competent
stable clusters. Molecular dynamics simulations indicated that weak multivalent
interactions drive IRE1α LD clustering. Mutagenesis experiments identified disordered
regions in IRE1α LD to control its clustering in vitro and in cells. Importantly,
dysregulated clustering of IRE1α mutants led to defects in IRE1α signaling. Our
results revealed that disordered regions in IRE1α LD control its clustering and
suggest their role as a common strategy in regulating protein assembly on membranes.
acknowledgement: We thank late Thomas Peterbauer at the Max Perutz Labs Biooptics
Light Microscopy Facility for his help and support. We are grateful to Kitti Csalyi
and Thomas Sauer at Max Perutz Labs Biooptics FACS facility for their help. We thank
Grzegorz Scibisz and Sertan Atilla for their support with the expression and purification
of mCherry-IRE1α LD-10His. We are grateful to Aleksandra S Anisimova with her help
in the generation of stable cell lines and the statistical analyses of the data.
We thank Venja Vieweger for her help with the characterization of the WLLI and D123P
IRE1 mutants in cells. We are thankful to Monika Kubickova for the help with the
AUC experiments. We acknowledge CF BIC of CIISB, Instruct-CZ Centre, supported by
MEYS CR (LM2023042)) and European Regional Development Fund-Project, UP CIISB“ (No.
CZ.02.1.01/0.0/0.0/18_046/0015974). We thank the members of the Karagöz lab for
the critical reading and editing of the manuscript. We are thankful to our colleagues
Diego Acosta-Alvear, Vladislav Belyy, Jirka Peschek, Yasin Dagdas, Javier Martinez,
Sascha Martens and Alwin Köhler for their invaluable input on the manuscript. We
are grateful to Life Science Editors, especially Katrina Woolcock for her useful
edits and comments on the manuscript. We acknowledge funding from Austrian Science
Fund (FWF-SFB F79 and FWF-W 1261) to GEK. PK acknowledges the support of the Max
Perutz PhD fellowship. GAV is funded by Stand-Alone grants (P30231-B, P30415-B,
P36572), Special Research Grant (SFB grant F79), and Doctoral School grant (DK grant
W1261) from the Austrian Science Fund (FWF). ES and RC acknowledge support and funding
by the Frankfurt Institute of Advanced Studies, the LOEWE Center for Multiscale
Modelling in Life Sciences of the state of Hesse, the Collaborative Research Center
1507 “Membrane-associated Protein Assemblies, Machineries, and Supercomplexes” (Project
ID 450648163), and the International Max Planck Research School on Cellular Biophysics
(to RC), the Center for Scientific Computing of the Goethe University and the Jülich
Supercomputing Centre for computational resources and support.
article_processing_charge: Yes
article_type: original
author:
- first_name: Paulina
full_name: Kettel, Paulina
last_name: Kettel
- first_name: Laura
full_name: Marosits, Laura
last_name: Marosits
- first_name: Elena
full_name: Spinetti, Elena
last_name: Spinetti
- first_name: Michael
full_name: Rechberger, Michael
last_name: Rechberger
- first_name: Caterina
full_name: Giannini, Caterina
id: e3fdddd5-f6e0-11ea-865d-ca99ee6367f4
last_name: Giannini
- first_name: Philipp
full_name: Radler, Philipp
id: 40136C2A-F248-11E8-B48F-1D18A9856A87
last_name: Radler
orcid: '0000-0001-9198-2182 '
- first_name: Isabell
full_name: Niedermoser, Isabell
last_name: Niedermoser
- first_name: Irmgard
full_name: Fischer, Irmgard
last_name: Fischer
- first_name: Gijs A.
full_name: Versteeg, Gijs A.
last_name: Versteeg
- first_name: Martin
full_name: Loose, Martin
id: 462D4284-F248-11E8-B48F-1D18A9856A87
last_name: Loose
orcid: 0000-0001-7309-9724
- first_name: Roberto
full_name: Covino, Roberto
last_name: Covino
- first_name: G. Elif
full_name: Karagöz, G. Elif
last_name: Karagöz
citation:
ama: Kettel P, Marosits L, Spinetti E, et al. Disordered regions in the IRE1α ER
lumenal domain mediate its stress-induced clustering. EMBO Journal. 2024;43(20):4668-4698.
doi:10.1038/s44318-024-00207-0
apa: Kettel, P., Marosits, L., Spinetti, E., Rechberger, M., Giannini, C., Radler,
P., … Karagöz, G. E. (2024). Disordered regions in the IRE1α ER lumenal domain
mediate its stress-induced clustering. EMBO Journal. Embo Press. https://doi.org/10.1038/s44318-024-00207-0
chicago: Kettel, Paulina, Laura Marosits, Elena Spinetti, Michael Rechberger, Caterina
Giannini, Philipp Radler, Isabell Niedermoser, et al. “Disordered Regions in the
IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” EMBO Journal.
Embo Press, 2024. https://doi.org/10.1038/s44318-024-00207-0.
ieee: P. Kettel et al., “Disordered regions in the IRE1α ER lumenal domain
mediate its stress-induced clustering,” EMBO Journal, vol. 43, no. 20.
Embo Press, pp. 4668–4698, 2024.
ista: Kettel P, Marosits L, Spinetti E, Rechberger M, Giannini C, Radler P, Niedermoser
I, Fischer I, Versteeg GA, Loose M, Covino R, Karagöz GE. 2024. Disordered regions
in the IRE1α ER lumenal domain mediate its stress-induced clustering. EMBO Journal.
43(20), 4668–4698.
mla: Kettel, Paulina, et al. “Disordered Regions in the IRE1α ER Lumenal Domain
Mediate Its Stress-Induced Clustering.” EMBO Journal, vol. 43, no. 20,
Embo Press, 2024, pp. 4668–98, doi:10.1038/s44318-024-00207-0.
short: P. Kettel, L. Marosits, E. Spinetti, M. Rechberger, C. Giannini, P. Radler,
I. Niedermoser, I. Fischer, G.A. Versteeg, M. Loose, R. Covino, G.E. Karagöz,
EMBO Journal 43 (2024) 4668–4698.
date_created: 2024-09-15T22:01:42Z
date_published: 2024-10-15T00:00:00Z
date_updated: 2025-09-08T09:22:11Z
day: '15'
ddc:
- '570'
department:
- _id: MaLo
- _id: JiFr
doi: 10.1038/s44318-024-00207-0
external_id:
isi:
- '001306286100002'
pmid:
- '39232130'
file:
- access_level: open_access
checksum: 04f4df1a561083f2846676442fc4eb3c
content_type: application/pdf
creator: dernst
date_created: 2025-01-13T08:43:20Z
date_updated: 2025-01-13T08:43:20Z
file_id: '18827'
file_name: 2024_Embo_Kettel.pdf
file_size: 10080854
relation: main_file
success: 1
file_date_updated: 2025-01-13T08:43:20Z
has_accepted_license: '1'
intvolume: ' 43'
isi: 1
issue: '20'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 4668-4698
pmid: 1
publication: EMBO Journal
publication_identifier:
eissn:
- 1460-2075
issn:
- 0261-4189
publication_status: published
publisher: Embo Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced
clustering
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: 43
year: '2024'
...
---
OA_place: publisher
_id: '18076'
abstract:
- lang: eng
text: "The new era of Ge has opened up new possibilities in quantum computing. The
maturity of Ge\r\nspin qubits is unquestioned, while hybrid semiconductor-superconductor
Ge circuits are on track\r\nto enter the game. Gate-tunable transmons (gatemons)
employing semiconductor Josephson\r\njunctions have recently emerged as building
blocks for such hybrid quantum circuits. In this\r\nthesis, we present a gatemon
fabricated in planar Germanium. We induce superconductivity\r\nin a two-dimensional
hole gas by evaporating aluminum atop a thin spacer, which separates\r\nthe superconductor
from the Ge quantum well. The Josephson junction is then integrated\r\ninto an
Xmon circuit and capacitively coupled to a transmission line resonator. We showcase\r\nthe
qubit tunability in a broad frequency range with resonator and two-tone spectroscopy.\r\nTime-domain
characterizations reveal energy relaxation and coherence times up to 75 ns. Our\r\nresults,
combined with the recent advances in the spin qubit field, pave the way towards
novel\r\nhybrid and protected qubits in a group IV, CMOS-compatible material."
acknowledged_ssus:
- _id: NanoFab
- _id: M-Shop
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Oliver
full_name: Sagi, Oliver
id: 71616374-A8E9-11E9-A7CA-09ECE5697425
last_name: Sagi
citation:
ama: Sagi O. Hybrid circuits on planar Germanium. 2024. doi:10.15479/at:ista:18076
apa: Sagi, O. (2024). Hybrid circuits on planar Germanium. Institute of Science
and Technology Austria. https://doi.org/10.15479/at:ista:18076
chicago: Sagi, Oliver. “Hybrid Circuits on Planar Germanium.” Institute of Science
and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18076.
ieee: O. Sagi, “Hybrid circuits on planar Germanium,” Institute of Science and Technology
Austria, 2024.
ista: Sagi O. 2024. Hybrid circuits on planar Germanium. Institute of Science and
Technology Austria.
mla: Sagi, Oliver. Hybrid Circuits on Planar Germanium. Institute of Science
and Technology Austria, 2024, doi:10.15479/at:ista:18076.
short: O. Sagi, Hybrid Circuits on Planar Germanium, Institute of Science and Technology
Austria, 2024.
corr_author: '1'
date_created: 2024-09-16T12:58:36Z
date_published: 2024-09-18T00:00:00Z
date_updated: 2026-04-16T12:20:39Z
day: '18'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: GeKa
doi: 10.15479/at:ista:18076
ec_funded: 1
file:
- access_level: open_access
checksum: d01d0e2846c2f3ac5bb14d321554a4cd
content_type: application/pdf
creator: osagi
date_created: 2024-09-18T14:13:01Z
date_updated: 2024-09-18T14:13:01Z
file_id: '18093'
file_name: OliverSagi_Thesis_pdfa.pdf
file_size: 86679095
relation: main_file
success: 1
- access_level: local
checksum: 0543f473d509ee545f4ed3a56f742f4b
content_type: application/x-zip-compressed
creator: osagi
date_created: 2024-09-18T14:14:02Z
date_updated: 2024-09-19T09:20:33Z
file_id: '18094'
file_name: Thesis_OliverSagi.zip
file_size: 172098524
relation: source_file
file_date_updated: 2024-09-19T09:20:33Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-sa/4.0/
month: '09'
oa: 1
oa_version: Published Version
page: '111'
project:
- _id: bd8bd29e-d553-11ed-ba76-f0070d4b237a
grant_number: P36507
name: Merging spin and superconducting qubits in planar Ge
- _id: c0977eea-5a5b-11eb-8a69-a862db0cf4d1
grant_number: I05060
name: High impedance circuit quantum electrodynamics with hole spins
- _id: 262116AA-B435-11E9-9278-68D0E5697425
name: Hybrid Semiconductor - Superconductor Quantum Devices
- _id: 237E5020-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '862046'
name: TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '17202'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Georgios
full_name: Katsaros, Georgios
id: 38DB5788-F248-11E8-B48F-1D18A9856A87
last_name: Katsaros
orcid: 0000-0001-8342-202X
title: Hybrid circuits on planar Germanium
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
_id: '18086'
abstract:
- lang: eng
text: "Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers
to maintain a continuously updated shared key in an asynchronous\r\nsetting where
parties only come online sporadically and their messages\r\nare relayed by an
untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging
schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS)
IETF RFC 9420) cannot handle concurrent requests while retaining low communication
complexity. The exception being CoCoA, which\r\nis concurrent while having extremely
low communication complexity (in\r\ngroups of size n and for m concurrent updates
the communication per\r\nuser is log(n), i.e., independent of m). The main downside
of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests
to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn
this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF,
where users will heal after at most log(t) requests, with\r\nt being the number
of corrupted users. While also suitable for the standard central-server setting,
our protocol is particularly interesting for\r\nrealizing decentralized group
messaging, where protocol messages (add,\r\nremove, update) are being posted on
some append-only data structure\r\nrather than sent to a server. In this setting,
concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at
which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting,
CoCoA (the only alternative with concurrency, sub-linear communication and basic
post-compromise security)\r\nenjoys much lower download communication. However,
in the decentralized setting – where there is no server which can craft specific
messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly
outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring
a similar per epoch per user communication\r\ncost."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Joel F
full_name: Alwen, Joel F
id: 2A8DFA8C-F248-11E8-B48F-1D18A9856A87
last_name: Alwen
- first_name: Benedikt
full_name: Auerbach, Benedikt
id: D33D2B18-E445-11E9-ABB7-15F4E5697425
last_name: Auerbach
orcid: 0000-0002-7553-6606
- first_name: Miguel
full_name: Cueto Noval, Miguel
id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
last_name: Cueto Noval
orcid: 0000-0002-2505-4246
- first_name: Karen
full_name: Klein, Karen
id: 3E83A2F8-F248-11E8-B48F-1D18A9856A87
last_name: Klein
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
citation:
ama: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ.
DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. Security
and Cryptography for Networks: 14th International Conference. Vol 14974. Cham:
Springer Nature; 2024:294–313. doi:10.1007/978-3-031-71073-5_14'
apa: 'Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G.,
& Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In
C. Galdi & D. H. Phan (Eds.), Security and Cryptography for Networks: 14th
International Conference (Vol. 14974, pp. 294–313). Cham: Springer Nature.
https://doi.org/10.1007/978-3-031-71073-5_14'
chicago: 'Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo
Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast
Healing.” In Security and Cryptography for Networks: 14th International Conference,
edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature,
2024. https://doi.org/10.1007/978-3-031-71073-5_14.'
ieee: 'J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and
K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in Security
and Cryptography for Networks: 14th International Conference, Amalfi, Italy,
2024, vol. 14974, pp. 294–313.'
ista: 'Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ.
2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography
for Networks: 14th International Conference. SCN: Security and Cryptography for
Networks, LNCS, vol. 14974, 294–313.'
mla: 'Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” Security
and Cryptography for Networks: 14th International Conference, edited by Clemente
Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:10.1007/978-3-031-71073-5_14.'
short: 'J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z.
Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks:
14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.'
conference:
end_date: 2024-09-13
location: Amalfi, Italy
name: 'SCN: Security and Cryptography for Networks'
start_date: 2024-09-11
corr_author: '1'
date_created: 2024-09-18T11:35:14Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2026-04-07T13:01:26Z
day: '10'
department:
- _id: GradSch
- _id: KrPi
doi: 10.1007/978-3-031-71073-5_14
editor:
- first_name: Clemente
full_name: Galdi, Clemente
last_name: Galdi
- first_name: Duong Hieu
full_name: Phan, Duong Hieu
last_name: Phan
external_id:
isi:
- '001330408000014'
intvolume: ' 14974'
isi: 1
language:
- iso: eng
month: '09'
oa_version: None
page: 294–313
place: Cham
publication: 'Security and Cryptography for Networks: 14th International Conference'
publication_identifier:
eisbn:
- '9783031710735'
eissn:
- 1611-3349
isbn:
- '9783031710728'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
related_material:
record:
- id: '18088'
relation: dissertation_contains
status: public
status: public
title: 'DeCAF: Decentralizable CGKA with fast healing'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14974
year: '2024'
...
---
APC_amount: 3028,31 EUR
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '18087'
abstract:
- lang: eng
text: We present a theory describing the interaction of structured light, such as
light carrying orbital angular momentum, with molecules. The light-matter interaction
Hamiltonian we derive is expressed through couplings between spherical gradients
of the electric field and the (transition) electric multipole moments of a particle
of any nontrivial rotation point group. Our model can therefore accommodate an
arbitrary complexity of the molecular and electric field structure, and it can
be straightforwardly extended to atoms or nanostructures. Applying this framework
to rovibrational spectroscopy of molecules, we uncover the general mechanism of
angular momentum exchange between the spin and orbital angular momenta of light,
molecular rotation, and its center-of-mass motion. We show that the nonzero vorticity
of Laguerre-Gaussian beams can strongly enhance certain rovibrational transitions
that are considered forbidden in the case of nonhelical light. We discuss the
experimental requirements for the observation of these forbidden transitions in
state-of-the-art spatially resolved spectroscopy measurements.
acknowledgement: We are grateful to Emilio Pisanty and Philipp Lunt for valuable discussions.
This research was funded wholly or in part by the Austrian Science Fund (FWF) [10.55776/F1004].
G.M.K. gratefully acknowledges 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). O.H.H. acknowledges support by the Austrian Science Fund (FWF)
[10.55776/P36040]. Furthermore, the financial support by the Austrian Federal Ministry
for Digital and Economic Affairs, the National Foundation for Research, Technology
and Development, and the Christian Doppler Research Association is gratefully acknowledged.
article_number: '033277'
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Mikhail
full_name: Maslov, Mikhail
id: 2E65BB0E-F248-11E8-B48F-1D18A9856A87
last_name: Maslov
orcid: 0000-0003-4074-2570
- first_name: Georgios
full_name: Koutentakis, Georgios
id: d7b23d3a-9e21-11ec-b482-f76739596b95
last_name: Koutentakis
- first_name: Mateja
full_name: Hrast, Mateja
id: 48dbb294-2a9c-11ef-905d-f56be71f0e5d
last_name: Hrast
- first_name: Oliver H.
full_name: Heckl, Oliver H.
last_name: Heckl
- first_name: Mikhail
full_name: Lemeshko, Mikhail
id: 37CB05FA-F248-11E8-B48F-1D18A9856A87
last_name: Lemeshko
orcid: 0000-0002-6990-7802
citation:
ama: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum
transfer from light to molecules. Physical Review Research. 2024;6(3).
doi:10.1103/physrevresearch.6.033277
apa: Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., & Lemeshko, M. (2024).
Theory of angular momentum transfer from light to molecules. Physical Review
Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.033277
chicago: Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and
Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.”
Physical Review Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.033277.
ieee: M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory
of angular momentum transfer from light to molecules,” Physical Review Research,
vol. 6, no. 3. American Physical Society, 2024.
ista: Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. 2024. Theory of angular
momentum transfer from light to molecules. Physical Review Research. 6(3), 033277.
mla: Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to
Molecules.” Physical Review Research, vol. 6, no. 3, 033277, American Physical
Society, 2024, doi:10.1103/physrevresearch.6.033277.
short: M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review
Research 6 (2024).
corr_author: '1'
date_created: 2024-09-18T11:43:16Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2026-04-07T11:52:53Z
day: '10'
ddc:
- '530'
department:
- _id: GradSch
- _id: MiLe
doi: 10.1103/physrevresearch.6.033277
ec_funded: 1
external_id:
arxiv:
- '2310.00095'
file:
- access_level: open_access
checksum: 8f744d94956a1683b473b1cf9b411a37
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T09:46:20Z
date_updated: 2024-09-23T09:46:20Z
file_id: '18125'
file_name: 2024_PhysicalReviewResearch_Maslov.pdf
file_size: 1563824
relation: main_file
success: 1
file_date_updated: 2024-09-23T09:46:20Z
has_accepted_license: '1'
intvolume: ' 6'
issue: '3'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: 7c040762-9f16-11ee-852c-dd79eeee4ab3
grant_number: F100403
name: Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions
- _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'
- _id: 3AC91DDA-15DF-11EA-824D-93A3E7B544D1
call_identifier: FWF
name: FWF Open Access Fund
publication: Physical Review Research
publication_identifier:
eissn:
- 2643-1564
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
related_material:
record:
- id: '19048'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: Theory of angular momentum transfer from light to molecules
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: 6
year: '2024'
...
---
OA_place: publisher
_id: '18088'
abstract:
- lang: eng
text: "Instant messaging applications like Whatsapp, Signal or Telegram have become
ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption,
but also security guarantees even when the key material gets compromised.\r\nThese
are achieved through frequent key update performed by users.\r\nIn particular,
the compromise of a group key should preserve confidentiality of previously exchanged
messages (forward secrecy), and a subsequent key update will ensure security for
future ones (post-compromise security).\r\nThough great protocols for one-on-one
communication have been known for some time, the design of ones that scale efficiently
for larger groups while achieving akin security guarantees is a hard problem.\r\nA
great deal of research has been aimed at this topic, much of it under the umbrella
of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in
2018, this joint effort by academics and industry culminated in 2023 with the
publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt
the core of secure group messaging is a cryptographic primitive termed Continuous
Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing
group of users to agree on a common key with the added functionality security
against compromises is achieved by users asynchronously issuing a key update.
In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst,
we present a new technique to effect dynamic operations in groups, i.e., add or
remove members, that can be more efficient that the one employed by MLS in certain
settings.\r\nConsidering the setting of users belonging to multiple overlapping
groups, we then show lowerbounds on the communication cost of constructions that
leverage said overlap, at the same time showing protocols that are asymptotically
optimal and efficient for practical settings, respectively. Along the way, we
show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn
important feature in CGKA protocols, particularly for big groups, is the possibility
of executing several group operations concurrently. While later versions of MLS
support this, they do at the cost of worsening the communication efficiency of
future group operations.\r\nIn this thesis we introduce two new protocols that
permit concurrency without any negative effect on efficiency. Our protocols circumvent
previously existing lower bounds by satisfying a new notion of post-compromise
security that only asks for security to be re-established after a certain number
of key updates have taken place. While this can be slower than MLS in terms of
rounds of communication, we show that it leads to more efficient overall communication.
\r\nAdditionally, we introduce a new technique that allows group members to decrease
the information they need to store and download, which makes one of our protocols
enjoy much lower download cost than any other existing CGKA constructions. "
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Guillermo
full_name: Pascual Perez, Guillermo
id: 2D7ABD02-F248-11E8-B48F-1D18A9856A87
last_name: Pascual Perez
orcid: 0000-0001-8630-415X
citation:
ama: Pascual Perez G. On the efficiency and security of secure group messaging.
2024. doi:10.15479/at:ista:18088
apa: Pascual Perez, G. (2024). On the efficiency and security of secure group
messaging. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18088
chicago: Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group
Messaging.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18088.
ieee: G. Pascual Perez, “On the efficiency and security of secure group messaging,”
Institute of Science and Technology Austria, 2024.
ista: Pascual Perez G. 2024. On the efficiency and security of secure group messaging.
Institute of Science and Technology Austria.
mla: Pascual Perez, Guillermo. On the Efficiency and Security of Secure Group
Messaging. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18088.
short: G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging,
Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-09-18T12:59:49Z
date_published: 2024-09-18T00:00:00Z
date_updated: 2026-04-07T13:01:26Z
day: '18'
ddc:
- '000'
degree_awarded: PhD
department:
- _id: KrPi
- _id: GradSch
doi: 10.15479/at:ista:18088
ec_funded: 1
file:
- access_level: closed
checksum: ce0dca715b3df48e52e2e891b6ac1bc5
content_type: application/x-zip-compressed
creator: gpascual
date_created: 2024-09-19T12:35:38Z
date_updated: 2024-09-19T12:35:38Z
file_id: '18099'
file_name: thesis_bundle.zip
file_size: 11917734
relation: source_file
- access_level: open_access
checksum: 4a2c72e90f1a0ef2a13cff800f8d1265
content_type: application/pdf
creator: gpascual
date_created: 2024-09-19T12:36:08Z
date_updated: 2024-09-19T12:36:08Z
file_id: '18100'
file_name: thesis_gpasper.pdf
file_size: 2729427
relation: main_file
file_date_updated: 2024-09-19T12:36:08Z
has_accepted_license: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: '239'
project:
- _id: 2564DBCA-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '665385'
name: International IST Doctoral Program
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10408'
relation: part_of_dissertation
status: public
- id: '11476'
relation: part_of_dissertation
status: public
- id: '18086'
relation: part_of_dissertation
status: public
- id: '10049'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Krzysztof Z
full_name: Pietrzak, Krzysztof Z
id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
last_name: Pietrzak
orcid: 0000-0002-9139-1654
title: On the efficiency and security of secure group messaging
tmp:
image: /images/cc_by_nc_sa.png
legal_code_url: https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC
BY-NC-SA 4.0)
short: CC BY-NC-SA (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
_id: '18097'
abstract:
- lang: eng
text: "In our companion paper \"Tight bounds for the learning of homotopy à la Niyogi,
Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds\"
we gave optimal bounds (in terms of the two one-sided Hausdorff distances) on
a sample P of an input shape \U0001D4AE (either manifold or general set with positive
reach) such that one can infer the homotopy of \U0001D4AE from the union of balls
with some radius centred at P, both in Euclidean space and in a Riemannian manifold
of bounded curvature. The construction showing the optimality of the bounds is
not straightforward. The purpose of this video is to visualize and thus elucidate
said construction in the Euclidean setting."
acknowledgement: "This research has been supported by the European Research Council
(ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF),
grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian
Science Fund (FWF), grant No. I02979-N35. Mathijs Wintraecken: Supported by the
European Union’s Horizon 2020 research and innovation programme under the Marie
Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant
No. M-3073, and the welcome package from IDEX of the Université Côte d’Azur.\r\nWe
thank Jean-Daniel Boissonnat, Herbert Edelsbrunner, and Mariette Yvinec for discussion."
alternative_title:
- LIPIcs
article_number: '87'
article_processing_charge: Yes
author:
- first_name: Dominique
full_name: Attali, Dominique
last_name: Attali
- first_name: Hana
full_name: Kourimska, Hana
id: D9B8E14C-3C26-11EA-98F5-1F833DDC885E
last_name: Kourimska
orcid: 0000-0001-7841-0091
- first_name: Christopher D
full_name: Fillmore, Christopher D
id: 35638A5C-AAC7-11E9-B0BF-5503E6697425
last_name: Fillmore
- first_name: Ishika
full_name: Ghosh, Ishika
id: ee449b28-344d-11ef-a6d5-9ca430e9e9ff
last_name: Ghosh
- first_name: Andre
full_name: Lieutier, Andre
last_name: Lieutier
- first_name: Elizabeth R
full_name: Stephenson, Elizabeth R
id: 2D04F932-F248-11E8-B48F-1D18A9856A87
last_name: Stephenson
orcid: 0000-0002-6862-208X
- first_name: Mathijs
full_name: Wintraecken, Mathijs
id: 307CFBC8-F248-11E8-B48F-1D18A9856A87
last_name: Wintraecken
orcid: 0000-0002-7472-2220
citation:
ama: 'Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality
construction for homotopy inference (media exposition). In: 40th International
Symposium on Computational Geometry. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum
für Informatik; 2024. doi:10.4230/LIPIcs.SoCG.2024.87'
apa: 'Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson,
E. R., & Wintraecken, M. (2024). The ultimate frontier: An optimality construction
for homotopy inference (media exposition). In 40th International Symposium
on Computational Geometry (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum
für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2024.87'
chicago: 'Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh,
Andre Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “The Ultimate
Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).”
In 40th International Symposium on Computational Geometry, Vol. 293. Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.SoCG.2024.87.'
ieee: 'D. Attali et al., “The ultimate frontier: An optimality construction
for homotopy inference (media exposition),” in 40th International Symposium
on Computational Geometry, Athens, Greece, 2024, vol. 293.'
ista: 'Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken
M. 2024. The ultimate frontier: An optimality construction for homotopy inference
(media exposition). 40th International Symposium on Computational Geometry. SoCG:
Symposium on Computational Geometry, LIPIcs, vol. 293, 87.'
mla: 'Attali, Dominique, et al. “The Ultimate Frontier: An Optimality Construction
for Homotopy Inference (Media Exposition).” 40th International Symposium on
Computational Geometry, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für
Informatik, 2024, doi:10.4230/LIPIcs.SoCG.2024.87.'
short: D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson,
M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss
Dagstuhl - Leibniz-Zentrum für Informatik, 2024.
conference:
end_date: 2024-06-14
location: Athens, Greece
name: 'SoCG: Symposium on Computational Geometry'
start_date: 2024-06-11
corr_author: '1'
date_created: 2024-09-19T10:29:48Z
date_published: 2024-06-06T00:00:00Z
date_updated: 2025-04-15T07:16:58Z
day: '06'
ddc:
- '000'
department:
- _id: HeEd
doi: 10.4230/LIPIcs.SoCG.2024.87
ec_funded: 1
file:
- access_level: open_access
checksum: 9355c2e60b8ec285e1b22719c5b73f1a
content_type: application/pdf
creator: dernst
date_created: 2024-09-19T10:30:37Z
date_updated: 2024-09-19T10:30:37Z
file_id: '18098'
file_name: 2024_LIPICs_Attali.pdf
file_size: 3507177
relation: main_file
success: 1
file_date_updated: 2024-09-19T10:30:37Z
has_accepted_license: '1'
intvolume: ' 293'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 266A2E9E-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '788183'
name: Alpha Shape Theory Extended
- _id: 268116B8-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: Z00342
name: Mathematics, Computer Science
- _id: 2561EBF4-B435-11E9-9278-68D0E5697425
call_identifier: FWF
grant_number: I02979-N35
name: Persistence and stability of geometric complexes
- _id: 260C2330-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '754411'
name: ISTplus - Postdoctoral Fellowships
- _id: fc390959-9c52-11eb-aca3-afa58bd282b2
grant_number: M03073
name: Learning and triangulating manifolds via collapses
publication: 40th International Symposium on Computational Geometry
publication_identifier:
isbn:
- '9783959773164'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
status: public
title: 'The ultimate frontier: An optimality construction for homotopy inference (media
exposition)'
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: 293
year: '2024'
...
---
_id: '18107'
abstract:
- lang: eng
text: We consider a dilute fully spin-polarized Fermi gas at positive temperature
in dimensions d∈{1,2,3} . We show that the pressure of the interacting gas is
bounded from below by that of the free gas plus, to leading order, an explicit
term of order adρ2+2/d, where a is the p-wave scattering length of the repulsive
interaction and ρ is the particle density. The results are valid for a wide
range of repulsive interactions, including that of a hard core, and uniform in
temperatures at most of the order of the Fermi temperature. A central ingredient
in the proof is a rigorous implementation of the fermionic cluster expansion of
Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260).
acknowledgement: 'Financial support by the Austrian Science Fund (FWF) through grant
DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.'
article_number: e78
article_processing_charge: Yes
article_type: original
arxiv: 1
author:
- first_name: Asbjørn Bækgaard
full_name: Lauritsen, Asbjørn Bækgaard
id: e1a2682f-dc8d-11ea-abe3-81da9ac728f1
last_name: Lauritsen
orcid: 0000-0003-4476-2288
- first_name: Robert
full_name: Seiringer, Robert
id: 4AFD0470-F248-11E8-B48F-1D18A9856A87
last_name: Seiringer
orcid: 0000-0002-6781-0521
citation:
ama: 'Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas:
Lower bound. Forum of Mathematics, Sigma. 2024;12. doi:10.1017/fms.2024.56'
apa: 'Lauritsen, A. B., & Seiringer, R. (2024). Pressure of a dilute spin-polarized
Fermi gas: Lower bound. Forum of Mathematics, Sigma. Cambridge University
Press. https://doi.org/10.1017/fms.2024.56'
chicago: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute
Spin-Polarized Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma. Cambridge
University Press, 2024. https://doi.org/10.1017/fms.2024.56.'
ieee: 'A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi
gas: Lower bound,” Forum of Mathematics, Sigma, vol. 12. Cambridge University
Press, 2024.'
ista: 'Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi
gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.'
mla: 'Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized
Fermi Gas: Lower Bound.” Forum of Mathematics, Sigma, vol. 12, e78, Cambridge
University Press, 2024, doi:10.1017/fms.2024.56.'
short: A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).
corr_author: '1'
date_created: 2024-09-20T12:25:25Z
date_published: 2024-09-09T00:00:00Z
date_updated: 2026-04-07T13:01:40Z
day: '09'
ddc:
- '510'
department:
- _id: GradSch
- _id: RoSe
doi: 10.1017/fms.2024.56
external_id:
arxiv:
- '2407.05990'
isi:
- '001307817400001'
file:
- access_level: open_access
checksum: 330b881240013213a8e08538fec13d29
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T09:56:17Z
date_updated: 2024-09-23T09:56:17Z
file_id: '18126'
file_name: 2024_ForumMath_Lauritsen.pdf
file_size: 599886
relation: main_file
success: 1
file_date_updated: 2024-09-23T09:56:17Z
has_accepted_license: '1'
intvolume: ' 12'
isi: 1
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
project:
- _id: bda63fe5-d553-11ed-ba76-a16e3d2f256b
grant_number: I06427
name: Mathematical Challenges in BCS Theory of Superconductivity
publication: Forum of Mathematics, Sigma
publication_identifier:
issn:
- 2050-5094
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
related_material:
record:
- id: '18135'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'Pressure of a dilute spin-polarized Fermi gas: Lower bound'
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: 12
year: '2024'
...
---
APC_amount: 2742,92 EUR
OA_place: publisher
OA_type: hybrid
_id: '18108'
abstract:
- lang: eng
text: Here we announce the construction and properties of a big commutative subalgebra
of the Kirillov algebra attached to a finite dimensional irreducible representation
of a complex semisimple Lie group. They are commutative finite flat algebras over
the cohomology of the classifying space of the group. They are isomorphic with
the equivariant intersection cohomology of affine Schubert varieties, endowing
the latter with a new ring structure. Study of the finer aspects of the structure
of the big algebras will also furnish the stalks of the intersection cohomology
with ring structure, thus ringifying Lusztig’s q-weight multiplicity polynomials
i.e., certain affine Kazhdan–Lusztig polynomials.
acknowledgement: "We thank Nigel Hitchin for discussions and the joint projects this
paper has grown out from. We thank Vladyslav Zveryk for collaboration on Theorem
2.3 and on the corresponding Magma code which implements big algebras. We thank
Hiraku Nakajima for discussions and pointing out Theorem 3.1.2, a result generalizing
our original observation in the= = 0 case. Special thanks go to Leonid Rybnikov
for patiently explaining his works, in particular crucial to Theorem 2.1. We thank
Michel Brion, Michael Finkelberg, Oscar García-Prada, Jakub Löwit, Joel Kamnitzer,
Friedrich Knop, Michael McBreen, Anton Mellit, Takuro Mochizuki, Shon Ngô, Kamil
Rychlewicz, Shiyu Shen, Leslie Spencer, Balázs Szendr ˝ oi, András Szenes, and Oksana\r\nYakimova
for comments and discussions. Kamil Rychlewicz and Daniel Bedats helped with the
Mathematica files for the figures, and we used the SM_isospin Tikz package of Izaak
Neutelings for drawing the baryon multiplets. We thank the referees for many useful
comments. We acknowledge funding from FWF grant “Geometry of the tip of the global
nilpotent cone” no. P 35847."
article_number: e2319341121
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Tamás
full_name: Hausel, Tamás
id: 4A0666D8-F248-11E8-B48F-1D18A9856A87
last_name: Hausel
orcid: 0000-0002-9582-2634
citation:
ama: Hausel T. Commutative avatars of representations of semisimple Lie groups.
Proceedings of the National Academy of Sciences of the United States of America.
2024;121(38). doi:10.1073/pnas.2319341121
apa: Hausel, T. (2024). Commutative avatars of representations of semisimple Lie
groups. Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences. https://doi.org/10.1073/pnas.2319341121
chicago: Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie
Groups.” Proceedings of the National Academy of Sciences of the United States
of America. National Academy of Sciences, 2024. https://doi.org/10.1073/pnas.2319341121.
ieee: T. Hausel, “Commutative avatars of representations of semisimple Lie groups,”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 121, no. 38. National Academy of Sciences, 2024.
ista: Hausel T. 2024. Commutative avatars of representations of semisimple Lie groups.
Proceedings of the National Academy of Sciences of the United States of America.
121(38), e2319341121.
mla: Hausel, Tamás. “Commutative Avatars of Representations of Semisimple Lie Groups.”
Proceedings of the National Academy of Sciences of the United States of America,
vol. 121, no. 38, e2319341121, National Academy of Sciences, 2024, doi:10.1073/pnas.2319341121.
short: T. Hausel, Proceedings of the National Academy of Sciences of the United
States of America 121 (2024).
corr_author: '1'
date_created: 2024-09-22T22:01:41Z
date_published: 2024-09-17T00:00:00Z
date_updated: 2025-05-08T09:57:59Z
day: '17'
ddc:
- '510'
department:
- _id: TaHa
doi: 10.1073/pnas.2319341121
external_id:
pmid:
- '39259592'
file:
- access_level: open_access
checksum: df80c873633c6734d2e324841e69db58
content_type: application/pdf
creator: dernst
date_created: 2024-09-23T11:22:56Z
date_updated: 2024-09-23T11:22:56Z
file_id: '18127'
file_name: 2024_PNAS_Hausel.pdf
file_size: 3764695
relation: main_file
success: 1
file_date_updated: 2024-09-23T11:22:56Z
has_accepted_license: '1'
intvolume: ' 121'
issue: '38'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 34b2c9cb-11ca-11ed-8bc3-a50ba74ca4a3
grant_number: P35847
name: Geometry of the tip of the global nilpotent cone
publication: Proceedings of the National Academy of Sciences of the United States
of America
publication_identifier:
eissn:
- 1091-6490
publication_status: published
publisher: National Academy of Sciences
quality_controlled: '1'
related_material:
link:
- relation: press_release
url: https://ista.ac.at/en/news/big-algebras-a-dictionary-of-abstract-math/
scopus_import: '1'
status: public
title: Commutative avatars of representations of semisimple Lie groups
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: 121
year: '2024'
...
---
_id: '18109'
abstract:
- lang: eng
text: Venous thromboembolism (VTE) is a common, deadly disease with an increasing
incidence despite preventive efforts. Clinical observations have associated elevated
antibody concentrations or antibody-based therapies with thrombotic events. However,
how antibodies contribute to thrombosis is unknown. Here, we show that reduced
blood flow enabled immunoglobulin M (IgM) to bind to FcμR and the polymeric immunoglobulin
receptor (pIgR), initiating endothelial activation and platelet recruitment. Subsequently,
the procoagulant surface of activated platelets accommodated antigen- and FcγR-independent
IgG deposition. This leads to classical complement activation, setting in motion
a prothrombotic vicious circle. Key elements of this mechanism were present in
humans in the setting of venous stasis as well as in the dysregulated immunothrombosis
of COVID-19. This antibody-driven thrombosis can be prevented by pharmacologically
targeting complement. Hence, our results uncover antibodies as previously unrecognized
central regulators of thrombosis. These findings carry relevance for therapeutic
application of antibodies and open innovative avenues to target thrombosis without
compromising hemostasis.
acknowledgement: "We thank Michael Carroll (Harvard Medical School, Boston) for providing
Ighmtm1Che, C4−/−, and C3−/− mice; Mark Suter (University of Zurich, Zurich) for
providing Aicda−/− mice; Marina Botto (Imperial College London, London) for providing
C1q−/− and fB−/− mice; Craig Gerard (Harvard Medical School, Boston) for providing
C3aR−/− mice; Falk Nimmerjahn (University Erlangen-Nuernberg, Erlangen) for providing
Fcgr−/−Fcgr2b−/− mice; Karl Lang (University of Duisburg-Essen, Essen) for providing
Fcmr−/− mice; Hans Hengartner and Rolf Zinkernagel (ETH Zurich, Zurich) for providing
KL25 mice; Mark Zabel (University Hospital of Zurich, Zurich) for providing CR2−/−
mice; Christie Ballantyne (Baylor College of Medicine, Houston) for providing CD11c−/−
mice; and Siamon Gordon (University of Oxford, Oxford) for providing CD11b−/− mice.
A.V. wishes to thank Michael Grünaug and dedicates this work to Annette, Rita, and
Hans.\r\nThis 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\n947611) (K.S.). This study was supported by the Deutsche Forschungsgemeinschaft
through the collaborative research center 914 project B02 (K.S. and S.M.), project
B04 (A.V.), project A01 (M.M.), project B01 (M.S.), the collaborative research center
1123 project B07 (K.S. and S.M.), the collaborative research center 359 (project
A03 [K.S.] and B02 [M.S.]), the international research training group 1911 project
B09 (A.V.), the clinical research unit 303 project 7 (A.V.), cluster of excellence
2167 (A.V.), collaborative research center 1526 project 05 (A.V.), the ANR-DFG project
JAKPOT (K.S.), LMUexcellent (K.S.), and the Deutsche Zentrum für Herz-Kreislauf-Forschung
(PostDoc Grant and partner site project [K.S. and S.M.]). M.I. is supported by the
European Research Council (ERC) Advanced Grant 101141363, ERC Proof of Concept Grant
101138728, Italian Association for Cancer Research (AIRC) Grants 19891 and \r\n22737,
Italian Ministry for University and Research Grants PE00000007 (INF-ACT) and PRIN
\r\n2022FMESXL, Funded Research Agreement from Asher Biotherapeutics, VIR Biotechnology,
and BlueJay Therapeutics. V.F. is supported by the Italian Ministry for University
and Research Grants PE00000007 (INF-ACT) and Fondazione Prossimo Mio."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Konstantin
full_name: Stark, Konstantin
last_name: Stark
- first_name: Badr
full_name: Kilani, Badr
last_name: Kilani
- first_name: Sven
full_name: Stockhausen, Sven
last_name: Stockhausen
- first_name: Johanna
full_name: Busse, Johanna
last_name: Busse
- first_name: Irene
full_name: Schubert, Irene
last_name: Schubert
- first_name: Thuy Duong
full_name: Tran, Thuy Duong
last_name: Tran
- first_name: Florian R
full_name: Gärtner, Florian R
id: 397A88EE-F248-11E8-B48F-1D18A9856A87
last_name: Gärtner
orcid: 0000-0001-6120-3723
- first_name: Alexander
full_name: Leunig, Alexander
last_name: Leunig
- first_name: Kami
full_name: Pekayvaz, Kami
last_name: Pekayvaz
- first_name: Leo
full_name: Nicolai, Leo
last_name: Nicolai
- first_name: Valeria
full_name: Fumagalli, Valeria
last_name: Fumagalli
- first_name: Julia
full_name: Stermann, Julia
last_name: Stermann
- first_name: Felix
full_name: Stephan, Felix
last_name: Stephan
- first_name: Christian
full_name: David, Christian
last_name: David
- first_name: Martin B.
full_name: Müller, Martin B.
last_name: Müller
- first_name: Birgitta
full_name: Heyman, Birgitta
last_name: Heyman
- first_name: Anja
full_name: Lux, Anja
last_name: Lux
- first_name: Alexandra
full_name: Da Palma Guerreiro, Alexandra
last_name: Da Palma Guerreiro
- first_name: Lukas P.
full_name: Frenzel, Lukas P.
last_name: Frenzel
- first_name: Christoph Q.
full_name: Schmidt, Christoph Q.
last_name: Schmidt
- first_name: Arthur
full_name: Dopler, Arthur
last_name: Dopler
- first_name: Markus
full_name: Moser, Markus
last_name: Moser
- first_name: Sue
full_name: Chandraratne, Sue
last_name: Chandraratne
- first_name: Marie Luise
full_name: Von Brühl, Marie Luise
last_name: Von Brühl
- first_name: Michael
full_name: Lorenz, Michael
last_name: Lorenz
- first_name: Thomas
full_name: Korff, Thomas
last_name: Korff
- first_name: Martina
full_name: Rudelius, Martina
last_name: Rudelius
- first_name: Oliver
full_name: Popp, Oliver
last_name: Popp
- first_name: Marieluise
full_name: Kirchner, Marieluise
last_name: Kirchner
- first_name: Philipp
full_name: Mertins, Philipp
last_name: Mertins
- first_name: Falk
full_name: Nimmerjahn, Falk
last_name: Nimmerjahn
- first_name: Matteo
full_name: Iannacone, Matteo
last_name: Iannacone
- first_name: Markus
full_name: Sperandio, Markus
last_name: Sperandio
- first_name: Bernd
full_name: Engelmann, Bernd
last_name: Engelmann
- first_name: Admar
full_name: Verschoor, Admar
last_name: Verschoor
- first_name: Steffen
full_name: Massberg, Steffen
last_name: Massberg
citation:
ama: Stark K, Kilani B, Stockhausen S, et al. Antibodies and complement are key
drivers of thrombosis. Immunity. 2024;57(9):2140-2156. doi:10.1016/j.immuni.2024.08.007
apa: Stark, K., Kilani, B., Stockhausen, S., Busse, J., Schubert, I., Tran, T. D.,
… Massberg, S. (2024). Antibodies and complement are key drivers of thrombosis.
Immunity. Elsevier. https://doi.org/10.1016/j.immuni.2024.08.007
chicago: Stark, Konstantin, Badr Kilani, Sven Stockhausen, Johanna Busse, Irene
Schubert, Thuy Duong Tran, Florian R Gärtner, et al. “Antibodies and Complement
Are Key Drivers of Thrombosis.” Immunity. Elsevier, 2024. https://doi.org/10.1016/j.immuni.2024.08.007.
ieee: K. Stark et al., “Antibodies and complement are key drivers of thrombosis,”
Immunity, vol. 57, no. 9. Elsevier, pp. 2140–2156, 2024.
ista: Stark K, Kilani B, Stockhausen S, Busse J, Schubert I, Tran TD, Gärtner FR,
Leunig A, Pekayvaz K, Nicolai L, Fumagalli V, Stermann J, Stephan F, David C,
Müller MB, Heyman B, Lux A, Da Palma Guerreiro A, Frenzel LP, Schmidt CQ, Dopler
A, Moser M, Chandraratne S, Von Brühl ML, Lorenz M, Korff T, Rudelius M, Popp
O, Kirchner M, Mertins P, Nimmerjahn F, Iannacone M, Sperandio M, Engelmann B,
Verschoor A, Massberg S. 2024. Antibodies and complement are key drivers of thrombosis.
Immunity. 57(9), 2140–2156.
mla: Stark, Konstantin, et al. “Antibodies and Complement Are Key Drivers of Thrombosis.”
Immunity, vol. 57, no. 9, Elsevier, 2024, pp. 2140–56, doi:10.1016/j.immuni.2024.08.007.
short: K. Stark, B. Kilani, S. Stockhausen, J. Busse, I. Schubert, T.D. Tran, F.R.
Gärtner, A. Leunig, K. Pekayvaz, L. Nicolai, V. Fumagalli, J. Stermann, F. Stephan,
C. David, M.B. Müller, B. Heyman, A. Lux, A. Da Palma Guerreiro, L.P. Frenzel,
C.Q. Schmidt, A. Dopler, M. Moser, S. Chandraratne, M.L. Von Brühl, M. Lorenz,
T. Korff, M. Rudelius, O. Popp, M. Kirchner, P. Mertins, F. Nimmerjahn, M. Iannacone,
M. Sperandio, B. Engelmann, A. Verschoor, S. Massberg, Immunity 57 (2024) 2140–2156.
date_created: 2024-09-22T22:01:42Z
date_published: 2024-09-10T00:00:00Z
date_updated: 2025-09-08T09:50:13Z
day: '10'
ddc:
- '570'
department:
- _id: MiSi
doi: 10.1016/j.immuni.2024.08.007
external_id:
isi:
- '001317438500001'
pmid:
- '39226900'
file:
- access_level: open_access
checksum: 4683de43d06a8fd8e3fc91af4ddc1ba2
content_type: application/pdf
creator: dernst
date_created: 2024-09-30T09:16:03Z
date_updated: 2024-09-30T09:16:03Z
file_id: '18162'
file_name: 2024_Immunity_Stark.pdf
file_size: 6892750
relation: main_file
success: 1
file_date_updated: 2024-09-30T09:16:03Z
has_accepted_license: '1'
intvolume: ' 57'
isi: 1
issue: '9'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
page: 2140-2156
pmid: 1
publication: Immunity
publication_identifier:
eissn:
- 1097-4180
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Antibodies and complement are key drivers of thrombosis
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: 57
year: '2024'
...
---
_id: '18110'
abstract:
- lang: eng
text: We study a chaotic particle-conserving kinetically constrained model, with
a single parameter which allows us to break reflection symmetry. Through extensive
numerical simulations we find that the domain wall state shows a variety of dynamical
behaviors from localization all the way to ballistic transport, depending on the
value of the reflection breaking parameter. Surprisingly, such anomalous behavior
is not mirrored in infinite-temperature dynamics, which appear to scale diffusively,
in line with expectations for generic interacting models. However, studying the
particle density gradient, we show that the lack of reflection symmetry affects
infinite-temperature dynamics, resulting in an asymmetric dynamical structure
factor. This is in disagreement with normal diffusion and suggests that the model
may also exhibit anomalous dynamics at infinite temperature in the thermodynamic
limit. Finally, we observe low-entangled eigenstates in the spectrum of the model,
a telltale sign of quantum many-body scars.
acknowledgement: "The authors acknowledge useful discussions with M. Serbyn, Z. Papic,
and A. Nunnenkamp. ´\r\nP.B. is supported by the Erwin Schrödinger Center for Quantum
Science & Technology (ESQ) of the Österreichische Akademie der Wissenschaften (ÖAW)
under the Discovery Grant. M.L. acknowledges support from the European Research
Council (ERC) under the European Union’s Horizon 2020 research and innovation programme
(Grant Agreement\r\nNo. 850899). The numerical simulations were performed using
the ITensor library [68] on the Vienna Scientific Cluster (VSC)."
article_number: L100304
article_processing_charge: No
article_type: letter_note
arxiv: 1
author:
- first_name: Pietro
full_name: Brighi, Pietro
id: 4115AF5C-F248-11E8-B48F-1D18A9856A87
last_name: Brighi
orcid: 0000-0002-7969-2729
- first_name: Marko
full_name: Ljubotina, Marko
id: F75EE9BE-5C90-11EA-905D-16643DDC885E
last_name: Ljubotina
orcid: 0000-0003-0038-7068
citation:
ama: Brighi P, Ljubotina M. Anomalous transport in the kinetically constrained quantum
East-West model. Physical Review B. 2024;110(10). doi:10.1103/PhysRevB.110.L100304
apa: Brighi, P., & Ljubotina, M. (2024). Anomalous transport in the kinetically
constrained quantum East-West model. Physical Review B. American Physical
Society. https://doi.org/10.1103/PhysRevB.110.L100304
chicago: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically
Constrained Quantum East-West Model.” Physical Review B. American Physical
Society, 2024. https://doi.org/10.1103/PhysRevB.110.L100304.
ieee: P. Brighi and M. Ljubotina, “Anomalous transport in the kinetically constrained
quantum East-West model,” Physical Review B, vol. 110, no. 10. American
Physical Society, 2024.
ista: Brighi P, Ljubotina M. 2024. Anomalous transport in the kinetically constrained
quantum East-West model. Physical Review B. 110(10), L100304.
mla: Brighi, Pietro, and Marko Ljubotina. “Anomalous Transport in the Kinetically
Constrained Quantum East-West Model.” Physical Review B, vol. 110, no.
10, L100304, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L100304.
short: P. Brighi, M. Ljubotina, Physical Review B 110 (2024).
corr_author: '1'
date_created: 2024-09-22T22:01:42Z
date_published: 2024-09-11T00:00:00Z
date_updated: 2025-09-08T09:49:29Z
day: '11'
department:
- _id: MaSe
doi: 10.1103/PhysRevB.110.L100304
ec_funded: 1
external_id:
arxiv:
- '2405.02102'
isi:
- '001361617100003'
intvolume: ' 110'
isi: 1
issue: '10'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.02102
month: '09'
oa: 1
oa_version: Preprint
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication: Physical Review B
publication_identifier:
eissn:
- 2469-9969
issn:
- 2469-9950
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Anomalous transport in the kinetically constrained quantum East-West model
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 110
year: '2024'
...
---
DOAJ_listed: '1'
_id: '18111'
abstract:
- lang: eng
text: Observations of tidal disruption events (TDEs) show signs of nitrogen enrichment
reminiscent of other astrophysical sources such as active galactic nuclei and
star-forming galaxies. Given that TDEs probe the gas from a single star, it is
possible to test whether the observed enrichment is consistent with expectations
from the CNO cycle by looking at the observed nitrogen/carbon (N/C) abundance
ratios. Given that ≈20% of solar-mass stars (and an even larger fraction of more
massive stars) live in close binaries, it is worthwhile to also consider what
TDEs from stars influenced by binary evolution would look like. We show here that
TDEs from stars stripped of their hydrogen-rich (and nitrogen-poor) envelopes
through previous binary-induced mass loss can produce much higher observable N/C
enhancements than even TDEs from massive stars. Additionally, we predict that
the time dependence of the N/C abundance ratio in the mass fallback rate of stripped
stars will follow the inverse behavior of main-sequence stars, enabling a more
accurate characterization of the disrupted star.
acknowledgement: "This work was performed in part at Aspen Center for Physics, which
is supported by National Science Foundation grant PHY-2210452. We thank the participants
and organizers of the summer Aspen 2023 workshop on “Stellar Interactions and the
Transients They Cause” for fruitful discussions. B.M. is grateful for support from
the Carnegie Theoretical Astrophysics\r\nCenter. M.G.-G. is grateful for the support
from Northwestern University’s Presidential Fellowship. E.R.-R. thanks the Heising-Simons
Foundation, NSF (AST-2150255 and AST2307710), Swift (80NSSC21K1409, 80NSSC19K1391),
and Chandra (22-0142) for support. "
article_number: L9
article_processing_charge: Yes
article_type: original
author:
- first_name: Brenna
full_name: Mockler, Brenna
last_name: Mockler
- first_name: Monica
full_name: Gallegos-Garcia, Monica
last_name: Gallegos-Garcia
- first_name: Ylva Louise Linsdotter
full_name: Götberg, Ylva Louise Linsdotter
id: d0648d0c-0f64-11ee-a2e0-dd0faa2e4f7d
last_name: Götberg
orcid: 0000-0002-6960-6911
- first_name: Jon M.
full_name: Miller, Jon M.
last_name: Miller
- first_name: Enrico
full_name: Ramirez-Ruiz, Enrico
last_name: Ramirez-Ruiz
citation:
ama: Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. Tidal
disruption events from stripped stars. Astrophysical Journal Letters. 2024;973(1).
doi:10.3847/2041-8213/ad6c34
apa: Mockler, B., Gallegos-Garcia, M., Götberg, Y. L. L., Miller, J. M., & Ramirez-Ruiz,
E. (2024). Tidal disruption events from stripped stars. Astrophysical Journal
Letters. IOP Publishing. https://doi.org/10.3847/2041-8213/ad6c34
chicago: Mockler, Brenna, Monica Gallegos-Garcia, Ylva Louise Linsdotter Götberg,
Jon M. Miller, and Enrico Ramirez-Ruiz. “Tidal Disruption Events from Stripped
Stars.” Astrophysical Journal Letters. IOP Publishing, 2024. https://doi.org/10.3847/2041-8213/ad6c34.
ieee: B. Mockler, M. Gallegos-Garcia, Y. L. L. Götberg, J. M. Miller, and E. Ramirez-Ruiz,
“Tidal disruption events from stripped stars,” Astrophysical Journal Letters,
vol. 973, no. 1. IOP Publishing, 2024.
ista: Mockler B, Gallegos-Garcia M, Götberg YLL, Miller JM, Ramirez-Ruiz E. 2024.
Tidal disruption events from stripped stars. Astrophysical Journal Letters. 973(1),
L9.
mla: Mockler, Brenna, et al. “Tidal Disruption Events from Stripped Stars.” Astrophysical
Journal Letters, vol. 973, no. 1, L9, IOP Publishing, 2024, doi:10.3847/2041-8213/ad6c34.
short: B. Mockler, M. Gallegos-Garcia, Y.L.L. Götberg, J.M. Miller, E. Ramirez-Ruiz,
Astrophysical Journal Letters 973 (2024).
date_created: 2024-09-22T22:01:42Z
date_published: 2024-09-12T00:00:00Z
date_updated: 2025-09-08T09:48:50Z
day: '12'
ddc:
- '520'
department:
- _id: YlGo
doi: 10.3847/2041-8213/ad6c34
external_id:
isi:
- '001310592900001'
file:
- access_level: open_access
checksum: 050ddf873244839825714cca42b5d857
content_type: application/pdf
creator: dernst
date_created: 2024-09-30T08:54:26Z
date_updated: 2024-09-30T08:54:26Z
file_id: '18161'
file_name: 2024_AstrophysicalJourn_Mockler.pdf
file_size: 844227
relation: main_file
success: 1
file_date_updated: 2024-09-30T08:54:26Z
has_accepted_license: '1'
intvolume: ' 973'
isi: 1
issue: '1'
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: Astrophysical Journal Letters
publication_identifier:
eissn:
- 2041-8213
issn:
- 2041-8205
publication_status: published
publisher: IOP Publishing
quality_controlled: '1'
scopus_import: '1'
status: public
title: Tidal disruption events from stripped stars
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 973
year: '2024'
...
---
_id: '18113'
abstract:
- lang: eng
text: 'The emergence of accurate open large language models (LLMs) has led to a
race towards performant quantization techniques which can enable their execution
on end-user devices. In this paper, we revisit the problem of “extreme” LLM compression—defined
as targeting extremely low bit counts, such as 2 to 3 bits per parameter—from
the point of view of classic methods in Multi-Codebook Quantization (MCQ). Our
algorithm, called AQLM, generalizes the classic Additive Quantization (AQ) approach
for information retrieval to advance the state-of-the-art in LLM compression,
via two innovations: 1) learned additive quantization of weight matrices in input-adaptive
fashion, and 2) joint optimization of codebook parameters across each transformer
blocks. Broadly, AQLM is the first scheme that is Pareto optimal in terms of accuracy-vs-model-size
when compressing to less than 3 bits per parameter, and significantly improves
upon all known schemes in the extreme compression (2bit) regime. In addition,
AQLM is practical: we provide fast GPU and CPU implementations of AQLM for token
generation, which enable us to match or outperform optimized FP16 implementations
for speed, while executing in a much smaller memory footprint.'
acknowledgement: "Authors would like to thank Ruslan Svirschevski for his help in
solving technical issues with AQLM and baselines. We also thank Tim Dettmers for
helpful discussions on the structure of weights in modern LLMs and size-accuracy
trade-offs. The authors would also like to thank Daniil Pavlov for his assistance
with CPU benchmarking. Finally, authors would like to thank the communities of ML
enthusiasts known as LocalLLaMA5 and Petals community on discord6\r\nfor the crowd
wisdom about running LLMs on consumer devices. Egiazarian Vage and Denis Kuznedelev
and Andrei Panferov were supported by the grant for research centers in the field
of AI provided by the Analytical Center for the Government of the Russian Federation
(ACRF) in\r\naccordance with the agreement on the provision of subsidies (identifier
of the agreement 000000D730321P5Q0002) and the agreement with HSE University No.
70-2021-00139."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Vage
full_name: Egiazarian, Vage
last_name: Egiazarian
- first_name: Andrei
full_name: Panferov, Andrei
id: 2c18daae-4dbe-11ef-8491-98ce2d960f09
last_name: Panferov
- first_name: Denis
full_name: Kuznedelev, Denis
last_name: Kuznedelev
- first_name: Elias
full_name: Frantar, Elias
id: 09a8f98d-ec99-11ea-ae11-c063a7b7fe5f
last_name: Frantar
- first_name: Artem
full_name: Babenko, Artem
last_name: Babenko
- 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: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A.
Extreme compression of large language models via additive quantization. In: Proceedings
of the 41st International Conference on Machine Learning. Vol 235. ML Research
Press; 2024:12284-12303.'
apa: 'Egiazarian, V., Panferov, A., Kuznedelev, D., Frantar, E., Babenko, A., &
Alistarh, D.-A. (2024). Extreme compression of large language models via additive
quantization. In Proceedings of the 41st International Conference on Machine
Learning (Vol. 235, pp. 12284–12303). Vienna, Austria: ML Research Press.'
chicago: Egiazarian, Vage, Andrei Panferov, Denis Kuznedelev, Elias Frantar, Artem
Babenko, and Dan-Adrian Alistarh. “Extreme Compression of Large Language Models
via Additive Quantization.” In Proceedings of the 41st International Conference
on Machine Learning, 235:12284–303. ML Research Press, 2024.
ieee: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, and D.-A.
Alistarh, “Extreme compression of large language models via additive quantization,”
in Proceedings of the 41st International Conference on Machine Learning,
Vienna, Austria, 2024, vol. 235, pp. 12284–12303.
ista: 'Egiazarian V, Panferov A, Kuznedelev D, Frantar E, Babenko A, Alistarh D-A.
2024. Extreme compression of large language models via additive quantization.
Proceedings of the 41st International Conference on Machine Learning. ICML: International
Conference on Machine Learning, PMLR, vol. 235, 12284–12303.'
mla: Egiazarian, Vage, et al. “Extreme Compression of Large Language Models via
Additive Quantization.” Proceedings of the 41st International Conference on
Machine Learning, vol. 235, ML Research Press, 2024, pp. 12284–303.
short: V. Egiazarian, A. Panferov, D. Kuznedelev, E. Frantar, A. Babenko, D.-A.
Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning,
ML Research Press, 2024, pp. 12284–12303.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
corr_author: '1'
date_created: 2024-09-22T22:01:43Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2024-10-01T08:13:05Z
day: '01'
department:
- _id: DaAl
- _id: GradSch
external_id:
arxiv:
- '2401.06118'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: ' https://doi.org/10.48550/arXiv.2401.06118'
month: '09'
oa: 1
oa_version: Preprint
page: 12284-12303
publication: Proceedings of the 41st 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: Extreme compression of large language models via additive quantization
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...
---
OA_place: publisher
OA_type: diamond
_id: '18114'
abstract:
- lang: eng
text: This paper presents Mechanistic Neural Networks, a neural network design for
machine learning applications in the sciences. It incorporates a new Mechanistic
Block in standard architectures to explicitly learn governing differential equations
as representations, revealing the underlying dynamics of data and enhancing interpretability
and efficiency in data modeling. Central to our approach is a novel Relaxed Linear
Programming Solver (NeuRLP) inspired by a technique that reduces solving linear
ODEs to solving linear programs. This integrates well with neural networks and
surpasses the limitations of traditional ODE solvers enabling scalable GPU parallel
processing. Overall, Mechanistic Neural Networks demonstrate their versatility
for scientific machine learning applications, adeptly managing tasks from equation
discovery to dynamic systems modeling. We prove their comprehensive capabilities
in analyzing and interpreting complex scientific data across various applications,
showing significant performance against specialized state-of-the-art methods.
Source code is available at https://github.com/alpz/mech-nn.
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Adeel A
full_name: Pervez, Adeel A
id: fca6d90c-d47f-11ee-bc87-93ff51604981
last_name: Pervez
- first_name: Francesco
full_name: Locatello, Francesco
id: 26cfd52f-2483-11ee-8040-88983bcc06d4
last_name: Locatello
orcid: 0000-0002-4850-0683
- first_name: Efstratios
full_name: Gavves, Efstratios
last_name: Gavves
citation:
ama: 'Pervez AA, Locatello F, Gavves E. Mechanistic neural networks for scientific
machine learning. In: Proceedings of the 41st International Conference on Machine
Learning. Vol 235. ML Research Press; 2024:40484-40501.'
apa: 'Pervez, A. A., Locatello, F., & Gavves, E. (2024). Mechanistic neural
networks for scientific machine learning. In Proceedings of the 41st International
Conference on Machine Learning (Vol. 235, pp. 40484–40501). Vienna, Austria:
ML Research Press.'
chicago: Pervez, Adeel A, Francesco Locatello, and Efstratios Gavves. “Mechanistic
Neural Networks for Scientific Machine Learning.” In Proceedings of the 41st
International Conference on Machine Learning, 235:40484–501. ML Research Press,
2024.
ieee: A. A. Pervez, F. Locatello, and E. Gavves, “Mechanistic neural networks for
scientific machine learning,” in Proceedings of the 41st International Conference
on Machine Learning, Vienna, Austria, 2024, vol. 235, pp. 40484–40501.
ista: 'Pervez AA, Locatello F, Gavves E. 2024. Mechanistic neural networks for scientific
machine learning. Proceedings of the 41st International Conference on Machine
Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235,
40484–40501.'
mla: Pervez, Adeel A., et al. “Mechanistic Neural Networks for Scientific Machine
Learning.” Proceedings of the 41st International Conference on Machine Learning,
vol. 235, ML Research Press, 2024, pp. 40484–501.
short: A.A. Pervez, F. Locatello, E. Gavves, in:, Proceedings of the 41st International
Conference on Machine Learning, ML Research Press, 2024, pp. 40484–40501.
conference:
end_date: 2024-07-27
location: Vienna, Austria
name: 'ICML: International Conference on Machine Learning'
start_date: 2024-07-21
date_created: 2024-09-22T22:01:43Z
date_published: 2024-09-01T00:00:00Z
date_updated: 2026-06-18T17:59:46Z
day: '01'
ddc:
- '000'
department:
- _id: FrLo
external_id:
arxiv:
- '2402.13077'
intvolume: ' 235'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2402.13077
month: '09'
oa: 1
oa_version: Published Version
page: 40484-40501
publication: Proceedings of the 41st International Conference on Machine Learning
publication_identifier:
eissn:
- 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
related_material:
link:
- relation: software
url: https://github.com/alpz/mech-nn
scopus_import: '1'
status: public
title: Mechanistic neural networks for scientific machine learning
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 235
year: '2024'
...