[{"_id":"22404","quality_controlled":"1","article_processing_charge":"No","OA_type":"green","department":[{"_id":"RoSe"},{"_id":"GradSch"}],"abstract":[{"text":"We consider a class of two-dimensional tight binding models displaying conical intersections of the Bloch bands at the Fermi level. The setting includes the case of generic transitions between quantum Hall phases. We consider the longitudinal conductivity, as given by Kubo formula, describing the variation of the current after introducing a space-homogeneous electric field, in an adiabatic way. We obtain an explicit expression for the longitudinal conductivity, completely determined by the number of conical intersections and by the shape of the cones. In particular, the formula reproduces the known quantized values found for graphene and for the critical Haldane model. Furthermore, we discuss the validity of Kubo formula in presence of conical intersections in the spectrum, starting from the time-dependent Schrödinger equation. For electric fields which are weak and slowly varying in space and in time, we prove the validity of linear response from quantum dynamics.","lang":"eng"}],"title":"Longitudinal conductivity at integer quantum Hall transitions","type":"journal_article","status":"public","intvolume":"       116","supplementarymaterial":"no","year":"2026","mathsc":["81V70"],"researchdata_availability":"not applicable","volume":116,"issue":"4","publisher":"Springer Nature","publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","day":"01","arxiv":1,"publication_identifier":{"issn":["0377-9017"],"eissn":["1573-0530"]},"citation":{"mla":"Marcelli, Giovanna, et al. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” <i>Letters in Mathematical Physics</i>, vol. 116, no. 4, 82, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1007/s11005-026-02087-3\">10.1007/s11005-026-02087-3</a>.","apa":"Marcelli, G., Pigozzi, L., &#38; Porta, M. (2026). Longitudinal conductivity at integer quantum Hall transitions. <i>Letters in Mathematical Physics</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s11005-026-02087-3\">https://doi.org/10.1007/s11005-026-02087-3</a>","ieee":"G. Marcelli, L. Pigozzi, and M. Porta, “Longitudinal conductivity at integer quantum Hall transitions,” <i>Letters in Mathematical Physics</i>, vol. 116, no. 4. Springer Nature, 2026.","ista":"Marcelli G, Pigozzi L, Porta M. 2026. Longitudinal conductivity at integer quantum Hall transitions. Letters in Mathematical Physics. 116(4), 82.","short":"G. Marcelli, L. Pigozzi, M. Porta, Letters in Mathematical Physics 116 (2026).","ama":"Marcelli G, Pigozzi L, Porta M. Longitudinal conductivity at integer quantum Hall transitions. <i>Letters in Mathematical Physics</i>. 2026;116(4). doi:<a href=\"https://doi.org/10.1007/s11005-026-02087-3\">10.1007/s11005-026-02087-3</a>","chicago":"Marcelli, Giovanna, Lorenzo Pigozzi, and Marcello Porta. “Longitudinal Conductivity at Integer Quantum Hall Transitions.” <i>Letters in Mathematical Physics</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1007/s11005-026-02087-3\">https://doi.org/10.1007/s11005-026-02087-3</a>."},"dataavailabilitystatement":"Data sharing is not applicable to this article as no datasets were generated or analyzed during the current study.","acknowledgement":"G. M. and M. P. acknowledge support by the European Research Council through the ERC-StG MaMBoQ, n. 802901. G. M. acknowledges financial support from the Independent Research Fund Denmark–Natural Sciences, grant DFF–10.46540/2032-00005B and from the European Research Council through the ERC CoG UniCoSM, grant agreement n.724939. M. P. acknowledges support from the MUR, PRIN 2022 project MaIQuFi cod. 20223J85K3. This work has been carried out under the auspices of the GNFM of INdAM. We thank the anonymous referees for comments on a previous version of this manuscript.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Letters in Mathematical Physics","date_created":"2026-07-26T22:01:40Z","das_tickbox":"1","author":[{"last_name":"Marcelli","full_name":"Marcelli, Giovanna","first_name":"Giovanna"},{"id":"efb8f850-3208-11ee-ac71-8c4f5803b9c6","first_name":"Lorenzo","full_name":"Pigozzi, Lorenzo","last_name":"Pigozzi"},{"first_name":"Marcello","full_name":"Porta, Marcello","last_name":"Porta"}],"month":"08","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2503.01381"}],"article_type":"original","OA_place":"repository","doi":"10.1007/s11005-026-02087-3","article_number":"82","external_id":{"arxiv":["2503.01381"]},"date_published":"2026-08-01T00:00:00Z","oa_version":"Preprint","date_updated":"2026-07-29T10:51:55Z"},{"publication_identifier":{"eissn":["3117-4604"]},"arxiv":1,"language":[{"iso":"eng"}],"day":"13","publication_status":"published","publisher":"EPI Sciences","publication":"Annals of Formalized Mathematics","das_tickbox":"0","date_created":"2026-07-29T09:06:55Z","acknowledgement":"We would like to thank David Bartl and Jasmin Blanchette for frequent consultations.\r\nWe would also like to express gratitude to Henrik Böving for a help with generalization\r\nfrom extended rationals to extended linearly ordered fields and to Andrew Yang for the\r\nproof of Finset.univ_sum_of_zero_when_not. We would also like to acknowledge Antoine\r\nChambert-Loir, Apurva Nakade, Yaël Dillies, Richard Copley, Edward van de Meent, Markus\r\nHimmel, Mario Carneiro, and Kevin Buzzard.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” <i>Annals of Formalized Mathematics</i>, vol. 2, 14253, EPI Sciences, 2026, doi:<a href=\"https://doi.org/10.46298/afm.14253\">10.46298/afm.14253</a>.","apa":"Dvorak, M., &#38; Kolmogorov, V. (2026). Duality theory in linear optimization and its extensions -- formally verified. <i>Annals of Formalized Mathematics</i>. EPI Sciences. <a href=\"https://doi.org/10.46298/afm.14253\">https://doi.org/10.46298/afm.14253</a>","ieee":"M. Dvorak and V. Kolmogorov, “Duality theory in linear optimization and its extensions -- formally verified,” <i>Annals of Formalized Mathematics</i>, vol. 2. EPI Sciences, 2026.","ista":"Dvorak M, Kolmogorov V. 2026. Duality theory in linear optimization and its extensions -- formally verified. Annals of Formalized Mathematics. 2, 14253.","ama":"Dvorak M, Kolmogorov V. Duality theory in linear optimization and its extensions -- formally verified. <i>Annals of Formalized Mathematics</i>. 2026;2. doi:<a href=\"https://doi.org/10.46298/afm.14253\">10.46298/afm.14253</a>","short":"M. Dvorak, V. Kolmogorov, Annals of Formalized Mathematics 2 (2026).","chicago":"Dvorak, Martin, and Vladimir Kolmogorov. “Duality Theory in Linear Optimization and Its Extensions -- Formally Verified.” <i>Annals of Formalized Mathematics</i>. EPI Sciences, 2026. <a href=\"https://doi.org/10.46298/afm.14253\">https://doi.org/10.46298/afm.14253</a>."},"OA_place":"publisher","article_type":"original","doi":"10.46298/afm.14253","PlanS_conform":"1","month":"03","corr_author":"1","ddc":["500"],"author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","last_name":"Dvorak","first_name":"Martin"},{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2026-07-29T10:50:17Z","date_published":"2026-03-13T00:00:00Z","article_number":"14253","external_id":{"arxiv":["2409.08119"]},"OA_type":"hybrid","article_processing_charge":"Yes (in subscription journal)","_id":"22607","quality_controlled":"1","type":"journal_article","abstract":[{"text":"Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take \"infinite values\".\r\nCode: https://github.com/madvorak/duality/tree/v3.2.0","lang":"eng"}],"title":"Duality theory in linear optimization and its extensions -- formally verified","department":[{"_id":"VlKo"},{"_id":"GradSch"}],"keyword":["Farkas lemma","linear programming","extended reals","calculus of inductive constructions"],"related_material":{"record":[{"id":"20071","status":"public","relation":"earlier_version"}]},"year":"2026","supplementarymaterial":"no","status":"public","intvolume":"         2","volume":2,"has_accepted_license":"1","researchdata_availability":"no","mathsc":["68V20","15A39","90C05"]},{"researchdata_availability":"upon request","pmid":1,"has_accepted_license":"1","status":"public","year":"2026","supplementarymaterial":"yes","department":[{"_id":"StFr"},{"_id":"ScWa"}],"type":"journal_article","title":"Ion transfer during ionomer contact electrification: Binding affinity controls charging","abstract":[{"lang":"eng","text":"Contact electrification occurs ubiquitously in nature, but the identity of charge carriers in most situations remains uncertain, with electrons, ions, or nanoscopic material fragments as viable candidates. One material where the species transferred seems more certain is ionomers, i.e., polymers that contain mobile ions balanced by fixed counter‐charges. When ionomers touch a neutral surface, the latter becomes charged in the sign of the mobile ion, strongly suggesting ion transfer. However, the mechanism and governing factors of transfer remain poorly understood. Here, we demonstrate that binding affinity between mobile ion and ionomer controls charge transfer with ionomers. We use ionomers with fixed anions and cations and perform ion exchange to create samples with a series of transferrable ions. We observe a strong binding‐affinity dependence for the anionic ionomer, such that mobile cations with the highest affinity transfers the least charge. Weaker, yet clear dependence was measured for the cationic ionomer, which follows the hydration free energy of the mobile anion. Using inductively coupled plasma optical emission spectroscopy (ICP‐OES), we confirm transfer of the mobile ions to the counter sample's surface. Our results confirm the identify and mechanism of charge transfer with ionomeric materials, with potential implications for contact electrification more broadly."}],"quality_controlled":"1","_id":"22602","OA_type":"hybrid","acknowledged_ssus":[{"_id":"LifeSc"}],"article_processing_charge":"Yes (via OA deal)","external_id":{"pmid":["42478784"]},"article_number":"e5487708","date_updated":"2026-07-29T11:25:58Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2026-07-21T00:00:00Z","author":[{"first_name":"John R","last_name":"Hoffman Jr","full_name":"Hoffman Jr, John R","id":"0cf4072c-94e2-11ee-bdf9-90a13138901e"},{"id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","orcid":"0000-0003-2902-5319","last_name":"Freunberger","full_name":"Freunberger, Stefan Alexander","first_name":"Stefan Alexander"},{"first_name":"Scott R","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","orcid":"0000-0002-2299-3176","id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1002/anie.5487708","OA_place":"publisher","article_type":"original","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.5487708"}],"ddc":["540"],"corr_author":"1","month":"07","dataavailabilitystatement":"The data that support the findings of this study are available from the corresponding author upon reasonable request.","citation":{"mla":"Hoffman Jr, John R., et al. “Ion Transfer during Ionomer Contact Electrification: Binding Affinity Controls Charging.” <i>Angewandte Chemie International Edition</i>, e5487708, Wiley, 2026, doi:<a href=\"https://doi.org/10.1002/anie.5487708\">10.1002/anie.5487708</a>.","ieee":"J. R. Hoffman Jr, S. A. Freunberger, and S. R. Waitukaitis, “Ion transfer during ionomer contact electrification: Binding affinity controls charging,” <i>Angewandte Chemie International Edition</i>. Wiley, 2026.","short":"J.R. Hoffman Jr, S.A. Freunberger, S.R. Waitukaitis, Angewandte Chemie International Edition (2026).","ista":"Hoffman Jr JR, Freunberger SA, Waitukaitis SR. 2026. Ion transfer during ionomer contact electrification: Binding affinity controls charging. Angewandte Chemie International Edition., e5487708.","chicago":"Hoffman Jr, John R, Stefan Alexander Freunberger, and Scott R Waitukaitis. “Ion Transfer during Ionomer Contact Electrification: Binding Affinity Controls Charging.” <i>Angewandte Chemie International Edition</i>. Wiley, 2026. <a href=\"https://doi.org/10.1002/anie.5487708\">https://doi.org/10.1002/anie.5487708</a>.","ama":"Hoffman Jr JR, Freunberger SA, Waitukaitis SR. Ion transfer during ionomer contact electrification: Binding affinity controls charging. <i>Angewandte Chemie International Edition</i>. 2026. doi:<a href=\"https://doi.org/10.1002/anie.5487708\">10.1002/anie.5487708</a>","apa":"Hoffman Jr, J. R., Freunberger, S. A., &#38; Waitukaitis, S. R. (2026). Ion transfer during ionomer contact electrification: Binding affinity controls charging. <i>Angewandte Chemie International Edition</i>. Wiley. <a href=\"https://doi.org/10.1002/anie.5487708\">https://doi.org/10.1002/anie.5487708</a>"},"das_tickbox":"1","date_created":"2026-07-28T18:04:19Z","publication":"Angewandte Chemie International Edition","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the Scientific Service Units (SSU) of IST-Austria through resources provided by the Lab Support Facility (LSF).\r\nOpen Access funding provided by Institute of Science and Technology Austria.","publication_status":"epub_ahead","publisher":"Wiley","publication_identifier":{"eissn":["1521-3773"],"issn":["1433-7851"]},"day":"21","language":[{"iso":"eng"}],"scopus_import":"1"},{"doi":"10.15479/AT-ISTA-21393","degree_awarded":"PhD","OA_place":"repository","oa":1,"ddc":["511","000"],"month":"03","corr_author":"1","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","full_name":"Dvorak, Martin","last_name":"Dvorak","first_name":"Martin"}],"date_updated":"2026-07-29T12:56:52Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2026-03-04T00:00:00Z","supervisor":[{"full_name":"Kolmogorov, Vladimir","last_name":"Kolmogorov","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Blanchette, Jasmin","last_name":"Blanchette","first_name":"Jasmin"}],"publication_identifier":{"issn":["2663-337X"],"isbn":["978-3-99078-074-9"]},"day":"04","language":[{"iso":"eng"}],"publication_status":"published","publisher":"Institute of Science and Technology Austria","date_created":"2026-03-04T09:26:46Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"apa":"Dvorak, M. (2026). <i>Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-21393\">https://doi.org/10.15479/AT-ISTA-21393</a>","ama":"Dvorak M. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21393\">10.15479/AT-ISTA-21393</a>","short":"M. Dvorak, Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids, Institute of Science and Technology Austria, 2026.","chicago":"Dvorak, Martin. “Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-21393\">https://doi.org/10.15479/AT-ISTA-21393</a>.","ista":"Dvorak M. 2026. Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids. Institute of Science and Technology Austria.","ieee":"M. Dvorak, “Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids,” Institute of Science and Technology Austria, 2026.","mla":"Dvorak, Martin. <i>Pursuit of Truth and Beauty in Lean 4: Formally Verified Theory of Grammars, Optimization, Matroids</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-21393\">10.15479/AT-ISTA-21393</a>."},"year":"2026","file":[{"relation":"main_file","file_name":"2026_Dvorak_Martin_Thesis.pdf","date_created":"2026-03-04T08:56:15Z","date_updated":"2026-03-04T08:56:15Z","creator":"mdvorak","content_type":"application/pdf","file_size":1771231,"file_id":"21394","access_level":"open_access","checksum":"cface6dc18152680962b5361575f6e4f","success":1},{"relation":"source_file","file_name":"2026_Dvorak_Martin_Thesis.docx","date_updated":"2026-03-04T09:03:37Z","date_created":"2026-03-04T09:03:37Z","creator":"mdvorak","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","checksum":"290ddfacfb7e07fb07e6f0b334e67c90","access_level":"closed","file_size":864585,"file_id":"21395"}],"doi_confirm":"1","status":"public","has_accepted_license":"1","file_date_updated":"2026-03-04T09:03:37Z","article_processing_charge":"No","_id":"21393","page":"160","type":"dissertation","title":"Pursuit of truth and beauty in Lean 4: Formally verified theory of grammars, optimization, matroids","abstract":[{"text":"This thesis documents a voyage towards truth and beauty via formal verification of theorems. To this end, we develop libraries in Lean 4 that present definitions and results from diverse areas of MathematiCS (i.e., Mathematics and Computer Science). The aim is to create code that is understandable, believable, useful, and elegant. The code should stand for itself as much as possible without a need for documentation; however, this text redundantly documents our code artifacts and provides additional context that isn’t present in the code. This thesis is written for readers who know Lean 4 but are not familiar with any of the topics presented. We manifest truth and beauty in three formalized areas of MathematiCS.\r\n\r\nWe formalize general grammars in Lean 4 and use grammars to show closure of the class of type-0 languages under four operations; union, reversal, concatenation, and the Kleene star.\r\n\r\nOur second stop is the theory of optimization. Farkas established that a system of linear inequalities has a solution if and only if we cannot obtain a contradiction by taking a linear combination of the inequalities. We state and formally prove several Farkas-like theorems over linearly ordered fields in Lean 4. Furthermore, we extend duality theory to the case when some coefficients are allowed to take “infinite values”. Additionally, we develop the basics of the theory of optimization in terms of the framework called General-Valued Constraint Satisfaction Problems, and we prove that, if a Rational-Valued Constraint Satisfaction Problem template has symmetric fractional polymorphisms of all arities, then its basic LP relaxation is tight.\r\n\r\nOur third stop is matroid theory. Seymour’s decomposition theorem is a hallmark result in matroid theory, presenting a structural characterization of the class of regular matroids. We aim to formally verify Seymour’s theorem in Lean 4. First, we build a library for working with totally unimodular matrices. We define binary matroids and their standard representations, and we prove that they form a matroid in the sense how Mathlib defines matroids. We define regular matroids to be matroids for which there exists a full representation rational matrix that is totally unimodular, and we prove that all regular matroids are binary. We define 1-sum, 2-sum, and 3 sum of binary matroids as specific ways to compose their standard representation matrices. We prove that the 1-sum, the 2-sum, and the 3-sum of regular matroids are a regular matroid, which concludes the composition direction of the Seymour’s theorem. The (more difficult) decomposition direction remains unproved.\r\n\r\nIn the pursuit of truth, we focus on identifying the trusted code in each project and presenting it faithfully. We emphasize the readability and believability of definitions rather than choosing definitions that are easier to work with. In search for beauty, we focus on the philosophical framework of Roger Scruton, who emphasizes that beauty is not a mere decoration but, most importantly, beauty is the means for shaping our place in the world and a source of redemption, where it can be viewed as a substitute for religion.","lang":"eng"}],"department":[{"_id":"GradSch"},{"_id":"VlKo"}],"alternative_title":["ISTA Thesis"],"related_material":{"link":[{"url":"https://github.com/madvorak/duality/tree/v3.5.0","relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 3.1 (Linear duality)"},{"url":"https://github.com/madvorak/vcsp/tree/v8.2.0","relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 3.2 (Valued Constraint Satisfaction Problems)"},{"description":"Full version of all definitions, statements, and proofs for Chapter 4 (Seymour project)","relation":"software","url":"https://github.com/Ivan-Sergeyev/seymour/tree/v1.2.0"},{"url":"https://github.com/madvorak/chomsky/tree/v1.2.0","relation":"software","description":"Full version of all definitions, statements, and proofs for Chapter 5 (Theory of grammars)"},{"description":"Old version (Lean 3) of the project about grammars","url":"https://github.com/madvorak/grammars","relation":"software"},{"description":"Demonstration of (minimal) requirements for selected algebraic classes used in my Ph.D. thesis","url":"https://github.com/madvorak/preliminaries/blob/main/Preliminaries.lean","relation":"software"}],"record":[{"id":"13120","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"20071"},{"status":"public","id":"21398","relation":"part_of_dissertation"}]}},{"supplementarymaterial":"yes","year":"2026","file":[{"content_type":"application/pdf","date_created":"2026-07-23T11:14:05Z","creator":"dernst","date_updated":"2026-07-23T11:14:05Z","file_name":"2026_DiscreteCompGeom_Aronov.pdf","relation":"main_file","success":1,"access_level":"open_access","checksum":"a32774a0d14f46cafbd77bfb9d9ac4b6","file_id":"22395","file_size":525281}],"intvolume":"        75","status":"public","volume":75,"has_accepted_license":"1","file_date_updated":"2026-07-23T11:14:05Z","researchdata_availability":"no","article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid","page":"1331-1355","quality_controlled":"1","_id":"19860","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"}],"type":"journal_article","related_material":{"record":[{"relation":"earlier_version","id":"18917","status":"public"},{"relation":"dissertation_contains","status":"public","id":"20339"}],"link":[{"url":"https://doi.org/10.1007/s00454-025-00759-w","relation":"erratum"}]},"department":[{"_id":"UlWa"}],"isi":1,"oa":1,"ddc":["500"],"PlanS_conform":"1","month":"06","doi":"10.1007/s00454-025-00739-0","article_type":"original","OA_place":"publisher","author":[{"full_name":"Aronov, Boris","last_name":"Aronov","first_name":"Boris"},{"last_name":"Basit","full_name":"Basit, Abdul","first_name":"Abdul"},{"first_name":"Indu","last_name":"Ramesh","full_name":"Ramesh, Indu"},{"first_name":"Gianluca","last_name":"Tasinato","full_name":"Tasinato, Gianluca","id":"0433290C-AF8F-11E9-A4C7-F729E6697425"},{"id":"36690CA2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1494-0568","full_name":"Wagner, Uli","last_name":"Wagner","first_name":"Uli"}],"date_published":"2026-06-01T00:00:00Z","date_updated":"2026-07-29T13:13:17Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","external_id":{"isi":["001506904300001"],"arxiv":["2403.02627"]},"day":"01","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"arxiv":1,"publisher":"Springer Nature","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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.","das_tickbox":"0","date_created":"2025-06-22T22:02:07Z","publication":"Discrete & Computational Geometry","citation":{"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>","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>.","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>","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.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, Discrete &#38; Computational Geometry 75 (2026) 1331–1355.","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.","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>."}},{"article_processing_charge":"Yes","OA_type":"gold","_id":"22408","quality_controlled":"1","abstract":[{"text":"Solitons—localized wave packets that travel without spreading—play a central role in understanding transport and properties of nonlinear systems. In quantum many-body systems, however, such robust excitations are typically destroyed by thermalization. Here, we theoretically demonstrate the existence of solitonic excitations in high-energy states of Rydberg atom chains in the regime of strong nearest-neighbor Rydberg blockade. These localized wave packets propagate directionally atop a special class of reviving initial states related to quantum many-body scars and are capable of carrying energy. Exhibiting long coherence times, these states constitute a form of non-ergodic quantum dynamics and can be efficiently implemented on Rydberg atom simulators. In this work, in addition to a phenomenological description of solitons, we identify their counterpart in a classical nonlinear dynamical system, demonstrate their potential use in quantum information transfer, and conjecture their relevance for anomalous energy transport reported in numerical studies of Rydberg atom arrays.","lang":"eng"}],"title":"Quasi-solitons in Rydberg atom chains","type":"journal_article","department":[{"_id":"MaSe"},{"_id":"GradSch"}],"ec_funded":1,"supplementarymaterial":"yes","year":"2026","status":"public","has_accepted_license":"1","language":[{"iso":"eng"}],"day":"17","project":[{"call_identifier":"H2020","grant_number":"101034413","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","name":"IST-BRIDGE: International postdoctoral program"}],"publication_identifier":{"eissn":["2041-1723"]},"publisher":"Springer Nature","publication_status":"epub_ahead","acknowledgement":"We acknowledge useful discussions with J.-S. Caux, E. Demler, J. Dubail, F. Essler, J. Feldmeier, S. Garratt, W. W. Ho, M. Lukin, Z. Papic, S. Rotter, F. Surace, and R. Vasseur. J.-Y.D. acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M. L. acknowledges support by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy—EXC-2111—390814868. We acknowledge support by the Erwin Schrödinger International Institute for Mathematics and Physics (ESI). This research was funded in part by the Austrian Science Fund (FWF) https://doi.org/10.55776/COE1 and the European Union—NextGenerationEU. This research was supported in part by grant NSF PHY2309135 to the Kavli Institute for Theoretical Physics (KITP).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"Nature Communications","date_created":"2026-07-27T07:26:27Z","citation":{"mla":"Kerschbaumer, Aron, et al. “Quasi-Solitons in Rydberg Atom Chains.” <i>Nature Communications</i>, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-75598-1\">10.1038/s41467-026-75598-1</a>.","apa":"Kerschbaumer, A., Desaules, J.-Y. M., Ljubotina, M., &#38; Serbyn, M. (2026). Quasi-solitons in Rydberg atom chains. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-75598-1\">https://doi.org/10.1038/s41467-026-75598-1</a>","ieee":"A. Kerschbaumer, J.-Y. M. Desaules, M. Ljubotina, and M. Serbyn, “Quasi-solitons in Rydberg atom chains,” <i>Nature Communications</i>. Springer Nature, 2026.","ista":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. 2026. Quasi-solitons in Rydberg atom chains. Nature Communications.","ama":"Kerschbaumer A, Desaules J-YM, Ljubotina M, Serbyn M. Quasi-solitons in Rydberg atom chains. <i>Nature Communications</i>. 2026. doi:<a href=\"https://doi.org/10.1038/s41467-026-75598-1\">10.1038/s41467-026-75598-1</a>","short":"A. Kerschbaumer, J.-Y.M. Desaules, M. Ljubotina, M. Serbyn, Nature Communications (2026).","chicago":"Kerschbaumer, Aron, Jean-Yves Marc Desaules, Marko Ljubotina, and Maksym Serbyn. “Quasi-Solitons in Rydberg Atom Chains.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-75598-1\">https://doi.org/10.1038/s41467-026-75598-1</a>."},"month":"07","corr_author":"1","PlanS_conform":"1","ddc":["530"],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1038/s41467-026-75598-1","open_access":"1"}],"article_type":"original","OA_place":"publisher","doi":"10.1038/s41467-026-75598-1","DOAJ_listed":"1","author":[{"id":"ade85a9c-3200-11ee-973b-91c1eb240410","orcid":"0009-0002-2370-8661","last_name":"Kerschbaumer","full_name":"Kerschbaumer, Aron","first_name":"Aron"},{"id":"6c292945-a610-11ed-9eec-c3be1ad62a80","orcid":"0000-0002-3749-6375","full_name":"Desaules, Jean-Yves Marc","last_name":"Desaules","first_name":"Jean-Yves Marc"},{"orcid":"0000-0003-0038-7068","id":"F75EE9BE-5C90-11EA-905D-16643DDC885E","first_name":"Marko","last_name":"Ljubotina","full_name":"Ljubotina, Marko"},{"orcid":"0000-0002-2399-5827","id":"47809E7E-F248-11E8-B48F-1D18A9856A87","first_name":"Maksym","last_name":"Serbyn","full_name":"Serbyn, Maksym"}],"date_published":"2026-07-17T00:00:00Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-07-30T05:42:17Z"},{"date_published":"2026-12-01T00:00:00Z","date_updated":"2026-07-30T07:24:55Z","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"oa_version":"Published Version","external_id":{"pmid":["41997932"]},"article_number":"5325","ddc":["000"],"oa":1,"month":"12","corr_author":"1","doi":"10.1038/s41467-026-71777-2","OA_place":"publisher","article_type":"original","author":[{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","orcid":"0000-0002-1419-3267","full_name":"Svoboda, Jakub","last_name":"Svoboda","first_name":"Jakub"},{"full_name":"Nemati, Hossein","last_name":"Nemati","first_name":"Hossein"},{"first_name":"Josef","full_name":"Tkadlec, Josef","last_name":"Tkadlec","orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kaveh, Kamran","last_name":"Kaveh","first_name":"Kamran"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu"}],"DOAJ_listed":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"J.S. and K.C. were supported by the European Research Council (ERC)\r\nCoG 863818 (ForM-SMArt) and Austrian Science Fund (FWF) 10.55776/\r\nCOE12. J.T. was supported by GAČR grant 25-17377S and by Charles\r\nUniv. projects UNCE 24/SCI/008 and PRIMUS 24/SCI/012.","date_created":"2026-06-21T22:02:59Z","das_tickbox":"1","publication":"Nature Communications","citation":{"apa":"Svoboda, J., Nemati, H., Tkadlec, J., Kaveh, K., &#38; Chatterjee, K. (2026). The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>","ieee":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, and K. Chatterjee, “The effect of the fitness gradient on fixation probability,” <i>Nature Communications</i>, vol. 17. Springer Nature, 2026.","ista":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. 2026. The effect of the fitness gradient on fixation probability. Nature Communications. 17, 5325.","ama":"Svoboda J, Nemati H, Tkadlec J, Kaveh K, Chatterjee K. The effect of the fitness gradient on fixation probability. <i>Nature Communications</i>. 2026;17. doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>","short":"J. Svoboda, H. Nemati, J. Tkadlec, K. Kaveh, K. Chatterjee, Nature Communications 17 (2026).","chicago":"Svoboda, Jakub, Hossein Nemati, Josef Tkadlec, Kamran Kaveh, and Krishnendu Chatterjee. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>. Springer Nature, 2026. <a href=\"https://doi.org/10.1038/s41467-026-71777-2\">https://doi.org/10.1038/s41467-026-71777-2</a>.","mla":"Svoboda, Jakub, et al. “The Effect of the Fitness Gradient on Fixation Probability.” <i>Nature Communications</i>, vol. 17, 5325, Springer Nature, 2026, doi:<a href=\"https://doi.org/10.1038/s41467-026-71777-2\">10.1038/s41467-026-71777-2</a>."},"dataavailabilitystatement":"Correspondence and requests for materials should be addressed to Krishnendu Chatterjee.","project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020"}],"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2041-1723"]},"publisher":"Springer Nature","publication_status":"published","volume":17,"has_accepted_license":"1","pmid":1,"researchdata_availability":"no","file_date_updated":"2026-06-24T06:50:24Z","ec_funded":1,"supplementarymaterial":"yes","year":"2026","file":[{"file_size":1068919,"file_id":"22136","checksum":"b660048bb271f24d6763803e247d5c32","access_level":"open_access","success":1,"relation":"main_file","file_name":"2026_NatureComm_Svoboda.pdf","date_created":"2026-06-24T06:50:24Z","date_updated":"2026-06-24T06:50:24Z","creator":"dernst","content_type":"application/pdf"}],"intvolume":"        17","status":"public","title":"The effect of the fitness gradient on fixation probability","abstract":[{"lang":"eng","text":"Evolutionary biology examines how the genetic and phenotypic composition\r\nof populations changes over time. An important goal is to determine the\r\nfixation probability of a single advantageous mutant that arises in a homogeneous\r\npopulation of N residents. Many real populations experience environmental\r\ngradients that cause mutations to be beneficial in some spatial\r\nregions but harmful in others. Here, we study the fixation probability of a\r\nmutant placed on a simple one-dimensional spatial structure that experiences\r\nsuch a gradient. The mutant’s fitness varies linearly from1 − s to 1 + s, whereas\r\nthe resident fitness is constant and equal to 1. The existing literature suggests\r\nthat such heterogeneity in the mutant’s fitness should lead to a decrease in its\r\nfixation probability. However, in this work, we find that small, non-negligible\r\ngradients (s < 1=√N) substantially increase the fixation probability,while larger\r\ngradients (s > (log N)/√N) substantially decrease it.Moreover, we quantify the\r\nstrength of this phenomenon analytically and we precisely delimit the range of\r\nthe gradients for which it occurs. Our computer simulations closely match\r\nthose findings. Altogether, our results indicate that subjecting a simple\r\npopulation structure to natural environmental conditions can produce strong\r\ncounterintuitive effects."}],"type":"journal_article","department":[{"_id":"KrCh"}],"article_processing_charge":"Yes","OA_type":"gold","quality_controlled":"1","_id":"22101"},{"has_accepted_license":"1","file_date_updated":"2026-07-27T13:07:23Z","year":"2026","status":"public","doi_confirm":"1","file":[{"date_updated":"2026-07-27T13:00:07Z","date_created":"2026-07-27T13:00:07Z","creator":"aspasic","content_type":"application/pdf","file_name":"Aleksa_Spasic_Thesis_final.pdf","relation":"main_file","file_id":"22588","file_size":1986078,"success":1,"access_level":"open_access","checksum":"c29880dd71fcc37f23ac6e2843066ede"},{"file_id":"22589","file_size":1868853,"checksum":"4ebe3bd2d833d913c0756343cca5e5f0","access_level":"closed","date_created":"2026-07-27T13:00:22Z","date_updated":"2026-07-27T13:07:23Z","creator":"aspasic","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"Thesis_final.docx","relation":"source_file"}],"type":"dissertation","abstract":[{"text":"Gaining an understanding of how biological regulation evolves is a fundamental research \r\nquestion in both evolutionary biology and molecular genetics. In order to gain more insight \r\ninto this topic, we focus on studying the simple gene regulatory system of the lac operon in \r\nE. coli. We show that simple population genetic models can shed light on evolution \r\nexperiments and that this combined approach of modelling the experimental system gives \r\ninsight to better understand the causes of evolutionary change in the experiment. We also \r\nstudy the natural diversity in the lac operon from 308 publicly available E. coli genomes that \r\ncome from various host species and different regions of the world. Evidence that selection is \r\ngenerally maintaining the function of the lac operon across the sample regardless of host \r\nspecies is provided and we show that different protein coding genes in the operon are under \r\ndifferent selective constraints on protein sequence preservation. A similar frameshift \r\nmutation found in experimental evolution studies is shown to be present in the sample we \r\nanalyzed, indicating that selectively relevant variants in evolution experiments are also \r\npresent in natural populations. We show that there is no simple phylogenetic relationship \r\nbetween host species, geographical location and the lac operon sequence. Finally, we argue \r\nthat a combined approach of comparative genomics, experimental evolution and theoretical \r\nmodelling contributes to a more complete understanding of molecular evolution. ","lang":"eng"}],"title":"Studying the evolutionary systems biology of the lac operon","department":[{"_id":"GradSch"},{"_id":"GaTk"},{"_id":"CaGu"}],"alternative_title":["ISTA Master’s Thesis"],"article_processing_charge":"No","_id":"22399","page":"32","oa_version":"Published Version","date_updated":"2026-07-31T10:52:08Z","date_published":"2026-07-27T00:00:00Z","supervisor":[{"orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","first_name":"Calin C","last_name":"Guet","full_name":"Guet, Calin C"},{"last_name":"Tkačik","full_name":"Tkačik, Gašper","first_name":"Gašper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455"}],"OA_place":"publisher","degree_awarded":"MS","doi":"10.15479/AT-ISTA-22399","corr_author":"1","month":"07","oa":1,"ddc":["576"],"author":[{"id":"ecee9d38-4040-11ef-8843-b941efb445d6","last_name":"Spasić","full_name":"Spasić, Aleksa","first_name":"Aleksa"}],"das_tickbox":"0","date_created":"2026-07-25T13:08:32Z","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"ieee":"A. Spasić, “Studying the evolutionary systems biology of the lac operon,” Institute of Science and Technology Austria, 2026.","short":"A. Spasić, Studying the Evolutionary Systems Biology of the Lac Operon, Institute of Science and Technology Austria, 2026.","ista":"Spasić A. 2026. Studying the evolutionary systems biology of the lac operon. Institute of Science and Technology Austria.","chicago":"Spasić, Aleksa. “Studying the Evolutionary Systems Biology of the Lac Operon.” Institute of Science and Technology Austria, 2026. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>.","ama":"Spasić A. Studying the evolutionary systems biology of the lac operon. 2026. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>","apa":"Spasić, A. (2026). <i>Studying the evolutionary systems biology of the lac operon</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-22399\">https://doi.org/10.15479/AT-ISTA-22399</a>","mla":"Spasić, Aleksa. <i>Studying the Evolutionary Systems Biology of the Lac Operon</i>. Institute of Science and Technology Austria, 2026, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-22399\">10.15479/AT-ISTA-22399</a>."},"publication_identifier":{"issn":["2791-4585"]},"language":[{"iso":"eng"}],"day":"27","publication_status":"published","publisher":"Institute of Science and Technology Austria"},{"author":[{"first_name":"Lorenzo","full_name":"Portinale, Lorenzo","last_name":"Portinale","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Quattrocchi","full_name":"Quattrocchi, Filippo","first_name":"Filippo","id":"3ebd6ba8-edfb-11eb-afb5-91a9745ba308","orcid":"0009-0000-9773-1931"}],"DOAJ_listed":"1","ddc":["500"],"oa":1,"PlanS_conform":"1","month":"06","doi":"10.1017/s0956792524000810","OA_place":"publisher","article_type":"original","external_id":{"isi":["001381435800001"]},"date_published":"2026-06-01T00:00:00Z","date_updated":"2026-08-01T22:31:10Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"publication_status":"published","publisher":"Cambridge University Press","day":"01","project":[{"name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2","grant_number":"F6504"}],"scopus_import":"1","language":[{"iso":"eng"}],"publication_identifier":{"issn":["0956-7925"],"eissn":["1469-4425"]},"citation":{"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>.","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>","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.","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>","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.","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."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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_created":"2024-12-23T11:03:59Z","das_tickbox":"0","publication":"European Journal of Applied Mathematics","file":[{"content_type":"application/pdf","date_created":"2026-07-23T05:55:03Z","date_updated":"2026-07-23T05:55:03Z","creator":"dernst","file_name":"2026_EuropJourAppliedMath_Portinale.pdf","relation":"main_file","file_id":"22386","file_size":612317,"success":1,"checksum":"d038f4d00cbfbde2672c17138eab21c9","access_level":"open_access"}],"intvolume":"        37","status":"public","supplementarymaterial":"no","year":"2026","file_date_updated":"2026-07-23T05:55:03Z","researchdata_availability":"no","has_accepted_license":"1","volume":37,"issue":"3","page":"614-642","quality_controlled":"1","_id":"18706","article_processing_charge":"Yes","OA_type":"gold","related_material":{"record":[{"relation":"dissertation_contains","id":"20563","status":"public"}]},"keyword":["optimal transport","discrete-to-continuum","homogenisation","linear growth","gamma-convergence"],"department":[{"_id":"GradSch"},{"_id":"JaMa"}],"isi":1,"title":"Discrete-to-continuum limits of optimal transport with linear growth on periodic graphs","abstract":[{"lang":"eng","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."}],"type":"journal_article"},{"status":"public","intvolume":"       343","file":[{"content_type":"application/pdf","date_updated":"2026-06-22T08:54:32Z","date_created":"2026-06-22T08:54:32Z","creator":"dernst","relation":"main_file","file_name":"2025_LIPIcs_Pietrzak.pdf","success":1,"access_level":"open_access","checksum":"3f791b03df26853342855a9d9581cb58","file_id":"22118","file_size":772046}],"year":"2025","file_date_updated":"2026-06-22T08:54:32Z","has_accepted_license":"1","volume":343,"_id":"22007","quality_controlled":"1","OA_type":"gold","article_processing_charge":"Yes","department":[{"_id":"KrPi"}],"alternative_title":["LIPIcs"],"keyword":["Time-Space Lower Bounds","Blockchains"],"type":"conference","abstract":[{"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.","lang":"eng"}],"title":"Time-space tradeoffs of truncation with preprocessing","author":[{"first_name":"Krzysztof Z","full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Pengxiang","full_name":"Wang, Pengxiang","last_name":"Wang"}],"OA_place":"publisher","doi":"10.4230/LIPIcs.ITC.2025.4","corr_author":"1","month":"09","oa":1,"ddc":["000"],"article_number":"4:1-4:10","external_id":{"cryptoeprintid":["2025/723"]},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2026-06-22T08:57:41Z","date_published":"2025-09-08T00:00:00Z","conference":{"start_date":"2025-08-16","name":"ITC: Information Theoretic Cryptography","end_date":"2025-08-17","location":"Santa Barbara, CA, United States"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","publication_identifier":{"isbn":["9783959773850"],"eissn":["1868-8969"]},"language":[{"iso":"eng"}],"scopus_import":"1","day":"08","citation":{"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.","short":"K.Z. Pietrzak, P. Wang, in:, 6th Conference on Information-Theoretic Cryptography, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2025.","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>","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.","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>","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>."},"publication":"6th Conference on Information-Theoretic Cryptography","date_created":"2026-06-14T22:01:45Z","cryptoeprintid":1,"das_tickbox":"0","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"issue":"7","has_accepted_license":"1","volume":5,"year":"2025","status":"public","intvolume":"         5","type":"journal_article","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"}],"title":"Scaling-critical well-posedness for continuum Calogero–Moser models on the line","OA_type":"diamond","article_processing_charge":"No","_id":"22032","quality_controlled":"1","page":"284-320","tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"oa_version":"Published Version","date_updated":"2026-06-22T11:21:09Z","date_published":"2025-06-23T00:00:00Z","external_id":{"arxiv":["2311.12334"]},"article_type":"original","OA_place":"publisher","doi":"10.1090/cams/48","month":"06","ddc":["500"],"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.12334"}],"author":[{"first_name":"Rowan","full_name":"Killip, Rowan","last_name":"Killip"},{"first_name":"Thierry","last_name":"Laurens","full_name":"Laurens, Thierry"},{"id":"056daca0-b8d1-11f0-964f-f91054abf8ca","first_name":"Monica","full_name":"Visan, Monica","last_name":"Visan"}],"extern":"1","publication":"Communications of the American Mathematical Society","das_tickbox":"1","date_created":"2026-06-19T07:42:34Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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>","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>","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.","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>.","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.","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>."},"publication_identifier":{"issn":["2692-3688"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"day":"23","publisher":"American Mathematical Society","publication_status":"published"},{"title":"Dispersive decay for the mass-critical nonlinear Schrödinger equation","abstract":[{"lang":"eng","text":"We prove dispersive decay, pointwise in time, for solutions to the mass-critical nonlinear Schrödinger equation in spatial dimensions d= 1, 2, 3."}],"type":"journal_article","article_processing_charge":"No","OA_type":"green","quality_controlled":"1","_id":"22036","volume":311,"year":"2025","intvolume":"       311","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2026-06-19T07:44:05Z","das_tickbox":"1","extern":"1","publication":"Mathematische Zeitschrift","citation":{"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>","short":"C. Fan, R. Killip, M. Vişan, Z. Zhao, Mathematische Zeitschrift 311 (2025).","ista":"Fan C, Killip R, Vişan M, Zhao Z. 2025. Dispersive decay for the mass-critical nonlinear Schrödinger equation. Mathematische Zeitschrift. 311, 21.","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>.","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>","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.","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>."},"day":"24","scopus_import":"1","language":[{"iso":"eng"}],"arxiv":1,"publication_identifier":{"eissn":["1432-1823"],"issn":["0025-5874"]},"publisher":"Springer Nature","publication_status":"published","date_published":"2025-07-24T00:00:00Z","date_updated":"2026-06-22T13:00:14Z","oa_version":"Preprint","external_id":{"arxiv":["2403.09989"]},"article_number":"21","oa":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.09989","open_access":"1"}],"month":"07","doi":"10.1007/s00209-025-03821-8","article_type":"original","OA_place":"repository","author":[{"full_name":"Fan, Chenjie","last_name":"Fan","first_name":"Chenjie"},{"first_name":"Rowan","last_name":"Killip","full_name":"Killip, Rowan"},{"full_name":"Visan, Monica","last_name":"Visan","first_name":"Monica","id":"056daca0-b8d1-11f0-964f-f91054abf8ca"},{"last_name":"Zhao","full_name":"Zhao, Zehua","first_name":"Zehua"}]},{"OA_place":"publisher","article_type":"original","doi":"10.1007/s00521-024-10616-1","corr_author":"1","PlanS_conform":"1","month":"10","ddc":["004"],"oa":1,"author":[{"first_name":"Peter","last_name":"Súkeník","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-12-30T06:39:56Z","date_published":"2025-10-01T00:00:00Z","external_id":{"arxiv":["2208.13499"]},"publication_identifier":{"eissn":["1433-3058"],"issn":["0941-0643"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"day":"01","publisher":"Springer Nature","publication_status":"published","publication":"Neural Computing and Applications","date_created":"2023-02-20T08:23:06Z","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","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>.","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>","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.","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>","ista":"Súkeník P, Lampert C. 2025. Generalization in multi-objective machine learning. Neural Computing and Applications. 37, 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>.","short":"P. Súkeník, C. Lampert, Neural Computing and Applications 37 (2025) 24669–24683."},"year":"2025","intvolume":"        37","status":"public","file":[{"checksum":"61ad4591aee16b1e02daf6c164321a42","access_level":"open_access","success":1,"file_size":500213,"file_id":"20877","relation":"main_file","file_name":"2025_NeuralCompApplic_Sukenik.pdf","content_type":"application/pdf","date_created":"2025-12-30T06:39:11Z","date_updated":"2025-12-30T06:39:11Z","creator":"dernst"}],"volume":37,"has_accepted_license":"1","file_date_updated":"2025-12-30T06:39:11Z","OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","_id":"12662","quality_controlled":"1","page":"24669–24683","type":"journal_article","abstract":[{"lang":"eng","text":"Modern machine learning tasks often require considering not just one but multiple objectives. For example, besides the prediction quality, this could be the efficiency, robustness or fairness of the learned models, or any of their combinations. Multi-objective learning offers a natural framework for handling such problems without having to commit to early trade-offs. Surprisingly, statistical learning theory so far offers almost no insight into the generalization properties of multi-objective learning. In this work, we make first steps to fill this gap: We establish foundational generalization bounds for the multi-objective setting as well as generalization and excess bounds for learning with scalarizations. We also provide the first theoretical analysis of the relation between the Pareto-optimal sets of the true objectives and the Pareto-optimal sets of their empirical approximations from training data. In particular, we show a surprising asymmetry: All Pareto-optimal solutions can be approximated by empirically Pareto-optimal ones, but not vice versa."}],"title":"Generalization in multi-objective machine learning","department":[{"_id":"ChLa"}]},{"file_date_updated":"2025-12-16T12:32:40Z","volume":267,"has_accepted_license":"1","file":[{"creator":"dernst","date_created":"2025-12-16T12:32:40Z","date_updated":"2025-12-16T12:32:40Z","content_type":"application/pdf","relation":"main_file","file_name":"2025_ICML_Sieberling.pdf","success":1,"access_level":"open_access","checksum":"1d744fbaeb199b08e8b6f48bc0dd047e","file_id":"20828","file_size":908379}],"status":"public","intvolume":"       267","year":"2025","department":[{"_id":"DaAl"}],"alternative_title":["PMLR"],"type":"conference","title":"EvoPress: Accurate dynamic model compression via evolutionary search","abstract":[{"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.","lang":"eng"}],"quality_controlled":"1","_id":"20820","page":"55556-55590","OA_type":"gold","article_processing_charge":"No","external_id":{"arxiv":["2410.14649"]},"date_updated":"2025-12-16T12:34:32Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_published":"2025-05-01T00:00:00Z","author":[{"full_name":"Sieberling, Oliver","last_name":"Sieberling","first_name":"Oliver"},{"full_name":"Kuznedelev, Denis","last_name":"Kuznedelev","first_name":"Denis"},{"last_name":"Kurtic","full_name":"Kurtic, Eldar","first_name":"Eldar","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian"}],"OA_place":"publisher","oa":1,"ddc":["000"],"corr_author":"1","month":"05","citation":{"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.","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.","short":"O. Sieberling, D. Kuznedelev, E. Kurtic, D.-A. Alistarh, in:, 42nd International Conference on Machine Learning, ML Research Press, 2025, pp. 55556–55590.","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.","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.","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."},"date_created":"2025-12-14T23:02:05Z","publication":"42nd International Conference on Machine Learning","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ML Research Press","publication_status":"published","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning"},"arxiv":1,"publication_identifier":{"eissn":["2640-3498"]},"day":"01","scopus_import":"1","language":[{"iso":"eng"}]},{"status":"public","intvolume":"       267","file":[{"file_size":756213,"file_id":"20830","access_level":"open_access","checksum":"a7edf0e4304171a3e035842b3aab1704","success":1,"relation":"main_file","file_name":"2025_ICML_Nguyen.pdf","content_type":"application/pdf","date_updated":"2025-12-16T12:45:41Z","date_created":"2025-12-16T12:45:41Z","creator":"dernst"}],"year":"2025","file_date_updated":"2025-12-16T12:45:41Z","has_accepted_license":"1","volume":267,"page":"46026-46072","_id":"20821","quality_controlled":"1","article_processing_charge":"No","OA_type":"gold","alternative_title":["PMLR"],"department":[{"_id":"DaAl"}],"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","type":"conference","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"},{"full_name":"Wu, Frank Zhengqing","last_name":"Wu","first_name":"Frank Zhengqing"},{"last_name":"Ramezani-Kebrya","full_name":"Ramezani-Kebrya, Ali","first_name":"Ali"},{"last_name":"Antonakopoulos","full_name":"Antonakopoulos, Kimon","first_name":"Kimon"},{"orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"},{"first_name":"Volkan","full_name":"Cevher, Volkan","last_name":"Cevher"}],"month":"05","oa":1,"ddc":["000"],"OA_place":"publisher","external_id":{"arxiv":["2505.14371"]},"date_published":"2025-05-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2025-12-16T12:46:54Z","conference":{"location":"Vancouver, Canada","start_date":"2025-07-13","end_date":"2025-07-19","name":"ICML: International Conference on Machine Learning"},"publisher":"ML Research Press","publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","day":"01","project":[{"_id":"8e35c14b-16d5-11f0-9cad-a3fc35339161","name":"FastML: Efficient and Cost-Effective Distributed Machine Learning","grant_number":"101158077"}],"publication_identifier":{"eissn":["2640-3498"]},"arxiv":1,"citation":{"ama":"Nguyen AD, Markov I, Wu FZ, et al. Layer-wise quantization for quantized optimistic dual averaging. In: <i>42nd International Conference on Machine Learning</i>. Vol 267. ML Research Press; 2025:46026-46072.","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.","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.","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.","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.","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.","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."},"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).","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"42nd International Conference on Machine Learning","date_created":"2025-12-14T23:02:06Z"},{"status":"public","year":"2025","quality_controlled":"1","_id":"20839","OA_type":"gold","article_processing_charge":"Yes","department":[{"_id":"VaKa"}],"type":"journal_article","title":"Sets with arbitrary Hausdorff and packing scales in infinite dimensional Banach spaces","abstract":[{"lang":"eng","text":"For every couple of Hausdorff functions ψ and φ verifying some mild assumptions, there exists a compact subset K of the Baire space such that the φ-Hausdorff measure and the ψ-packing measure on K are both finite and positive. Such examples are then embedded in any infinite dimensional Banach space to answer positively a question of Fan on the existence of metric spaces with arbitrary scales."}],"author":[{"first_name":"Mathieu","last_name":"Helfter","full_name":"Helfter, Mathieu","id":"7d296fbe-e2c6-11ee-84d3-d5c2945f9a57"}],"DOAJ_listed":"1","doi":"10.4171/jfg/177","OA_place":"publisher","article_type":"original","main_file_link":[{"url":"https://doi.org/10.4171/jfg/177","open_access":"1"}],"oa":1,"ddc":["500"],"month":"11","corr_author":"1","date_updated":"2026-06-18T18:26:33Z","oa_version":"Published Version","date_published":"2025-11-07T00:00:00Z","publication_status":"epub_ahead","publisher":"EMS Press","publication_identifier":{"eissn":["2308-1317"],"issn":["2308-1309"]},"day":"07","language":[{"iso":"eng"}],"scopus_import":"1","citation":{"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>.","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).","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>.","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>"},"date_created":"2025-12-19T10:15:37Z","publication":"Journal of Fractal Geometry","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"file_date_updated":"2025-12-22T13:51:09Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2026-06-10T08:36:07Z","date_published":"2025-12-22T00:00:00Z","has_accepted_license":"1","status":"public","author":[{"id":"09501ff6-dca7-11ea-a8ae-b3e0b9166e80","orcid":"0000-0003-0582-2946","full_name":"Agafonova, Sofya","last_name":"Agafonova","first_name":"Sofya"}],"file":[{"file_id":"20854","file_size":146656591,"success":1,"checksum":"7af34e4226a00cdcb7f154272050e217","access_level":"open_access","content_type":"application/x-zip-compressed","date_created":"2025-12-22T13:45:30Z","creator":"sagafono","date_updated":"2025-12-22T13:45:30Z","file_name":"AllData.zip","relation":"main_file"},{"file_id":"20855","file_size":93470129,"success":1,"access_level":"open_access","checksum":"71806a2ef9fb26ad7b78e04c6754ee4e","creator":"sagafono","date_updated":"2025-12-22T13:45:33Z","date_created":"2025-12-22T13:45:33Z","content_type":"application/x-zip-compressed","file_name":"SourceData.zip","relation":"main_file"},{"success":1,"access_level":"open_access","checksum":"08facd1b4a102f83e4d99d48a85b258d","file_id":"20856","file_size":461,"content_type":"text/plain","creator":"sagafono","date_updated":"2025-12-22T13:51:09Z","date_created":"2025-12-22T13:51:09Z","file_name":"readme.txt","relation":"main_file"}],"year":"2025","doi":"10.15479/AT-ISTA-20842","corr_author":"1","month":"12","oa":1,"contributor":[{"first_name":"Pere","last_name":"Rosello"},{"first_name":"Manuel","last_name":"Mekonnen"},{"first_name":"Onur","last_name":"Hosten","orcid":"0000-0002-2031-204X","contributor_type":"supervisor","id":"4C02D85E-F248-11E8-B48F-1D18A9856A87"}],"department":[{"_id":"GradSch"},{"_id":"OnHo"}],"related_material":{"record":[{"id":"20840","status":"public","relation":"used_in_publication"}]},"citation":{"ieee":"S. Agafonova, “Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface.’” Institute of Science and Technology Austria, 2025.","ama":"Agafonova S. Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” 2025. doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>","chicago":"Agafonova, Sofia. “Research Data for: ‘One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.’” Institute of Science and Technology Austria, 2025. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>.","short":"S. Agafonova, (2025).","ista":"Agafonova S. 2025. Research Data for: ‘One-milligram torsional pendulum toward experiments at the quantum-gravity interface’, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>.","apa":"Agafonova, S. (2025). Research Data for: “One-milligram torsional pendulum toward experiments at the quantum-gravity interface.” Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT-ISTA-20842\">https://doi.org/10.15479/AT-ISTA-20842</a>","mla":"Agafonova, Sofia. <i>Research Data for: “One-Milligram Torsional Pendulum toward Experiments at the Quantum-Gravity Interface.”</i> Institute of Science and Technology Austria, 2025, doi:<a href=\"https://doi.org/10.15479/AT-ISTA-20842\">10.15479/AT-ISTA-20842</a>."},"type":"research_data","date_created":"2025-12-21T14:23:50Z","abstract":[{"text":"Probing the possibility of entanglement generation through gravity offers a path to tackle the question of whether gravitational fields possess a quantum mechanical nature. A potential realization necessitates systems with low-frequency dynamics at an optimal mass scale, for which the microgram-to-milligram range is a strong contender. Here, after refining a figure-of-merit for the problem, we present a 1-milligram torsional pendulum operating at 18 Hz. We demonstrate laser cooling its motion from room temperature to 240~microkelvins, surpassing by over 20-fold the coldest motions attained for oscillators ranging from micrograms to kilograms. We quantify and contrast the utility of the current approach with other platforms. The achieved performance and large improvement potential highlight milligram-scale torsional pendulums as a powerful platform for precision measurements relevant to future studies at the quantum-gravity interface.","lang":"eng"}],"user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","title":"Research Data for: 'One-milligram torsional pendulum toward experiments at the quantum-gravity interface'","_id":"20842","publisher":"Institute of Science and Technology Austria","article_processing_charge":"No","day":"22","project":[{"_id":"bdb2a702-d553-11ed-ba76-f12e3e5a3bc6","name":"A quantum hybrid of atoms and milligram-scale pendulums: towards gravitational quantum mechanics","grant_number":"101087907"}]},{"year":"2025","intvolume":"     16269","status":"public","volume":16269,"OA_type":"green","article_processing_charge":"No","quality_controlled":"1","_id":"20845","page":"259-290","type":"conference","title":"Zeroizing attacks against evasive and circular evasive LWE","abstract":[{"text":"We develop new attacks against the Evasive LWE family of assumptions, in both the public and private-coin regime. To the best of our knowledge, ours are the first attacks against Evasive LWE in the public-coin regime, for any instantiation from the family. Our attacks are summarized below.\r\n\r\nPublic-Coin Attacks.\r\n1.The recent work by Hseih, Lin and Luo [17] constructed the first Attribute Based Encryption (ABE) for unbounded depth circuits by relying on the “circular” evasive LWE assumption. This assumption has been popularly considered as a safe, public-coin instance of Evasive LWE in contrast to its “private-coin” cousins (for instance, see [10, 11]).\r\nWe provide the first attack against this assumption, challenging the widely held belief that this is a public-coin assumption.\r\n2. We demonstrate a counter-example against vanilla public-coin evasive LWE by Wee [26] in an unnatural parameter regime. Our attack crucially relies on the error in the pre-condition being larger than the error in the post-condition, necessitating a refinement of the assumption.\r\n\r\nPrivate-Coin Attacks.\r\n1. The recent work by Agrawal, Kumari and Yamada [2] constructed the first functional encryption scheme for pseudorandom functionalities (PRFE) and extended this to obfuscation for pseudorandom functionalities (PRIO) [4] by relying on private-coin evasive LWE. We provide a new attack against the assumption stated in the first posting of their work (subsequently refined to avoid these attacks).\r\n2. The recent work by Branco et al. [8] (concurrently to [4]) provides a construction of obfuscation for pseudorandom functionalities by relying on private-coin evasive LWE. We provide a new attack against their stated assumption.\r\n3. Branco et al. [8] showed that there exist contrived, “self-referential” classes of pseudorandom functionalities for which pseudorandom obfuscation cannot exist. We extend their techniques to develop an analogous result for pseudorandom functional encryption.\r\n\r\nWhile Evasive LWE was developed to specifically avoid “zeroizing attacks”, our work shows that in certain settings, such attacks can still apply.","lang":"eng"}],"department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"doi":"10.1007/978-3-032-12293-3_9","OA_place":"repository","main_file_link":[{"url":"https://eprint.iacr.org/2025/375","open_access":"1"}],"oa":1,"month":"12","author":[{"first_name":"Shweta","full_name":"Agrawal, Shweta","last_name":"Agrawal"},{"full_name":"Modi, Anuja","last_name":"Modi","first_name":"Anuja"},{"id":"dc8f1524-403e-11ee-bf07-9649ad996e21","first_name":"Anshu","full_name":"Yadav, Anshu","last_name":"Yadav"},{"first_name":"Shota","last_name":"Yamada","full_name":"Yamada, Shota"}],"date_updated":"2025-12-29T11:51:13Z","oa_version":"Preprint","date_published":"2025-12-05T00:00:00Z","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9783032122926"]},"day":"05","scopus_import":"1","language":[{"iso":"eng"}],"publisher":"Springer Nature","publication_status":"published","conference":{"end_date":"2025-12-05","name":"TCC: Theory of Cryptography","start_date":"2025-12-01","location":"Aarhus, Denmark"},"date_created":"2025-12-21T23:01:33Z","publication":"23rd International Conference on Theory of Cryptography","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We thank Rachel Lin for expressing concern about the applicability of “HJL-style” attacks [15] on the construction in [2] during a talk by the first author about [2]. This was the starting point of the investigation that led us to develop the attack in [5, Sec 4.1]. The first author also thanks Hoeteck Wee for sharing his rationale for introducing evasive LWE.\r\nThe first author is supported by the CyStar center of excellence, the VHAR faculty chair, and the C3iHub fellowship. The third author thanks Cystar, IIT Madras, for supporting a visit to IIT Madras during which the collaboration was initiated. The 4th author is partly supported by JST CREST Grant Number JPMJCR22M1.","citation":{"mla":"Agrawal, Shweta, et al. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16269, Springer Nature, 2025, pp. 259–90, doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>.","apa":"Agrawal, S., Modi, A., Yadav, A., &#38; Yamada, S. (2025). Zeroizing attacks against evasive and circular evasive LWE. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16269, pp. 259–290). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>","ieee":"S. Agrawal, A. Modi, A. Yadav, and S. Yamada, “Zeroizing attacks against evasive and circular evasive LWE,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16269, pp. 259–290.","ama":"Agrawal S, Modi A, Yadav A, Yamada S. Zeroizing attacks against evasive and circular evasive LWE. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16269. Springer Nature; 2025:259-290. doi:<a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">10.1007/978-3-032-12293-3_9</a>","short":"S. Agrawal, A. Modi, A. Yadav, S. Yamada, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 259–290.","ista":"Agrawal S, Modi A, Yadav A, Yamada S. 2025. Zeroizing attacks against evasive and circular evasive LWE. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16269, 259–290.","chicago":"Agrawal, Shweta, Anuja Modi, Anshu Yadav, and Shota Yamada. “Zeroizing Attacks against Evasive and Circular Evasive LWE.” In <i>23rd International Conference on Theory of Cryptography</i>, 16269:259–90. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12293-3_9\">https://doi.org/10.1007/978-3-032-12293-3_9</a>."}},{"oa_version":"Preprint","date_updated":"2025-12-29T11:11:29Z","date_published":"2025-12-05T00:00:00Z","author":[{"first_name":"Nicholas","full_name":"Brandt, Nicholas","last_name":"Brandt"},{"orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","full_name":"Cueto Noval, Miguel","last_name":"Cueto Noval"},{"id":"ec98511c-eb8e-11eb-b029-edd25d7271a1","full_name":"Günther, Christoph Ullrich","last_name":"Günther","first_name":"Christoph Ullrich"},{"full_name":"Ünal, Akin","last_name":"Ünal","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221"},{"full_name":"Wohnig, Stella","last_name":"Wohnig","first_name":"Stella"}],"OA_place":"repository","doi":"10.1007/978-3-032-12290-2_16","corr_author":"1","month":"12","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2025/1045"}],"oa":1,"citation":{"apa":"Brandt, N., Cueto Noval, M., Günther, C. U., Ünal, A., &#38; Wohnig, S. (2025). Constrained verifiable random functions without obfuscation and friends. In <i>23rd International Conference on Theory of Cryptography</i> (Vol. 16271, pp. 478–511). Aarhus, Denmark: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>","ama":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. Constrained verifiable random functions without obfuscation and friends. In: <i>23rd International Conference on Theory of Cryptography</i>. Vol 16271. Springer Nature; 2025:478-511. doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>","chicago":"Brandt, Nicholas, Miguel Cueto Noval, Christoph Ullrich Günther, Akin Ünal, and Stella Wohnig. “Constrained Verifiable Random Functions without Obfuscation and Friends.” In <i>23rd International Conference on Theory of Cryptography</i>, 16271:478–511. Springer Nature, 2025. <a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">https://doi.org/10.1007/978-3-032-12290-2_16</a>.","short":"N. Brandt, M. Cueto Noval, C.U. Günther, A. Ünal, S. Wohnig, in:, 23rd International Conference on Theory of Cryptography, Springer Nature, 2025, pp. 478–511.","ista":"Brandt N, Cueto Noval M, Günther CU, Ünal A, Wohnig S. 2025. Constrained verifiable random functions without obfuscation and friends. 23rd International Conference on Theory of Cryptography. TCC: Theory of Cryptography, LNCS, vol. 16271, 478–511.","ieee":"N. Brandt, M. Cueto Noval, C. U. Günther, A. Ünal, and S. Wohnig, “Constrained verifiable random functions without obfuscation and friends,” in <i>23rd International Conference on Theory of Cryptography</i>, Aarhus, Denmark, 2025, vol. 16271, pp. 478–511.","mla":"Brandt, Nicholas, et al. “Constrained Verifiable Random Functions without Obfuscation and Friends.” <i>23rd International Conference on Theory of Cryptography</i>, vol. 16271, Springer Nature, 2025, pp. 478–511, doi:<a href=\"https://doi.org/10.1007/978-3-032-12290-2_16\">10.1007/978-3-032-12290-2_16</a>."},"publication":"23rd International Conference on Theory of Cryptography","date_created":"2025-12-21T23:01:34Z","acknowledgement":"We thank Jonas Steinbach and Gertjan De Mulder for helpful discussions on BIP 32, Dennis Hofheinz and Julia Kastner for helpful discussions on early prototypes of our CVRF, and Klaus Kraßnitzer for running pairing benchmarks on his MacBook Pro.\r\nChristoph U. Günther: This research was funded in whole or in part by the Austrian Science Fund (FWF) 10.55776/F85. For open access purposes, the author has applied a CC BY public copyright license to any author-accepted manuscript version arising from this submission.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"start_date":"2025-12-01","end_date":"2025-12-05","name":"TCC: Theory of Cryptography","location":"Aarhus, Denmark"},"publisher":"Springer Nature","publication_status":"published","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783032122896"]},"language":[{"iso":"eng"}],"scopus_import":"1","day":"05","project":[{"_id":"34a34d57-11ca-11ed-8bc3-a2688a8724e1","name":"Security and Privacy by Design for Complex Systems","grant_number":"F8509"}],"volume":16271,"status":"public","intvolume":"     16271","year":"2025","department":[{"_id":"KrPi"}],"alternative_title":["LNCS"],"type":"conference","abstract":[{"lang":"eng","text":"CVRFs are PRFs that unify the properties of verifiable and constrained PRFs. Since they were introduced concurrently by Fuchsbauer and Chandran-Raghuraman-Vinayagamurthy in 2014, it has been an open problem to construct CVRFs without using heavy machinery such as multilinear maps, obfuscation or functional encryption.\r\nWe solve this problem by constructing a prefix-constrained verifiable PRF that does not rely on the aforementioned assumptions. Essentially, our construction is a verifiable version of the Goldreich-Goldwasser-Micali PRF. To achieve verifiability we leverage degree-2 algebraic PRGs and bilinear groups. In short, proofs consist of intermediate values of the Goldreich-Goldwasser-Micali PRF raised to the exponents of group elements. These outputs can be verified using pairings since the underlying PRG is of degree 2.\r\nWe prove the selective security of our construction under the Decisional Square Diffie-Hellman (DSDH) assumption and a new assumption, which we dub recursive Decisional Diffie-Hellman (recursive DDH).\r\nWe prove the soundness of recursive DDH in the generic group model assuming the hardness of the Multivariate Quadratic (MQ) problem and a new variant thereof, which we call MQ+.\r\nLast, in terms of applications, we observe that our CVRF is also an exponent (C)VRF in the plain model. Exponent VRFs were recently introduced by Boneh et al. (Eurocrypt’25) with various applications to threshold cryptography in mind. In addition to that, we give further applications for prefix-CVRFs in the blockchain setting, namely, stake-pooling and compressible randomness beacons."}],"title":"Constrained verifiable random functions without obfuscation and friends","_id":"20846","quality_controlled":"1","page":"478-511","OA_type":"green","article_processing_charge":"No"},{"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-12-29T11:19:34Z","date_published":"2025-12-01T00:00:00Z","article_number":"065418","external_id":{"arxiv":["2508.05643"]},"OA_place":"publisher","article_type":"original","doi":"10.1103/1ss8-31rb","corr_author":"1","PlanS_conform":"1","month":"12","oa":1,"ddc":["530"],"author":[{"id":"2df8ab8f-080d-11ed-979a-bfe651ca3afa","first_name":"Eavan","last_name":"Fitzgerald","full_name":"Fitzgerald, Eavan"},{"first_name":"Cécile","full_name":"Clavaud, Cécile","last_name":"Clavaud","orcid":"0000-0002-1843-3803","id":"5f654c5d-04a1-11eb-ab36-ba9ffec58bd8"},{"full_name":"Das, Debasish","last_name":"Das","first_name":"Debasish"},{"orcid":"0000-0002-5010-6984","id":"a550210f-223c-11ec-8182-e2d45e817efb","first_name":"Isaac C","last_name":"Lenton","full_name":"Lenton, Isaac C"},{"id":"3A1FFC16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2299-3176","last_name":"Waitukaitis","full_name":"Waitukaitis, Scott R","first_name":"Scott R"}],"publication":"Physical Review E","date_created":"2025-12-21T23:01:34Z","acknowledgement":"This research was funded in whole or in part by the Austrian Science Fund (FWF) [Grant DOI: 10.55776/ESP298]. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nAgreement No. 949120). This research was supported by the Scientific Service Units of The Institute of Science and Technology Austria (ISTA) through resources provided by the Miba Machine Shop, Nanofabrication Facility, Scientific Computing Facility, and Lab Support Facility. We wish to acknowledge the crucial contributions of Alexandre Morin in getting the project off the ground, and Jack Merrin for creating the SU-8 deposition protocol used in the construction of our\r\ncells. We also wish to thank Kimberley Modic and Hamza Nasir for their work on single-particle characterization. ","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"E. Fitzgerald, C. Clavaud, D. Das, I. C. Lenton, and S. R. Waitukaitis, “Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter,” <i>Physical Review E</i>, vol. 112, no. 6. American Physical Society, 2025.","ista":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. 2025. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. Physical Review E. 112(6), 065418.","short":"E. Fitzgerald, C. Clavaud, D. Das, I.C. Lenton, S.R. Waitukaitis, Physical Review E 112 (2025).","chicago":"Fitzgerald, Eavan, Cécile Clavaud, Debasish Das, Isaac C Lenton, and Scott R Waitukaitis. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” <i>Physical Review E</i>. American Physical Society, 2025. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>.","ama":"Fitzgerald E, Clavaud C, Das D, Lenton IC, Waitukaitis SR. Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. 2025;112(6). doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>","apa":"Fitzgerald, E., Clavaud, C., Das, D., Lenton, I. C., &#38; Waitukaitis, S. R. (2025). Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/1ss8-31rb\">https://doi.org/10.1103/1ss8-31rb</a>","mla":"Fitzgerald, Eavan, et al. “Rolling at Right Angles: Magnetic Anisotropy Enables Dual-Anisotropic Active Matter.” <i>Physical Review E</i>, vol. 112, no. 6, 065418, American Physical Society, 2025, doi:<a href=\"https://doi.org/10.1103/1ss8-31rb\">10.1103/1ss8-31rb</a>."},"publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"arxiv":1,"scopus_import":"1","language":[{"iso":"eng"}],"project":[{"_id":"bd8eede5-d553-11ed-ba76-eaded0d13485","name":"MixQUIckR: Mixing with QUIncke Rollers","grant_number":"E 298"},{"call_identifier":"H2020","grant_number":"949120","name":"Tribocharge: a multi-scale approach to an enduring problem in physics","_id":"0aa60e99-070f-11eb-9043-a6de6bdc3afa"}],"day":"01","publication_status":"published","publisher":"American Physical Society","issue":"6","has_accepted_license":"1","volume":112,"file_date_updated":"2025-12-29T11:15:42Z","year":"2025","ec_funded":1,"intvolume":"       112","status":"public","file":[{"file_name":"2025_PhysReviewE_Fitzgerald.pdf","relation":"main_file","content_type":"application/pdf","date_created":"2025-12-29T11:15:42Z","date_updated":"2025-12-29T11:15:42Z","creator":"dernst","file_size":2131491,"file_id":"20862","checksum":"d593e933f976c3f3cde37ad66539d57d","access_level":"open_access","success":1}],"type":"journal_article","abstract":[{"lang":"eng","text":"We report on an experimental active matter system with motion restricted to four cardinal directions. Our particles are magnetite-doped colloidal spheres driven by the Quincke electrorotational instability. The absence of a magnetic field (|𝑩|=0) leads to circular trajectories interspersed with short spontaneous runs. Intermediate fields (|𝑩|≲20mT) linearize the motion along the axis perpendicular to 𝑩. At high magnetic fields, we observe the surprising emergence of a second, distinct linearization along the axis parallel to 𝑩. With numerical simulations, we show that this behavior can be explained by anisotropic magnetic susceptibility."}],"title":"Rolling at right angles: Magnetic anisotropy enables dual-anisotropic active matter","department":[{"_id":"ScWa"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"},{"_id":"ScienComp"},{"_id":"LifeSc"}],"_id":"20847","quality_controlled":"1"}]