---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21896'
abstract:
- lang: eng
  text: Redox-mediated flow batteries boost energy density by utilizing dissolved
    redox species as charge carriers for solid charge-storage materials. This strategy
    strongly depends on the thermodynamics and kinetics between the solid booster
    and dissolved redox species. Conventional electrochemical methods often convolute
    intrinsic reactivity with mass transport effects, introducing complexity in determining
    limiting steps. We propose a strategy that confines solid boosters within recessed
    microelectrodes and employs scanning electrochemical microscopy (SECM) to estimate
    reaction kinetics between booster and dissolved active redox species. Confining
    the solid booster in the recessed microelectrode overcomes mass transport limitations
    of dissolved redox species and enables controlled polarization of the booster
    material, allowing deconvolution of key rate-determining factors. As an initial
    model system, Prussian blue-ferricyanide/ferrocyanide [Fe(CN)6]3−/4− was used
    as solid booster and dissolved redox active species, respectively. The methodology
    was further explored for copper hexacyanoferrate with N,N,N-2,2,6,6-heptamethylpiperidinyl
    oxy-4-ammonium chloride and nickel hydroxide with [Fe(CN)6]3−/4− and extended
    to Mn-based Prussian blue analogues in combination with organic redox species.
    Our results demonstrate that SECM coupled with the proposed recessed microelectrode
    strategy provides a powerful platform to disentangle interfacial kinetics and
    guide the rational design of solid booster-dissolved redox species and electrolytes
    for high-performance redox-mediated flow batteries.
acknowledgement: "The authors acknowledge funding from the European Union's Horizon
  Europe research and innovation programme— European Innovation Council (EIC) under
  the grant agreement No 101046742 (MeBattery). P.P. acknowledges the funding from
  the European Research Council through a Starting Grant (agreement no. 950038). Dr.
  Mahdi Moghaddam, University of Turku, is acknowledged for providing the CuHCF, and
  Prof. Hubert Girault, EPFL, is acknowledged for providing the TEMPTMA.\r\nOpen Access
  funding enabled and organized by Projekt DEAL."
article_number: e70303
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Carla
  full_name: Santana Santos, Carla
  last_name: Santana Santos
- first_name: Nomnotho
  full_name: Jiyane, Nomnotho
  last_name: Jiyane
- first_name: Thomas
  full_name: Quast, Thomas
  last_name: Quast
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
- first_name: Rubén
  full_name: Rubio‐Presa, Rubén
  last_name: Rubio‐Presa
- first_name: Pekka
  full_name: Peljo, Pekka
  last_name: Peljo
- first_name: Wolfgang
  full_name: Schuhmann, Wolfgang
  last_name: Schuhmann
citation:
  ama: Santana Santos C, Jiyane N, Quast T, et al. Evaluating reaction kinetics between
    solid booster and dissolved active species in redox‐mediated flow batteries using
    scanning electrochemical microscopy. <i>Batteries &#38; Supercaps</i>. 2026;9(5).
    doi:<a href="https://doi.org/10.1002/batt.70303">10.1002/batt.70303</a>
  apa: Santana Santos, C., Jiyane, N., Quast, T., Ibáñez, M., Rubio‐Presa, R., Peljo,
    P., &#38; Schuhmann, W. (2026). Evaluating reaction kinetics between solid booster
    and dissolved active species in redox‐mediated flow batteries using scanning electrochemical
    microscopy. <i>Batteries &#38; Supercaps</i>. Wiley. <a href="https://doi.org/10.1002/batt.70303">https://doi.org/10.1002/batt.70303</a>
  chicago: Santana Santos, Carla, Nomnotho Jiyane, Thomas Quast, Maria Ibáñez, Rubén
    Rubio‐Presa, Pekka Peljo, and Wolfgang Schuhmann. “Evaluating Reaction Kinetics
    between Solid Booster and Dissolved Active Species in Redox‐mediated Flow Batteries
    Using Scanning Electrochemical Microscopy.” <i>Batteries &#38; Supercaps</i>.
    Wiley, 2026. <a href="https://doi.org/10.1002/batt.70303">https://doi.org/10.1002/batt.70303</a>.
  ieee: C. Santana Santos <i>et al.</i>, “Evaluating reaction kinetics between solid
    booster and dissolved active species in redox‐mediated flow batteries using scanning
    electrochemical microscopy,” <i>Batteries &#38; Supercaps</i>, vol. 9, no. 5.
    Wiley, 2026.
  ista: Santana Santos C, Jiyane N, Quast T, Ibáñez M, Rubio‐Presa R, Peljo P, Schuhmann
    W. 2026. Evaluating reaction kinetics between solid booster and dissolved active
    species in redox‐mediated flow batteries using scanning electrochemical microscopy.
    Batteries &#38; Supercaps. 9(5), e70303.
  mla: Santana Santos, Carla, et al. “Evaluating Reaction Kinetics between Solid Booster
    and Dissolved Active Species in Redox‐mediated Flow Batteries Using Scanning Electrochemical
    Microscopy.” <i>Batteries &#38; Supercaps</i>, vol. 9, no. 5, e70303, Wiley, 2026,
    doi:<a href="https://doi.org/10.1002/batt.70303">10.1002/batt.70303</a>.
  short: C. Santana Santos, N. Jiyane, T. Quast, M. Ibáñez, R. Rubio‐Presa, P. Peljo,
    W. Schuhmann, Batteries &#38; Supercaps 9 (2026).
das_tickbox: '1'
date_created: 2026-05-20T14:32:37Z
date_published: 2026-05-01T00:00:00Z
date_updated: 2026-07-08T06:48:01Z
day: '01'
ddc:
- '530'
department:
- _id: MaIb
doi: 10.1002/batt.70303
file:
- access_level: open_access
  checksum: 292d65503a63cc7df92b960627634dad
  content_type: application/pdf
  creator: dernst
  date_created: 2026-05-21T06:54:57Z
  date_updated: 2026-05-21T06:54:57Z
  file_id: '21904'
  file_name: 2026_BatteriesSupercaps_SantanaSantos.pdf
  file_size: 756344
  relation: main_file
  success: 1
file_date_updated: 2026-05-21T06:54:57Z
has_accepted_license: '1'
intvolume: '         9'
issue: '5'
language:
- iso: eng
license: https://creativecommons.org/licenses/by/4.0/
month: '05'
oa: 1
oa_version: Published Version
publication: Batteries & Supercaps
publication_identifier:
  eissn:
  - 2566-6223
publication_status: published
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Evaluating reaction kinetics between solid booster and dissolved active species
  in redox‐mediated flow batteries using scanning electrochemical microscopy
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: 9
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
_id: '22152'
abstract:
- lang: eng
  text: "We study off-diagonal Ramsey numbers \U0001D45F⁡(\U0001D43B,\U0001D43E(\U0001D458)\r\n\U0001D45B)
    of \U0001D458-uniform hypergraphs, where \U0001D43B is a fixed linear \U0001D458-uniform
    hypergraph and \U0001D43E(\U0001D458)\r\n\U0001D45B is complete on \U0001D45B
    vertices. Recently, Conlon, Fox, Gunby, He, Mubayi, Suk, and Verstraëte disproved
    the folklore conjecture that \U0001D45F⁡(\U0001D43B,\U0001D43E(3)\r\n\U0001D45B)
    always grows polynomially in \U0001D45B. In this paper, we show that much larger
    growth rates are possible in higher uniformity. In uniformity \U0001D458 ≥4, we
    prove that for any constant \U0001D436 >0, there exists a linear \U0001D458-uniform
    hypergraph \U0001D43B for which\r\n\r\n\U0001D45F⁡(\U0001D43B,\U0001D43E(\U0001D458)\r\n\U0001D45B)≥twr\U0001D458−2⁢(2(log⁡\U0001D45B)\U0001D436)."
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Xiaoyu
  full_name: He, Xiaoyu
  last_name: He
- first_name: Jiaxi
  full_name: Nie, Jiaxi
  last_name: Nie
- first_name: Yuval
  full_name: Wigderson, Yuval
  id: 2d0023a0-1567-11f0-833d-d5c1e476d4b5
  last_name: Wigderson
- first_name: Hung-Hsun
  full_name: Yu, Hung-Hsun
  last_name: Yu
citation:
  ama: He X, Nie J, Wigderson Y, Yu H-H. Off-diagonal Ramsey numbers for linear hypergraphs.
    <i>Combinatorics, Probability and Computing</i>. 2026:1-14. doi:<a href="https://doi.org/10.1017/s0963548326100443">10.1017/s0963548326100443</a>
  apa: He, X., Nie, J., Wigderson, Y., &#38; Yu, H.-H. (2026). Off-diagonal Ramsey
    numbers for linear hypergraphs. <i>Combinatorics, Probability and Computing</i>.
    Cambridge University Press. <a href="https://doi.org/10.1017/s0963548326100443">https://doi.org/10.1017/s0963548326100443</a>
  chicago: He, Xiaoyu, Jiaxi Nie, Yuval Wigderson, and Hung-Hsun Yu. “Off-Diagonal
    Ramsey Numbers for Linear Hypergraphs.” <i>Combinatorics, Probability and Computing</i>.
    Cambridge University Press, 2026. <a href="https://doi.org/10.1017/s0963548326100443">https://doi.org/10.1017/s0963548326100443</a>.
  ieee: X. He, J. Nie, Y. Wigderson, and H.-H. Yu, “Off-diagonal Ramsey numbers for
    linear hypergraphs,” <i>Combinatorics, Probability and Computing</i>. Cambridge
    University Press, pp. 1–14, 2026.
  ista: He X, Nie J, Wigderson Y, Yu H-H. 2026. Off-diagonal Ramsey numbers for linear
    hypergraphs. Combinatorics, Probability and Computing., 1–14.
  mla: He, Xiaoyu, et al. “Off-Diagonal Ramsey Numbers for Linear Hypergraphs.” <i>Combinatorics,
    Probability and Computing</i>, Cambridge University Press, 2026, pp. 1–14, doi:<a
    href="https://doi.org/10.1017/s0963548326100443">10.1017/s0963548326100443</a>.
  short: X. He, J. Nie, Y. Wigderson, H.-H. Yu, Combinatorics, Probability and Computing
    (2026) 1–14.
date_created: 2026-06-29T10:47:02Z
date_published: 2026-04-14T00:00:00Z
date_updated: 2026-07-08T07:24:54Z
day: '14'
ddc:
- '500'
doi: 10.1017/s0963548326100443
extern: '1'
external_id:
  arxiv:
  - '2507.05641'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1017/S0963548326100443
mathsc:
- 05D10
- 05D40
- 05C65
month: '04'
oa: 1
oa_version: Published Version
page: 1-14
publication: Combinatorics, Probability and Computing
publication_identifier:
  eissn:
  - 1469-2163
  issn:
  - 0963-5483
publication_status: epub_ahead
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Off-diagonal Ramsey numbers for linear hypergraphs
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2026'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '21161'
abstract:
- lang: eng
  text: In many species, sex-biased expression is widespread and thought to contribute
    to sexual dimorphism. While bulk RNA-sequencing has been instrumental in identifying
    strongly sex-biased genes, it lacks resolution to assess variation across cell-types
    and tissue compartments. Using single-nucleus expression data from the Fly Cell
    Atlas, we investigate sex differences in adult Drosophila melanogaster. We find
    that differences in cell-type composition between the sexes are not a major source
    of sex-bias, as for the vast majority of genes, the degree of sex-bias is similar
    regardless of whether sex differences in cell-type composition are controlled
    for or not. Our analysis confirms a deficit of X-linked male-biased genes in the
    body’s somatic tissues that is widespread across cell-types. We also find the
    excess of X-linked female-biased genes to be associated with nervous system cells
    in the head but with epithelial cells in the body’s somatic tissues, showing that
    single-nucleus data crucially resolves sex-bias at the cell-type level. We investigate
    dosage compensation (DC) across 15 tissues and 17 cell-types. We observe that
    it varies throughout the body. Surprisingly, we observe a lack of DC in a cluster
    of main cells within the male accessory glands. This result highlights the importance
    of understanding context-dependent DC.
