[{"title":"Consecutive runs of sums of two squares","publisher":"Elsevier","type":"journal_article","doi":"10.1016/j.jnt.2024.05.003","publication_status":"published","page":"135-147","article_processing_charge":"No","date_created":"2026-06-29T12:58:28Z","_id":"22197","author":[{"first_name":"Noam","last_name":"Kimmel","full_name":"Kimmel, Noam"},{"last_name":"Kuperberg","id":"c3bac823-112d-11f0-a3f5-c264f852e697","first_name":"Vivian Zieve","full_name":"Kuperberg, Vivian Zieve"}],"intvolume":"       264","external_id":{"arxiv":["2306.12855"]},"date_published":"2024-11-01T00:00:00Z","quality_controlled":"1","OA_type":"green","citation":{"chicago":"Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of Two Squares.” <i>Journal of Number Theory</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">https://doi.org/10.1016/j.jnt.2024.05.003</a>.","mla":"Kimmel, Noam, and Vivian Zieve Kuperberg. “Consecutive Runs of Sums of Two Squares.” <i>Journal of Number Theory</i>, vol. 264, Elsevier, 2024, pp. 135–47, doi:<a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">10.1016/j.jnt.2024.05.003</a>.","ama":"Kimmel N, Kuperberg VZ. Consecutive runs of sums of two squares. <i>Journal of Number Theory</i>. 2024;264:135-147. doi:<a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">10.1016/j.jnt.2024.05.003</a>","apa":"Kimmel, N., &#38; Kuperberg, V. Z. (2024). Consecutive runs of sums of two squares. <i>Journal of Number Theory</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.jnt.2024.05.003\">https://doi.org/10.1016/j.jnt.2024.05.003</a>","ieee":"N. Kimmel and V. Z. Kuperberg, “Consecutive runs of sums of two squares,” <i>Journal of Number Theory</i>, vol. 264. Elsevier, pp. 135–147, 2024.","short":"N. Kimmel, V.Z. Kuperberg, Journal of Number Theory 264 (2024) 135–147.","ista":"Kimmel N, Kuperberg VZ. 2024. Consecutive runs of sums of two squares. Journal of Number Theory. 264, 135–147."},"volume":264,"oa_version":"Preprint","arxiv":1,"OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2306.12855"}],"publication_identifier":{"issn":["0022-314X"]},"scopus_import":"1","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"01","extern":"1","language":[{"iso":"eng"}],"article_type":"original","month":"11","year":"2024","abstract":[{"lang":"eng","text":"We study the distribution of consecutive sums of two squares\r\nin arithmetic progressions. If {En}n∈N is the sequence of\r\nsums of two squares in increasing order, we show that for\r\nany modulus q and any congruence classes a1, a2, a3 mod q\r\nwhich are admissible in the sense that there are solutions\r\nto x2 + y2 ≡ ai mod q, there exist infinitely many n with\r\nEn+i−1 ≡ ai mod q, for i =1, 2, 3. We also show that for\r\nany r1, r2 ≥ 1, there exist infinitely many n with En+i−1 ≡\r\na1 mod q for 1 ≤ i ≤ r1 and En+i−1 ≡ a2 mod q for\r\nr1 +1 ≤ i ≤ r1 + r2"}],"publication":"Journal of Number Theory","date_updated":"2026-07-14T11:10:45Z"},{"_id":"22209","date_created":"2026-06-30T06:31:09Z","article_processing_charge":"No","OA_type":"hybrid","quality_controlled":"1","date_published":"2024-08-12T00:00:00Z","external_id":{"pmid":["38996410"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"intvolume":"        87","author":[{"id":"492def71-6250-11f0-b278-d41dbd241b62","first_name":"Carla","last_name":"Fernández-Rico","full_name":"Fernández-Rico, Carla"},{"first_name":"Roel P A","last_name":"Dullens","full_name":"Dullens, Roel P A"}],"title":"Liquid crystals from curved colloidal rods: Waves, twists and more","issue":"9","publication_status":"published","doi":"10.1088/1361-6633/ad627b","type":"journal_article","publisher":"IOP Publishing","month":"08","PlanS_conform":"1","article_type":"review","extern":"1","language":[{"iso":"eng"}],"day":"12","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2026-07-15T06:27:28Z","publication":"Reports on Progress in Physics","abstract":[{"text":"The curvature of elongated microscopic building blocks plays a crucial role on their self-assembly into orientationally ordered phases. While rod-like molecules form a handful of liquid crystal (LC) phases, curved or banana-shaped molecules show more than fifty phases, with fascinating physical properties, such as chirality or polarity. Despite the fundamental and technological importance of these so-called ‘banana-shaped liquid crystals’, little is known about their microscopic details at the single-molecule level. Curved colloidal liquid crystals—liquid crystals formed by curved colloidal rods—are excellent model systems to optically resolve the structure and dynamics of curved building blocks within these condensed phases. Recent advances in the synthesis of curved rod-like particles have unlocked the potential for studying—at the single-particle level—the intimate relationship between shape and phase symmetry, and even confirmed the stability of elusive LC phases. Further developments in this nascent field promise exciting findings, such as the first observation of the colloidal twist-bend nematic phase or the fabrication of functional materials with curvature-dependent properties. In this Report on Progress, we will highlight recent advances in the synthesis and assembly of curved colloidal liquid crystals and discuss the upcoming challenges and opportunities of this field.","lang":"eng"}],"year":"2024","volume":87,"citation":{"mla":"Fernández-Rico, Carla, and Roel P. A. Dullens. “Liquid Crystals from Curved Colloidal Rods: Waves, Twists and More.” <i>Reports on Progress in Physics</i>, vol. 87, no. 9, 094601, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.1088/1361-6633/ad627b\">10.1088/1361-6633/ad627b</a>.","ama":"Fernández-Rico C, Dullens RPA. Liquid crystals from curved colloidal rods: Waves, twists and more. <i>Reports on Progress in Physics</i>. 2024;87(9). doi:<a href=\"https://doi.org/10.1088/1361-6633/ad627b\">10.1088/1361-6633/ad627b</a>","chicago":"Fernández-Rico, Carla, and Roel P A Dullens. “Liquid Crystals from Curved Colloidal Rods: Waves, Twists and More.” <i>Reports on Progress in Physics</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.1088/1361-6633/ad627b\">https://doi.org/10.1088/1361-6633/ad627b</a>.","ista":"Fernández-Rico C, Dullens RPA. 2024. Liquid crystals from curved colloidal rods: Waves, twists and more. Reports on Progress in Physics. 87(9), 094601.","ieee":"C. Fernández-Rico and R. P. A. Dullens, “Liquid crystals from curved colloidal rods: Waves, twists and more,” <i>Reports on Progress in Physics</i>, vol. 87, no. 9. IOP Publishing, 2024.","apa":"Fernández-Rico, C., &#38; Dullens, R. P. A. (2024). Liquid crystals from curved colloidal rods: Waves, twists and more. <i>Reports on Progress in Physics</i>. IOP Publishing. <a href=\"https://doi.org/10.1088/1361-6633/ad627b\">https://doi.org/10.1088/1361-6633/ad627b</a>","short":"C. Fernández-Rico, R.P.A. Dullens, Reports on Progress in Physics 87 (2024)."},"pmid":1,"ddc":["540"],"status":"public","article_number":"094601","scopus_import":"1","publication_identifier":{"eissn":["1361-6633"],"issn":["0034-4885"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1088/1361-6633/ad627b"}],"OA_place":"publisher","has_accepted_license":"1","oa":1,"oa_version":"Published Version"},{"date_created":"2026-06-30T06:36:39Z","article_processing_charge":"No","page":"124-130","_id":"22219","intvolume":"        23","author":[{"full_name":"Fernández-Rico, Carla","first_name":"Carla","id":"492def71-6250-11f0-b278-d41dbd241b62","last_name":"Fernández-Rico"},{"last_name":"Schreiber","first_name":"Sanjay","full_name":"Schreiber, Sanjay"},{"first_name":"Hamza","last_name":"Oudich","full_name":"Oudich, Hamza"},{"first_name":"Charlotta","last_name":"Lorenz","full_name":"Lorenz, Charlotta"},{"full_name":"Sicher, Alba","last_name":"Sicher","first_name":"Alba"},{"full_name":"Sai, Tianqi","last_name":"Sai","first_name":"Tianqi"},{"last_name":"Bauernfeind","first_name":"Viola","full_name":"Bauernfeind, Viola"},{"first_name":"Stefanie","last_name":"Heyden","full_name":"Heyden, Stefanie"},{"full_name":"Carrara, Pietro","first_name":"Pietro","last_name":"Carrara"},{"full_name":"Lorenzis, Laura De","last_name":"Lorenzis","first_name":"Laura De"},{"first_name":"Robert W.","last_name":"Style","full_name":"Style, Robert W."},{"last_name":"Dufresne","first_name":"Eric R.","full_name":"Dufresne, Eric R."}],"OA_type":"green","quality_controlled":"1","date_published":"2024-01-01T00:00:00Z","external_id":{"arxiv":["2304.11419"]},"title":"Elastic microphase separation produces robust bicontinuous materials","doi":"10.1038/s41563-023-01703-0","type":"journal_article","publisher":"Springer Nature","publication_status":"published","article_type":"original","extern":"1","language":[{"iso":"eng"}],"day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"01","abstract":[{"lang":"eng","text":"Bicontinuous microstructures are essential to the function of diverse natural and synthetic systems. Their synthesis has been based on two approaches: arrested phase separation or self-assembly of block copolymers. The former is attractive for its chemical simplicity and the latter, for its thermodynamic robustness. Here we introduce elastic microphase separation (EMPS) as an alternative approach to make bicontinuous microstructures. Conceptually, EMPS balances the molecular-scale forces that drive demixing with large-scale elasticity to encode a thermodynamic length scale. This process features a continuous phase transition, reversible without hysteresis. Practically, EMPS is triggered by simply supersaturating an elastomeric matrix with a liquid, resulting in uniform bicontinuous materials with a well-defined microscopic length scale tuned by the matrix stiffness. The versatility of EMPS is further demonstrated by fabricating bicontinuous materials with superior mechanical properties and controlled anisotropy and microstructural gradients. Overall, EMPS presents a robust alternative for the bulk fabrication of homogeneous bicontinuous materials."}],"year":"2024","date_updated":"2026-07-15T08:23:05Z","publication":"Nature Materials","volume":23,"citation":{"mla":"Fernández-Rico, Carla, et al. “Elastic Microphase Separation Produces Robust Bicontinuous Materials.” <i>Nature Materials</i>, vol. 23, Springer Nature, 2024, pp. 124–30, doi:<a href=\"https://doi.org/10.1038/s41563-023-01703-0\">10.1038/s41563-023-01703-0</a>.","ama":"Fernández-Rico C, Schreiber S, Oudich H, et al. Elastic microphase separation produces robust bicontinuous materials. <i>Nature Materials</i>. 2024;23:124-130. doi:<a href=\"https://doi.org/10.1038/s41563-023-01703-0\">10.1038/s41563-023-01703-0</a>","chicago":"Fernández-Rico, Carla, Sanjay Schreiber, Hamza Oudich, Charlotta Lorenz, Alba Sicher, Tianqi Sai, Viola Bauernfeind, et al. “Elastic Microphase Separation Produces Robust Bicontinuous Materials.” <i>Nature Materials</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41563-023-01703-0\">https://doi.org/10.1038/s41563-023-01703-0</a>.","ista":"Fernández-Rico C, Schreiber S, Oudich H, Lorenz C, Sicher A, Sai T, Bauernfeind V, Heyden S, Carrara P, Lorenzis LD, Style RW, Dufresne ER. 2024. Elastic microphase separation produces robust bicontinuous materials. Nature Materials. 23, 124–130.","ieee":"C. Fernández-Rico <i>et al.</i>, “Elastic microphase separation produces robust bicontinuous materials,” <i>Nature Materials</i>, vol. 23. Springer Nature, pp. 124–130, 2024.","apa":"Fernández-Rico, C., Schreiber, S., Oudich, H., Lorenz, C., Sicher, A., Sai, T., … Dufresne, E. R. (2024). Elastic microphase separation produces robust bicontinuous materials. <i>Nature Materials</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41563-023-01703-0\">https://doi.org/10.1038/s41563-023-01703-0</a>","short":"C. Fernández-Rico, S. Schreiber, H. Oudich, C. Lorenz, A. Sicher, T. Sai, V. Bauernfeind, S. Heyden, P. Carrara, L.D. Lorenzis, R.W. Style, E.R. Dufresne, Nature Materials 23 (2024) 124–130."},"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.11419"}],"arxiv":1,"oa":1,"oa_version":"Preprint","status":"public","scopus_import":"1","publication_identifier":{"issn":["1476-1122"],"eissn":["1476-4660"]}},{"publication_status":"published","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","type":"journal_article","doi":"10.1002/aenm.202400408","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"publisher":"Wiley","title":"A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se","project":[{"name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery","_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A"}],"issue":"22","file":[{"relation":"main_file","checksum":"86b26430e00d5f43ea19e9b610692ab7","date_updated":"2024-07-22T12:07:56Z","success":1,"creator":"dernst","file_size":8824301,"access_level":"open_access","file_id":"17314","file_name":"2024_AdvancedEnergyMaterials_Kleinhanns.pdf","content_type":"application/pdf","date_created":"2024-07-22T12:07:56Z"}],"quality_controlled":"1","date_published":"2024-06-12T00:00:00Z","external_id":{"isi":["001184300200001"]},"tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"intvolume":"        14","author":[{"full_name":"Kleinhanns, Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425","orcid":"0000-0003-1537-7436","first_name":"Tobias","last_name":"Kleinhanns"},{"full_name":"Milillo, Francesco","last_name":"Milillo","first_name":"Francesco","id":"38b830db-ea88-11ee-bf9b-929beaf79054"},{"full_name":"Calcabrini, Mariano","last_name":"Calcabrini","first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4566-5877"},{"full_name":"Fiedler, Christine","first_name":"Christine","id":"bd3fceba-dc74-11ea-a0a7-c17f71817366","last_name":"Fiedler"},{"full_name":"Horta, Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","first_name":"Sharona","last_name":"Horta"},{"full_name":"Balazs, Daniel","first_name":"Daniel","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","orcid":"0000-0001-7597-043X","last_name":"Balazs"},{"last_name":"Strumolo","first_name":"Marissa J.","full_name":"Strumolo, Marissa J."},{"full_name":"Hasler, Roger","last_name":"Hasler","first_name":"Roger"},{"first_name":"Jordi","last_name":"Llorca","full_name":"Llorca, Jordi"},{"full_name":"Tkadletz, Michael","first_name":"Michael","last_name":"Tkadletz"},{"last_name":"Brutchey","first_name":"Richard L.","full_name":"Brutchey, Richard L."},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","last_name":"Ibáñez","full_name":"Ibáñez, Maria"}],"acknowledgement":"This work was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Electron Microscopy Facility (EMF), the Lab Support Facility (LSF), and the Nanofabrication Facility (NNF). This work was financially supported by ISTA and the Werner Siemens Foundation. The USTEM Service Unit of the Technical University of Vienna is acknowledged for EBSD sample preparation and analysis. R.L.B. acknowledges the National Science Foundation for funding the mass spectrometry analysis under award DMR 1904719. J.L. is a Serra Húnter Fellow and is grateful to the ICREA Academia program and projects MICINN/FEDER PID2021-124572OB-C31 and GC 2021 SGR 01061.","_id":"15182","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"22017"}]},"date_created":"2024-03-25T08:57:40Z","article_processing_charge":"Yes (via OA deal)","corr_author":"1","status":"public","article_number":"2400408","publication_identifier":{"eissn":["1614-6840"],"issn":["1614-6832"]},"scopus_import":"1","oa_version":"Published Version","oa":1,"has_accepted_license":"1","volume":14,"citation":{"apa":"Kleinhanns, T., Milillo, F., Calcabrini, M., Fiedler, C., Horta, S., Balazs, D., … Ibáñez, M. (2024). A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. <i>Advanced Energy Materials</i>. Wiley. <a href=\"https://doi.org/10.1002/aenm.202400408\">https://doi.org/10.1002/aenm.202400408</a>","ieee":"T. Kleinhanns <i>et al.</i>, “A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se,” <i>Advanced Energy Materials</i>, vol. 14, no. 22. Wiley, 2024.","short":"T. Kleinhanns, F. Milillo, M. Calcabrini, C. Fiedler, S. Horta, D. Balazs, M.J. Strumolo, R. Hasler, J. Llorca, M. Tkadletz, R.L. Brutchey, M. Ibáñez, Advanced Energy Materials 14 (2024).","ista":"Kleinhanns T, Milillo F, Calcabrini M, Fiedler C, Horta S, Balazs D, Strumolo MJ, Hasler R, Llorca J, Tkadletz M, Brutchey RL, Ibáñez M. 2024. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. Advanced Energy Materials. 14(22), 2400408.","chicago":"Kleinhanns, Tobias, Francesco Milillo, Mariano Calcabrini, Christine Fiedler, Sharona Horta, Daniel Balazs, Marissa J. Strumolo, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” <i>Advanced Energy Materials</i>. Wiley, 2024. <a href=\"https://doi.org/10.1002/aenm.202400408\">https://doi.org/10.1002/aenm.202400408</a>.","mla":"Kleinhanns, Tobias, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” <i>Advanced Energy Materials</i>, vol. 14, no. 22, 2400408, Wiley, 2024, doi:<a href=\"https://doi.org/10.1002/aenm.202400408\">10.1002/aenm.202400408</a>.","ama":"Kleinhanns T, Milillo F, Calcabrini M, et al. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. <i>Advanced Energy Materials</i>. 2024;14(22). doi:<a href=\"https://doi.org/10.1002/aenm.202400408\">10.1002/aenm.202400408</a>"},"ddc":["530"],"date_updated":"2026-07-17T07:09:41Z","publication":"Advanced Energy Materials","abstract":[{"text":"Thermoelectric materials convert heat into electricity, with a broad range of applications near room temperature (RT). However, the library of RT high-performance materials is limited. Traditional high-temperature synthetic methods constrain the range of materials achievable, hindering the ability to surpass crystal structure limitations and engineer defects. Here, a solution-based synthetic approach is introduced, enabling RT synthesis of powders and exploration of densification at lower temperatures to influence the material's microstructure. The approach is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated that the concentration of Ag interstitials, grain boundaries, and dislocations are directly correlated to the sintering temperature, and achieve a figure of merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and resolve Ag2Se's challenges are provided, including stoichiometry issues leading to irreproducible performances. This work highlights the potential of RT solution synthesis in expanding the repertoire of high-performance thermoelectric materials for practical applications.","lang":"eng"}],"year":"2024","isi":1,"month":"06","article_type":"original","language":[{"iso":"eng"}],"day":"12","file_date_updated":"2024-07-22T12:07:56Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"DOAJ_listed":"1","citation":{"ista":"Hartarsky I, Lichev L, Toninelli FL. 2024. Local dimer dynamics in higher dimensions. Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions.","apa":"Hartarsky, I., Lichev, L., &#38; Toninelli, F. L. (2024). Local dimer dynamics in higher dimensions. <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>. EMS Press. <a href=\"https://doi.org/10.4171/aihpd/200\">https://doi.org/10.4171/aihpd/200</a>","ieee":"I. Hartarsky, L. Lichev, and F. L. Toninelli, “Local dimer dynamics in higher dimensions,” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions</i>. EMS Press, 2024.","short":"I. Hartarsky, L. Lichev, F.L. Toninelli, Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions (2024).","ama":"Hartarsky I, Lichev L, Toninelli FL. Local dimer dynamics in higher dimensions. <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions</i>. 2024. doi:<a href=\"https://doi.org/10.4171/aihpd/200\">10.4171/aihpd/200</a>","mla":"Hartarsky, Ivailo, et al. “Local Dimer Dynamics in Higher Dimensions.” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>, EMS Press, 2024, doi:<a href=\"https://doi.org/10.4171/aihpd/200\">10.4171/aihpd/200</a>.","chicago":"Hartarsky, Ivailo, Lyuben Lichev, and Fabio Lucio Toninelli. “Local Dimer Dynamics in Higher Dimensions.” <i>Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and Their Interactions</i>. EMS Press, 2024. <a href=\"https://doi.org/10.4171/aihpd/200\">https://doi.org/10.4171/aihpd/200</a>."},"mathsc":["05B50","05C70","82C20"],"OA_place":"repository","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2304.10930"}],"arxiv":1,"oa_version":"Preprint","oa":1,"status":"public","scopus_import":"1","publication_identifier":{"issn":["2308-5827"],"eissn":["2308-5835"]},"article_type":"original","language":[{"iso":"eng"}],"day":"26","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","abstract":[{"lang":"eng","text":"We consider local dynamics of the dimer model (perfect matchings) on hypercubic boxes [n] \r\nd . These consist of successively switching the dimers along alternating cycles of prescribed (small) lengths. We study the connectivity properties of the dimer configuration space equipped with these transitions. Answering a question of Freire, Klivans, Milet, and Saldanha, we show that in three dimensions any configuration admits an alternating cycle of length at most 6. We further establish that any configuration on [n] d  features order n d−2  alternating cycles of length at most 4d−2. We also prove that the dynamics of dimer configurations on the unit hypercube of dimension d is ergodic when switching alternating cycles of length at most 4d−4. Finally, in the planar but non-bipartite case, we show that parallelogram-shaped boxes in the triangular lattice are ergodic for switching alternating cycles of lengths 4 and 6 only, thus improving a result of Kenyon and Rémila, which also uses 8-cycles. None of our proofs make reference to height functions."}],"year":"2024","date_updated":"2026-07-23T05:41:50Z","das_tickbox":"1","publication":"Annales de l’Institut Henri Poincaré D, Combinatorics, Physics and their Interactions","title":"Local dimer dynamics in higher dimensions","type":"journal_article","doi":"10.4171/aihpd/200","publisher":"EMS Press","publication_status":"epub_ahead","department":[{"_id":"MaKw"}],"date_created":"2025-01-29T10:57:09Z","article_processing_charge":"Yes","_id":"18951","author":[{"full_name":"Hartarsky, Ivailo","last_name":"Hartarsky","first_name":"Ivailo"},{"id":"9aa8388e-d003-11ee-8458-c4c1d7447977","first_name":"Lyuben","last_name":"Lichev","full_name":"Lichev, Lyuben"},{"full_name":"Toninelli, Fabio Lucio","last_name":"Toninelli","first_name":"Fabio Lucio"}],"OA_type":"gold","quality_controlled":"1","date_published":"2024-08-26T00:00:00Z","external_id":{"arxiv":["2304.10930"]}},{"file":[{"success":1,"relation":"main_file","checksum":"443aa29ea5d948e917cfccd681dcf176","date_updated":"2025-01-27T14:17:37Z","file_name":"2024_LIPICs_Aronov.pdf","content_type":"application/pdf","date_created":"2025-01-27T14:17:37Z","file_size":880725,"creator":"dernst","access_level":"open_access","file_id":"18918"}],"title":"Eight-partitioning points in 3D, and efficiently too","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.SoCG.2024.8","department":[{"_id":"UlWa"},{"_id":"GradSch"}],"publication_status":"published","page":"8:1-8:15","article_processing_charge":"Yes","corr_author":"1","date_created":"2025-01-27T14:19:17Z","related_material":{"record":[{"relation":"later_version","status":"public","id":"19860"}]},"_id":"18917","acknowledgement":"Aronov, Boris: Work has been 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.\r\nBasit, Abdul: Work has been supported by Australian Research Council grant DP220102212.\r\nRamesh, Indu: Work supported by a Tandon School of Engineering Fellowship and by NSF Grant CCF-20-08551.\r\nBA and AB would like to thank William Steiger for insightful initial discussions of the problems addressed in this work.","author":[{"last_name":"Aronov","first_name":"Boris","full_name":"Aronov, Boris"},{"full_name":"Basit, Abdul","first_name":"Abdul","last_name":"Basit"},{"last_name":"Ramesh","first_name":"Indu","full_name":"Ramesh, Indu"},{"last_name":"Tasinato","id":"0433290C-AF8F-11E9-A4C7-F729E6697425","first_name":"Gianluca","full_name":"Tasinato, Gianluca"},{"first_name":"Uli","orcid":"0000-0002-1494-0568","id":"36690CA2-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner","full_name":"Wagner, Uli"}],"intvolume":"       293","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"conference":{"name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11","location":"Athens, Greece","end_date":"2024-06-14"},"external_id":{"arxiv":["2403.02627"]},"date_published":"2024-06-06T00:00:00Z","quality_controlled":"1","OA_type":"gold","ddc":["510"],"citation":{"ista":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. 2024. Eight-partitioning points in 3D, and efficiently too. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry vol. 293, 8:1-8:15.","apa":"Aronov, B., Basit, A., Ramesh, I., Tasinato, G., &#38; Wagner, U. (2024). Eight-partitioning points in 3D, and efficiently too. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293, p. 8:1-8:15). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>","ieee":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, and U. Wagner, “Eight-partitioning points in 3D, and efficiently too,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293, p. 8:1-8:15.","short":"B. Aronov, A. Basit, I. Ramesh, G. Tasinato, U. Wagner, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15.","ama":"Aronov B, Basit A, Ramesh I, Tasinato G, Wagner U. Eight-partitioning points in 3D, and efficiently too. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024:8:1-8:15. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>","mla":"Aronov, Boris, et al. “Eight-Partitioning Points in 3D, and Efficiently Too.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, p. 8:1-8:15, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">10.4230/LIPIcs.SoCG.2024.8</a>.","chicago":"Aronov, Boris, Abdul Basit, Indu Ramesh, Gianluca Tasinato, and Uli Wagner. “Eight-Partitioning Points in 3D, and Efficiently Too.” In <i>40th International Symposium on Computational Geometry</i>, 293:8:1-8:15. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.8\">https://doi.org/10.4230/LIPIcs.SoCG.2024.8</a>."},"volume":293,"has_accepted_license":"1","oa_version":"Published Version","oa":1,"arxiv":1,"OA_place":"publisher","scopus_import":"1","publication_identifier":{"isbn":["9783959773164"]},"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file_date_updated":"2025-01-27T14:17:37Z","day":"06","language":[{"iso":"eng"}],"month":"06","year":"2024","abstract":[{"lang":"eng","text":"An eight-partition of a finite set of points (respectively, of a continuous mass distribution) in ℝ³ 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 ℝ³ 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.\r\nWe prove the following variant of this result: Any mass distribution (or point set) in ℝ³ admits an eight-partition for which the intersection of two of the planes is a line with a prescribed direction.\r\nMoreover, we present an efficient algorithm for calculating an eight-partition of a set of n points in ℝ³ (with prescribed normal direction of one of the planes) in time O^*(n^{5/2})."}],"publication":"40th International Symposium on Computational Geometry","date_updated":"2026-07-23T11:14:45Z"},{"author":[{"full_name":"El-Hayek, Antoine","last_name":"El-Hayek","id":"888a098e-fcac-11ee-aff7-d347be57b725","orcid":"0000-0003-4268-7368","first_name":"Antoine"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"intvolume":"       319","external_id":{"isi":["001542467600021"],"arxiv":["2302.11988"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"conference":{"start_date":"2024-10-28","end_date":"2024-11-01","location":"Madrid, Spain","name":"DISC: Symposium on Distributed Computing"},"date_published":"2024-10-24T00:00:00Z","quality_controlled":"1","OA_type":"gold","corr_author":"1","article_processing_charge":"Yes","date_created":"2024-11-17T23:01:47Z","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"22281"}]},"_id":"18557","acknowledgement":"Antoine El-Hayek: This project has received funding from the Austrian Science Fund\r\n(FWF) grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung,\r\n2020–2024.\r\nMonika Henzinger: This project has received funding from the European Research Council (ERC)\r\nunder the European Union’s Horizon 2020 research and innovation programme (MoDynStruct,\r\nNo. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI\r\n10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE\r\nStiftung, 2020–2024.\r\nStefan Schmid: This project has received funding from the German Research Foundation (DFG),\r\nSPP 2378 (project ReNO), 2023-2027.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","type":"conference","doi":"10.4230/LIPIcs.DISC.2024.21","department":[{"_id":"MoHe"}],"publication_status":"published","file":[{"content_type":"application/pdf","file_name":"2024_LIPIcs_ElHayek.pdf","date_created":"2024-11-18T08:02:45Z","access_level":"open_access","file_size":809666,"creator":"dernst","file_id":"18561","success":1,"checksum":"d6c8277331cafa188c33ba1717206cf4","relation":"main_file","date_updated":"2024-11-18T08:02:45Z"}],"project":[{"name":"Fast Algorithms for a Reactive Network Layer","_id":"bd9e3a2e-d553-11ed-ba76-8aa684ce17fe","grant_number":"P33775"},{"call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62","grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures"},{"name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c","grant_number":"Z00422"},{"grant_number":"I05982","_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions"}],"title":"Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges","isi":1,"year":"2024","abstract":[{"text":"Broadcast and Consensus are most fundamental tasks in distributed computing. These tasks are particularly challenging in dynamic networks where communication across the network links may be unreliable, e.g., due to mobility or failures. Over the last years, researchers have derived several impossibility results and high time complexity lower bounds for these tasks. Specifically for the setting where in each round of communication the adversary is allowed to choose one rooted tree along which the information is disseminated, there is a lower as well as an upper bound that is linear in the number n of nodes for Broadcast and for n ≥ 3 the adversary can guarantee that Consensus never happens. This setting is called the oblivious message adversary for rooted trees. Also note that if the adversary is allowed to choose a graph that does not contain a rooted tree, then it can guarantee that Broadcast and Consensus will never happen. However, such deterministic adversarial models may be overly pessimistic, as many processes in real-world settings are stochastic in nature rather than worst-case. This paper studies Broadcast on stochastic dynamic networks and shows that the situation is very different to the deterministic case. In particular, we show that if information dissemination occurs along random rooted trees and directed Erdős–Rényi graphs, Broadcast completes in O(log n) rounds of communication with high probability. The fundamental insight in our analysis is that key variables are mutually independent. We then study two adversarial models, (a) one with Byzantine nodes and (b) one where an adversary controls the edges. (a) Our techniques without Byzantine nodes are general enough so that they can be extended to Byzantine nodes. (b) In the spirit of smoothed analysis, we introduce the notion of randomized oblivious message adversary, where in each round, an adversary picks k ≤ 2n/3 edges to appear in the communication network, and then a graph (e.g. rooted tree or directed Erdős–Rényi graph) is chosen uniformly at random among the set of all such graphs that include these edges. We show that Broadcast completes in a finite number of rounds, which is, e.g., O(k+log n) rounds in rooted trees. We then extend these results to All-to-All Broadcast, and Consensus, and give lower bounds that show that most of our upper bounds are tight.","lang":"eng"}],"publication":"38th International Symposium on Distributed Computing","date_updated":"2026-07-24T12:48:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LIPIcs"],"file_date_updated":"2024-11-18T08:02:45Z","day":"24","language":[{"iso":"eng"}],"month":"10","has_accepted_license":"1","oa":1,"oa_version":"Published Version","arxiv":1,"OA_place":"publisher","scopus_import":"1","publication_identifier":{"isbn":["9783959773522"],"issn":["1868-8969"]},"article_number":"21","status":"public","ddc":["000"],"citation":{"short":"A. El-Hayek, M. Henzinger, S. Schmid, in:, 38th International Symposium on Distributed Computing, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ieee":"A. El-Hayek, M. Henzinger, and S. Schmid, “Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges,” in <i>38th International Symposium on Distributed Computing</i>, Madrid, Spain, 2024, vol. 319.","apa":"El-Hayek, A., Henzinger, M., &#38; Schmid, S. (2024). Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In <i>38th International Symposium on Distributed Computing</i> (Vol. 319). Madrid, Spain: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>","ista":"El-Hayek A, Henzinger M, Schmid S. 2024. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. 38th International Symposium on Distributed Computing. DISC: Symposium on Distributed Computing, LIPIcs, vol. 319, 21.","chicago":"El-Hayek, Antoine, Monika Henzinger, and Stefan Schmid. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” In <i>38th International Symposium on Distributed Computing</i>, Vol. 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">https://doi.org/10.4230/LIPIcs.DISC.2024.21</a>.","mla":"El-Hayek, Antoine, et al. “Broadcast and Consensus in Stochastic Dynamic Networks with Byzantine Nodes and Adversarial Edges.” <i>38th International Symposium on Distributed Computing</i>, vol. 319, 21, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>.","ama":"El-Hayek A, Henzinger M, Schmid S. Broadcast and Consensus in stochastic dynamic networks with Byzantine nodes and adversarial edges. In: <i>38th International Symposium on Distributed Computing</i>. Vol 319. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.DISC.2024.21\">10.4230/LIPIcs.DISC.2024.21</a>"},"volume":319,"ec_funded":1},{"date_created":"2024-06-16T22:01:06Z","related_material":{"record":[{"id":"20657","status":"public","relation":"later_version"}]},"article_processing_charge":"No","acknowledgement":"The first author is supported by the European Research Council (ERC), grant no. 788183, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant no. {I 02979-N35.} The second author is supported by the European Research Council (ERC), grant \"GeoScape\" and by the Hungarian Science Foundation (NKFIH), grant K-131529. Both authors are supported by the Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31.\r\nThe authors thank Matt Kahle for communicating the question about extremal Čech complexes, Ben Schweinhart for early discussions on the linked circles construction in three dimensions, and Gábor Tardos for helpful remarks and suggestions.","_id":"17146","intvolume":"       293","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","last_name":"Edelsbrunner"},{"first_name":"János","id":"E62E3130-B088-11EA-B919-BF823C25FEA4","last_name":"Pach","full_name":"Pach, János"}],"quality_controlled":"1","date_published":"2024-06-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"arxiv":["2310.14801"]},"conference":{"location":"Athens, Greece","end_date":"2024-06-14","start_date":"2024-06-11","name":"SoCG: Symposium on Computational Geometry"},"file":[{"success":1,"date_updated":"2024-06-17T08:46:33Z","relation":"main_file","checksum":"5442d44fb89d77477a87668d6e61aac9","date_created":"2024-06-17T08:46:33Z","file_name":"2024_LIPICS_Edelsbrunner.pdf","content_type":"application/pdf","file_id":"17152","creator":"dernst","file_size":766562,"access_level":"open_access"}],"title":"Maximum Betti numbers of Čech complexes","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"call_identifier":"FWF","_id":"268116B8-B435-11E9-9278-68D0E5697425","grant_number":"Z00342","name":"Mathematics, Computer Science"}],"doi":"10.4230/LIPIcs.SoCG.2024.53","type":"conference","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"file_date_updated":"2024-06-17T08:46:33Z","day":"01","alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","abstract":[{"lang":"eng","text":"The Upper Bound Theorem for convex polytopes implies that the p-th Betti number of the Čech complex of any set of N points in ℝ^d and any radius satisfies β_p = O(N^m), with m = min{p+1, ⌈d/2⌉}. We construct sets in even and odd dimensions, which prove that this upper bound is asymptotically tight. For example, we describe a set of N = 2(n+1) points in ℝ³ and two radii such that the first Betti number of the Čech complex at one radius is (n+1)² - 1, and the second Betti number of the Čech complex at the other radius is n². In particular, there is an arrangement of n contruent balls in ℝ³ that enclose a quadratic number of voids, which answers a long-standing open question in computational geometry."}],"year":"2024","date_updated":"2026-07-27T08:15:58Z","publication":"40th International Symposium on Computational Geometry","ddc":["510"],"ec_funded":1,"volume":293,"citation":{"ama":"Edelsbrunner H, Pach J. Maximum Betti numbers of Čech complexes. In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>","mla":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 53, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">10.4230/LIPIcs.SoCG.2024.53</a>.","chicago":"Edelsbrunner, Herbert, and János Pach. “Maximum Betti Numbers of Čech Complexes.” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>.","ista":"Edelsbrunner H, Pach J. 2024. Maximum Betti numbers of Čech complexes. 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 53.","ieee":"H. Edelsbrunner and J. Pach, “Maximum Betti numbers of Čech complexes,” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","apa":"Edelsbrunner, H., &#38; Pach, J. (2024). Maximum Betti numbers of Čech complexes. In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.53\">https://doi.org/10.4230/LIPIcs.SoCG.2024.53</a>","short":"H. Edelsbrunner, J. Pach, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024."},"arxiv":1,"oa":1,"has_accepted_license":"1","oa_version":"Published Version","status":"public","article_number":"53","publication_identifier":{"isbn":["9783959773164"],"issn":["1868-8969"]},"scopus_import":"1"},{"has_accepted_license":"1","oa":1,"oa_version":"Preprint","arxiv":1,"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2311.16833","open_access":"1"}],"OA_place":"repository","status":"public","citation":{"short":"B. Prach, F. Brau, G. Buttazzo, C. Lampert, in:, Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, Computer Vision Foundation, 2024, pp. 24574–24583.","ieee":"B. Prach, F. Brau, G. Buttazzo, and C. Lampert, “1-Lipschitz layers compared: Memory, speed, and certifiable robustness,” in <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Seattle, WA, United States, 2024, pp. 24574–24583.","apa":"Prach, B., Brau, F., Buttazzo, G., &#38; Lampert, C. (2024). 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 24574–24583). Seattle, WA, United States: Computer Vision Foundation. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>","ista":"Prach B, Brau F, Buttazzo G, Lampert C. 2024. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition, 24574–24583.","chicago":"Prach, Bernd, Fabio Brau, Giorgio Buttazzo, and Christoph Lampert. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” In <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 24574–83. Computer Vision Foundation, 2024. <a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">https://doi.org/10.1109/CVPR52733.2024.02320</a>.","ama":"Prach B, Brau F, Buttazzo G, Lampert C. 1-Lipschitz layers compared: Memory, speed, and certifiable robustness. In: <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. Computer Vision Foundation; 2024:24574-24583. doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>","mla":"Prach, Bernd, et al. “1-Lipschitz Layers Compared: Memory, Speed, and Certifiable Robustness.” <i>Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Computer Vision Foundation, 2024, pp. 24574–83, doi:<a href=\"https://doi.org/10.1109/CVPR52733.2024.02320\">10.1109/CVPR52733.2024.02320</a>."},"isi":1,"year":"2024","abstract":[{"lang":"eng","text":"The robustness of neural networks against input perturbations with bounded\r\nmagnitude represents a serious concern in the deployment of deep learning\r\nmodels in safety-critical systems. Recently, the scientific community has\r\nfocused on enhancing certifiable robustness guarantees by crafting 1-Lipschitz\r\nneural networks that leverage Lipschitz bounded dense and convolutional layers.\r\nAlthough different methods have been proposed in the literature to achieve this\r\ngoal, understanding the performance of such methods is not straightforward,\r\nsince different metrics can be relevant (e.g., training time, memory usage,\r\naccuracy, certifiable robustness) for different applications. For this reason,\r\nthis work provides a thorough theoretical and empirical comparison between\r\nmethods by evaluating them in terms of memory usage, speed, and certifiable\r\nrobust accuracy. The paper also provides some guidelines and recommendations to\r\nsupport the user in selecting the methods that work best depending on the\r\navailable resources. We provide code at\r\nhttps://github.com/berndprach/1LipschitzLayersCompared."}],"publication":"Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition","date_updated":"2026-07-27T12:47:43Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"01","language":[{"iso":"eng"}],"month":"06","publisher":"Computer Vision Foundation","type":"conference","doi":"10.1109/CVPR52733.2024.02320","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"publication_status":"published","title":"1-Lipschitz layers compared: Memory, speed, and certifiable robustness","author":[{"last_name":"Prach","first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","full_name":"Prach, Bernd"},{"first_name":"Fabio","last_name":"Brau","full_name":"Brau, Fabio"},{"full_name":"Buttazzo, Giorgio","last_name":"Buttazzo","first_name":"Giorgio"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"}],"conference":{"name":"CVPR: Conference on Computer Vision and Pattern Recognition","end_date":"2024-06-22","location":"Seattle, WA, United States","start_date":"2024-06-16"},"external_id":{"arxiv":["2311.16833"],"isi":["001344387500055"]},"date_published":"2024-06-01T00:00:00Z","quality_controlled":"1","OA_type":"green","page":"24574-24583","article_processing_charge":"No","corr_author":"1","related_material":{"link":[{"relation":"software","url":"https://github.com/berndprach/1LipschitzLayersCompared"}],"record":[{"id":"19759","status":"public","relation":"dissertation_contains"}]},"date_created":"2024-08-14T08:42:32Z","_id":"17426","acknowledgement":"This work was partially supported by project SERICS (PE00000014) under the MUR National Recovery and Resilience Plan funded by the European Union - NextGenerationEU.\r\n"},{"month":"12","_id":"18874","date_created":"2025-01-24T16:57:29Z","related_material":{"record":[{"id":"20455","relation":"later_version","status":"public"},{"id":"19759","status":"public","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"article_processing_charge":"No","corr_author":"1","day":"05","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","date_updated":"2026-07-27T12:47:43Z","publication":"arXiv","date_published":"2024-12-05T00:00:00Z","external_id":{"arxiv":["2412.04245"]},"author":[{"first_name":"Bernd","id":"2D561D42-C427-11E9-89B4-9C1AE6697425","last_name":"Prach","full_name":"Prach, Bernd"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert","full_name":"Lampert, Christoph"}],"abstract":[{"lang":"eng","text":"Despite extensive research since the community learned about adversarial\r\nexamples 10 years ago, we still do not know how to train high-accuracy\r\nclassifiers that are guaranteed to be robust to small perturbations of their\r\ninputs. Previous works often argued that this might be because no classifier\r\nexists that is robust and accurate at the same time. However, in computer\r\nvision this assumption does not match reality where humans are usually accurate\r\nand robust on most tasks of interest. We offer an alternative explanation and\r\nshow that in certain settings robust generalization is only possible with\r\nunrealistically large amounts of data. More precisely we find a setting where a\r\nrobust classifier exists, it is easy to learn an accurate classifier, yet it\r\nrequires an exponential amount of data to learn a robust classifier. Based on\r\nthis theoretical result, we explore how well robust classifiers generalize on\r\ndatasets such as CIFAR-10. We come to the conclusion that on this datasets, the\r\nlimitation of current robust models also lies in the generalization, and that\r\nthey require a lot of data to do well on the test set. We also show that the\r\nproblem is not in the expressiveness or generalization capabilities of current\r\narchitectures, and that there are low magnitude features in the data which are\r\nuseful for non-robust generalization but are not available for robust\r\nclassifiers."}],"year":"2024","title":"Intriguing properties of robust classification","citation":{"mla":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, 2412.04245, doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>.","ama":"Prach B, Lampert C. Intriguing properties of robust classification. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.2412.04245\">10.48550/arXiv.2412.04245</a>","chicago":"Prach, Bernd, and Christoph Lampert. “Intriguing Properties of Robust Classification.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>.","ista":"Prach B, Lampert C. Intriguing properties of robust classification. arXiv, 2412.04245.","apa":"Prach, B., &#38; Lampert, C. (n.d.). Intriguing properties of robust classification. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.2412.04245\">https://doi.org/10.48550/arXiv.2412.04245</a>","ieee":"B. Prach and C. Lampert, “Intriguing properties of robust classification,” <i>arXiv</i>. .","short":"B. Prach, C. Lampert, ArXiv (n.d.)."},"publication_status":"draft","status":"public","article_number":"2412.04245","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2412.04245","open_access":"1"}],"arxiv":1,"oa_version":"Preprint","oa":1,"type":"preprint","doi":"10.48550/arXiv.2412.04245"},{"title":"QuAK: Quantitative Automata Kit","project":[{"name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020"}],"file":[{"date_created":"2024-09-05T14:26:02Z","content_type":"application/pdf","file_name":"isola24.pdf","file_id":"17635","access_level":"open_access","creator":"esarac","file_size":847422,"success":1,"date_updated":"2024-09-05T14:26:02Z","checksum":"43e432f82be376434b358f3dd7a94b71","relation":"main_file"},{"date_created":"2025-01-21T14:39:49Z","file_name":"2024_LNCS_Chalupa.pdf","content_type":"application/pdf","file_id":"18865","creator":"dernst","file_size":1358706,"access_level":"open_access","success":1,"date_updated":"2025-01-21T14:39:49Z","relation":"main_file","checksum":"6bc04f07bb5612c0e7ea00ac121a69b6"}],"publication_status":"published","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"doi":"10.1007/978-3-031-75387-9_1","type":"conference","publisher":"Springer Nature","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when his collaboration started.","_id":"17634","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"20147"}]},"date_created":"2024-09-05T14:27:08Z","corr_author":"1","article_processing_charge":"Yes (in subscription journal)","page":"3-20","OA_type":"hybrid","quality_controlled":"1","date_published":"2024-10-26T00:00:00Z","conference":{"start_date":"2024-10-27","location":"Crete, Greece","end_date":"2024-10-31","name":"ISoLA: International Symposium on Leveraging Applications"},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"arxiv":["2409.03569"],"isi":["001419008700001"]},"intvolume":"     15222","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A"},{"full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85","first_name":"Nicolas Adrien","last_name":"Mazzocchi"},{"full_name":"Sarac, Naci E","last_name":"Sarac","id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E"}],"ec_funded":1,"volume":15222,"citation":{"short":"M. Chalupa, T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation, Springer Nature, 2024, pp. 3–20.","ieee":"M. Chalupa, T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “QuAK: Quantitative Automata Kit,” in <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, Crete, Greece, 2024, vol. 15222, pp. 3–20.","apa":"Chalupa, M., Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). QuAK: Quantitative Automata Kit. In <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i> (Vol. 15222, pp. 3–20). Crete, Greece: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">https://doi.org/10.1007/978-3-031-75387-9_1</a>","ista":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. 2024. QuAK: Quantitative Automata Kit. 12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation. ISoLA: International Symposium on Leveraging Applications, LNCS, vol. 15222, 3–20.","chicago":"Chalupa, Marek, Thomas A Henzinger, Nicolas Adrien Mazzocchi, and Naci E Sarac. “QuAK: Quantitative Automata Kit.” In <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, 15222:3–20. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">https://doi.org/10.1007/978-3-031-75387-9_1</a>.","ama":"Chalupa M, Henzinger TA, Mazzocchi NA, Sarac NE. QuAK: Quantitative Automata Kit. In: <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>. Vol 15222. Springer Nature; 2024:3-20. doi:<a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">10.1007/978-3-031-75387-9_1</a>","mla":"Chalupa, Marek, et al. “QuAK: Quantitative Automata Kit.” <i>12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation</i>, vol. 15222, Springer Nature, 2024, pp. 3–20, doi:<a href=\"https://doi.org/10.1007/978-3-031-75387-9_1\">10.1007/978-3-031-75387-9_1</a>."},"ddc":["000"],"status":"public","scopus_import":"1","publication_identifier":{"isbn":["9783031753862"],"eissn":["1611-3349"],"issn":["0302-9743"]},"OA_place":"publisher","arxiv":1,"has_accepted_license":"1","oa_version":"Published Version","oa":1,"month":"10","language":[{"iso":"eng"}],"file_date_updated":"2025-01-21T14:39:49Z","day":"26","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","alternative_title":["LNCS"],"date_updated":"2026-07-27T12:48:18Z","publication":"12th International Symposium on Leveraging Applications of Formal Methods, Verification and Validation","abstract":[{"lang":"eng","text":"System behaviors are traditionally evaluated through binary classifications of correctness, which do not suffice for properties involving quantitative aspects of systems and executions. Quantitative automata offer a more nuanced approach, mapping each execution to a real number by incorporating weighted transitions and value functions generalizing acceptance conditions. In this paper, we introduce QuAK, the first tool designed to automate the analysis of quantitative automata. QuAK currently supports a variety of quantitative automaton types, including Inf, Sup, LimInf, LimSup, LimInfAvg, and LimSupAvg automata, and implements decision procedures for problems such as emptiness, universality, inclusion, equivalence, as well as for checking whether an automaton is safe, live, or constant. Additionally, QuAK is able to compute extremal values when possible, construct safety-liveness decompositions, and monitor system behaviors. We demonstrate the effectiveness of QuAK through experiments focusing on the inclusion, constant-function check, and monitoring problems."}],"APC_amount":"2748 EUR","year":"2024","isi":1},{"status":"public","publication_identifier":{"eissn":["2640-3498"]},"scopus_import":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2310.04519","open_access":"1"}],"arxiv":1,"oa":1,"oa_version":"Preprint","volume":235,"citation":{"chicago":"Moakhar, Arshia Soltani, Eugenia B Iofinova, Elias Frantar, and Dan-Adrian Alistarh. “SPADE: Sparsity-Guided Debugging for Deep Neural Networks.” In <i>Proceedings of the 41st International Conference on Machine Learning</i>, 235:45955–87. ML Research Press, 2024.","ama":"Moakhar AS, Iofinova EB, Frantar E, Alistarh D-A. SPADE: Sparsity-guided debugging for deep neural networks. In: <i>Proceedings of the 41st International Conference on Machine Learning</i>. Vol 235. ML Research Press; 2024:45955-45987.","mla":"Moakhar, Arshia Soltani, et al. “SPADE: Sparsity-Guided Debugging for Deep Neural Networks.” <i>Proceedings of the 41st International Conference on Machine Learning</i>, vol. 235, ML Research Press, 2024, pp. 45955–87.","short":"A.S. Moakhar, E.B. Iofinova, E. Frantar, D.-A. Alistarh, in:, Proceedings of the 41st International Conference on Machine Learning, ML Research Press, 2024, pp. 45955–45987.","apa":"Moakhar, A. S., Iofinova, E. B., Frantar, E., &#38; Alistarh, D.-A. (2024). SPADE: Sparsity-guided debugging for deep neural networks. In <i>Proceedings of the 41st International Conference on Machine Learning</i> (Vol. 235, pp. 45955–45987). Vienna, Austria: ML Research Press.","ieee":"A. S. Moakhar, E. B. Iofinova, E. Frantar, and D.-A. Alistarh, “SPADE: Sparsity-guided debugging for deep neural networks,” in <i>Proceedings of the 41st International Conference on Machine Learning</i>, Vienna, Austria, 2024, vol. 235, pp. 45955–45987.","ista":"Moakhar AS, Iofinova EB, Frantar E, Alistarh D-A. 2024. SPADE: Sparsity-guided debugging for deep neural networks. Proceedings of the 41st International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 235, 45955–45987."},"date_updated":"2026-07-27T12:50:03Z","publication":"Proceedings of the 41st International Conference on Machine Learning","abstract":[{"lang":"eng","text":"It is known that sparsity can improve interpretability for deep neural networks. However, existing methods in the area either require networks that are pre-trained with sparsity constraints, or impose sparsity after the fact, altering the network’s general behavior. In this paper, we demonstrate, for the first time, that sparsity can instead be incorporated into the interpretation process itself, as a sample-specific preprocessing step. Unlike previous work, this approach, which we call SPADE, does not place constraints on the trained model and does not affect its behavior during inference on the sample. Given a trained model and a target sample, SPADE uses sample-targeted pruning to provide a \"trace\" of the network’s execution on the sample, reducing the network to the most important connections prior to computing an interpretation. We demonstrate that preprocessing with SPADE significantly increases the accuracy of image saliency maps across several interpretability methods. Additionally, SPADE improves the usefulness of neuron visualizations, aiding humans in reasoning about network behavior. Our code is available at https://github.com/IST-DASLab/SPADE."}],"year":"2024","month":"09","language":[{"iso":"eng"}],"day":"01","alternative_title":["PMLR"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","department":[{"_id":"DaAl"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"type":"conference","publisher":"ML Research Press","project":[{"name":"Vienna Graduate School on Computational Optimization","grant_number":"W1260-N35","_id":"9B9290DE-BA93-11EA-9121-9846C619BF3A"}],"title":"SPADE: Sparsity-guided debugging for deep neural networks","quality_controlled":"1","date_published":"2024-09-01T00:00:00Z","external_id":{"arxiv":["2310.04519"]},"conference":{"start_date":"2024-07-21","location":"Vienna, Austria","end_date":"2024-07-27","name":"ICML: International Conference on Machine Learning"},"intvolume":"       235","author":[{"full_name":"Moakhar, Arshia Soltani","first_name":"Arshia Soltani","last_name":"Moakhar"},{"full_name":"Iofinova, Eugenia B","last_name":"Iofinova","orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","first_name":"Eugenia B"},{"full_name":"Frantar, Elias","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","last_name":"Frantar"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"acknowledgement":"The authors would like to thank Stephen Casper and Tony Wang for their feedback on this work, and Eldar Kurtic for his advice on aspects of the project. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). EI was supported in part by the FWF DK VGSCO, grant agreement number W1260-N35.","_id":"18121","date_created":"2024-09-22T22:01:46Z","related_material":{"link":[{"url":"https://github.com/IST-DASLab/SPADE","relation":"software"}],"record":[{"id":"21854","status":"public","relation":"dissertation_contains"}]},"corr_author":"1","article_processing_charge":"No","page":"45955-45987"},{"acknowledgement":"We thank Gavin Rees for helpful discussions. J.S., S.J., and K.C were supported by\r\nEuropean Research Council (ERC) CoG 863818 (ForM-SMArt). J.T was supported by Center for Foundations of Modern Computer Science (Charles University project UNCE/SCI/004) and by the project PRIMUS/24/SCI/012 from Charles University. ","_id":"15297","corr_author":"1","article_processing_charge":"Yes","date_created":"2024-04-07T22:00:55Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"20138"}]},"quality_controlled":"1","OA_type":"gold","external_id":{"arxiv":["2401.14914"],"isi":["001194482400002"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"date_published":"2024-03-29T00:00:00Z","author":[{"full_name":"Svoboda, Jakub","first_name":"Jakub","orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","last_name":"Svoboda"},{"full_name":"Joshi, Soham Shrikant","last_name":"Joshi","first_name":"Soham Shrikant","id":"f97aac0e-f57c-11ee-93d0-a5a82d8df168"},{"first_name":"Josef","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1097-9684","last_name":"Tkadlec","full_name":"Tkadlec, Josef"},{"full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"}],"intvolume":"        20","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","call_identifier":"H2020"}],"title":"Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating","issue":"3","file":[{"file_id":"17450","access_level":"open_access","creator":"dernst","file_size":1425292,"date_created":"2024-08-20T10:52:28Z","content_type":"application/pdf","file_name":"2024_PloSComBio_Svoboda.pdf","date_updated":"2024-08-20T10:52:28Z","checksum":"a511cf369d9172beb123fe73f291b5cc","relation":"main_file","success":1}],"publication_status":"published","department":[{"_id":"KrCh"}],"publisher":"Public Library of Science","type":"journal_article","doi":"10.1371/journal.pcbi.1012008","month":"03","language":[{"iso":"eng"}],"article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"29","file_date_updated":"2024-08-20T10:52:28Z","date_updated":"2026-07-27T12:52:03Z","publication":"PLoS Computational Biology","abstract":[{"text":"Populations evolve by accumulating advantageous mutations. Every population has some spatial structure that can be modeled by an underlying network. The network then influences the probability that new advantageous mutations fixate. Amplifiers of selection are networks that increase the fixation probability of advantageous mutants, as compared to the unstructured fully-connected network. Whether or not a network is an amplifier depends on the choice of the random process that governs the evolutionary dynamics. Two popular choices are Moran process with Birth-death updating and Moran process with death-Birth updating. Interestingly, while some networks are amplifiers under Birth-death updating and other networks are amplifiers under death-Birth updating, so far no spatial structures have been found that function as an amplifier under both types of updating simultaneously. In this work, we identify networks that act as amplifiers of selection under both versions of the Moran process. The amplifiers are robust, modular, and increase fixation probability for any mutant fitness advantage in a range r ∈ (1, 1.2). To complement this positive result, we also prove that for certain quantities closely related to fixation probability, it is impossible to improve them simultaneously for both versions of the Moran process. Together, our results highlight how the two versions of the Moran process differ and what they have in common.","lang":"eng"}],"isi":1,"APC_amount":"3149,96 EUR","year":"2024","volume":20,"ec_funded":1,"citation":{"ista":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. 2024. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. PLoS Computational Biology. 20(3), e1012008.","apa":"Svoboda, J., Joshi, S. S., Tkadlec, J., &#38; Chatterjee, K. (2024). Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1012008\">https://doi.org/10.1371/journal.pcbi.1012008</a>","ieee":"J. Svoboda, S. S. Joshi, J. Tkadlec, and K. Chatterjee, “Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating,” <i>PLoS Computational Biology</i>, vol. 20, no. 3. Public Library of Science, 2024.","short":"J. Svoboda, S.S. Joshi, J. Tkadlec, K. Chatterjee, PLoS Computational Biology 20 (2024).","mla":"Svoboda, Jakub, et al. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” <i>PLoS Computational Biology</i>, vol. 20, no. 3, e1012008, Public Library of Science, 2024, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1012008\">10.1371/journal.pcbi.1012008</a>.","ama":"Svoboda J, Joshi SS, Tkadlec J, Chatterjee K. Amplifiers of selection for the Moran process with both Birth-death and death-Birth updating. <i>PLoS Computational Biology</i>. 2024;20(3). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1012008\">10.1371/journal.pcbi.1012008</a>","chicago":"Svoboda, Jakub, Soham Shrikant Joshi, Josef Tkadlec, and Krishnendu Chatterjee. “Amplifiers of Selection for the Moran Process with Both Birth-Death and Death-Birth Updating.” <i>PLoS Computational Biology</i>. Public Library of Science, 2024. <a href=\"https://doi.org/10.1371/journal.pcbi.1012008\">https://doi.org/10.1371/journal.pcbi.1012008</a>."},"ddc":["000"],"DOAJ_listed":"1","article_number":"e1012008","status":"public","publication_identifier":{"eissn":["1553-7358"],"issn":["1553-734X"]},"scopus_import":"1","arxiv":1,"OA_place":"publisher","oa_version":"Published Version","oa":1,"has_accepted_license":"1"},{"issue":"50","file":[{"checksum":"0115e9090b478e0644308c6dab58605b","relation":"main_file","date_updated":"2025-01-02T12:14:15Z","success":1,"access_level":"open_access","creator":"dernst","file_size":2491151,"file_id":"18721","content_type":"application/pdf","file_name":"2024_PNAS_Svoboda.pdf","date_created":"2025-01-02T12:14:15Z"}],"title":"Density amplifiers of cooperation for spatial games","project":[{"name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publisher":"National Academy of Sciences","type":"journal_article","doi":"10.1073/pnas.2405605121","publication_status":"published","department":[{"_id":"KrCh"}],"corr_author":"1","article_processing_charge":"Yes","related_material":{"record":[{"id":"20138","relation":"dissertation_contains","status":"public"}]},"date_created":"2024-12-22T23:01:47Z","acknowledgement":"J.S. and K.C. were supported by the European Research Council CoG 863818 (ForM-SMArt) and Austrian Science Fund 10.55776/COE12.","_id":"18703","author":[{"orcid":"0000-0002-1419-3267","id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","last_name":"Svoboda","full_name":"Svoboda, Jakub"},{"last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"intvolume":"       121","quality_controlled":"1","OA_type":"hybrid","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"external_id":{"isi":["001379596100014"],"pmid":["39642209"]},"date_published":"2024-12-10T00:00:00Z","pmid":1,"ddc":["000"],"volume":121,"ec_funded":1,"citation":{"ista":"Svoboda J, Chatterjee K. 2024. Density amplifiers of cooperation for spatial games. Proceedings of the National Academy of Sciences of the United States of America. 121(50), e2405605121.","ieee":"J. Svoboda and K. Chatterjee, “Density amplifiers of cooperation for spatial games,” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 50. National Academy of Sciences, 2024.","apa":"Svoboda, J., &#38; Chatterjee, K. (2024). Density amplifiers of cooperation for spatial games. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.2405605121\">https://doi.org/10.1073/pnas.2405605121</a>","short":"J. Svoboda, K. Chatterjee, Proceedings of the National Academy of Sciences of the United States of America 121 (2024).","mla":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>, vol. 121, no. 50, e2405605121, National Academy of Sciences, 2024, doi:<a href=\"https://doi.org/10.1073/pnas.2405605121\">10.1073/pnas.2405605121</a>.","ama":"Svoboda J, Chatterjee K. Density amplifiers of cooperation for spatial games. <i>Proceedings of the National Academy of Sciences of the United States of America</i>. 2024;121(50). doi:<a href=\"https://doi.org/10.1073/pnas.2405605121\">10.1073/pnas.2405605121</a>","chicago":"Svoboda, Jakub, and Krishnendu Chatterjee. “Density Amplifiers of Cooperation for Spatial Games.” <i>Proceedings of the National Academy of Sciences of the United States of America</i>. National Academy of Sciences, 2024. <a href=\"https://doi.org/10.1073/pnas.2405605121\">https://doi.org/10.1073/pnas.2405605121</a>."},"OA_place":"publisher","oa":1,"oa_version":"Published Version","has_accepted_license":"1","article_number":"e2405605121","status":"public","scopus_import":"1","publication_identifier":{"issn":["0027-8424"],"eissn":["1091-6490"]},"language":[{"iso":"eng"}],"article_type":"original","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","day":"10","file_date_updated":"2025-01-02T12:14:15Z","month":"12","abstract":[{"lang":"eng","text":"Spatial games provide a simple and elegant mathematical model to study the evolution of cooperation in networks. In spatial games, individuals reside in vertices, adopt simple strategies, and interact with neighbors to receive a payoff. Depending on their own and neighbors’ payoffs, individuals can change their strategy. The payoff is determined by the Prisoners’ Dilemma, a classical matrix game, where players cooperate or defect. While cooperation is the desired behavior, defection provides a higher payoff for a selfish individual. There are many theoretical and empirical studies related to the role of the network in the evolution of cooperation. However, the fundamental question of whether there exist networks that for low initial cooperation rate ensure a high chance of fixation, i.e., cooperation spreads across the whole population, has remained elusive for spatial games with strong selection. In this work, we answer this fundamental question in the affirmative by presenting network structures that ensure high fixation probability for cooperators in the strong selection regime. Besides, our structures have many desirable properties: (a) they ensure the spread of cooperation even for a low initial density of cooperation and high temptation of defection, (b) they have constant degrees, and (c) the number of steps, until cooperation spreads, is at most quadratic in the size of the network."}],"isi":1,"year":"2024","APC_amount":"3143,76 EUR","date_updated":"2026-07-27T12:52:03Z","publication":"Proceedings of the National Academy of Sciences of the United States of America"},{"date_published":"2024-02-21T00:00:00Z","tmp":{"short":"CC BY-NC (4.0)","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode"},"author":[{"last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1286-7368","first_name":"Michelle C","full_name":"Gallei, Michelle C"},{"id":"45812BD4-F248-11E8-B48F-1D18A9856A87","first_name":"Sven M","last_name":"Truckenbrodt","full_name":"Truckenbrodt, Sven M"},{"full_name":"Kreuzinger, Caroline","last_name":"Kreuzinger","id":"382077BA-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline"},{"full_name":"Inumella, Syamala","first_name":"Syamala","id":"F8660870-D756-11E9-98C5-34DFE5697425","orcid":"0009-0002-5890-120X","last_name":"Inumella"},{"full_name":"Vistunou, Vitali","last_name":"Vistunou","id":"7e146587-8972-11ed-ae7b-d7a32ea86a81","first_name":"Vitali"},{"last_name":"Sommer","orcid":"0000-0003-1216-9105","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph M","full_name":"Sommer, Christoph M"},{"full_name":"Tavakoli, Mojtaba","last_name":"Tavakoli","orcid":"0000-0002-7667-6854","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","first_name":"Mojtaba"},{"full_name":"Agudelo Duenas, Nathalie","last_name":"Agudelo Duenas","id":"40E7F008-F248-11E8-B48F-1D18A9856A87","first_name":"Nathalie"},{"first_name":"Jakob","orcid":"0009-0000-7590-3501","id":"937696FA-C996-11E9-8C7C-CF13E6697425","last_name":"Vorlaufer","full_name":"Vorlaufer, Jakob"},{"id":"425C1CE8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-0201-2315","first_name":"Wiebke","last_name":"Jahr","full_name":"Jahr, Wiebke"},{"full_name":"Randuch, Marek","id":"6ac4636d-15b2-11ec-abd3-fb8df79972ae","first_name":"Marek","last_name":"Randuch"},{"full_name":"Johnson, Alexander J","last_name":"Johnson","orcid":"0000-0002-2739-8843","id":"46A62C3A-F248-11E8-B48F-1D18A9856A87","first_name":"Alexander J"},{"first_name":"Eva","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8510-9739","last_name":"Benková","full_name":"Benková, Eva"},{"first_name":"Jiří","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jiří"},{"last_name":"Danzl","orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","full_name":"Danzl, Johann G"}],"acknowledgement":"We gratefully acknowledge support by the Scientific Service Units at ISTA, including the Imaging and Optics and Lab Support facilities and the mechanical workshop and Library. We thank Philipp Velicky for STED microscope alignment.\r\n\r\nThis project has received funding from the Austrian Science Fund (FWF): I 3630-B25 (J.G.D) and the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 742985, J.F.). It has also received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. S.T. has received funding as an ISTplus Fellow from the European Union’s Horizon 2020 Research and Innovation Programme under Marie Skłodowska-Curie grant agreement no. 754411 and from an EMBO Long-Term Fellowship (grant number ALTF 679-2018). It has further received funding from the Austrian Science Fund (FWF) grant DK W1232 (M.T, N.A-D., J.G.D). W.J. received funding via a Human Frontier Science Program postdoctoral fellowship LT000557/2018.\r\n\r\nThe funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","_id":"18689","related_material":{"record":[{"relation":"later_version","status":"public","id":"19003"},{"status":"public","relation":"dissertation_contains","id":"18681"}]},"date_created":"2024-12-19T12:28:00Z","corr_author":"1","article_processing_charge":"No","publication_status":"draft","department":[{"_id":"EvBe"},{"_id":"JoDa"},{"_id":"JiFr"}],"license":"https://creativecommons.org/licenses/by-nc/4.0/","type":"preprint","acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"E-Lib"}],"doi":"10.1101/2024.02.21.581330","title":"Super-resolution expansion microscopy in plant roots","project":[{"_id":"261099A6-B435-11E9-9278-68D0E5697425","grant_number":"742985","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants"},{"call_identifier":"H2020","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","name":"International IST Doctoral Program"},{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Molecular Drug Targets","call_identifier":"FWF","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24"},{"grant_number":"ALTF 679-2018","_id":"269B5B22-B435-11E9-9278-68D0E5697425","name":"UltraX - achieving sub-nanometer resolution in light microscopy using iterative X10 microscopy in combination with nanobodies and STED"}],"date_updated":"2026-07-28T08:33:52Z","publication":"bioRxiv","abstract":[{"text":"Multiplexed fluorescence microscopy imaging is widely used in biomedical applications. However, simultaneous imaging of multiple fluorophores can result in spectral leaks and overlapping, which greatly degrades image quality and subsequent analysis. Existing popular spectral unmixing methods are mainly based on computational intensive linear models and the performance is heavily dependent on the reference spectra, which may greatly preclude its further applications. In this paper, we propose a deep learning-based blindly spectral unmixing method, termed AutoUnmix, to imitate the physical spectral mixing process. A tranfer learning framework is further devised to allow our AutoUnmix adapting to a variety of imaging systems without retraining the network. Our proposed method has demonstrated real-time unmixing capabilities, surpassing existing methods by up to 100-fold in terms of unmixing speed. We further validate the reconstruction performance on both synthetic datasets and biological samples. The unmixing results of AutoUnmix achieve a highest SSIM of 0.99 in both three- and four-color imaging, with nearly up to 20% higher than other popular unmixing methods. Due to the desirable property of data independency and superior blind unmixing performance, we believe AutoUnmix is a powerful tool to study the interaction process of different organelles labeled by multiple fluorophores.","lang":"eng"}],"year":"2024","month":"02","language":[{"iso":"eng"}],"day":"21","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2024.02.21.581330"}],"OA_place":"repository","oa_version":"Preprint","oa":1,"ec_funded":1,"citation":{"chicago":"Gallei, Michelle C, Sven M Truckenbrodt, Caroline Kreuzinger, Syamala Inumella, Vitali Vistunou, Christoph M Sommer, Mojtaba Tavakoli, et al. “Super-Resolution Expansion Microscopy in Plant Roots.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2024.02.21.581330\">https://doi.org/10.1101/2024.02.21.581330</a>.","ama":"Gallei MC, Truckenbrodt SM, Kreuzinger C, et al. Super-resolution expansion microscopy in plant roots. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2024.02.21.581330\">10.1101/2024.02.21.581330</a>","mla":"Gallei, Michelle C., et al. “Super-Resolution Expansion Microscopy in Plant Roots.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2024.02.21.581330\">10.1101/2024.02.21.581330</a>.","short":"M.C. Gallei, S.M. Truckenbrodt, C. Kreuzinger, S. Inumella, V. Vistunou, C.M. Sommer, M. Tavakoli, N. Agudelo Duenas, J. Vorlaufer, W. Jahr, M. Randuch, A.J. Johnson, E. Benková, J. Friml, J.G. Danzl, BioRxiv (n.d.).","ieee":"M. C. Gallei <i>et al.</i>, “Super-resolution expansion microscopy in plant roots,” <i>bioRxiv</i>. .","apa":"Gallei, M. C., Truckenbrodt, S. M., Kreuzinger, C., Inumella, S., Vistunou, V., Sommer, C. M., … Danzl, J. G. (n.d.). Super-resolution expansion microscopy in plant roots. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2024.02.21.581330\">https://doi.org/10.1101/2024.02.21.581330</a>","ista":"Gallei MC, Truckenbrodt SM, Kreuzinger C, Inumella S, Vistunou V, Sommer CM, Tavakoli M, Agudelo Duenas N, Vorlaufer J, Jahr W, Randuch M, Johnson AJ, Benková E, Friml J, Danzl JG. Super-resolution expansion microscopy in plant roots. bioRxiv, <a href=\"https://doi.org/10.1101/2024.02.21.581330\">10.1101/2024.02.21.581330</a>."}},{"language":[{"iso":"eng"}],"corr_author":"1","article_processing_charge":"No","related_material":{"record":[{"id":"18879","relation":"later_version","status":"public"},{"relation":"dissertation_contains","status":"public","id":"18681"}]},"date_created":"2024-12-19T11:35:08Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"02","acknowledgement":"We thank Florian Marr for excellent technical assistance, Christina Altmutter and Julia Flor for technical support, Alois Schlögl for programming, Todor Asenov for development of the transportation box for human brain tissue, Tim Vogels for guidance on simulations, Marcus Huber for mathematical advice, and Eleftheria Kralli-Beller for manuscript editing. This research was supported by the Scientific Services Units (SSUs) of ISTA, and we are particularly grateful for assistance from Christoph Sommer and the Imaging and Optics Facility, Preclinical Facility, Life Science Facility, Miba Machine Shop, and Scientific Computing. We also acknowledge the excellent support of the Medical University of Vienna Department of Neurosurgery staff, Romana Hoeftberger and the Division of Neuropathology and Neurochemistry, and Gregor Kasprian and the Division of Neuroradiology and Musculoskeletal Radiology. The project received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Marie Skłodowska-Curie Actions Individual Fellowship no. 101026635 to J.F.W.), the Austrian Science Fund (FWF; grant PAT 4178023 to P.J.; grant DK W1232 to M.R.T. and J.G.D.) and the Austrian Academy of Sciences (DOC fellowship 26137 to M.R.T.).","_id":"18688","month":"05","author":[{"last_name":"Watson","first_name":"Jake F.","full_name":"Watson, Jake F."},{"first_name":"Victor","last_name":"Vargas-Barroso","full_name":"Vargas-Barroso, Victor"},{"full_name":"Morse-Mora, Rebecca J.","last_name":"Morse-Mora","first_name":"Rebecca J."},{"full_name":"Navas-Olive, Andrea","first_name":"Andrea","last_name":"Navas-Olive"},{"first_name":"Mojtaba","orcid":"0000-0002-7667-6854","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","last_name":"Tavakoli","full_name":"Tavakoli, Mojtaba"},{"orcid":"0000-0001-8559-3973","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","first_name":"Johann G","last_name":"Danzl","full_name":"Danzl, Johann G"},{"first_name":"Matthias","last_name":"Tomschik","full_name":"Tomschik, Matthias"},{"first_name":"Karl","last_name":"Rössler","full_name":"Rössler, Karl"},{"full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M"}],"abstract":[{"lang":"eng","text":"The human brain has remarkable computational power. It generates sophisticated behavioral sequences, stores engrams over an individual’s lifetime, and produces higher cognitive functions up to the level of consciousness. However, so little of our neuroscience knowledge covers the human brain, and it remains unknown whether this organ is truly unique, or is a scaled version of the extensively studied rodent brain. To address this fundamental question, we determined the cellular, synaptic, and connectivity rules of the hippocampal CA3 recurrent circuit using multicellular patch clamp-recording. This circuit is the largest autoassociative network in the brain, and plays a key role in memory and higher-order computations such as pattern separation and pattern completion. We demonstrate that human hippocampal CA3 employs sparse connectivity, in stark contrast to neocortical recurrent networks. Connectivity sparsifies from rodents to humans, providing a circuit architecture that maximizes associational power. Unitary synaptic events at human CA3–CA3 synapses showed both distinct species-specific and circuit-dependent properties, with high reliability, unique amplitude precision, and long integration times. We also identify differential scaling rules between hippocampal pathways from rodents to humans, with a moderate increase in the convergence of CA3 inputs per cell, but a marked increase in human mossy fiber innervation. Anatomically guided full-scale modeling suggests that the human brain’s sparse connectivity, expanded neuronal number, and reliable synaptic signaling combine to enhance the associative memory storage capacity of CA3. Together, our results reveal unique rules of connectivity and synaptic signaling in the human hippocampus, demonstrating the absolute necessity of human brain research and beginning to unravel the remarkable performance of our autoassociative memory circuits."}],"year":"2024","date_updated":"2026-07-28T08:33:51Z","date_published":"2024-05-02T00:00:00Z","publication":"bioRxiv","ec_funded":1,"title":"Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory","citation":{"short":"J.F. Watson, V. Vargas-Barroso, R.J. Morse-Mora, A. Navas-Olive, M. Tavakoli, J.G. Danzl, M. Tomschik, K. Rössler, P.M. Jonas, BioRxiv (n.d.).","apa":"Watson, J. F., Vargas-Barroso, V., Morse-Mora, R. J., Navas-Olive, A., Tavakoli, M., Danzl, J. G., … Jonas, P. M. (n.d.). Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2024.05.02.592169\">https://doi.org/10.1101/2024.05.02.592169</a>","ieee":"J. F. Watson <i>et al.</i>, “Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory,” <i>bioRxiv</i>. .","ista":"Watson JF, Vargas-Barroso V, Morse-Mora RJ, Navas-Olive A, Tavakoli M, Danzl JG, Tomschik M, Rössler K, Jonas PM. Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. bioRxiv, <a href=\"https://doi.org/10.1101/2024.05.02.592169\">10.1101/2024.05.02.592169</a>.","chicago":"Watson, Jake F., Victor Vargas-Barroso, Rebecca J. Morse-Mora, Andrea Navas-Olive, Mojtaba Tavakoli, Johann G Danzl, Matthias Tomschik, Karl Rössler, and Peter M Jonas. “Human Hippocampal CA3 Uses Specific Functional Connectivity Rules for Efficient Associative Memory.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2024.05.02.592169\">https://doi.org/10.1101/2024.05.02.592169</a>.","mla":"Watson, Jake F., et al. “Human Hippocampal CA3 Uses Specific Functional Connectivity Rules for Efficient Associative Memory.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2024.05.02.592169\">10.1101/2024.05.02.592169</a>.","ama":"Watson JF, Vargas-Barroso V, Morse-Mora RJ, et al. Human hippocampal CA3 uses specific functional connectivity rules for efficient associative memory. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2024.05.02.592169\">10.1101/2024.05.02.592169</a>"},"project":[{"name":"Synaptic computations of the hippocampal CA3 circuitry","grant_number":"101026635","_id":"fc2be41b-9c52-11eb-aca3-faa90aa144e9","call_identifier":"H2020"},{"call_identifier":"FWF","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets"},{"name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5","grant_number":"26137"}],"OA_place":"repository","main_file_link":[{"url":"https://doi.org/10.1101/2024.05.02.592169","open_access":"1"}],"oa":1,"acknowledged_ssus":[{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"PreCl"},{"_id":"ScienComp"}],"type":"preprint","oa_version":"Preprint","doi":"10.1101/2024.05.02.592169","status":"public","publication_status":"draft","department":[{"_id":"JoDa"},{"_id":"PeJo"}]},{"supervisor":[{"last_name":"Danzl","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G"}],"das_tickbox":"1","date_updated":"2026-07-28T08:33:52Z","year":"2024","month":"12","alternative_title":["ISTA Thesis"],"user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","file_date_updated":"2026-07-28T08:33:51Z","day":"20","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["978-3-99078-048-0"],"issn":["2663-337X"]},"status":"public","has_accepted_license":"1","oa_version":"Published Version","degree_awarded":"PhD","OA_place":"publisher","citation":{"short":"M. Tavakoli, Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy, Institute of Science and Technology Austria, 2024.","ieee":"M. Tavakoli, “Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy,” Institute of Science and Technology Austria, 2024.","apa":"Tavakoli, M. (2024). <i>Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18681\">https://doi.org/10.15479/at:ista:18681</a>","ista":"Tavakoli M. 2024. Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy. Institute of Science and Technology Austria.","chicago":"Tavakoli, Mojtaba. “Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18681\">https://doi.org/10.15479/at:ista:18681</a>.","mla":"Tavakoli, Mojtaba. <i>Developing Molecular and Structural Tools for Studying Brain Architecture with Super Resolution Expansion Microscopy. LICONN: Molecularly-Informed Connectomics Reconstruction with Light Microscopy</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18681\">10.15479/at:ista:18681</a>.","ama":"Tavakoli M. Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18681\">10.15479/at:ista:18681</a>"},"OA_embargo":"20","ddc":["600","570"],"doi_confirm":"1","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"date_published":"2024-12-20T00:00:00Z","author":[{"full_name":"Tavakoli, Mojtaba","last_name":"Tavakoli","first_name":"Mojtaba","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7667-6854"}],"_id":"18681","page":"230","article_processing_charge":"No","corr_author":"1","date_created":"2024-12-19T02:30:39Z","related_material":{"record":[{"id":"11160","status":"public","relation":"part_of_dissertation"},{"id":"18688","status":"public","relation":"part_of_dissertation"},{"relation":"part_of_dissertation","status":"public","id":"18677"},{"id":"18689","relation":"part_of_dissertation","status":"public"}]},"department":[{"_id":"GradSch"},{"_id":"JoDa"}],"publication_status":"published","publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:18681","type":"dissertation","acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"},{"_id":"LifeSc"}],"project":[{"name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","grant_number":"26137","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5"},{"call_identifier":"FWF","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24","name":"Molecular Drug Targets"}],"title":"Developing molecular and structural tools for studying brain architecture with super resolution expansion microscopy. LICONN: Molecularly-informed connectomics reconstruction with light microscopy","file":[{"relation":"source_file","checksum":"b61651d417cafddd740a8528f46068c5","date_updated":"2024-12-20T10:31:37Z","file_name":"Thesis_Mojtaba Tavakoli_.docx","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2024-12-20T10:23:17Z","file_size":118593521,"creator":"mtavakol","access_level":"closed","file_id":"18699"},{"date_updated":"2026-07-28T08:33:51Z","checksum":"c80bcfd1a34c23afc3538052325283e5","relation":"main_file","embargo":"2027-08-01","embargo_to":"open_access","file_id":"18700","access_level":"closed","file_size":63885521,"creator":"mtavakol","date_created":"2024-12-20T10:25:12Z","content_type":"application/pdf","file_name":"Thesis_Mojtaba Tavakoli_.pdf"}]},{"_id":"18677","acknowledgement":"We thank Sven Dorkenwald and Peter Li for critical reading of the\r\nmanuscript. We acknowledge expert support by ISTA’s scientific service units: Imaging and\r\nOptics, Lab Support, Scientific Computing, Preclinical Facility, Miba Machine Shop, and Library.\r\nWe gratefully acknowledge funding by the following sources:\r\nAustrian Science Fund (FWF) grant DK W1232 (JGD, MRT)\r\nAustrian Academy of Sciences DOC fellowship 26137 (MRT)\r\nEU Horizon 2020 program, Marie Skłodowska-Curie Actions Fellowship 665385 (JL)\r\nGesellschaft für Forschungsförderung NÖ (NFB) grant LSC18-022 (JGD)\r\nEuropean Union’s Horizon 2020 research and innovation programme, European Research\r\nCouncil (ERC) grant 101044865 “SecretAutism.”\r\n","article_processing_charge":"No","corr_author":"1","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"18674"},{"id":"19704","status":"public","relation":"later_version"},{"status":"public","relation":"dissertation_contains","id":"18681"}]},"date_created":"2024-12-18T14:48:24Z","tmp":{"image":"/images/cc_by_nc_nd.png","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)"},"date_published":"2024-07-08T00:00:00Z","author":[{"last_name":"Tavakoli","first_name":"Mojtaba","orcid":"0000-0002-7667-6854","id":"3A0A06F4-F248-11E8-B48F-1D18A9856A87","full_name":"Tavakoli, Mojtaba"},{"full_name":"Lyudchik, Julia","first_name":"Julia","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","last_name":"Lyudchik"},{"first_name":"Michał","last_name":"Januszewski","full_name":"Januszewski, Michał"},{"full_name":"Vistunou, Vitali","id":"7e146587-8972-11ed-ae7b-d7a32ea86a81","first_name":"Vitali","last_name":"Vistunou"},{"full_name":"Agudelo Duenas, Nathalie","id":"40E7F008-F248-11E8-B48F-1D18A9856A87","first_name":"Nathalie","last_name":"Agudelo Duenas"},{"id":"937696FA-C996-11E9-8C7C-CF13E6697425","orcid":"0009-0000-7590-3501","first_name":"Jakob","last_name":"Vorlaufer","full_name":"Vorlaufer, Jakob"},{"full_name":"Sommer, Christoph M","last_name":"Sommer","first_name":"Christoph M","id":"4DF26D8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1216-9105"},{"full_name":"Kreuzinger, Caroline","id":"382077BA-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Kreuzinger"},{"first_name":"Bárbara","id":"3B03AA1A-F248-11E8-B48F-1D18A9856A87","last_name":"Oliveira","full_name":"Oliveira, Bárbara"},{"full_name":"Cenameri, Alban","last_name":"Cenameri","first_name":"Alban","id":"9ac8f577-2357-11eb-997a-e566c5550886"},{"id":"3E57A680-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7673-7178","first_name":"Gaia","last_name":"Novarino","full_name":"Novarino, Gaia"},{"full_name":"Jain, Viren","last_name":"Jain","first_name":"Viren"},{"last_name":"Danzl","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G"}],"title":"Light-microscopy based dense connectomic reconstruction of mammalian brain tissue","project":[{"name":"Studying Organelle Structure and Function at Nanoscale Resolution with Expansion Microscopy","grant_number":"26137","_id":"6285a163-2b32-11ec-9570-8e204ca2dba5"},{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","grant_number":"665385","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Toward an understanding of the brain interstitial system and the extracellular proteome in health and autism spectrum disorders","grant_number":"101044865","_id":"34ba8964-11ca-11ed-8bc3-e15864e7e9a6"},{"name":"Molecular Drug Targets","call_identifier":"FWF","_id":"26AA4EF2-B435-11E9-9278-68D0E5697425","grant_number":"W1232-B24"}],"department":[{"_id":"GaNo"},{"_id":"JoDa"}],"publication_status":"draft","doi":"10.1101/2024.03.01.582884","acknowledged_ssus":[{"_id":"E-Lib"},{"_id":"M-Shop"},{"_id":"LifeSc"},{"_id":"Bio"},{"_id":"ScienComp"}],"type":"preprint","month":"07","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","language":[{"iso":"eng"}],"publication":"bioRxiv","date_updated":"2026-07-28T08:33:51Z","year":"2024","abstract":[{"text":"The information-processing capability of the brain’s cellular network depends on the physical wiring pattern between neurons and their molecular and functional characteristics. Mapping neurons and resolving their individual synaptic connections can be achieved by volumetric imaging at nanoscale resolution with dense cellular labeling. Light microscopy is uniquely positioned to visualize specific molecules but dense, synapse-level circuit reconstruction by light microscopy has been out of reach due to limitations in resolution, contrast, and volumetric imaging capability. Here we developed light-microscopy based connectomics (LICONN). We integrated specifically engineered hydrogel embedding and expansion with comprehensive deep-learning based segmentation and analysis of connectivity, thus directly incorporating molecular information in synapse-level brain tissue reconstructions. LICONN will allow synapse-level brain tissue phenotyping in biological experiments in a readily adoptable manner.","lang":"eng"}],"citation":{"chicago":"Tavakoli, Mojtaba, Julia Lyudchik, Michał Januszewski, Vitali Vistunou, Nathalie Agudelo Duenas, Jakob Vorlaufer, Christoph M Sommer, et al. “Light-Microscopy Based Dense Connectomic Reconstruction of Mammalian Brain Tissue.” <i>BioRxiv</i>, n.d. <a href=\"https://doi.org/10.1101/2024.03.01.582884\">https://doi.org/10.1101/2024.03.01.582884</a>.","ama":"Tavakoli M, Lyudchik J, Januszewski M, et al. Light-microscopy based dense connectomic reconstruction of mammalian brain tissue. <i>bioRxiv</i>. doi:<a href=\"https://doi.org/10.1101/2024.03.01.582884\">10.1101/2024.03.01.582884</a>","mla":"Tavakoli, Mojtaba, et al. “Light-Microscopy Based Dense Connectomic Reconstruction of Mammalian Brain Tissue.” <i>BioRxiv</i>, doi:<a href=\"https://doi.org/10.1101/2024.03.01.582884\">10.1101/2024.03.01.582884</a>.","short":"M. Tavakoli, J. Lyudchik, M. Januszewski, V. Vistunou, N. Agudelo Duenas, J. Vorlaufer, C.M. Sommer, C. Kreuzinger, B. Oliveira, A. Cenameri, G. Novarino, V. Jain, J.G. Danzl, BioRxiv (n.d.).","ieee":"M. Tavakoli <i>et al.</i>, “Light-microscopy based dense connectomic reconstruction of mammalian brain tissue,” <i>bioRxiv</i>. .","apa":"Tavakoli, M., Lyudchik, J., Januszewski, M., Vistunou, V., Agudelo Duenas, N., Vorlaufer, J., … Danzl, J. G. (n.d.). Light-microscopy based dense connectomic reconstruction of mammalian brain tissue. <i>bioRxiv</i>. <a href=\"https://doi.org/10.1101/2024.03.01.582884\">https://doi.org/10.1101/2024.03.01.582884</a>","ista":"Tavakoli M, Lyudchik J, Januszewski M, Vistunou V, Agudelo Duenas N, Vorlaufer J, Sommer CM, Kreuzinger C, Oliveira B, Cenameri A, Novarino G, Jain V, Danzl JG. Light-microscopy based dense connectomic reconstruction of mammalian brain tissue. bioRxiv, <a href=\"https://doi.org/10.1101/2024.03.01.582884\">10.1101/2024.03.01.582884</a>."},"ec_funded":1,"status":"public","oa_version":"Preprint","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1101/2024.03.01.582884"}],"OA_place":"repository"},{"doi":"10.1038/s41467-023-44114-0","type":"journal_article","acknowledged_ssus":[{"_id":"M-Shop"},{"_id":"NanoFab"}],"publisher":"Springer Nature","department":[{"_id":"GeKa"}],"publication_status":"published","file":[{"success":1,"relation":"main_file","checksum":"ef79173b45eeaf984ffa61ef2f8a52ab","date_updated":"2024-01-17T11:03:00Z","file_name":"2024_NatureComm_Valentini.pdf","content_type":"application/pdf","date_created":"2024-01-17T11:03:00Z","creator":"dernst","file_size":2336595,"access_level":"open_access","file_id":"14825"}],"title":"Parity-conserving Cooper-pair transport and ideal superconducting diode in planar germanium","project":[{"grant_number":"862046","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","call_identifier":"H2020","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS"},{"name":"Integrated Germanium Quantum Technology","_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452","grant_number":"101069515"},{"_id":"bdc2ca30-d553-11ed-ba76-cf164a5bb811","grant_number":"101115315","name":"Quantum bits with Kitaev Transmons"},{"grant_number":"P32235","_id":"237B3DA4-32DE-11EA-91FC-C7463DDC885E","call_identifier":"FWF","name":"Towards scalable hut wire quantum devices"},{"name":"Merging spin and superconducting qubits in planar Ge","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a","grant_number":"P36507"},{"name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Conventional  and unconventional topological superconductors","grant_number":"F8606","_id":"34a66131-11ca-11ed-8bc3-a31681c6b03e"},{"call_identifier":"FWF","_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund"}],"intvolume":"        15","author":[{"full_name":"Valentini, Marco","last_name":"Valentini","first_name":"Marco","id":"C0BB2FAC-D767-11E9-B658-BC13E6697425"},{"full_name":"Sagi, Oliver","id":"71616374-A8E9-11E9-A7CA-09ECE5697425","first_name":"Oliver","last_name":"Sagi"},{"full_name":"Baghumyan, Levon","last_name":"Baghumyan","first_name":"Levon","id":"7aa1f788-b527-11ee-aa9e-e6111a79e0c7"},{"full_name":"de Gijsel, Thijs","last_name":"de Gijsel","id":"a0ece13c-b527-11ee-929d-bad130106eee","first_name":"Thijs"},{"last_name":"Jung","id":"4C9ACE7A-F248-11E8-B48F-1D18A9856A87","first_name":"Jason","full_name":"Jung, Jason"},{"first_name":"Stefano","last_name":"Calcaterra","full_name":"Calcaterra, Stefano"},{"full_name":"Ballabio, Andrea","last_name":"Ballabio","first_name":"Andrea"},{"last_name":"Aguilera Servin","orcid":"0000-0002-2862-8372","id":"2A67C376-F248-11E8-B48F-1D18A9856A87","first_name":"Juan L","full_name":"Aguilera Servin, Juan L"},{"full_name":"Aggarwal, Kushagra","orcid":"0000-0001-9985-9293","id":"b22ab905-3539-11eb-84c3-fc159dcd79cb","first_name":"Kushagra","last_name":"Aggarwal"},{"last_name":"Janik","orcid":"0009-0003-9037-8831","id":"396A1950-F248-11E8-B48F-1D18A9856A87","first_name":"Marian","full_name":"Janik, Marian"},{"full_name":"Adletzberger, Thomas","first_name":"Thomas","id":"38756BB2-F248-11E8-B48F-1D18A9856A87","last_name":"Adletzberger"},{"full_name":"Seoane Souto, Rubén","first_name":"Rubén","last_name":"Seoane Souto"},{"first_name":"Martin","last_name":"Leijnse","full_name":"Leijnse, Martin"},{"full_name":"Danon, Jeroen","last_name":"Danon","first_name":"Jeroen"},{"last_name":"Schrade","first_name":"Constantin","full_name":"Schrade, Constantin"},{"first_name":"Erik","last_name":"Bakkers","full_name":"Bakkers, Erik"},{"first_name":"Daniel","last_name":"Chrastina","full_name":"Chrastina, Daniel"},{"last_name":"Isella","first_name":"Giovanni","full_name":"Isella, Giovanni"},{"full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","last_name":"Katsaros"}],"date_published":"2024-01-02T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"external_id":{"isi":["001142794000839"],"pmid":["38167818"]},"OA_type":"gold","quality_controlled":"1","date_created":"2024-01-14T23:00:56Z","related_material":{"record":[{"id":"13312","relation":"earlier_version","status":"public"}]},"corr_author":"1","article_processing_charge":"Yes","_id":"14793","acknowledgement":"We acknowledge Alexander Brinkmann, Alessandro Crippa, Francesco Giazotto, Andrew Higginbotham, Andrea Iorio, Giordano Scappucci, Christian Schonenberger, and Lukas Splitthoff for helpful discussions. We thank Marcel Verheijen for the support in the TEM analysis. This research and related results were made possible with the support of the NOMIS\r\nFoundation. It was supported by the Scientific Service Units of ISTA through resources provided by the MIBA Machine Shop and the nanofabrication facility, the European Union’s Horizon 2020 research andinnovation programme under Grant Agreement No 862046, the HORIZONRIA\r\n101069515 project, the European Innovation Council Pathfinder grant no. 101115315 (QuKiT), and the FWF Projects #P-32235, #P-36507 and #F-8606. For the purpose of open access, the authors have applied a CC BY public copyright licence to any Author Accepted Manuscript version arising from this submission. R.S.S. acknowledges Spanish CM “Talento Program\"\r\nProject No. 2022-T1/IND-24070. J.J. acknowledges European Research Council TOCINA 834290.","has_accepted_license":"1","oa_version":"Published Version","oa":1,"OA_place":"publisher","publication_identifier":{"eissn":["2041-1723"]},"scopus_import":"1","status":"public","article_number":"169","DOAJ_listed":"1","ddc":["530"],"pmid":1,"citation":{"mla":"Valentini, Marco, et al. “Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.” <i>Nature Communications</i>, vol. 15, 169, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-023-44114-0\">10.1038/s41467-023-44114-0</a>.","ama":"Valentini M, Sagi O, Baghumyan L, et al. Parity-conserving Cooper-pair transport and ideal superconducting diode in planar germanium. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-023-44114-0\">10.1038/s41467-023-44114-0</a>","chicago":"Valentini, Marco, Oliver Sagi, Levon Baghumyan, Thijs de Gijsel, Jason Jung, Stefano Calcaterra, Andrea Ballabio, et al. “Parity-Conserving Cooper-Pair Transport and Ideal Superconducting Diode in Planar Germanium.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-023-44114-0\">https://doi.org/10.1038/s41467-023-44114-0</a>.","ista":"Valentini M, Sagi O, Baghumyan L, de Gijsel T, Jung J, Calcaterra S, Ballabio A, Aguilera Servin JL, Aggarwal K, Janik M, Adletzberger T, Seoane Souto R, Leijnse M, Danon J, Schrade C, Bakkers E, Chrastina D, Isella G, Katsaros G. 2024. Parity-conserving Cooper-pair transport and ideal superconducting diode in planar germanium. Nature Communications. 15, 169.","short":"M. Valentini, O. Sagi, L. Baghumyan, T. de Gijsel, J. Jung, S. Calcaterra, A. Ballabio, J.L. Aguilera Servin, K. Aggarwal, M. Janik, T. Adletzberger, R. Seoane Souto, M. Leijnse, J. Danon, C. Schrade, E. Bakkers, D. Chrastina, G. Isella, G. Katsaros, Nature Communications 15 (2024).","apa":"Valentini, M., Sagi, O., Baghumyan, L., de Gijsel, T., Jung, J., Calcaterra, S., … Katsaros, G. (2024). Parity-conserving Cooper-pair transport and ideal superconducting diode in planar germanium. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-023-44114-0\">https://doi.org/10.1038/s41467-023-44114-0</a>","ieee":"M. Valentini <i>et al.</i>, “Parity-conserving Cooper-pair transport and ideal superconducting diode in planar germanium,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024."},"ec_funded":1,"volume":15,"APC_amount":"6468 EUR","year":"2024","isi":1,"abstract":[{"text":"Superconductor/semiconductor hybrid devices have attracted increasing interest in the past years. Superconducting electronics aims to complement semiconductor technology, while hybrid architectures are at the forefront of new ideas such as topological superconductivity and protected qubits. In this work, we engineer the induced superconductivity in two-dimensional germanium hole gas by varying the distance between the quantum well and the aluminum. We demonstrate a hard superconducting gap and realize an electrically and flux tunable superconducting diode using a superconducting quantum interference device (SQUID). This allows to tune the current phase relation (CPR), to a regime where single Cooper pair tunneling is suppressed, creating a sin(2y) CPR. Shapiro experiments complement this interpretation and the microwave drive allows to create a diode with ≈ 100% efficiency. The reported results open up the path towards integration of spin qubit devices, microwave resonators and (protected) superconducting qubits on  the same silicon technology compatible platform.","lang":"eng"}],"publication":"Nature Communications","date_updated":"2026-07-29T07:04:56Z","day":"02","file_date_updated":"2024-01-17T11:03:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","language":[{"iso":"eng"}],"month":"01"},{"title":"On the local-global principle for isogenies of abelian surfaces","file":[{"checksum":"ae75441420aabd80c5828bce38272ba1","relation":"main_file","date_updated":"2024-07-22T09:33:58Z","success":1,"access_level":"open_access","creator":"dernst","file_size":1301415,"file_id":"17298","content_type":"application/pdf","file_name":"2024_SelectaMath_Lombardo.pdf","date_created":"2024-07-22T09:33:58Z"}],"researchdata_availability":"no","issue":"2","department":[{"_id":"TiBr"}],"publication_status":"published","type":"journal_article","doi":"10.1007/s00029-023-00908-0","publisher":"Springer Nature","_id":"12312","acknowledgement":"It is a pleasure to thank Samuele Anni for his interest in this project and for several discussions on the topic of this paper, which led in particular to Remark 6.30 and to a better understanding of the difficulties with [6]. We also thank John Cullinan for correspondence about [6] and Barinder Banwait for his many insightful comments on the first version of this paper. Finally, we thank the referee for their thorough reading of the manuscript.\r\nOpen access funding provided by Università di Pisa within the CRUI-CARE Agreement. The authors have been partially supported by MIUR (Italy) through PRIN 2017 “Geometric, algebraic and analytic methods in arithmetic\" and PRIN 2022 “Semiabelian varieties, Galois representations and related Diophantine problems\", and by the University of Pisa through PRA 2018-19 and 2022 “Spazi di moduli, rappresentazioni e strutture combinatorie\". The first author is a member of the INdAM group GNSAGA.","date_created":"2023-01-16T11:45:53Z","article_processing_charge":"Yes (via OA deal)","corr_author":"1","date_published":"2024-01-26T00:00:00Z","external_id":{"arxiv":["2206.15240"],"isi":["001148959100001"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)"},"quality_controlled":"1","intvolume":"        30","author":[{"last_name":"Lombardo","first_name":"Davide","full_name":"Lombardo, Davide"},{"orcid":"0000-0002-0854-0306","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","first_name":"Matteo","last_name":"Verzobio","full_name":"Verzobio, Matteo"}],"citation":{"chicago":"Lombardo, Davide, and Matteo Verzobio. “On the Local-Global Principle for Isogenies of Abelian Surfaces.” <i>Selecta Mathematica</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/s00029-023-00908-0\">https://doi.org/10.1007/s00029-023-00908-0</a>.","ama":"Lombardo D, Verzobio M. On the local-global principle for isogenies of abelian surfaces. <i>Selecta Mathematica</i>. 2024;30(2). doi:<a href=\"https://doi.org/10.1007/s00029-023-00908-0\">10.1007/s00029-023-00908-0</a>","mla":"Lombardo, Davide, and Matteo Verzobio. “On the Local-Global Principle for Isogenies of Abelian Surfaces.” <i>Selecta Mathematica</i>, vol. 30, no. 2, 18, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/s00029-023-00908-0\">10.1007/s00029-023-00908-0</a>.","short":"D. Lombardo, M. Verzobio, Selecta Mathematica 30 (2024).","ieee":"D. Lombardo and M. Verzobio, “On the local-global principle for isogenies of abelian surfaces,” <i>Selecta Mathematica</i>, vol. 30, no. 2. Springer Nature, 2024.","apa":"Lombardo, D., &#38; Verzobio, M. (2024). On the local-global principle for isogenies of abelian surfaces. <i>Selecta Mathematica</i>. Springer Nature. <a href=\"https://doi.org/10.1007/s00029-023-00908-0\">https://doi.org/10.1007/s00029-023-00908-0</a>","ista":"Lombardo D, Verzobio M. 2024. On the local-global principle for isogenies of abelian surfaces. Selecta Mathematica. 30(2), 18."},"volume":30,"ddc":["510"],"publication_identifier":{"eissn":["1420-9020"],"issn":["1022-1824"]},"scopus_import":"1","status":"public","article_number":"18","oa":1,"oa_version":"Published Version","has_accepted_license":"1","arxiv":1,"month":"01","supplementarymaterial":"no","day":"26","file_date_updated":"2024-07-22T09:33:58Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_type":"original","language":[{"iso":"eng"}],"publication":"Selecta Mathematica","date_updated":"2026-07-29T09:53:10Z","das_tickbox":"0","year":"2024","isi":1,"abstract":[{"lang":"eng","text":"Let $\\ell$ be a prime number. We classify the subgroups $G$ of $\\operatorname{Sp}_4(\\mathbb{F}_\\ell)$ and $\\operatorname{GSp}_4(\\mathbb{F}_\\ell)$ that act irreducibly on $\\mathbb{F}_\\ell^4$, but such that every element of $G$ fixes an $\\mathbb{F}_\\ell$-vector subspace of dimension 1. We use this classification to prove that the local-global principle for isogenies of degree $\\ell$ between abelian surfaces over number fields holds in many cases -- in particular, whenever the abelian surface has non-trivial endomorphisms and $\\ell$ is large enough with respect to the field of definition. Finally, we prove that there exist arbitrarily large primes $\\ell$ for which some abelian surface\r\n$A/\\mathbb{Q}$ fails the local-global principle for isogenies of degree $\\ell$."}]}]