---
_id: '18899'
abstract:
- lang: eng
text: "The flourishing theory of classical optimal transport concerns mass transportation
at minimal cost. This book introduces the reader to optimal transport on quantum
structures, i.e., optimal transportation between quantum states and related non-commutative
concepts of mass transportation. It contains lecture notes on\r\n\r\nclassical
optimal transport and Wasserstein gradient flows\r\ndynamics and quantum optimal
transport\r\nquantum couplings and many-body problems\r\nquantum channels and
qubits\r\n\r\nThese notes are based on lectures given by the authors at the \"Optimal
Transport on Quantum Structures\" School held at the Erdös Center in Budapest
in the fall of 2022. The lecture notes are complemented by two survey chapters
presenting the state of the art in different research areas of non-commutative
optimal transport."
alternative_title:
- Bolyai Society Mathematical Studies
article_processing_charge: No
citation:
ama: 'Maas J, Rademacher SAE, Titkos T, Virosztek D, eds. Optimal Transport on
Quantum Structures. Vol 29. Cham: Springer Nature; 2024. doi:10.1007/978-3-031-50466-2'
apa: 'Maas, J., Rademacher, S. A. E., Titkos, T., & Virosztek, D. (Eds.). (2024).
Optimal Transport on Quantum Structures (Vol. 29). Cham: Springer Nature.
https://doi.org/10.1007/978-3-031-50466-2'
chicago: 'Maas, Jan, Simone Anna Elvira Rademacher, Tamás Titkos, and Daniel Virosztek,
eds. Optimal Transport on Quantum Structures. Vol. 29. BSMS. Cham: Springer
Nature, 2024. https://doi.org/10.1007/978-3-031-50466-2.'
ieee: 'J. Maas, S. A. E. Rademacher, T. Titkos, and D. Virosztek, Eds., Optimal
Transport on Quantum Structures, vol. 29. Cham: Springer Nature, 2024.'
ista: 'Maas J, Rademacher SAE, Titkos T, Virosztek D eds. 2024. Optimal Transport
on Quantum Structures, Cham: Springer Nature,p.'
mla: Maas, Jan, et al., editors. Optimal Transport on Quantum Structures.
Vol. 29, Springer Nature, 2024, doi:10.1007/978-3-031-50466-2.
short: J. Maas, S.A.E. Rademacher, T. Titkos, D. Virosztek, eds., Optimal Transport
on Quantum Structures, Springer Nature, Cham, 2024.
date_created: 2025-01-27T12:26:03Z
date_published: 2024-09-19T00:00:00Z
date_updated: 2025-02-17T12:22:18Z
day: '19'
department:
- _id: JaMa
doi: 10.1007/978-3-031-50466-2
editor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
- first_name: Simone Anna Elvira
full_name: Rademacher, Simone Anna Elvira
id: 856966FE-A408-11E9-977E-802DE6697425
last_name: Rademacher
orcid: 0000-0001-5059-4466
- first_name: Tamás
full_name: Titkos, Tamás
last_name: Titkos
- first_name: Daniel
full_name: Virosztek, Daniel
id: 48DB45DA-F248-11E8-B48F-1D18A9856A87
last_name: Virosztek
orcid: 0000-0003-1109-5511
intvolume: ' 29'
language:
- iso: eng
month: '09'
oa_version: None
place: Cham
publication_identifier:
eisbn:
- '9783031504662'
eissn:
- 2947-9460
isbn:
- '9783031504655'
issn:
- 1217-4696
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: BSMS
status: public
title: Optimal Transport on Quantum Structures
type: book_editor
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 29
year: '2024'
...
---
OA_type: closed access
_id: '18922'
abstract:
- lang: eng
text: 'Let G be a directed graph with m edges and n vertices. We present a deterministic
linear-time algorithm for computing the 3-edge-connected components of G. This
is a significant improvement over the previous best bound by Georgiadis et al.
[SODA 2023], which is Õ(m√{m}) and randomized. Our result is based on a novel
characterization of 2-edge cuts in directed graphs and on a new technique that
exploits the concept of divergent spanning trees and 2-connectivity-light graphs,
and requires a careful modification of the minset-poset technique of Gabow [TALG
2016]. As a side result, our new technique yields also an oracle for providing
in constant time a minimum edge-cut for any two vertices that are not 3-edge-connected.
The oracle uses space O(n) and can be built in O(mlog n) time: given two query
vertices, it determines in constant time whether they are 3-edge-connected, or
provides a k-edge cut, with k≤ 2, that separates them.'
acknowledgement: "Giuseppe F. Italiano was partially supported by the Italian Ministry
of\r\nUniversity and Reseach under PRIN Project n. 2022TS4Y3N - EXPAND: scalable
algorithms for EXPloratory Analyses of heterogeneous and dynamic Networked Data.\r\n"
article_processing_charge: No
author:
- first_name: Loukas
full_name: Georgiadis, Loukas
last_name: Georgiadis
- first_name: Giuseppe F.
full_name: Italiano, Giuseppe F.
last_name: Italiano
- first_name: Evangelos
full_name: Kosinas, Evangelos
id: 4c7f9625-dbbc-11ee-9d86-bdcc2db5a949
last_name: Kosinas
citation:
ama: 'Georgiadis L, Italiano GF, Kosinas E. Computing the 3-edge-connected components
of directed graphs in linear time. In: 65th Annual Symposium on Foundations
of Computer Science. IEEE; 2024:62-85. doi:10.1109/focs61266.2024.00015'
apa: 'Georgiadis, L., Italiano, G. F., & Kosinas, E. (2024). Computing the 3-edge-connected
components of directed graphs in linear time. In 65th Annual Symposium on Foundations
of Computer Science (pp. 62–85). Chicago, IL, United States: IEEE. https://doi.org/10.1109/focs61266.2024.00015'
chicago: Georgiadis, Loukas, Giuseppe F. Italiano, and Evangelos Kosinas. “Computing
the 3-Edge-Connected Components of Directed Graphs in Linear Time.” In 65th
Annual Symposium on Foundations of Computer Science, 62–85. IEEE, 2024. https://doi.org/10.1109/focs61266.2024.00015.
ieee: L. Georgiadis, G. F. Italiano, and E. Kosinas, “Computing the 3-edge-connected
components of directed graphs in linear time,” in 65th Annual Symposium on
Foundations of Computer Science, Chicago, IL, United States, 2024, pp. 62–85.
ista: 'Georgiadis L, Italiano GF, Kosinas E. 2024. Computing the 3-edge-connected
components of directed graphs in linear time. 65th Annual Symposium on Foundations
of Computer Science. FOCS: Foundations of Computer Science, 62–85.'
mla: Georgiadis, Loukas, et al. “Computing the 3-Edge-Connected Components of Directed
Graphs in Linear Time.” 65th Annual Symposium on Foundations of Computer Science,
IEEE, 2024, pp. 62–85, doi:10.1109/focs61266.2024.00015.
short: L. Georgiadis, G.F. Italiano, E. Kosinas, in:, 65th Annual Symposium on Foundations
of Computer Science, IEEE, 2024, pp. 62–85.
conference:
end_date: 2024-10-30
location: Chicago, IL, United States
name: 'FOCS: Foundations of Computer Science'
start_date: 2024-10-27
corr_author: '1'
date_created: 2025-01-27T14:50:23Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-09-09T12:08:47Z
day: '01'
department:
- _id: MoHe
doi: 10.1109/focs61266.2024.00015
external_id:
isi:
- '001419526400005'
isi: 1
language:
- iso: eng
month: '10'
oa_version: None
page: 62-85
publication: 65th Annual Symposium on Foundations of Computer Science
publication_identifier:
isbn:
- '9798331516741'
publication_status: published
publisher: IEEE
quality_controlled: '1'
scopus_import: '1'
status: public
title: Computing the 3-edge-connected components of directed graphs in linear time
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '18923'
abstract:
- lang: eng
text: 'Combinatorial optimization is a challenging problem applicable in a wide
range of fields from logistics to finance. Recently, quantum computing has been
used to attempt to solve these problems using a range of algorithms, including
parameterized quantum circuits, adiabatic protocols, and quantum annealing. These
solutions typically have several challenges: 1) there is little to no performance
gain over classical methods; 2) not all constraints and objectives may be efficiently
encoded in the quantum ansatz; and 3) the solution domain of the objective function
may not be the same as the bit strings of measurement outcomes. This work presents
“nonnative hybrid algorithms”: a framework to overcome these challenges by integrating
quantum and classical resources with a hybrid approach. By designing nonnative
quantum variational anosatzes that inherit some but not all problem structure,
measurement outcomes from the quantum computer can act as a resource to be used
by classical routines to indirectly compute optimal solutions, partially overcoming
the challenges of contemporary quantum optimization approaches. These methods
are demonstrated using a publicly available neutral-atom quantum computer on two
simple problems of Max k-Cut and maximum independent set. We find improvements
in solution quality when comparing the hybrid algorithm to its “no quantum” version,
a demonstration of a “comparative advantage.”'
acknowledgement: "The authors would like to thank Alexander Keesling, Maddie Cain,
Nate Gemelke, and Phillip Weinberg for helpful discussions and Danylo Lykov who
had early contributions to this work.\r\n10.13039/100000185-Defense Advanced Research
Projects Agency Noisy Intermediate-Scale Quantum Devices (Grant Number: W911NF2010021),
DARPA Small Business Technology Transfer program (Grant Number: 140D0422C0035)."
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jonathan
full_name: Wurtz, Jonathan
last_name: Wurtz
- first_name: Stefan
full_name: Sack, Stefan
id: dd622248-f6e0-11ea-865d-ce382a1c81a5
last_name: Sack
orcid: 0000-0001-5400-8508
- first_name: Sheng-Tao
full_name: Wang, Sheng-Tao
last_name: Wang
citation:
ama: Wurtz J, Sack S, Wang S-T. Solving nonnative combinatorial optimization problems
using hybrid quantum–classical algorithms. IEEE Transactions on Quantum Engineering.
2024;5:1-14. doi:10.1109/tqe.2024.3443660
apa: Wurtz, J., Sack, S., & Wang, S.-T. (2024). Solving nonnative combinatorial
optimization problems using hybrid quantum–classical algorithms. IEEE Transactions
on Quantum Engineering. Institute of Electrical and Electronics Engineers
. https://doi.org/10.1109/tqe.2024.3443660
chicago: Wurtz, Jonathan, Stefan Sack, and Sheng-Tao Wang. “Solving Nonnative Combinatorial
Optimization Problems Using Hybrid Quantum–Classical Algorithms.” IEEE Transactions
on Quantum Engineering. Institute of Electrical and Electronics Engineers
, 2024. https://doi.org/10.1109/tqe.2024.3443660.
ieee: J. Wurtz, S. Sack, and S.-T. Wang, “Solving nonnative combinatorial optimization
problems using hybrid quantum–classical algorithms,” IEEE Transactions on Quantum
Engineering, vol. 5. Institute of Electrical and Electronics Engineers , pp.
1–14, 2024.
ista: Wurtz J, Sack S, Wang S-T. 2024. Solving nonnative combinatorial optimization
problems using hybrid quantum–classical algorithms. IEEE Transactions on Quantum
Engineering. 5, 1–14.
mla: Wurtz, Jonathan, et al. “Solving Nonnative Combinatorial Optimization Problems
Using Hybrid Quantum–Classical Algorithms.” IEEE Transactions on Quantum Engineering,
vol. 5, Institute of Electrical and Electronics Engineers , 2024, pp. 1–14, doi:10.1109/tqe.2024.3443660.
short: J. Wurtz, S. Sack, S.-T. Wang, IEEE Transactions on Quantum Engineering 5
(2024) 1–14.
date_created: 2025-01-27T15:00:44Z
date_published: 2024-08-14T00:00:00Z
date_updated: 2025-01-27T15:06:15Z
day: '14'
ddc:
- '530'
department:
- _id: MaSe
doi: 10.1109/tqe.2024.3443660
file:
- access_level: open_access
checksum: 19b84e35cba05bde72bfe7e0b54c3e6c
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T15:03:09Z
date_updated: 2025-01-27T15:03:09Z
file_id: '18924'
file_name: 2024_IEEEQuantumComputing_Wurtz.pdf
file_size: 1753095
relation: main_file
success: 1
file_date_updated: 2025-01-27T15:03:09Z
has_accepted_license: '1'
intvolume: ' 5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '08'
oa: 1
oa_version: Published Version
page: 1-14
publication: IEEE Transactions on Quantum Engineering
publication_identifier:
issn:
- 2689-1808
publication_status: published
publisher: 'Institute of Electrical and Electronics Engineers '
quality_controlled: '1'
scopus_import: '1'
status: public
title: Solving nonnative combinatorial optimization problems using hybrid quantum–classical
algorithms
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2024'
...
---
OA_place: publisher
OA_type: gold
_id: '18928'
abstract:
- lang: eng
text: "Algorithms with predictions is a new research direction that leverages machine
learned predictions for algorithm design. So far a plethora of recent works have
incorporated predictions to improve on worst-case bounds for online problems.
In this paper, we initiate the study of complexity of dynamic data structures
with predictions, including dynamic graph algorithms. Unlike online algorithms,
the goal in dynamic data structures is to maintain the solution efficiently with
every update.\r\nWe investigate three natural models of prediction: (1) δ-accurate
predictions where each predicted request matches the true request with probability
δ, (2) list-accurate predictions where a true request comes from a list of possible
requests, and (3) bounded delay predictions where the true requests are a permutation
of the predicted requests. We give general reductions among the prediction models,
showing that bounded delay is the strongest prediction model, followed by list-accurate,
and δ-accurate.\r\nFurther, we identify two broad problem classes based on lower
bounds due to the Online Matrix Vector (OMv) conjecture. Specifically, we show
that locally correctable dynamic problems have strong conditional lower bounds
for list-accurate predictions that are equivalent to the non-prediction setting,
unless list-accurate predictions are perfect. Moreover, we show that locally reducible
dynamic problems have time complexity that degrades gracefully with the quality
of bounded delay predictions. We categorize problems with known OMv lower bounds
accordingly and give several upper bounds in the delay model that show that our
lower bounds are almost tight.\r\nWe note that concurrent work by v.d.Brand et
al. [SODA '24] and Liu and Srinivas [arXiv:2307.08890] independently study dynamic
graph algorithms with predictions, but their work is mostly focused on showing
upper bounds."
acknowledgement: "Henzinger, Monika: This project has received funding from the European
Research Council (ERC) under the European Union’s Horizon 2020 research and innovation
programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) project
Z 422-N, project I 5982-N, and project P 33775-N, with additional funding from the
netidee SCIENCE Stiftung, 2020-2024.\r\nSaha, Barna: This project is partially supported
by NSF grants 1652303, 1909046, 2112533, and HDR TRIPODS Phase II grant 2217058.\r\nWe
would like to thank Andrea Lincoln for many helpful discussions and insightful comments."
alternative_title:
- LIPIcs
article_processing_charge: Yes
arxiv: 1
author:
- first_name: Monika H
full_name: Henzinger, Monika H
id: 540c9bbd-f2de-11ec-812d-d04a5be85630
last_name: Henzinger
orcid: 0000-0002-5008-6530
- first_name: Barna
full_name: Saha, Barna
last_name: Saha
- first_name: Martin P.
full_name: Seybold, Martin P.
last_name: Seybold
- first_name: Christopher
full_name: Ye, Christopher
last_name: Ye
citation:
ama: 'Henzinger M, Saha B, Seybold MP, Ye C. On the complexity of algorithms with
predictions for dynamic graph problems. In: 15th Innovations in Theoretical
Computer Science Conference. Vol 287. Schloss Dagstuhl - Leibniz-Zentrum für
Informatik; 2024:62:1-62:25. doi:10.4230/LIPIcs.ITCS.2024.62'
apa: 'Henzinger, M., Saha, B., Seybold, M. P., & Ye, C. (2024). On the complexity
of algorithms with predictions for dynamic graph problems. In 15th Innovations
in Theoretical Computer Science Conference (Vol. 287, p. 62:1-62:25). Berkeley,
CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITCS.2024.62'
chicago: Henzinger, Monika, Barna Saha, Martin P. Seybold, and Christopher Ye. “On
the Complexity of Algorithms with Predictions for Dynamic Graph Problems.” In
15th Innovations in Theoretical Computer Science Conference, 287:62:1-62:25.
Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.ITCS.2024.62.
ieee: M. Henzinger, B. Saha, M. P. Seybold, and C. Ye, “On the complexity of algorithms
with predictions for dynamic graph problems,” in 15th Innovations in Theoretical
Computer Science Conference, Berkeley, CA, United States, 2024, vol. 287,
p. 62:1-62:25.
ista: 'Henzinger M, Saha B, Seybold MP, Ye C. 2024. On the complexity of algorithms
with predictions for dynamic graph problems. 15th Innovations in Theoretical Computer
Science Conference. ITCS: Innovations in Theoretical Computer Science, LIPIcs,
vol. 287, 62:1-62:25.'
mla: Henzinger, Monika, et al. “On the Complexity of Algorithms with Predictions
for Dynamic Graph Problems.” 15th Innovations in Theoretical Computer Science
Conference, vol. 287, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024,
p. 62:1-62:25, doi:10.4230/LIPIcs.ITCS.2024.62.
short: M. Henzinger, B. Saha, M.P. Seybold, C. Ye, in:, 15th Innovations in Theoretical
Computer Science Conference, Schloss Dagstuhl - Leibniz-Zentrum für Informatik,
2024, p. 62:1-62:25.
conference:
end_date: 2024-02-02
location: Berkeley, CA, United States
name: 'ITCS: Innovations in Theoretical Computer Science'
start_date: 2024-01-30
corr_author: '1'
date_created: 2025-01-27T15:33:42Z
date_published: 2024-01-24T00:00:00Z
date_updated: 2025-09-09T12:11:33Z
day: '24'
ddc:
- '000'
department:
- _id: MoHe
doi: 10.4230/LIPIcs.ITCS.2024.62
ec_funded: 1
external_id:
arxiv:
- '2307.16771'
isi:
- '001300389400062'
file:
- access_level: open_access
checksum: 15085a5b3697a408b92a4a7a27293927
content_type: application/pdf
creator: dernst
date_created: 2025-01-27T15:33:24Z
date_updated: 2025-01-27T15:33:24Z
file_id: '18929'
file_name: 2024_LIPICs_HenzingerMo.pdf
file_size: 1084372
relation: main_file
success: 1
file_date_updated: 2025-01-27T15:33:24Z
has_accepted_license: '1'
intvolume: ' 287'
isi: 1
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
page: 62:1-62:25
project:
- _id: bd9ca328-d553-11ed-ba76-dc4f890cfe62
call_identifier: H2020
grant_number: '101019564'
name: The design and evaluation of modern fully dynamic data structures
- _id: 34def286-11ca-11ed-8bc3-da5948e1613c
grant_number: Z00422
name: Efficient algorithms
- _id: bda196b2-d553-11ed-ba76-8e8ee6c21103
grant_number: I05982
name: Static and Dynamic Hierarchical Graph Decompositions
- _id: bd9e3a2e-d553-11ed-ba76-8aa684ce17fe
grant_number: P33775
name: Fast Algorithms for a Reactive Network Layer
publication: 15th Innovations in Theoretical Computer Science Conference
publication_identifier:
eissn:
- 1868-8969
isbn:
- '9783959773096'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: On the complexity of algorithms with predictions for dynamic graph problems
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 287
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18944'
abstract:
- lang: eng
text: 'Understanding connectivity patterns exhibited by endangered species living
in fragmented habitats is fundamental to improving management and conservation
actions. Such improvements can be particularly pressing at the trailing edges
of these habitats, where populations are facing the greatest challenges from climate
change, and appear even more crucial if the species is commercially harvested.
Seascape genetics have been increasingly used to meet these needs. In this study,
we examined connectivity patterns among 32 populations of the oarweed kelp Laminaria
digitata located at the species’ southern range limit. The distance
(or sampling gap) between neighboring populations ranged from a few km to a few
100s of km. By genotyping 11 microsatellite markers, we aimed to (1) refine analyses
of population structure; (2) test whether on-shelf islands are genetically more
differentiated than mainland populations; (3) evaluate the relative importance
of various abiotic conditions in shaping the genetic structure; and (4) evaluate
if the relative importance of each environmental factor varied according to sampling
schemes. Our analyses revealed a positive relationship between connectivity links
and genetic diversity: populations with high levels of connectivity were genetically
enriched while isolated populations showed signs of genetic erosion. The genetically
impoverished populations corresponded to the southernmost populations as well
as populations along the northern coast of Brittany (Locquirec, Saint-Malo Bay)
and the northernmost population in Pas-de-Calais. By performing distance-based
redundancy analysis on various sampling schemes, geographic distance appeared
as the dominant factor influencing connectivity between populations separated
by great distances, while hydrodynamic processes were the main factor when analyzing
at a final spatial resolution.'
article_processing_charge: No
article_type: original
author:
- first_name: Louise
full_name: Fouqueau, Louise
id: 1676e173-8143-11ed-8927-fe165216a93f
last_name: Fouqueau
orcid: 0000-0003-0371-9339
- first_name: L
full_name: Reynes, L
last_name: Reynes
- first_name: F
full_name: Tempera, F
last_name: Tempera
- first_name: T
full_name: Bajjouk, T
last_name: Bajjouk
- first_name: A
full_name: Blanfuné, A
last_name: Blanfuné
- first_name: C
full_name: Chevalier, C
last_name: Chevalier
- first_name: M
full_name: Laurans, M
last_name: Laurans
- first_name: S
full_name: Mauger, S
last_name: Mauger
- first_name: M
full_name: Sourisseau, M
last_name: Sourisseau
- first_name: J
full_name: Assis, J
last_name: Assis
- first_name: L
full_name: Lévêque, L
last_name: Lévêque
- first_name: M
full_name: Valero, M
last_name: Valero
citation:
ama: Fouqueau L, Reynes L, Tempera F, et al. Seascape genetic study on Laminaria
digitata underscores the critical role of sampling schemes. Marine Ecology
Progress Series. 2024;740:23-42. doi:10.3354/meps14640
apa: Fouqueau, L., Reynes, L., Tempera, F., Bajjouk, T., Blanfuné, A., Chevalier,
C., … Valero, M. (2024). Seascape genetic study on Laminaria digitata underscores
the critical role of sampling schemes. Marine Ecology Progress Series.
Inter-Research Science Center. https://doi.org/10.3354/meps14640
chicago: Fouqueau, Louise, L Reynes, F Tempera, T Bajjouk, A Blanfuné, C Chevalier,
M Laurans, et al. “Seascape Genetic Study on Laminaria Digitata Underscores the
Critical Role of Sampling Schemes.” Marine Ecology Progress Series. Inter-Research
Science Center, 2024. https://doi.org/10.3354/meps14640.
ieee: L. Fouqueau et al., “Seascape genetic study on Laminaria digitata underscores
the critical role of sampling schemes,” Marine Ecology Progress Series,
vol. 740. Inter-Research Science Center, pp. 23–42, 2024.
ista: Fouqueau L, Reynes L, Tempera F, Bajjouk T, Blanfuné A, Chevalier C, Laurans
M, Mauger S, Sourisseau M, Assis J, Lévêque L, Valero M. 2024. Seascape genetic
study on Laminaria digitata underscores the critical role of sampling schemes.
Marine Ecology Progress Series. 740, 23–42.
mla: Fouqueau, Louise, et al. “Seascape Genetic Study on Laminaria Digitata Underscores
the Critical Role of Sampling Schemes.” Marine Ecology Progress Series,
vol. 740, Inter-Research Science Center, 2024, pp. 23–42, doi:10.3354/meps14640.
short: L. Fouqueau, L. Reynes, F. Tempera, T. Bajjouk, A. Blanfuné, C. Chevalier,
M. Laurans, S. Mauger, M. Sourisseau, J. Assis, L. Lévêque, M. Valero, Marine
Ecology Progress Series 740 (2024) 23–42.
corr_author: '1'
date_created: 2025-01-29T09:09:10Z
date_published: 2024-07-25T00:00:00Z
date_updated: 2025-01-29T09:12:34Z
day: '25'
department:
- _id: NiBa
doi: 10.3354/meps14640
intvolume: ' 740'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://inria.hal.science/hal-04624490/
month: '07'
oa: 1
oa_version: Submitted Version
page: 23-42
publication: Marine Ecology Progress Series
publication_identifier:
eissn:
- 1616-1599
issn:
- 0171-8630
publication_status: published
publisher: Inter-Research Science Center
quality_controlled: '1'
scopus_import: '1'
status: public
title: Seascape genetic study on Laminaria digitata underscores the critical role
of sampling schemes
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 740
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18948'
abstract:
- lang: eng
text: We consider a gas of N bosons with interactions in the mean-field scaling
regime. We review a recent proof of the asymptotic expansion of its spectrum and
eigenstates and two applications of this result, namely the derivation of an Edgeworth
expansion for fluctuations of one-body operators and the computation of the binding
energy of an inhomogeneous Bose gas to any order. Finally, we collect related
results for the dynamics of the weakly interacting Bose gas and for the regularized
Nelson model.
acknowledgement: It is our pleasure to thank Marco Falconi, Nataša Pavlović, Peter
Pickl, Robert Seiringer and Avy Soffer for the collaboration on the works [11, 13,
14, 21, 33, 39]. L.B. was supported by the German Research Foundation within the
Munich Center of Quantum Science and Technology (EXC 2111). N.L. acknowledges support
from the Swiss National Science Foundation through the NCCR SwissMap and funding
from the European Union’s Horizon 2020 research and innovation programme under the
Marie Skłodowska-Curie grant agreement No 101024712. S.P. acknowledges funding by
the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) - project
number 512258249.
alternative_title:
- Fundamental Theories of Physics
article_processing_charge: No
arxiv: 1
author:
- first_name: Lea
full_name: Bossmann, Lea
id: A2E3BCBE-5FCC-11E9-AA4B-76F3E5697425
last_name: Bossmann
orcid: 0000-0002-6854-1343
- first_name: Nikolai
full_name: Leopold, Nikolai
last_name: Leopold
- first_name: David Johannes
full_name: Mitrouskas, David Johannes
id: cbddacee-2b11-11eb-a02e-a2e14d04e52d
last_name: Mitrouskas
- first_name: Sören
full_name: Petrat, Sören
last_name: Petrat
citation:
ama: 'Bossmann L, Leopold N, Mitrouskas DJ, Petrat S. Asymptotic Analysis of the Weakly
Interacting Bose Gas: A Collection of Recent Results and Applications. In: Bassi
A, Goldstein S, Tumulka R, Zanghi N, eds. Physics and the Nature of Reality.
Vol 215. FTPH. Cham: Springer Nature; 2024:307-321. doi:10.1007/978-3-031-45434-9_22'
apa: 'Bossmann, L., Leopold, N., Mitrouskas, D. J., & Petrat, S. (2024). Asymptotic
Analysis of the Weakly Interacting Bose Gas: A Collection of Recent Results and Applications.
In A. Bassi, S. Goldstein, R. Tumulka, & N. Zanghi (Eds.), Physics and
the Nature of Reality (Vol. 215, pp. 307–321). Cham: Springer Nature. https://doi.org/10.1007/978-3-031-45434-9_22'
chicago: 'Bossmann, Lea, Nikolai Leopold, David Johannes Mitrouskas, and Sören Petrat.
“Asymptotic Analysis of the Weakly Interacting Bose Gas: A Collection of Recent
Results and Applications.” In Physics and the Nature of Reality, edited
by Angelo Bassi, Sheldon Goldstein, Roderich Tumulka, and Nino Zanghi, 215:307–21.
FTPH. Cham: Springer Nature, 2024. https://doi.org/10.1007/978-3-031-45434-9_22.'
ieee: 'L. Bossmann, N. Leopold, D. J. Mitrouskas, and S. Petrat, “Asymptotic Analysis
of the Weakly Interacting Bose Gas: A Collection of Recent Results and Applications,”
in Physics and the Nature of Reality, vol. 215, A. Bassi, S. Goldstein,
R. Tumulka, and N. Zanghi, Eds. Cham: Springer Nature, 2024, pp. 307–321.'
ista: 'Bossmann L, Leopold N, Mitrouskas DJ, Petrat S. 2024.Asymptotic Analysis
of the Weakly Interacting Bose Gas: A Collection of Recent Results and Applications.
In: Physics and the Nature of Reality. Fundamental Theories of Physics, vol. 215,
307–321.'
mla: 'Bossmann, Lea, et al. “Asymptotic Analysis of the Weakly Interacting Bose
Gas: A Collection of Recent Results and Applications.” Physics and the Nature
of Reality, edited by Angelo Bassi et al., vol. 215, Springer Nature, 2024,
pp. 307–21, doi:10.1007/978-3-031-45434-9_22.'
short: L. Bossmann, N. Leopold, D.J. Mitrouskas, S. Petrat, in:, A. Bassi, S. Goldstein,
R. Tumulka, N. Zanghi (Eds.), Physics and the Nature of Reality, Springer Nature,
Cham, 2024, pp. 307–321.
date_created: 2025-01-29T10:30:08Z
date_published: 2024-02-04T00:00:00Z
date_updated: 2025-01-29T10:35:10Z
day: '04'
department:
- _id: RoSe
doi: 10.1007/978-3-031-45434-9_22
editor:
- first_name: Angelo
full_name: Bassi, Angelo
last_name: Bassi
- first_name: Sheldon
full_name: Goldstein, Sheldon
last_name: Goldstein
- first_name: Roderich
full_name: Tumulka, Roderich
last_name: Tumulka
- first_name: Nino
full_name: Zanghi, Nino
last_name: Zanghi
external_id:
arxiv:
- '2304.12910'
intvolume: ' 215'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2304.12910
month: '02'
oa: 1
oa_version: Preprint
page: 307-321
place: Cham
publication: Physics and the Nature of Reality
publication_identifier:
eisbn:
- '9783031454349'
eissn:
- 2365-6425
isbn:
- '9783031454332'
issn:
- 0168-1222
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
series_title: FTPH
status: public
title: 'Asymptotic Analysis of the Weakly Interacting Bose Gas: A Collection of Recent
Results and Applications'
type: book_chapter
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 215
year: '2024'
...
---
OA_place: repository
OA_type: hybrid
_id: '18957'
abstract:
- lang: eng
text: Sui Lutris is the first smart-contract platform to sustainably achieve sub-second
finality. It achieves this significant decrease by employing consensusless agreement
not only for simple payments but for a large variety of transactions. Unlike prior
work, Sui Lutris neither compromises expressiveness nor throughput and can run
perpetually without restarts. Sui Lutris achieves this by safely integrating consensuless
agreement with a high-throughput consensus protocol that is invoked out of the
critical finality path but ensures that when a transaction is at risk of inconsistent
concurrent accesses, its settlement is delayed until the total ordering is resolved.
Building such a hybrid architecture is especially delicate during reconfiguration
events, where the system needs to preserve the safety of the consensusless path
without compromising the long-term liveness of potentially misconfigured clients.
We thus develop a novel reconfiguration protocol, the first to provably show the
safe and efficient reconfiguration of a consensusless blockchain. Sui Lutris is
currently running in production and underpins the Sui smart-contract platform.
Combined with the use of Objects instead of accounts it enables the safe execution
of smart contracts that expose objects as a first-class resource. In our experiments
Sui Lutris achieves latency lower than 0.5 seconds for throughput up to 5,000
certificates per second (150k ops/s with transaction blocks), compared to the
state-of-the-art real-world consensus latencies of 3 seconds. Furthermore, it
gracefully handles validators crash-recovery and does not suffer visible performance
degradation during reconfiguration.
acknowledgement: 'This work is funded by MystenLabs. We thank the Mysten Labs Engineering
teams for valuable feedback broadly, and specifically Dmitry Perelman and Todd Fiala
for managing the implementation effort. A number of folks contributed to specific
aspects of the implementation of Sui Lutris (amongst many other contributions to
the overall blockchain): Francois Garillot, Laura Makdah, Mingwei Tian, Andrew Schran,
Sadhan Sood and William Smith implemented and optimized aspects of both Sui Lutris
and Narwhal / Bullshark consensus; Alonso de Gortari oversaw the cryptoeconomics
of the blockchain, and Emma Zhong, Ade Adepoju, Tim Zakia and Dario Russi designed
and implemented staking and gas mechanisms. Adam Welc designed several Move tools
and provided great feedback on the manuscript. We also extend our thanks to Patrick
Kuo, Ge Gao, Chris Li, and Arun Koshy for their work on the Sui Lutris SDK, clients,
and RPC layer; Kostas Chalkias, Jonas Lindstrøm, and Joy Wang built cryptographic
components.'
article_processing_charge: No
arxiv: 1
author:
- first_name: Sam
full_name: Blackshear, Sam
last_name: Blackshear
- first_name: Andrey
full_name: Chursin, Andrey
last_name: Chursin
- first_name: George
full_name: Danezis, George
last_name: Danezis
- first_name: Anastasios
full_name: Kichidis, Anastasios
last_name: Kichidis
- first_name: Eleftherios
full_name: Kokoris Kogias, Eleftherios
id: f5983044-d7ef-11ea-ac6d-fd1430a26d30
last_name: Kokoris Kogias
- first_name: Xun
full_name: Li, Xun
last_name: Li
- first_name: Mark
full_name: Logan, Mark
last_name: Logan
- first_name: Ashok
full_name: Menon, Ashok
last_name: Menon
- first_name: Todd
full_name: Nowacki, Todd
last_name: Nowacki
- first_name: Alberto
full_name: Sonnino, Alberto
last_name: Sonnino
- first_name: Brandon
full_name: Williams, Brandon
last_name: Williams
- first_name: Lu
full_name: Zhang, Lu
last_name: Zhang
citation:
ama: 'Blackshear S, Chursin A, Danezis G, et al. Sui Lutris: A blockchain combining
broadcast and consensus. In: Proceedings of the 2024 on ACM SIGSAC Conference
on Computer and Communications Security. ACM; 2024:2606-2620. doi:10.1145/3658644.3670286'
apa: 'Blackshear, S., Chursin, A., Danezis, G., Kichidis, A., Kokoris Kogias, E.,
Li, X., … Zhang, L. (2024). Sui Lutris: A blockchain combining broadcast and consensus.
In Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications
Security (pp. 2606–2620). Salt Lake City, UT, United States: ACM. https://doi.org/10.1145/3658644.3670286'
chicago: 'Blackshear, Sam, Andrey Chursin, George Danezis, Anastasios Kichidis,
Eleftherios Kokoris Kogias, Xun Li, Mark Logan, et al. “Sui Lutris: A Blockchain
Combining Broadcast and Consensus.” In Proceedings of the 2024 on ACM SIGSAC
Conference on Computer and Communications Security, 2606–20. ACM, 2024. https://doi.org/10.1145/3658644.3670286.'
ieee: 'S. Blackshear et al., “Sui Lutris: A blockchain combining broadcast
and consensus,” in Proceedings of the 2024 on ACM SIGSAC Conference on Computer
and Communications Security, Salt Lake City, UT, United States, 2024, pp.
2606–2620.'
ista: 'Blackshear S, Chursin A, Danezis G, Kichidis A, Kokoris Kogias E, Li X, Logan
M, Menon A, Nowacki T, Sonnino A, Williams B, Zhang L. 2024. Sui Lutris: A blockchain
combining broadcast and consensus. Proceedings of the 2024 on ACM SIGSAC Conference
on Computer and Communications Security. CCS: Conference on Computer and Communications
Security, 2606–2620.'
mla: 'Blackshear, Sam, et al. “Sui Lutris: A Blockchain Combining Broadcast and
Consensus.” Proceedings of the 2024 on ACM SIGSAC Conference on Computer and
Communications Security, ACM, 2024, pp. 2606–20, doi:10.1145/3658644.3670286.'
short: S. Blackshear, A. Chursin, G. Danezis, A. Kichidis, E. Kokoris Kogias, X.
Li, M. Logan, A. Menon, T. Nowacki, A. Sonnino, B. Williams, L. Zhang, in:, Proceedings
of the 2024 on ACM SIGSAC Conference on Computer and Communications Security,
ACM, 2024, pp. 2606–2620.
conference:
end_date: 2024-10-18
location: Salt Lake City, UT, United States
name: 'CCS: Conference on Computer and Communications Security'
start_date: 2024-10-14
date_created: 2025-01-29T12:42:21Z
date_published: 2024-12-09T00:00:00Z
date_updated: 2025-09-09T12:13:55Z
day: '09'
department:
- _id: ElKo
doi: 10.1145/3658644.3670286
external_id:
arxiv:
- '2310.18042'
isi:
- '001436367300178'
isi: 1
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2310.18042
month: '12'
oa: 1
oa_version: Preprint
page: 2606-2620
publication: Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications
Security
publication_identifier:
isbn:
- '9798400706363'
publication_status: published
publisher: ACM
quality_controlled: '1'
status: public
title: 'Sui Lutris: A blockchain combining broadcast and consensus'
type: conference
user_id: 317138e5-6ab7-11ef-aa6d-ffef3953e345
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '18977'
abstract:
- lang: eng
text: "Recent advances in large language model (LLM) pretraining have led to high-quality
LLMs with impressive abilities. By compressing such LLMs via quantization to 3-4
bits per parameter, they can fit into memory-limited devices such as laptops and
mobile phones, enabling personalized use. Quantizing models to 3-4 bits per parameter
can lead to moderate to high accuracy losses, especially for smaller models (1-10B
parameters), which are suitable for edge deployment. To address this accuracy
issue, we introduce the Sparse-Quantized Representation (SpQR), a new compressed
format and quantization technique that enables for the first time \\emph{near-lossless}
compression of LLMs across model scales while reaching similar compression levels
to previous methods. SpQR works by identifying and isolating \\emph{outlier weights},
which cause particularly large quantization errors, and storing them in higher
precision while compressing all other weights to 3-4 bits, and achieves relative
accuracy losses of less than \r\n in perplexity for highly-accurate LLaMA and
Falcon LLMs. This makes it possible to run a 33B parameter LLM on a single 24
GB consumer GPU without performance degradation at 15% speedup, thus making powerful
LLMs available to consumers without any downsides. SpQR comes with efficient algorithms
for both encoding weights into its format, as well as decoding them efficiently
at runtime. Specifically, we provide an efficient GPU inference algorithm for
SpQR, which yields faster inference than 16-bit baselines at similar accuracy
while enabling memory compression gains of more than 4x."
acknowledgement: "Denis Kuznedelev acknowledges the support from the Russian Ministry
of Science and Higher\r\nEducation, grant No. 075-10-2021-068. Ruslan Svirschevski
and Vage Egiazarian and Denis\r\nKuznedelev were supported by the grant for research
centers in the field of AI provided by the\r\nAnalytical Center for the Government
of the Russian Federation (ACRF) in accordance with the\r\nagreement on the provision
of subsidies (identifier of the agreement 000000D730321P5Q0002) and the agreement
with HSE University No. 70-2021-00139."
article_processing_charge: No
arxiv: 1
author:
- first_name: Tim
full_name: Dettmers, Tim
last_name: Dettmers
- first_name: Ruslan A.
full_name: Svirschevski, Ruslan A.
last_name: Svirschevski
- first_name: Vage
full_name: Egiazarian, Vage
last_name: Egiazarian
- 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: Saleh
full_name: Ashkboos, Saleh
last_name: Ashkboos
- first_name: Alexander
full_name: Borzunov, Alexander
last_name: Borzunov
- first_name: Torsten
full_name: Hoefler, Torsten
last_name: Hoefler
- 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: 'Dettmers T, Svirschevski RA, Egiazarian V, et al. SpQR: A sparse-quantized
representation for near-lossless LLM weight compression. In: 12th International
Conference on Learning Representations. OpenReview; 2024.'
apa: 'Dettmers, T., Svirschevski, R. A., Egiazarian, V., Kuznedelev, D., Frantar,
E., Ashkboos, S., … Alistarh, D.-A. (2024). SpQR: A sparse-quantized representation
for near-lossless LLM weight compression. In 12th International Conference
on Learning Representations. Vienna, Austria: OpenReview.'
chicago: 'Dettmers, Tim, Ruslan A. Svirschevski, Vage Egiazarian, Denis Kuznedelev,
Elias Frantar, Saleh Ashkboos, Alexander Borzunov, Torsten Hoefler, and Dan-Adrian
Alistarh. “SpQR: A Sparse-Quantized Representation for near-Lossless LLM Weight
Compression.” In 12th International Conference on Learning Representations.
OpenReview, 2024.'
ieee: 'T. Dettmers et al., “SpQR: A sparse-quantized representation for near-lossless
LLM weight compression,” in 12th International Conference on Learning Representations,
Vienna, Austria, 2024.'
ista: 'Dettmers T, Svirschevski RA, Egiazarian V, Kuznedelev D, Frantar E, Ashkboos
S, Borzunov A, Hoefler T, Alistarh D-A. 2024. SpQR: A sparse-quantized representation
for near-lossless LLM weight compression. 12th International Conference on Learning
Representations. ICLR: International Conference on Learning Representations.'
mla: 'Dettmers, Tim, et al. “SpQR: A Sparse-Quantized Representation for near-Lossless
LLM Weight Compression.” 12th International Conference on Learning Representations,
OpenReview, 2024.'
short: T. Dettmers, R.A. Svirschevski, V. Egiazarian, D. Kuznedelev, E. Frantar,
S. Ashkboos, A. Borzunov, T. Hoefler, D.-A. Alistarh, in:, 12th International
Conference on Learning Representations, OpenReview, 2024.
conference:
end_date: 2024-05-11
location: Vienna, Austria
name: 'ICLR: International Conference on Learning Representations'
start_date: 2024-05-07
date_created: 2025-01-30T08:26:59Z
date_published: 2024-05-15T00:00:00Z
date_updated: 2025-01-30T08:27:47Z
day: '15'
department:
- _id: DaAl
external_id:
arxiv:
- '2306.03078'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2306.03078
month: '05'
oa: 1
oa_version: Preprint
publication: 12th International Conference on Learning Representations
publication_status: published
publisher: OpenReview
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'SpQR: A sparse-quantized representation for near-lossless LLM weight compression'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19486'
abstract:
- lang: eng
text: Consider the family of elliptic curves En:y2=x3+n2, where n varies over positive
cubefree integers. There is a rational 3-isogeny ϕ from En to E^n:y2=x3−27n2 and
a dual isogeny ϕ^:E^n→En. We show that for almost all n, the rank of Selϕ(En)
is 0, and the rank of Selϕ^(E^n) is determined by the number of prime factors
of n that are congruent to 2mod3 and the congruence class of nmod9.
acknowledgement: The author would like to thank Peter Koymans and Carlo Pagano for
helpful discussions.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Yik Tung
full_name: Chan, Yik Tung
id: c4c0afc8-9262-11ed-9231-d8b0bc743af1
last_name: Chan
orcid: 0000-0001-8467-4106
citation:
ama: Chan S. The 3-isogeny selmer groups of the elliptic curves y2=x3+n2. International
Mathematics Research Notices. 2024;2024(9):7571-7593. doi:10.1093/imrn/rnad266
apa: Chan, S. (2024). The 3-isogeny selmer groups of the elliptic curves y2=x3+n2.
International Mathematics Research Notices. Oxford University Press. https://doi.org/10.1093/imrn/rnad266
chicago: Chan, Stephanie. “The 3-Isogeny Selmer Groups of the Elliptic Curves Y2=x3+n2.”
International Mathematics Research Notices. Oxford University Press, 2024.
https://doi.org/10.1093/imrn/rnad266.
ieee: S. Chan, “The 3-isogeny selmer groups of the elliptic curves y2=x3+n2,” International
Mathematics Research Notices, vol. 2024, no. 9. Oxford University Press, pp.
7571–7593, 2024.
ista: Chan S. 2024. The 3-isogeny selmer groups of the elliptic curves y2=x3+n2.
International Mathematics Research Notices. 2024(9), 7571–7593.
mla: Chan, Stephanie. “The 3-Isogeny Selmer Groups of the Elliptic Curves Y2=x3+n2.”
International Mathematics Research Notices, vol. 2024, no. 9, Oxford University
Press, 2024, pp. 7571–93, doi:10.1093/imrn/rnad266.
short: S. Chan, International Mathematics Research Notices 2024 (2024) 7571–7593.
date_created: 2025-04-05T10:50:33Z
date_published: 2024-05-01T00:00:00Z
date_updated: 2025-07-10T11:51:44Z
day: '01'
doi: 10.1093/imrn/rnad266
extern: '1'
external_id:
arxiv:
- '2211.06062'
intvolume: ' 2024'
issue: '9'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2211.06062
month: '05'
oa: 1
oa_version: Preprint
page: 7571-7593
publication: International Mathematics Research Notices
publication_identifier:
eissn:
- 1687-0247
issn:
- 1073-7928
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: The 3-isogeny selmer groups of the elliptic curves y2=x3+n2
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2024
year: '2024'
...
---
OA_place: repository
OA_type: green
_id: '19517'
abstract:
- lang: eng
text: "In this paper, we present a novel data-free method for merging neural networks
in weight space. Differently from most existing works, our method optimizes for
the permutations of network neurons globally across all layers. This allows us
to enforce cycle consistency of the permutations when merging n ≥ 3 models, allowing
circular compositions of permutations to be computed without accumulating error
along the path. We qualitatively and quantitatively motivate the need for such
a constraint, showing its benefits when merging sets of models in scenarios spanning
varying architectures and datasets. We finally show that, when coupled\r\nwith
activation renormalization, our approach yields the best results in the task."
acknowledgement: "This work is supported by the ERC grant no.802554 (SPECGEO), PRIN
2020 project\r\nno.2020TA3K9N (LEGO.AI), and PNRR MUR project PE0000013-FAIR. Marco
Fumero is supported by the MSCA IST-Bridge fellowship which has received funding
from the European Union’s Horizon 2020 research and innovation program under the
Marie Skłodowska-Curie grant agreement No 101034413. We thank Simone Scardapane
for the helpful feedback on the paper."
alternative_title:
- Advances in Neural Information Processing Systems
article_processing_charge: No
arxiv: 1
author:
- first_name: Donato
full_name: Crisostomi, Donato
last_name: Crisostomi
- first_name: Marco
full_name: Fumero, Marco
id: 1c1593eb-393f-11ef-bb8e-ab4f1e979650
last_name: Fumero
- first_name: Daniele
full_name: Baieri, Daniele
last_name: Baieri
- first_name: Florian
full_name: Bernard, Florian
last_name: Bernard
- first_name: Emanuele
full_name: Rodolà, Emanuele
last_name: Rodolà
citation:
ama: 'Crisostomi D, Fumero M, Baieri D, Bernard F, Rodolà E. C2M3: Cycle-consistent
multi-model merging. In: 38th Conference on Neural Information Processing Systems.
Vol 37. Neural Information Processing Systems Foundation; 2024.'
apa: 'Crisostomi, D., Fumero, M., Baieri, D., Bernard, F., & Rodolà, E. (2024).
C2M3: Cycle-consistent multi-model merging. In 38th Conference on Neural Information
Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing
Systems Foundation.'
chicago: 'Crisostomi, Donato, Marco Fumero, Daniele Baieri, Florian Bernard, and
Emanuele Rodolà. “C2M3: Cycle-Consistent Multi-Model Merging.” In 38th Conference
on Neural Information Processing Systems, Vol. 37. Neural Information Processing
Systems Foundation, 2024.'
ieee: 'D. Crisostomi, M. Fumero, D. Baieri, F. Bernard, and E. Rodolà, “C2M3: Cycle-consistent
multi-model merging,” in 38th Conference on Neural Information Processing Systems,
Vancouver, Canada, 2024, vol. 37.'
ista: 'Crisostomi D, Fumero M, Baieri D, Bernard F, Rodolà E. 2024. C2M3: Cycle-consistent
multi-model merging. 38th Conference on Neural Information Processing Systems.
NeurIPS: Neural Information Processing Systems, Advances in Neural Information
Processing Systems, vol. 37.'
mla: 'Crisostomi, Donato, et al. “C2M3: Cycle-Consistent Multi-Model Merging.” 38th
Conference on Neural Information Processing Systems, vol. 37, Neural Information
Processing Systems Foundation, 2024.'
short: D. Crisostomi, M. Fumero, D. Baieri, F. Bernard, E. Rodolà, in:, 38th Conference
on Neural Information Processing Systems, Neural Information Processing Systems
Foundation, 2024.
conference:
end_date: 2024-12-15
location: Vancouver, Canada
name: 'NeurIPS: Neural Information Processing Systems'
start_date: 2024-12-09
corr_author: '1'
date_created: 2025-04-06T22:01:32Z
date_published: 2024-12-20T00:00:00Z
date_updated: 2025-05-14T11:36:59Z
day: '20'
department:
- _id: FrLo
ec_funded: 1
external_id:
arxiv:
- '2405.17897'
intvolume: ' 37'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.48550/arXiv.2405.17897
month: '12'
oa: 1
oa_version: Preprint
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 38th Conference on Neural Information Processing Systems
publication_identifier:
issn:
- 1049-5258
publication_status: published
publisher: Neural Information Processing Systems Foundation
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'C2M3: Cycle-consistent multi-model merging'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2024'
...
---
OA_type: closed access
_id: '20039'
abstract:
- lang: eng
text: This Comment presents a high-level protocol for data harmonization within
large cohorts, in which it postulates four main steps including (1) expert review,
(2) pre-statistical harmonization, (3) statistical harmonization, and (4) validation.
acknowledgement: Funded by the European Union. Complementary funding was received
by UK Research and Innovation (UKRI) under the UK government’s Horizon Europe funding
guarantee (10041392 and 10038599). Views and opinions expressed are however those
of the author(s) only and do not necessarily reflect those of the European Union,
the European Health and Digital Executive Agency (HADEA) or UKRI. The European Union,
HADEA or UKRI cannot be held responsible for them. This work received support from
the Chinese Ministry for Science and Technology (MOST), the Horizon 2020-funded
European Research Council advanced grant ‘STRATIFY’ (695313); the German Research
Foundation (COPE; 675346; NE 1383/15-1 and BA 2088/7-1 (CoviDrug)), the National
Natural Science Foundation of China grant 82150710554, the Hector II foundation
and the German Center for Mental Health (DZPG) (01EE2301A, 01EE2304A, 01EE2301D).
article_processing_charge: No
article_type: comment
author:
- first_name: Maja
full_name: Neidhart, Maja
last_name: Neidhart
- first_name: Rikka
full_name: Kjelkenes, Rikka
last_name: Kjelkenes
- first_name: Karina
full_name: Jansone, Karina
last_name: Jansone
- first_name: Barbora
full_name: Rehák Bučková, Barbora
last_name: Rehák Bučková
- first_name: Nathalie
full_name: Holz, Nathalie
last_name: Holz
- first_name: Frauke
full_name: Nees, Frauke
last_name: Nees
- first_name: Henrik
full_name: Walter, Henrik
last_name: Walter
- first_name: Gunter
full_name: Schumann, Gunter
last_name: Schumann
- first_name: Michael A.
full_name: Rapp, Michael A.
last_name: Rapp
- first_name: Tobias
full_name: Banaschewski, Tobias
last_name: Banaschewski
- first_name: Emanuel
full_name: Schwarz, Emanuel
last_name: Schwarz
- first_name: Andre
full_name: Marquand, Andre
last_name: Marquand
- first_name: George
full_name: Ogoh, George
last_name: Ogoh
- first_name: Bernd
full_name: Stahl, Bernd
last_name: Stahl
- first_name: Allan H.
full_name: Young, Allan H.
last_name: Young
- first_name: Sylvane
full_name: Desrivières, Sylvane
last_name: Desrivières
- first_name: Nicholas
full_name: Clinton, Nicholas
last_name: Clinton
- first_name: Paul
full_name: Thompson, Paul
last_name: Thompson
- first_name: Ameli
full_name: Schwalber, Ameli
last_name: Schwalber
- first_name: Jingyu
full_name: Liu, Jingyu
last_name: Liu
- first_name: Vince
full_name: Calhoun, Vince
last_name: Calhoun
- first_name: Xiao
full_name: Chang, Xiao
last_name: Chang
- first_name: Yunman
full_name: Xia, Yunman
last_name: Xia
- first_name: Yanting
full_name: Gong, Yanting
last_name: Gong
- first_name: Tianye
full_name: Jia, Tianye
last_name: Jia
- first_name: Paul
full_name: Renner, Paul
last_name: Renner
- first_name: Sören
full_name: Hese, Sören
last_name: Hese
- first_name: Arantxa
full_name: Giner, Arantxa
last_name: Giner
- first_name: Mavi
full_name: Sanchez, Mavi
last_name: Sanchez
- first_name: Elena
full_name: Alvarez, Elena
last_name: Alvarez
- first_name: Bernhard
full_name: Spanlang, Bernhard
last_name: Spanlang
- first_name: Charlie
full_name: Pearmund, Charlie
last_name: Pearmund
- first_name: Anastasios Polykarpos
full_name: Athanasiadis, Anastasios Polykarpos
last_name: Athanasiadis
- first_name: Lisa
full_name: Otten, Lisa
last_name: Otten
- first_name: Séverine
full_name: Pitel, Séverine
last_name: Pitel
- first_name: Spase
full_name: Petkoski, Spase
last_name: Petkoski
- first_name: Viktor
full_name: Jirsa, Viktor
last_name: Jirsa
- first_name: Karen
full_name: Schmitt, Karen
last_name: Schmitt
- first_name: Johannes
full_name: Wilbertz, Johannes
last_name: Wilbertz
- first_name: Myrto
full_name: Patraskaki, Myrto
last_name: Patraskaki
- first_name: Peter
full_name: Sommer, Peter
last_name: Sommer
- first_name: Stefanie
full_name: Heilmann-Heimbach, Stefanie
last_name: Heilmann-Heimbach
- first_name: Carina M.
full_name: Mathey, Carina M.
last_name: Mathey
- first_name: Abigail
full_name: Miller, Abigail
last_name: Miller
- first_name: Isabelle
full_name: Claus, Isabelle
last_name: Claus
- first_name: Markus M.
full_name: Nöthen, Markus M.
last_name: Nöthen
- first_name: Per
full_name: Hoffmann, Per
last_name: Hoffmann
- first_name: Andreas J.
full_name: Forstner, Andreas J.
last_name: Forstner
- first_name: Alvaro
full_name: Pastor, Alvaro
last_name: Pastor
- first_name: Jaime
full_name: Gallego, Jaime
last_name: Gallego
- first_name: Francisco Eiroa
full_name: Orosa, Francisco Eiroa
last_name: Orosa
- first_name: Guillem Feixas
full_name: Viapiana, Guillem Feixas
last_name: Viapiana
- first_name: Mel
full_name: Slater, Mel
last_name: Slater
- first_name: Lena
full_name: Marr, Lena
id: 4406F586-F248-11E8-B48F-1D18A9856A87
last_name: Marr
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Sarah Jane
full_name: Böttger, Sarah Jane
last_name: Böttger
- first_name: Mira
full_name: Tschorn, Mira
last_name: Tschorn
- first_name: Michael
full_name: Rapp, Michael
last_name: Rapp
- first_name: Helga
full_name: Ask, Helga
last_name: Ask
- first_name: Sara
full_name: Fernandez, Sara
last_name: Fernandez
- first_name: Dennis
full_name: Van Der Meer, Dennis
last_name: Van Der Meer
- first_name: Lars T.
full_name: Westlye, Lars T.
last_name: Westlye
- first_name: Ole A.
full_name: Andreassen, Ole A.
last_name: Andreassen
- first_name: Rieke
full_name: Aden, Rieke
last_name: Aden
- first_name: Beke
full_name: Seefried, Beke
last_name: Seefried
- first_name: Sebastian
full_name: Siehl, Sebastian
last_name: Siehl
- first_name: Frauke
full_name: Nees, Frauke
last_name: Nees
- first_name: Argyris
full_name: Stringaris, Argyris
last_name: Stringaris
- first_name: Heike
full_name: Tost, Heike
last_name: Tost
- first_name: Andreas
full_name: Meyer-Lindenberg, Andreas
last_name: Meyer-Lindenberg
- first_name: Nina
full_name: Christmann, Nina
last_name: Christmann
- first_name: Jamie
full_name: Banks, Jamie
last_name: Banks
- first_name: Kerstin
full_name: Schepanski, Kerstin
last_name: Schepanski
- first_name: Tatjana
full_name: Schütz, Tatjana
last_name: Schütz
- first_name: Ulrike Helene
full_name: Taron, Ulrike Helene
last_name: Taron
- first_name: Roland
full_name: Eils, Roland
last_name: Eils
- first_name: Jean Charles
full_name: Roy, Jean Charles
last_name: Roy
- first_name: Tristram A.
full_name: Lett, Tristram A.
last_name: Lett
- first_name: Hedi
full_name: Kebir, Hedi
last_name: Kebir
- first_name: Elli
full_name: Polemiti, Elli
last_name: Polemiti
- first_name: Esther
full_name: Hitchen, Esther
last_name: Hitchen
- first_name: Marcel
full_name: Jentsch, Marcel
last_name: Jentsch
- first_name: Emin
full_name: Serin, Emin
last_name: Serin
- first_name: Antoine
full_name: Bernas, Antoine
last_name: Bernas
- first_name: Nilakshi
full_name: Vaidya, Nilakshi
last_name: Vaidya
- first_name: Sven
full_name: Twardziok, Sven
last_name: Twardziok
- first_name: Markus
full_name: Ralser, Markus
last_name: Ralser
- first_name: Andreas
full_name: Heinz, Andreas
last_name: Heinz
citation:
ama: Neidhart M, Kjelkenes R, Jansone K, et al. A protocol for data harmonization
in large cohorts. Nature Mental Health. 2024;2(10):1134-1137. doi:10.1038/s44220-024-00315-0
apa: Neidhart, M., Kjelkenes, R., Jansone, K., Rehák Bučková, B., Holz, N., Nees,
F., … Heinz, A. (2024). A protocol for data harmonization in large cohorts. Nature
Mental Health. Springer Nature. https://doi.org/10.1038/s44220-024-00315-0
chicago: Neidhart, Maja, Rikka Kjelkenes, Karina Jansone, Barbora Rehák Bučková,
Nathalie Holz, Frauke Nees, Henrik Walter, et al. “A Protocol for Data Harmonization
in Large Cohorts.” Nature Mental Health. Springer Nature, 2024. https://doi.org/10.1038/s44220-024-00315-0.
ieee: M. Neidhart et al., “A protocol for data harmonization in large cohorts,”
Nature Mental Health, vol. 2, no. 10. Springer Nature, pp. 1134–1137, 2024.
ista: Neidhart M, Kjelkenes R, Jansone K, Rehák Bučková B, Holz N, Nees F, Walter
H, Schumann G, Rapp MA, Banaschewski T, Schwarz E, Marquand A, Ogoh G, Stahl B,
Young AH, Desrivières S, Clinton N, Thompson P, Schwalber A, Liu J, Calhoun V,
Chang X, Xia Y, Gong Y, Jia T, Renner P, Hese S, Giner A, Sanchez M, Alvarez E,
Spanlang B, Pearmund C, Athanasiadis AP, Otten L, Pitel S, Petkoski S, Jirsa V,
Schmitt K, Wilbertz J, Patraskaki M, Sommer P, Heilmann-Heimbach S, Mathey CM,
Miller A, Claus I, Nöthen MM, Hoffmann P, Forstner AJ, Pastor A, Gallego J, Orosa
FE, Viapiana GF, Slater M, Marr L, Novarino G, Böttger SJ, Tschorn M, Rapp M,
Ask H, Fernandez S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried
B, Siehl S, Nees F, Stringaris A, Tost H, Meyer-Lindenberg A, Christmann N, Banks
J, Schepanski K, Schütz T, Taron UH, Eils R, Roy JC, Lett TA, Kebir H, Polemiti
E, Hitchen E, Jentsch M, Serin E, Bernas A, Vaidya N, Twardziok S, Ralser M, Heinz
A. 2024. A protocol for data harmonization in large cohorts. Nature Mental Health.
2(10), 1134–1137.
mla: Neidhart, Maja, et al. “A Protocol for Data Harmonization in Large Cohorts.”
Nature Mental Health, vol. 2, no. 10, Springer Nature, 2024, pp. 1134–37,
doi:10.1038/s44220-024-00315-0.
short: M. Neidhart, R. Kjelkenes, K. Jansone, B. Rehák Bučková, N. Holz, F. Nees,
H. Walter, G. Schumann, M.A. Rapp, T. Banaschewski, E. Schwarz, A. Marquand, G.
Ogoh, B. Stahl, A.H. Young, S. Desrivières, N. Clinton, P. Thompson, A. Schwalber,
J. Liu, V. Calhoun, X. Chang, Y. Xia, Y. Gong, T. Jia, P. Renner, S. Hese, A.
Giner, M. Sanchez, E. Alvarez, B. Spanlang, C. Pearmund, A.P. Athanasiadis, L.
Otten, S. Pitel, S. Petkoski, V. Jirsa, K. Schmitt, J. Wilbertz, M. Patraskaki,
P. Sommer, S. Heilmann-Heimbach, C.M. Mathey, A. Miller, I. Claus, M.M. Nöthen,
P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego, F.E. Orosa, G.F. Viapiana,
M. Slater, L. Marr, G. Novarino, S.J. Böttger, M. Tschorn, M. Rapp, H. Ask, S.
Fernandez, D. Van Der Meer, L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried,
S. Siehl, F. Nees, A. Stringaris, H. Tost, A. Meyer-Lindenberg, N. Christmann,
J. Banks, K. Schepanski, T. Schütz, U.H. Taron, R. Eils, J.C. Roy, T.A. Lett,
H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin, A. Bernas, N. Vaidya,
S. Twardziok, M. Ralser, A. Heinz, Nature Mental Health 2 (2024) 1134–1137.
date_created: 2025-07-20T22:02:04Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-07-22T08:59:10Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s44220-024-00315-0
intvolume: ' 2'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
page: 1134-1137
publication: Nature Mental Health
publication_identifier:
eissn:
- 2731-6076
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: A protocol for data harmonization in large cohorts
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2024'
...
---
OA_type: closed access
_id: '20157'
abstract:
- lang: eng
text: The focus of much of contemporary research ethics is on compliance with established
protocols. However, large data-driven neuroscience research raises new ethical
concerns that have no agreed-upon solution. Here we reflect on these challenges
and propose better integration of public and patient involvement in this evolving
landscape.
acknowledgement: Funded provided by the European Union. Complementary funding was
received by UK Research and Innovation (UKRI) under the UK government’s Horizon
Europe funding guarantee (10131373and 10038599) and Ministry of Science and Technology
of China (MOST) National Key Project of ‘Inter-governmental International Scientific
and Technological Innovation Cooperation’ (2023YFE0199700).
article_number: 1128-1130
article_processing_charge: No
article_type: comment
author:
- first_name: Bernd
full_name: Stahl, Bernd
last_name: Stahl
- first_name: George
full_name: Ogoh, George
last_name: Ogoh
- first_name: Gunter
full_name: Schumann, Gunter
last_name: Schumann
- first_name: Henrik
full_name: Walter, Henrik
last_name: Walter
- first_name: Bernd
full_name: Stahl, Bernd
last_name: Stahl
- first_name: Allan H.
full_name: Young, Allan H.
last_name: Young
- first_name: Sylvane
full_name: Desrivières, Sylvane
last_name: Desrivières
- first_name: Nicholas
full_name: Clinton, Nicholas
last_name: Clinton
- first_name: Paul
full_name: Thompson, Paul
last_name: Thompson
- first_name: Ameli
full_name: Schwalber, Ameli
last_name: Schwalber
- first_name: Jingyu
full_name: Liu, Jingyu
last_name: Liu
- first_name: Vince
full_name: Calhoun, Vince
last_name: Calhoun
- first_name: Xiao
full_name: Chang, Xiao
last_name: Chang
- first_name: Yunman
full_name: Xia, Yunman
last_name: Xia
- first_name: Yanting
full_name: Gong, Yanting
last_name: Gong
- first_name: Tianye
full_name: Jia, Tianye
last_name: Jia
- first_name: Paul
full_name: Renner, Paul
last_name: Renner
- first_name: Sören
full_name: Hese, Sören
last_name: Hese
- first_name: Arantxa
full_name: Giner, Arantxa
last_name: Giner
- first_name: Mavi
full_name: Sanchez, Mavi
last_name: Sanchez
- first_name: Elena
full_name: Alvarez, Elena
last_name: Alvarez
- first_name: Bernhard
full_name: Spanlang, Bernhard
last_name: Spanlang
- first_name: Charlie
full_name: Pearmund, Charlie
last_name: Pearmund
- first_name: Anastasios Polykarpos
full_name: Athanasiadis, Anastasios Polykarpos
last_name: Athanasiadis
- first_name: Lisa
full_name: Otten, Lisa
last_name: Otten
- first_name: Séverine
full_name: Pitel, Séverine
last_name: Pitel
- first_name: Spase
full_name: Petkoski, Spase
last_name: Petkoski
- first_name: Viktor
full_name: Jirsa, Viktor
last_name: Jirsa
- first_name: Karen
full_name: Schmitt, Karen
last_name: Schmitt
- first_name: Johannes
full_name: Wilbertz, Johannes
last_name: Wilbertz
- first_name: Myrto
full_name: Patraskaki, Myrto
last_name: Patraskaki
- first_name: Peter
full_name: Sommer, Peter
last_name: Sommer
- first_name: Stefanie
full_name: Heilmann-Heimbach, Stefanie
last_name: Heilmann-Heimbach
- first_name: Carina M.
full_name: Mathey, Carina M.
last_name: Mathey
- first_name: Abigail
full_name: Miller, Abigail
last_name: Miller
- first_name: Isabelle
full_name: Claus, Isabelle
last_name: Claus
- first_name: Markus M.
full_name: Nöthen, Markus M.
last_name: Nöthen
- first_name: Per
full_name: Hoffmann, Per
last_name: Hoffmann
- first_name: Andreas J.
full_name: Forstner, Andreas J.
last_name: Forstner
- first_name: Alvaro
full_name: Pastor, Alvaro
last_name: Pastor
- first_name: Jaime
full_name: Gallego, Jaime
last_name: Gallego
- first_name: Francisco Eiroa
full_name: Orosa, Francisco Eiroa
last_name: Orosa
- first_name: Guillem Feixas
full_name: Viapiana, Guillem Feixas
last_name: Viapiana
- first_name: Mel
full_name: Slater, Mel
last_name: Slater
- first_name: Lena
full_name: Marr, Lena
id: 4406F586-F248-11E8-B48F-1D18A9856A87
last_name: Marr
- first_name: Gaia
full_name: Novarino, Gaia
id: 3E57A680-F248-11E8-B48F-1D18A9856A87
last_name: Novarino
orcid: 0000-0002-7673-7178
- first_name: Andre
full_name: Marquand, Andre
last_name: Marquand
- first_name: Sarah Jane
full_name: Böttger, Sarah Jane
last_name: Böttger
- first_name: Mira
full_name: Tschorn, Mira
last_name: Tschorn
- first_name: Michael
full_name: Rapp, Michael
last_name: Rapp
- first_name: Helga
full_name: Ask, Helga
last_name: Ask
- first_name: Rikka
full_name: Kjelkenes, Rikka
last_name: Kjelkenes
- first_name: Sara
full_name: Fernandez, Sara
last_name: Fernandez
- first_name: Dennis
full_name: Van Der Meer, Dennis
last_name: Van Der Meer
- first_name: Lars T.
full_name: Westlye, Lars T.
last_name: Westlye
- first_name: Ole A.
full_name: Andreassen, Ole A.
last_name: Andreassen
- first_name: Rieke
full_name: Aden, Rieke
last_name: Aden
- first_name: Beke
full_name: Seefried, Beke
last_name: Seefried
- first_name: Sebastian
full_name: Siehl, Sebastian
last_name: Siehl
- first_name: Frauke
full_name: Nees, Frauke
last_name: Nees
- first_name: Maja
full_name: Neidhart, Maja
last_name: Neidhart
- first_name: Argyris
full_name: Stringaris, Argyris
last_name: Stringaris
- first_name: Emanuel
full_name: Schwarz, Emanuel
last_name: Schwarz
- first_name: Nathalie
full_name: Holz, Nathalie
last_name: Holz
- first_name: Heike
full_name: Tost, Heike
last_name: Tost
- first_name: Andreas
full_name: Meyer-Lindenberg, Andreas
last_name: Meyer-Lindenberg
- first_name: Nina
full_name: Christmann, Nina
last_name: Christmann
- first_name: Karina
full_name: Jansone, Karina
last_name: Jansone
- first_name: Tobias
full_name: Banaschewski, Tobias
last_name: Banaschewski
- first_name: Jamie
full_name: Banks, Jamie
last_name: Banks
- first_name: Kerstin
full_name: Schepanski, Kerstin
last_name: Schepanski
- first_name: Tatjana
full_name: Schütz, Tatjana
last_name: Schütz
- first_name: Ulrike Helene
full_name: Taron, Ulrike Helene
last_name: Taron
- first_name: Roland
full_name: Eils, Roland
last_name: Eils
- first_name: Jean Charles
full_name: Roy, Jean Charles
last_name: Roy
- first_name: Tristram A.
full_name: Lett, Tristram A.
last_name: Lett
- first_name: Hedi
full_name: Kebir, Hedi
last_name: Kebir
- first_name: Elli
full_name: Polemiti, Elli
last_name: Polemiti
- first_name: Esther
full_name: Hitchen, Esther
last_name: Hitchen
- first_name: Marcel
full_name: Jentsch, Marcel
last_name: Jentsch
- first_name: Emin
full_name: Serin, Emin
last_name: Serin
- first_name: Antoine
full_name: Bernas, Antoine
last_name: Bernas
- first_name: Nilakshi
full_name: Vaidya, Nilakshi
last_name: Vaidya
- first_name: Sven
full_name: Twardziok, Sven
last_name: Twardziok
- first_name: Markus
full_name: Ralser, Markus
last_name: Ralser
- first_name: Andreas
full_name: Heinz, Andreas
last_name: Heinz
- first_name: Henrik
full_name: Walter, Henrik
last_name: Walter
citation:
ama: Stahl B, Ogoh G, Schumann G, et al. Rethinking ethics in interdisciplinary
and big data-driven neuroscience projects. Nature Mental Health. 2024;2(10).
doi:10.1038/s44220-024-00320-3
apa: Stahl, B., Ogoh, G., Schumann, G., Walter, H., Stahl, B., Young, A. H., … Walter,
H. (2024). Rethinking ethics in interdisciplinary and big data-driven neuroscience
projects. Nature Mental Health. Springer Nature. https://doi.org/10.1038/s44220-024-00320-3
chicago: Stahl, Bernd, George Ogoh, Gunter Schumann, Henrik Walter, Bernd Stahl,
Allan H. Young, Sylvane Desrivières, et al. “Rethinking Ethics in Interdisciplinary
and Big Data-Driven Neuroscience Projects.” Nature Mental Health. Springer
Nature, 2024. https://doi.org/10.1038/s44220-024-00320-3.
ieee: B. Stahl et al., “Rethinking ethics in interdisciplinary and big data-driven
neuroscience projects,” Nature Mental Health, vol. 2, no. 10. Springer
Nature, 2024.
ista: Stahl B, Ogoh G, Schumann G, Walter H, Stahl B, Young AH, Desrivières S, Clinton
N, Thompson P, Schwalber A, Liu J, Calhoun V, Chang X, Xia Y, Gong Y, Jia T, Renner
P, Hese S, Giner A, Sanchez M, Alvarez E, Spanlang B, Pearmund C, Athanasiadis
AP, Otten L, Pitel S, Petkoski S, Jirsa V, Schmitt K, Wilbertz J, Patraskaki M,
Sommer P, Heilmann-Heimbach S, Mathey CM, Miller A, Claus I, Nöthen MM, Hoffmann
P, Forstner AJ, Pastor A, Gallego J, Orosa FE, Viapiana GF, Slater M, Marr L,
Novarino G, Marquand A, Böttger SJ, Tschorn M, Rapp M, Ask H, Kjelkenes R, Fernandez
S, Van Der Meer D, Westlye LT, Andreassen OA, Aden R, Seefried B, Siehl S, Nees
F, Neidhart M, Stringaris A, Schwarz E, Holz N, Tost H, Meyer-Lindenberg A, Christmann
N, Jansone K, Banaschewski T, Banks J, Schepanski K, Schütz T, Taron UH, Eils
R, Roy JC, Lett TA, Kebir H, Polemiti E, Hitchen E, Jentsch M, Serin E, Bernas
A, Vaidya N, Twardziok S, Ralser M, Heinz A, Walter H. 2024. Rethinking ethics
in interdisciplinary and big data-driven neuroscience projects. Nature Mental
Health. 2(10), 1128–1130.
mla: Stahl, Bernd, et al. “Rethinking Ethics in Interdisciplinary and Big Data-Driven
Neuroscience Projects.” Nature Mental Health, vol. 2, no. 10, 1128–1130,
Springer Nature, 2024, doi:10.1038/s44220-024-00320-3.
short: B. Stahl, G. Ogoh, G. Schumann, H. Walter, B. Stahl, A.H. Young, S. Desrivières,
N. Clinton, P. Thompson, A. Schwalber, J. Liu, V. Calhoun, X. Chang, Y. Xia, Y.
Gong, T. Jia, P. Renner, S. Hese, A. Giner, M. Sanchez, E. Alvarez, B. Spanlang,
C. Pearmund, A.P. Athanasiadis, L. Otten, S. Pitel, S. Petkoski, V. Jirsa, K.
Schmitt, J. Wilbertz, M. Patraskaki, P. Sommer, S. Heilmann-Heimbach, C.M. Mathey,
A. Miller, I. Claus, M.M. Nöthen, P. Hoffmann, A.J. Forstner, A. Pastor, J. Gallego,
F.E. Orosa, G.F. Viapiana, M. Slater, L. Marr, G. Novarino, A. Marquand, S.J.
Böttger, M. Tschorn, M. Rapp, H. Ask, R. Kjelkenes, S. Fernandez, D. Van Der Meer,
L.T. Westlye, O.A. Andreassen, R. Aden, B. Seefried, S. Siehl, F. Nees, M. Neidhart,
A. Stringaris, E. Schwarz, N. Holz, H. Tost, A. Meyer-Lindenberg, N. Christmann,
K. Jansone, T. Banaschewski, J. Banks, K. Schepanski, T. Schütz, U.H. Taron, R.
Eils, J.C. Roy, T.A. Lett, H. Kebir, E. Polemiti, E. Hitchen, M. Jentsch, E. Serin,
A. Bernas, N. Vaidya, S. Twardziok, M. Ralser, A. Heinz, H. Walter, Nature Mental
Health 2 (2024).
date_created: 2025-08-10T22:01:30Z
date_published: 2024-10-01T00:00:00Z
date_updated: 2025-08-11T06:53:55Z
day: '01'
department:
- _id: GaNo
doi: 10.1038/s44220-024-00320-3
intvolume: ' 2'
issue: '10'
language:
- iso: eng
month: '10'
oa_version: None
publication: Nature Mental Health
publication_identifier:
eissn:
- 2731-6076
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Rethinking ethics in interdisciplinary and big data-driven neuroscience projects
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 2
year: '2024'
...
---
OA_place: publisher
_id: '17208'
abstract:
- lang: eng
text: "Can current quantum computers provide a speedup over their classical counterparts
for some kinds of problems? In this thesis, with a focus on ground state search/preparation,
we address some of the challenges that both quantum annealing and variational
quantum algorithms suffer from, hindering any possible practical speedup in comparison
to the best classical counterparts. \r\n\r\nIn the first part of the thesis, we
study the performance of quantum annealing for solving a particular combinatorial
optimization problem called 3-XOR satisfability (3-XORSAT). The classical problem
is mapped into a ground state search of a 3-local classical Hamiltonian $H_C$.
We consider how modifying the initial problem, by adding more interaction terms
to the corresponding Hamiltonian, leads to the emergence of a first-order phase
transition during the annealing process. This phenomenon causes the total annealing
duration, $T$, required to prepare the ground state of $H_C$ with a high probability
to increase exponentially with the size of the problem. Our findings indicate
that with the growing complexity of problem instances, the likelihood of encountering
first-order phase transitions also increases, making quantum annealing an impractical
solution for these types of combinatorial optimization problems.\r\n\r\nIn the
second part, we focus on the problem of barren plateaus in generic variational
quantum algorithms. Barren plateaus correspond to flat regions in the parameter
space where the gradient of the cost function is zero in expectation, and with
the variance decaying exponentially with the system size, thus obstructing an
efficient parameter optimization. We propose an algorithm to circumvent Barren
Plateaus by monitoring the entanglement entropy of k-local reduced density matrices,
alongside a method for estimating entanglement entropy via classical shadow tomography.
We illustrate the approach with the paradigmatic example of the variational quantum
eigensolver, and show that our algorithm effectively avoids barren plateaus in
the initialization as well as during the optimization stage. \r\n\r\nLastly, in
the last two Chapters of this thesis, we focus on the quantum approximate optimization
algorithm (QAOA), originally introduced as an algorithm for solving generic combinatorial
optimization problems in near-term quantum devices. Specifically, we focus on
how to develop rigorous initialization strategies with guarantee improvement.
Our motivation for this study lies in that for random initialization, the optimization
typically leads to local minima with poor performance. Our main result corresponds
to the analytical construction of index-1 saddle points or transition states,
stationary points with a single direction of descent, as a tool for systematically
exploring the QAOA optimization landscape. This leads us to propose a novel greedy
parameter initialization strategy that guarantees for the energy to decrease with
an increasing number of circuit layers. Furthermore, with precise estimates for
the negative Hessian eigenvalue and its eigenvector, we establish a lower bound
for energy improvement following a QAOA iteration."
acknowledged_ssus:
- _id: ScienComp
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Raimel A
full_name: Medina Ramos, Raimel A
id: CE680B90-D85A-11E9-B684-C920E6697425
last_name: Medina Ramos
orcid: 0000-0002-5383-2869
citation:
ama: Medina Ramos RA. Exploring the optimization landscape of variational quantum
algorithms. 2024. doi:10.15479/at:ista:17208
apa: Medina Ramos, R. A. (2024). Exploring the optimization landscape of variational
quantum algorithms. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17208
chicago: Medina Ramos, Raimel A. “Exploring the Optimization Landscape of Variational
Quantum Algorithms.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17208.
ieee: R. A. Medina Ramos, “Exploring the optimization landscape of variational quantum
algorithms,” Institute of Science and Technology Austria, 2024.
ista: Medina Ramos RA. 2024. Exploring the optimization landscape of variational
quantum algorithms. Institute of Science and Technology Austria.
mla: Medina Ramos, Raimel A. Exploring the Optimization Landscape of Variational
Quantum Algorithms. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17208.
short: R.A. Medina Ramos, Exploring the Optimization Landscape of Variational Quantum
Algorithms, Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-07-09T09:14:24Z
date_published: 2024-07-09T00:00:00Z
date_updated: 2026-04-07T12:43:22Z
day: '09'
ddc:
- '539'
degree_awarded: PhD
department:
- _id: GradSch
- _id: MaSe
doi: 10.15479/at:ista:17208
ec_funded: 1
file:
- access_level: closed
checksum: 6f45273d04f4418bc2adc018baed0525
content_type: application/zip
creator: rmedinar
date_created: 2024-07-09T09:21:44Z
date_updated: 2024-07-10T11:34:09Z
file_id: '17212'
file_name: Raimel_Thesis-Final.zip
file_size: '14218691'
relation: source_file
- access_level: open_access
checksum: 6724a95bec772dbabc0111b9f08a805e
content_type: application/pdf
creator: rmedinar
date_created: 2024-07-17T09:23:24Z
date_updated: 2024-07-17T09:23:24Z
file_id: '17275'
file_name: Raimel_Thesis-20_pdfa.pdf
file_size: 11253627
relation: main_file
success: 1
file_date_updated: 2024-07-17T09:23:24Z
has_accepted_license: '1'
keyword:
- Quantum computing
- Variational Quantum Algorithms
- Optimization
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: '133'
project:
- _id: 23841C26-32DE-11EA-91FC-C7463DDC885E
call_identifier: H2020
grant_number: '850899'
name: 'Non-Ergodic Quantum Matter: Universality, Dynamics and Control'
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '10545'
relation: part_of_dissertation
status: public
- id: '10067'
relation: part_of_dissertation
status: public
- id: '17222'
relation: part_of_dissertation
status: public
- id: '13125'
relation: part_of_dissertation
status: public
- id: '11471'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Maksym
full_name: Serbyn, Maksym
id: 47809E7E-F248-11E8-B48F-1D18A9856A87
last_name: Serbyn
orcid: 0000-0002-2399-5827
title: Exploring the optimization landscape of variational quantum algorithms
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
OA_type: free access
_id: '17231'
abstract:
- lang: eng
text: In the class of projective billiards, which contains the usual billiards,
we exhibit counter-examples to Ivrii's conjecture, which states that in any planar
billiard with smooth boundary the set of periodic orbits has zero measure. The
counter-examples are polygons admitting a 2-parameters family of n-periodic orbits,
with n being either 3 or any even integer greater than 4.
article_processing_charge: No
article_type: original
author:
- first_name: Corentin
full_name: Fiorebe, Corentin
id: 06619f18-9070-11eb-847d-d1ee780bd88b
last_name: Fiorebe
citation:
ama: Fiorebe C. Examples of projective billiards with open sets of periodic orbits.
Discrete and Continuous Dynamical Systems- Series A. 2024;44(11):3287-3301.
doi:10.3934/dcds.2024059
apa: Fiorebe, C. (2024). Examples of projective billiards with open sets of periodic
orbits. Discrete and Continuous Dynamical Systems- Series A. American Institute
of Mathematical Sciences. https://doi.org/10.3934/dcds.2024059
chicago: Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of
Periodic Orbits.” Discrete and Continuous Dynamical Systems- Series A.
American Institute of Mathematical Sciences, 2024. https://doi.org/10.3934/dcds.2024059.
ieee: C. Fiorebe, “Examples of projective billiards with open sets of periodic orbits,”
Discrete and Continuous Dynamical Systems- Series A, vol. 44, no. 11. American
Institute of Mathematical Sciences, pp. 3287–3301, 2024.
ista: Fiorebe C. 2024. Examples of projective billiards with open sets of periodic
orbits. Discrete and Continuous Dynamical Systems- Series A. 44(11), 3287–3301.
mla: Fiorebe, Corentin. “Examples of Projective Billiards with Open Sets of Periodic
Orbits.” Discrete and Continuous Dynamical Systems- Series A, vol. 44,
no. 11, American Institute of Mathematical Sciences, 2024, pp. 3287–301, doi:10.3934/dcds.2024059.
short: C. Fiorebe, Discrete and Continuous Dynamical Systems- Series A 44 (2024)
3287–3301.
corr_author: '1'
date_created: 2024-07-14T22:01:10Z
date_published: 2024-11-01T00:00:00Z
date_updated: 2026-06-18T17:54:16Z
day: '01'
ddc:
- '500'
department:
- _id: VaKa
doi: 10.3934/dcds.2024059
external_id:
isi:
- '001230091000001'
intvolume: ' 44'
isi: 1
issue: '11'
language:
- iso: eng
main_file_link:
- open_access: '1'
url: https://doi.org/10.3934/dcds.2024059
month: '11'
oa: 1
oa_version: Published Version
page: 3287-3301
publication: Discrete and Continuous Dynamical Systems- Series A
publication_identifier:
eissn:
- 1553-5231
issn:
- 1078-0947
publication_status: published
publisher: American Institute of Mathematical Sciences
quality_controlled: '1'
scopus_import: '1'
status: public
title: Examples of projective billiards with open sets of periodic orbits
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 44
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17283'
abstract:
- lang: eng
text: 'We consider the problems of statically refuting equivalence and similarity
of output distributions defined by a pair of probabilistic programs. Equivalence
and similarity are two fundamental relational properties of probabilistic programs
that are essential for their correctness both in implementation and in compilation.
In this work, we present a new method for static equivalence and similarity refutation.
Our method refutes equivalence and similarity by computing a function over program
outputs whose expected value with respect to the output distributions of two programs
is different. The function is computed simultaneously with an upper expectation
supermartingale and a lower expectation submartingale for the two programs, which
we show to together provide a formal certificate for refuting equivalence and
similarity. To the best of our knowledge, our method is the first approach to
relational program analysis to offer the combination of the following desirable
features: (1) it is fully automated, (2) it is applicable to infinite-state probabilistic
programs, and (3) it provides formal guarantees on the correctness of its results.
We implement a prototype of our method and our experiments demonstrate the effectiveness
of our method to refute equivalence and similarity for a number of examples collected
from the literature.'
acknowledgement: "This research was partially supported by the ERC CoG 863818 (ForM-SMArt)
grant. Petr Novotný\r\nis supported by the Czech Science Foundation grant no. GA23-06963S.\r\n"
article_number: '232'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Krishnendu
full_name: Chatterjee, Krishnendu
id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87
last_name: Chatterjee
orcid: 0000-0002-4561-241X
- first_name: Ehsan
full_name: Kafshdar Goharshadi, Ehsan
id: 103b4fa0-896a-11ed-bdf8-87b697bef40d
last_name: Kafshdar Goharshadi
orcid: 0000-0002-8595-0587
- first_name: Petr
full_name: Novotný, Petr
id: 3CC3B868-F248-11E8-B48F-1D18A9856A87
last_name: Novotný
- first_name: Dorde
full_name: Zikelic, Dorde
id: 294AA7A6-F248-11E8-B48F-1D18A9856A87
last_name: Zikelic
orcid: 0000-0002-4681-1699
citation:
ama: Chatterjee K, Goharshady E, Novotný P, Zikelic D. Equivalence and similarity
refutation for probabilistic programs. Proceedings of the ACM on Programming
Languages. 2024;8. doi:10.1145/3656462
apa: Chatterjee, K., Goharshady, E., Novotný, P., & Zikelic, D. (2024). Equivalence
and similarity refutation for probabilistic programs. Proceedings of the ACM
on Programming Languages. Association for Computing Machinery. https://doi.org/10.1145/3656462
chicago: Chatterjee, Krishnendu, Ehsan Goharshady, Petr Novotný, and Dorde Zikelic.
“Equivalence and Similarity Refutation for Probabilistic Programs.” Proceedings
of the ACM on Programming Languages. Association for Computing Machinery,
2024. https://doi.org/10.1145/3656462.
ieee: K. Chatterjee, E. Goharshady, P. Novotný, and D. Zikelic, “Equivalence and
similarity refutation for probabilistic programs,” Proceedings of the ACM on
Programming Languages, vol. 8. Association for Computing Machinery, 2024.
ista: Chatterjee K, Goharshady E, Novotný P, Zikelic D. 2024. Equivalence and similarity
refutation for probabilistic programs. Proceedings of the ACM on Programming Languages.
8, 232.
mla: Chatterjee, Krishnendu, et al. “Equivalence and Similarity Refutation for Probabilistic
Programs.” Proceedings of the ACM on Programming Languages, vol. 8, 232,
Association for Computing Machinery, 2024, doi:10.1145/3656462.
short: K. Chatterjee, E. Goharshady, P. Novotný, D. Zikelic, Proceedings of the
ACM on Programming Languages 8 (2024).
corr_author: '1'
date_created: 2024-07-21T22:01:01Z
date_published: 2024-06-20T00:00:00Z
date_updated: 2025-04-14T07:52:47Z
day: '20'
ddc:
- '000'
department:
- _id: KrCh
- _id: GradSch
doi: 10.1145/3656462
ec_funded: 1
external_id:
arxiv:
- '2404.03430'
file:
- access_level: open_access
checksum: 8cbf220f284a4a87d093db5320c5afdd
content_type: application/pdf
creator: dernst
date_created: 2024-07-22T07:17:14Z
date_updated: 2024-07-22T07:17:14Z
file_id: '17290'
file_name: 2024_ACMProgLang_Chatterjee.pdf
file_size: 355421
relation: main_file
success: 1
file_date_updated: 2024-07-22T07:17:14Z
has_accepted_license: '1'
intvolume: ' 8'
language:
- iso: eng
month: '06'
oa: 1
oa_version: Published Version
project:
- _id: 0599E47C-7A3F-11EA-A408-12923DDC885E
call_identifier: H2020
grant_number: '863818'
name: 'Formal Methods for Stochastic Models: Algorithms and Applications'
publication: Proceedings of the ACM on Programming Languages
publication_identifier:
eissn:
- 2475-1421
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: Equivalence and similarity refutation for probabilistic programs
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: 8
year: '2024'
...
---
OA_place: publisher
OA_type: hybrid
_id: '17291'
abstract:
- lang: eng
text: Bacterial cell walls are gigadalton-large cross-linked polymers with a wide
range of motional amplitudes, including rather rigid as well as highly flexible
parts. Magic-angle spinning NMR is a powerful method to obtain atomic-level information
about intact cell walls. Here we investigate sensitivity and information content
of different homonuclear 13Csingle bond13C and heteronuclear 1Hsingle bond15N,
1Hsingle bond13C and 15Nsingle bond13C correlation experiments. We demonstrate
that a CPMAS CryoProbe yields ca. 8-fold increased signal-to-noise over a room-temperature
probe, or a ca. 3–4-fold larger per-mass sensitivity. The increased sensitivity
allowed to obtain high-resolution spectra even on intact bacteria. Moreover, we
compare resolution and sensitivity of 1H MAS experiments obtained at 100 kHz vs.
55 kHz. Our study provides useful hints for choosing experiments to extract atomic-level
details on cell-wall samples.
acknowledgement: "This research was supported by the French Agence Nationale de la
Recherche (\r\nANR-16-CE11-0030-12, TransPepNMR). This work used the platforms of
the Grenoble Instruct-ERIC center (ISBG; UAR 3518 CNRS-CEA-UGA-EMBL) within the
Grenoble Partnership for Structural Biology (PSB), supported by FRISBI, France (ANR-10-INBS-0005-02\r\n)
and GRAL, financed within the University Grenoble Alpes graduate school (Ecoles
Universitaires de Recherche), CBH-EUR-GS (ANR-17-EURE-0003). Financial support from
the IR INFRANALYTICS FR2054 for conducting the research and intramural funding by
the Institute of Science and Technology Austria (ISTA) are gratefully acknowledged."
article_number: '107708'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Alicia
full_name: Vallet, Alicia
last_name: Vallet
- first_name: Isabel
full_name: Ayala, Isabel
last_name: Ayala
- first_name: Barbara
full_name: Perrone, Barbara
last_name: Perrone
- first_name: Alia
full_name: Hassan, Alia
last_name: Hassan
- first_name: Jean-Pierre
full_name: Simorre, Jean-Pierre
last_name: Simorre
- first_name: Catherine
full_name: Bougault, Catherine
last_name: Bougault
- first_name: Paul
full_name: Schanda, Paul
id: 7B541462-FAF6-11E9-A490-E8DFE5697425
last_name: Schanda
orcid: 0000-0002-9350-7606
citation:
ama: 'Vallet A, Ayala I, Perrone B, et al. MAS NMR experiments of corynebacterial
cell walls: Complementary 1H- and CPMAS CryoProbe-enhanced 13C-detected experiments.
Journal of Magnetic Resonance. 2024;364. doi:10.1016/j.jmr.2024.107708'
apa: 'Vallet, A., Ayala, I., Perrone, B., Hassan, A., Simorre, J.-P., Bougault,
C., & Schanda, P. (2024). MAS NMR experiments of corynebacterial cell walls:
Complementary 1H- and CPMAS CryoProbe-enhanced 13C-detected experiments. Journal
of Magnetic Resonance. Elsevier. https://doi.org/10.1016/j.jmr.2024.107708'
chicago: 'Vallet, Alicia, Isabel Ayala, Barbara Perrone, Alia Hassan, Jean-Pierre
Simorre, Catherine Bougault, and Paul Schanda. “MAS NMR Experiments of Corynebacterial
Cell Walls: Complementary 1H- and CPMAS CryoProbe-Enhanced 13C-Detected Experiments.”
Journal of Magnetic Resonance. Elsevier, 2024. https://doi.org/10.1016/j.jmr.2024.107708.'
ieee: 'A. Vallet et al., “MAS NMR experiments of corynebacterial cell walls:
Complementary 1H- and CPMAS CryoProbe-enhanced 13C-detected experiments,” Journal
of Magnetic Resonance, vol. 364. Elsevier, 2024.'
ista: 'Vallet A, Ayala I, Perrone B, Hassan A, Simorre J-P, Bougault C, Schanda
P. 2024. MAS NMR experiments of corynebacterial cell walls: Complementary 1H-
and CPMAS CryoProbe-enhanced 13C-detected experiments. Journal of Magnetic Resonance.
364, 107708.'
mla: 'Vallet, Alicia, et al. “MAS NMR Experiments of Corynebacterial Cell Walls:
Complementary 1H- and CPMAS CryoProbe-Enhanced 13C-Detected Experiments.” Journal
of Magnetic Resonance, vol. 364, 107708, Elsevier, 2024, doi:10.1016/j.jmr.2024.107708.'
short: A. Vallet, I. Ayala, B. Perrone, A. Hassan, J.-P. Simorre, C. Bougault, P.
Schanda, Journal of Magnetic Resonance 364 (2024).
corr_author: '1'
date_created: 2024-07-22T07:44:10Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-09T12:01:41Z
day: '01'
ddc:
- '570'
department:
- _id: PaSc
doi: 10.1016/j.jmr.2024.107708
external_id:
isi:
- '001259302800001'
pmid:
- '38901173'
file:
- access_level: open_access
checksum: 4b59f4f0c287ecbafd808da1212ced38
content_type: application/pdf
creator: dernst
date_created: 2024-07-23T06:23:51Z
date_updated: 2024-07-23T06:23:51Z
file_id: '17316'
file_name: 2024_JourMagneticResonance_Vallet.pdf
file_size: 2236665
relation: main_file
success: 1
file_date_updated: 2024-07-23T06:23:51Z
has_accepted_license: '1'
intvolume: ' 364'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
pmid: 1
publication: Journal of Magnetic Resonance
publication_identifier:
issn:
- 1090-7807
publication_status: published
publisher: Elsevier
quality_controlled: '1'
related_material:
record:
- id: '17042'
relation: research_data
status: public
scopus_import: '1'
status: public
title: 'MAS NMR experiments of corynebacterial cell walls: Complementary 1H- and CPMAS
CryoProbe-enhanced 13C-detected experiments'
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: 364
year: '2024'
...
---
OA_place: publisher
_id: '17336'
abstract:
- lang: eng
text: "This thesis deals with the study of stochastic processes and their ergodicity
properties. The\r\nvariety of problems encountered calls for a set of different
approaches, ranging from classical to\r\nmodern ones: a special place is held
by probabilistic methods based on couplings, by functional\r\ninequalities, and
by the theory of gradient flows in the space of measures.\r\n\r\nThe material
is organized as follows. Chapter 1 contains the introduction to this thesis, starting\r\nwith
a general presentation of some of the relevant topics. Section 1.1 is dedicated
to the\r\ntheory of gradient flows in metric spaces, and introduces the first
contribution of this thesis\r\n[DSMP24], which is presented in detail in Chapter
2. Section 1.2 moves to the topic of\r\ncurvature of Markov chains, concluding
with a brief description of our second contribution\r\n[Ped23], which is included
in Chapter 3. Section 1.3 discusses applications of stochastic\r\nprocesses to
the theory of sampling, in particular the recent framework of score-based diffusion\r\nmodels,
and our contribution [PMM24], which is contained in Chapter 4. Section 1.4 discusses\r\nsome
related problems, concerning the regularization properties of the heat flow. It
serves\r\nas a motivation for the work [BP24], which we report in Chapter 5. Finally,
Section 1.5\r\ndiscusses the last contribution of this thesis, which can be found
in Chapter 6. It deals with\r\nthe convergence to equilibrium of a particular
stochastic model from quantitative genetics:\r\nthis is established via some functional
inequalities, which we prove with probabilistic arguments\r\nbased on couplings.\r\n"
alternative_title:
- ISTA Thesis
article_processing_charge: No
author:
- first_name: Francesco
full_name: Pedrotti, Francesco
id: d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c
last_name: Pedrotti
citation:
ama: Pedrotti F. Functional inequalities and convergence of stochastic processes.
2024. doi:10.15479/at:ista:17336
apa: Pedrotti, F. (2024). Functional inequalities and convergence of stochastic
processes. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:17336
chicago: Pedrotti, Francesco. “Functional Inequalities and Convergence of Stochastic
Processes.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:17336.
ieee: F. Pedrotti, “Functional inequalities and convergence of stochastic processes,”
Institute of Science and Technology Austria, 2024.
ista: Pedrotti F. 2024. Functional inequalities and convergence of stochastic processes.
Institute of Science and Technology Austria.
mla: Pedrotti, Francesco. Functional Inequalities and Convergence of Stochastic
Processes. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:17336.
short: F. Pedrotti, Functional Inequalities and Convergence of Stochastic Processes,
Institute of Science and Technology Austria, 2024.
corr_author: '1'
date_created: 2024-07-29T09:14:14Z
date_published: 2024-07-31T00:00:00Z
date_updated: 2026-04-07T13:00:03Z
day: '31'
ddc:
- '500'
- '510'
- '515'
- '519'
degree_awarded: PhD
department:
- _id: GradSch
- _id: JaMa
doi: 10.15479/at:ista:17336
ec_funded: 1
file:
- access_level: open_access
checksum: 11650bab714ef85ad43a287060850523
content_type: application/pdf
creator: fpedrott
date_created: 2024-08-02T09:23:26Z
date_updated: 2024-08-02T09:23:26Z
file_id: '17366'
file_name: thesis_final.pdf
file_size: 2941599
relation: main_file
success: 1
- access_level: closed
checksum: c30ba5611941226cf1bfc867c25b1e80
content_type: application/x-zip-compressed
creator: fpedrott
date_created: 2024-08-02T09:27:15Z
date_updated: 2024-08-02T09:27:15Z
file_id: '17367'
file_name: thesis_final_source.zip
file_size: 6293375
relation: source_file
file_date_updated: 2024-08-02T09:27:15Z
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
month: '07'
oa: 1
oa_version: Published Version
page: '183'
project:
- _id: 256E75B8-B435-11E9-9278-68D0E5697425
call_identifier: H2020
grant_number: '716117'
name: Optimal Transport and Stochastic Dynamics
- _id: fc31cba2-9c52-11eb-aca3-ff467d239cd2
grant_number: F6504
name: Taming Complexity in Partial Differential Systems
publication_identifier:
issn:
- 2663-337X
publication_status: published
publisher: Institute of Science and Technology Austria
related_material:
record:
- id: '17351'
relation: part_of_dissertation
status: public
- id: '17353'
relation: part_of_dissertation
status: public
- id: '17350'
relation: part_of_dissertation
status: public
- id: '17352'
relation: part_of_dissertation
status: public
- id: '17143'
relation: part_of_dissertation
status: public
status: public
supervisor:
- first_name: Jan
full_name: Maas, Jan
id: 4C5696CE-F248-11E8-B48F-1D18A9856A87
last_name: Maas
orcid: 0000-0002-0845-1338
title: Functional inequalities and convergence of stochastic processes
tmp:
image: /images/cc_by_nc_nd.png
legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
(CC BY-NC-ND 4.0)
short: CC BY-NC-ND (4.0)
type: dissertation
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2024'
...
---
_id: '17402'
abstract:
- lang: eng
text: We present version 2.0 of the Partial Exploration Tool (PET), a tool for verification
of probabilistic systems. We extend the previous version by adding support for
stochastic games, based on a recent unified framework for sound value iteration
algorithms. Thereby, PET2 is the first tool implementing a sound and efficient
approach for solving stochastic games with objectives of the type reachability/safety
and mean payoff. We complement this approach by developing and implementing a
partial-exploration based variant for all three objectives. Our experimental evaluation
shows that PET2 offers the most efficient partial-exploration based algorithm
and is the most viable tool on SGs, even outperforming unsound tools.
acknowledgement: M. Weininger has received funding from the EU’s Horizon 2020 research
and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Tobias
full_name: Meggendorfer, Tobias
id: b21b0c15-30a2-11eb-80dc-f13ca25802e1
last_name: Meggendorfer
orcid: 0000-0002-1712-2165
- first_name: Maximilian
full_name: Weininger, Maximilian
id: 02ab0197-cc70-11ed-ab61-918e71f56881
last_name: Weininger
citation:
ama: 'Meggendorfer T, Weininger M. Playing games with your PET: Extending the Partial
Exploration Tool to stochastic games. In: 36th International Conference on
Computer Aided Verification. Vol 14683. Springer Nature; 2024:359-372. doi:10.1007/978-3-031-65633-0_16'
apa: 'Meggendorfer, T., & Weininger, M. (2024). Playing games with your PET:
Extending the Partial Exploration Tool to stochastic games. In 36th International
Conference on Computer Aided Verification (Vol. 14683, pp. 359–372). Montreal,
Canada: Springer Nature. https://doi.org/10.1007/978-3-031-65633-0_16'
chicago: 'Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your
PET: Extending the Partial Exploration Tool to Stochastic Games.” In 36th International
Conference on Computer Aided Verification, 14683:359–72. Springer Nature,
2024. https://doi.org/10.1007/978-3-031-65633-0_16.'
ieee: 'T. Meggendorfer and M. Weininger, “Playing games with your PET: Extending
the Partial Exploration Tool to stochastic games,” in 36th International Conference
on Computer Aided Verification, Montreal, Canada, 2024, vol. 14683, pp. 359–372.'
ista: 'Meggendorfer T, Weininger M. 2024. Playing games with your PET: Extending
the Partial Exploration Tool to stochastic games. 36th International Conference
on Computer Aided Verification. CAV: Computer Aided Verification, LNCS, vol. 14683,
359–372.'
mla: 'Meggendorfer, Tobias, and Maximilian Weininger. “Playing Games with Your PET:
Extending the Partial Exploration Tool to Stochastic Games.” 36th International
Conference on Computer Aided Verification, vol. 14683, Springer Nature, 2024,
pp. 359–72, doi:10.1007/978-3-031-65633-0_16.'
short: T. Meggendorfer, M. Weininger, in:, 36th International Conference on Computer
Aided Verification, Springer Nature, 2024, pp. 359–372.
conference:
end_date: 2024-07-27
location: Montreal, Canada
name: 'CAV: Computer Aided Verification'
start_date: 2024-07-24
corr_author: '1'
date_created: 2024-08-09T11:24:54Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:53:55Z
day: '01'
ddc:
- '000'
department:
- _id: KrCh
doi: 10.1007/978-3-031-65633-0_16
ec_funded: 1
external_id:
arxiv:
- '2405.03885'
isi:
- '001307897000016'
file:
- access_level: open_access
checksum: c888231d0a47b55786b7b4c0f02216bb
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T08:39:12Z
date_updated: 2024-08-12T08:39:12Z
file_id: '17419'
file_name: 2024_CAV_Meggendorfer.pdf
file_size: 368487
relation: main_file
success: 1
file_date_updated: 2024-08-12T08:39:12Z
has_accepted_license: '1'
intvolume: ' 14683'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 359-372
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
call_identifier: H2020
grant_number: '101034413'
name: 'IST-BRIDGE: International postdoctoral program'
publication: 36th International Conference on Computer Aided Verification
publication_identifier:
eisbn:
- '9783031656330'
eissn:
- 1611-3349
isbn:
- '9783031656323'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Playing games with your PET: Extending the Partial Exploration Tool to stochastic
games'
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14683
year: '2024'
...
---
_id: '17411'
abstract:
- lang: eng
text: "We present PeFLL, a new personalized federated learning algorithm that improves\r\nover
the state-of-the-art in three aspects: 1) it produces more accurate models,\r\nespecially
in the low-data regime, and not only for clients present during its\r\ntraining
phase, but also for any that may emerge in the future; 2) it reduces the\r\namount
of on-client computation and client-server communication by providing\r\nfuture
clients with ready-to-use personalized models that require no additional\r\nfinetuning
or optimization; 3) it comes with theoretical guarantees that establish\r\ngeneralization
from the observed clients to future ones.\r\nAt the core of PeFLL lies a learning-to-learn
approach that jointly trains an\r\nembedding network and a hypernetwork. The embedding
network is used to\r\nrepresent clients in a latent descriptor space in a way
that reflects their similarity\r\nto each other. The hypernetwork takes as input
such descriptors and outputs the\r\nparameters of fully personalized client models.
In combination, both networks\r\nconstitute a learning algorithm that achieves
state-of-the-art performance in several\r\npersonalized federated learning benchmarks"
acknowledged_ssus:
- _id: ScienComp
acknowledgement: "This research was supported by the Scientific Service Units (SSU)
of ISTA through resources provided by Scientific Computing (SciComp).\r\n"
article_processing_charge: No
arxiv: 1
author:
- first_name: Jonathan A
full_name: Scott, Jonathan A
id: e499926b-f6e0-11ea-865d-9c63db0031e8
last_name: Scott
- first_name: Hossein
full_name: Zakerinia, Hossein
id: 653bd8b6-f394-11eb-9cf6-c0bbf6cd78d4
last_name: Zakerinia
orcid: 0009-0007-3977-6462
- first_name: Christoph
full_name: Lampert, Christoph
id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
last_name: Lampert
orcid: 0000-0001-8622-7887
citation:
ama: 'Scott JA, Zakerinia H, Lampert C. PEFLL: Personalized federated learning by
learning to learn. In: 12th International Conference on Learning Representations.
OpenReview; 2024.'
apa: 'Scott, J. A., Zakerinia, H., & Lampert, C. (2024). PEFLL: Personalized
federated learning by learning to learn. In 12th International Conference on
Learning Representations. Vienna, Austria: OpenReview.'
chicago: 'Scott, Jonathan A, Hossein Zakerinia, and Christoph Lampert. “PEFLL: Personalized
Federated Learning by Learning to Learn.” In 12th International Conference
on Learning Representations. OpenReview, 2024.'
ieee: 'J. A. Scott, H. Zakerinia, and C. Lampert, “PEFLL: Personalized federated
learning by learning to learn,” in 12th International Conference on Learning
Representations, Vienna, Austria, 2024.'
ista: 'Scott JA, Zakerinia H, Lampert C. 2024. PEFLL: Personalized federated learning
by learning to learn. 12th International Conference on Learning Representations.
ICLR: International Conference on Learning Representations.'
mla: 'Scott, Jonathan A., et al. “PEFLL: Personalized Federated Learning by Learning
to Learn.” 12th International Conference on Learning Representations, OpenReview,
2024.'
short: J.A. Scott, H. Zakerinia, C. Lampert, in:, 12th International Conference
on Learning Representations, OpenReview, 2024.
conference:
end_date: 2024-03-07
location: Vienna, Austria
name: 'ICLR: International Conference on Learning Representations'
start_date: 2024-03-07
corr_author: '1'
date_created: 2024-08-11T22:01:12Z
date_published: 2024-03-07T00:00:00Z
date_updated: 2026-04-07T11:46:11Z
day: '07'
ddc:
- '000'
department:
- _id: ChLa
external_id:
arxiv:
- '2306.05515'
file:
- access_level: open_access
checksum: 81b7ea2e667adaf9c7a7b6b376b1f251
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T07:38:06Z
date_updated: 2024-08-12T07:38:06Z
file_id: '17415'
file_name: 2024_ICLR_Scott.pdf
file_size: 1029219
relation: main_file
success: 1
file_date_updated: 2024-08-12T07:38:06Z
has_accepted_license: '1'
language:
- iso: eng
month: '03'
oa: 1
oa_version: Published Version
publication: 12th International Conference on Learning Representations
publication_status: published
publisher: OpenReview
quality_controlled: '1'
related_material:
record:
- id: '21198'
relation: dissertation_contains
status: public
scopus_import: '1'
status: public
title: 'PEFLL: Personalized federated learning by learning to learn'
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2024'
...
---
_id: '17413'
abstract:
- lang: eng
text: Certification helps to increase trust in formal verification of safety-critical
systems which require assurance on their correctness. In hardware model checking,
a widely used formal verification technique, phase abstraction is considered one
of the most commonly used preprocessing techniques. We present an approach to
certify an extended form of phase abstraction using a generic certificate format.
As in earlier works our approach involves constructing a witness circuit with
an inductive invariant property that certifies the correctness of the entire model
checking process, which is then validated by an independent certificate checker.
We have implemented and evaluated the proposed approach including certification
for various preprocessing configurations on hardware model checking competition
benchmarks. As an improvement on previous work in this area, the proposed method
is able to efficiently complete certification with an overhead of a fraction of
model checking time.
acknowledgement: This work is supported by the Austrian Science Fund (FWF) under the
project W1255-N23, the LIT AI Lab funded by the State of Upper Austria, the ERC-2020-AdG
101020093, the Academy of Finland under the project 336092 and by a gift from Intel
Corporation.
alternative_title:
- LNCS
article_processing_charge: Yes (in subscription journal)
arxiv: 1
author:
- first_name: Nils
full_name: Froleyks, Nils
last_name: Froleyks
- first_name: Zhengqi
full_name: Yu, Zhengqi
id: 20aa2ae8-f2f1-11ed-bbfa-8205053f1342
last_name: Yu
- first_name: Armin
full_name: Biere, Armin
last_name: Biere
- first_name: Keijo
full_name: Heljanko, Keijo
last_name: Heljanko
citation:
ama: 'Froleyks N, Yu E, Biere A, Heljanko K. Certifying phase abstraction. In: Lecture
Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics). Vol 14739. Springer Nature; 2024:284-303.
doi:10.1007/978-3-031-63498-7_17'
apa: 'Froleyks, N., Yu, E., Biere, A., & Heljanko, K. (2024). Certifying phase
abstraction. In Lecture Notes in Computer Science (including subseries Lecture
Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol.
14739, pp. 284–303). Nancy, France: Springer Nature. https://doi.org/10.1007/978-3-031-63498-7_17'
chicago: Froleyks, Nils, Emily Yu, Armin Biere, and Keijo Heljanko. “Certifying
Phase Abstraction.” In Lecture Notes in Computer Science (Including Subseries
Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics),
14739:284–303. Springer Nature, 2024. https://doi.org/10.1007/978-3-031-63498-7_17.
ieee: N. Froleyks, E. Yu, A. Biere, and K. Heljanko, “Certifying phase abstraction,”
in Lecture Notes in Computer Science (including subseries Lecture Notes in
Artificial Intelligence and Lecture Notes in Bioinformatics), Nancy, France,
2024, vol. 14739, pp. 284–303.
ista: 'Froleyks N, Yu E, Biere A, Heljanko K. 2024. Certifying phase abstraction.
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial
Intelligence and Lecture Notes in Bioinformatics). IJCAR: International Joint
Conference on Automated Reasoning, LNCS, vol. 14739, 284–303.'
mla: Froleyks, Nils, et al. “Certifying Phase Abstraction.” Lecture Notes in
Computer Science (Including Subseries Lecture Notes in Artificial Intelligence
and Lecture Notes in Bioinformatics), vol. 14739, Springer Nature, 2024, pp.
284–303, doi:10.1007/978-3-031-63498-7_17.
short: N. Froleyks, E. Yu, A. Biere, K. Heljanko, in:, Lecture Notes in Computer
Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture
Notes in Bioinformatics), Springer Nature, 2024, pp. 284–303.
conference:
end_date: 2024-07-06
location: Nancy, France
name: 'IJCAR: International Joint Conference on Automated Reasoning'
start_date: 2024-07-03
date_created: 2024-08-11T22:01:13Z
date_published: 2024-07-01T00:00:00Z
date_updated: 2025-09-08T08:49:53Z
day: '01'
ddc:
- '000'
department:
- _id: ToHe
doi: 10.1007/978-3-031-63498-7_17
ec_funded: 1
external_id:
arxiv:
- '2405.04297'
isi:
- '001273489700017'
file:
- access_level: open_access
checksum: 7d7839fc8c5c680ea3ac09f40a66e55d
content_type: application/pdf
creator: dernst
date_created: 2024-08-12T06:53:39Z
date_updated: 2024-08-12T06:53:39Z
file_id: '17414'
file_name: 2024_LNCS_Froleyks.pdf
file_size: 556902
relation: main_file
success: 1
file_date_updated: 2024-08-12T06:53:39Z
has_accepted_license: '1'
intvolume: ' 14739'
isi: 1
language:
- iso: eng
month: '07'
oa: 1
oa_version: Published Version
page: 284-303
project:
- _id: 62781420-2b32-11ec-9570-8d9b63373d4d
call_identifier: H2020
grant_number: '101020093'
name: Vigilant Algorithmic Monitoring of Software
publication: Lecture Notes in Computer Science (including subseries Lecture Notes
in Artificial Intelligence and Lecture Notes in Bioinformatics)
publication_identifier:
eissn:
- 1611-3349
isbn:
- '9783031634970'
issn:
- 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Certifying phase abstraction
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: 317138e5-6ab7-11ef-aa6d-ffef3953e345
volume: 14739
year: '2024'
...