acknowledged_ssus:
- _id: ScienComp
- _id: Bio
acknowledgement: This work was partly funded by an Austrian Science Foundation FWF
  ESPRIT fellowship (10.55776/ESP6331524) to C.B. We would like to thank the Vicoso
  group for their invaluable input and discussions throughout this work. We thank
  Filip Ruzicka for his insightful comments on the manuscript. All computational resources
  were provided by the Scientific Computing Unit at ISTA. This research was also supported
  through resources provided by the Imaging & Optics Facility (IOF) at ISTA.
article_number: '20252471'
article_processing_charge: Yes (via OA deal)
article_type: original
author:
- first_name: Carolina
  full_name: De Castro Barbosa Rodrigues Barata, Carolina
  id: 20565186-803f-11ed-ab7e-96a4ff7694ef
  last_name: De Castro Barbosa Rodrigues Barata
  orcid: 0000-0003-1945-2245
- first_name: Beatriz
  full_name: Vicoso, Beatriz
  id: 49E1C5C6-F248-11E8-B48F-1D18A9856A87
  last_name: Vicoso
  orcid: 0000-0002-4579-8306
citation:
  ama: de Castro Barbosa Rodrigues Barata C, Vicoso B. Single-nucleus resolution of
    sex-biased expression and dosage compensation in Drosophila melanogaster. <i>Proceedings
    of the Royal Society B Biological Sciences</i>. 2026;293(2063). doi:<a href="https://doi.org/10.1098/rspb.2025.2471">10.1098/rspb.2025.2471</a>
  apa: de Castro Barbosa Rodrigues Barata, C., &#38; Vicoso, B. (2026). Single-nucleus
    resolution of sex-biased expression and dosage compensation in Drosophila melanogaster.
    <i>Proceedings of the Royal Society B Biological Sciences</i>. Royal Society of
    London. <a href="https://doi.org/10.1098/rspb.2025.2471">https://doi.org/10.1098/rspb.2025.2471</a>
  chicago: Castro Barbosa Rodrigues Barata, Carolina de, and Beatriz Vicoso. “Single-Nucleus
    Resolution of Sex-Biased Expression and Dosage Compensation in Drosophila Melanogaster.”
    <i>Proceedings of the Royal Society B Biological Sciences</i>. Royal Society of
    London, 2026. <a href="https://doi.org/10.1098/rspb.2025.2471">https://doi.org/10.1098/rspb.2025.2471</a>.
  ieee: C. de Castro Barbosa Rodrigues Barata and B. Vicoso, “Single-nucleus resolution
    of sex-biased expression and dosage compensation in Drosophila melanogaster,”
    <i>Proceedings of the Royal Society B Biological Sciences</i>, vol. 293, no. 2063.
    Royal Society of London, 2026.
  ista: de Castro Barbosa Rodrigues Barata C, Vicoso B. 2026. Single-nucleus resolution
    of sex-biased expression and dosage compensation in Drosophila melanogaster. Proceedings
    of the Royal Society B Biological Sciences. 293(2063), 20252471.
  mla: de Castro Barbosa Rodrigues Barata, Carolina, and Beatriz Vicoso. “Single-Nucleus
    Resolution of Sex-Biased Expression and Dosage Compensation in Drosophila Melanogaster.”
    <i>Proceedings of the Royal Society B Biological Sciences</i>, vol. 293, no. 2063,
    20252471, Royal Society of London, 2026, doi:<a href="https://doi.org/10.1098/rspb.2025.2471">10.1098/rspb.2025.2471</a>.
  short: C. de Castro Barbosa Rodrigues Barata, B. Vicoso, Proceedings of the Royal
    Society B Biological Sciences 293 (2026).
corr_author: '1'
das_tickbox: '1'
date_created: 2026-02-08T23:02:49Z
date_published: 2026-01-28T00:00:00Z
date_updated: 2026-07-08T09:17:41Z
day: '28'
ddc:
- '570'
department:
- _id: BeVi
doi: 10.1098/rspb.2025.2471
external_id:
  pmid:
  - '41592777'
file:
- access_level: open_access
  checksum: d76afebca0a6f112df0146ae2d929f36
  content_type: application/pdf
  creator: dernst
  date_created: 2026-02-16T09:26:02Z
  date_updated: 2026-02-16T09:26:02Z
  file_id: '21226'
  file_name: 2026_RoyalSocPubProceedingsB_Barata.pdf
  file_size: 2230841
  relation: main_file
  success: 1
file_date_updated: 2026-02-16T09:26:02Z
has_accepted_license: '1'
intvolume: '       293'
issue: '2063'
language:
- iso: eng
month: '01'
oa: 1
oa_version: Published Version
pmid: 1
project:
- _id: 90ef7108-16d5-11f0-9cad-e6e116913473
  grant_number: ESP 6331524
  name: Does genetic drift set a limit on the adaptive evolution of sex-biased expression?
publication: Proceedings of the Royal Society B Biological Sciences
publication_identifier:
  eissn:
  - 1471-2954
publication_status: published
publisher: Royal Society of London
quality_controlled: '1'
scopus_import: '1'
status: public
title: Single-nucleus resolution of sex-biased expression and dosage compensation
  in Drosophila melanogaster
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: 293
year: '2026'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '21488'
abstract:
- lang: eng
  text: Human height is a model for the genetic analysis of complex traits, and recent
    studies suggest the presence of thousands of common genetic variant associations
    and hundreds of low-frequency/rare variants. Here, we develop a new algorithmic
    paradigm based on approximate message passing (genomic vector approximate message
    passing [gVAMP]) for identifying DNA sequence variants associated with complex
    traits and common diseases in large-scale whole-genome sequencing (WGS) data.
    We show that gVAMP accurately localizes associations to variants with the correct
    frequency and position in the DNA, outperforming existing fine-mapping methods
    in selecting the appropriate genetic variants within WGS data. We then apply gVAMP
    to jointly model the relationship of tens of millions of WGS variants with human
    height in hundreds of thousands of UK Biobank individuals. We identify 59 rare
    variants and gene burden scores alongside many hundreds of DNA regions containing
    common variant associations and show that understanding the genetic basis of complex
    traits will require the joint analysis of hundreds of millions of variables measured
    on millions of people. The polygenic risk scores obtained from gVAMP have high
    accuracy (including a prediction accuracy of ∼46% for human height) and outperform
    current methods for downstream tasks such as mixed linear model association testing
    across 13 UK Biobank traits. In conclusion, gVAMP offers a scalable foundation
    for a wider range of analyses in WGS data.
acknowledgement: We thank Malgorzata Borczyk for creating the gene burden scores.
  We thank Robin Beaumont, Amedeo Roberto Esposito, Gareth Hawkes, Philip Schniter,
  Matthew Stephens, Pragya Sur, Peter Visscher, Michael Weedon, and Harry Wright for
  providing valuable suggestions and comments on earlier versions of the work. This
  project was funded by a Lopez-Loreta Prize to M.M., an SNSF Eccellenza Grant to
  M.R.R. (PCEGP3-181181), an ERC Starting Grant to M.M. (INF2, project number 101161364),
  and core funding from ISTA. High-performance computing was supported by the Scientific
  Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).
  We would like to acknowledge the participants and investigators of the UK Biobank
  study. We gratefully acknowledge the All of Us participants for their contributions,
  without whom this research would not have been possible. We also thank the National
  Institutes of Health All of Us Research Program for making available the participant
  data (and/or samples and/or cohort) examined in this study.
article_number: '101162'
article_processing_charge: Yes
article_type: original
author:
- first_name: Al
  full_name: Depope, Al
  id: 0b77531d-dbcd-11ea-9d1d-a8eee0bf3830
  last_name: Depope
- first_name: Jakub
  full_name: Bajzik, Jakub
  id: b995e25b-8c4b-11ed-a6d8-f71b7bcd6122
  last_name: Bajzik
- first_name: Marco
  full_name: Mondelli, Marco
  id: 27EB676C-8706-11E9-9510-7717E6697425
  last_name: Mondelli
  orcid: 0000-0002-3242-7020
- first_name: Matthew Richard
  full_name: Robinson, Matthew Richard
  id: E5D42276-F5DA-11E9-8E24-6303E6697425
  last_name: Robinson
  orcid: 0000-0001-8982-8813
citation:
  ama: Depope A, Bajzik J, Mondelli M, Robinson MR. Joint modeling of whole-genome
    sequencing data for human height via approximate message passing. <i>Cell Genomics</i>.
    2026. doi:<a href="https://doi.org/10.1016/j.xgen.2026.101162">10.1016/j.xgen.2026.101162</a>
  apa: Depope, A., Bajzik, J., Mondelli, M., &#38; Robinson, M. R. (2026). Joint modeling
    of whole-genome sequencing data for human height via approximate message passing.
    <i>Cell Genomics</i>. Elsevier. <a href="https://doi.org/10.1016/j.xgen.2026.101162">https://doi.org/10.1016/j.xgen.2026.101162</a>
  chicago: Depope, Al, Jakub Bajzik, Marco Mondelli, and Matthew Richard Robinson.
    “Joint Modeling of Whole-Genome Sequencing Data for Human Height via Approximate
    Message Passing.” <i>Cell Genomics</i>. Elsevier, 2026. <a href="https://doi.org/10.1016/j.xgen.2026.101162">https://doi.org/10.1016/j.xgen.2026.101162</a>.
  ieee: A. Depope, J. Bajzik, M. Mondelli, and M. R. Robinson, “Joint modeling of
    whole-genome sequencing data for human height via approximate message passing,”
    <i>Cell Genomics</i>. Elsevier, 2026.
  ista: Depope A, Bajzik J, Mondelli M, Robinson MR. 2026. Joint modeling of whole-genome
    sequencing data for human height via approximate message passing. Cell Genomics.,
    101162.
  mla: Depope, Al, et al. “Joint Modeling of Whole-Genome Sequencing Data for Human
    Height via Approximate Message Passing.” <i>Cell Genomics</i>, 101162, Elsevier,
    2026, doi:<a href="https://doi.org/10.1016/j.xgen.2026.101162">10.1016/j.xgen.2026.101162</a>.
  short: A. Depope, J. Bajzik, M. Mondelli, M.R. Robinson, Cell Genomics (2026).
corr_author: '1'
date_created: 2026-03-23T15:10:03Z
date_published: 2026-02-18T00:00:00Z
date_updated: 2026-07-10T13:27:19Z
day: '18'
ddc:
- '000'
- '570'
department:
- _id: MaMo
- _id: MaRo
doi: 10.1016/j.xgen.2026.101162
has_accepted_license: '1'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nc-nd/4.0/
main_file_link:
- open_access: '1'
  url: https://doi.org/10.1016/j.xgen.2026.101162
month: '02'
oa: 1
oa_version: Published Version
project:
- _id: 059876FA-7A3F-11EA-A408-12923DDC885E
  name: Prix Lopez-Loretta 2019 - Marco Mondelli
- _id: 911e6d1f-16d5-11f0-9cad-c5c68c6a1cdf
  grant_number: '101161364'
  name: 'Inference in High Dimensions: Light-speed Algorithms and Information Limits'
- _id: 9B8D11D6-BA93-11EA-9121-9846C619BF3A
  grant_number: PCEGP3_181181
  name: Improving estimation and prediction of common complex disease risk
publication: Cell Genomics
publication_identifier:
  eissn:
  - 2666-979X
publication_status: epub_ahead
publisher: Elsevier
quality_controlled: '1'
related_material:
  link:
  - description: News on ISTA website
    relation: press_release
    url: https://ista.ac.at/en/news/big-data-and-human-height/
  record:
  - id: '22258'
    relation: dissertation_contains
    status: for_moderation
