[{"page":"1047-1083","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","call_identifier":"H2020"}],"oa_version":"Published Version","intvolume":"        31","file_date_updated":"2026-07-23T05:50:09Z","article_processing_charge":"Yes (via OA deal)","volume":31,"_id":"17437","supplementarymaterial":"no","publisher":"Springer Nature","publication_identifier":{"issn":["1083-4362"],"eissn":["1531-586X"]},"date_published":"2026-03-01T00:00:00Z","citation":{"apa":"Vernet, T. (2026). Rational singularities for moment maps of totally negative quivers. <i>Transformation Groups</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00031-024-09873-0\">https://doi.org/10.1007/s00031-024-09873-0</a>","ama":"Vernet T. Rational singularities for moment maps of totally negative quivers. <i>Transformation Groups</i>. 2026;31:1047-1083. doi:<a href=\"https://doi.org/10.1007/s00031-024-09873-0\">10.1007/s00031-024-09873-0</a>","ista":"Vernet T. 2026. Rational singularities for moment maps of totally negative quivers. Transformation Groups. 31, 1047–1083.","short":"T. Vernet, Transformation Groups 31 (2026) 1047–1083.","ieee":"T. Vernet, “Rational singularities for moment maps of totally negative quivers,” <i>Transformation Groups</i>, vol. 31. Springer Nature, pp. 1047–1083, 2026.","chicago":"Vernet, Tanguy. “Rational Singularities for Moment Maps of Totally Negative Quivers.” <i>Transformation Groups</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00031-024-09873-0\">https://doi.org/10.1007/s00031-024-09873-0</a>.","mla":"Vernet, Tanguy. “Rational Singularities for Moment Maps of Totally Negative Quivers.” <i>Transformation Groups</i>, vol. 31, Springer Nature, 2026, pp. 1047–83, doi:<a href=\"https://doi.org/10.1007/s00031-024-09873-0\">10.1007/s00031-024-09873-0</a>."},"corr_author":"1","scopus_import":"1","quality_controlled":"1","external_id":{"isi":["001287455300001"]},"doi":"10.1007/s00031-024-09873-0","has_accepted_license":"1","author":[{"first_name":"Tanguy","id":"19f1e3bf-c59a-11ee-a1af-ed269948817b","last_name":"Vernet","full_name":"Vernet, Tanguy"}],"abstract":[{"text":"We prove that the zero-fiber of the moment map of a totally negative quiver has rational singularities. Our proof consists in generalizing dimension bounds on jet spaces of this fiber, which were introduced by Budur. We also transfer the rational singularities property to other moduli spaces of objects in 2-Calabi-Yau categories, based on recent work of Davison. This has interesting arithmetic applications on quiver moment maps and moduli spaces of objects in 2-Calabi-Yau categories. First, we generalize results of Wyss on the asymptotic behaviour of counts of jets of quiver moment maps over finite fields. Moreover, we interpret the limit of counts of jets on a given moduli space as its p-adic volume under a canonical measure analogous to the measure built by Carocci, Orecchia and Wyss on certain moduli spaces of coherent sheaves.","lang":"eng"}],"title":"Rational singularities for moment maps of totally negative quivers","ec_funded":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2026","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","article_type":"original","type":"journal_article","file":[{"file_id":"22385","content_type":"application/pdf","file_name":"2026_TransformationGroups_Vernet.pdf","success":1,"date_created":"2026-07-23T05:50:09Z","checksum":"8985b4154b730284d3412ddc9e55d965","relation":"main_file","creator":"dernst","file_size":912029,"date_updated":"2026-07-23T05:50:09Z","access_level":"open_access"}],"OA_place":"publisher","date_updated":"2026-07-23T05:51:07Z","oa":1,"month":"03","language":[{"iso":"eng"}],"das_tickbox":"1","license":"https://creativecommons.org/licenses/by/4.0/","acknowledgement":"I would like to warmly thank Dimitri Wyss for his guidance and supervision and Nero Budur for helpful discussions and answering all my questions on his previous works. I would also like to thank Francesca Carocci, Ben Davison, Lucien Hennecart and Olivier Schiffmann for helpful remarks and discussions during the writing of this paper. Finally, I would like to thank the anonymous referees for their careful reading and suggesting improvements in the exposition.\r\nOpen access funding provided by Institute of Science and Technology (IST Austria). This work was supported by the Swiss National Science Foundation [No. 196960]. This project has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","department":[{"_id":"TaHa"}],"dataavailabilitystatement":"Not applicable.","isi":1,"OA_type":"hybrid","date_created":"2024-08-18T22:01:04Z","publication":"Transformation Groups","status":"public","PlanS_conform":"1","mathsc":["14B05","14D23","14G20","16G20"],"ddc":["510"],"researchdata_availability":"not applicable"},{"article_processing_charge":"No","volume":22,"supplementarymaterial":"yes","_id":"20973","publication_identifier":{"issn":["1613-6810"],"eissn":["1613-6829"]},"date_published":"2026-05-04T00:00:00Z","citation":{"ista":"Meng W, Li M, Wang Q, Song P, Yang X, Wang WJ, Hong M, Ibáñez M, Cabot A, Zhang Y, Liu Y, Lim KH. 2026. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. Small. 22(25), e13035.","apa":"Meng, W., Li, M., Wang, Q., Song, P., Yang, X., Wang, W. J., … Lim, K. H. (2026). Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. <i>Small</i>. Wiley. <a href=\"https://doi.org/10.1002/smll.202513035\">https://doi.org/10.1002/smll.202513035</a>","ama":"Meng W, Li M, Wang Q, et al. Efficient near room temperature thermoelectric cooling and power generation with CuAgSe. <i>Small</i>. 2026;22(25). doi:<a href=\"https://doi.org/10.1002/smll.202513035\">10.1002/smll.202513035</a>","short":"W. Meng, M. Li, Q. Wang, P. Song, X. Yang, W.J. Wang, M. Hong, M. Ibáñez, A. Cabot, Y. Zhang, Y. Liu, K.H. Lim, Small 22 (2026).","ieee":"W. Meng <i>et al.</i>, “Efficient near room temperature thermoelectric cooling and power generation with CuAgSe,” <i>Small</i>, vol. 22, no. 25. Wiley, 2026.","chicago":"Meng, Weite, Mingquan Li, Qingyue Wang, Pingan Song, Xuan Yang, Wen Jun Wang, Min Hong, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” <i>Small</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/smll.202513035\">https://doi.org/10.1002/smll.202513035</a>.","mla":"Meng, Weite, et al. “Efficient near Room Temperature Thermoelectric Cooling and Power Generation with CuAgSe.” <i>Small</i>, vol. 22, no. 25, e13035, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/smll.202513035\">10.1002/smll.202513035</a>."},"publisher":"Wiley","intvolume":"        22","oa_version":"None","doi":"10.1002/smll.202513035","author":[{"full_name":"Meng, Weite","last_name":"Meng","first_name":"Weite"},{"first_name":"Mingquan","full_name":"Li, Mingquan","last_name":"Li"},{"last_name":"Wang","full_name":"Wang, Qingyue","first_name":"Qingyue"},{"full_name":"Song, Pingan","last_name":"Song","first_name":"Pingan"},{"full_name":"Yang, Xuan","last_name":"Yang","first_name":"Xuan"},{"first_name":"Wen Jun","last_name":"Wang","full_name":"Wang, Wen Jun"},{"first_name":"Min","full_name":"Hong, Min","last_name":"Hong"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria","orcid":"0000-0001-5013-2843"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"},{"last_name":"Zhang","full_name":"Zhang, Yu","first_name":"Yu"},{"full_name":"Liu, Yu","last_name":"Liu","first_name":"Yu"},{"full_name":"Lim, Khak Ho","last_name":"Lim","first_name":"Khak Ho"}],"title":"Efficient near room temperature thermoelectric cooling and power generation with CuAgSe","abstract":[{"text":"CuAgSe-based materials are attractive for low-temperature thermoelectric (TE) applications but are limited by bipolar conduction and relatively high thermal conductivity. Herein, we report a ligand-free aqueous synthesis of Te-doped CuAgSe (CuAgSe1-xTex), where structural and electronic modulation improve carrier transport and suppress phonon propagation. Ex-situ time-resolved X-ray diffraction reveals a spontaneous growth mechanism, while density functional theory calculations show that Te-5s and 5p orbitals hybridization generates localized states and an asymmetric density of states, thereby enhancing the Seebeck coefficient. Electron microscopy and strain analyses confirm that Te-doping introduces a high density of lattice dislocations and grain boundaries, leading to a reduced lattice thermal conductivity of 0.11 W m−1K−1 at 443 K. These synergistic effects translate into device-level performance—the first integrated CuAgSe thermoelectric modules, exhibit a maximum cooling temperature difference of 27.3 K, and power density of 0.34 W cm−2 with a conversion efficiency of 3.6% at a modest temperature gradient of 136 K. These results demonstrate that CuAgSe1-xTex enables efficient energy harvesting and localized cooling under small temperature gradient, underscoring the importance of structural and electronic design beyond conventional zT benchmarks.","lang":"eng"}],"issue":"25","scopus_import":"1","quality_controlled":"1","external_id":{"pmid":["41470065"]},"language":[{"iso":"eng"}],"date_updated":"2026-07-23T09:42:39Z","month":"05","acknowledgement":"K.H.L. acknowledges financial support from the National Natural Science Foundation of China (NSFC) (Grant Number 22208293) and the National Foreign Expert Project (Y20240175). Y.L. acknowledges funding from the NSFC (Grant Number 22209034), the Innovation and Entrepreneurship Project of Overseas Returnees in Anhui Province (Grant Number 2022LCX002), and the Fundamental Research Funds for the Central Universities (JZ2024HGTB0239). Y.Z. acknowledges funding from the NSFC (Grant Number 52502313) and Wenzhou Basic Scientific Research Project (Grant Number G20240034). Q. W. acknowledges financial support from the NSFC (Grant Number 22208292), the High-Level Overseas-Educated Talents Return Program, and the “Pioneer” and “Leading Goose” R&D Program of Zhejiang [2025C04021]. K.H.L., Q. W., and X. Y. also acknowledge the Research Funds of the Institute of Zhejiang University-Quzhou (Grants No. IZQ2022RCZX101, IZQ2021RCZX003, IZQ2021RCZX002, and IZQ2024KJ0004). M.H. acknowledges the funding from the Australian Research Council and the iLAuNCH Trailblazer, Department of Education, Australia. M.H. acknowledges the computational support from the National Computational Infrastructure (NCI), Australia, and Pawsey Supercomputing Centre, Australia.","das_tickbox":"1","department":[{"_id":"MaIb"}],"pmid":1,"dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","year":"2026","day":"04","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"journal_article","article_type":"original","publication_status":"published","researchdata_availability":"upon request","article_number":"e13035","date_created":"2026-01-11T23:01:34Z","OA_type":"closed access","status":"public","publication":"Small"},{"article_number":"12","researchdata_availability":"no","ddc":["000"],"PlanS_conform":"1","publication":"ACM Transactions on Computer Systems","status":"public","date_created":"2026-01-20T10:14:23Z","OA_type":"hybrid","department":[{"_id":"KrPi"}],"das_tickbox":"0","acknowledgement":"We thank the ACM TOCS Editors and the reviewers for their help in improving the manuscript. This work was partially supported by CAPES - Brazil (Coordenação de Aperfeiçoamento de Pessoal de Nível Superior) and byFundação para a Ciência e Tecnologia (FCT) under project UIDB/50021/2020 and grant 2020.05270.BD, and via project COSMOS (via the OE with ref. PTDC/EEI-COM/29271/2017, via the łPrograma Operacional Regional de Lisboa na sua componente FEDER” with ref. Lisboa-01-0145-FEDER-029271) and project Angainor with reference LISBOA-01-0145-FEDER-031456, grant agreement number 952226, and project GLOG, with reference LISBOA2030-FEDER-00771200, and project BIG (Enhancing the research and innovation potential of Tecnico through blockchain technologies and design Innovation for social Good), and project ScalableCosmosConsensus, and the Austrian Science Fund (FWF) SFB project SpyCoDe F8502 and the Vienna Science and Technology Fund (WWTF) project SCALE2 CT22-045","date_updated":"2026-07-23T10:07:17Z","oa":1,"language":[{"iso":"eng"}],"month":"05","OA_place":"publisher","file":[{"date_created":"2026-07-23T10:04:06Z","content_type":"application/pdf","file_id":"22392","file_name":"2026_TransCompSyst_Neiheiser.pdf","success":1,"access_level":"open_access","file_size":676867,"date_updated":"2026-07-23T10:04:06Z","checksum":"b64822f3d2bcac3c68c887ced45a6008","relation":"main_file","creator":"dernst"}],"article_type":"original","publication_status":"published","type":"journal_article","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","title":"Kauri: BFT consensus with pipelined tree-based dissemination and aggregation","abstract":[{"text":"With the growing interest in blockchains, permissioned approaches to consensus have received increasing attention. Unfortunately, the BFT consensus algorithms that are the backbone of most of these blockchains scale poorly and offer limited throughput. In fact, many state-of-the-art BFT consensus algorithms require a single leader process to receive and validate votes from a quorum of processes and then broadcast the result, which is inherently non-scalable. Recent approaches avoid this bottleneck by using dissemination/aggregation trees to propagate values and collect and validate votes. However, the use of trees increases the round latency, which limits the throughput for deeper trees. In this paper we propose Kauri, a BFT communication abstraction that sustains high throughput as the system size grows by leveraging a novel pipelining technique to perform scalable dissemination and aggregation on trees. Furthermore, when the number of faults is moderate (arguably the most common case in practice), our construction is able to recover from faults in an optimal number of reconfiguration steps. We implemented and experimentally evaluated Kauri with up to 800 processes. Our results show that Kauri outperforms the throughput of state-of-the-art permissioned blockchain protocols, by up to 58x without compromising latency. Interestingly, in some cases, the parallelization provided by Kauri can also decrease the latency.","lang":"eng"}],"keyword":["Distributed systems","byzantine fault tolerance","blockchain","vote aggregation","pipelining"],"has_accepted_license":"1","author":[{"orcid":"0000-0001-7227-8309","first_name":"Ray","last_name":"Neiheiser","id":"f09651b9-fec0-11ec-b5d8-934aff0e52a4","full_name":"Neiheiser, Ray"},{"full_name":"Matos, Miguel","last_name":"Matos","first_name":"Miguel"},{"first_name":"Luis","full_name":"Rodrigues, Luis","last_name":"Rodrigues"}],"doi":"10.1145/3769423","scopus_import":"1","corr_author":"1","quality_controlled":"1","issue":"2","publisher":"Association for Computing Machinery","publication_identifier":{"eissn":["1557-7333"],"issn":["0734-2071"]},"date_published":"2026-05-01T00:00:00Z","citation":{"apa":"Neiheiser, R., Matos, M., &#38; Rodrigues, L. (2026). Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>","ama":"Neiheiser R, Matos M, Rodrigues L. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. <i>ACM Transactions on Computer Systems</i>. 2026;44(2). doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>","ista":"Neiheiser R, Matos M, Rodrigues L. 2026. Kauri: BFT consensus with pipelined tree-based dissemination and aggregation. ACM Transactions on Computer Systems. 44(2), 12.","chicago":"Neiheiser, Ray, Miguel Matos, and Luis Rodrigues. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>. Association for Computing Machinery, 2026. <a href=\"https://doi.org/10.1145/3769423\">https://doi.org/10.1145/3769423</a>.","ieee":"R. Neiheiser, M. Matos, and L. Rodrigues, “Kauri: BFT consensus with pipelined tree-based dissemination and aggregation,” <i>ACM Transactions on Computer Systems</i>, vol. 44, no. 2. Association for Computing Machinery, 2026.","short":"R. Neiheiser, M. Matos, L. Rodrigues, ACM Transactions on Computer Systems 44 (2026).","mla":"Neiheiser, Ray, et al. “Kauri: BFT Consensus with Pipelined Tree-Based Dissemination and Aggregation.” <i>ACM Transactions on Computer Systems</i>, vol. 44, no. 2, 12, Association for Computing Machinery, 2026, doi:<a href=\"https://doi.org/10.1145/3769423\">10.1145/3769423</a>."},"_id":"21017","supplementarymaterial":"no","volume":44,"article_processing_charge":"Yes (via OA deal)","oa_version":"Published Version","intvolume":"        44","file_date_updated":"2026-07-23T10:04:06Z","project":[{"_id":"34a1b658-11ca-11ed-8bc3-c75229f0241e","name":"Interface Theory for Security and Privacy","grant_number":"F8502"},{"_id":"7bdd2f70-9f16-11ee-852c-b7950bc6d277","name":"SeCure, privAte, and interoperabLe layEr 2","grant_number":"ICT22-045"}]},{"researchdata_availability":"no","date_created":"2025-06-22T22:02:07Z","OA_type":"hybrid","publication":"Discrete & Computational Geometry","status":"public","PlanS_conform":"1","related_material":{"link":[{"relation":"erratum","url":"https://doi.org/10.1007/s00454-025-00759-w"}],"record":[{"relation":"earlier_version","status":"public","id":"18917"},{"status":"public","id":"20339","relation":"dissertation_contains"}]},"ddc":["500"],"arxiv":1,"date_updated":"2026-07-23T11:14:46Z","oa":1,"month":"06","language":[{"iso":"eng"}],"das_tickbox":"0","acknowledgement":"Work by BA was supported by NSF grants CCF 15-40656 and CCF 20-08551, and by grant 2014/170 from the US-Israel Binational Science Foundation. Part of this research was conducted while BA was visiting ISTA in the summers of 2022 and 2023. The visit of BA to ISTA in the summer of 2022 was supported by an ISTA Visiting Professorship. Research of BA also partially supported by ERC grant no. 882971, “GeoScape,” and by the Erdős Center. Work by AB was supported by Australian Research Council grant DP220102212. Work by IR was supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551. BA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work. Open Access funding enabled and organized by CAUL and its Member Institutions.","department":[{"_id":"UlWa"}],"isi":1,"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","article_type":"original","publication_status":"published","type":"journal_article","file":[{"date_created":"2026-07-23T11:14:05Z","success":1,"file_name":"2026_DiscreteCompGeom_Aronov.pdf","file_id":"22395","content_type":"application/pdf","file_size":525281,"access_level":"open_access","date_updated":"2026-07-23T11:14:05Z","creator":"dernst","relation":"main_file","checksum":"a32774a0d14f46cafbd77bfb9d9ac4b6"}],"OA_place":"publisher","doi":"10.1007/s00454-025-00739-0","author":[{"full_name":"Aronov, Boris","last_name":"Aronov","first_name":"Boris"},{"last_name":"Basit","full_name":"Basit, Abdul","first_name":"Abdul"},{"full_name":"Ramesh, Indu","last_name":"Ramesh","first_name":"Indu"},{"last_name":"Tasinato","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","full_name":"Tasinato, Gianluca","first_name":"Gianluca"},{"orcid":"0000-0002-1494-0568","first_name":"Uli","last_name":"Wagner","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","full_name":"Wagner, Uli"}],"has_accepted_license":"1","title":"Eight-partitioning points in 3D, and efficiently too","abstract":[{"text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in R^3\r\n consists of three planes that divide the space into 8 octants, such that each open octant contains at most 1/8 of the points (respectively, of the mass). In 1966, Hadwiger showed that any mass distribution in R^3 admits an eight-partition; moreover, one can prescribe the normal direction of one of the three planes. The analogous result for finite point sets follows by a standard limit argument. We prove the following variant of this result: any mass distribution (or point set) in R^3 admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction. Moreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in R^3 (with prescribed normal direction of one of the planes) in time O(n^7/3). A preliminary version of this work appeared in SoCG’24 (Aronov et al., 40th International Symposium on Computational Geometry, 2024).","lang":"eng"}],"quality_controlled":"1","scopus_import":"1","external_id":{"arxiv":["2403.02627"],"isi":["001506904300001"]},"article_processing_charge":"Yes (via OA deal)","volume":75,"_id":"19860","supplementarymaterial":"yes","publisher":"Springer Nature","citation":{"mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>Discrete &#38; Computational Geometry</i>, vol. 75, Springer Nature, 2026, pp. 1331–55, doi:<a href=\"https://doi.org/10.1007/s00454-025-00739-0\">10.1007/s00454-025-00739-0</a>.","ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” <i>Discrete &#38; Computational Geometry</i>, vol. 75. Springer Nature, pp. 1331–1355, 2026.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, Discrete &#38; Computational Geometry 75 (2026) 1331–1355.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>Discrete &#38; Computational Geometry</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00454-025-00739-0\">https://doi.org/10.1007/s00454-025-00739-0</a>.","ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2026. Eight-partitioning points in 3D, and efficiently too. Discrete &#38; Computational Geometry. 75, 1331–1355.","ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. <i>Discrete &#38; Computational Geometry</i>. 2026;75:1331-1355. doi:<a href=\"https://doi.org/10.1007/s00454-025-00739-0\">10.1007/s00454-025-00739-0</a>","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2026). Eight-partitioning points in 3D, and efficiently too. <i>Discrete &#38; Computational Geometry</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00454-025-00739-0\">https://doi.org/10.1007/s00454-025-00739-0</a>"},"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"date_published":"2026-06-01T00:00:00Z","page":"1331-1355","intvolume":"        75","oa_version":"Published Version","file_date_updated":"2026-07-23T11:14:05Z"},{"doi":"10.1007/s00222-025-01397-y","has_accepted_license":"1","author":[{"full_name":"Koval, Illya","last_name":"Koval","id":"2eed1f3b-896a-11ed-bdf8-93c7c4bf159e","first_name":"Illya"}],"abstract":[{"text":"The Birkhoff conjecture says that the boundary of a strictly convex integrable billiard table is necessarily an ellipse. In this article, we consider a stronger notion of integrability, namely, integrability close to the boundary, and prove a local version of this conjecture: a small perturbation of almost every ellipse that preserves integrability near the boundary, is itself an ellipse. We apply this result to study local spectral uniqueness of ellipses using the connection between the wave trace of the Laplacian and the dynamics near the boundary and establish local uniqueness for almost all of them.","lang":"eng"}],"title":"Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse","ec_funded":1,"quality_controlled":"1","corr_author":"1","scopus_import":"1","external_id":{"arxiv":["2111.12171"]},"article_processing_charge":"Yes (via OA deal)","volume":244,"_id":"14278","supplementarymaterial":"yes","publisher":"Springer Nature","date_published":"2026-04-01T00:00:00Z","citation":{"mla":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” <i>Inventiones Mathematicae</i>, vol. 244, Springer Nature, 2026, pp. 221–98, doi:<a href=\"https://doi.org/10.1007/s00222-025-01397-y\">10.1007/s00222-025-01397-y</a>.","ieee":"I. Koval, “Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse,” <i>Inventiones Mathematicae</i>, vol. 244. Springer Nature, pp. 221–298, 2026.","short":"I. Koval, Inventiones Mathematicae 244 (2026) 221–298.","chicago":"Koval, Illya. “Local Strong Birkhoff Conjecture and Local Spectral Rigidity of Almost Every Ellipse.” <i>Inventiones Mathematicae</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s00222-025-01397-y\">https://doi.org/10.1007/s00222-025-01397-y</a>.","ama":"Koval I. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. <i>Inventiones Mathematicae</i>. 2026;244:221-298. doi:<a href=\"https://doi.org/10.1007/s00222-025-01397-y\">10.1007/s00222-025-01397-y</a>","apa":"Koval, I. (2026). Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. <i>Inventiones Mathematicae</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00222-025-01397-y\">https://doi.org/10.1007/s00222-025-01397-y</a>","ista":"Koval I. 2026. Local strong Birkhoff conjecture and local spectral rigidity of almost every ellipse. Inventiones Mathematicae. 244, 221–298."},"publication_identifier":{"eissn":["1432-1297"],"issn":["0020-9910"]},"page":"221-298","project":[{"call_identifier":"H2020","name":"Spectral rigidity and integrability for billiards and geodesic flows","grant_number":"885707","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A"}],"intvolume":"       244","oa_version":"Published Version","file_date_updated":"2026-07-23T10:55:24Z","researchdata_availability":"no","date_created":"2023-09-06T08:35:43Z","OA_type":"hybrid","publication":"Inventiones Mathematicae","status":"public","PlanS_conform":"1","mathsc":["37C83","35J05","37J70","74J25"],"arxiv":1,"ddc":["510"],"date_updated":"2026-07-23T10:58:59Z","month":"04","language":[{"iso":"eng"}],"oa":1,"das_tickbox":"0","acknowledgement":"The author acknowledges the partial support of the European Research Council Grant #885707. He also thanks Vadim Kaloshin for proposing the idea of the project and greatly aiding the implementation. The author is also grateful to Hamid Hezari, Amir Vig, Steve Zelditch, Comlan E. Koudjinan, Corentin Fierobe, Ngo Nhok Tkhai Shon and Roman Sarapin for useful discussions. The author also acknowledges partial support of ISTern summer program. The project started in the summer of 2021, when the author was an intern at ISTA. Open access funding provided by Institute of Science and Technology (IST Austria).","department":[{"_id":"GradSch"},{"_id":"VaKa"}],"tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2026","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","article_type":"original","type":"journal_article","file":[{"checksum":"487fa9113e1bbf32a6c70e6d1e8f63bc","relation":"main_file","creator":"dernst","date_updated":"2026-07-23T10:55:24Z","file_size":2256345,"access_level":"open_access","content_type":"application/pdf","file_id":"22394","file_name":"2026_InventionesMath_Koval.pdf","success":1,"date_created":"2026-07-23T10:55:24Z"}],"OA_place":"publisher"},{"external_id":{"pmid":["40923214"]},"issue":"7","scopus_import":"1","quality_controlled":"1","title":"An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice","abstract":[{"lang":"eng","text":"Rodents' ability to encode the whisking phase has been extensively documented through neuronal recordings from ascending sensory pathways. Yet, while indicating that reafference originates from the mechanoreceptors, the mechanistic underpinnings of the whisking phase encoding within the follicle remain unclear. Here we present anatomical, histological, and biomechanical evidence for the presence of a distinctive elastic segment (ES) within the basal part of the whisker shaft inside the follicle. This ES, composed of immature keratin, is capable of both bending and twisting. Forces generated by whisker movement deform this segment, causing whisker shaft deflections that can stimulate specific mechanoreceptor subsets within the follicle at different phases of the whisking cycle. This mechanism appears to operate during both free‐air whisking and object contact. We propose that the ES enables torsion‐based mechanoreceptor activation, allowing encoding of the whisking phase."}],"doi":"10.1002/ar.70051","has_accepted_license":"1","author":[{"first_name":"Sebastian","full_name":"Haidarliu, Sebastian","last_name":"Haidarliu"},{"first_name":"Guy","last_name":"Nelinger","full_name":"Nelinger, Guy"},{"first_name":"Luka","full_name":"Gantar, Luka","last_name":"Gantar","id":"ed7c4564-13aa-11f0-9846-960f9afb2ddb"},{"first_name":"Ehud","last_name":"Ahissar","full_name":"Ahissar, Ehud"},{"last_name":"Saraf‐Sinik","full_name":"Saraf‐Sinik, Inbar","first_name":"Inbar"}],"oa_version":"Published Version","intvolume":"       309","file_date_updated":"2026-07-23T10:19:09Z","page":"1910-1924","_id":"21264","supplementarymaterial":"no","publisher":"Wiley","publication_identifier":{"issn":["1932-8486"],"eissn":["1932-8494"]},"citation":{"ama":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. <i>The Anatomical Record</i>. 2026;309(7):1910-1924. doi:<a href=\"https://doi.org/10.1002/ar.70051\">10.1002/ar.70051</a>","apa":"Haidarliu, S., Nelinger, G., Gantar, L., Ahissar, E., &#38; Saraf‐Sinik, I. (2026). An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. <i>The Anatomical Record</i>. Wiley. <a href=\"https://doi.org/10.1002/ar.70051\">https://doi.org/10.1002/ar.70051</a>","ista":"Haidarliu S, Nelinger G, Gantar L, Ahissar E, Saraf‐Sinik I. 2026. An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice. The Anatomical Record. 309(7), 1910–1924.","mla":"Haidarliu, Sebastian, et al. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” <i>The Anatomical Record</i>, vol. 309, no. 7, Wiley, 2026, pp. 1910–24, doi:<a href=\"https://doi.org/10.1002/ar.70051\">10.1002/ar.70051</a>.","short":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, I. Saraf‐Sinik, The Anatomical Record 309 (2026) 1910–1924.","chicago":"Haidarliu, Sebastian, Guy Nelinger, Luka Gantar, Ehud Ahissar, and Inbar Saraf‐Sinik. “An Elastic Segment of the Whisker Shaft Enables Coding of the Whisking Phase via Whisker Torsion in Rats and Mice.” <i>The Anatomical Record</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/ar.70051\">https://doi.org/10.1002/ar.70051</a>.","ieee":"S. Haidarliu, G. Nelinger, L. Gantar, E. Ahissar, and I. Saraf‐Sinik, “An elastic segment of the whisker shaft enables coding of the whisking phase via whisker torsion in rats and mice,” <i>The Anatomical Record</i>, vol. 309, no. 7. Wiley, pp. 1910–1924, 2026."},"date_published":"2026-07-01T00:00:00Z","article_processing_charge":"No","volume":309,"ddc":["570"],"date_created":"2026-02-17T07:44:23Z","OA_type":"hybrid","publication":"The Anatomical Record","status":"public","researchdata_availability":"no","file":[{"date_created":"2026-07-23T10:19:09Z","file_id":"22393","content_type":"application/pdf","file_name":"2026_AnatomicalRecord_Haidarliu.pdf","success":1,"file_size":11315428,"date_updated":"2026-07-23T10:19:09Z","access_level":"open_access","checksum":"78847eea7d9d8adc905d03e6f2571287","relation":"main_file","creator":"dernst"}],"OA_place":"publisher","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","year":"2026","publication_status":"published","article_type":"original","type":"journal_article","department":[{"_id":"MaJö"}],"pmid":1,"date_updated":"2026-07-23T10:20:17Z","oa":1,"month":"07","language":[{"iso":"eng"}],"das_tickbox":"0","acknowledgement":"The authors wish to express their gratitude to Prof. Menahem Segal and Dr. Yonatan Katz for their helpful comments and discussions. The United States-Israel Binational Science Foundation (BSF, grant no. 2021327); The European Research Council (ERC) under the EU Horizon 2020 Research and Innovation Programme (grant no. 786949); the Israel Science Foundation (ISF, grant no. 2237/20); The Weizmann-UK Collaboration and a research grant from the Estate of Thomas Gruen."},{"researchdata_availability":"no","PlanS_conform":"1","ddc":["500"],"arxiv":1,"date_created":"2025-07-27T22:01:25Z","OA_type":"hybrid","publication":"Journal of Number Theory","status":"public","department":[{"_id":"TiBr"}],"isi":1,"dataavailabilitystatement":"No data was used for the research described in the article.","oa":1,"month":"02","language":[{"iso":"eng"}],"date_updated":"2026-07-23T11:33:57Z","das_tickbox":"1","file":[{"date_created":"2026-07-23T11:32:51Z","file_name":"2026_JourNumberTheory_Baranczuk.pdf","success":1,"file_id":"22396","content_type":"application/pdf","date_updated":"2026-07-23T11:32:51Z","file_size":754810,"access_level":"open_access","relation":"main_file","creator":"dernst","checksum":"34e6e965a2b30a258e0d4103350a68fd"}],"OA_place":"publisher","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","day":"01","article_type":"original","publication_status":"published","type":"journal_article","keyword":["Divisibility sequences","Abelian varieties","Elliptic divisibility sequences","Isogenies","Primitive divisors"],"title":"Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve","abstract":[{"text":"Let A be an abelian variety defined over a number field K, E/K be an elliptic curve, and ϕ : A → Em be an isogeny defined over K. Let P ∈ A(K) be such that ϕ(P)=(Q1,..., Qm) with RankZ(⟨Q1,...,Qm⟩)=1. We will study a divisibility sequence related to the point P and show its relation with elliptic divisibility sequences.","lang":"eng"}],"doi":"10.1016/j.jnt.2025.06.001","author":[{"first_name":"Stefan","last_name":"Barańczuk","full_name":"Barańczuk, Stefan"},{"last_name":"Naskręcki","full_name":"Naskręcki, Bartosz","first_name":"Bartosz"},{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","last_name":"Verzobio","full_name":"Verzobio, Matteo","orcid":"0000-0002-0854-0306","first_name":"Matteo"}],"has_accepted_license":"1","external_id":{"isi":["001541172400002"],"arxiv":["2309.09699"]},"scopus_import":"1","corr_author":"1","quality_controlled":"1","_id":"20078","supplementarymaterial":"no","publisher":"Elsevier","publication_identifier":{"issn":["0022-314X"]},"date_published":"2026-02-01T00:00:00Z","citation":{"apa":"Barańczuk, S., Naskręcki, B., &#38; Verzobio, M. (2026). Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. <i>Journal of Number Theory</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jnt.2025.06.001\">https://doi.org/10.1016/j.jnt.2025.06.001</a>","ama":"Barańczuk S, Naskręcki B, Verzobio M. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. <i>Journal of Number Theory</i>. 2026;279:170-183. doi:<a href=\"https://doi.org/10.1016/j.jnt.2025.06.001\">10.1016/j.jnt.2025.06.001</a>","ista":"Barańczuk S, Naskręcki B, Verzobio M. 2026. Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve. Journal of Number Theory. 279, 170–183.","short":"S. Barańczuk, B. Naskręcki, M. Verzobio, Journal of Number Theory 279 (2026) 170–183.","ieee":"S. Barańczuk, B. Naskręcki, and M. Verzobio, “Divisibility sequences related to abelian varieties isogenous to a power of an elliptic curve,” <i>Journal of Number Theory</i>, vol. 279. Elsevier, pp. 170–183, 2026.","chicago":"Barańczuk, Stefan, Bartosz Naskręcki, and Matteo Verzobio. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” <i>Journal of Number Theory</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.jnt.2025.06.001\">https://doi.org/10.1016/j.jnt.2025.06.001</a>.","mla":"Barańczuk, Stefan, et al. “Divisibility Sequences Related to Abelian Varieties Isogenous to a Power of an Elliptic Curve.” <i>Journal of Number Theory</i>, vol. 279, Elsevier, 2026, pp. 170–83, doi:<a href=\"https://doi.org/10.1016/j.jnt.2025.06.001\">10.1016/j.jnt.2025.06.001</a>."},"article_processing_charge":"Yes (via OA deal)","volume":279,"oa_version":"Published Version","intvolume":"       279","file_date_updated":"2026-07-23T11:32:51Z","page":"170-183"},{"doi":"10.1002/adfm.202513859","author":[{"last_name":"He","full_name":"He, Ren","first_name":"Ren"},{"orcid":"0000-0002-6962-8598","first_name":"Seungho","last_name":"Lee","id":"BB243B88-D767-11E9-B658-BC13E6697425","full_name":"Lee, Seungho"},{"last_name":"Ding","full_name":"Ding, Yang","first_name":"Yang"},{"full_name":"Huang, Chen","last_name":"Huang","first_name":"Chen"},{"last_name":"Lu","full_name":"Lu, Xuan","first_name":"Xuan"},{"full_name":"Zheng, Lirong","last_name":"Zheng","first_name":"Lirong"},{"full_name":"Yu, Ao","last_name":"Yu","first_name":"Ao"},{"last_name":"Zhang","full_name":"Zhang, Chaoyue","first_name":"Chaoyue"},{"first_name":"Canhuang","last_name":"Li","full_name":"Li, Canhuang"},{"first_name":"Xiaoyu","full_name":"Bi, Xiaoyu","last_name":"Bi"},{"first_name":"Yaqiang","last_name":"Li","full_name":"Li, Yaqiang"},{"full_name":"Liao, Yaqi","last_name":"Liao","first_name":"Yaqi"},{"first_name":"Junshan","last_name":"Li","full_name":"Li, Junshan"},{"last_name":"Ostovari Moghaddam","full_name":"Ostovari Moghaddam, Ahmad","first_name":"Ahmad"},{"first_name":"Salimov","full_name":"Yernar, Salimov","last_name":"Yernar"},{"first_name":"Ying","full_name":"Xu, Ying","last_name":"Xu"},{"full_name":"Ibáñez, Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","first_name":"Maria"},{"first_name":"Chaoqi","last_name":"Zhang","full_name":"Zhang, Chaoqi"},{"first_name":"Linlin","last_name":"Yang","full_name":"Yang, Linlin"},{"first_name":"Yingtang","full_name":"Zhou, Yingtang","last_name":"Zhou"},{"last_name":"Cabot","full_name":"Cabot, Andreu","first_name":"Andreu"}],"has_accepted_license":"1","keyword":["amorphous","high entropy alloy","in situ electrochemical impedance spec-troscopy","in situ Raman","Li–S batteries"],"abstract":[{"text":"High-entropy alloys (HEAs) show great potential for catalyzing complex multi-step reactions, but optimizing their parameters, i.e., composition, but also their crystallinity and morphology, remains a significant challenge. In this study, FeCoNiMoW HEAs are synthesized into either amorphous nanosheets (HEANS) or crystalline nanoparticles (HEANP), which are then used to catalyze the lithium–sulfur (Li–S) reaction of Li–S batteries (LSBs). Evaluations in symmetric cells, coin cells, and pouch cells reveal that HEANS significantly enhance LSB performance, achieving initial discharge capacities up to 1632 mAh g−1. The batteries also exhibit excellent cycling stability over 1000 cycles at 3Cand maintain high-rate performance up to 10C with a capacity of 614 mAh g−1. Comprehensive in situ analyses and density functional theory calculations demonstrate that amorphous HEANS provide more active sites, better ionic conductivity and stronger chemical interactions with lithium polysulfides (LiPS). These properties effectively suppress the shuttle effect, promote the complete S8 → Li2S conversion by reducing the impedance of the solid-electrolyte interphase, and accelerate the Li2S4 → Li2S2 step by lowering the nucleation energy barrier. Overall, this study highlights the superior catalytic properties of amorphous 2D HEAs in LSBs and offers new insights into the mechanisms of LiPS conversion.","lang":"eng"}],"title":"Amorphous high entropy alloy nanosheets enabling robust Li–S batteries","issue":"5","quality_controlled":"1","scopus_import":"1","external_id":{"isi":["001544757200001"]},"article_processing_charge":"Yes (in subscription journal)","volume":36,"_id":"20191","supplementarymaterial":"no","publisher":"Wiley","date_published":"2026-01-15T00:00:00Z","citation":{"ama":"He R, Lee S, Ding Y, et al. Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. <i>Advanced Functional Materials</i>. 2026;36(5). doi:<a href=\"https://doi.org/10.1002/adfm.202513859\">10.1002/adfm.202513859</a>","apa":"He, R., Lee, S., Ding, Y., Huang, C., Lu, X., Zheng, L., … Cabot, A. (2026). Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. <i>Advanced Functional Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/adfm.202513859\">https://doi.org/10.1002/adfm.202513859</a>","ista":"He R, Lee S, Ding Y, Huang C, Lu X, Zheng L, Yu A, Zhang C, Li C, Bi X, Li Y, Liao Y, Li J, Ostovari Moghaddam A, Yernar S, Xu Y, Ibáñez M, Zhang C, Yang L, Zhou Y, Cabot A. 2026. Amorphous high entropy alloy nanosheets enabling robust Li–S batteries. Advanced Functional Materials. 36(5), e13859.","mla":"He, Ren, et al. “Amorphous High Entropy Alloy Nanosheets Enabling Robust Li–S Batteries.” <i>Advanced Functional Materials</i>, vol. 36, no. 5, e13859, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/adfm.202513859\">10.1002/adfm.202513859</a>.","ieee":"R. He <i>et al.</i>, “Amorphous high entropy alloy nanosheets enabling robust Li–S batteries,” <i>Advanced Functional Materials</i>, vol. 36, no. 5. Wiley, 2026.","short":"R. He, S. Lee, Y. Ding, C. Huang, X. Lu, L. Zheng, A. Yu, C. Zhang, C. Li, X. Bi, Y. Li, Y. Liao, J. Li, A. Ostovari Moghaddam, S. Yernar, Y. Xu, M. Ibáñez, C. Zhang, L. Yang, Y. Zhou, A. Cabot, Advanced Functional Materials 36 (2026).","chicago":"He, Ren, Seungho Lee, Yang Ding, Chen Huang, Xuan Lu, Lirong Zheng, Ao Yu, et al. “Amorphous High Entropy Alloy Nanosheets Enabling Robust Li–S Batteries.” <i>Advanced Functional Materials</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/adfm.202513859\">https://doi.org/10.1002/adfm.202513859</a>."},"acknowledged_ssus":[{"_id":"EM-Fac"}],"publication_identifier":{"eissn":["1616-3028"],"issn":["1616-301X"]},"project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"oa_version":"Published Version","intvolume":"        36","file_date_updated":"2026-07-23T11:40:34Z","researchdata_availability":"upon request","article_number":"e13859","date_created":"2025-08-17T22:01:37Z","OA_type":"hybrid","publication":"Advanced Functional Materials","status":"public","ddc":["540"],"language":[{"iso":"eng"}],"month":"01","oa":1,"date_updated":"2026-07-23T11:42:17Z","das_tickbox":"1","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","acknowledgement":"The authors acknowledge support from the 2BoSS project of the ERA-MIN3 program with the Spanish grant number PCI2022-132985/AEI/10.13039/50110001103, and funding from Generalitat de Catalunya 2021SGR01581 and European Union NextGenerationEU/PRTR. L.Yang, C.Huang, X.Lu, A.Yu, C.Li, J.Yu, and X.Bi thank the China Scholarship Council (CSC) for the scholarship support. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Electron Microscopy Facility (EMF), and by the Werner Siemens Foundation (WSS) for financial support.","department":[{"_id":"MaIb"}],"dataavailabilitystatement":"The data that support the findings of this study are available from the cor-responding authors upon reasonable request.","isi":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"15","article_type":"original","publication_status":"published","type":"journal_article","file":[{"date_created":"2026-07-23T11:40:34Z","file_id":"22397","content_type":"application/pdf","file_name":"2026_AdvancedFunctionalMat_He.pdf","success":1,"access_level":"open_access","date_updated":"2026-07-23T11:40:34Z","file_size":5734587,"checksum":"b102207b2343e6e7dba00870bfe362ea","relation":"main_file","creator":"dernst"}],"OA_place":"publisher"},{"PlanS_conform":"1","ddc":["550"],"date_created":"2025-11-02T23:01:34Z","OA_type":"hybrid","publication":"Quarterly Journal of the Royal Meteorological Society","status":"public","researchdata_availability":"no","article_number":"e70044","file":[{"file_name":"2026_QuartJourRoyalMeteorobiolSoc_Agasthya.pdf","success":1,"file_id":"22398","content_type":"application/pdf","date_created":"2026-07-23T12:10:28Z","relation":"main_file","creator":"dernst","checksum":"8dd4d4d3ad027a4d26cbe5b1d66371e9","access_level":"open_access","file_size":2665988,"date_updated":"2026-07-23T12:10:28Z"}],"OA_place":"publisher","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","day":"01","article_type":"original","publication_status":"published","type":"journal_article","department":[{"_id":"CaMu"}],"dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author, L. Agasthya, upon reasonable request.","isi":1,"month":"01","language":[{"iso":"eng"}],"oa":1,"date_updated":"2026-07-23T12:11:25Z","das_tickbox":"1","acknowledgement":"The authors gratefully acknowledge discussions with Professor Robert Plant (University of Reading, UK), Professor Steve Sherwood (University of New South Wales, Australia), Professor Steve Tobias, Professor Douglas Parker, and Gregory Dritschel (University of Leeds, UK). Discussions with colleagues at the Institute of Science and Technology Austria played a large role in shaping this study. The authors are particularly grateful for inputs and discussions from Dr. Jiawei Bao, Dr. Alejandro Casallas, and Alzbeta Pechacova.\r\nThis project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Sklodowska–Curie grant agreement No. 101034413. C. Muller gratefully acknowledges funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Project CLUSTER, Grant Agreement No. 805041). This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). Open Access funding provided by Institute of Science and Technology Austria/KEMÖ.","external_id":{"isi":["001595821400001"]},"issue":"775","scopus_import":"1","quality_controlled":"1","corr_author":"1","abstract":[{"text":"Moist convection is a fundamental process occurring in the Earth's atmosphere. It plays a central role in the weather and climate of the Tropics, where, to first order, the heating of the atmosphere by convection is in balance with the cooling of the atmosphere by the emission of radiation to outer space. In this study, we use a cloud-resolving model in radiative–convective equilibrium with an imposed constant rate of radiative cooling and study the response of moist convection to varying this rate of radiative cooling. In particular, we study two types of simulation: varying air temperature (VAT) simulations, where the air temperature is allowed to adjust to the imposed radiative cooling, and constant air temperature (CAT) simulations, where the surface temperature is tuned to ensure that the atmospheric temperature profile in the domain is constant. We recover the previously known result that, in response to increasing radiative cooling, the area of convection expands rapidly, while the intensity of convection does not change. We find that this response is explained by the increased boundary-layer variability in simulations with greater radiative cooling, which compensates for the decreasing temperature by adding a larger initial velocity close to the cloud base. We also propose a fundamental scaling of the non-dimensional cumulus mass flux in moist convection, which is robust across models of different complexity. We aim to bridge the gap between highly idealised prototypes of moist convection, such as the “Rainy–Bénard convection” introduced by Vallis et al., and comprehensive cloud-resolving models.","lang":"eng"}],"title":"Moist convection and radiative cooling: Dynamical response and scaling","ec_funded":1,"doi":"10.1002/qj.70044","has_accepted_license":"1","author":[{"full_name":"Agasthya, Lokahith N","last_name":"Agasthya","id":"cd100965-0804-11ed-9c55-f4878ff4e877","first_name":"Lokahith N"},{"orcid":"0000-0001-5836-5350","first_name":"Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","last_name":"Muller","full_name":"Muller, Caroline J"}],"oa_version":"Published Version","intvolume":"       152","file_date_updated":"2026-07-23T12:10:28Z","project":[{"name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020"},{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","grant_number":"805041","name":"Organization of CLoUdS, and implications of Tropical  cyclones and for the Energetics of the tropics, in current and waRming climate","call_identifier":"H2020"}],"_id":"20590","supplementarymaterial":"yes","publisher":"Wiley","publication_identifier":{"issn":["0035-9009"],"eissn":["1477-870X"]},"acknowledged_ssus":[{"_id":"ScienComp"}],"citation":{"ista":"Agasthya LN, Muller CJ. 2026. Moist convection and radiative cooling: Dynamical response and scaling. Quarterly Journal of the Royal Meteorological Society. 152(775), e70044.","apa":"Agasthya, L. N., &#38; Muller, C. J. (2026). Moist convection and radiative cooling: Dynamical response and scaling. <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley. <a href=\"https://doi.org/10.1002/qj.70044\">https://doi.org/10.1002/qj.70044</a>","ama":"Agasthya LN, Muller CJ. Moist convection and radiative cooling: Dynamical response and scaling. <i>Quarterly Journal of the Royal Meteorological Society</i>. 2026;152(775). doi:<a href=\"https://doi.org/10.1002/qj.70044\">10.1002/qj.70044</a>","chicago":"Agasthya, Lokahith N, and Caroline J Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” <i>Quarterly Journal of the Royal Meteorological Society</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/qj.70044\">https://doi.org/10.1002/qj.70044</a>.","short":"L.N. Agasthya, C.J. Muller, Quarterly Journal of the Royal Meteorological Society 152 (2026).","ieee":"L. N. Agasthya and C. J. Muller, “Moist convection and radiative cooling: Dynamical response and scaling,” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 775. Wiley, 2026.","mla":"Agasthya, Lokahith N., and Caroline J. Muller. “Moist Convection and Radiative Cooling: Dynamical Response and Scaling.” <i>Quarterly Journal of the Royal Meteorological Society</i>, vol. 152, no. 775, e70044, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/qj.70044\">10.1002/qj.70044</a>."},"date_published":"2026-01-01T00:00:00Z","article_processing_charge":"Yes (via OA deal)","volume":152},{"article_processing_charge":"No","volume":8,"_id":"20585","publisher":"American Institute of Mathematical Sciences","publication_identifier":{"eissn":["2639-8001"]},"citation":{"mla":"Cultrera di Montesano, Sebastiano, et al. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>, vol. 8, American Institute of Mathematical Sciences, 2026, pp. 30–62, doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>.","short":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, M. Saghafian, Foundations of Data Science 8 (2026) 30–62.","ieee":"S. Cultrera di Montesano, O. Draganov, H. Edelsbrunner, and M. Saghafian, “Chromatic alpha complexes,” <i>Foundations of Data Science</i>, vol. 8. American Institute of Mathematical Sciences, pp. 30–62, 2026.","chicago":"Cultrera di Montesano, Sebastiano, Ondrej Draganov, Herbert Edelsbrunner, and Morteza Saghafian. “Chromatic Alpha Complexes.” <i>Foundations of Data Science</i>. American Institute of Mathematical Sciences, 2026. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>.","ista":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. 2026. Chromatic alpha complexes. Foundations of Data Science. 8, 30–62.","ama":"Cultrera di Montesano S, Draganov O, Edelsbrunner H, Saghafian M. Chromatic alpha complexes. <i>Foundations of Data Science</i>. 2026;8:30-62. doi:<a href=\"https://doi.org/10.3934/fods.2025003\">10.3934/fods.2025003</a>","apa":"Cultrera di Montesano, S., Draganov, O., Edelsbrunner, H., &#38; Saghafian, M. (2026). Chromatic alpha complexes. <i>Foundations of Data Science</i>. American Institute of Mathematical Sciences. <a href=\"https://doi.org/10.3934/fods.2025003\">https://doi.org/10.3934/fods.2025003</a>"},"date_published":"2026-03-01T00:00:00Z","page":"30-62","project":[{"name":"Alpha Shape Theory Extended","grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science"},{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"intvolume":"         8","oa_version":"Preprint","doi":"10.3934/fods.2025003","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2212.03128"}],"has_accepted_license":"1","author":[{"first_name":"Sebastiano","orcid":"0000-0001-6249-0832","last_name":"Cultrera di Montesano","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","full_name":"Cultrera di Montesano, Sebastiano"},{"full_name":"Draganov, Ondrej","last_name":"Draganov","id":"2B23F01E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0464-3823","first_name":"Ondrej"},{"full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"keyword":["Topological data analysis","Delaunay mosaic","alpha complex","chromatic sets","persistent homology","kernel/image/cokernel persistent homology","radius function","discrete Morse theory","exact sequences"],"abstract":[{"text":"Motivated by applications in medical sciences, we study finite chromatic sets in Euclidean space from a topological perspective. Based on the persistent homology for images, kernels and cokernels, we design provably stable homological quantifiers that describe the geometric micro- and macro-structure of how the color classes mingle. These can be efficiently computed using chromatic variants of Delaunay and alpha complexes, and code that does these computations is provided.","lang":"eng"}],"title":"Chromatic alpha complexes","ec_funded":1,"scopus_import":"1","corr_author":"1","quality_controlled":"1","external_id":{"arxiv":["2212.03128"]},"oa":1,"date_updated":"2026-07-23T12:03:56Z","language":[{"iso":"eng"}],"month":"03","acknowledgement":"This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation\r\nprogramme, grant no. 788183, from the Wittgenstein Prize, Austrian Science Fund\r\n(FWF), grant no. Z 342-N31, and from the DFG Collaborative Research Center TRR\r\n109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF),\r\ngrant no. I 02979-N35.","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","year":"2026","publication_status":"published","article_type":"original","type":"journal_article","OA_place":"repository","OA_type":"green","date_created":"2025-11-02T23:01:33Z","publication":"Foundations of Data Science","status":"public","mathsc":["62R40","55N31","68T09","57Q70"],"related_material":{"record":[{"id":"15091","status":"public","relation":"earlier_version"}]},"ddc":["510"],"arxiv":1},{"article_number":"104248","OA_type":"green","date_created":"2025-10-19T22:01:31Z","publication":"European Journal of Combinatorics","status":"public","arxiv":1,"month":"02","language":[{"iso":"eng"}],"date_updated":"2026-07-23T11:58:37Z","oa":1,"das_tickbox":"0","acknowledgement":"Work by all authors but the second is supported by the European Research Council (ERC), grant no. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. I 02979-N35. Work by the second author is partially supported by the Alexander von Humboldt Foundation and by the Simons Foundation . The second author thanks Jesús A. De Loera for useful discussions on flips and non-flips and Pavel Galashin and Alexey Balitskiy for useful discussions on plabic graphs.","department":[{"_id":"HeEd"}],"isi":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2026","day":"01","publication_status":"published","article_type":"original","type":"journal_article","OA_place":"repository","doi":"10.1016/j.ejc.2025.104248","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2212.11380","open_access":"1"}],"author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"first_name":"Alexey","last_name":"Garber","full_name":"Garber, Alexey"},{"first_name":"Mohadese","last_name":"Ghafari","full_name":"Ghafari, Mohadese"},{"orcid":"0000-0002-1780-2689","first_name":"Teresa","full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss"},{"first_name":"Morteza","full_name":"Saghafian, Morteza","last_name":"Saghafian","id":"f86f7148-b140-11ec-9577-95435b8df824"}],"abstract":[{"lang":"eng","text":"We study flips in hypertriangulations of planar points sets. Here a level-k hypertriangulation of n\r\n points in the plane is a subdivision induced by the projection of a k-hypersimplex, which is the convex hull of the barycenters of the (k-1)-dimensional faces of the standard (n-1)-simplex. In particular, we introduce four types of flips and prove that the level-2 hypertriangulations are connected by these flips.\r\n"}],"title":"Flips in two-dimensional hypertriangulations","ec_funded":1,"corr_author":"1","scopus_import":"1","quality_controlled":"1","external_id":{"arxiv":["2212.11380"],"isi":["001599061500002"]},"article_processing_charge":"No","volume":132,"_id":"20490","publisher":"Elsevier","publication_identifier":{"issn":["0195-6698"]},"citation":{"apa":"Edelsbrunner, H., Garber, A., Ghafari, M., Heiss, T., &#38; Saghafian, M. (2026). Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>","ama":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. Flips in two-dimensional hypertriangulations. <i>European Journal of Combinatorics</i>. 2026;132. doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>","ista":"Edelsbrunner H, Garber A, Ghafari M, Heiss T, Saghafian M. 2026. Flips in two-dimensional hypertriangulations. European Journal of Combinatorics. 132, 104248.","ieee":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, and M. Saghafian, “Flips in two-dimensional hypertriangulations,” <i>European Journal of Combinatorics</i>, vol. 132. Elsevier, 2026.","chicago":"Edelsbrunner, Herbert, Alexey Garber, Mohadese Ghafari, Teresa Heiss, and Morteza Saghafian. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>. Elsevier, 2026. <a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">https://doi.org/10.1016/j.ejc.2025.104248</a>.","short":"H. Edelsbrunner, A. Garber, M. Ghafari, T. Heiss, M. Saghafian, European Journal of Combinatorics 132 (2026).","mla":"Edelsbrunner, Herbert, et al. “Flips in Two-Dimensional Hypertriangulations.” <i>European Journal of Combinatorics</i>, vol. 132, 104248, Elsevier, 2026, doi:<a href=\"https://doi.org/10.1016/j.ejc.2025.104248\">10.1016/j.ejc.2025.104248</a>."},"date_published":"2026-02-01T00:00:00Z","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science","call_identifier":"FWF"},{"grant_number":"I02979-N35","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"oa_version":"Preprint","intvolume":"       132"},{"OA_place":"repository","article_type":"original","publication_status":"published","type":"journal_article","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","year":"2026","department":[{"_id":"MaMo"}],"das_tickbox":"0","acknowledgement":"This work was supported by the Swiss National Science Foundation under\r\nGrant 200364. An earlier version of this paper was presented in part at\r\nthe 2024 IEEE International Symposium on Information Theory, Athens,\r\nGreece [DOI: 10.1109/ISIT57864.2024.10619378]. (Corresponding author:\r\nAmedeo Roberto Esposito.)","date_updated":"2026-07-23T11:38:30Z","language":[{"iso":"eng"}],"month":"07","oa":1,"arxiv":1,"publication":"IEEE Transactions on Information Theory","status":"public","date_created":"2025-07-27T22:01:26Z","OA_type":"green","researchdata_availability":"no","intvolume":"        72","oa_version":"Preprint","page":"4434-4467","publisher":"IEEE","publication_identifier":{"issn":["0018-9448"],"eissn":["1557-9654"]},"citation":{"ista":"Esposito AR, Gastpar M, Issa I. 2026. Sibson α-mutual information and its variational representations. IEEE Transactions on Information Theory. 72(7), 4434–4467.","ama":"Esposito AR, Gastpar M, Issa I. Sibson α-mutual information and its variational representations. <i>IEEE Transactions on Information Theory</i>. 2026;72(7):4434-4467. doi:<a href=\"https://doi.org/10.1109/TIT.2025.3587340\">10.1109/TIT.2025.3587340</a>","apa":"Esposito, A. R., Gastpar, M., &#38; Issa, I. (2026). Sibson α-mutual information and its variational representations. <i>IEEE Transactions on Information Theory</i>. IEEE. <a href=\"https://doi.org/10.1109/TIT.2025.3587340\">https://doi.org/10.1109/TIT.2025.3587340</a>","mla":"Esposito, Amedeo Roberto, et al. “Sibson α-Mutual Information and Its Variational Representations.” <i>IEEE Transactions on Information Theory</i>, vol. 72, no. 7, IEEE, 2026, pp. 4434–67, doi:<a href=\"https://doi.org/10.1109/TIT.2025.3587340\">10.1109/TIT.2025.3587340</a>.","short":"A.R. Esposito, M. Gastpar, I. Issa, IEEE Transactions on Information Theory 72 (2026) 4434–4467.","chicago":"Esposito, Amedeo Roberto, Michael Gastpar, and Ibrahim Issa. “Sibson α-Mutual Information and Its Variational Representations.” <i>IEEE Transactions on Information Theory</i>. IEEE, 2026. <a href=\"https://doi.org/10.1109/TIT.2025.3587340\">https://doi.org/10.1109/TIT.2025.3587340</a>.","ieee":"A. R. Esposito, M. Gastpar, and I. Issa, “Sibson α-mutual information and its variational representations,” <i>IEEE Transactions on Information Theory</i>, vol. 72, no. 7. IEEE, pp. 4434–4467, 2026."},"date_published":"2026-07-01T00:00:00Z","_id":"20081","supplementarymaterial":"no","volume":72,"article_processing_charge":"No","external_id":{"arxiv":["2405.08352"]},"quality_controlled":"1","scopus_import":"1","issue":"7","title":"Sibson α-mutual information and its variational representations","abstract":[{"lang":"eng","text":"Information measures can be constructed from Rényi divergences much like mutual information from Kullback-Leibler divergence. One such information measure is known as Sibson α-mutual information and has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this paper, we survey and extend the state of the art. In particular, we introduce variational representations for Sibson α-mutual information and employ them in each described context to derive novel results. Namely, we produce generalized Transportation-Cost inequalities and Fano-type inequalities. We also present an overview of known applications, spanning from learning theory and Bayesian risk to universal prediction."}],"author":[{"first_name":"Amedeo Roberto","last_name":"Esposito","id":"9583e921-e1ad-11ec-9862-cef099626dc9","full_name":"Esposito, Amedeo Roberto"},{"first_name":"Michael","full_name":"Gastpar, Michael","last_name":"Gastpar"},{"first_name":"Ibrahim","full_name":"Issa, Ibrahim","last_name":"Issa"}],"doi":"10.1109/TIT.2025.3587340","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2405.08352","open_access":"1"}]},{"publisher":"Cambridge University Press","date_published":"2026-06-01T00:00:00Z","citation":{"ama":"Portinale L, Quattrocchi F. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. 2026;37(3):614-642. doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>","apa":"Portinale, L., &#38; Quattrocchi, F. (2026). Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. <i>European Journal of Applied Mathematics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>","ista":"Portinale L, Quattrocchi F. 2026. Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs. European Journal of Applied Mathematics. 37(3), 614–642.","mla":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3, Cambridge University Press, 2026, pp. 614–42, doi:<a href=\"https://doi.org/10.1017/s0956792524000810\">10.1017/s0956792524000810</a>.","chicago":"Portinale, Lorenzo, and Filippo Quattrocchi. “Discrete-to-Continuum Limits of Optimal Transport with Linear Growth on Periodic Graphs.” <i>European Journal of Applied Mathematics</i>. Cambridge University Press, 2026. <a href=\"https://doi.org/10.1017/s0956792524000810\">https://doi.org/10.1017/s0956792524000810</a>.","short":"L. Portinale, F. Quattrocchi, European Journal of Applied Mathematics 37 (2026) 614–642.","ieee":"L. Portinale and F. Quattrocchi, “Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs,” <i>European Journal of Applied Mathematics</i>, vol. 37, no. 3. Cambridge University Press, pp. 614–642, 2026."},"publication_identifier":{"issn":["0956-7925"],"eissn":["1469-4425"]},"_id":"18706","supplementarymaterial":"no","volume":37,"article_processing_charge":"Yes","oa_version":"Published Version","intvolume":"        37","file_date_updated":"2026-07-23T05:55:03Z","page":"614-642","project":[{"_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems"}],"abstract":[{"text":"We prove discrete-to-continuum convergence for dynamical optimal transport on  Zd\r\n -periodic graphs with cost functional having linear growth at infinity. This result provides an answer to a problem left open by Gladbach, Kopfer, Maas, and Portinale (Calc Var Partial Differential Equations 62(5), 2023), where the convergence behaviour of discrete boundary-value dynamical transport problems is proved under the stronger assumption of superlinear growth. Our result extends the known literature to some important classes of examples, such as scaling limits of  1 -Wasserstein transport problems. Similarly to what happens in the quadratic case, the geometry of the graph plays a crucial role in the structure of the limit cost function, as we discuss in the final part of this work, which includes some visual representations.","lang":"eng"}],"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"author":[{"id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","full_name":"Portinale, Lorenzo","first_name":"Lorenzo"},{"first_name":"Filippo","orcid":"0009-0000-9773-1931","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","last_name":"Quattrocchi","full_name":"Quattrocchi, Filippo"}],"has_accepted_license":"1","DOAJ_listed":"1","doi":"10.1017/s0956792524000810","external_id":{"isi":["001381435800001"]},"quality_controlled":"1","scopus_import":"1","issue":"3","isi":1,"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"das_tickbox":"0","acknowledgement":"L.P. gratefully acknowledges fundings from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – GZ 2047/1, Projekt-ID 390685813. F.Q. gratefully acknowledges support from the Austrian Science Fund (FWF) project 10.55776/F65.","date_updated":"2026-07-23T22:31:09Z","language":[{"iso":"eng"}],"oa":1,"month":"06","OA_place":"publisher","file":[{"relation":"main_file","creator":"dernst","checksum":"d038f4d00cbfbde2672c17138eab21c9","file_size":612317,"date_updated":"2026-07-23T05:55:03Z","access_level":"open_access","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","success":1,"file_id":"22386","content_type":"application/pdf","date_created":"2026-07-23T05:55:03Z"}],"publication_status":"published","article_type":"original","type":"journal_article","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"year":"2026","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","researchdata_availability":"no","related_material":{"record":[{"status":"public","id":"20563","relation":"dissertation_contains"}]},"ddc":["500"],"PlanS_conform":"1","publication":"European Journal of Applied Mathematics","status":"public","date_created":"2024-12-23T11:03:59Z","OA_type":"gold"},{"date_created":"2026-06-14T22:01:45Z","OA_type":"gold","status":"public","publication":"6th Conference on Information-Theoretic Cryptography","alternative_title":["LIPIcs"],"ddc":["000"],"article_number":"4:1-4:10","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","year":"2025","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","publication_status":"published","file":[{"date_created":"2026-06-22T08:54:32Z","content_type":"application/pdf","file_id":"22118","file_name":"2025_LIPIcs_Pietrzak.pdf","success":1,"access_level":"open_access","file_size":772046,"date_updated":"2026-06-22T08:54:32Z","checksum":"3f791b03df26853342855a9d9581cb58","relation":"main_file","creator":"dernst"}],"OA_place":"publisher","date_updated":"2026-06-22T08:57:41Z","language":[{"iso":"eng"}],"oa":1,"month":"09","das_tickbox":"0","department":[{"_id":"KrPi"}],"scopus_import":"1","quality_controlled":"1","corr_author":"1","cryptoeprintid":1,"external_id":{"cryptoeprintid":["2025/723"]},"doi":"10.4230/LIPIcs.ITC.2025.4","has_accepted_license":"1","author":[{"first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"},{"first_name":"Pengxiang","last_name":"Wang","full_name":"Wang, Pengxiang"}],"keyword":["Time-Space Lower Bounds","Blockchains"],"conference":{"end_date":"2025-08-17","name":"ITC: Information Theoretic Cryptography","start_date":"2025-08-16","location":"Santa Barbara, CA, United States"},"title":"Time-space tradeoffs of truncation with preprocessing","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."}],"file_date_updated":"2026-06-22T08:54:32Z","intvolume":"       343","oa_version":"Published Version","article_processing_charge":"Yes","volume":343,"_id":"22007","citation":{"short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","chicago":"Pietrzak, Krzysztof Z, and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” In <i>6th Conference on Information-Theoretic Cryptography</i>, Vol. 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>.","ieee":"K. Z. Pietrzak and P. Wang, “Time-space tradeoffs of truncation with preprocessing,” in <i>6th Conference on Information-Theoretic Cryptography</i>, Santa Barbara, CA, United States, 2025, vol. 343.","mla":"Pietrzak, Krzysztof Z., and Pengxiang Wang. “Time-Space Tradeoffs of Truncation with Preprocessing.” <i>6th Conference on Information-Theoretic Cryptography</i>, vol. 343, 4:1-4:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025, doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>.","apa":"Pietrzak, K. Z., &#38; Wang, P. (2025). Time-space tradeoffs of truncation with preprocessing. In <i>6th Conference on Information-Theoretic Cryptography</i> (Vol. 343). Santa Barbara, CA, United States: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">https://doi.org/10.4230/LIPIcs.ITC.2025.4</a>","ama":"Pietrzak KZ, Wang P. Time-space tradeoffs of truncation with preprocessing. In: <i>6th Conference on Information-Theoretic Cryptography</i>. Vol 343. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2025. doi:<a href=\"https://doi.org/10.4230/LIPIcs.ITC.2025.4\">10.4230/LIPIcs.ITC.2025.4</a>","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."},"publication_identifier":{"eissn":["1868-8969"],"isbn":["9783959773850"]},"date_published":"2025-09-08T00:00:00Z","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik"},{"ddc":["500"],"arxiv":1,"publication":"Communications of the American Mathematical Society","status":"public","date_created":"2026-06-19T07:42:34Z","OA_type":"diamond","OA_place":"publisher","publication_status":"published","article_type":"original","type":"journal_article","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"day":"23","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","das_tickbox":"1","month":"06","oa":1,"language":[{"iso":"eng"}],"date_updated":"2026-06-22T11:21:09Z","external_id":{"arxiv":["2311.12334"]},"extern":"1","quality_controlled":"1","scopus_import":"1","issue":"7","title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","abstract":[{"text":"We prove that the focusing and defocusing continuum Calogero–Moser models are well-posed in the scaling-critical space L^2+(R). In the focusing case, this requires solutions to have mass less than that of the soliton.","lang":"eng"}],"author":[{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"last_name":"Laurens","full_name":"Laurens, Thierry","first_name":"Thierry"},{"first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","last_name":"Visan","full_name":"Visan, Monica"}],"has_accepted_license":"1","doi":"10.1090/cams/48","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.12334","open_access":"1"}],"intvolume":"         5","oa_version":"Published Version","page":"284-320","publisher":"American Mathematical Society","date_published":"2025-06-23T00:00:00Z","citation":{"ista":"Killip R, Laurens T, Vişan M. 2025. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. Communications of the American Mathematical Society. 5(7), 284–320.","ama":"Killip R, Laurens T, Vişan M. Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. 2025;5(7):284-320. doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>","apa":"Killip, R., Laurens, T., &#38; Vişan, M. (2025). Scaling-critical well-posedness for continuum Calogero–Moser models on the line. <i>Communications of the American Mathematical Society</i>. American Mathematical Society. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>","mla":"Killip, Rowan, et al. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7, American Mathematical Society, 2025, pp. 284–320, doi:<a href=\"https://doi.org/10.1090/cams/48\">10.1090/cams/48</a>.","ieee":"R. Killip, T. Laurens, and M. Vişan, “Scaling-critical well-posedness for continuum Calogero–Moser models on the line,” <i>Communications of the American Mathematical Society</i>, vol. 5, no. 7. American Mathematical Society, pp. 284–320, 2025.","short":"R. Killip, T. Laurens, M. Vişan, Communications of the American Mathematical Society 5 (2025) 284–320.","chicago":"Killip, Rowan, Thierry Laurens, and Monica Vişan. “Scaling-Critical Well-Posedness for Continuum Calogero–Moser Models on the Line.” <i>Communications of the American Mathematical Society</i>. American Mathematical Society, 2025. <a href=\"https://doi.org/10.1090/cams/48\">https://doi.org/10.1090/cams/48</a>."},"publication_identifier":{"issn":["2692-3688"]},"_id":"22032","volume":5,"article_processing_charge":"No"},{"article_number":"21","status":"public","publication":"Mathematische Zeitschrift","date_created":"2026-06-19T07:44:05Z","OA_type":"green","arxiv":1,"das_tickbox":"1","date_updated":"2026-06-22T13:00:14Z","language":[{"iso":"eng"}],"month":"07","oa":1,"type":"journal_article","publication_status":"published","article_type":"original","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"24","year":"2025","OA_place":"repository","author":[{"last_name":"Fan","full_name":"Fan, Chenjie","first_name":"Chenjie"},{"last_name":"Killip","full_name":"Killip, Rowan","first_name":"Rowan"},{"full_name":"Visan, Monica","last_name":"Visan","id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica"},{"first_name":"Zehua","full_name":"Zhao, Zehua","last_name":"Zhao"}],"doi":"10.1007/s00209-025-03821-8","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","abstract":[{"text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3.","lang":"eng"}],"scopus_import":"1","quality_controlled":"1","extern":"1","external_id":{"arxiv":["2403.09989"]},"volume":311,"article_processing_charge":"No","publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"date_published":"2025-07-24T00:00:00Z","citation":{"ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","ama":"Fan C, Killip R, Vişan M, Zhao Z. Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. 2025;311. doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>","apa":"Fan, C., Killip, R., Vişan, M., &#38; Zhao, Z. (2025). Dispersive decay for the mass-critical nonlinear Schrödinger equation. <i>Mathematische Zeitschrift</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>","mla":"Fan, Chenjie, et al. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>, vol. 311, 21, Springer Nature, 2025, doi:<a href=\"https://doi.org/10.1007/s00209-025-03821-8\">10.1007/s00209-025-03821-8</a>.","chicago":"Fan, Chenjie, Rowan Killip, Monica Vişan, and Zehua Zhao. “Dispersive Decay for the Mass-Critical Nonlinear Schrödinger Equation.” <i>Mathematische Zeitschrift</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00209-025-03821-8\">https://doi.org/10.1007/s00209-025-03821-8</a>.","ieee":"C. Fan, R. Killip, M. Vişan, and Z. Zhao, “Dispersive decay for the mass-critical nonlinear Schrödinger equation,” <i>Mathematische Zeitschrift</i>, vol. 311. Springer Nature, 2025.","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025)."},"publisher":"Springer Nature","_id":"22036","oa_version":"Preprint","intvolume":"       311"},{"status":"public","publication":"Neural Computing and Applications","OA_type":"hybrid","date_created":"2023-02-20T08:23:06Z","arxiv":1,"ddc":["004"],"PlanS_conform":"1","type":"journal_article","article_type":"original","publication_status":"published","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"OA_place":"publisher","file":[{"file_size":500213,"date_updated":"2025-12-30T06:39:11Z","access_level":"open_access","checksum":"61ad4591aee16b1e02daf6c164321a42","relation":"main_file","creator":"dernst","date_created":"2025-12-30T06:39:11Z","content_type":"application/pdf","file_id":"20877","file_name":"2025_NeuralCompApplic_Sukenik.pdf","success":1}],"acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","oa":1,"month":"10","language":[{"iso":"eng"}],"date_updated":"2025-12-30T06:39:56Z","department":[{"_id":"ChLa"}],"quality_controlled":"1","scopus_import":"1","corr_author":"1","external_id":{"arxiv":["2208.13499"]},"author":[{"full_name":"Súkeník, Peter","last_name":"Súkeník","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter"},{"full_name":"Lampert, Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph"}],"has_accepted_license":"1","doi":"10.1007/s00521-024-10616-1","title":"Generalization in multi-objective machine learning","abstract":[{"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.","lang":"eng"}],"page":"24669–24683","file_date_updated":"2025-12-30T06:39:11Z","oa_version":"Published Version","intvolume":"        37","volume":37,"article_processing_charge":"Yes (via OA deal)","citation":{"mla":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>, vol. 37, Springer Nature, 2025, pp. 24669–24683, doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>.","ieee":"P. Súkeník and C. Lampert, “Generalization in multi-objective machine learning,” <i>Neural Computing and Applications</i>, vol. 37. Springer Nature, pp. 24669–24683, 2025.","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683.","chicago":"Súkeník, Peter, and Christoph Lampert. “Generalization in Multi-Objective Machine Learning.” <i>Neural Computing and Applications</i>. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>.","ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 24669–24683.","ama":"Súkeník P, Lampert C. Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. 2025;37:24669–24683. doi:<a href=\"https://doi.org/10.1007/s00521-024-10616-1\">10.1007/s00521-024-10616-1</a>","apa":"Súkeník, P., &#38; Lampert, C. (2025). Generalization in multi-objective machine learning. <i>Neural Computing and Applications</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00521-024-10616-1\">https://doi.org/10.1007/s00521-024-10616-1</a>"},"publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"date_published":"2025-10-01T00:00:00Z","publisher":"Springer Nature","_id":"12662"},{"file":[{"content_type":"application/pdf","file_id":"20828","success":1,"file_name":"2025_ICML_Sieberling.pdf","date_created":"2025-12-16T12:32:40Z","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","creator":"dernst","relation":"main_file","access_level":"open_access","file_size":908379,"date_updated":"2025-12-16T12:32:40Z"}],"OA_place":"publisher","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","year":"2025","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","publication_status":"published","department":[{"_id":"DaAl"}],"month":"05","language":[{"iso":"eng"}],"date_updated":"2025-12-16T12:34:32Z","oa":1,"ddc":["000"],"arxiv":1,"alternative_title":["PMLR"],"OA_type":"gold","date_created":"2025-12-14T23:02:05Z","status":"public","publication":"42nd International Conference on Machine Learning","file_date_updated":"2025-12-16T12:32:40Z","intvolume":"       267","oa_version":"Published Version","page":"55556-55590","_id":"20820","citation":{"ieee":"O. Sieberling, D. Kuznedelev, E. Kurtic, and D.-A. Alistarh, “EvoPress: Accurate dynamic model compression via evolutionary search,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 55556–55590.","short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.","chicago":"Sieberling, Oliver, Denis Kuznedelev, Eldar Kurtic, and Dan-Adrian Alistarh. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” In <i>42nd International Conference on Machine Learning</i>, 267:55556–90. ML Research Press, 2025.","mla":"Sieberling, Oliver, et al. “EvoPress: Accurate Dynamic Model Compression via Evolutionary Search.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 55556–90.","apa":"Sieberling, O., Kuznedelev, D., Kurtic, E., &#38; Alistarh, D.-A. (2025). EvoPress: Accurate dynamic model compression via evolutionary search. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 55556–55590). Vancouver, Canada: ML Research Press.","ama":"Sieberling O, Kuznedelev D, Kurtic E, Alistarh D-A. EvoPress: Accurate dynamic model compression via evolutionary search. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:55556-55590.","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."},"publication_identifier":{"eissn":["2640-3498"]},"date_published":"2025-05-01T00:00:00Z","publisher":"ML Research Press","article_processing_charge":"No","volume":267,"external_id":{"arxiv":["2410.14649"]},"quality_controlled":"1","scopus_import":"1","corr_author":"1","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","name":"ICML: International Conference on Machine Learning","end_date":"2025-07-19"},"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."}],"title":"EvoPress: Accurate dynamic model compression via evolutionary search","author":[{"full_name":"Sieberling, Oliver","last_name":"Sieberling","first_name":"Oliver"},{"first_name":"Denis","full_name":"Kuznedelev, Denis","last_name":"Kuznedelev"},{"first_name":"Eldar","full_name":"Kurtic, Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"has_accepted_license":"1"},{"conference":{"end_date":"2025-07-19","location":"Vancouver, Canada","name":"ICML: International Conference on Machine Learning","start_date":"2025-07-13"},"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."}],"title":"Layer-wise quantization for quantized optimistic dual averaging","has_accepted_license":"1","author":[{"full_name":"Nguyen, Anh Duc","last_name":"Nguyen","first_name":"Anh Duc"},{"id":"D0CF4148-C985-11E9-8066-0BDEE5697425","last_name":"Markov","full_name":"Markov, Ilia","first_name":"Ilia"},{"first_name":"Frank Zhengqing","full_name":"Wu, Frank Zhengqing","last_name":"Wu"},{"full_name":"Ramezani-Kebrya, Ali","last_name":"Ramezani-Kebrya","first_name":"Ali"},{"last_name":"Antonakopoulos","full_name":"Antonakopoulos, Kimon","first_name":"Kimon"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X"},{"first_name":"Volkan","full_name":"Cevher, Volkan","last_name":"Cevher"}],"external_id":{"arxiv":["2505.14371"]},"scopus_import":"1","quality_controlled":"1","_id":"20821","date_published":"2025-05-01T00:00:00Z","citation":{"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.","apa":"Nguyen, A. D., Markov, I., Wu, F. Z., Ramezani-Kebrya, A., Antonakopoulos, K., Alistarh, D.-A., &#38; Cevher, V. (2025). Layer-wise quantization for quantized optimistic dual averaging. In <i>42nd International Conference on Machine Learning</i> (Vol. 267, pp. 46026–46072). Vancouver, Canada: ML Research Press.","ama":"Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic dual averaging. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:46026-46072.","chicago":"Nguyen, Anh Duc, Ilia Markov, Frank Zhengqing Wu, Ali Ramezani-Kebrya, Kimon Antonakopoulos, Dan-Adrian Alistarh, and Volkan Cevher. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” In <i>42nd International Conference on Machine Learning</i>, 267:46026–72. ML Research Press, 2025.","ieee":"A. D. Nguyen <i>et al.</i>, “Layer-wise quantization for quantized optimistic dual averaging,” in <i>42nd International Conference on Machine Learning</i>, Vancouver, Canada, 2025, vol. 267, pp. 46026–46072.","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.","mla":"Nguyen, Anh Duc, et al. “Layer-Wise Quantization for Quantized Optimistic Dual Averaging.” <i>42nd International Conference on Machine Learning</i>, vol. 267, ML Research Press, 2025, pp. 46026–72."},"publication_identifier":{"eissn":["2640-3498"]},"publisher":"ML Research Press","article_processing_charge":"No","volume":267,"file_date_updated":"2025-12-16T12:45:41Z","intvolume":"       267","oa_version":"Published Version","project":[{"_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","grant_number":"101158077","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning"}],"page":"46026-46072","alternative_title":["PMLR"],"arxiv":1,"ddc":["000"],"OA_type":"gold","date_created":"2025-12-14T23:02:06Z","status":"public","publication":"42nd International Conference on Machine Learning","department":[{"_id":"DaAl"}],"language":[{"iso":"eng"}],"date_updated":"2025-12-16T12:46:54Z","oa":1,"month":"05","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).","file":[{"date_created":"2025-12-16T12:45:41Z","content_type":"application/pdf","file_id":"20830","file_name":"2025_ICML_Nguyen.pdf","success":1,"file_size":756213,"access_level":"open_access","date_updated":"2025-12-16T12:45:41Z","checksum":"a7edf0e4304171a3e035842b3aab1704","relation":"main_file","creator":"dernst"}],"OA_place":"publisher","year":"2025","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png"},"type":"conference","publication_status":"published"},{"oa_version":"Published Version","publication_identifier":{"eissn":["2308-1317"],"issn":["2308-1309"]},"citation":{"apa":"Helfter, M. (2025). Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. EMS Press. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>","ama":"Helfter M. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. <i>Journal of Fractal Geometry</i>. 2025. doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>","ista":"Helfter M. 2025. Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces. Journal of Fractal Geometry.","chicago":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>. EMS Press, 2025. <a href=\"https://doi.org/10.4171/jfg/177\">https://doi.org/10.4171/jfg/177</a>.","ieee":"M. Helfter, “Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces,” <i>Journal of Fractal Geometry</i>. EMS Press, 2025.","short":"M. Helfter, Journal of Fractal Geometry (2025).","mla":"Helfter, Mathieu. “Sets with Arbitrary Hausdorff and Packing Scales in Infinite Dimensional Banach Spaces.” <i>Journal of Fractal Geometry</i>, EMS Press, 2025, doi:<a href=\"https://doi.org/10.4171/jfg/177\">10.4171/jfg/177</a>."},"date_published":"2025-11-07T00:00:00Z","publisher":"EMS Press","_id":"20839","article_processing_charge":"Yes","quality_controlled":"1","scopus_import":"1","corr_author":"1","title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","abstract":[{"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.","lang":"eng"}],"author":[{"last_name":"Helfter","id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57","full_name":"Helfter, Mathieu","first_name":"Mathieu"}],"doi":"10.4171/jfg/177","main_file_link":[{"url":"https://doi.org/10.4171/jfg/177","open_access":"1"}],"DOAJ_listed":"1","OA_place":"publisher","type":"journal_article","publication_status":"epub_ahead","article_type":"original","day":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2025","department":[{"_id":"VaKa"}],"language":[{"iso":"eng"}],"month":"11","oa":1,"date_updated":"2026-06-18T18:26:33Z","ddc":["500"],"status":"public","publication":"Journal of Fractal Geometry","OA_type":"gold","date_created":"2025-12-19T10:15:37Z"}]