--- OA_place: repository OA_type: green _id: '21962' abstract: - lang: eng text: The generation of faithful cell-type diversity and correct projection neuron numbers is essential for cerebral cortex development. Corticogenesis is however susceptible to genetic interference of critical signaling pathways, including mutations in Mtor/Rptor that lead to microcephaly. How the loss of Rptor/mTORC1 function affects cortical developmental programs, at single cell level, is still unknown. Here, we utilized Mosaic Analysis with Double Markers (MADM) technology to probe Rptor gene function upon sparse single cell- or global tissue-wide ablation. We found that tissue-wide effects drive the etiology of cortical microcephaly upon loss of Rptor, rather than deficits in projection neuron genesis. Conversely, Rptor function is cell-autonomously required for postnatal projection neuron survival in a highly cell-type-specific manner. Collectively, our results suggest that the fine balance of precise cell-type-specific cell-autonomous Rptor/mTORC1 function in concert with non-cell-autonomous tissue-wide effects is essential for the development of a properly-sized cerebral cortex with accurate projection neuron diversity. acknowledged_ssus: - _id: PreCl - _id: LifeSc - _id: MassSpec - _id: Bio acknowledgement: "We thank A. Heger (IST Austria Preclinical Facility), A. Sommer (VBCF GmbH, NGS Unit), and A.\r\nNicolas (IST Austria Lab Support Facility / Mass Spectrometry Facility) for technical support; K. Ferencak,\r\nI. Aykara, P. Hirschfeld, E. Fisher, S. Laukoter, L. Andersen for initial experiments and/or assistance; and\r\nall members of the Hippenmeyer lab for discussion. This research was supported by the Scientific Service\r\nUnits (SSU) of IST Austria through resources provided by the Imaging and Optics- (IOF), Lab Support-\r\n(LSF) and Preclinical Facilities (PCF). R.B. received support from FWF Meitner-Programm (M 2416). This\r\nwork was also supported by IST Austria institutional funds; the People Programme (Marie Curie Actions)\r\nof the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement\r\nNo 618444 to S.H., and the European Research Council (ERC) under the European Union’s Horizon 2020\r\nresearch and innovation programme (grant agreement No 725780 LinPro) to S.H." article_processing_charge: No author: - first_name: Ana full_name: Villalba Requena, Ana id: 68cb85a0-39f7-11eb-9559-9aaab4f6a247 last_name: Villalba Requena orcid: 0000-0002-5615-5277 - first_name: Robert J full_name: Beattie, Robert J id: 2E26DF60-F248-11E8-B48F-1D18A9856A87 last_name: Beattie orcid: 0000-0002-8483-8753 - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler orcid: 0000-0002-7462-0048 - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Osvaldo full_name: Miranda, Osvaldo id: 862A3C56-A8BF-11E9-B4FA-D9E3E5697425 last_name: Miranda orcid: 0000-0001-6618-6889 - first_name: Thomas full_name: Krausgruber, Thomas last_name: Krausgruber - first_name: Martin full_name: Senekowitsch, Martin last_name: Senekowitsch - first_name: Matthias full_name: Farlik, Matthias last_name: Farlik - first_name: Christoph full_name: Bock, Christoph last_name: Bock - first_name: Thomas full_name: Rülicke, Thomas last_name: Rülicke - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Villalba Requena A, Beattie RJ, Pauler F, et al. Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner. bioRxiv. doi:10.64898/2026.05.01.722172 apa: Villalba Requena, A., Beattie, R. J., Pauler, F., Streicher, C., Miranda, O., Krausgruber, T., … Hippenmeyer, S. (n.d.). Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner. bioRxiv. https://doi.org/10.64898/2026.05.01.722172 chicago: Villalba Requena, Ana, Robert J Beattie, Florian Pauler, Carmen Streicher, Osvaldo Miranda, Thomas Krausgruber, Martin Senekowitsch, et al. “Mtor/Rptor Function Globally Prevents Cortical Microcephaly and Cell-Autonomously Promotes Postnatal Neuron Survival in Cell Type Specific Manner.” BioRxiv, n.d. https://doi.org/10.64898/2026.05.01.722172. ieee: A. Villalba Requena et al., “Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner,” bioRxiv. . ista: Villalba Requena A, Beattie RJ, Pauler F, Streicher C, Miranda O, Krausgruber T, Senekowitsch M, Farlik M, Bock C, Rülicke T, Hippenmeyer S. Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner. bioRxiv, 10.64898/2026.05.01.722172. mla: Villalba Requena, Ana, et al. “Mtor/Rptor Function Globally Prevents Cortical Microcephaly and Cell-Autonomously Promotes Postnatal Neuron Survival in Cell Type Specific Manner.” BioRxiv, doi:10.64898/2026.05.01.722172. short: A. Villalba Requena, R.J. Beattie, F. Pauler, C. Streicher, O. Miranda, T. Krausgruber, M. Senekowitsch, M. Farlik, C. Bock, T. Rülicke, S. Hippenmeyer, BioRxiv (n.d.). date_created: 2026-06-09T08:08:18Z date_published: 2026-05-05T00:00:00Z date_updated: 2026-06-16T08:45:25Z day: '05' ddc: - '570' department: - _id: SiHi doi: 10.64898/2026.05.01.722172 ec_funded: 1 has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.64898/2026.05.01.722172 month: '05' oa: 1 oa_version: Preprint project: - _id: 264E56E2-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: M02416 name: Molecular Mechanisms Regulating Gliogenesis in the Neocortex - _id: 25D61E48-B435-11E9-9278-68D0E5697425 call_identifier: FP7 grant_number: '618444' name: Molecular Mechanisms of Cerebral Cortex Development - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: bioRxiv publication_status: submitted status: public title: Mtor/Rptor function globally prevents cortical microcephaly and cell-autonomously promotes postnatal neuron survival in cell type specific manner tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: repository OA_type: green _id: '21963' abstract: - lang: eng text: The cerebral cortex consists of immense numbers of neuronal and glial cell-types derived from radial glial progenitor (RGP) cells. How RGPs generate appropriate quantities of distinct cortical cell-types to safeguard a brain of correct size, is not well understood. However, genetic aberration in human, including mutations in PTEN, lead to cortical malformation such as macrocephaly, albeit with unknown etiology. Here we utilized Mosaic Analysis with Double Markers (MADM)-based clonal analysis and single cell phenotyping to decipher the role of Pten in neurogenic and gliogenic RGP lineage progression during cortical ontogeny. While neurogenic RGP lineage progression and projection neuron production was moderately altered in the absence of Pten, cortical astrocyte production was drastically increased. Through genetic epistasis experiments we show that the loss of Pten uncouples astrocyte generation from essential growth factor signaling hubs, funneling into MAPK. Collectively, our results suggest that Pten regulates RGP lineage progression with distinct sequential functions in cortical projection neurogenesis and astrocyte production to ensure the emergence of a correctly-sized cerebral cortex. acknowledged_ssus: - _id: Bio - _id: LifeSc - _id: PreCl acknowledgement: "We thank Kay-Uwe Wagner (Wayne State University) for generously sharing Jak1/2–flox mouse lines; A.\r\nSommer (VBCF GmbH, NGS Unit) for technical support; N. Kim, V. Mick, S. Schnabl, S. Gobeil, and L.\r\nAndersen for technical assistance; all members of the Hippenmeyer lab for discussion and B. Novitch for\r\ncomments on earlier versions of the manuscript. This research was supported by the Scientific Service Units\r\n(SSU) of IST Austria through resources provided by the Imaging and Optics Facility (IOF), Lab Support-\r\n(LSF) and Preclinical Facilities (PCF). O.A.M received support from the Austrian Academy of Sciences\r\nÖAW (DOC 186584), and N.A. from FWF Elise Richter Program (Grant V1041T). This work was also\r\nsupported by IST Austria institutional funds; FWF SFB F78 (Neuro Stem Modulation) to S.H., and the\r\nEuropean Research Council (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme (grant agreement No 725780 LinPro) to S.H." article_processing_charge: No author: - first_name: Osvaldo full_name: Miranda, Osvaldo id: 862A3C56-A8BF-11E9-B4FA-D9E3E5697425 last_name: Miranda orcid: 0000-0001-6618-6889 - first_name: Ximena full_name: Contreras, Ximena id: 475990FE-F248-11E8-B48F-1D18A9856A87 last_name: Contreras - first_name: Florian full_name: Pauler, Florian id: 48EA0138-F248-11E8-B48F-1D18A9856A87 last_name: Pauler orcid: 0000-0002-7462-0048 - first_name: Amarbayasgalan full_name: Davaatseren, Amarbayasgalan id: 70ADC922-B424-11E9-99E3-BA18E6697425 last_name: Davaatseren - first_name: Nicole full_name: Amberg, Nicole id: 4CD6AAC6-F248-11E8-B48F-1D18A9856A87 last_name: Amberg orcid: 0000-0002-3183-8207 - first_name: Carmen full_name: Streicher, Carmen id: 36BCB99C-F248-11E8-B48F-1D18A9856A87 last_name: Streicher - first_name: Ana full_name: Villalba Requena, Ana id: 68cb85a0-39f7-11eb-9559-9aaab4f6a247 last_name: Villalba Requena orcid: 0000-0002-5615-5277 - first_name: Anna-Magdalena full_name: Heger, Anna-Magdalena id: 4B76FFD2-F248-11E8-B48F-1D18A9856A87 last_name: Heger - first_name: Corentine full_name: Marie, Corentine last_name: Marie - first_name: Bassem A. full_name: Hassan, Bassem A. last_name: Hassan - first_name: Thomas full_name: Rülicke, Thomas last_name: Rülicke - first_name: Simon full_name: Hippenmeyer, Simon id: 37B36620-F248-11E8-B48F-1D18A9856A87 last_name: Hippenmeyer orcid: 0000-0003-2279-1061 citation: ama: Miranda O, Contreras X, Pauler F, et al. Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. bioRxiv. doi:10.64898/2026.05.01.722191 apa: Miranda, O., Contreras, X., Pauler, F., Davaatseren, A., Amberg, N., Streicher, C., … Hippenmeyer, S. (n.d.). Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. bioRxiv. https://doi.org/10.64898/2026.05.01.722191 chicago: Miranda, Osvaldo, Ximena Contreras, Florian Pauler, Amarbayasgalan Davaatseren, Nicole Amberg, Carmen Streicher, Ana Villalba Requena, et al. “Pten Orchestrates Neurogenic Radial Glia Lineage Progression and Tunes Neocortical Astrocyte Production.” BioRxiv, n.d. https://doi.org/10.64898/2026.05.01.722191. ieee: O. Miranda et al., “Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production,” bioRxiv. . ista: Miranda O, Contreras X, Pauler F, Davaatseren A, Amberg N, Streicher C, Villalba Requena A, Heger A-M, Marie C, Hassan BA, Rülicke T, Hippenmeyer S. Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production. bioRxiv, 10.64898/2026.05.01.722191. mla: Miranda, Osvaldo, et al. “Pten Orchestrates Neurogenic Radial Glia Lineage Progression and Tunes Neocortical Astrocyte Production.” BioRxiv, doi:10.64898/2026.05.01.722191. short: O. Miranda, X. Contreras, F. Pauler, A. Davaatseren, N. Amberg, C. Streicher, A. Villalba Requena, A.-M. Heger, C. Marie, B.A. Hassan, T. Rülicke, S. Hippenmeyer, BioRxiv (n.d.). corr_author: '1' date_created: 2026-06-09T08:08:53Z date_published: 2026-05-05T00:00:00Z date_updated: 2026-06-16T08:57:20Z day: '05' ddc: - '570' department: - _id: SiHi - _id: PreCl - _id: GradSch doi: 10.64898/2026.05.01.722191 ec_funded: 1 has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.64898/2026.05.01.722191 month: '05' oa: 1 oa_version: Preprint project: - _id: 059F6AB4-7A3F-11EA-A408-12923DDC885E grant_number: F7805 name: Stem Cell Modulation in Neural Development and Regeneration/ P05-Molecular Mechanisms of Neural Stem Cell Lineage Progression - _id: 260018B0-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '725780' name: Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development publication: bioRxiv publication_status: submitted status: public title: Pten orchestrates neurogenic radial glia lineage progression and tunes neocortical astrocyte production tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: preprint user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- OA_place: repository OA_type: green _id: '21968' abstract: - lang: eng text: Balancing selection, a form of selection that maintains genetic diversity, is difficult to detect, and the importance of balancing selection for the maintenance of genetic variation may be larger than often assumed. We model the possibility that the diversity-promoting effects of balancing selection extend to other loci that show sign epistasis with a locus under balancing selection. Rather than focusing on overdominance, as was done in previous efforts, we explore the effects of negative frequency dependence and show that this has important effects on the conditions under which the diversity-promoting effect of epistasis can occur in diploids. Our results show that not only recombination rate but also the dominance of sign epistasis are key parameters that determine the maintenance of polymorphism beyond the locus under direct balancing selection. We suggest that the effect we explore may play a significant role, especially when balancing selection acts on major effect loci. acknowledgement: This work was funded by grants from the Swedish Research Council (2023-03730 to G.A.) and the DOC fellowship from the Austrian Academy of Science (26293 to K.K.). article_processing_charge: No author: - first_name: Kseniia full_name: Khudiakova, Kseniia id: 4E6DC800-AE37-11E9-AC72-31CAE5697425 last_name: Khudiakova orcid: 0000-0002-6246-1465 - first_name: Nicholas H full_name: Barton, Nicholas H id: 4880FE40-F248-11E8-B48F-1D18A9856A87 last_name: Barton orcid: 0000-0002-8548-5240 - first_name: Goran full_name: Arnqvist, Goran last_name: Arnqvist citation: ama: Khudiakova K, Barton NH, Arnqvist G. Sign epistasis extends the effects of balancing selection on genetic diversity. bioRxiv. doi:10.1101/2025.04.09.647826 apa: Khudiakova, K., Barton, N. H., & Arnqvist, G. (n.d.). Sign epistasis extends the effects of balancing selection on genetic diversity. bioRxiv. https://doi.org/10.1101/2025.04.09.647826 chicago: Khudiakova, Kseniia, Nicholas H Barton, and Goran Arnqvist. “Sign Epistasis Extends the Effects of Balancing Selection on Genetic Diversity.” BioRxiv, n.d. https://doi.org/10.1101/2025.04.09.647826. ieee: K. Khudiakova, N. H. Barton, and G. Arnqvist, “Sign epistasis extends the effects of balancing selection on genetic diversity,” bioRxiv. . ista: Khudiakova K, Barton NH, Arnqvist G. Sign epistasis extends the effects of balancing selection on genetic diversity. bioRxiv, 10.1101/2025.04.09.647826. mla: Khudiakova, Kseniia, et al. “Sign Epistasis Extends the Effects of Balancing Selection on Genetic Diversity.” BioRxiv, doi:10.1101/2025.04.09.647826. short: K. Khudiakova, N.H. Barton, G. Arnqvist, BioRxiv (n.d.). corr_author: '1' date_created: 2026-06-09T12:26:11Z date_published: 2026-04-23T00:00:00Z date_updated: 2026-06-12T12:43:34Z day: '23' department: - _id: NiBa - _id: JaMa doi: 10.1101/2025.04.09.647826 language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1101/2025.04.09.647826 month: '04' oa: 1 oa_version: Preprint project: - _id: 34d33d68-11ca-11ed-8bc3-ec13763c0ca8 grant_number: '26293' name: The impact of deleterious mutations on small populations publication: bioRxiv publication_status: draft related_material: record: - id: '21918' relation: dissertation_contains status: public status: public title: Sign epistasis extends the effects of balancing selection on genetic diversity tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: preprint user_id: 8b945eb4-e2f2-11eb-945a-df72226e66a9 year: '2026' ... --- _id: '21971' abstract: - lang: eng text: "A Rust library for analyzing dendritic structures using quadric matrices. This project provides efficient tools for representing dendritic trees, computing quadric error metrics, and visualizing eigenvalue distributions on hexagonal plots.\r\n\r\nThis library implements quadric-based geometric analysis of dendritic structures, commonly found in neuroscience applications. Key features include:\r\n\r\nTree data structures: Hierarchical vertex and edge representations for dendritic trees\r\nQuadric matrices: Computation of quadric error metrics for edges and vertices\r\nVisualisation: Hexagonal plot generation using NormPolar transformations\r\nInteractive tools: Desktop application with plotting capabilities" author: - first_name: Yossi full_name: Bleile, Yossi id: 920a7385-7995-11ef-9bfd-8c434cd8f3c2 last_name: Bleile orcid: 0000-0002-4861-9174 - first_name: Emanuele full_name: Cortinovis, Emanuele last_name: Cortinovis citation: ama: Bokor Bleile Y, Cortinovis E. Quadrix. 2026. doi:10.15479/AT-ISTA-21971 apa: Bokor Bleile, Y., & Cortinovis, E. (2026). Quadrix. Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21971 chicago: Bokor Bleile, Yossi, and Emanuele Cortinovis. “Quadrix.” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21971. ieee: Y. Bokor Bleile and E. Cortinovis, “Quadrix.” Institute of Science and Technology Austria, 2026. ista: Bokor Bleile Y, Cortinovis E. 2026. Quadrix, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21971. mla: Bokor Bleile, Yossi, and Emanuele Cortinovis. Quadrix. Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21971. short: Y. Bokor Bleile, E. Cortinovis, (2026). corr_author: '1' date_created: 2026-06-09T19:19:13Z date_published: 2026-06-15T00:00:00Z date_updated: 2026-06-15T23:00:03Z day: '15' department: - _id: HeEd doi: 10.15479/AT-ISTA-21971 file: - access_level: open_access checksum: 48f633b6767c4b15dd6220ca2b4dc175 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:02Z date_updated: 2026-06-09T19:16:02Z file_id: '21974' file_name: LICENSE file_size: 1081 relation: main_file success: 1 - access_level: open_access checksum: de25d0b224acbde3d38f837fdd8f97d5 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:27Z date_updated: 2026-06-09T19:16:27Z file_id: '21975' file_name: quadrix-x64.exe file_size: 11308032 relation: main_file success: 1 - access_level: open_access checksum: a7b94a7380dc178e76ebdba9f1fa45c2 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:28Z date_updated: 2026-06-09T19:16:28Z file_id: '21976' file_name: quadrix-arm64.exe file_size: 10655744 relation: main_file success: 1 - access_level: open_access checksum: 2404aa8619a56668bd95032791ee1250 content_type: application/zip creator: ybleile date_created: 2026-06-09T19:16:27Z date_updated: 2026-06-09T19:16:27Z file_id: '21977' file_name: Quadrix Desktop.app.zip file_size: 2032 relation: main_file success: 1 - access_level: open_access checksum: 106930f81563c5c719a5f4030b5ca5ed content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:40Z date_updated: 2026-06-09T19:16:40Z file_id: '21978' file_name: quadrix-arm64 file_size: 12187896 relation: main_file success: 1 - access_level: open_access checksum: 0e6ba129318446676f220087e7e6ff41 content_type: application/octet-stream creator: ybleile date_created: 2026-06-09T19:16:52Z date_updated: 2026-06-09T19:16:52Z file_id: '21979' file_name: quadrix-x64 file_size: 20587592 relation: main_file success: 1 - access_level: open_access checksum: f0b03385d17df049219465ab7403fe09 content_type: application/gzip creator: pub-gitlab-bot date_created: 2026-06-09T19:19:12Z date_updated: 2026-06-09T19:19:12Z file_id: '21972' file_name: Quadrix.zip file_size: 1914198 relation: main_file - access_level: open_access checksum: ede0bbb24bf41ab4009cf1b6a9009671 content_type: application/zip creator: ybleile date_created: 2026-06-10T19:09:38Z date_updated: 2026-06-10T19:09:38Z file_id: '21993' file_name: THIRD_PARTY_LICENSES.zip file_size: 37557 relation: supplementary_material - access_level: open_access checksum: f3c5fcc62c88e449ab5c660244df5aef content_type: text/markdown creator: ybleile date_created: 2026-06-15T08:13:32Z date_updated: 2026-06-15T08:13:32Z file_id: '22009' file_name: README.md file_size: 3839 relation: main_file success: 1 - access_level: open_access checksum: aa74828c3165aafcdee4ddcc9ecd37ac content_type: application/gzip creator: pub-gitlab-bot date_created: 2026-06-15T08:14:24Z date_updated: 2026-06-15T08:14:24Z file_id: '22008' file_name: Quadrix.zip file_size: 1912923 relation: main_file file_date_updated: 2026-06-15T08:14:24Z has_accepted_license: '1' keyword: - quadratics - mathematics - dendrites - geometry - topology license: https://opensource.org/licenses/MIT month: '06' oa: 1 project: - _id: 9106a876-16d5-11f0-9cad-bbf11c9952f9 grant_number: ESP 9584724 name: Quantitative Unbiased Shape Analysis with Geometry & Topology publisher: Institute of Science and Technology Austria status: public title: Quadrix tmp: legal_code_url: https://opensource.org/licenses/MIT name: The MIT License short: MIT type: software user_id: 68b8ca59-c5b3-11ee-8790-cd641c68093d year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '21980' abstract: - lang: eng text: Despite significant progress in the field of molecular electronics over the last two decades, the quantitative prediction of metal-molecule-metal junction conductance remains a challenge. The standard computational framework combines density functional theory (DFT) with nonequilibrium Green’s functions (NEGF) using low-rung exchange-correlation functionals such as PBE, which overestimate the conductances. More advanced correction methods exist but require complex workflows and high computational cost, limiting their accessibility. Here, we introduce a physically motivated approach that approximates results obtained with high-rung functionals. Our method fits the PBE-calculated transmission to a Breit-Wigner form and subsequently refines the fit parameters using molecular orbital energies and metal densities of states computed for the isolated subsystems with high-rung functionals. This approach is applicable to a broad range of molecular junctions yielding conductance values in quantitative agreement with experiments. Our approach is simple, low-cost, and accurate, making it well-suited for routine and large-scale prediction of single-molecule junction conductance. acknowledgement: This work was supported primarily by the Institute of Science and Technology Austria. L.V. was supported in part by the National Science Foundation (No. NSF-DMR 2241180). Z.-F.L. was supported by an NSF CAREER Award, No. DMR-2044552 and an Alfred P. Sloan Research Fellowship, No. FG-2024-21750. article_processing_charge: Yes (via OA deal) article_type: letter_note author: - first_name: Artem full_name: Gulyaev, Artem id: 83ed7901-7380-11f0-bf20-a0788d5e654d last_name: Gulyaev - first_name: Jyotisman full_name: Hazarika, Jyotisman id: d87714c4-663d-11f0-bd06-caece19833e5 last_name: Hazarika orcid: 0009-0007-2542-7878 - first_name: Zhen-Fei full_name: Liu, Zhen-Fei last_name: Liu - first_name: Latha full_name: Venkataraman, Latha id: 9ebb78a5-cc0d-11ee-8322-fae086a32caf last_name: Venkataraman orcid: 0000-0002-6957-6089 citation: ama: Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 2026;26(22):7429–7434. doi:10.1021/acs.nanolett.6c01462 apa: Gulyaev, A., Hazarika, J., Liu, Z.-F., & Venkataraman, L. (2026). A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. American Chemical Society. https://doi.org/10.1021/acs.nanolett.6c01462 chicago: Gulyaev, Artem, Jyotisman Hazarika, Zhen-Fei Liu, and Latha Venkataraman. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters. American Chemical Society, 2026. https://doi.org/10.1021/acs.nanolett.6c01462. ieee: A. Gulyaev, J. Hazarika, Z.-F. Liu, and L. Venkataraman, “A computationally efficient and accurate method for predicting conductance of single-molecule junctions,” Nano Letters, vol. 26, no. 22. American Chemical Society, pp. 7429–7434, 2026. ista: Gulyaev A, Hazarika J, Liu Z-F, Venkataraman L. 2026. A computationally efficient and accurate method for predicting conductance of single-molecule junctions. Nano Letters. 26(22), 7429–7434. mla: Gulyaev, Artem, et al. “A Computationally Efficient and Accurate Method for Predicting Conductance of Single-Molecule Junctions.” Nano Letters, vol. 26, no. 22, American Chemical Society, 2026, pp. 7429–7434, doi:10.1021/acs.nanolett.6c01462. short: A. Gulyaev, J. Hazarika, Z.-F. Liu, L. Venkataraman, Nano Letters 26 (2026) 7429–7434. corr_author: '1' date_created: 2026-06-10T07:27:19Z date_published: 2026-06-01T00:00:00Z date_updated: 2026-06-16T09:13:30Z day: '01' ddc: - '540' department: - _id: LaVe - _id: GradSch doi: 10.1021/acs.nanolett.6c01462 external_id: pmid: - '42223342' file: - access_level: open_access checksum: 897551374cac28e0db26dcb0b676b8e7 content_type: application/pdf creator: dernst date_created: 2026-06-16T09:11:35Z date_updated: 2026-06-16T09:11:35Z file_id: '22013' file_name: 2026_NanoLetters_Gulyaev.pdf file_size: 3362800 relation: main_file success: 1 file_date_updated: 2026-06-16T09:11:35Z has_accepted_license: '1' intvolume: ' 26' issue: '22' language: - iso: eng month: '06' oa: 1 oa_version: Published Version page: 7429–7434 pmid: 1 publication: Nano Letters publication_identifier: eissn: - 1530-6992 issn: - 1530-6984 publication_status: published publisher: American Chemical Society quality_controlled: '1' scopus_import: '1' status: public title: A computationally efficient and accurate method for predicting conductance of single-molecule junctions 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: 26 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20328' abstract: - lang: eng text: We consider the standard overlap (math formular) of any bi-orthogonal family of left and right eigenvectors of a large random matrix X with centred i.i.d. entries and we prove that it decays as an inverse second power of the distance between the corresponding eigenvalues. This extends similar results for the complex Gaussian ensemble from Bourgade and Dubach [15], as well as Benaych-Georges and Zeitouni [13], to any i.i.d. matrix ensemble in both symmetry classes. As a main tool, we prove a two-resolvent local law for the Hermitisation of X uniformly in the spectrum with optimal decay rate and optimal dependence on the density near the spectral edge. acknowledgement: Partially supported by ERC Advanced Grant “RMTBeyond” No. 101020331. Partially supported by National Key R&D Program of China No. 2024YFA1013503. article_number: '111180' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Giorgio full_name: Cipolloni, Giorgio id: 42198EFA-F248-11E8-B48F-1D18A9856A87 last_name: Cipolloni orcid: 0000-0002-4901-7992 - first_name: László full_name: Erdös, László id: 4DBD5372-F248-11E8-B48F-1D18A9856A87 last_name: Erdös orcid: 0000-0001-5366-9603 - first_name: Yuanyuan full_name: Xu, Yuanyuan id: 7902bdb1-a2a4-11eb-a164-c9216f71aea3 last_name: Xu orcid: 0000-0003-1559-1205 citation: ama: Cipolloni G, Erdös L, Xu Y. Optimal decay of eigenvector overlap for non-Hermitian random matrices. Journal of Functional Analysis. 2026;290(1). doi:10.1016/j.jfa.2025.111180 apa: Cipolloni, G., Erdös, L., & Xu, Y. (2026). Optimal decay of eigenvector overlap for non-Hermitian random matrices. Journal of Functional Analysis. Elsevier. https://doi.org/10.1016/j.jfa.2025.111180 chicago: Cipolloni, Giorgio, László Erdös, and Yuanyuan Xu. “Optimal Decay of Eigenvector Overlap for Non-Hermitian Random Matrices.” Journal of Functional Analysis. Elsevier, 2026. https://doi.org/10.1016/j.jfa.2025.111180. ieee: G. Cipolloni, L. Erdös, and Y. Xu, “Optimal decay of eigenvector overlap for non-Hermitian random matrices,” Journal of Functional Analysis, vol. 290, no. 1. Elsevier, 2026. ista: Cipolloni G, Erdös L, Xu Y. 2026. Optimal decay of eigenvector overlap for non-Hermitian random matrices. Journal of Functional Analysis. 290(1), 111180. mla: Cipolloni, Giorgio, et al. “Optimal Decay of Eigenvector Overlap for Non-Hermitian Random Matrices.” Journal of Functional Analysis, vol. 290, no. 1, 111180, Elsevier, 2026, doi:10.1016/j.jfa.2025.111180. short: G. Cipolloni, L. Erdös, Y. Xu, Journal of Functional Analysis 290 (2026). corr_author: '1' date_created: 2025-09-10T05:46:07Z date_published: 2026-01-01T00:00:00Z date_updated: 2026-06-03T13:12:14Z day: '01' ddc: - '510' department: - _id: LaEr doi: 10.1016/j.jfa.2025.111180 ec_funded: 1 external_id: arxiv: - '2411.16572' isi: - '001583178200001' oaworkid: - w4413883397 file: - access_level: open_access checksum: ee53d5e695f0df11e017c8c9242a2b04 content_type: application/pdf creator: dernst date_created: 2026-01-05T13:05:47Z date_updated: 2026-01-05T13:05:47Z file_id: '20947' file_name: 2026_JourFuncAnalysis_Cipolloni.pdf file_size: 2503887 relation: main_file success: 1 file_date_updated: 2026-01-05T13:05:47Z has_accepted_license: '1' intvolume: ' 290' isi: 1 issue: '1' language: - iso: eng month: '01' oa: 1 oa_version: Published Version oaworkid: 1 project: - _id: 62796744-2b32-11ec-9570-940b20777f1d call_identifier: H2020 grant_number: '101020331' name: Random matrices beyond Wigner-Dyson-Mehta publication: Journal of Functional Analysis publication_identifier: issn: - 0022-1236 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Optimal decay of eigenvector overlap for non-Hermitian random matrices 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: 290 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20422' abstract: - lang: eng text: "We show that if n is odd and p>=Clog n/n, then with high probability Hamilton cycles in G(n,p) span its cycle space. More generally, we show this holds for a class of graphs satisfying certain natural pseudorandom properties. The proof is based on a novel idea of parity-switchers, which can be thought of as analogues of absorbers in the context of cycle spaces. As another application of our method, we show that Hamilton cycles in a near-Dirac graph G, that is, a graph G with odd n vertices and minimum degree n/2+C for sufficiently large constant C, span its cycle space.\r\n" acknowledgement: This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. Image 1 Part of this research was conducted while the author was at Department of Computer Science, ETH Zürich, Switzerland. This author was supported by grant no. CRSII5 173721 of the Swiss National Science Foundation. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Micha full_name: Christoph, Micha last_name: Christoph - first_name: Rajko full_name: Nenadov, Rajko last_name: Nenadov - first_name: Kalina H full_name: Petrova, Kalina H id: 554ff4e4-f325-11ee-b0c4-a10dbd523381 last_name: Petrova citation: ama: Christoph M, Nenadov R, Petrova KH. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 2026;176:254-267. doi:10.1016/j.jctb.2025.09.002 apa: Christoph, M., Nenadov, R., & Petrova, K. H. (2026). The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. Elsevier. https://doi.org/10.1016/j.jctb.2025.09.002 chicago: Christoph, Micha, Rajko Nenadov, and Kalina H Petrova. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B. Elsevier, 2026. https://doi.org/10.1016/j.jctb.2025.09.002. ieee: M. Christoph, R. Nenadov, and K. H. Petrova, “The Hamilton space of pseudorandom graphs,” Journal of Combinatorial Theory Series B, vol. 176. Elsevier, pp. 254–267, 2026. ista: Christoph M, Nenadov R, Petrova KH. 2026. The Hamilton space of pseudorandom graphs. Journal of Combinatorial Theory Series B. 176, 254–267. mla: Christoph, Micha, et al. “The Hamilton Space of Pseudorandom Graphs.” Journal of Combinatorial Theory Series B, vol. 176, Elsevier, 2026, pp. 254–67, doi:10.1016/j.jctb.2025.09.002. short: M. Christoph, R. Nenadov, K.H. Petrova, Journal of Combinatorial Theory Series B 176 (2026) 254–267. corr_author: '1' date_created: 2025-10-05T22:01:34Z date_published: 2026-01-01T00:00:00Z date_updated: 2026-01-05T13:29:52Z day: '01' ddc: - '510' department: - _id: MaKw doi: 10.1016/j.jctb.2025.09.002 ec_funded: 1 external_id: arxiv: - '2402.01447' isi: - '001585783400001' file: - access_level: open_access checksum: 60676af4af4b3243ba187e7d65440d99 content_type: application/pdf creator: dernst date_created: 2026-01-05T13:29:34Z date_updated: 2026-01-05T13:29:34Z file_id: '20953' file_name: 2026_JourCombTheoryB_Christoph.pdf file_size: 688924 relation: main_file success: 1 file_date_updated: 2026-01-05T13:29:34Z has_accepted_license: '1' intvolume: ' 176' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 254-267 project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: Journal of Combinatorial Theory Series B publication_identifier: eissn: - 1096-0902 issn: - 0095-8956 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: The Hamilton space of pseudorandom graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 176 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20456' abstract: - lang: eng text: Given a locally finite set A⊆Rd and a coloring χ:A→{0,1,…,s}, we introduce the chromatic Delaunay mosaic of χ, which is a Delaunay mosaic in Rs+d that represents how points of different colors mingle. Our main results are bounds on the size of the chromatic Delaunay mosaic, in which we assume that d and s are constants. For example, if A is finite with n=#A, and the coloring is random, then the chromatic Delaunay mosaic has O(n⌈d/2⌉) cells in expectation. In contrast, for Delone sets and Poisson point processes in Rd, the expected number of cells within a closed ball is only a constant times the number of points in this ball. Furthermore, in R2 all colorings of a dense set of n points have chromatic Delaunay mosaics of size O(n). This encourages the use of chromatic Delaunay mosaics in applications. acknowledgement: The fourth author thanks Boris Aronov for insightful discussions on the size of the overlay of Voronoi tessellations. Open access funding provided by Institute of Science and Technology (IST Austria). This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35. article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Ranita full_name: Biswas, Ranita id: 3C2B033E-F248-11E8-B48F-1D18A9856A87 last_name: Biswas orcid: 0000-0002-5372-7890 - first_name: Sebastiano full_name: Cultrera di Montesano, Sebastiano id: 34D2A09C-F248-11E8-B48F-1D18A9856A87 last_name: Cultrera di Montesano orcid: 0000-0001-6249-0832 - first_name: Ondrej full_name: Draganov, Ondrej id: 2B23F01E-F248-11E8-B48F-1D18A9856A87 last_name: Draganov orcid: 0000-0003-0464-3823 - first_name: Herbert full_name: Edelsbrunner, Herbert id: 3FB178DA-F248-11E8-B48F-1D18A9856A87 last_name: Edelsbrunner orcid: 0000-0002-9823-6833 - first_name: Morteza full_name: Saghafian, Morteza id: f86f7148-b140-11ec-9577-95435b8df824 last_name: Saghafian citation: ama: Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. 2026;75:24-47. doi:10.1007/s00454-025-00778-7 apa: Biswas, R., Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., & Saghafian, M. (2026). On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-025-00778-7 chicago: Biswas, Ranita, Sebastiano Cultrera di Montesano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “On the Size of Chromatic Delaunay Mosaics.” Discrete and Computational Geometry. Springer Nature, 2026. https://doi.org/10.1007/s00454-025-00778-7. ieee: R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “On the size of chromatic Delaunay mosaics,” Discrete and Computational Geometry, vol. 75. Springer Nature, pp. 24–47, 2026. ista: Biswas R, Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. On the size of chromatic Delaunay mosaics. Discrete and Computational Geometry. 75, 24–47. mla: Biswas, Ranita, et al. “On the Size of Chromatic Delaunay Mosaics.” Discrete and Computational Geometry, vol. 75, Springer Nature, 2026, pp. 24–47, doi:10.1007/s00454-025-00778-7. short: R. Biswas, S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Discrete and Computational Geometry 75 (2026) 24–47. corr_author: '1' date_created: 2025-10-12T22:01:26Z date_published: 2026-01-01T00:00:00Z date_updated: 2026-01-05T13:21:56Z day: '01' ddc: - '510' department: - _id: HeEd doi: 10.1007/s00454-025-00778-7 ec_funded: 1 external_id: arxiv: - '2212.03121' isi: - '001584166900001' file: - access_level: open_access checksum: 0addb5c1b78142f9fb453bfa04695400 content_type: application/pdf creator: dernst date_created: 2026-01-05T13:21:20Z date_updated: 2026-01-05T13:21:20Z file_id: '20952' file_name: 2026_DiscreteCompGeom_Biswas.pdf file_size: 570922 relation: main_file success: 1 file_date_updated: 2026-01-05T13:21:20Z has_accepted_license: '1' intvolume: ' 75' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version page: 24-47 project: - _id: 266A2E9E-B435-11E9-9278-68D0E5697425 call_identifier: H2020 grant_number: '788183' name: Alpha Shape Theory Extended - _id: 268116B8-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: Z00342 name: Mathematics, Computer Science - _id: 2561EBF4-B435-11E9-9278-68D0E5697425 call_identifier: FWF grant_number: I02979-N35 name: Persistence and stability of geometric complexes publication: Discrete and Computational Geometry publication_identifier: eissn: - 1432-0444 issn: - 0179-5376 publication_status: published publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '15090' relation: earlier_version status: public scopus_import: '1' status: public title: On the size of chromatic Delaunay mosaics 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: 75 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '20482' abstract: - lang: eng text: 'In his study of graph codes, Alon introduced the concept of the odd-Ramsey number of a family of graphs H in Kn, defined as the minimum number of colours needed to colour the edges of K so that every copy of a graph H E H intersects some colour class in an odd number of edges. In this paper, we focus on complete bipartite graphs. First, we completely resolve the problem when H is the family of all spanning complete bipartite graphs on n vertices. We then focus on its subfamilies, that is, {Kt,n-t : t E T} for a fixed set of integers T c [[n/2]]. We prove that the odd-Ramsey problem is equivalent to determining the maximum dimension of a linear binary code avoiding codewords of given weights, and leverage known results from coding theory to deduce asymptotically tight bounds in our setting. We conclude with bounds for the odd-Ramsey numbers of fixed (that is, non-spanning) complete bipartite subgraphs.' acknowledgement: "The authors would like to thank Gilles Zémor for a helpful clarification on [3], Deepak Bal and Patrick Bennett for bringing [25] to their attention, and both referees for several helpful comments.\r\nS.B.: Most of this research was conducted while the author was at the School of Mathematics, University of Birmingham, Birmingham, United Kingdom. The research leading to these results was supported by EPSRC, United Kingdom, grant no. EP/V048287/1 and by ERC Advanced Grants “GeoScape”, no. 882971 and “ERMiD”, no. 101054936. There are no additional data beyond that contained within the main manuscript.\r\nS.D.: Research supported by Taiwan NSTC grants 111-2115-M-002-009-MY2 and 113-2628-M-002-008-MY4.\r\nK.P.: This project has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413. Parts of this research was conducted while K.P. was at the Department of Computer Science, ETH Zürich, Switzerland, supported by Swiss National Science Foundation, Switzerland , grant no. CRSII5 173721." article_number: '104235' article_processing_charge: Yes (via OA deal) article_type: original arxiv: 1 author: - first_name: Simona full_name: Boyadzhiyska, Simona last_name: Boyadzhiyska - first_name: Shagnik full_name: Das, Shagnik last_name: Das - first_name: Thomas full_name: Lesgourgues, Thomas last_name: Lesgourgues - first_name: Kalina H full_name: Petrova, Kalina H id: 554ff4e4-f325-11ee-b0c4-a10dbd523381 last_name: Petrova citation: ama: Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. 2026;131. doi:10.1016/j.ejc.2025.104235 apa: Boyadzhiyska, S., Das, S., Lesgourgues, T., & Petrova, K. H. (2026). Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. Elsevier. https://doi.org/10.1016/j.ejc.2025.104235 chicago: Boyadzhiyska, Simona, Shagnik Das, Thomas Lesgourgues, and Kalina H Petrova. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics. Elsevier, 2026. https://doi.org/10.1016/j.ejc.2025.104235. ieee: S. Boyadzhiyska, S. Das, T. Lesgourgues, and K. H. Petrova, “Odd-Ramsey numbers of complete bipartite graphs,” European Journal of Combinatorics, vol. 131. Elsevier, 2026. ista: Boyadzhiyska S, Das S, Lesgourgues T, Petrova KH. 2026. Odd-Ramsey numbers of complete bipartite graphs. European Journal of Combinatorics. 131, 104235. mla: Boyadzhiyska, Simona, et al. “Odd-Ramsey Numbers of Complete Bipartite Graphs.” European Journal of Combinatorics, vol. 131, 104235, Elsevier, 2026, doi:10.1016/j.ejc.2025.104235. short: S. Boyadzhiyska, S. Das, T. Lesgourgues, K.H. Petrova, European Journal of Combinatorics 131 (2026). corr_author: '1' date_created: 2025-10-16T13:14:34Z date_published: 2026-01-01T00:00:00Z date_updated: 2026-01-05T13:34:48Z day: '01' ddc: - '500' department: - _id: MaKw doi: 10.1016/j.ejc.2025.104235 ec_funded: 1 external_id: arxiv: - '2410.05887' isi: - '001573380700001' file: - access_level: open_access checksum: 52883daa217398396cbf9b8ad9ddae92 content_type: application/pdf creator: dernst date_created: 2026-01-05T13:34:40Z date_updated: 2026-01-05T13:34:40Z file_id: '20954' file_name: 2026_EuropJourCombinatorics_Boyadzhiyska.pdf file_size: 563029 relation: main_file success: 1 file_date_updated: 2026-01-05T13:34:40Z has_accepted_license: '1' intvolume: ' 131' isi: 1 language: - iso: eng month: '01' oa: 1 oa_version: Published Version project: - _id: fc2ed2f7-9c52-11eb-aca3-c01059dda49c call_identifier: H2020 grant_number: '101034413' name: 'IST-BRIDGE: International postdoctoral program' publication: European Journal of Combinatorics publication_identifier: issn: - 0195-6698 publication_status: published publisher: Elsevier quality_controlled: '1' scopus_import: '1' status: public title: Odd-Ramsey numbers of complete bipartite graphs tmp: image: /images/cc_by.png legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0) short: CC BY (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 131 year: '2026' ... --- OA_place: publisher OA_type: gold _id: '21437' abstract: - lang: eng text: Altermagnets are a class of collinear magnets that exhibit non-relativistic spin splitting (NRSS) of electronic bands in the absence of net magnetization. Their potential to generate large spin polarization without spin-orbit coupling has created strong interest in probes that access the underlying order parameter directly. In this Perspective, we show that linear magneto-birefringence (LMB) provides a natural and broadly applicable route to detecting altermagnetic order. Building on the correspondence between the momentum-space structure of NRSS and the ferroic ordering of magnetic multipoles in real space, we demonstrate how $d$-wave and $g$-wave NRSS textures yield distinct LMB responses. We present a symmetry-based framework that identifies the optical geometries and field configurations required to isolate specific multipole components, enabling domain imaging and providing benchmarks for theoretical models of LMB. acknowledgement: We thank Nicola Spaldin and Marc Vila for valuable discussions. J.O. received support from the Quantum Materials (KC2202) program under the U.S. Department of Energy, Office of Science, Office of Basic Energy Sciences, Materials Sciences and Engineering Division under Contract No. DE-AC02-05CH11231, and the Gordon and Betty Moore Foundation's EPiQS Initiative through Grant GBMF4537 to J.O. at UC Berkeley. article_processing_charge: Yes article_type: original arxiv: 1 author: - first_name: Veronika full_name: Sunko, Veronika id: 23cb1cf6-2c7a-11ef-91a4-f72fc19f20b3 last_name: Sunko orcid: 0000-0003-2724-3523 - first_name: J. full_name: Orenstein, J. last_name: Orenstein citation: ama: Sunko V, Orenstein J. Linear magneto-birefringence as a probe of altermagnetism. npj Quantum Materials. 2026. doi:10.1038/s41535-026-00901-8 apa: Sunko, V., & Orenstein, J. (2026). Linear magneto-birefringence as a probe of altermagnetism. Npj Quantum Materials. Springer Nature. https://doi.org/10.1038/s41535-026-00901-8 chicago: Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe of Altermagnetism.” Npj Quantum Materials. Springer Nature, 2026. https://doi.org/10.1038/s41535-026-00901-8. ieee: V. Sunko and J. Orenstein, “Linear magneto-birefringence as a probe of altermagnetism,” npj Quantum Materials. Springer Nature, 2026. ista: Sunko V, Orenstein J. 2026. Linear magneto-birefringence as a probe of altermagnetism. npj Quantum Materials. mla: Sunko, Veronika, and J. Orenstein. “Linear Magneto-Birefringence as a Probe of Altermagnetism.” Npj Quantum Materials, Springer Nature, 2026, doi:10.1038/s41535-026-00901-8. short: V. Sunko, J. Orenstein, Npj Quantum Materials (2026). corr_author: '1' date_created: 2026-03-11T10:40:08Z date_published: 2026-05-30T00:00:00Z date_updated: 2026-06-24T10:31:05Z day: '30' ddc: - '530' department: - _id: VeSu doi: 10.1038/s41535-026-00901-8 external_id: arxiv: - '2511.16421' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41535-026-00901-8 month: '05' oa: 1 oa_version: Published Version publication: npj Quantum Materials publication_identifier: eissn: - 2397-4648 publication_status: epub_ahead publisher: Springer Nature status: public title: Linear magneto-birefringence as a probe of altermagnetism tmp: image: /images/cc_by_nc_nd.png legal_code_url: https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode name: Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0) short: CC BY-NC-ND (4.0) type: journal_article user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 year: '2026' ... --- DOAJ_listed: '1' OA_place: publisher OA_type: gold _id: '22101' abstract: - lang: eng text: "Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects." acknowledgement: "J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012." article_number: '5325' article_processing_charge: Yes article_type: original author: - first_name: Jakub full_name: Svoboda, Jakub id: 130759D2-D7DD-11E9-87D2-DE0DE6697425 last_name: Svoboda orcid: 0000-0002-1419-3267 - first_name: Hossein full_name: Nemati, Hossein last_name: Nemati - first_name: Josef full_name: Tkadlec, Josef id: 3F24CCC8-F248-11E8-B48F-1D18A9856A87 last_name: Tkadlec orcid: 0000-0002-1097-9684 - first_name: Kamran full_name: Kaveh, Kamran last_name: Kaveh - first_name: Krishnendu full_name: Chatterjee, Krishnendu id: 2E5DCA20-F248-11E8-B48F-1D18A9856A87 last_name: Chatterjee orcid: 0000-0002-4561-241X citation: ama: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. Nature Communications. 2026;17. doi:10.1038/s41467-026-71777-2 apa: Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., & Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-026-71777-2 chicago: Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” Nature Communications. Springer Nature, 2026. https://doi.org/10.1038/s41467-026-71777-2. ieee: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” Nature Communications, vol. 17. Springer Nature, 2026. ista: Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325. mla: Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” Nature Communications, vol. 17, 5325, Springer Nature, 2026, doi:10.1038/s41467-026-71777-2. short: J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026). corr_author: '1' das_tickbox: '0' dataavailabilitystatement: Correspondence and requests for materials should be addressed to Krishnendu Chatterjee. date_created: 2026-06-21T22:02:59Z date_published: 2026-12-01T00:00:00Z date_updated: 2026-06-24T07:53:53Z day: '01' ddc: - '000' department: - _id: KrCh doi: 10.1038/s41467-026-71777-2 ec_funded: 1 external_id: pmid: - '41997932' file: - access_level: open_access checksum: b660048bb271f24d6763803e247d5c32 content_type: application/pdf creator: dernst date_created: 2026-06-24T06:50:24Z date_updated: 2026-06-24T06:50:24Z file_id: '22136' file_name: 2026_NatureComm_Svoboda.pdf file_size: 1068919 relation: main_file success: 1 file_date_updated: 2026-06-24T06:50:24Z has_accepted_license: '1' intvolume: ' 17' language: - iso: eng month: '12' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 0599E47C-7A3F-11EA-A408-12923DDC885E call_identifier: H2020 grant_number: '863818' name: 'Formal Methods for Stochastic Models: Algorithms and Applications' publication: Nature Communications publication_identifier: eissn: - 2041-1723 publication_status: published publisher: Springer Nature quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: yes title: The effect of the fitness gradient on fixation probability 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: 17 year: '2026' ... --- OA_place: repository OA_type: green _id: '22103' abstract: - lang: eng text: "Modern AI systems increasingly rely on opaque, highly complex models whose inner workings remain inaccessible even to experts. This opacity creates challenges for trust, accountability, and compliance with\r\nemerging regulatory expectations such as the “right to an explanation”. While traditional explainability methods—feature attributions, counterfactuals, surrogate models—and interpretable model classes provide valuable insights for engineers, they often fall short of delivering the contextual, conversational explanations that\r\nreal users expect. Large Language Models (LLMs) offer a promising new avenue for explanation due to their\r\nability to engage interactively, adapt to user needs, and translate technical outputs into more accessible reasoning. However, their tendencies toward hallucination, conflict avoidance, and oversimplification introduce\r\nserious risks when used as explanatory agents. This paper analyzes these opportunities and limitations, examines verification strategies for ensuring explanation fidelity, and situates LLM-generated explanations within\r\nbroader concerns about public trust. The paper concludes by outlining best practices and future research directions for building robust, verifiable, and human-aligned explanation systems." acknowledgement: "This work has been supported by the European Research Council under Grant No.: ERC-2020-AdG\r\n101020093. LLM–based tools have been used as\r\nwriting assistance to help improve presentation.\r\n" article_processing_charge: No author: - first_name: Filip full_name: Cano Cordoba, Filip id: 708cad98-e86a-11ef-8098-bdae2d7c6af1 last_name: Cano Cordoba orcid: 0000-0002-0783-904X citation: ama: 'Cano Cordoba F. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In: Proceedings of the 18th International Conference on Agents and Artificial Intelligence. Vol 5. Science and Technology Publications; 2026:4689-4696. doi:10.5220/0014483200004052' apa: 'Cano Cordoba, F. (2026). Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. In Proceedings of the 18th International Conference on Agents and Artificial Intelligence (Vol. 5, pp. 4689–4696). Marbella, Spain: Science and Technology Publications. https://doi.org/10.5220/0014483200004052' chicago: 'Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” In Proceedings of the 18th International Conference on Agents and Artificial Intelligence, 5:4689–96. Science and Technology Publications, 2026. https://doi.org/10.5220/0014483200004052.' ieee: 'F. Cano Cordoba, “Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants,” in Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Marbella, Spain, 2026, vol. 5, pp. 4689–4696.' ista: 'Cano Cordoba F. 2026. Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants. Proceedings of the 18th International Conference on Agents and Artificial Intelligence. ICAART: International Conference on Agents and Artificial Intelligence vol. 5, 4689–4696.' mla: 'Cano Cordoba, Filip. “Explaining Decisions One Conversation at a Time: Opportunities and Risks of LLMs as Explainability Assistants.” Proceedings of the 18th International Conference on Agents and Artificial Intelligence, vol. 5, Science and Technology Publications, 2026, pp. 4689–96, doi:10.5220/0014483200004052.' short: F. Cano Cordoba, in:, Proceedings of the 18th International Conference on Agents and Artificial Intelligence, Science and Technology Publications, 2026, pp. 4689–4696. conference: end_date: 2026-03-08 location: Marbella, Spain name: 'ICAART: International Conference on Agents and Artificial Intelligence' start_date: 2026-03-05 corr_author: '1' das_tickbox: '0' date_created: 2026-06-21T22:03:00Z date_published: 2026-04-01T00:00:00Z date_updated: 2026-06-24T08:37:00Z day: '01' department: - _id: ToHe doi: 10.5220/0014483200004052 ec_funded: 1 intvolume: ' 5' keyword: - Explainable AI - Large Language Models - Trust in AI language: - iso: eng main_file_link: - open_access: '1' url: https://filipcano.org/files/icaart26llm.pdf month: '04' oa: 1 oa_version: Accepted Version page: 4689-4696 project: - _id: 62781420-2b32-11ec-9570-8d9b63373d4d call_identifier: H2020 grant_number: '101020093' name: Vigilant Algorithmic Monitoring of Software publication: Proceedings of the 18th International Conference on Agents and Artificial Intelligence publication_identifier: eissn: - 2184-433X isbn: - '9789897587962' issn: - 2184-3589 publication_status: published publisher: Science and Technology Publications quality_controlled: '1' researchdata_availability: no scopus_import: '1' status: public supplementarymaterial: no title: 'Explaining decisions one conversation at a time: Opportunities and risks of LLMs as explainability assistants' type: conference user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 volume: 5 year: '2026' ... --- OA_place: publisher OA_type: hybrid PlanS_conform: '1' _id: '22105' abstract: - lang: eng text: Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein–protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labelling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a crystal structure of a GB1 variant reported in this work, reproduce these elevated barriers and reveal how the crystal restrains motions. acknowledged_ssus: - _id: NMR - _id: LifeSc acknowledgement: We thank N. R. Skrynnikov and O. O. Lebedenko (St. Petersburg) for insightful discussions and for performing exploratory MD simulations. We are grateful to T. Schubeis (Lyon) for advice on GB1 crystallization and R. Schmid for initial crystallization trials. We thank C. Mueller-Dieckmann for assistance with room-temperature X-ray crystallography data collection on beamline ID30B at the ESRF, which is acknowledged for providing beamtime through its In-House Research programme. We thank S. Falkner for assistance with constructing the structural model of the IgG:GB1 complex. We thank J. Lewandowski for providing feedback on the paper and granting access to backbone relaxation data of IgG:GB1T2Q and GB1T2Q microcrystals. This research was supported by the Scientific Service Units (SSU) of the Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities. We thank P. Rovó and M. V. Falcón for excellent support of the NMR facility. L.M.B. is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant number PR10660EAW01). C.C. acknowledges the European Research Council (grant project 101097272 ‘MilliInMicro’) and the Métropole du Grand Nancy (grant project ‘ARC’). BM07-FIP2 is supported by the French ANR PIA3 (France 2030) EquipEx+ project MAGNIFIX under grant agreement ANR-21-ESRE-0011.Open access funding provided by Institute of Science and Technology (IST Austria). article_processing_charge: Yes (via OA deal) article_type: original author: - first_name: Lea Marie full_name: Becker, Lea Marie id: 36336939-eb97-11eb-a6c2-c83f1214ca79 last_name: Becker orcid: 0000-0002-6401-5151 - first_name: Haohao full_name: Fu, Haohao last_name: Fu - first_name: Benjamin full_name: Tatman, Benjamin id: 71cda2f3-e604-11ee-a1df-da10587eda3f last_name: Tatman - first_name: Matthias full_name: Dreydoppel, Matthias last_name: Dreydoppel - first_name: Anna full_name: Kapitonova, Anna id: 9fb2a840-89e1-11ee-a8b7-cc5c7ba62471 last_name: Kapitonova - first_name: Daniel full_name: Balazs, Daniel id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E last_name: Balazs orcid: 0000-0001-7597-043X - first_name: Ulrich full_name: Weininger, Ulrich last_name: Weininger - first_name: Sylvain full_name: Engilberge, Sylvain last_name: Engilberge - first_name: Christophe full_name: Chipot, Christophe last_name: Chipot - first_name: Paul full_name: Schanda, Paul id: 7B541462-FAF6-11E9-A490-E8DFE5697425 last_name: Schanda orcid: 0000-0002-9350-7606 citation: ama: Becker LM, Fu H, Tatman B, et al. Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. Nature Chemistry. 2026. doi:10.1038/s41557-026-02155-0 apa: Becker, L. M., Fu, H., Tatman, B., Dreydoppel, M., Kapitonova, A., Balazs, D., … Schanda, P. (2026). Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. Nature Chemistry. Springer Nature. https://doi.org/10.1038/s41557-026-02155-0 chicago: Becker, Lea Marie, Haohao Fu, Benjamin Tatman, Matthias Dreydoppel, Anna Kapitonova, Daniel Balazs, Ulrich Weininger, Sylvain Engilberge, Christophe Chipot, and Paul Schanda. “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Nature Chemistry. Springer Nature, 2026. https://doi.org/10.1038/s41557-026-02155-0. ieee: L. M. Becker et al., “Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes,” Nature Chemistry. Springer Nature, 2026. ista: Becker LM, Fu H, Tatman B, Dreydoppel M, Kapitonova A, Balazs D, Weininger U, Engilberge S, Chipot C, Schanda P. 2026. Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes. Nature Chemistry. mla: Becker, Lea Marie, et al. “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Nature Chemistry, Springer Nature, 2026, doi:10.1038/s41557-026-02155-0. short: L.M. Becker, H. Fu, B. Tatman, M. Dreydoppel, A. Kapitonova, D. Balazs, U. Weininger, S. Engilberge, C. Chipot, P. Schanda, Nature Chemistry (2026). corr_author: '1' das_tickbox: '1' dataavailabilitystatement: The cryo and room-temperature crystal structures of GB1QDD are deposited at the PDB under the access codes 9I2I and 9T8Z, respectively. The solid-state NMR backbone assignment of GB1QDD is deposited at the BMRB under the access code 53330. NMR spectra, analysis scripts and raw data are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-20641)120. Files to reproduce the enhanced-sampling MD simulations are publicly available at the ISTA research explorer (https://doi.org/10.15479/AT-ISTA-21145)121. date_created: 2026-06-21T22:03:01Z date_published: 2026-06-10T00:00:00Z date_updated: 2026-06-24T08:47:58Z day: '10' ddc: - '540' department: - _id: PaSc - _id: LifeSc doi: 10.1038/s41557-026-02155-0 external_id: pmid: - '42271006' has_accepted_license: '1' language: - iso: eng main_file_link: - open_access: '1' url: https://doi.org/10.1038/s41557-026-02155-0 month: '06' oa: 1 oa_version: Published Version pmid: 1 project: - _id: 7be609c4-9f16-11ee-852c-85015ce2b9b0 grant_number: '26777' name: Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches publication: Nature Chemistry publication_identifier: eissn: - '17554349' issn: - '17554330' publication_status: epub_ahead publisher: Springer Nature quality_controlled: '1' related_material: record: - id: '20641' relation: research_data status: public - id: '21145' relation: research_data status: public researchdata_availability: yes scopus_import: '1' status: public supplementarymaterial: yes title: Aromatic ring flips reveal reshaping of protein dynamics in crystals and complexes 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' ... --- _id: '21145' abstract: - lang: eng text: 'Protein conformational energy landscapes are shaped not only by intramolecular interactions but also by their environment. In protein crystals and protein-protein complexes, intermolecular contacts alter this energy landscape, but the exact nature of this alteration is difficult to decipher. Understanding how the crystal lattice affects protein dynamics is crucial for crystallography-based studies of motion, yet its influence on collective motions remains unclear. Aromatic ring flips in the hydrophobic core represent sensitive probes of such dynamics. Here, we compare the kinetics of aromatic ring flips in the protein GB1 in crystals, in complex with its binding partner IgG, and in solution, combining advanced isotope labeling with quantitative NMR methods. We show that rings in the core flip nearly a thousand times less frequently in crystals than in solution. Enhanced-sampling molecular dynamics simulations, based on a new crystal structure, reproduce these elevated barriers and reveal how the crystal restrains motions. ' acknowledged_ssus: - _id: NMR - _id: LifeSc acknowledgement: "We thank Nikolai R. Skrynnikov and Olga O. Lebedenko (St. Petersburg) for insightful discussions and for performing exploratory MD simulations. We are grateful to Tobias Schubeis (Lyon) for advice with GB1 crystallization, and Rebecca Schmid for initial crystallization trials.\r\nWe thank Sebastian Falkner for assistance with constructing the structural model of the IgG:GB1 complex.\r\nThis research was supported by the Scientific Service Units (SSU) of Institute of Science and Technology Austria (ISTA) through resources provided by the Nuclear Magnetic Resonance and the Lab Support Facilities. We thank Petra Rovó and Margarita Valhondo Falcón for excellent support of the NMR facility.\r\nLea M. Becker is recipient of a DOC fellowship of the Austrian Academy of Sciences at the Institute of Science and Technology Austria (grant no. PR10660EAW01). Christophe Chipot acknowledges the European Research Council (grant project 101097272 ``MilliInMicro'') and the Métropole du Grand Nancy (grant project ``ARC''). BM07-FIP2 is supported by the French ANR PIA3 (France 2030) EquipEx+ project MAGNIFIX under grant agreement ANR-21-ESRE-0011." article_processing_charge: No author: - first_name: Lea Marie full_name: Becker, Lea Marie id: 36336939-eb97-11eb-a6c2-c83f1214ca79 last_name: Becker orcid: 0000-0002-6401-5151 - first_name: Paul full_name: Schanda, Paul id: 7B541462-FAF6-11E9-A490-E8DFE5697425 last_name: Schanda orcid: 0000-0002-9350-7606 - first_name: Christophe full_name: Chipot, Christophe last_name: Chipot citation: ama: Becker LM, Schanda P, Chipot C. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” 2026. doi:10.15479/AT-ISTA-21145 apa: Becker, L. M., Schanda, P., & Chipot, C. (2026). Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria. https://doi.org/10.15479/AT-ISTA-21145 chicago: Becker, Lea Marie, Paul Schanda, and Christophe Chipot. “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026. https://doi.org/10.15479/AT-ISTA-21145. ieee: L. M. Becker, P. Schanda, and C. Chipot, “Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.’” Institute of Science and Technology Austria, 2026. ista: Becker LM, Schanda P, Chipot C. 2026. Additional Data for ‘Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes’, Institute of Science and Technology Austria, 10.15479/AT-ISTA-21145. mla: Becker, Lea Marie, et al. Additional Data for “Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes.” Institute of Science and Technology Austria, 2026, doi:10.15479/AT-ISTA-21145. short: L.M. Becker, P. Schanda, C. Chipot, (2026). contributor: - contributor_type: researcher first_name: Haohao last_name: Fu - contributor_type: researcher first_name: Benjamin id: 71cda2f3-e604-11ee-a1df-da10587eda3f last_name: Tatman - contributor_type: researcher first_name: Matthias last_name: Dreydoppel - contributor_type: researcher first_name: Anna id: 9fb2a840-89e1-11ee-a8b7-cc5c7ba62471 last_name: Kapitonova - contributor_type: researcher first_name: Daniel id: 302BADF6-85FC-11EA-9E3B-B9493DDC885E last_name: Balazs orcid: 0000-0001-7597-043X - contributor_type: researcher first_name: Ulrich last_name: Weininger - contributor_type: researcher first_name: Sylvain last_name: Engilberge corr_author: '1' date_created: 2026-02-05T13:54:39Z date_published: 2026-02-09T00:00:00Z date_updated: 2026-06-24T08:47:57Z day: '09' ddc: - '572' department: - _id: GradSch - _id: PaSc doi: 10.15479/AT-ISTA-21145 file: - access_level: open_access checksum: 02a419cce8cea450bc952f35488d2df5 content_type: text/plain creator: lbecker date_created: 2026-02-05T13:52:37Z date_updated: 2026-02-05T13:52:37Z file_id: '21146' file_name: README.txt file_size: 4263 relation: table_of_contents - access_level: open_access checksum: b0b82b1aa73985b0b308a3fa52d21aea content_type: application/zip creator: lbecker date_created: 2026-02-05T13:52:41Z date_updated: 2026-02-05T13:52:41Z file_id: '21147' file_name: Research_Data.zip file_size: 50647107 relation: main_file success: 1 file_date_updated: 2026-02-05T13:52:41Z has_accepted_license: '1' month: '02' oa: 1 oa_version: Published Version project: - _id: 7be609c4-9f16-11ee-852c-85015ce2b9b0 grant_number: '26777' name: Exploring protein dynamics by solid-state MAS NMR through specific labeling approaches publisher: Institute of Science and Technology Austria related_material: record: - id: '20641' relation: earlier_version status: public - id: '22105' relation: used_in_publication status: public status: public title: Additional Data for "Aromatic Ring Flips Reveal Reshaping of Protein Dynamics in Crystals and Complexes" tmp: image: /images/cc_by_nc.png legal_code_url: https://creativecommons.org/licenses/by-nc/4.0/legalcode name: Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0) short: CC BY-NC (4.0) type: research_data user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87 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: 6th Conference on Information-Theoretic Cryptography. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:10.4230/LIPIcs.ITC.2025.4' apa: 'Pietrzak, K. Z., & Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In 6th Conference on Information-Theoretic Cryptography (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ITC.2025.4' chicago: Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In 6th Conference on Information-Theoretic Cryptography, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. https://doi.org/10.4230/LIPIcs.ITC.2025.4. ieee: K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in 6th Conference on Information-Theoretic Cryptography, 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.” 6th Conference on Information-Theoretic Cryptography, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:10.4230/LIPIcs.ITC.2025.4. 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: 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. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. 2025;155(5):1646-1660. doi:10.1017/prm.2024.7' apa: 'Naskręcki, B., & Verzobio, M. (2025). Common valuations of division polynomials. Proceedings of the Royal Society of Edinburgh Section A: Mathematics. Cambridge University Press. https://doi.org/10.1017/prm.2024.7' chicago: 'Naskręcki, Bartosz, and Matteo Verzobio. “Common Valuations of Division Polynomials.” Proceedings of the Royal Society of Edinburgh Section A: Mathematics. Cambridge University Press, 2025. https://doi.org/10.1017/prm.2024.7.' ieee: 'B. Naskręcki and M. Verzobio, “Common valuations of division polynomials,” Proceedings of the Royal Society of Edinburgh Section A: Mathematics, 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.” Proceedings of the Royal Society of Edinburgh Section A: Mathematics, vol. 155, no. 5, Cambridge University Press, 2025, pp. 1646–60, doi:10.1017/prm.2024.7.' 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. Neural Computing and Applications. 2025;37:24669–24683. doi:10.1007/s00521-024-10616-1 apa: Súkeník, P., & Lampert, C. (2025). Generalization in multi-objective machine learning. Neural Computing and Applications. Springer Nature. https://doi.org/10.1007/s00521-024-10616-1 chicago: Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” Neural Computing and Applications. Springer Nature, 2025. https://doi.org/10.1007/s00521-024-10616-1. ieee: P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” Neural Computing and Applications, 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.” Neural Computing and Applications, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:10.1007/s00521-024-10616-1. 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: 42nd International Conference on Machine Learning. Vol 267. ML Research Press; 2025:55556-55590.' apa: 'Sieberling, O., Kuznedelev, D., Kurtic, E., & Alistarh, D.-A. (2025). EvoPress: Accurate dynamic model compression via evolutionary search. In 42nd International Conference on Machine Learning (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 42nd International Conference on Machine Learning, 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 42nd International Conference on Machine Learning, 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.” 42nd International Conference on Machine Learning, 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: 42nd International Conference on Machine Learning. 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., & Cevher, V. (2025). Layer-wise quantization for quantized optimistic dual averaging. In 42nd International Conference on Machine Learning (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 42nd International Conference on Machine Learning, 267:46026–72. ML Research Press, 2025. ieee: A. D. Nguyen et al., “Layer-wise quantization for quantized optimistic dual averaging,” in 42nd International Conference on Machine Learning, 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.” 42nd International Conference on Machine Learning, 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. Journal of Fractal Geometry. 2025. doi:10.4171/jfg/177 apa: Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry. EMS Press. https://doi.org/10.4171/jfg/177 chicago: Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” Journal of Fractal Geometry. EMS Press, 2025. https://doi.org/10.4171/jfg/177. ieee: M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” Journal of Fractal Geometry. 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.” Journal of Fractal Geometry, EMS Press, 2025, doi:10.4171/jfg/177. 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' ...