status: public
title: Joint modeling of whole-genome sequencing data for human height via approximate
  message passing
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: ba8df636-2132-11f1-aed0-ed93e2281fdd
year: '2026'
...
---
OA_place: publisher
OA_type: gold
_id: '22007'
abstract:
- lang: eng
  text: "Truncation of cryptographic outputs is a technique that was recently introduced
    in Baldimtsi et al. [Foteini Baldimtsi et al., 2022]. The general idea is to try
    out many inputs to some cryptographic algorithm until the output (e.g. a public-key
    or some hash value) falls into some sparse set and thus can be compressed: by
    trying out an expected 2^k different inputs one will find an output that starts
    with k zeros.\r\nUsing such truncation one can for example save substantial gas
    fees on Blockchains where storing values is very expensive. While [Foteini Baldimtsi
    et al., 2022] show that truncation preserves the security of the underlying primitive,
    they only consider a setting without preprocessing. In this work we show that
    lower bounds on the time-space tradeoff for inverting random functions and permutations
    also hold with truncation, except for parameters ranges where the bound fails
    to hold for \"trivial\" reasons.\r\nConcretely, it’s known that any algorithm
    that inverts a random function or permutation with range N making T queries and
    using S bits of auxiliary input must satisfy S⋅ T ≥ Nlog N. This lower bound no
    longer holds in the truncated setting where one must only invert a challenge from
    a range of size N/2^k, as now one can simply save the replies to all N/2^k challenges,
    which requires S = log N⋅ N /2^k bits and allows to invert with T = 1 query.\r\nWe
    show that with truncation, whenever S is somewhat smaller than the log N⋅ N /2^k
    bits required to store the entire truncated function table, the known S⋅ T ≥ Nlog
    N lower bound applies."
alternative_title:
- LIPIcs
article_number: 4:1-4:10
article_processing_charge: Yes
author:
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
- first_name: Pengxiang
  full_name: Wang, Pengxiang
  last_name: Wang
citation:
  ama: 'Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing.
    In: <i>6th Conference on Information-Theoretic Cryptography</i>. Vol 343. Schloss
    Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href="https://doi.org/10.4230/LIPIcs.ITC.2025.4">10.4230/LIPIcs.ITC.2025.4</a>'
  apa: 'Pietrzak, K. Z., &#38; Wang, P. (2025). Time-space tradeoffs of truncation
    with preprocessing. In <i>6th Conference on Information-Theoretic Cryptography</i>
    (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum
    für Informatik. <a href="https://doi.org/10.4230/LIPIcs.ITC.2025.4">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>'
  chicago: Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation
    with Preprocessing.” In <i>6th Conference on Information-Theoretic Cryptography</i>,
    Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href="https://doi.org/10.4230/LIPIcs.ITC.2025.4">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>.
  ieee: K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,”
    in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara,
    CA, United States, 2025, vol. 343.
  ista: 'Pietrzak KZ, Wang P. 2025. Time-space tradeoffs of truncation with preprocessing.
    6th Conference on Information-Theoretic Cryptography. ITC: Information Theoretic
    Cryptography, LIPIcs, vol. 343, 4:1-4:10.'
  mla: Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation
    with Preprocessing.” <i>6th Conference on Information-Theoretic Cryptography</i>,
    vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a
    href="https://doi.org/10.4230/LIPIcs.ITC.2025.4">10.4230/LIPIcs.ITC.2025.4</a>.
  short: K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography,
    Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.
conference:
  end_date: 2025-08-17
  location: Santa Barbara, CA, United States
  name: 'ITC: Information Theoretic Cryptography'
  start_date: 2025-08-16
corr_author: '1'
cryptoeprintid: 1
das_tickbox: '0'
date_created: 2026-06-14T22:01:45Z
date_published: 2025-09-08T00:00:00Z
date_updated: 2026-06-22T08:57:41Z
day: '08'
ddc:
- '000'
department:
- _id: KrPi
doi: 10.4230/LIPIcs.ITC.2025.4
external_id:
  cryptoeprintid:
  - 2025/723
file:
- access_level: open_access
  checksum: 3f791b03df26853342855a9d9581cb58
  content_type: application/pdf
  creator: dernst
  date_created: 2026-06-22T08:54:32Z
  date_updated: 2026-06-22T08:54:32Z
  file_id: '22118'
  file_name: 2025_LIPIcs_Pietrzak.pdf
  file_size: 772046
  relation: main_file
  success: 1
file_date_updated: 2026-06-22T08:54:32Z
has_accepted_license: '1'
intvolume: '       343'
keyword:
- Time-Space Lower Bounds
- Blockchains
language:
- iso: eng
month: '09'
oa: 1
oa_version: Published Version
publication: 6th Conference on Information-Theoretic Cryptography
publication_identifier:
  eissn:
  - 1868-8969
  isbn:
  - '9783959773850'
publication_status: published
publisher: Schloss Dagstuhl - Leibniz-Zentrum für Informatik
quality_controlled: '1'
scopus_import: '1'
status: public
title: Time-space tradeoffs of truncation with preprocessing
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 343
year: '2025'
...
---
OA_place: publisher
OA_type: diamond
_id: '22032'
abstract:
- lang: eng
  text: We prove that the focusing and defocusing continuum Calogero–Moser models
    are well-posed in the scaling-critical space L^2+(R). In the focusing case, this
    requires solutions to have mass less than that of the soliton.
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Thierry
  full_name: Laurens, Thierry
  last_name: Laurens
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
citation:
  ama: Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum
    Calogero–Moser models on the line. <i>Communications of the American Mathematical
    Society</i>. 2025;5(7):284-320. doi:<a href="https://doi.org/10.1090/cams/48">10.1090/cams/48</a>
  apa: Killip, R., Laurens, T., &#38; Vişan, M. (2025). Scaling-critical well-posedness
    for continuum Calogero–Moser models on the line. <i>Communications of the American
    Mathematical Society</i>. American Mathematical Society. <a href="https://doi.org/10.1090/cams/48">https://doi.org/10.1090/cams/48</a>
  chicago: Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness
    for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American
    Mathematical Society</i>. American Mathematical Society, 2025. <a href="https://doi.org/10.1090/cams/48">https://doi.org/10.1090/cams/48</a>.
  ieee: R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for
    continuum Calogero–Moser models on the line,” <i>Communications of the American
    Mathematical Society</i>, vol. 5, no. 7. American Mathematical Society, pp. 284–320,
    2025.
  ista: Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum
    Calogero–Moser models on the line. Communications of the American Mathematical
    Society. 5(7), 284–320.
  mla: Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser
    Models on the Line.” <i>Communications of the American Mathematical Society</i>,
    vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:<a href="https://doi.org/10.1090/cams/48">10.1090/cams/48</a>.
  short: R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical
    Society 5 (2025) 284–320.
das_tickbox: '1'
date_created: 2026-06-19T07:42:34Z
date_published: 2025-06-23T00:00:00Z
date_updated: 2026-06-22T11:21:09Z
day: '23'
ddc:
- '500'
doi: 10.1090/cams/48
extern: '1'
external_id:
  arxiv:
  - '2311.12334'
has_accepted_license: '1'
intvolume: '         5'
issue: '7'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2311.12334
month: '06'
oa: 1
oa_version: Published Version
page: 284-320
publication: Communications of the American Mathematical Society
publication_identifier:
  issn:
  - 2692-3688
publication_status: published
publisher: American Mathematical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: Scaling-critical well-posedness for continuum Calogero–Moser models on the
  line
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '22036'
abstract:
- lang: eng
  text: We prove dispersive decay, pointwise in time, for solutions to the mass-critical
    nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.
article_number: '21'
article_processing_charge: No
article_type: original
arxiv: 1
author:
- first_name: Chenjie
  full_name: Fan, Chenjie
  last_name: Fan
- first_name: Rowan
  full_name: Killip, Rowan
  last_name: Killip
- first_name: Monica
  full_name: Visan, Monica
  id: 056daca0-b8d1-11f0-964f-f91054abf8ca
  last_name: Visan
- first_name: Zehua
  full_name: Zhao, Zehua
  last_name: Zhao
citation:
  ama: Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear
    Schrödinger equation. <i>Mathematische Zeitschrift</i>. 2025;311. doi:<a href="https://doi.org/10.1007/s00209-025-03821-8">10.1007/s00209-025-03821-8</a>
  apa: Fan, C., Killip, R., Vişan, M., &#38; Zhao, Z. (2025). Dispersive decay for
    the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>.
    Springer Nature. <a href="https://doi.org/10.1007/s00209-025-03821-8">https://doi.org/10.1007/s00209-025-03821-8</a>
  chicago: Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay
    for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>.
    Springer Nature, 2025. <a href="https://doi.org/10.1007/s00209-025-03821-8">https://doi.org/10.1007/s00209-025-03821-8</a>.
  ieee: C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical
    nonlinear Schrödinger equation,” <i>Mathematische Zeitschrift</i>, vol. 311. Springer
    Nature, 2025.
  ista: Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical
    nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.
  mla: Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger
    Equation.” <i>Mathematische Zeitschrift</i>, vol. 311, 21, Springer Nature, 2025,
    doi:<a href="https://doi.org/10.1007/s00209-025-03821-8">10.1007/s00209-025-03821-8</a>.
  short: C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).
das_tickbox: '1'
date_created: 2026-06-19T07:44:05Z
date_published: 2025-07-24T00:00:00Z
date_updated: 2026-06-22T13:00:14Z
day: '24'
doi: 10.1007/s00209-025-03821-8
extern: '1'
external_id:
  arxiv:
  - '2403.09989'
intvolume: '       311'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.48550/arXiv.2403.09989
month: '07'
oa: 1
oa_version: Preprint
publication: Mathematische Zeitschrift
publication_identifier:
  eissn:
  - 1432-1823
  issn:
  - 0025-5874
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Dispersive decay for the mass-critical nonlinear Schrödinger equation
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 311
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '12311'
abstract:
- lang: eng
  text: In this note, we prove a formula for the cancellation exponent  kv,n between
    division polynomials  ψn  and  ϕn  associated with a sequence  {nP}n∈N of points
    on an elliptic curve  E  defined over a discrete valuation field  K. The formula
    greatly generalizes the previously known special cases and treats also the case
    of non-standard Kodaira types for non-perfect residue fields.
acknowledgement: Silverman, and Paul Voutier for the comments on the earlier version
  of this paper. The first author acknowledges the support by Dioscuri programme initiated
  by the Max Planck Society, jointly managed with the National Science Centre (Poland),
  and mutually funded by the Polish Ministry of Science and Higher Education and the
  German Federal Ministry of Education and Research. The second author has been supported
  by MIUR (Italy) through PRIN 2017 ‘Geometric, algebraic and analytic methods in
  arithmetic’ and has received funding from the European Union's Horizon 2020 research
  and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Bartosz
  full_name: Naskręcki, Bartosz
  last_name: Naskręcki
- first_name: Matteo
  full_name: Verzobio, Matteo
  id: 7aa8f170-131e-11ed-88e1-a9efd01027cb
  last_name: Verzobio
  orcid: 0000-0002-0854-0306
citation:
  ama: 'Naskręcki B, Verzobio M. Common valuations of division polynomials. <i>Proceedings
    of the Royal Society of Edinburgh Section A: Mathematics</i>. 2025;155(5):1646-1660.
    doi:<a href="https://doi.org/10.1017/prm.2024.7">10.1017/prm.2024.7</a>'
  apa: 'Naskręcki, B., &#38; Verzobio, M. (2025). Common valuations of division polynomials.
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>. Cambridge
    University Press. <a href="https://doi.org/10.1017/prm.2024.7">https://doi.org/10.1017/prm.2024.7</a>'
  chicago: 'Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division
    Polynomials.” <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>.
    Cambridge University Press, 2025. <a href="https://doi.org/10.1017/prm.2024.7">https://doi.org/10.1017/prm.2024.7</a>.'
  ieee: 'B. Naskręcki and M. Verzobio, “Common valuations of division polynomials,”
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol.
    155, no. 5. Cambridge University Press, pp. 1646–1660, 2025.'
  ista: 'Naskręcki B, Verzobio M. 2025. Common valuations of division polynomials.
    Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 155(5),
    1646–1660.'
  mla: 'Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.”
    <i>Proceedings of the Royal Society of Edinburgh Section A: Mathematics</i>, vol.
    155, no. 5, Cambridge University Press, 2025, pp. 1646–60, doi:<a href="https://doi.org/10.1017/prm.2024.7">10.1017/prm.2024.7</a>.'
  short: 'B. Naskręcki, M. Verzobio, Proceedings of the Royal Society of Edinburgh
    Section A: Mathematics 155 (2025) 1646–1660.'
corr_author: '1'
date_created: 2023-01-16T11:45:22Z
date_published: 2025-10-01T00:00:00Z
date_updated: 2025-12-30T06:46:17Z
day: '01'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.1017/prm.2024.7
ec_funded: 1
external_id:
  arxiv:
  - '2203.02015'
  isi:
  - '001174907100001'
file:
- access_level: open_access
  checksum: c5ec6e29aca2fb4533cb95fac409a0b2
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-30T06:45:47Z
  date_updated: 2025-12-30T06:45:47Z
  file_id: '20878'
  file_name: 2025_ProceedingsRoyalSocEdinburghA_Naskrecki.pdf
  file_size: 477624
  relation: main_file
  success: 1
file_date_updated: 2025-12-30T06:45:47Z
has_accepted_license: '1'
intvolume: '       155'
isi: 1
issue: '5'
keyword:
- Elliptic curves
- Néron models
- division polynomials
- height functions
- discrete valuation rings
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 1646-1660
project:
- _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c
  call_identifier: H2020
  grant_number: '101034413'
  name: 'IST-BRIDGE: International postdoctoral program'
publication: 'Proceedings of the Royal Society of Edinburgh Section A: Mathematics'
publication_identifier:
  eissn:
  - 1473-7124
  issn:
  - 0308-2105
publication_status: published
publisher: Cambridge University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Common valuations of division polynomials
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: 155
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '12662'
abstract:
- lang: eng
  text: 'Modern machine learning tasks often require considering not just one but
    multiple objectives. For example, besides the prediction quality, this could be
    the efficiency, robustness or fairness of the learned models, or any of their
    combinations. Multi-objective learning offers a natural framework for handling
    such problems without having to commit to early trade-offs. Surprisingly, statistical
    learning theory so far offers almost no insight into the generalization properties
    of multi-objective learning. In this work, we make first steps to fill this gap:
    We establish foundational generalization bounds for the multi-objective setting
    as well as generalization and excess bounds for learning with scalarizations.
    We also provide the first theoretical analysis of the relation between the Pareto-optimal
    sets of the true objectives and the Pareto-optimal sets of their empirical approximations
    from training data. In particular, we show a surprising asymmetry: All Pareto-optimal
    solutions can be approximated by empirically Pareto-optimal ones, but not vice
    versa.'
acknowledgement: Open access funding provided by Institute of Science and Technology
  (IST Austria).
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Peter
  full_name: Súkeník, Peter
  id: d64d6a8d-eb8e-11eb-b029-96fd216dec3c
  last_name: Súkeník
- first_name: Christoph
  full_name: Lampert, Christoph
  id: 40C20FD2-F248-11E8-B48F-1D18A9856A87
  last_name: Lampert
  orcid: 0000-0001-8622-7887
citation:
  ama: Súkeník P, Lampert C. Generalization in multi-objective machine learning. <i>Neural
    Computing and Applications</i>. 2025;37:24669–24683. doi:<a href="https://doi.org/10.1007/s00521-024-10616-1">10.1007/s00521-024-10616-1</a>
  apa: Súkeník, P., &#38; Lampert, C. (2025). Generalization in multi-objective machine
    learning. <i>Neural Computing and Applications</i>. Springer Nature. <a href="https://doi.org/10.1007/s00521-024-10616-1">https://doi.org/10.1007/s00521-024-10616-1</a>
  chicago: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective
    Machine Learning.” <i>Neural Computing and Applications</i>. Springer Nature,
    2025. <a href="https://doi.org/10.1007/s00521-024-10616-1">https://doi.org/10.1007/s00521-024-10616-1</a>.
  ieee: P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,”
    <i>Neural Computing and Applications</i>, vol. 37. Springer Nature, pp. 24669–24683,
    2025.
  ista: Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning.
    Neural Computing and Applications. 37, 24669–24683.
  mla: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine
    Learning.” <i>Neural Computing and Applications</i>, vol. 37, Springer Nature,
    2025, pp. 24669–24683, doi:<a href="https://doi.org/10.1007/s00521-024-10616-1">10.1007/s00521-024-10616-1</a>.
  short: P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.
corr_author: '1'
date_created: 2023-02-20T08:23:06Z
date_published: 2025-10-01T00:00:00Z
date_updated: 2025-12-30T06:39:56Z
day: '01'
ddc:
- '004'
department:
- _id: ChLa
doi: 10.1007/s00521-024-10616-1
external_id:
  arxiv:
  - '2208.13499'
file:
- access_level: open_access
  checksum: 61ad4591aee16b1e02daf6c164321a42
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-30T06:39:11Z
  date_updated: 2025-12-30T06:39:11Z
  file_id: '20877'
  file_name: 2025_NeuralCompApplic_Sukenik.pdf
  file_size: 500213
  relation: main_file
  success: 1
file_date_updated: 2025-12-30T06:39:11Z
has_accepted_license: '1'
intvolume: '        37'
language:
- iso: eng
month: '10'
oa: 1
oa_version: Published Version
page: 24669–24683
publication: Neural Computing and Applications
publication_identifier:
  eissn:
  - 1433-3058
  issn:
  - 0941-0643
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Generalization in multi-objective machine learning
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: 37
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20820'
abstract:
- lang: eng
  text: 'The high computational costs of large language models (LLMs) have led to
    a flurry of research on LLM compression, via methods such as quantization, sparsification,
    or structured pruning. A new frontier in this area is given by dynamic, non-uniform
    compression methods, which adjust the compression levels (e.g., sparsity) per-block
    or even per-layer in order to minimize accuracy loss, while guaranteeing a global
    compression threshold. Yet, current methods rely on estimating the "importance"
    of a given layer, implicitly assuming that layers contribute independently to
    the overall compression error. We begin from the motivating observation that this
    independence assumption does not generally hold for LLM compression: pruning a
    model further may even significantly recover performance. To address this, we
    propose EvoPress, a novel evolutionary framework for dynamic LLM compression.
    By formulating dynamic compression as a general optimization problem, EvoPress
    identifies optimal compression profiles in a highly efficient manner, and generalizes
    across diverse models and compression techniques. Via EvoPress, we achieve state-of-the-art
    performance for dynamic compression of Llama, Mistral, and Phi models, setting
    new benchmarks for structural pruning (block/layer dropping), unstructured sparsity,
    and quantization with dynamic bitwidths.'
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Oliver
  full_name: Sieberling, Oliver
  last_name: Sieberling
- first_name: Denis
  full_name: Kuznedelev, Denis
  last_name: Kuznedelev
- first_name: Eldar
  full_name: Kurtic, Eldar
  id: 47beb3a5-07b5-11eb-9b87-b108ec578218
  last_name: Kurtic
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
citation:
  ama: 'Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic
    model compression via evolutionary search. In: <i>42nd International Conference
    on Machine Learning</i>. Vol 267. ML Research Press; 2025:55556-55590.'
  apa: 'Sieberling, O., Kuznedelev, D., Kurtic, E., &#38; Alistarh, D.-A. (2025).
    EvoPress: Accurate dynamic model compression via evolutionary search. In <i>42nd
    International Conference on Machine Learning</i> (Vol. 267, pp. 55556–55590).
    Vancouver, Canada: ML Research Press.'
  chicago: 'Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh.
    “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In <i>42nd
    International Conference on Machine Learning</i>, 267:55556–90. ML Research Press,
    2025.'
  ieee: 'O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate
    dynamic model compression via evolutionary search,” in <i>42nd International Conference
    on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.'
  ista: 'Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. 2025. EvoPress: Accurate
    dynamic model compression via evolutionary search. 42nd International Conference
    on Machine Learning. ICML: International Conference on Machine Learning, PMLR,
    vol. 267, 55556–55590.'
  mla: 'Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via
    Evolutionary Search.” <i>42nd International Conference on Machine Learning</i>,
    vol. 267, ML Research Press, 2025, pp. 55556–90.'
  short: O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International
    Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.
conference:
  end_date: 2025-07-19
  location: Vancouver, Canada
  name: 'ICML: International Conference on Machine Learning'
  start_date: 2025-07-13
corr_author: '1'
date_created: 2025-12-14T23:02:05Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-12-16T12:34:32Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
  arxiv:
  - '2410.14649'
file:
- access_level: open_access
  checksum: 1d744fbaeb199b08e8b6f48bc0dd047e
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-16T12:32:40Z
  date_updated: 2025-12-16T12:32:40Z
  file_id: '20828'
  file_name: 2025_ICML_Sieberling.pdf
  file_size: 908379
  relation: main_file
  success: 1
file_date_updated: 2025-12-16T12:32:40Z
has_accepted_license: '1'
intvolume: '       267'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 55556-55590
publication: 42nd International Conference on Machine Learning
publication_identifier:
  eissn:
  - 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'EvoPress: Accurate dynamic model compression via evolutionary search'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 267
year: '2025'
...
---
OA_place: publisher
OA_type: gold
_id: '20821'
abstract:
- lang: eng
  text: Modern deep neural networks exhibit heterogeneity across numerous layers of
    various types such as residuals, multi-head attention, etc., due to varying structures
    (dimensions, activation functions, etc.), distinct representation characteristics,
    which impact predictions. We develop a general layer-wise quantization framework
    with tight variance and code-length bounds, adapting to the heterogeneities over
    the course of training. We then apply a new layer-wise quantization technique
    within distributed variational inequalities (VIs), proposing a novel Quantized
    Optimistic Dual Averaging (QODA) algorithm with adaptive learning rates, which
    achieves competitive convergence rates for monotone VIs. We empirically show that
    QODA achieves up to a 150% speedup over the baselines in end-to-end training time
    for training Wasserstein GAN on 12+GPUs.
acknowledgement: "This work was supported by Hasler Foundation Program: Hasler Responsible
  AI (project number 21043). The research was also sponsored by the Army Research
  Office and was accomplished under Grant Number W911NF-24-1-0048. This work was further
  funded by the Swiss National Science Foundation (SNSF) under grant number 200021_205011.
  We also acknowledge project A11 of the Swiss National Supercomputing Centre (CSCS)
  for providing computing resources. Dan Alistarh and Ilia Markov were supported in
  part through the ERC Proofof-Concept grant FastML (Grant Agreement 101158077). Ali
  Ramezani-Kebrya was supported by the Research Council of Norway through FRIPRO Grant
  under project number 356103, its Centres of Excellence scheme, Integreat - Norwegian
  Centre for knowledge-driven machine learning under\r\nproject number 332645 - and
  its Centre for Research-based Innovation funding scheme (Visual Intelligence under
  grant no. 309439)."
alternative_title:
- PMLR
article_processing_charge: No
arxiv: 1
author:
- first_name: Anh Duc
  full_name: Nguyen, Anh Duc
  last_name: Nguyen
- first_name: Ilia
  full_name: Markov, Ilia
  id: D0CF4148-C985-11E9-8066-0BDEE5697425
  last_name: Markov
- first_name: Frank Zhengqing
  full_name: Wu, Frank Zhengqing
  last_name: Wu
- first_name: Ali
  full_name: Ramezani-Kebrya, Ali
  last_name: Ramezani-Kebrya
- first_name: Kimon
  full_name: Antonakopoulos, Kimon
  last_name: Antonakopoulos
- first_name: Dan-Adrian
  full_name: Alistarh, Dan-Adrian
  id: 4A899BFC-F248-11E8-B48F-1D18A9856A87
  last_name: Alistarh
  orcid: 0000-0003-3650-940X
- first_name: Volkan
  full_name: Cevher, Volkan
  last_name: Cevher
citation:
  ama: 'Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic
    dual averaging. In: <i>42nd International Conference on Machine Learning</i>.
    Vol 267. ML Research Press; 2025:46026-46072.'
  apa: 'Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos,
    K., Alistarh, D.-A., &#38; Cevher, V. (2025). Layer-wise quantization for quantized
    optimistic dual averaging. In <i>42nd International Conference on Machine Learning</i>
    (Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.'
  chicago: Nguyen, Anh Duc, Ilia Markov, Frank Zhengqing Wu, Ali Ramezani-Kebrya,
    Kimon Antonakopoulos, Dan-Adrian Alistarh, and Volkan Cevher. “Layer-Wise Quantization
    for Quantized Optimistic Dual Averaging.” In <i>42nd International Conference
    on Machine Learning</i>, 267:46026–72. ML Research Press, 2025.
  ieee: A. D. Nguyen <i>et al.</i>, “Layer-wise quantization for quantized optimistic
    dual averaging,” in <i>42nd International Conference on Machine Learning</i>,
    Vancouver, Canada, 2025, vol. 267, pp. 46026–46072.
  ista: 'Nguyen AD, Markov I, Wu FZ, Ramezani-Kebrya A, Antonakopoulos K, Alistarh
    D-A, Cevher V. 2025. Layer-wise quantization for quantized optimistic dual averaging.
    42nd International Conference on Machine Learning. ICML: International Conference
    on Machine Learning, PMLR, vol. 267, 46026–46072.'
  mla: Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual
    Averaging.” <i>42nd International Conference on Machine Learning</i>, vol. 267,
    ML Research Press, 2025, pp. 46026–72.
  short: A.D. Nguyen, I. Markov, F.Z. Wu, A. Ramezani-Kebrya, K. Antonakopoulos, D.-A.
    Alistarh, V. Cevher, in:, 42nd International Conference on Machine Learning, ML
    Research Press, 2025, pp. 46026–46072.
conference:
  end_date: 2025-07-19
  location: Vancouver, Canada
  name: 'ICML: International Conference on Machine Learning'
  start_date: 2025-07-13
date_created: 2025-12-14T23:02:06Z
date_published: 2025-05-01T00:00:00Z
date_updated: 2025-12-16T12:46:54Z
day: '01'
ddc:
- '000'
department:
- _id: DaAl
external_id:
  arxiv:
  - '2505.14371'
file:
- access_level: open_access
  checksum: a7edf0e4304171a3e035842b3aab1704
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-16T12:45:41Z
  date_updated: 2025-12-16T12:45:41Z
  file_id: '20830'
  file_name: 2025_ICML_Nguyen.pdf
  file_size: 756213
  relation: main_file
  success: 1
file_date_updated: 2025-12-16T12:45:41Z
has_accepted_license: '1'
intvolume: '       267'
language:
- iso: eng
month: '05'
oa: 1
oa_version: Published Version
page: 46026-46072
project:
- _id: 8e35c14b-16d5-11f0-9cad-a3fc35339161
  grant_number: '101158077'
  name: 'FastML: Efficient and Cost-Effective Distributed Machine Learning'
publication: 42nd International Conference on Machine Learning
publication_identifier:
  eissn:
  - 2640-3498
publication_status: published
publisher: ML Research Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Layer-wise quantization for quantized optimistic dual averaging
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 267
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
_id: '20839'
abstract:
- lang: eng
  text: For every couple of Hausdorff functions ψ and φ verifying some mild assumptions,
    there exists a compact subset K of the Baire space such that the φ-Hausdorff measure
    and the ψ-packing measure on K are both finite and positive. Such examples are
    then embedded in any infinite dimensional Banach space to answer positively a
    question of Fan on the existence of metric spaces with arbitrary scales.
article_processing_charge: Yes
article_type: original
author:
- first_name: Mathieu
  full_name: Helfter, Mathieu
  id: 7d296fbe-e2c6-11ee-84d3-d5c2945f9a57
  last_name: Helfter
citation:
  ama: Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional
    Banach spaces. <i>Journal of Fractal Geometry</i>. 2025. doi:<a href="https://doi.org/10.4171/jfg/177">10.4171/jfg/177</a>
  apa: Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite
    dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. EMS Press. <a href="https://doi.org/10.4171/jfg/177">https://doi.org/10.4171/jfg/177</a>
  chicago: Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in
    Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>. EMS Press,
    2025. <a href="https://doi.org/10.4171/jfg/177">https://doi.org/10.4171/jfg/177</a>.
  ieee: M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite
    dimensional Banach spaces,” <i>Journal of Fractal Geometry</i>. EMS Press, 2025.
  ista: Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite
    dimensional Banach spaces. Journal of Fractal Geometry.
  mla: Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite
    Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>, EMS Press, 2025,
    doi:<a href="https://doi.org/10.4171/jfg/177">10.4171/jfg/177</a>.
  short: M. Helfter, Journal of Fractal Geometry (2025).
corr_author: '1'
date_created: 2025-12-19T10:15:37Z
date_published: 2025-11-07T00:00:00Z
date_updated: 2026-06-18T18:26:33Z
day: '07'
ddc:
- '500'
department:
- _id: VaKa
doi: 10.4171/jfg/177
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://doi.org/10.4171/jfg/177
month: '11'
oa: 1
oa_version: Published Version
publication: Journal of Fractal Geometry
publication_identifier:
  eissn:
  - 2308-1317
  issn:
  - 2308-1309
publication_status: epub_ahead
publisher: EMS Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach
  spaces
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2025'
...
---
_id: '20842'
abstract:
- lang: eng
  text: Probing the possibility of entanglement generation through gravity offers
    a path to tackle the question of whether gravitational fields possess a quantum
    mechanical nature. A potential realization necessitates systems with low-frequency
    dynamics at an optimal mass scale, for which the microgram-to-milligram range
    is a strong contender. Here, after refining a figure-of-merit for the problem,
    we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate
    laser cooling its motion from room temperature to 240~microkelvins, surpassing
    by over 20-fold the coldest motions attained for oscillators ranging from micrograms
    to kilograms. We quantify and contrast the utility of the current approach with
    other platforms. The achieved performance and large improvement potential highlight
    milligram-scale torsional pendulums as a powerful platform for precision measurements
    relevant to future studies at the quantum-gravity interface.
article_processing_charge: No
author:
- first_name: Sofya
  full_name: Agafonova, Sofya
  id: 09501ff6-dca7-11ea-a8ae-b3e0b9166e80
  last_name: Agafonova
  orcid: 0000-0003-0582-2946
citation:
  ama: 'Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments
    at the quantum-gravity interface.” 2025. doi:<a href="https://doi.org/10.15479/AT-ISTA-20842">10.15479/AT-ISTA-20842</a>'
  apa: 'Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum
    toward experiments at the quantum-gravity interface.” Institute of Science and
    Technology Austria. <a href="https://doi.org/10.15479/AT-ISTA-20842">https://doi.org/10.15479/AT-ISTA-20842</a>'
  chicago: 'Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum
    toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and
    Technology Austria, 2025. <a href="https://doi.org/10.15479/AT-ISTA-20842">https://doi.org/10.15479/AT-ISTA-20842</a>.'
  ieee: 'S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward
    experiments at the quantum-gravity interface.’” Institute of Science and Technology
    Austria, 2025.'
  ista: 'Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward
    experiments at the quantum-gravity interface’, Institute of Science and Technology
    Austria, <a href="https://doi.org/10.15479/AT-ISTA-20842">10.15479/AT-ISTA-20842</a>.'
  mla: 'Agafonova, Sofia. <i>Research Data for: “One-Milligram Torsional Pendulum
    toward Experiments at the Quantum-Gravity Interface.”</i> Institute of Science
    and Technology Austria, 2025, doi:<a href="https://doi.org/10.15479/AT-ISTA-20842">10.15479/AT-ISTA-20842</a>.'
  short: S. Agafonova, (2025).
contributor:
- first_name: Pere
  last_name: Rosello
- first_name: Manuel
  last_name: Mekonnen
- contributor_type: supervisor
  first_name: Onur
  id: 4C02D85E-F248-11E8-B48F-1D18A9856A87
  last_name: Hosten
  orcid: 0000-0002-2031-204X
corr_author: '1'
date_created: 2025-12-21T14:23:50Z
date_published: 2025-12-22T00:00:00Z
date_updated: 2026-06-10T08:36:07Z
day: '22'
department:
- _id: GradSch
- _id: OnHo
doi: 10.15479/AT-ISTA-20842
file:
- access_level: open_access
  checksum: 7af34e4226a00cdcb7f154272050e217
  content_type: application/x-zip-compressed
  creator: sagafono
  date_created: 2025-12-22T13:45:30Z
  date_updated: 2025-12-22T13:45:30Z
  file_id: '20854'
  file_name: AllData.zip
  file_size: 146656591
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 71806a2ef9fb26ad7b78e04c6754ee4e
  content_type: application/x-zip-compressed
  creator: sagafono
  date_created: 2025-12-22T13:45:33Z
  date_updated: 2025-12-22T13:45:33Z
  file_id: '20855'
  file_name: SourceData.zip
  file_size: 93470129
  relation: main_file
  success: 1
- access_level: open_access
  checksum: 08facd1b4a102f83e4d99d48a85b258d
  content_type: text/plain
  creator: sagafono
  date_created: 2025-12-22T13:51:09Z
  date_updated: 2025-12-22T13:51:09Z
  file_id: '20856'
  file_name: readme.txt
  file_size: 461
  relation: main_file
  success: 1
file_date_updated: 2025-12-22T13:51:09Z
has_accepted_license: '1'
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: bdb2a702-d553-11ed-ba76-f12e3e5a3bc6
  grant_number: '101087907'
  name: 'A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational
    quantum mechanics'
publisher: Institute of Science and Technology Austria
related_material:
  record:
  - id: '20840'
    relation: used_in_publication
    status: public
status: public
title: 'Research Data for: ''One-milligram torsional pendulum toward experiments at
  the quantum-gravity interface'''
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: research_data
user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20844'
abstract:
- lang: eng
  text: "We introduce and construct a new proof system called Non-interactive Arguments
    of Knowledge or Space (NArKoS), where a space-bounded prover can convince a verifier
    they know a secret, while having access to sufficient space allows one to forge
    indistinguishable proofs without the secret.\r\nAn application of NArKoS are space-deniable
    proofs, which are proofs of knowledge (say for authentication in access control)
    that are sound when executed by a lightweight device like a smart-card or an RFID
    chip that cannot have much storage, but are deniable (in the strong sense of online
    deniability) as the verifier, like a card reader, can efficiently forge such proofs.\r\nWe
    construct NArKoS in the random oracle model using an OR-proof combining a sigma
    protocol (for the proof of knowledge of the secret) with a new proof system called
    simulatable Proof of Transient Space (simPoTS). We give two different constructions
    of simPoTS, one based on labelling graphs with high pebbling complexity, a technique
    used in the construction of memory-hard functions and proofs of space, and a more
    practical construction based on the verifiable space-hard functions from TCC’24
    where a prover must compute a root of a sparse polynomial. In both cases, the
    main challenge is making the proofs efficiently simulatable."
acknowledgement: "Jesko Dujmovic: Funded by the European Union (ERC, LACONIC, 101041207).
  Views and opinions expressed are however those of the author(s) only and do not
  necessarily reflect those of the European Union or the European Research Council.
  Neither the European Union nor the granting authority can be held responsible for
  them.\r\nChristoph U. Günther and Krzysztof Pietrzak: This research was funded in
  whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access
  purposes, the author has applied a CC BY public copyright license to any author-accepted
  manuscript version arising from this submission."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Jesko
  full_name: Dujmovic, Jesko
  last_name: Dujmovic
- first_name: Christoph Ullrich
  full_name: Günther, Christoph Ullrich
  id: ec98511c-eb8e-11eb-b029-edd25d7271a1
  last_name: Günther
- first_name: Krzysztof Z
  full_name: Pietrzak, Krzysztof Z
  id: 3E04A7AA-F248-11E8-B48F-1D18A9856A87
  last_name: Pietrzak
  orcid: 0000-0002-9139-1654
citation:
  ama: 'Dujmovic J, Günther CU, Pietrzak KZ. Space-deniable proofs. In: <i>23rd International
    Conference on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:171-202.
    doi:<a href="https://doi.org/10.1007/978-3-032-12290-2_6">10.1007/978-3-032-12290-2_6</a>'
  apa: 'Dujmovic, J., Günther, C. U., &#38; Pietrzak, K. Z. (2025). Space-deniable
    proofs. In <i>23rd International Conference on Theory of Cryptography</i> (Vol.
    16271, pp. 171–202). Aarhus, Denmark: Springer Nature. <a href="https://doi.org/10.1007/978-3-032-12290-2_6">https://doi.org/10.1007/978-3-032-12290-2_6</a>'
  chicago: Dujmovic, Jesko, Christoph Ullrich Günther, and Krzysztof Z Pietrzak. “Space-Deniable
    Proofs.” In <i>23rd International Conference on Theory of Cryptography</i>, 16271:171–202.
    Springer Nature, 2025. <a href="https://doi.org/10.1007/978-3-032-12290-2_6">https://doi.org/10.1007/978-3-032-12290-2_6</a>.
  ieee: J. Dujmovic, C. U. Günther, and K. Z. Pietrzak, “Space-deniable proofs,” in
    <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark,
    2025, vol. 16271, pp. 171–202.
  ista: 'Dujmovic J, Günther CU, Pietrzak KZ. 2025. Space-deniable proofs. 23rd International
    Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol.
    16271, 171–202.'
  mla: Dujmovic, Jesko, et al. “Space-Deniable Proofs.” <i>23rd International Conference
    on Theory of Cryptography</i>, vol. 16271, Springer Nature, 2025, pp. 171–202,
    doi:<a href="https://doi.org/10.1007/978-3-032-12290-2_6">10.1007/978-3-032-12290-2_6</a>.
  short: J. Dujmovic, C.U. Günther, K.Z. Pietrzak, in:, 23rd International Conference
    on Theory of Cryptography, Springer Nature, 2025, pp. 171–202.
conference:
  end_date: 2025-12-05
  location: Aarhus, Denmark
  name: 'TCC: Theory of Cryptography'
  start_date: 2025-12-01
corr_author: '1'
date_created: 2025-12-21T23:01:33Z
date_published: 2025-12-05T00:00:00Z
date_updated: 2025-12-29T11:44:16Z
day: '05'
department:
- _id: KrPi
doi: 10.1007/978-3-032-12290-2_6
intvolume: '     16271'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2025/1723
month: '12'
oa: 1
oa_version: Preprint
page: 171-202
project:
- _id: 34a34d57-11ca-11ed-8bc3-a2688a8724e1
  grant_number: F8509
  name: Security and Privacy by Design for Complex Systems
publication: 23rd International Conference on Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783032122896'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Space-deniable proofs
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16271
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20845'
abstract:
- lang: eng
  text: "We develop new attacks against the Evasive LWE family of assumptions, in
    both the public and private-coin regime. To the best of our knowledge, ours are
    the first attacks against Evasive LWE in the public-coin regime, for any instantiation
    from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The
    recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption
    (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption.
    This assumption has been popularly considered as a safe, public-coin instance
    of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10,
    11]).\r\nWe provide the first attack against this assumption, challenging the
    widely held belief that this is a public-coin assumption.\r\n2. We demonstrate
    a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural
    parameter regime. Our attack crucially relies on the error in the pre-condition
    being larger than the error in the post-condition, necessitating a refinement
    of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal,
    Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom
    functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities
    (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against
    the assumption stated in the first posting of their work (subsequently refined
    to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently
    to [4]) provides a construction of obfuscation for pseudorandom functionalities
    by relying on private-coin evasive LWE. We provide a new attack against their
    stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived,
    “self-referential” classes of pseudorandom functionalities for which pseudorandom
    obfuscation cannot exist. We extend their techniques to develop an analogous result
    for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed
    to specifically avoid “zeroizing attacks”, our work shows that in certain settings,
    such attacks can still apply."
acknowledgement: "We thank Rachel Lin for expressing concern about the applicability
  of “HJL-style” attacks [15] on the construction in [2] during a talk by the first
  author about [2]. This was the starting point of the investigation that led us to
  develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for
  sharing his rationale for introducing evasive LWE.\r\nThe first author is supported
  by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship.
  The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras
  during which the collaboration was initiated. The 4th author is partly supported
  by JST CREST Grant Number JPMJCR22M1."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Shweta
  full_name: Agrawal, Shweta
  last_name: Agrawal
- first_name: Anuja
  full_name: Modi, Anuja
  last_name: Modi
- first_name: Anshu
  full_name: Yadav, Anshu
  id: dc8f1524-403e-11ee-bf07-9649ad996e21
  last_name: Yadav
- first_name: Shota
  full_name: Yamada, Shota
  last_name: Yamada
citation:
  ama: 'Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular
    evasive LWE. In: <i>23rd International Conference on Theory of Cryptography</i>.
    Vol 16269. Springer Nature; 2025:259-290. doi:<a href="https://doi.org/10.1007/978-3-032-12293-3_9">10.1007/978-3-032-12293-3_9</a>'
  apa: 'Agrawal, S., Modi, A., Yadav, A., &#38; Yamada, S. (2025). Zeroizing attacks
    against evasive and circular evasive LWE. In <i>23rd International Conference
    on Theory of Cryptography</i> (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer
    Nature. <a href="https://doi.org/10.1007/978-3-032-12293-3_9">https://doi.org/10.1007/978-3-032-12293-3_9</a>'
  chicago: Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing
    Attacks against Evasive and Circular Evasive LWE.” In <i>23rd International Conference
    on Theory of Cryptography</i>, 16269:259–90. Springer Nature, 2025. <a href="https://doi.org/10.1007/978-3-032-12293-3_9">https://doi.org/10.1007/978-3-032-12293-3_9</a>.
  ieee: S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive
    and circular evasive LWE,” in <i>23rd International Conference on Theory of Cryptography</i>,
    Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.
  ista: 'Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive
    and circular evasive LWE. 23rd International Conference on Theory of Cryptography.
    TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290.'
  mla: Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive
    LWE.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16269,
    Springer Nature, 2025, pp. 259–90, doi:<a href="https://doi.org/10.1007/978-3-032-12293-3_9">10.1007/978-3-032-12293-3_9</a>.
  short: S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference
    on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.
conference:
  end_date: 2025-12-05
  location: Aarhus, Denmark
  name: 'TCC: Theory of Cryptography'
  start_date: 2025-12-01
date_created: 2025-12-21T23:01:33Z
date_published: 2025-12-05T00:00:00Z
date_updated: 2025-12-29T11:51:13Z
day: '05'
department:
- _id: KrPi
doi: 10.1007/978-3-032-12293-3_9
intvolume: '     16269'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2025/375
month: '12'
oa: 1
oa_version: Preprint
page: 259-290
publication: 23rd International Conference on Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783032122926'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Zeroizing attacks against evasive and circular evasive LWE
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16269
year: '2025'
...
---
OA_place: repository
OA_type: green
_id: '20846'
abstract:
- lang: eng
  text: "CVRFs are PRFs that unify the properties of verifiable and constrained PRFs.
    Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy
    in 2014, it has been an open problem to construct CVRFs without using heavy machinery
    such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this
    problem by constructing a prefix-constrained verifiable PRF that does not rely
    on the aforementioned assumptions. Essentially, our construction is a verifiable
    version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage
    degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate
    values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group
    elements. These outputs can be verified using pairings since the underlying PRG
    is of degree 2.\r\nWe prove the selective security of our construction under the
    Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which
    we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness
    of recursive DDH in the generic group model assuming the hardness of the Multivariate
    Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast,
    in terms of applications, we observe that our CVRF is also an exponent (C)VRF
    in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25)
    with various applications to threshold cryptography in mind. In addition to that,
    we give further applications for prefix-CVRFs in the blockchain setting, namely,
    stake-pooling and compressible randomness beacons."
acknowledgement: "We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions
  on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes
  of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook
  Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the
  Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has
  applied a CC BY public copyright license to any author-accepted manuscript version
  arising from this submission."
alternative_title:
- LNCS
article_processing_charge: No
author:
- first_name: Nicholas
  full_name: Brandt, Nicholas
  last_name: Brandt
- first_name: Miguel
  full_name: Cueto Noval, Miguel
  id: ffc563a3-f6e0-11ea-865d-e3cce03d17cc
  last_name: Cueto Noval
  orcid: 0000-0002-2505-4246
- first_name: Christoph Ullrich
  full_name: Günther, Christoph Ullrich
  id: ec98511c-eb8e-11eb-b029-edd25d7271a1
  last_name: Günther
- first_name: Akin
  full_name: Ünal, Akin
  id: f6b56fb6-dc63-11ee-9dbf-f6780863a85a
  last_name: Ünal
  orcid: 0000-0002-8929-0221
- first_name: Stella
  full_name: Wohnig, Stella
  last_name: Wohnig
citation:
  ama: 'Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable
    random functions without obfuscation and friends. In: <i>23rd International Conference
    on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:478-511. doi:<a
    href="https://doi.org/10.1007/978-3-032-12290-2_16">10.1007/978-3-032-12290-2_16</a>'
  apa: 'Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., &#38; Wohnig, S. (2025).
    Constrained verifiable random functions without obfuscation and friends. In <i>23rd
    International Conference on Theory of Cryptography</i> (Vol. 16271, pp. 478–511).
    Aarhus, Denmark: Springer Nature. <a href="https://doi.org/10.1007/978-3-032-12290-2_16">https://doi.org/10.1007/978-3-032-12290-2_16</a>'
  chicago: Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal,
    and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation
    and Friends.” In <i>23rd International Conference on Theory of Cryptography</i>,
    16271:478–511. Springer Nature, 2025. <a href="https://doi.org/10.1007/978-3-032-12290-2_16">https://doi.org/10.1007/978-3-032-12290-2_16</a>.
  ieee: N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained
    verifiable random functions without obfuscation and friends,” in <i>23rd International
    Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16271, pp.
    478–511.
  ista: 'Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained
    verifiable random functions without obfuscation and friends. 23rd International
    Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol.
    16271, 478–511.'
  mla: Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation
    and Friends.” <i>23rd International Conference on Theory of Cryptography</i>,
    vol. 16271, Springer Nature, 2025, pp. 478–511, doi:<a href="https://doi.org/10.1007/978-3-032-12290-2_16">10.1007/978-3-032-12290-2_16</a>.
  short: N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International
    Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511.
conference:
  end_date: 2025-12-05
  location: Aarhus, Denmark
  name: 'TCC: Theory of Cryptography'
  start_date: 2025-12-01
corr_author: '1'
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-05T00:00:00Z
date_updated: 2025-12-29T11:11:29Z
day: '05'
department:
- _id: KrPi
doi: 10.1007/978-3-032-12290-2_16
intvolume: '     16271'
language:
- iso: eng
main_file_link:
- open_access: '1'
  url: https://eprint.iacr.org/2025/1045
month: '12'
oa: 1
oa_version: Preprint
page: 478-511
project:
- _id: 34a34d57-11ca-11ed-8bc3-a2688a8724e1
  grant_number: F8509
  name: Security and Privacy by Design for Complex Systems
publication: 23rd International Conference on Theory of Cryptography
publication_identifier:
  eissn:
  - 1611-3349
  isbn:
  - '9783032122896'
  issn:
  - 0302-9743
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Constrained verifiable random functions without obfuscation and friends
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 16271
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
PlanS_conform: '1'
_id: '20847'
abstract:
- lang: eng
  text: "We report on an experimental active matter system with motion restricted
    to four cardinal directions. Our particles are magnetite-doped colloidal spheres
    driven by the Quincke electrorotational instability. The absence of a magnetic
    field (|\U0001D469|=0) leads to circular trajectories interspersed with short
    spontaneous runs. Intermediate fields (|\U0001D469|≲20mT) linearize the motion
    along the axis perpendicular to \U0001D469. At high magnetic fields, we observe
    the surprising emergence of a second, distinct linearization along the axis parallel
    to \U0001D469. With numerical simulations, we show that this behavior can be explained
    by anisotropic magnetic susceptibility."
acknowledged_ssus:
- _id: M-Shop
- _id: NanoFab
- _id: ScienComp
- _id: LifeSc
acknowledgement: "This research was funded in whole or in part by the Austrian Science
  Fund (FWF) [Grant DOI: 10.55776/ESP298]. This project has received funding from
  the European Research Council (ERC) under the European Union’s Horizon 2020 research
  and innovation programme (Grant\r\nAgreement No. 949120). This research was supported
  by the Scientific Service Units of The Institute of Science and Technology Austria
  (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility,
  Scientific Computing Facility, and Lab Support Facility. We wish to acknowledge
  the crucial contributions of Alexandre Morin in getting the project off the ground,
  and Jack Merrin for creating the SU-8 deposition protocol used in the construction
  of our\r\ncells. We also wish to thank Kimberley Modic and Hamza Nasir for their
  work on single-particle characterization. "
article_number: '065418'
article_processing_charge: Yes (via OA deal)
article_type: original
arxiv: 1
author:
- first_name: Eavan
  full_name: Fitzgerald, Eavan
  id: 2df8ab8f-080d-11ed-979a-bfe651ca3afa
  last_name: Fitzgerald
- first_name: Cécile
  full_name: Clavaud, Cécile
  id: 5f654c5d-04a1-11eb-ab36-ba9ffec58bd8
  last_name: Clavaud
  orcid: 0000-0002-1843-3803
- first_name: Debasish
  full_name: Das, Debasish
  last_name: Das
- first_name: Isaac C
  full_name: Lenton, Isaac C
  id: a550210f-223c-11ec-8182-e2d45e817efb
  last_name: Lenton
  orcid: 0000-0002-5010-6984
- first_name: Scott R
  full_name: Waitukaitis, Scott R
  id: 3A1FFC16-F248-11E8-B48F-1D18A9856A87
  last_name: Waitukaitis
  orcid: 0000-0002-2299-3176
citation:
  ama: 'Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right
    angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical
    Review E</i>. 2025;112(6). doi:<a href="https://doi.org/10.1103/1ss8-31rb">10.1103/1ss8-31rb</a>'
  apa: 'Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., &#38; Waitukaitis, S.
    R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic
    active matter. <i>Physical Review E</i>. American Physical Society. <a href="https://doi.org/10.1103/1ss8-31rb">https://doi.org/10.1103/1ss8-31rb</a>'
  chicago: 'Fitzgerald, Eavan, Cécile Clavaud, Debasish Das, Isaac C Lenton, and Scott
    R Waitukaitis. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic
    Active Matter.” <i>Physical Review E</i>. American Physical Society, 2025. <a
    href="https://doi.org/10.1103/1ss8-31rb">https://doi.org/10.1103/1ss8-31rb</a>.'
  ieee: 'E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling
    at right angles: Magnetic anisotropy enables dual-anisotropic active matter,”
    <i>Physical Review E</i>, vol. 112, no. 6. American Physical Society, 2025.'
  ista: 'Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. 2025. Rolling
    at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical
    Review E. 112(6), 065418.'
  mla: 'Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables
    Dual-Anisotropic Active Matter.” <i>Physical Review E</i>, vol. 112, no. 6, 065418,
    American Physical Society, 2025, doi:<a href="https://doi.org/10.1103/1ss8-31rb">10.1103/1ss8-31rb</a>.'
  short: E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical
    Review E 112 (2025).
corr_author: '1'
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-01T00:00:00Z
date_updated: 2025-12-29T11:19:34Z
day: '01'
ddc:
- '530'
department:
- _id: ScWa
doi: 10.1103/1ss8-31rb
ec_funded: 1
external_id:
  arxiv:
  - '2508.05643'
file:
- access_level: open_access
  checksum: d593e933f976c3f3cde37ad66539d57d
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-29T11:15:42Z
  date_updated: 2025-12-29T11:15:42Z
  file_id: '20862'
  file_name: 2025_PhysReviewE_Fitzgerald.pdf
  file_size: 2131491
  relation: main_file
  success: 1
file_date_updated: 2025-12-29T11:15:42Z
has_accepted_license: '1'
intvolume: '       112'
issue: '6'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
project:
- _id: bd8eede5-d553-11ed-ba76-eaded0d13485
  grant_number: E 298
  name: 'MixQUIckR: Mixing with QUIncke Rollers'
- _id: 0aa60e99-070f-11eb-9043-a6de6bdc3afa
  call_identifier: H2020
  grant_number: '949120'
  name: 'Tribocharge: a multi-scale approach to an enduring problem in physics'
publication: Physical Review E
publication_identifier:
  eissn:
  - 2470-0053
  issn:
  - 2470-0045
publication_status: published
publisher: American Physical Society
quality_controlled: '1'
scopus_import: '1'
status: public
title: 'Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active
  matter'
tmp:
  image: /images/cc_by.png
  legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
  name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
  short: CC BY (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 112
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20848'
abstract:
- lang: eng
  text: 'Genetic variation that influences complex disease susceptibility is introduced
    into the population by mutation and removed by natural selection and genetic drift.
    This mutation–selection–drift balance (MSDB) shapes the prevalence of a disease
    and its genetic architecture. To date, however, MSDB has been modeled only for
    monogenic (Mendelian) diseases. Here, we develop an MSDB model for complex disease
    susceptibility: we assume that genotype relates to disease risk according to the
    canonical liability threshold model and that the selection on variants affecting
    risk stems from the fitness cost of the disease. We focus on diseases that are
    highly polygenic, entail a substantial fitness cost, and are neither extremely
    common in the population nor exceedingly rare. The comparison of model predictions
    with genome-wide association studies and other observations in humans indicates
    that common genetic variation affecting complex disease susceptibility is little
    affected by directional selection and instead shaped by pleiotropic stabilizing
    selection on other traits. In turn, directional selection may exert a more substantial
    effect on rare, large-effect variants. Our results also suggest that current estimates
    of disease heritability are likely biased. The model thus provides a better understanding
    of the evolutionary processes that shape the architecture and prevalence of complex
    diseases.'
acknowledgement: We thank Nick Barton, Magnus Nordborg, John Novembre, Molly Przeworski,
  and Himani Sachdeva for many helpful discussions and for comments on the manuscript,
  and we thank Joshua Schraiber and 2 anonymous reviewers for comments on the manuscript.
  We also thank members of the Sella, Przeworski and Andolfatto labs at Columbia University,
  and the Berg, Novembre and Steinrücken labs at the University of Chicago, for feedback
  on the work at various stages. This work was completed in part with resources provided
  by the University of Chicago's Research Computing Center. This work was supported
  by National Institutes of Health F32 grant GM126787 and R35 grant GM151257 to J.J.B.
  and National Institutes of Health R01 grant GM115889 to G.S.
article_number: iyaf220
article_processing_charge: Yes (in subscription journal)
article_type: original
author:
- first_name: Jeremy J.
  full_name: Berg, Jeremy J.
  last_name: Berg
- first_name: Xinyi
  full_name: Li, Xinyi
  last_name: Li
- first_name: Kellen
  full_name: Riall, Kellen
  last_name: Riall
- first_name: Laura
  full_name: Hayward, Laura
  id: fc885ee5-24bf-11eb-ad7b-bcc5104c0c1b
  last_name: Hayward
- first_name: Guy
  full_name: Sella, Guy
  last_name: Sella
citation:
  ama: Berg JJ, Li X, Riall K, Hayward L, Sella G. Mutation–selection–drift balance
    models of complex diseases. <i>Genetics</i>. 2025;231(4). doi:<a href="https://doi.org/10.1093/genetics/iyaf220">10.1093/genetics/iyaf220</a>
  apa: Berg, J. J., Li, X., Riall, K., Hayward, L., &#38; Sella, G. (2025). Mutation–selection–drift
    balance models of complex diseases. <i>Genetics</i>. Oxford University Press.
    <a href="https://doi.org/10.1093/genetics/iyaf220">https://doi.org/10.1093/genetics/iyaf220</a>
  chicago: Berg, Jeremy J., Xinyi Li, Kellen Riall, Laura Hayward, and Guy Sella.
    “Mutation–Selection–Drift Balance Models of Complex Diseases.” <i>Genetics</i>.
    Oxford University Press, 2025. <a href="https://doi.org/10.1093/genetics/iyaf220">https://doi.org/10.1093/genetics/iyaf220</a>.
  ieee: J. J. Berg, X. Li, K. Riall, L. Hayward, and G. Sella, “Mutation–selection–drift
    balance models of complex diseases,” <i>Genetics</i>, vol. 231, no. 4. Oxford
    University Press, 2025.
  ista: Berg JJ, Li X, Riall K, Hayward L, Sella G. 2025. Mutation–selection–drift
    balance models of complex diseases. Genetics. 231(4), iyaf220.
  mla: Berg, Jeremy J., et al. “Mutation–Selection–Drift Balance Models of Complex
    Diseases.” <i>Genetics</i>, vol. 231, no. 4, iyaf220, Oxford University Press,
    2025, doi:<a href="https://doi.org/10.1093/genetics/iyaf220">10.1093/genetics/iyaf220</a>.
  short: J.J. Berg, X. Li, K. Riall, L. Hayward, G. Sella, Genetics 231 (2025).
date_created: 2025-12-21T23:01:34Z
date_published: 2025-12-01T00:00:00Z
date_updated: 2025-12-29T11:29:16Z
day: '01'
ddc:
- '570'
department:
- _id: NiBa
doi: 10.1093/genetics/iyaf220
external_id:
  pmid:
  - '41073879'
file:
- access_level: open_access
  checksum: b02eb6b78028b8bef435edc8435a8468
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-29T11:27:51Z
  date_updated: 2025-12-29T11:27:51Z
  file_id: '20863'
  file_name: 2025_Genetics_Berg.pdf
  file_size: 1182339
  relation: main_file
  success: 1
file_date_updated: 2025-12-29T11:27:51Z
has_accepted_license: '1'
intvolume: '       231'
issue: '4'
language:
- iso: eng
month: '12'
oa: 1
oa_version: Published Version
pmid: 1
publication: Genetics
publication_identifier:
  eissn:
  - 1943-2631
  issn:
  - 0016-6731
publication_status: published
publisher: Oxford University Press
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mutation–selection–drift balance models of complex diseases
tmp:
  image: /images/cc_by_nc_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode
  name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International
    (CC BY-NC-ND 4.0)
  short: CC BY-NC-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 231
year: '2025'
...
---
OA_place: publisher
OA_type: hybrid
_id: '20850'
abstract:
- lang: eng
  text: We provide an estimate for the number of nontrivial integer points on the
    Pellian surface t^2 - du^2 = 1 in a bounded region. We give a lower bound on the
    size of fundamental solutions for almost all d in a certain class, based on a
    recent conjecture of Browning and Wilsch about integer points on log K3 surfaces.
    We also obtain an upper bound on the average of class number in this class, assuming
    the same conjecture.
- lang: fre
  text: "Nous donnons une estimation du nombre de points entiers non triviaux sur
    la surface pellienne \r\nt^2 - du^2 = 1 dans une région bornée. Nous établissons
    une borne inférieure pour la taille des solutions fondamentales pour presque tout
    d appartenant à une certaine classe, en nous fondant sur une conjecture récente
    de Browning et Wilsch concernant les points entiers sur les surfaces log K3. Nous
    obtenons également une borne supérieure pour la moyenne du nombre de classes dans
    cette classe, sous la même hypothèse conjecturale."
acknowledgement: The author would like to thank his supervisor Tim Browning for suggesting
  this project and many helpful conversations and useful comments. Moreover, he is
  grateful to Jakob Glas, Damaris Schindler, Igor Shparlinski, Matteo Verzobio, Victor
  Wang, Florian Wilsch and Shuntaro Yamagishi for taking their time to answer his
  questions and their valuable suggestions.
article_processing_charge: Yes (in subscription journal)
article_type: original
arxiv: 1
author:
- first_name: Yijie
  full_name: Diao, Yijie
  id: 7b7eb4ca-eb2c-11ec-b98b-accec0b20c3b
  last_name: Diao
  orcid: 0000-0002-4989-5330
citation:
  ama: Diao Y. Class numbers and integer points on some Pellian surfaces. <i>Journal
    de theorie des nombres de Bordeaux</i>. 2025;37(3):973-988. doi:<a href="https://doi.org/10.5802/jtnb.1348">10.5802/jtnb.1348</a>
  apa: Diao, Y. (2025). Class numbers and integer points on some Pellian surfaces.
    <i>Journal de Theorie Des Nombres de Bordeaux</i>. Université de Bordeaux. <a
    href="https://doi.org/10.5802/jtnb.1348">https://doi.org/10.5802/jtnb.1348</a>
  chicago: Diao, Yijie. “Class Numbers and Integer Points on Some Pellian Surfaces.”
    <i>Journal de Theorie Des Nombres de Bordeaux</i>. Université de Bordeaux, 2025.
    <a href="https://doi.org/10.5802/jtnb.1348">https://doi.org/10.5802/jtnb.1348</a>.
  ieee: Y. Diao, “Class numbers and integer points on some Pellian surfaces,” <i>Journal
    de theorie des nombres de Bordeaux</i>, vol. 37, no. 3. Université de Bordeaux,
    pp. 973–988, 2025.
  ista: Diao Y. 2025. Class numbers and integer points on some Pellian surfaces. Journal
    de theorie des nombres de Bordeaux. 37(3), 973–988.
  mla: Diao, Yijie. “Class Numbers and Integer Points on Some Pellian Surfaces.” <i>Journal
    de Theorie Des Nombres de Bordeaux</i>, vol. 37, no. 3, Université de Bordeaux,
    2025, pp. 973–88, doi:<a href="https://doi.org/10.5802/jtnb.1348">10.5802/jtnb.1348</a>.
  short: Y. Diao, Journal de Theorie Des Nombres de Bordeaux 37 (2025) 973–988.
corr_author: '1'
date_created: 2025-12-21T23:01:35Z
date_published: 2025-11-27T00:00:00Z
date_updated: 2025-12-29T10:08:46Z
day: '27'
ddc:
- '510'
department:
- _id: TiBr
doi: 10.5802/jtnb.1348
external_id:
  arxiv:
  - '2408.03774'
file:
- access_level: open_access
  checksum: 67aa0afbc0b5bcbff5341f4d25e6ba20
  content_type: application/pdf
  creator: dernst
  date_created: 2025-12-29T10:05:22Z
  date_updated: 2025-12-29T10:05:22Z
  file_id: '20861'
  file_name: 2025_JTNB_Diao.pdf
  file_size: 766196
  relation: main_file
  success: 1
file_date_updated: 2025-12-29T10:05:22Z
has_accepted_license: '1'
intvolume: '        37'
issue: '3'
language:
- iso: eng
license: https://creativecommons.org/licenses/by-nd/4.0/
month: '11'
oa: 1
oa_version: Published Version
page: 973-988
publication: Journal de theorie des nombres de Bordeaux
publication_identifier:
  eissn:
  - 2118-8572
  issn:
  - 1246-7405
publication_status: published
publisher: Université de Bordeaux
quality_controlled: '1'
scopus_import: '1'
status: public
title: Class numbers and integer points on some Pellian surfaces
tmp:
  image: /image/cc_by_nd.png
  legal_code_url: https://creativecommons.org/licenses/by-nd/4.0/legalcode
  name: Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)
  short: CC BY-ND (4.0)
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 37
year: '2025'
...
---
DOAJ_listed: '1'
OA_place: publisher
OA_type: gold
PlanS_conform: '1'
_id: '20851'
abstract:
- lang: eng
  text: High-voltage disordered spinel LiNi0.5Mn1.5O4 is a promising cathode material
    for high power density in lithium-ion batteries. However, it suffers from poor
    cycle life associated with the rock-salt phase transformation. This study presents
    a straightforward synthesis approach to enhance the electrochemical performance
    of LiNi0.5Mn1.5O4 through a synergistic solid-state modification with LiF and
    AlF3. This dual modification promotes rapid Li⁺ diffusion, enables near-complete
    delithiation/lithiation, approaching the theoretical capacity of disordered LiNi0.5Mn1.5O4,
    and, more importantly, effectively mitigates the formation of the rock-salt phase,
    thereby enhancing structural stability, as confirmed by operando X-ray absorption
    spectroscopy (XAS) and synchrotron X-ray diffraction (SXRD). As a result, the
    optimized LiNi0.5Mn1.5O4 (10 mg AlF3 + 30 mg LiF) delivers high reversible capacities
    of 142.1, 139.1, 129.2, 121.6, 110.3, 93.5, and 76.1 mAh∙g−1 at 0.2C, 0.5C, 1.0C,
    2.0C, 3.0C, 4.0C, and 5.0C, respectively. Full cells using graphite as the anode
    and a high-loading cathode exhibit excellent cycling performance. They retain
    80% of their capacity after 200 cycles at 0.5C within a voltage window of 3.5–4.9
    V with cathode loading of 11 mg∙cm−2. The findings of this study will significantly
    advance high-power LiNi0.5Mn1.5O4 materials, offering improved battery life and
    thereby enhancing their potential for practical applications.
acknowledged_ssus:
- _id: EM-Fac
- _id: NanoFab
acknowledgement: 'This work was supported by the European Commission-financed project
  IntelLigent (HORIZON-CL5-2021-D2-01-02) with project ID number 101069765. In collaboration
  with ALBA staff, the operando SXRD and XAS experiments were performed at BL-16-NOTOS
  beamline at ALBA Synchrotron Light Source (experiment number: 2023097765). This
  research was supported by the Scientific Service Units (SSU) of the Institute of
  Science and Technology Austria (ISTA) through resources provided by the Electron
  Microscopy Facility (EMF) and the Nanofabrication Facility (NFF), and M.I. and S.H.
  acknowledge financial support from ISTA and the Werner Siemens Foundation. Jordi
  Jacas Biendicho acknowledges the fellowship RYC2021-034994-I, funded by MICIU/AEI/10.13039/501100011033
  and the European Union «NextGenerationEU»/PRTR». Jordi Llorca is a Serra Húnter
  Fellow and is grateful to projects MICIN/AEI/FEDER PID2021-124572OB-C31 and Maria
  de Maeztu Units of Excellence Programme CEX2023-001300-M, and GC 2021 SGR 01061.'
article_number: e15962
article_processing_charge: Yes
article_type: original
author:
- first_name: Xingqi
  full_name: Chang, Xingqi
  last_name: Chang
- first_name: Carlos
  full_name: Escudero, Carlos
  last_name: Escudero
- first_name: Ashley P.
  full_name: Black, Ashley P.
  last_name: Black
- first_name: Sharona
  full_name: Horta, Sharona
  id: 03a7e858-01b1-11ec-8b71-99ae6c4a05bc
  last_name: Horta
- first_name: Elías
  full_name: Martínez, Elías
  last_name: Martínez
- first_name: Xuan
  full_name: Lu, Xuan
  last_name: Lu
- first_name: Jordi
  full_name: Llorca, Jordi
  last_name: Llorca
- first_name: Maria
  full_name: Ibáñez, Maria
  id: 43C61214-F248-11E8-B48F-1D18A9856A87
  last_name: Ibáñez
  orcid: 0000-0001-5013-2843
- first_name: Jordi Jacas
  full_name: Biendicho, Jordi Jacas
  last_name: Biendicho
- first_name: Andreu
  full_name: Cabot, Andreu
  last_name: Cabot
citation:
  ama: Chang X, Escudero C, Black AP, et al. Mitigating the rock-salt phase transformation
    in disordered LNMO through synergetic solid-state AlF3/LiF modifications. <i>Advanced
    Science</i>. 2025. doi:<a href="https://doi.org/10.1002/advs.202515962">10.1002/advs.202515962</a>
  apa: Chang, X., Escudero, C., Black, A. P., Horta, S., Martínez, E., Lu, X., … Cabot,
    A. (2025). Mitigating the rock-salt phase transformation in disordered LNMO through
    synergetic solid-state AlF3/LiF modifications. <i>Advanced Science</i>. Wiley.
    <a href="https://doi.org/10.1002/advs.202515962">https://doi.org/10.1002/advs.202515962</a>
  chicago: Chang, Xingqi, Carlos Escudero, Ashley P. Black, Sharona Horta, Elías Martínez,
    Xuan Lu, Jordi Llorca, Maria Ibáñez, Jordi Jacas Biendicho, and Andreu Cabot.
    “Mitigating the Rock-Salt Phase Transformation in Disordered LNMO through Synergetic
    Solid-State AlF3/LiF Modifications.” <i>Advanced Science</i>. Wiley, 2025. <a
    href="https://doi.org/10.1002/advs.202515962">https://doi.org/10.1002/advs.202515962</a>.
  ieee: X. Chang <i>et al.</i>, “Mitigating the rock-salt phase transformation in
    disordered LNMO through synergetic solid-state AlF3/LiF modifications,” <i>Advanced
    Science</i>. Wiley, 2025.
  ista: Chang X, Escudero C, Black AP, Horta S, Martínez E, Lu X, Llorca J, Ibáñez
    M, Biendicho JJ, Cabot A. 2025. Mitigating the rock-salt phase transformation
    in disordered LNMO through synergetic solid-state AlF3/LiF modifications. Advanced
    Science., e15962.
  mla: Chang, Xingqi, et al. “Mitigating the Rock-Salt Phase Transformation in Disordered
    LNMO through Synergetic Solid-State AlF3/LiF Modifications.” <i>Advanced Science</i>,
    e15962, Wiley, 2025, doi:<a href="https://doi.org/10.1002/advs.202515962">10.1002/advs.202515962</a>.
  short: X. Chang, C. Escudero, A.P. Black, S. Horta, E. Martínez, X. Lu, J. Llorca,
    M. Ibáñez, J.J. Biendicho, A. Cabot, Advanced Science (2025).
date_created: 2025-12-21T23:01:35Z
date_published: 2025-12-12T00:00:00Z
date_updated: 2025-12-29T10:15:43Z
day: '12'
ddc:
- '540'
department:
- _id: MaIb
doi: 10.1002/advs.202515962
has_accepted_license: '1'
language:
- iso: eng
month: '12'
oa_version: Published Version
project:
- _id: 9B8F7476-BA93-11EA-9121-9846C619BF3A
  name: 'HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of
    Semiconductors for Waste Heat Recovery'
publication: Advanced Science
publication_identifier:
  eissn:
  - 2198-3844
publication_status: epub_ahead
publisher: Wiley
quality_controlled: '1'
scopus_import: '1'
status: public
title: Mitigating the rock-salt phase transformation in disordered LNMO through synergetic
  solid-state AlF3/LiF modifications
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
year: '2025'
...
