[{"_id":"18755","OA_type":"green","article_processing_charge":"No","language":[{"iso":"eng"}],"date_updated":"2025-09-09T12:00:12Z","conference":{"end_date":"2024-12-13","name":"ASIACRYPT: Conference on the Theory and Application of Cryptology and Information Security","location":"Kolkata, India","start_date":"2024-12-09"},"publication_status":"published","status":"public","scopus_import":"1","doi":"10.1007/978-981-96-0891-1_7","intvolume":"     15486","page":"207-239","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"KrPi"}],"title":"Strongly secure universal thresholdizer","oa_version":"Preprint","type":"conference","publication_identifier":{"eissn":["1611-3349"],"issn":["0302-9743"],"isbn":["9789819608904"]},"OA_place":"repository","acknowledgement":"Ehsan Ebrahimi is supported by the Luxembourg National Research Fund under the Junior CORE project QSP (C22/IS/17272217/QSP/Ebrahimi).","date_published":"2024-12-12T00:00:00Z","external_id":{"isi":["001443889100007"]},"isi":1,"publisher":"Springer Nature","abstract":[{"text":"A universalthresholdizer (UT), constructed from a threshold fully homomorphic encryption by Boneh et. al , Crypto 2018, is a general framework for universally thresholdizing many cryptographic schemes. However, their framework is insufficient to construct strongly secure threshold schemes, such as threshold signatures and threshold public-key encryption, etc.\r\n\r\nIn this paper, we strengthen the security definition for a universal thresholdizer and propose a scheme which satisfies our stronger security notion. Our UT scheme is an improvement of Boneh et. al ’s construction at the level of threshold fully homomorphic encryption using a key homomorphic pseudorandom function. We apply our strongly secure UT scheme to construct strongly secure threshold signatures and threshold public-key encryption.","lang":"eng"}],"citation":{"ama":"Ebrahimi E, Yadav A. Strongly secure universal thresholdizer. In: <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>. Vol 15486. Springer Nature; 2024:207-239. doi:<a href=\"https://doi.org/10.1007/978-981-96-0891-1_7\">10.1007/978-981-96-0891-1_7</a>","mla":"Ebrahimi, Ehsan, and Anshu Yadav. “Strongly Secure Universal Thresholdizer.” <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, vol. 15486, Springer Nature, 2024, pp. 207–39, doi:<a href=\"https://doi.org/10.1007/978-981-96-0891-1_7\">10.1007/978-981-96-0891-1_7</a>.","ista":"Ebrahimi E, Yadav A. 2024. Strongly secure universal thresholdizer. 30th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: Conference on the Theory and Application of Cryptology and Information Security vol. 15486, 207–239.","ieee":"E. Ebrahimi and A. Yadav, “Strongly secure universal thresholdizer,” in <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, Kolkata, India, 2024, vol. 15486, pp. 207–239.","short":"E. Ebrahimi, A. Yadav, in:, 30th International Conference on the Theory and Application of Cryptology and Information Security, Springer Nature, 2024, pp. 207–239.","chicago":"Ebrahimi, Ehsan, and Anshu Yadav. “Strongly Secure Universal Thresholdizer.” In <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, 15486:207–39. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-981-96-0891-1_7\">https://doi.org/10.1007/978-981-96-0891-1_7</a>.","apa":"Ebrahimi, E., &#38; Yadav, A. (2024). Strongly secure universal thresholdizer. In <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i> (Vol. 15486, pp. 207–239). Kolkata, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-981-96-0891-1_7\">https://doi.org/10.1007/978-981-96-0891-1_7</a>"},"publication":"30th International Conference on the Theory and Application of Cryptology and Information Security","main_file_link":[{"url":"https://eprint.iacr.org/2024/2078","open_access":"1"}],"oa":1,"author":[{"full_name":"Ebrahimi, Ehsan","last_name":"Ebrahimi","first_name":"Ehsan"},{"full_name":"Yadav, Anshu","id":"dc8f1524-403e-11ee-bf07-9649ad996e21","first_name":"Anshu","last_name":"Yadav"}],"quality_controlled":"1","month":"12","volume":15486,"year":"2024","day":"12","date_created":"2025-01-05T23:01:56Z"},{"publication_status":"published","status":"public","date_updated":"2025-09-09T12:00:51Z","conference":{"end_date":"2024-12-13","name":"ASIACRYPT: Conference on the Theory and Application of Cryptology and Information Security","start_date":"2024-12-09","location":"Kolkata, India"},"intvolume":"     15487","doi":"10.1007/978-981-96-0894-2_14","scopus_import":"1","OA_type":"green","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"18756","title":"Evasive LWE assumptions: Definitions, classes, and counterexamples","department":[{"_id":"KrPi"}],"oa_version":"Preprint","type":"conference","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","page":"418-449","citation":{"ista":"Brzuska C, Ünal A, Woo IKY. 2024. Evasive LWE assumptions: Definitions, classes, and counterexamples. 30th International Conference on the Theory and Application of Cryptology and Information Security. ASIACRYPT: Conference on the Theory and Application of Cryptology and Information Security, LNCS, vol. 15487, 418–449.","mla":"Brzuska, Chris, et al. “Evasive LWE Assumptions: Definitions, Classes, and Counterexamples.” <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, vol. 15487, Springer Nature, 2024, pp. 418–49, doi:<a href=\"https://doi.org/10.1007/978-981-96-0894-2_14\">10.1007/978-981-96-0894-2_14</a>.","ama":"Brzuska C, Ünal A, Woo IKY. Evasive LWE assumptions: Definitions, classes, and counterexamples. In: <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>. Vol 15487. Springer Nature; 2024:418-449. doi:<a href=\"https://doi.org/10.1007/978-981-96-0894-2_14\">10.1007/978-981-96-0894-2_14</a>","apa":"Brzuska, C., Ünal, A., &#38; Woo, I. K. Y. (2024). Evasive LWE assumptions: Definitions, classes, and counterexamples. In <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i> (Vol. 15487, pp. 418–449). Kolkata, India: Springer Nature. <a href=\"https://doi.org/10.1007/978-981-96-0894-2_14\">https://doi.org/10.1007/978-981-96-0894-2_14</a>","short":"C. Brzuska, A. Ünal, I.K.Y. Woo, in:, 30th International Conference on the Theory and Application of Cryptology and Information Security, Springer Nature, 2024, pp. 418–449.","chicago":"Brzuska, Chris, Akin Ünal, and Ivy K.Y. Woo. “Evasive LWE Assumptions: Definitions, Classes, and Counterexamples.” In <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, 15487:418–49. Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-981-96-0894-2_14\">https://doi.org/10.1007/978-981-96-0894-2_14</a>.","ieee":"C. Brzuska, A. Ünal, and I. K. Y. Woo, “Evasive LWE assumptions: Definitions, classes, and counterexamples,” in <i>30th International Conference on the Theory and Application of Cryptology and Information Security</i>, Kolkata, India, 2024, vol. 15487, pp. 418–449."},"abstract":[{"lang":"eng","text":"The evasive LWE assumption, proposed by Wee [Eurocrypt’22 Wee] for constructing a lattice-based optimal broadcast encryption, has shown to be a powerful assumption, adopted by subsequent works to construct advanced primitives ranging from ABE variants to obfuscation for null circuits. However, a closer look reveals significant differences among the precise assumption statements involved in different works, leading to the fundamental question of how these assumptions compare to each other. In this work, we initiate a more systematic study on evasive LWE assumptions:\r\n(i) Based on the standard LWE assumption, we construct simple counterexamples against three private-coin evasive LWE variants, used in [Crypto’22 Tsabary, Asiacrypt’22 VWW, Crypto’23 ARYY] respectively, showing that these assumptions are unlikely to hold.\r\n\r\n(ii) Based on existing evasive LWE variants and our counterexamples, we propose and define three classes of plausible evasive LWE assumptions, suitably capturing all existing variants for which we are not aware of non-obfuscation-based counterexamples.\r\n\r\n(iii) We show that under our assumption formulations, the security proofs of [Asiacrypt’22 VWW] and [Crypto’23 ARYY] can be recovered, and we reason why the security proof of [Crypto’22 Tsabary] is also plausibly repairable using an appropriate evasive LWE assumption."}],"publication":"30th International Conference on the Theory and Application of Cryptology and Information Security","main_file_link":[{"url":"https://eprint.iacr.org/2024/2000","open_access":"1"}],"publication_identifier":{"isbn":["9789819608935"],"issn":["0302-9743"],"eissn":["1611-3349"]},"OA_place":"repository","acknowledgement":"The authors thank the anonymous reviewers for insightful comments which very much improved this work, in particular, sharing with us the counterexamples against a prior version of Hiding Evasive LWE, and against public-coin Evasive LWE when the sampler inputs B. Chris Brzuska and Ivy K. Y. Woo are supported by Research Council of Finland grant 358950. We thank Russell W. F. Lai and Hoeteck Wee for helpful discussions.","external_id":{"isi":["001443890800014"]},"date_published":"2024-12-13T00:00:00Z","isi":1,"publisher":"Springer Nature","volume":15487,"date_created":"2025-01-05T23:01:56Z","alternative_title":["LNCS"],"year":"2024","day":"13","oa":1,"month":"12","author":[{"full_name":"Brzuska, Chris","last_name":"Brzuska","first_name":"Chris"},{"first_name":"Akin","last_name":"Ünal","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","orcid":"0000-0002-8929-0221","full_name":"Ünal, Akin"},{"last_name":"Woo","first_name":"Ivy K.Y.","full_name":"Woo, Ivy K.Y."}],"quality_controlled":"1"},{"language":[{"iso":"eng"}],"article_processing_charge":"Yes","OA_type":"gold","_id":"18757","file":[{"file_id":"18774","creator":"dernst","relation":"main_file","file_size":7445664,"access_level":"open_access","date_updated":"2025-01-08T08:51:45Z","file_name":"2024_eLife_Last.pdf","checksum":"a4f0f906e4d5c1078208b317e78699d1","success":1,"content_type":"application/pdf","date_created":"2025-01-08T08:51:45Z"}],"ddc":["570"],"intvolume":"        13","scopus_import":"1","doi":"10.7554/eLife.98552","publication_status":"published","status":"public","date_updated":"2025-01-08T08:52:51Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","DOAJ_listed":"1","oa_version":"Published Version","type":"journal_article","article_type":"original","title":"Streamlining segmentation of cryo-electron tomography datasets with Ais","department":[{"_id":"FlPr"}],"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publisher":"eLife Sciences Publications","OA_place":"publisher","publication_identifier":{"eissn":["2050-084X"]},"file_date_updated":"2025-01-08T08:51:45Z","acknowledgement":"We thank A Koster and M Barcena for helpful discussions and kindly sharing the coronaviral replication organelle datasets. We are also grateful to van den Hoek et al., 2022 and Wu et al., 2023, for uploading the data that we used for Figure 5 onto EMPIAR and EMDB, as well as to the authors of various other datasets uploaded to these databases that are not discussed in this manuscript but that were useful for testing the software. We also thank the reviewers, whose comments were very helpful in improving the manuscript and the software. Finally, we are grateful the early Ais users who provided us with feedback on the software and reported issues. This research was supported by the following grants to THS: European Research Council H202 Grant 759517; European Union’s Horizon Europe Program IMAGINE grant 101094250, and the Netherlands Organization for Scientific Research Grant VI.Vidi.193.014.","date_published":"2024-12-20T00:00:00Z","external_id":{"pmid":["39704648"]},"pmid":1,"publication":"eLife","citation":{"mla":"Last, Mart G. F., et al. “Streamlining Segmentation of Cryo-Electron Tomography Datasets with Ais.” <i>ELife</i>, vol. 13, 98552, eLife Sciences Publications, 2024, doi:<a href=\"https://doi.org/10.7554/eLife.98552\">10.7554/eLife.98552</a>.","ama":"Last MGF, Abendstein L, Voortman LM, Sharp TH. Streamlining segmentation of cryo-electron tomography datasets with Ais. <i>eLife</i>. 2024;13. doi:<a href=\"https://doi.org/10.7554/eLife.98552\">10.7554/eLife.98552</a>","ista":"Last MGF, Abendstein L, Voortman LM, Sharp TH. 2024. Streamlining segmentation of cryo-electron tomography datasets with Ais. eLife. 13, 98552.","ieee":"M. G. F. Last, L. Abendstein, L. M. Voortman, and T. H. Sharp, “Streamlining segmentation of cryo-electron tomography datasets with Ais,” <i>eLife</i>, vol. 13. eLife Sciences Publications, 2024.","apa":"Last, M. G. F., Abendstein, L., Voortman, L. M., &#38; Sharp, T. H. (2024). Streamlining segmentation of cryo-electron tomography datasets with Ais. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/eLife.98552\">https://doi.org/10.7554/eLife.98552</a>","short":"M.G.F. Last, L. Abendstein, L.M. Voortman, T.H. Sharp, ELife 13 (2024).","chicago":"Last, Mart G.F., Leoni Abendstein, Lenard M. Voortman, and Thomas H. Sharp. “Streamlining Segmentation of Cryo-Electron Tomography Datasets with Ais.” <i>ELife</i>. eLife Sciences Publications, 2024. <a href=\"https://doi.org/10.7554/eLife.98552\">https://doi.org/10.7554/eLife.98552</a>."},"abstract":[{"text":"Segmentation is a critical data processing step in many applications of cryo-electron tomography. Downstream analyses, such as subtomogram averaging, are often based on segmentation results, and are thus critically dependent on the availability of open-source software for accurate as well as high-throughput tomogram segmentation. There is a need for more user-friendly, flexible, and comprehensive segmentation software that offers an insightful overview of all steps involved in preparing automated segmentations. Here, we present Ais: a dedicated tomogram segmentation package that is geared towards both high performance and accessibility, available on GitHub. In this report, we demonstrate two common processing steps that can be greatly accelerated with Ais: particle picking for subtomogram averaging, and generating many-feature segmentations of cellular architecture based on in situ tomography data. Featuring comprehensive annotation, segmentation, and rendering functionality, as well as an open repository for trained models at aiscryoet.org, we hope that Ais will help accelerate research and dissemination of data involving cryoET.","lang":"eng"}],"month":"12","author":[{"first_name":"Mart G.F.","last_name":"Last","full_name":"Last, Mart G.F."},{"full_name":"Abendstein, Leoni","first_name":"Leoni","last_name":"Abendstein","id":"14f1f051-cd9d-11ef-9c94-8b942a882560","orcid":"0000-0001-7634-5353"},{"full_name":"Voortman, Lenard M.","first_name":"Lenard M.","last_name":"Voortman"},{"full_name":"Sharp, Thomas H.","last_name":"Sharp","first_name":"Thomas H."}],"quality_controlled":"1","oa":1,"date_created":"2025-01-05T23:01:57Z","year":"2024","day":"20","article_number":"98552","volume":13},{"date_updated":"2026-01-05T13:46:07Z","conference":{"start_date":"2024-09-04","location":"Egham, United Kingdom","end_date":"2024-09-06","name":"IPEC: Symposium on Parameterized and Exact Computation"},"publication_status":"published","status":"public","scopus_import":"1","doi":"10.4230/LIPIcs.IPEC.2024.2","intvolume":"       321","file":[{"success":1,"date_created":"2025-01-08T09:14:59Z","content_type":"application/pdf","date_updated":"2025-01-08T09:14:59Z","access_level":"open_access","checksum":"a64b9a0e41f7b867d25cb155825ccd53","file_name":"2024_LIPIcs_Lill.pdf","file_size":927326,"relation":"main_file","creator":"dernst","file_id":"18775"}],"_id":"18758","ddc":["500"],"article_processing_charge":"Yes","language":[{"iso":"eng"}],"OA_type":"gold","department":[{"_id":"MaKw"}],"title":"Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound","oa_version":"Published Version","type":"conference","ec_funded":1,"project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"corr_author":"1","abstract":[{"text":"MaxCut is a classical NP-complete problem and a crucial building block in many combinatorial algorithms. The famous Edwards-Erdős bound states that any connected graph on n vertices with m edges contains a cut of size at least m/2+(n-1)/4. Crowston, Jones and Mnich [Algorithmica, 2015] showed that the MaxCut problem on simple connected graphs admits an FPT algorithm, where the parameter k is the difference between the desired cut size c and the lower bound given by the Edwards-Erdős bound. This was later improved by Etscheid and Mnich [Algorithmica, 2017] to run in parameterized linear time, i.e., f(k)⋅ O(m). We improve upon this result in two ways: Firstly, we extend the algorithm to work also for multigraphs (alternatively, graphs with positive integer weights). Secondly, we change the parameter; instead of the difference to the Edwards-Erdős bound, we use the difference to the Poljak-Turzík bound. The Poljak-Turzík bound states that any weighted graph G has a cut of size at least (w(G))/2+(w_MSF(G))/4, where w(G) denotes the total weight of G, and w_MSF(G) denotes the weight of its minimum spanning forest. In connected simple graphs the two bounds are equivalent, but for multigraphs the Poljak-Turzík bound can be larger and thus yield a smaller parameter k. Our algorithm also runs in parameterized linear time, i.e., f(k)⋅ O(m+n).","lang":"eng"}],"citation":{"ieee":"J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” in <i>19th International Symposium on Parameterized and Exact Computation</i>, Egham, United Kingdom, 2024, vol. 321.","apa":"Lill, J., Petrova, K. H., &#38; Weber, S. (2024). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In <i>19th International Symposium on Parameterized and Exact Computation</i> (Vol. 321). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.IPEC.2024.2\">https://doi.org/10.4230/LIPIcs.IPEC.2024.2</a>","short":"J. Lill, K.H. Petrova, S. Weber, in:, 19th International Symposium on Parameterized and Exact Computation, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","chicago":"Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” In <i>19th International Symposium on Parameterized and Exact Computation</i>, Vol. 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.IPEC.2024.2\">https://doi.org/10.4230/LIPIcs.IPEC.2024.2</a>.","mla":"Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” <i>19th International Symposium on Parameterized and Exact Computation</i>, vol. 321, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.IPEC.2024.2\">10.4230/LIPIcs.IPEC.2024.2</a>.","ama":"Lill J, Petrova KH, Weber S. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In: <i>19th International Symposium on Parameterized and Exact Computation</i>. Vol 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.IPEC.2024.2\">10.4230/LIPIcs.IPEC.2024.2</a>","ista":"Lill J, Petrova KH, Weber S. 2024. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. 19th International Symposium on Parameterized and Exact Computation. IPEC: Symposium on Parameterized and Exact Computation, LIPIcs, vol. 321, 2."},"publication":"19th International Symposium on Parameterized and Exact Computation","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773539"]},"OA_place":"publisher","file_date_updated":"2025-01-08T09:14:59Z","acknowledgement":"Kalina Petrova: Swiss National Science Foundation, grant no. CRSII5 173721. This project\r\nhas received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No 101034413.\r\nSimon Weber: Swiss National Science Foundation under project no. 204320","external_id":{"arxiv":["2407.01071"],"isi":["001534851900002"]},"date_published":"2024-12-05T00:00:00Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","isi":1,"has_accepted_license":"1","volume":321,"year":"2024","day":"05","article_number":"2","date_created":"2025-01-05T23:01:57Z","alternative_title":["LIPIcs"],"oa":1,"author":[{"full_name":"Lill, Jonas","first_name":"Jonas","last_name":"Lill"},{"full_name":"Petrova, Kalina H","first_name":"Kalina H","last_name":"Petrova","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381"},{"full_name":"Weber, Simon","last_name":"Weber","first_name":"Simon"}],"related_material":{"record":[{"id":"19603","status":"public","relation":"later_version"}]},"quality_controlled":"1","month":"12"},{"external_id":{"arxiv":["2310.06887"],"isi":["001364636000001"]},"date_published":"2024-12-01T00:00:00Z","file_date_updated":"2025-01-08T08:18:39Z","acknowledgement":"We thank the reviewer and editorial staff for their excellent feedback and effort—the manuscript is much stronger as a result. Support for this work was provided by NASA through grant JWST-GO-01895 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-26555. H.Ü. gratefully acknowledges support by the Isaac Newton Trust and by the Kavli Foundation through a Newton-Kavli Junior Fellowship. This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract No. MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant No. 140. R.S. acknowledges an STFC Ernest Rutherford Fellowship (ST/S004831/1). R.P.N. acknowledges support for this work provided by NASA through the NASA Hubble Fellowship grant HST-HF2-51515.001-A awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. M.V.M. acknowledges support from the National Science Foundation via AAG grant 2205519 and the Wisconsin Alumni Research Foundation via grant MSN251397. R.M. also acknowledges funding from a research professorship from the Royal Society. A.J.B., A.J.C., and G.C.J. acknowledge funding from the \"FirstGalaxies\" Advanced Grant from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement No. 789056). I.L. acknowledges support by the Australian Research Council through Future Fellowship FT220100798. D.J.E. is supported as a Simons Investigator and by a JWST/NIRCam contract to the University of Arizona, NAS5-02015. R.M., J.W., L.S., and W.B. acknowledge support by the Science and Technology Facilities Council (STFC), the ERC through advanced grant 695671 \"QUENCH,\" and the UKRI Frontier Research grant RISEandFALL. B.E.R. acknowledges support from the NIRCam Science Team contract to the University of Arizona, NAS5-02015. The research of C.C.W. is supported by NOIRLab, which is managed by the Association of Universities for Research in Astronomy (AURA) under a cooperative agreement with the National Science Foundation. The HST and JWST image mosaics of the FRESCO fields are released at MAST as a High Level Science Product (P. Oesch & D. Magee 2023).","publication_identifier":{"eissn":["2041-8213"],"issn":["2041-8205"]},"OA_place":"publisher","has_accepted_license":"1","publisher":"IOP Publishing","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"citation":{"mla":"Nelson, Erica, et al. “Ionized Gas Kinematics with FRESCO: An Extended, Massive, Rapidly Rotating Galaxy at z = 5.4.” <i>Astrophysical Journal Letters</i>, vol. 976, no. 2, L27, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/2041-8213/ad7b17\">10.3847/2041-8213/ad7b17</a>.","ama":"Nelson E, Brammer G, Giménez-Arteaga C, et al. Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4. <i>Astrophysical Journal Letters</i>. 2024;976(2). doi:<a href=\"https://doi.org/10.3847/2041-8213/ad7b17\">10.3847/2041-8213/ad7b17</a>","ista":"Nelson E, Brammer G, Giménez-Arteaga C, Oesch PA, Naidu RP, Übler H, Matharu J, Shapley AE, Whitaker KE, Wisnioski E, Förster Schreiber NM, Smit R, Van Dokkum P, Chisholm J, Endsley R, Hartley AI, Gibson J, Giovinazzo E, Illingworth G, Labbe I, Maseda MV, Matthee JJ, Covelo Paz A, Price SH, Reddy NA, Shivaei I, Weibel A, Wuyts S, Xiao M, Alberts S, Baker WM, Bunker AJ, Cameron AJ, Charlot S, Eisenstein DJ, De Graaff A, Ji Z, Johnson BD, Jones GC, Maiolino R, Robertson B, Sandles L, Suess KA, Tacchella S, Williams CC, Witstok J. 2024. Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4. Astrophysical Journal Letters. 976(2), L27.","ieee":"E. Nelson <i>et al.</i>, “Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4,” <i>Astrophysical Journal Letters</i>, vol. 976, no. 2. IOP Publishing, 2024.","apa":"Nelson, E., Brammer, G., Giménez-Arteaga, C., Oesch, P. A., Naidu, R. P., Übler, H., … Witstok, J. (2024). Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4. <i>Astrophysical Journal Letters</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/2041-8213/ad7b17\">https://doi.org/10.3847/2041-8213/ad7b17</a>","chicago":"Nelson, Erica, Gabriel Brammer, Clara Giménez-Arteaga, Pascal A. Oesch, Rohan P. Naidu, Hannah Übler, Jasleen Matharu, et al. “Ionized Gas Kinematics with FRESCO: An Extended, Massive, Rapidly Rotating Galaxy at z = 5.4.” <i>Astrophysical Journal Letters</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/2041-8213/ad7b17\">https://doi.org/10.3847/2041-8213/ad7b17</a>.","short":"E. Nelson, G. Brammer, C. Giménez-Arteaga, P.A. Oesch, R.P. Naidu, H. Übler, J. Matharu, A.E. Shapley, K.E. Whitaker, E. Wisnioski, N.M. Förster Schreiber, R. Smit, P. Van Dokkum, J. Chisholm, R. Endsley, A.I. Hartley, J. Gibson, E. Giovinazzo, G. Illingworth, I. Labbe, M.V. Maseda, J.J. Matthee, A. Covelo Paz, S.H. Price, N.A. Reddy, I. Shivaei, A. Weibel, S. Wuyts, M. Xiao, S. Alberts, W.M. Baker, A.J. Bunker, A.J. Cameron, S. Charlot, D.J. Eisenstein, A. De Graaff, Z. Ji, B.D. Johnson, G.C. Jones, R. Maiolino, B. Robertson, L. Sandles, K.A. Suess, S. Tacchella, C.C. Williams, J. Witstok, Astrophysical Journal Letters 976 (2024)."},"abstract":[{"text":"With the remarkable sensitivity and resolution of JWST in the infrared, measuring rest-optical kinematics of galaxies at z > 5 has become possible for the first time. This study pilots a new method for measuring galaxy dynamics for highly multiplexed, unbiased samples by combining FRESCO NIRCam grism spectroscopy and JADES medium-band imaging. Here we present one of the first JWST kinematic measurements for a galaxy at z > 5. We find a significant velocity gradient, which, if interpreted as rotation, yields Vrot = 305 ± 70 km s−1, and we hence refer to this galaxy as Twister-z5. With a rest-frame optical effective radius of re = 2.25 kpc, the high rotation velocity in this galaxy is not due to a compact size, as may be expected in the early Universe, but rather to a high total mass, (math formula). This is a factor of roughly 10× higher than the stellar mass within re. We also observe that the radial Hα equivalent width profile and the specific star formation rate map from resolved stellar population modeling are centrally depressed by a factor of ∼1.5 from the center to re. Combined with the morphology of the line-emitting gas in comparison to the continuum, this centrally suppressed star formation is consistent with a star-forming disk surrounding a bulge growing inside out. While large, rapidly rotating disks are common to z ∼ 2, the existence of one after only 1 Gyr of cosmic time, shown for the first time in ionized gas, adds to the growing evidence that some galaxies matured earlier than expected in the history of the Universe.","lang":"eng"}],"publication":"Astrophysical Journal Letters","oa":1,"month":"12","quality_controlled":"1","author":[{"last_name":"Nelson","first_name":"Erica","full_name":"Nelson, Erica"},{"first_name":"Gabriel","last_name":"Brammer","full_name":"Brammer, Gabriel"},{"first_name":"Clara","last_name":"Giménez-Arteaga","full_name":"Giménez-Arteaga, Clara"},{"full_name":"Oesch, Pascal A.","first_name":"Pascal A.","last_name":"Oesch"},{"full_name":"Naidu, Rohan P.","last_name":"Naidu","first_name":"Rohan P."},{"full_name":"Übler, Hannah","last_name":"Übler","first_name":"Hannah"},{"full_name":"Matharu, Jasleen","first_name":"Jasleen","last_name":"Matharu"},{"full_name":"Shapley, Alice E.","last_name":"Shapley","first_name":"Alice E."},{"last_name":"Whitaker","first_name":"Katherine E.","full_name":"Whitaker, Katherine E."},{"full_name":"Wisnioski, Emily","first_name":"Emily","last_name":"Wisnioski"},{"first_name":"Natascha M.","last_name":"Förster Schreiber","full_name":"Förster Schreiber, Natascha M."},{"last_name":"Smit","first_name":"Renske","full_name":"Smit, Renske"},{"full_name":"Van Dokkum, Pieter","last_name":"Van Dokkum","first_name":"Pieter"},{"first_name":"John","last_name":"Chisholm","full_name":"Chisholm, John"},{"first_name":"Ryan","last_name":"Endsley","full_name":"Endsley, Ryan"},{"full_name":"Hartley, Abigail I.","first_name":"Abigail I.","last_name":"Hartley"},{"last_name":"Gibson","first_name":"Justus","full_name":"Gibson, Justus"},{"first_name":"Emma","last_name":"Giovinazzo","full_name":"Giovinazzo, Emma"},{"first_name":"Garth","last_name":"Illingworth","full_name":"Illingworth, Garth"},{"full_name":"Labbe, Ivo","first_name":"Ivo","last_name":"Labbe"},{"full_name":"Maseda, Michael V.","first_name":"Michael V.","last_name":"Maseda"},{"full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"full_name":"Covelo Paz, Alba","first_name":"Alba","last_name":"Covelo Paz"},{"last_name":"Price","first_name":"Sedona H.","full_name":"Price, Sedona H."},{"full_name":"Reddy, Naveen A.","first_name":"Naveen A.","last_name":"Reddy"},{"full_name":"Shivaei, Irene","first_name":"Irene","last_name":"Shivaei"},{"last_name":"Weibel","first_name":"Andrea","full_name":"Weibel, Andrea"},{"full_name":"Wuyts, Stijn","last_name":"Wuyts","first_name":"Stijn"},{"full_name":"Xiao, Mengyuan","last_name":"Xiao","first_name":"Mengyuan"},{"full_name":"Alberts, Stacey","first_name":"Stacey","last_name":"Alberts"},{"first_name":"William M.","last_name":"Baker","full_name":"Baker, William M."},{"full_name":"Bunker, Andrew J.","first_name":"Andrew J.","last_name":"Bunker"},{"first_name":"Alex J.","last_name":"Cameron","full_name":"Cameron, Alex J."},{"last_name":"Charlot","first_name":"Stephane","full_name":"Charlot, Stephane"},{"first_name":"Daniel J.","last_name":"Eisenstein","full_name":"Eisenstein, Daniel J."},{"full_name":"De Graaff, Anna","first_name":"Anna","last_name":"De Graaff"},{"first_name":"Zhiyuan","last_name":"Ji","full_name":"Ji, Zhiyuan"},{"last_name":"Johnson","first_name":"Benjamin D.","full_name":"Johnson, Benjamin D."},{"full_name":"Jones, Gareth C.","last_name":"Jones","first_name":"Gareth C."},{"first_name":"Roberto","last_name":"Maiolino","full_name":"Maiolino, Roberto"},{"last_name":"Robertson","first_name":"Brant","full_name":"Robertson, Brant"},{"full_name":"Sandles, Lester","last_name":"Sandles","first_name":"Lester"},{"first_name":"Katherine A.","last_name":"Suess","full_name":"Suess, Katherine A."},{"first_name":"Sandro","last_name":"Tacchella","full_name":"Tacchella, Sandro"},{"first_name":"Christina C.","last_name":"Williams","full_name":"Williams, Christina C."},{"last_name":"Witstok","first_name":"Joris","full_name":"Witstok, Joris"}],"volume":976,"date_created":"2025-01-05T23:01:58Z","article_number":"L27","day":"01","year":"2024","OA_type":"gold","language":[{"iso":"eng"}],"article_processing_charge":"Yes","ddc":["520"],"_id":"18760","file":[{"file_id":"18771","creator":"dernst","file_size":1822989,"relation":"main_file","access_level":"open_access","date_updated":"2025-01-08T08:18:39Z","file_name":"2024_AstrophysicalJour_Nelson.pdf","checksum":"5c7320196586b4340e55f215d8737185","success":1,"content_type":"application/pdf","date_created":"2025-01-08T08:18:39Z"}],"status":"public","issue":"2","publication_status":"published","date_updated":"2025-09-09T11:58:02Z","intvolume":"       976","doi":"10.3847/2041-8213/ad7b17","scopus_import":"1","DOAJ_listed":"1","arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4","department":[{"_id":"JoMa"}],"type":"journal_article","oa_version":"Published Version","article_type":"letter_note"},{"date_updated":"2025-09-09T11:58:41Z","publication_status":"published","issue":"12","status":"public","scopus_import":"1","doi":"10.1093/gbe/evae265","intvolume":"        16","_id":"18761","file":[{"date_created":"2025-01-08T08:28:07Z","content_type":"application/pdf","success":1,"checksum":"9cf8fd14580dd694dd810ccca808ad0e","file_name":"2024_GBE_Fraser.pdf","date_updated":"2025-01-08T08:28:07Z","access_level":"open_access","relation":"main_file","file_size":795106,"creator":"dernst","file_id":"18772"}],"ddc":["570"],"OA_type":"gold","article_processing_charge":"Yes","language":[{"iso":"eng"}],"department":[{"_id":"BeVi"}],"title":"Evidence for a novel X chromosome in termites","article_type":"original","oa_version":"Published Version","type":"journal_article","DOAJ_listed":"1","project":[{"grant_number":"M02484","name":"Sex Determination in Termites","call_identifier":"FWF","_id":"26641CAC-B435-11E9-9278-68D0E5697425"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","abstract":[{"lang":"eng","text":"Termites, together with cockroaches, belong to the Blattodea. They possess an XX/XY sex determination system which has evolved from an XX/X0 system present in other Blattodean species, such as cockroaches and wood roaches. Little is currently known about the sex chromosomes of termites, their gene content, or their evolution. We here investigate the X chromosome of multiple termite species and compare them with the X chromosome of cockroaches using genomic and transcriptomic data. We find that the X chromosome of the termite Macrotermes natalensis is large and differentiated showing hall marks of sex chromosome evolution such as dosage compensation, while this does not seem to be the case in the other two termite species investigated here where sex chromosomes may be evolutionary younger. Furthermore, the X chromosome in M. natalensis is different from the X chromosome found in the cockroach Blattella germanica indicating that sex chromosome turn-over events may have happened during termite evolution."}],"citation":{"apa":"Fraser, R., Moraa, R., Djolai, A., Meisenheimer, N., Laube, S., Vicoso, B., &#38; Huylmans, A. K. (2024). Evidence for a novel X chromosome in termites. <i>Genome Biology and Evolution</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/gbe/evae265\">https://doi.org/10.1093/gbe/evae265</a>","chicago":"Fraser, Roxanne, Ruth Moraa, Annika Djolai, Nils Meisenheimer, Sophie Laube, Beatriz Vicoso, and Ann K Huylmans. “Evidence for a Novel X Chromosome in Termites.” <i>Genome Biology and Evolution</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/gbe/evae265\">https://doi.org/10.1093/gbe/evae265</a>.","short":"R. Fraser, R. Moraa, A. Djolai, N. Meisenheimer, S. Laube, B. Vicoso, A.K. Huylmans, Genome Biology and Evolution 16 (2024).","ieee":"R. Fraser <i>et al.</i>, “Evidence for a novel X chromosome in termites,” <i>Genome Biology and Evolution</i>, vol. 16, no. 12. Oxford University Press, 2024.","ista":"Fraser R, Moraa R, Djolai A, Meisenheimer N, Laube S, Vicoso B, Huylmans AK. 2024. Evidence for a novel X chromosome in termites. Genome Biology and Evolution. 16(12), evae265.","mla":"Fraser, Roxanne, et al. “Evidence for a Novel X Chromosome in Termites.” <i>Genome Biology and Evolution</i>, vol. 16, no. 12, evae265, Oxford University Press, 2024, doi:<a href=\"https://doi.org/10.1093/gbe/evae265\">10.1093/gbe/evae265</a>.","ama":"Fraser R, Moraa R, Djolai A, et al. Evidence for a novel X chromosome in termites. <i>Genome Biology and Evolution</i>. 2024;16(12). doi:<a href=\"https://doi.org/10.1093/gbe/evae265\">10.1093/gbe/evae265</a>"},"publication":"Genome Biology and Evolution","pmid":1,"publication_identifier":{"eissn":["1759-6653"]},"OA_place":"publisher","external_id":{"isi":["001380841100001"],"pmid":["39658246"]},"date_published":"2024-12-01T00:00:00Z","file_date_updated":"2025-01-08T08:28:07Z","acknowledgement":"urthermore, we thank all lab members and collaborators for feedback on the project. Specifically, Dino McMahon provided R. flavipes males and females, Judith Korb provided C. secundus males and females, gave feedback on the project and discussed questions on termite reproduction, Mireille Vasseur-Cognet provided M. natalensis males and females, Ariana Macon performed the lab work for sequencing and the Vicoso group gave critical feedback on the project. We furthermore thank the HPC group at IST Austria and Christian Meesters at JGU Mainz for their technical support.\r\nThis work was supported by a Österreichischer Wissenschaftsfonds (FWF) grant of the Meitner Programme to A.K.H. (project number M 2484), funding by the Deutsche Forschungsgemeinschaft (DFG) of the Research Training Group GenEvo (project number 407023052) to A.K.H., R.F., and A.D., and funding of the DFG within the Schwerpunktprogramm Gevol to A.K.H. and R.M. (project number 503256468).","tmp":{"image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)"},"publisher":"Oxford University Press","isi":1,"has_accepted_license":"1","volume":16,"year":"2024","day":"01","article_number":"evae265","date_created":"2025-01-05T23:01:58Z","acknowledged_ssus":[{"_id":"ScienComp"}],"oa":1,"author":[{"full_name":"Fraser, Roxanne","last_name":"Fraser","first_name":"Roxanne"},{"full_name":"Moraa, Ruth","last_name":"Moraa","first_name":"Ruth"},{"first_name":"Annika","last_name":"Djolai","full_name":"Djolai, Annika"},{"last_name":"Meisenheimer","first_name":"Nils","full_name":"Meisenheimer, Nils"},{"last_name":"Laube","first_name":"Sophie","full_name":"Laube, Sophie"},{"first_name":"Beatriz","last_name":"Vicoso","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4579-8306","full_name":"Vicoso, Beatriz"},{"last_name":"Huylmans","first_name":"Ann K","orcid":"0000-0001-8871-4961","id":"4C0A3874-F248-11E8-B48F-1D18A9856A87","full_name":"Huylmans, Ann K"}],"quality_controlled":"1","month":"12"},{"arxiv":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","ec_funded":1,"project":[{"call_identifier":"H2020","grant_number":"101020331","name":"Random matrices beyond Wigner-Dyson-Mehta","_id":"62796744-2b32-11ec-9570-940b20777f1d"}],"article_type":"original","type":"journal_article","oa_version":"Published Version","department":[{"_id":"LaEr"}],"title":"Multi-point functional central limit theorem for Wigner matrices","ddc":["510"],"file":[{"date_created":"2025-01-08T08:44:03Z","content_type":"application/pdf","success":1,"checksum":"67178feaa8630a332599d3037a3fe70e","file_name":"2024_ElectrJournProbability_Reker.pdf","date_updated":"2025-01-08T08:44:03Z","access_level":"open_access","file_size":812428,"relation":"main_file","creator":"dernst","file_id":"18773"}],"_id":"18762","article_processing_charge":"Yes","language":[{"iso":"eng"}],"OA_type":"gold","doi":"10.1214/24-EJP1247","scopus_import":"1","intvolume":"        29","date_updated":"2025-09-09T11:59:15Z","status":"public","publication_status":"published","quality_controlled":"1","related_material":{"record":[{"status":"public","id":"17173","relation":"earlier_version"}]},"author":[{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","last_name":"Reker","first_name":"Jana","full_name":"Reker, Jana"}],"month":"12","oa":1,"day":"20","article_number":"191","year":"2024","date_created":"2025-01-05T23:01:58Z","volume":29,"publisher":"Institute of Mathematical Statistics","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","date_published":"2024-12-20T00:00:00Z","file_date_updated":"2025-01-08T08:44:03Z","acknowledgement":"I am very grateful to László Erdős for suggesting the topic and many valuable discussions during my work on the project. I would also like to thank the two anonymous referees for their careful reading of the manuscript and detailed feedback.\r\nPartially supported by ERC Advanced Grants “RMTBeyond” No. 101020331 and “LDRaM” No. 884584.","external_id":{"isi":["001381599200001"],"arxiv":["2307.11028"]},"publication_identifier":{"eissn":["1083-6489"]},"OA_place":"publisher","publication":"Electronic Journal of Probability","abstract":[{"text":"Consider the random variable $\\mathrm{Tr}( f_1(W)A_1\\dots f_k(W)A_k)$ where $W$ is an $N\\times N$ Hermitian Wigner matrix, $k\\in\\mathbb{N}$, and choose (possibly $N$-dependent) regular functions $f_1,\\dots, f_k$ as well as bounded deterministic matrices $A_1,\\dots,A_k$. We give a functional central limit theorem showing that the fluctuations around the expectation are Gaussian. Moreover, we determine the limiting covariance structure and give explicit error bounds in terms of the scaling of $f_1,\\dots,f_k$ and the number of traceless matrices among $A_1,\\dots,A_k$, thus extending the results of [Cipolloni, Erdős, Schröder 2023] to products of arbitrary length $k\\geq2$. As an application, we consider the fluctuation of $\\mathrm{Tr}(\\mathrm{e}^{\\mathrm{i} tW}A_1\\mathrm{e}^{-\\mathrm{i} tW}A_2)$ around its thermal value $\\mathrm{Tr}(A_1)\\mathrm{Tr}(A_2)$ when $t$ is large and give an explicit formula for the variance.","lang":"eng"}],"corr_author":"1","citation":{"ista":"Reker J. 2024. Multi-point functional central limit theorem for Wigner matrices. Electronic Journal of Probability. 29, 191.","ama":"Reker J. Multi-point functional central limit theorem for Wigner matrices. <i>Electronic Journal of Probability</i>. 2024;29. doi:<a href=\"https://doi.org/10.1214/24-EJP1247\">10.1214/24-EJP1247</a>","mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>Electronic Journal of Probability</i>, vol. 29, 191, Institute of Mathematical Statistics, 2024, doi:<a href=\"https://doi.org/10.1214/24-EJP1247\">10.1214/24-EJP1247</a>.","chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics, 2024. <a href=\"https://doi.org/10.1214/24-EJP1247\">https://doi.org/10.1214/24-EJP1247</a>.","short":"J. Reker, Electronic Journal of Probability 29 (2024).","apa":"Reker, J. (2024). Multi-point functional central limit theorem for Wigner matrices. <i>Electronic Journal of Probability</i>. Institute of Mathematical Statistics. <a href=\"https://doi.org/10.1214/24-EJP1247\">https://doi.org/10.1214/24-EJP1247</a>","ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner matrices,” <i>Electronic Journal of Probability</i>, vol. 29. Institute of Mathematical Statistics, 2024."}},{"oa_version":"Published Version","type":"dissertation","keyword":["cryo-EM","cryo-ET","cryo-SPA","Structural Virology","Poxvirus","Vaccinia Virus","Structural Biology"],"title":"Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM","supervisor":[{"full_name":"Schur, Florian KM","last_name":"Schur","first_name":"Florian KM","id":"48AD8942-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4790-8078"}],"department":[{"_id":"GradSch"},{"_id":"FlSc"}],"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","page":"106","project":[{"_id":"26736D6A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P31445","name":"Structural conservation and diversity in retroviral capsid"}],"doi":"10.15479/at:ista:18766","publication_status":"published","status":"public","date_updated":"2026-04-07T12:59:44Z","language":[{"iso":"eng"}],"article_processing_charge":"No","_id":"18766","file":[{"file_id":"18769","creator":"jstanger","file_size":38814932,"relation":"source_file","access_level":"closed","date_updated":"2025-01-07T12:15:11Z","file_name":"PhD_thesis_Julia_Datler.docx","checksum":"3e51cab327c754045c3d29c1a50cc9a9","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2025-01-07T12:15:11Z"},{"checksum":"22fabe5b97950bf852212f6edb555173","file_name":"PhD_thesis_Julia_Datler.pdf","date_updated":"2025-01-07T12:15:14Z","access_level":"open_access","date_created":"2025-01-07T12:15:14Z","content_type":"application/pdf","success":1,"creator":"jstanger","file_id":"18770","file_size":12044865,"relation":"main_file"}],"ddc":["570"],"degree_awarded":"PhD","date_created":"2025-01-07T10:23:12Z","acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"ScienComp"}],"alternative_title":["ISTA thesis"],"year":"2024","day":"30","month":"12","author":[{"full_name":"Datler, Julia","first_name":"Julia","last_name":"Datler","orcid":"0000-0002-3616-8580","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"part_of_dissertation","id":"12334","status":"public"},{"relation":"part_of_dissertation","status":"public","id":"14979"}]},"oa":1,"citation":{"short":"J. Datler, Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM, Institute of Science and Technology Austria, 2024.","chicago":"Datler, Julia. “Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>.","apa":"Datler, J. (2024). <i>Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18766\">https://doi.org/10.15479/at:ista:18766</a>","ieee":"J. Datler, “Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM,” Institute of Science and Technology Austria, 2024.","ista":"Datler J. 2024. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. Institute of Science and Technology Austria.","ama":"Datler J. Elucidating the structural determinants of the poxvirus core using multi-modal cryo-EM. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>","mla":"Datler, Julia. <i>Elucidating the Structural Determinants of the Poxvirus Core Using Multi-Modal Cryo-EM</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18766\">10.15479/at:ista:18766</a>."},"corr_author":"1","abstract":[{"lang":"eng","text":"Poxviruses are large pleomorphic double-stranded DNA viruses that include well known members such as variola virus, the causative agent of smallpox, Mpox virus, as well as Vaccinia virus (VACV), which serves as a vaccination strain for formerly mentioned viruses. VACV is a valuable model for studying large pleomorphic DNA viruses in general and poxviruses specifically, as many features, such as core morphology and structural proteins, are well conserved within this family. Despite decades of research, our understanding of the structural components and proteins that comprise the poxvirus core in mature virions remains limited. Although major core proteins were identified via indirect experimental evidence, the core's complexity, with its large size, structure and number of involved proteins, has hindered efforts to achieve high-resolution insights and to define the roles of the individual proteins. The specific protein composition of the core's individual layers, including the palisade layer and the inner core wall, has remained unclear. In this study, we have merged multiple approaches, including single particle cryo electron microscopy of purified virus cores, cryo-electron tomography and subtomogram averaging of mature virions and molecular modeling to elucidate the structural determinants of the VACV core. Due to the lack of experimentally derived structures, either in situ or reconstituted in vitro, we used Alphafold to predict models of the putative major core protein candidates, A10, 23k, A3, A4, and L4. Our results show that the VACV core is composed of several layers with varying local symmetries, forming more intricate interactions than observed previously. This allowed us to identify several molecular building blocks forming the viral core lattice. In particular, we identified trimers of protein A10 as a major core structure that forms the palisade layer of the viral core. Additionally, we revealed that six petals of a flower shaped core pore within the core wall are composed of A10 trimers. Furthermore, we obtained a cryo-EM density for the inner core wall that could potentially accommodate an A3 dimer. Integrating descriptions of protein interactions from previous studies enabled us to provide a detailed structural model of the poxvirus core wall, and our findings indicate that the interactions within A10 trimers are likely consistent across orthopox- and parapoxviruses. This combined application of cryo-SPA and cryo-ET can help overcome obstacles in studying complex virus structures in the future, including their key assembly proteins, interactions, and the formation into a core lattice. Our work provides important fundamental new insights into poxvirus core architecture, also considering the recent re-emergence of poxviruses."}],"has_accepted_license":"1","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"publisher":"Institute of Science and Technology Austria","OA_place":"publisher","publication_identifier":{"isbn":["978-3-99078-049-7"],"issn":["2663-337X"]},"date_published":"2024-12-30T00:00:00Z","file_date_updated":"2025-01-07T12:15:14Z","acknowledgement":"This work was funded by the Austrian Science Fund (FWF) grant P31445 and ISTA. I\r\nwould like to express my gratitude to the Scientific Service Units, particularly the Lab\r\nSupport Facility, the Scientific Computing Facility and the Electron Microscopy Facility\r\nfor their tremendous support. I want to especially thank Alois for assisting me with the\r\ninstallation of countless new software and for troubleshooting cluster issues. A special\r\nthanks goes to Valentin for his outstanding support in cryo-EM data acquisition and\r\nhis ongoing help in improving the process to ensure that I obtained the best possible\r\ndata from my sample."},{"article_type":"original","type":"journal_article","oa_version":"Published Version","department":[{"_id":"GaNo"}],"title":"A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","DOAJ_listed":"1","doi":"10.7554/elife.89361","scopus_import":"1","intvolume":"        12","date_updated":"2025-01-08T13:37:04Z","status":"public","publication_status":"published","ddc":["570"],"_id":"18779","file":[{"content_type":"application/pdf","date_created":"2025-01-08T13:33:05Z","success":1,"file_name":"2024_eLife_David.pdf","checksum":"1d64265f62a3bf14550b4f5c684f1782","access_level":"open_access","date_updated":"2025-01-08T13:33:05Z","relation":"main_file","file_size":9992462,"creator":"dernst","file_id":"18780"}],"OA_type":"gold","article_processing_charge":"Yes","language":[{"iso":"eng"}],"article_number":"89361","day":"10","year":"2024","date_created":"2025-01-08T13:25:45Z","volume":12,"quality_controlled":"1","author":[{"first_name":"Csaba","last_name":"Dávid","full_name":"Dávid, Csaba"},{"last_name":"Giber","first_name":"Kristóf","full_name":"Giber, Kristóf"},{"first_name":"Margit Katalin","last_name":"Szigeti","id":"44F4BDC0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9500-8758","full_name":"Szigeti, Margit Katalin"},{"last_name":"Köllő","first_name":"Mihály","full_name":"Köllő, Mihály"},{"last_name":"Nusser","first_name":"Zoltan","full_name":"Nusser, Zoltan"},{"full_name":"Acsady, Laszlo","first_name":"Laszlo","last_name":"Acsady"}],"month":"12","oa":1,"publication":"eLife","abstract":[{"lang":"eng","text":"Unsupervised segmentation in biological and non-biological images is only partially resolved. Segmentation either requires arbitrary thresholds or large teaching datasets. Here, we propose a spatial autocorrelation method based on Local Moran’s <jats:italic>I</jats:italic> coefficient to differentiate signal, background, and noise in any type of image. The method, originally described for geoinformatics, does not require a predefined intensity threshold or teaching algorithm for image segmentation and allows quantitative comparison of samples obtained in different conditions. It utilizes relative intensity as well as spatial information of neighboring elements to select spatially contiguous groups of pixels. We demonstrate that Moran’s method outperforms threshold-based method in both artificially generated as well as in natural images especially when background noise is substantial. This superior performance can be attributed to the exclusion of false positive pixels resulting from isolated, high intensity pixels in high noise conditions. To test the method’s power in real situation, we used high power confocal images of the somatosensory thalamus immunostained for Kv4.2 and Kv4.3 (A-type) voltage-gated potassium channels in mice. Moran’s method identified high-intensity Kv4.2 and Kv4.3 ion channel clusters in the thalamic neuropil. Spatial distribution of these clusters displayed strong correlation with large sensory axon terminals of subcortical origin. The unique association of the special presynaptic terminals and a postsynaptic voltage-gated ion channel cluster was confirmed with electron microscopy. These data demonstrate that Moran’s method is a rapid, simple image segmentation method optimal for variable and high noise conditions."}],"citation":{"ieee":"C. Dávid, K. Giber, M. K. Szigeti, M. Köllő, Z. Nusser, and L. Acsady, “A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus,” <i>eLife</i>, vol. 12. eLife Sciences Publications, 2024.","apa":"Dávid, C., Giber, K., Szigeti, M. K., Köllő, M., Nusser, Z., &#38; Acsady, L. (2024). A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. <i>ELife</i>. eLife Sciences Publications. <a href=\"https://doi.org/10.7554/elife.89361\">https://doi.org/10.7554/elife.89361</a>","short":"C. Dávid, K. Giber, M.K. Szigeti, M. Köllő, Z. Nusser, L. Acsady, ELife 12 (2024).","chicago":"Dávid, Csaba, Kristóf Giber, Margit Katalin Szigeti, Mihály Köllő, Zoltan Nusser, and Laszlo Acsady. “A Novel Image Segmentation Method Based on Spatial Autocorrelation Identifies A-Type Potassium Channel Clusters in the Thalamus.” <i>ELife</i>. eLife Sciences Publications, 2024. <a href=\"https://doi.org/10.7554/elife.89361\">https://doi.org/10.7554/elife.89361</a>.","mla":"Dávid, Csaba, et al. “A Novel Image Segmentation Method Based on Spatial Autocorrelation Identifies A-Type Potassium Channel Clusters in the Thalamus.” <i>ELife</i>, vol. 12, 89361, eLife Sciences Publications, 2024, doi:<a href=\"https://doi.org/10.7554/elife.89361\">10.7554/elife.89361</a>.","ama":"Dávid C, Giber K, Szigeti MK, Köllő M, Nusser Z, Acsady L. A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. <i>eLife</i>. 2024;12. doi:<a href=\"https://doi.org/10.7554/elife.89361\">10.7554/elife.89361</a>","ista":"Dávid C, Giber K, Szigeti MK, Köllő M, Nusser Z, Acsady L. 2024. A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus. eLife. 12, 89361."},"publisher":"eLife Sciences Publications","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","date_published":"2024-12-10T00:00:00Z","file_date_updated":"2025-01-08T13:33:05Z","acknowledgement":"This research was supported by the Wellcome Trust (ZN, LA). In addition, LA was supported by an ERC Advanced Grant (FRONTHAL, 742595) and the European Union project RRF-2.3.1-\r\n21-2022-00004 within the framework of the Artificial Intelligence National Laboratory and Lendület_2023_90. ZN is the recipient of a Hungarian Academy of Sciences Momentum Grant (Lendület, LP2012-29) and an ERC Advanced Grant (293681). We thank the Light Microscopy Center at Institute of Experimental Medicine for kindly providing microscopy support. Authors would like to express their deepest gratitude to Prof Luc Anselin (Center for Spatial Data Science, University of Chicago) and Dr Szabolcs Káli (Instiute of Experimental Medicine, Budapest) for the valuable discussion about analysis of spatial association, and to Krisztina Faddi for the excellent technical assistance. ","publication_identifier":{"issn":["2050-084X"]},"OA_place":"publisher"},{"language":[{"iso":"eng"}],"OA_type":"gold","article_processing_charge":"No","file":[{"checksum":"beedf05388bbdb7ddda81ec3d5ec7026","file_name":"2024_ICML_Cadei.pdf","date_updated":"2025-01-27T11:42:24Z","access_level":"open_access","date_created":"2025-01-27T11:42:24Z","content_type":"application/pdf","success":1,"file_id":"18896","creator":"dernst","file_size":4453014,"relation":"main_file"}],"_id":"18847","ddc":["000","570"],"intvolume":"        38","scopus_import":"1","publication_status":"published","status":"public","date_updated":"2025-07-10T11:51:50Z","conference":{"end_date":"2024-07-26","name":"ICML: International Conference on Machine Learning","start_date":"2024-07-26"},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"oa_version":"Published Version","type":"conference","title":"Smoke and mirrors in causal downstream tasks","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publisher":"Curran Associates","OA_place":"publisher","external_id":{"arxiv":["2405.17151"]},"file_date_updated":"2025-01-27T11:42:24Z","date_published":"2024-09-25T00:00:00Z","acknowledgement":"We thank Piersilvio De Bartolomeis, and the full Causal Learning and Artificial Intelligence (CLAI) group at ISTA for the extremely helpful discussions. Riccardo Cadei was supported by a Google Research Scholar Award and a Google Initiated Gift to Francesco Locatello. We thank the Social Immunity team at ISTA particularly Michaela Hönigsberger and Wilfrid Jean Louis, for supporting the ecological experiment and Farnaz Beikzadeh Abbasi, Luisa Fiebig and Martin Estermann for annotating ant behavior in ISTAnt.","publication":"ICML 2024 Workshop AI4Science","citation":{"ama":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. Smoke and mirrors in causal downstream tasks. In: <i>ICML 2024 Workshop AI4Science</i>. Vol 38. Curran Associates; 2024.","mla":"Cadei, Riccardo, et al. “Smoke and Mirrors in Causal Downstream Tasks.” <i>ICML 2024 Workshop AI4Science</i>, vol. 38, Curran Associates, 2024.","ista":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. 2024. Smoke and mirrors in causal downstream tasks. ICML 2024 Workshop AI4Science. ICML: International Conference on Machine Learning vol. 38.","ieee":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, and F. Locatello, “Smoke and mirrors in causal downstream tasks,” in <i>ICML 2024 Workshop AI4Science</i>, 2024, vol. 38.","chicago":"Cadei, Riccardo, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Smoke and Mirrors in Causal Downstream Tasks.” In <i>ICML 2024 Workshop AI4Science</i>, Vol. 38. Curran Associates, 2024.","short":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, ICML 2024 Workshop AI4Science, Curran Associates, 2024.","apa":"Cadei, R., Lindorfer, L., Cremer, S., Schmid, C., &#38; Locatello, F. (2024). Smoke and mirrors in causal downstream tasks. In <i>ICML 2024 Workshop AI4Science</i> (Vol. 38). Curran Associates."},"corr_author":"1","abstract":[{"lang":"eng","text":"Machine Learning and AI have the potential to transform data-driven\r\nscientific discovery, enabling accurate predictions for several scientific\r\nphenomena. As many scientific questions are inherently causal, this paper looks\r\nat the causal inference task of treatment effect estimation, where the outcome\r\nof interest is recorded in high-dimensional observations in a Randomized\r\nControlled Trial (RCT). Despite being the simplest possible causal setting and\r\na perfect fit for deep learning, we theoretically find that many common choices\r\nin the literature may lead to biased estimates. To test the practical impact of\r\nthese considerations, we recorded ISTAnt, the first real-world benchmark for\r\ncausal inference downstream tasks on high-dimensional observations as an RCT\r\nstudying how garden ants (Lasius neglectus) respond to microparticles applied\r\nonto their colony members by hygienic grooming. Comparing 6 480 models\r\nfine-tuned from state-of-the-art visual backbones, we find that the sampling\r\nand modeling choices significantly affect the accuracy of the causal estimate,\r\nand that classification accuracy is not a proxy thereof. We further validated\r\nthe analysis, repeating it on a synthetically generated visual data set\r\ncontrolling the causal model. Our results suggest that future benchmarks should\r\ncarefully consider real downstream scientific questions, especially causal\r\nones. Further, we highlight guidelines for representation learning methods to\r\nhelp answer causal questions in the sciences."}],"month":"09","related_material":{"record":[{"relation":"research_data","status":"public","id":"18895"},{"status":"for_moderation","id":"19509","relation":"is_continued_by"}],"link":[{"url":"https://github.com/CausalLearningAI/ISTAnt","relation":"software"}]},"author":[{"id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","last_name":"Cadei","first_name":"Riccardo","full_name":"Cadei, Riccardo"},{"full_name":"Lindorfer, Lukas","first_name":"Lukas","last_name":"Lindorfer","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455"},{"full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer","first_name":"Sylvia"},{"full_name":"Schmid, Cordelia","first_name":"Cordelia","last_name":"Schmid"},{"orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco"}],"quality_controlled":"1","oa":1,"date_created":"2025-01-14T07:27:26Z","year":"2024","day":"25","volume":38},{"date_created":"2025-01-19T23:01:53Z","year":"2024","day":"26","oa":1,"month":"12","related_material":{"link":[{"url":"https://github.com/K4TEL/geo-twitter.git","relation":"software"}]},"author":[{"first_name":"Kateryna","last_name":"Lutsai","full_name":"Lutsai, Kateryna"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","first_name":"Christoph","last_name":"Lampert"}],"quality_controlled":"1","citation":{"ista":"Lutsai K, Lampert C. 2024. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. (29), 69–99.","ama":"Lutsai K, Lampert C. Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. 2024;(29):69-99. doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>","mla":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>, no. 29, University of Maine, 2024, pp. 69–99, doi:<a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">10.5311/JOSIS.2024.29.295</a>.","chicago":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” <i>Journal of Spatial Information Science</i>. University of Maine, 2024. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>.","short":"K. Lutsai, C. Lampert, Journal of Spatial Information Science (2024) 69–99.","apa":"Lutsai, K., &#38; Lampert, C. (2024). Predicting the geolocation of tweets using transformer models on customized data. <i>Journal of Spatial Information Science</i>. University of Maine. <a href=\"https://doi.org/10.5311/JOSIS.2024.29.295\">https://doi.org/10.5311/JOSIS.2024.29.295</a>","ieee":"K. Lutsai and C. Lampert, “Predicting the geolocation of tweets using transformer models on customized data,” <i>Journal of Spatial Information Science</i>, no. 29. University of Maine, pp. 69–99, 2024."},"corr_author":"1","abstract":[{"lang":"eng","text":"This research is aimed to solve the tweet/user geolocation prediction task and provide a flexible methodology for the geo-tagging of textual big data. The suggested approach implements neural networks for natural language processing (NLP) to estimate the location as coordinate pairs (longitude, latitude) and two-dimensional Gaussian Mixture Models (GMMs). The scope of proposed models has been finetuned on a Twitter dataset using pretrained Bidirectional Encoder Representations from Transformers (BERT) as base models. Performance metrics show a median error of fewer than 30 km on a worldwide-level, and fewer than 15 km on the US-level datasets for the models trained and evaluated on text features of tweets' content and metadata context. Our source code and data are available at https://github.com/K4TEL/geo-twitter.git."}],"publication":"Journal of Spatial Information Science","OA_place":"publisher","publication_identifier":{"eissn":["1948-660X"]},"acknowledgement":"The authors acknowledge the Institute of Science and Technology (ISTA) for their material support and for granting access to the Twitter database archive, which was essential for the research.","date_published":"2024-12-26T00:00:00Z","file_date_updated":"2025-01-20T08:41:10Z","has_accepted_license":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (3.0)","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode"},"publisher":"University of Maine","title":"Predicting the geolocation of tweets using transformer models on customized data","department":[{"_id":"ChLa"}],"oa_version":"Published Version","type":"journal_article","article_type":"original","DOAJ_listed":"1","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","page":"69-99","issue":"29","publication_status":"published","status":"public","date_updated":"2025-06-05T13:47:12Z","scopus_import":"1","doi":"10.5311/JOSIS.2024.29.295","OA_type":"gold","article_processing_charge":"Yes","language":[{"iso":"eng"}],"file":[{"file_size":7250655,"relation":"main_file","creator":"dernst","file_id":"18857","success":1,"content_type":"application/pdf","date_created":"2025-01-20T08:41:10Z","access_level":"open_access","date_updated":"2025-01-20T08:41:10Z","file_name":"2024_JourSpatialInfoScience_Lutsai.pdf","checksum":"b82413f00398ffb5168e8e747571a98d"}],"_id":"18856","ddc":["500"]},{"oa":1,"month":"12","author":[{"id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin","first_name":"Nikita","full_name":"Kalinin, Nikita"},{"full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"quality_controlled":"1","volume":37,"date_created":"2025-01-24T17:58:16Z","alternative_title":["Advances in Neural Information Processing Systems"],"year":"2024","day":"01","OA_place":"publisher","publication_identifier":{"eissn":["1049-5258"]},"external_id":{"arxiv":["2405.13763"]},"file_date_updated":"2025-01-27T09:52:15Z","date_published":"2024-12-01T00:00:00Z","has_accepted_license":"1","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publisher":"Neural Information Processing Systems Foundation","citation":{"mla":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","ama":"Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","ista":"Kalinin N, Lampert C. 2024. Banded square root matrix factorization for differentially private model training. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37.","ieee":"N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","apa":"Kalinin, N., &#38; Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","chicago":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","short":"N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024."},"corr_author":"1","abstract":[{"text":"Current state-of-the-art methods for differentially private model training are based on matrix factorization techniques. However, these methods suffer from high computational overhead because they require numerically solving a demanding optimization problem to determine an approximately optimal factorization prior to the actual model training. In this work, we present a new matrix factorization approach, BSR, which overcomes this computational bottleneck. By exploiting properties of the standard matrix square root, BSR allows to efficiently handle also large-scale problems. For the key scenario of stochastic gradient descent with momentum and weight decay, we even derive analytical expressions for BSR that render the computational overhead negligible. We prove bounds on the approximation quality that hold both in the centralized and in the federated learning setting. Our numerical experiments demonstrate that models trained using BSR perform on par with the best existing methods, while completely avoiding their computational overhead.","lang":"eng"}],"publication":"38th Annual Conference on Neural Information Processing Systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"title":"Banded square root matrix factorization for differentially private model training","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"oa_version":"Published Version","type":"conference","article_processing_charge":"No","language":[{"iso":"eng"}],"OA_type":"gold","file":[{"date_updated":"2025-01-27T09:52:15Z","access_level":"open_access","checksum":"a216cab8eddc1fe7840aede0e2c0d41e","file_name":"2024_NeurIPS_Nikita.pdf","success":1,"date_created":"2025-01-27T09:52:15Z","content_type":"application/pdf","creator":"dernst","file_id":"18888","relation":"main_file","file_size":1144656}],"_id":"18875","ddc":["000"],"publication_status":"published","status":"public","date_updated":"2025-05-14T11:34:20Z","conference":{"end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2024-12-16"},"intvolume":"        37","scopus_import":"1"},{"type":"conference","oa_version":"Preprint","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"title":"Average gradient outer product as a mechanism for deep neural collapse","arxiv":1,"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"scopus_import":"1","intvolume":"        37","conference":{"start_date":"2024-12-16","location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","end_date":"2024-12-16"},"date_updated":"2025-05-14T11:29:45Z","status":"public","publication_status":"published","_id":"18890","language":[{"iso":"eng"}],"article_processing_charge":"No","OA_type":"green","day":"01","year":"2024","alternative_title":["Advances in Neural Information Processing Systems"],"date_created":"2025-01-27T11:11:40Z","volume":37,"quality_controlled":"1","author":[{"full_name":"Beaglehole, Daniel","last_name":"Beaglehole","first_name":"Daniel"},{"first_name":"Peter","last_name":"Súkeník","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","full_name":"Súkeník, Peter"},{"full_name":"Mondelli, Marco","last_name":"Mondelli","first_name":"Marco","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"},{"full_name":"Belkin, Mikhail","first_name":"Mikhail","last_name":"Belkin"}],"month":"12","oa":1,"main_file_link":[{"url":"https://openreview.net/forum?id=lJ1jdl2K9k","open_access":"1"}],"publication":"38th Annual Conference on Neural Information Processing Systems","abstract":[{"lang":"eng","text":"Deep Neural Collapse (DNC) refers to the surprisingly rigid structure of the data representations in the final layers of Deep Neural Networks (DNNs). Though the phenomenon has been measured in a variety of settings, its emergence is typically explained via data-agnostic approaches, such as the unconstrained features model. In this work, we introduce a data-dependent setting where DNC forms due to feature learning through the average gradient outer product (AGOP). The AGOP is defined with respect to a learned predictor and is equal to the uncentered covariance matrix of its input-output gradients averaged over the training dataset. The Deep Recursive Feature Machine (Deep RFM) is a method that constructs a neural network by iteratively mapping the data with the AGOP and applying an untrained random feature map. We demonstrate empirically that DNC occurs in Deep RFM across standard settings as a consequence of the projection with the AGOP matrix computed at each layer. Further, we theoretically explain DNC in Deep RFM in an asymptotic setting and as a result of kernel learning. We then provide evidence that this mechanism holds for neural networks more generally. In particular, we show that the right singular vectors and values of the weights can be responsible for the majority of within-class variability collapse for DNNs trained in the feature learning regime. As observed in recent work, this singular structure is highly correlated with that of the AGOP."}],"corr_author":"1","citation":{"ieee":"D. Beaglehole, P. Súkeník, M. Mondelli, and M. Belkin, “Average gradient outer product as a mechanism for deep neural collapse,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","apa":"Beaglehole, D., Súkeník, P., Mondelli, M., &#38; Belkin, M. (2024). Average gradient outer product as a mechanism for deep neural collapse. In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","short":"D. Beaglehole, P. Súkeník, M. Mondelli, M. Belkin, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","chicago":"Beaglehole, Daniel, Peter Súkeník, Marco Mondelli, and Mikhail Belkin. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","mla":"Beaglehole, Daniel, et al. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","ama":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. Average gradient outer product as a mechanism for deep neural collapse. In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","ista":"Beaglehole D, Súkeník P, Mondelli M, Belkin M. 2024. Average gradient outer product as a mechanism for deep neural collapse. 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37."},"publisher":"Neural Information Processing Systems Foundation","external_id":{"arxiv":["2402.13728"]},"date_published":"2024-12-01T00:00:00Z","acknowledgement":"We acknowledge support from the National Science Foundation (NSF) and the Simons Foundation for the Collaboration on the Theoretical Foundations of Deep Learning through awards DMS-2031883 and #814639 as well as the TILOS institute (NSF CCF-2112665). This work used the programs (1) XSEDE (Extreme science and engineering discovery environment) which is supported by NSF grant numbers ACI-1548562, and (2) ACCESS (Advanced cyberinfrastructure coordination ecosystem: services & support) which is supported by NSF grants numbers #2138259, #2138286, #2138307, #2137603, and #2138296. Specifically, we used the resources from SDSC Expanse GPU compute nodes, and NCSA Delta system, via allocations TG-CIS220009. Marco Mondelli is supported by the 2019 Lopez-Loreta prize. We also acknowledge useful feedback from anonymous reviewers. ","OA_place":"repository","publication_identifier":{"eissn":["1049-5258"]}},{"date_updated":"2025-06-04T07:19:21Z","conference":{"start_date":"2024-12-16","location":"Vancouver, Canada","end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems"},"publication_status":"published","status":"public","intvolume":"        37","file":[{"success":1,"content_type":"application/pdf","date_created":"2025-02-04T08:11:25Z","access_level":"open_access","date_updated":"2025-02-04T08:11:25Z","file_name":"2024_NeurIPS_Sukenik.pdf","checksum":"b7b79f1ea3ac1e9e11b3d91faaeb0780","file_size":1784118,"relation":"main_file","creator":"dernst","file_id":"18989"}],"_id":"18891","ddc":["000"],"OA_type":"gold","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"GradSch"},{"_id":"MaMo"},{"_id":"ChLa"}],"title":"Neural collapse versus low-rank bias: Is deep neural collapse really optimal?","oa_version":"Published Version","type":"conference","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"corr_author":"1","abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) exhibit a surprising structure in their final layer\r\nknown as neural collapse (NC), and a growing body of works has currently investigated the propagation of neural collapse to earlier layers of DNNs – a phenomenon\r\ncalled deep neural collapse (DNC). However, existing theoretical results are restricted to special cases: linear models, only two layers or binary classification.\r\nIn contrast, we focus on non-linear models of arbitrary depth in multi-class classification and reveal a surprising qualitative shift. As soon as we go beyond two\r\nlayers or two classes, DNC stops being optimal for the deep unconstrained features\r\nmodel (DUFM) – the standard theoretical framework for the analysis of collapse.\r\nThe main culprit is a low-rank bias of multi-layer regularization schemes: this bias\r\nleads to optimal solutions of even lower rank than the neural collapse. We support\r\nour theoretical findings with experiments on both DUFM and real data, which show\r\nthe emergence of the low-rank structure in the solution found by gradient descent."}],"citation":{"ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in <i>38th Annual Conference on Neural Information Processing Systems</i>, Vancouver, Canada, 2024, vol. 37.","short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In <i>38th Annual Conference on Neural Information Processing Systems</i>, Vol. 37. Neural Information Processing Systems Foundation, 2024.","apa":"Súkeník, P., Lampert, C., &#38; Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In <i>38th Annual Conference on Neural Information Processing Systems</i> (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: <i>38th Annual Conference on Neural Information Processing Systems</i>. Vol 37. Neural Information Processing Systems Foundation; 2024.","mla":"Súkeník, Peter, et al. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” <i>38th Annual Conference on Neural Information Processing Systems</i>, vol. 37, Neural Information Processing Systems Foundation, 2024.","ista":"Súkeník P, Lampert C, Mondelli M. 2024. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? 38th Annual Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems, Advances in Neural Information Processing Systems, vol. 37."},"publication":"38th Annual Conference on Neural Information Processing Systems","OA_place":"publisher","date_published":"2024-12-01T00:00:00Z","external_id":{"arxiv":["2405.14468"]},"acknowledgement":"Marco Mondelli is partially supported by the 2019 Lopez-Loreta prize. This research was supported by the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp).","file_date_updated":"2025-02-04T08:11:25Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"publisher":"Neural Information Processing Systems Foundation","has_accepted_license":"1","volume":37,"year":"2024","day":"01","date_created":"2025-01-27T11:15:18Z","acknowledged_ssus":[{"_id":"ScienComp"}],"alternative_title":["Advances in Neural Information Processing Systems"],"oa":1,"author":[{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter","last_name":"Súkeník","full_name":"Súkeník, Peter"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"},{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425"}],"quality_controlled":"1","month":"12"},{"day":"23","year":"2024","type":"research_data_reference","date_created":"2025-01-27T11:45:43Z","oa_version":"Published Version","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"title":"ISTAnt","related_material":{"record":[{"status":"public","id":"18847","relation":"used_in_publication"}]},"author":[{"full_name":"Cadei, Riccardo","first_name":"Riccardo","last_name":"Cadei","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b"},{"full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Cremer","first_name":"Sylvia M","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M"},{"last_name":"Lindorfer","first_name":"Lukas","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","full_name":"Lindorfer, Lukas"},{"full_name":"Schmid, Cordelia","last_name":"Schmid","first_name":"Cordelia"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","oa":1,"main_file_link":[{"url":"https://10.6084/M9.FIGSHARE.26484934.V2","open_access":"1"}],"doi":"10.6084/M9.FIGSHARE.26484934.V2","abstract":[{"text":"ISTAnt is a new ecological dataset for social immunity and represents the first real-world benchmark for causal inference downstream tasks on high-dimensional observations. It analyzes grooming behavior in the ant Lasius neglectus in groups of three worker ants. The workers for the experiment were obtained from their laboratory stock colony, which had been collected from the field in 2022 in the Botanical Garden Jena, Germany. Ant collection and all experimental work were performed in compliance with international, national and institutional regulations and ethical guidelines. For the experiment, the body surface of one of the three ants was treated with a suspension of either of two microparticle types (diameter ~5 µm) to induce grooming by the two nestmates, which were individually color-coded by application of a dot of blue or orange paint, respectively. The three ants were housed in small plastic containers (diameter 28mm, height 30mm) with moistened, plastered ground and the interior walls covered with PTFE (polytetrafluoroethane) to hamper climbing by the ants. Filming occurred in a temperature- and humidity-controlled room at 23°C within a custom-made filming box with controlled lighting and ventilation conditions. We set up nine ant groups at a time (always containing both treatments) and placed them randomly on positions 1-9 marked on the floor in a 3x3 grid, about 3mm from each other. The experiment was performed on two consecutive days. Videos were acquired using a USB camera (FLIR blackfly S BFS-U3-120S4C, Teledyne FLIR) with a high-performance lens (HP Series 25mm Focal Length, Edmund optics 86-572) in OBS studio 29.0.0 \\citep{bailey2017obs} at a framerate of 30 FPS and a resolution of 2500x2500 pixels. From each original video (105x105 mm), we generated nine individual videos .mkv (each ~32x32 mm, 770x770 pixels) by determining exact coordinates per container from one frame in GIMP 2.10.36 and cropping of the videos with FFmpeg 6.1.1. Annotation was performed over two consecutive days by three observers who had not been involved in the experimental setup or recording and were unaware of the treatment assignments to ensure bias-free behavioral annotation. They annotated the behavior of the ants during video observations, using custom-made software that saves the start and end frames of behaviors marked in a .csv file (see 'annotations' folder). In one of the videos, one of the nestmates' legs got inadvertently stuck to its body surface during the color-coding, interfering with its behavior, so the video was discarded. This left 44 videos from 5 independent setups (n=24 of treatment 1 and n=20 of treatment 2) of 10 minutes each for a total of 792 000 annotated frames (see 'video' folder). For each video, we provide the following information: the number of the set to which it belongs (1-5); the number of the position within the set reflecting the position of the ant group under the camera (1-9), for which we also provide ‘coordinates’ in the 3x3 grid (taking values -1/0/1 for both X and Y axis); treatment (1 or 2); the hour of the day when the recording was started (in 24h CEST); experimental day (A or B); the top left coordinate of the cropping square from the original video (CropX/CropY); the person annotating the video (given as A, B, C); the date of annotation (1: first day, 2: second day) and in which order the videos were annotated by each person, both reflecting a possible training effect of the person (see 'experiments_settings.csv' file).","lang":"eng"}],"date_updated":"2025-01-27T11:58:38Z","corr_author":"1","status":"public","citation":{"mla":"Cadei, Riccardo, et al. <i>ISTAnt</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>.","ama":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. ISTAnt. 2024. doi:<a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>","ista":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. 2024. ISTAnt, Institute of Science and Technology Austria, <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">10.6084/M9.FIGSHARE.26484934.V2</a>.","ieee":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, and C. Schmid, “ISTAnt.” Institute of Science and Technology Austria, 2024.","apa":"Cadei, R., Locatello, F., Cremer, S., Lindorfer, L., &#38; Schmid, C. (2024). ISTAnt. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>","short":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, C. Schmid, (2024).","chicago":"Cadei, Riccardo, Francesco Locatello, Sylvia Cremer, Lukas Lindorfer, and Cordelia Schmid. “ISTAnt.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2\">https://doi.org/10.6084/M9.FIGSHARE.26484934.V2</a>."},"ddc":["570"],"publisher":"Institute of Science and Technology Austria","_id":"18895","OA_type":"gold","article_processing_charge":"No","date_published":"2024-10-23T00:00:00Z","OA_place":"repository"},{"department":[{"_id":"JaMa"},{"_id":"MaMo"}],"title":"Improved convergence of score-based diffusion models via prediction-correction","oa_version":"Published Version","type":"conference","project":[{"name":"Taming Complexity in Partial Differential Systems","grant_number":"F6504","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"},{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","arxiv":1,"date_updated":"2025-04-15T08:31:35Z","publication_status":"published","status":"public","scopus_import":"1","file":[{"checksum":"76a1fd5afd8ee6f7ae0e5912d7dbf6b4","file_name":"2024_TMLR_Pedrotti.pdf","date_updated":"2025-01-27T12:19:44Z","access_level":"open_access","date_created":"2025-01-27T12:19:44Z","content_type":"application/pdf","success":1,"creator":"dernst","file_id":"18898","file_size":780315,"relation":"main_file"}],"_id":"18897","ddc":["000"],"article_processing_charge":"No","OA_type":"gold","language":[{"iso":"eng"}],"year":"2024","day":"01","date_created":"2025-01-27T12:18:05Z","alternative_title":["TMLR"],"oa":1,"related_material":{"record":[{"id":"17350","status":"public","relation":"earlier_version"}]},"author":[{"full_name":"Pedrotti, Francesco","id":"d3ac8ac6-dc8d-11ea-abe3-e2a9628c4c3c","last_name":"Pedrotti","first_name":"Francesco"},{"full_name":"Maas, Jan","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0845-1338","first_name":"Jan","last_name":"Maas"},{"orcid":"0000-0002-3242-7020","id":"27EB676C-8706-11E9-9510-7717E6697425","last_name":"Mondelli","first_name":"Marco","full_name":"Mondelli, Marco"}],"quality_controlled":"1","month":"06","corr_author":"1","abstract":[{"lang":"eng","text":"Score-based generative models (SGMs) are powerful tools to sample from complex data distributions. Their underlying idea is to (i) run a forward process for time T1 by adding noise to the data, (ii) estimate its score function, and (iii) use such estimate to run a reverse process. As the reverse process is initialized with the stationary distribution of the forward one, the existing analysis paradigm requires T1→∞. This is however problematic: from a theoretical viewpoint, for a given precision of the score approximation, the convergence guarantee fails as T1 diverges; from a practical viewpoint, a large T1 increases computational costs and leads to error propagation. This paper addresses the issue by considering a version of the popular predictor-corrector scheme: after running the forward process, we first estimate the final distribution via an inexact Langevin dynamics and then revert the process. Our key technical contribution is to provide convergence guarantees which require to run the forward process only for a fixed finite time T1. Our bounds exhibit a mild logarithmic dependence on the input dimension and the subgaussian norm of the target distribution, have minimal assumptions on the data, and require only to control the L2 loss on the score approximation, which is the quantity minimized in practice."}],"citation":{"apa":"Pedrotti, F., Maas, J., &#38; Mondelli, M. (2024). Improved convergence of score-based diffusion models via prediction-correction. In <i>Transactions on Machine Learning Research</i>.","chicago":"Pedrotti, Francesco, Jan Maas, and Marco Mondelli. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” In <i>Transactions on Machine Learning Research</i>, 2024.","short":"F. Pedrotti, J. Maas, M. Mondelli, in:, Transactions on Machine Learning Research, 2024.","ieee":"F. Pedrotti, J. Maas, and M. Mondelli, “Improved convergence of score-based diffusion models via prediction-correction,” in <i>Transactions on Machine Learning Research</i>, 2024.","ista":"Pedrotti F, Maas J, Mondelli M. 2024. Improved convergence of score-based diffusion models via prediction-correction. Transactions on Machine Learning Research. , TMLR, .","mla":"Pedrotti, Francesco, et al. “Improved Convergence of Score-Based Diffusion Models via Prediction-Correction.” <i>Transactions on Machine Learning Research</i>, 2024.","ama":"Pedrotti F, Maas J, Mondelli M. Improved convergence of score-based diffusion models via prediction-correction. In: <i>Transactions on Machine Learning Research</i>. ; 2024."},"publication":"Transactions on Machine Learning Research","publication_identifier":{"issn":["2835-8856"]},"OA_place":"publisher","date_published":"2024-06-01T00:00:00Z","external_id":{"arxiv":["2305.14164"]},"file_date_updated":"2025-01-27T12:19:44Z","acknowledgement":"Francesco Pedrotti and Jan Maas acknowledge support by the Austrian Science Fund (FWF) project 10.55776/F65. Marco Mondelli acknowledges support by the 2019 Lopez-Loreta prize.\r\n","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1"},{"quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"09","department":[{"_id":"JaMa"}],"editor":[{"full_name":"Maas, Jan","first_name":"Jan","last_name":"Maas","orcid":"0000-0002-0845-1338","id":"4C5696CE-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rademacher, Simone Anna Elvira","first_name":"Simone Anna Elvira","last_name":"Rademacher","orcid":"0000-0001-5059-4466","id":"856966FE-A408-11E9-977E-802DE6697425"},{"full_name":"Titkos, Tamás","first_name":"Tamás","last_name":"Titkos"},{"id":"48DB45DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1109-5511","last_name":"Virosztek","first_name":"Daniel","full_name":"Virosztek, Daniel"}],"volume":29,"title":"Optimal Transport on Quantum Structures","year":"2024","day":"19","oa_version":"None","date_created":"2025-01-27T12:26:03Z","alternative_title":["Bolyai Society Mathematical Studies"],"series_title":"BSMS","place":"Cham","type":"book_editor","publication_identifier":{"isbn":["9783031504655"],"issn":["1217-4696"],"eisbn":["9783031504662"],"eissn":["2947-9460"]},"date_published":"2024-09-19T00:00:00Z","_id":"18899","publisher":"Springer Nature","article_processing_charge":"No","language":[{"iso":"eng"}],"date_updated":"2025-02-17T12:22:18Z","abstract":[{"text":"The flourishing theory of classical optimal transport concerns mass transportation at minimal cost. This book introduces the reader to optimal transport on quantum structures, i.e., optimal transportation between quantum states and related non-commutative concepts of mass transportation. It contains lecture notes on\r\n\r\nclassical optimal transport and Wasserstein gradient flows\r\ndynamics and quantum optimal transport\r\nquantum couplings and many-body problems\r\nquantum channels and qubits\r\n\r\nThese notes are based on lectures given by the authors at the \"Optimal Transport on Quantum Structures\" School held at the Erdös Center in Budapest in the fall of 2022. The lecture notes are complemented by two survey chapters presenting the state of the art in different research areas of non-commutative optimal transport.","lang":"eng"}],"publication_status":"published","citation":{"apa":"Maas, J., Rademacher, S. A. E., Titkos, T., &#38; Virosztek, D. (Eds.). (2024). <i>Optimal Transport on Quantum Structures</i> (Vol. 29). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-50466-2\">https://doi.org/10.1007/978-3-031-50466-2</a>","chicago":"Maas, Jan, Simone Anna Elvira Rademacher, Tamás Titkos, and Daniel Virosztek, eds. <i>Optimal Transport on Quantum Structures</i>. Vol. 29. BSMS. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-50466-2\">https://doi.org/10.1007/978-3-031-50466-2</a>.","short":"J. Maas, S.A.E. Rademacher, T. Titkos, D. Virosztek, eds., Optimal Transport on Quantum Structures, Springer Nature, Cham, 2024.","ieee":"J. Maas, S. A. E. Rademacher, T. Titkos, and D. Virosztek, Eds., <i>Optimal Transport on Quantum Structures</i>, vol. 29. Cham: Springer Nature, 2024.","ista":"Maas J, Rademacher SAE, Titkos T, Virosztek D eds. 2024. Optimal Transport on Quantum Structures, Cham: Springer Nature,p.","mla":"Maas, Jan, et al., editors. <i>Optimal Transport on Quantum Structures</i>. Vol. 29, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1007/978-3-031-50466-2\">10.1007/978-3-031-50466-2</a>.","ama":"Maas J, Rademacher SAE, Titkos T, Virosztek D, eds. <i>Optimal Transport on Quantum Structures</i>. Vol 29. Cham: Springer Nature; 2024. doi:<a href=\"https://doi.org/10.1007/978-3-031-50466-2\">10.1007/978-3-031-50466-2</a>"},"status":"public","scopus_import":"1","doi":"10.1007/978-3-031-50466-2","intvolume":"        29"},{"ddc":["510"],"_id":"18900","file":[{"relation":"main_file","file_size":689984,"creator":"dernst","file_id":"18901","content_type":"application/pdf","date_created":"2025-01-27T12:38:10Z","success":1,"file_name":"2024_IMRN_Wirth.pdf","checksum":"3e1f80d58ada0c60a58f35df8080967e","access_level":"open_access","date_updated":"2025-01-27T12:38:10Z"}],"language":[{"iso":"eng"}],"OA_type":"hybrid","article_processing_charge":"Yes (via OA deal)","scopus_import":"1","doi":"10.1093/imrn/rnae092","intvolume":"      2024","date_updated":"2025-09-09T12:02:46Z","status":"public","publication_status":"published","issue":"14","page":"10597-10614","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","project":[{"_id":"34c6ea2d-11ca-11ed-8bc3-c04f3c502833","grant_number":"ESP156_N","name":"Gradient flow techniques for quantum Markov semigroups"}],"article_type":"original","type":"journal_article","oa_version":"Published Version","department":[{"_id":"JaMa"}],"title":"Modular completely Dirichlet forms as squares of derivations","publisher":"Oxford University Press","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","external_id":{"isi":["001222279400001"]},"acknowledgement":"The author was funded by the Austrian Science Fund under the Esprit Programme [ESP 156]. 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. ","date_published":"2024-07-01T00:00:00Z","file_date_updated":"2025-01-27T12:38:10Z","OA_place":"publisher","publication_identifier":{"eissn":["1687-0247"],"issn":["1073-7928"]},"publication":"International Mathematics Research Notices","abstract":[{"lang":"eng","text":"We prove that certain closable derivations on the GNS Hilbert space associated with a non-tracial weight on a von Neumann algebra give rise to GNS-symmetric semigroups of contractive completely positive maps on the von Neumann algebra."}],"corr_author":"1","citation":{"short":"M. Wirth, International Mathematics Research Notices 2024 (2024) 10597–10614.","chicago":"Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2024. <a href=\"https://doi.org/10.1093/imrn/rnae092\">https://doi.org/10.1093/imrn/rnae092</a>.","apa":"Wirth, M. (2024). Modular completely Dirichlet forms as squares of derivations. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnae092\">https://doi.org/10.1093/imrn/rnae092</a>","ieee":"M. Wirth, “Modular completely Dirichlet forms as squares of derivations,” <i>International Mathematics Research Notices</i>, vol. 2024, no. 14. Oxford University Press, pp. 10597–10614, 2024.","ista":"Wirth M. 2024. Modular completely Dirichlet forms as squares of derivations. International Mathematics Research Notices. 2024(14), 10597–10614.","ama":"Wirth M. Modular completely Dirichlet forms as squares of derivations. <i>International Mathematics Research Notices</i>. 2024;2024(14):10597-10614. doi:<a href=\"https://doi.org/10.1093/imrn/rnae092\">10.1093/imrn/rnae092</a>","mla":"Wirth, Melchior. “Modular Completely Dirichlet Forms as Squares of Derivations.” <i>International Mathematics Research Notices</i>, vol. 2024, no. 14, Oxford University Press, 2024, pp. 10597–614, doi:<a href=\"https://doi.org/10.1093/imrn/rnae092\">10.1093/imrn/rnae092</a>."},"quality_controlled":"1","author":[{"full_name":"Wirth, Melchior","first_name":"Melchior","last_name":"Wirth","orcid":"0000-0002-0519-4241","id":"88644358-0A0E-11EA-8FA5-49A33DDC885E"}],"month":"07","oa":1,"day":"01","year":"2024","date_created":"2025-01-27T12:36:10Z","volume":2024},{"pmid":1,"OA_place":"publisher","publication_identifier":{"eissn":["2041-1723"]},"date_published":"2024-02-01T00:00:00Z","acknowledgement":"MZ is supported by National Science Center, Poland, 2021/42/E/NZ2/00188, the Polish National Agency for Academic Exchange, and by a grant from the Priority Research Area DigiWorld under the Strategic Programme Excellence Initiative at Jagiellonian University. Work in JB’s lab is supported by the Francis Crick Institute, which receives its core funding from Cancer Research UK, the UK Medical Research Council and Wellcome Trust (all under CC001051). Work in the AK lab is supported by ISTA, the European Research Council under Horizon Europe: grant 101044579, and Austrian Science Fund (FWF): F78 (Neural Stem Cell Modulation).","external_id":{"isi":["001156218500022"],"pmid":["38302459"]},"file_date_updated":"2025-01-27T13:04:03Z","tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"isi":1,"publisher":"Springer Nature","has_accepted_license":"1","corr_author":"1","citation":{"ieee":"M. Zagorski <i>et al.</i>, “Assessing the precision of morphogen gradients in neural tube development,” <i>Nature Communications</i>, vol. 15. Springer Nature, 2024.","short":"M. Zagorski, N. Brandenberg, M. Lutolf, G. Tkačik, M.T. Bollenbach, J. Briscoe, A. Kicheva, Nature Communications 15 (2024).","chicago":"Zagorski, Marcin, Nathalie Brandenberg, Matthias Lutolf, Gašper Tkačik, Mark Tobias Bollenbach, James Briscoe, and Anna Kicheva. “Assessing the Precision of Morphogen Gradients in Neural Tube Development.” <i>Nature Communications</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s41467-024-45148-8\">https://doi.org/10.1038/s41467-024-45148-8</a>.","apa":"Zagorski, M., Brandenberg, N., Lutolf, M., Tkačik, G., Bollenbach, M. T., Briscoe, J., &#38; Kicheva, A. (2024). Assessing the precision of morphogen gradients in neural tube development. <i>Nature Communications</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s41467-024-45148-8\">https://doi.org/10.1038/s41467-024-45148-8</a>","ama":"Zagorski M, Brandenberg N, Lutolf M, et al. Assessing the precision of morphogen gradients in neural tube development. <i>Nature Communications</i>. 2024;15. doi:<a href=\"https://doi.org/10.1038/s41467-024-45148-8\">10.1038/s41467-024-45148-8</a>","mla":"Zagorski, Marcin, et al. “Assessing the Precision of Morphogen Gradients in Neural Tube Development.” <i>Nature Communications</i>, vol. 15, 929, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s41467-024-45148-8\">10.1038/s41467-024-45148-8</a>.","ista":"Zagorski M, Brandenberg N, Lutolf M, Tkačik G, Bollenbach MT, Briscoe J, Kicheva A. 2024. Assessing the precision of morphogen gradients in neural tube development. Nature Communications. 15, 929."},"publication":"Nature Communications","oa":1,"author":[{"last_name":"Zagorski","first_name":"Marcin","full_name":"Zagorski, Marcin"},{"full_name":"Brandenberg, Nathalie","first_name":"Nathalie","last_name":"Brandenberg"},{"full_name":"Lutolf, Matthias","first_name":"Matthias","last_name":"Lutolf"},{"last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"full_name":"Bollenbach, Mark Tobias","first_name":"Mark Tobias","last_name":"Bollenbach","id":"3E6DB97A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4398-476X"},{"first_name":"James","last_name":"Briscoe","full_name":"Briscoe, James"},{"full_name":"Kicheva, Anna","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4509-4998","last_name":"Kicheva","first_name":"Anna"}],"quality_controlled":"1","month":"02","volume":15,"year":"2024","day":"01","article_number":"929","date_created":"2025-01-27T13:01:01Z","file":[{"checksum":"acf75f2b6fa84a64d1f590dd4a53cbf7","file_name":"2024_NatureComm_Zagorski.pdf","date_updated":"2025-01-27T13:04:03Z","access_level":"open_access","date_created":"2025-01-27T13:04:03Z","content_type":"application/pdf","success":1,"creator":"dernst","file_id":"18903","relation":"main_file","file_size":4723831}],"_id":"18902","ddc":["570"],"OA_type":"gold","article_processing_charge":"Yes","language":[{"iso":"eng"}],"date_updated":"2025-12-30T10:57:08Z","publication_status":"published","status":"public","scopus_import":"1","doi":"10.1038/s41467-024-45148-8","intvolume":"        15","DOAJ_listed":"1","project":[{"_id":"bd7e737f-d553-11ed-ba76-d69ffb5ee3aa","name":"Mechanisms of tissue size regulation in spinal cord development","grant_number":"101044579"},{"_id":"059DF620-7A3F-11EA-A408-12923DDC885E","grant_number":"F7802","name":"Stem Cell Modulation in Neural Development and Regeneration/ P02-Morphogen control of growth and pattern in the spinal cord"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"GaTk"},{"_id":"AnKi"}],"title":"Assessing the precision of morphogen gradients in neural tube development","article_type":"letter_note","oa_version":"Published Version","type":"journal_article"},{"scopus_import":"1","doi":"10.1145/3637528.3671978","conference":{"end_date":"2024-08-29","name":"KDD: Knowledge Discovery and Data Mining","start_date":"2024-08-05","location":"Barcelona, Spain"},"date_updated":"2025-09-09T12:04:56Z","status":"public","publication_status":"published","ddc":["000"],"_id":"18906","file":[{"file_id":"18907","creator":"dernst","file_size":1450331,"relation":"main_file","checksum":"1265d5cf6aa5f94157631651723c4a2b","file_name":"2024_ACMKDD_Hanauer.pdf","date_updated":"2025-01-27T13:25:23Z","access_level":"open_access","date_created":"2025-01-27T13:25:23Z","content_type":"application/pdf","success":1}],"OA_type":"hybrid","article_processing_charge":"Yes (in subscription journal)","language":[{"iso":"eng"}],"type":"conference","oa_version":"Published Version","department":[{"_id":"MoHe"}],"title":"Expander hierarchies for normalized cuts on graphs","page":"1016-1027","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"project":[{"grant_number":"101019564","name":"The design and evaluation of modern fully dynamic data structures","call_identifier":"H2020","_id":"bd9ca328-d553-11ed-ba76-dc4f890cfe62"},{"grant_number":"Z00422","name":"Efficient algorithms","_id":"34def286-11ca-11ed-8bc3-da5948e1613c"},{"_id":"bda196b2-d553-11ed-ba76-8e8ee6c21103","name":"Static and Dynamic Hierarchical Graph Decompositions","grant_number":"I05982"}],"publication":"Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","abstract":[{"lang":"eng","text":"Expander decompositions of graphs have significantly advanced the understanding of many classical graph problems and led to numerous fundamental theoretical results. However, their adoption in practice has been hindered due to their inherent intricacies and large hidden factors in their asymptotic running times. Here, we introduce the first practically efficient algorithm for computing expander decompositions and their hierarchies and demonstrate its effectiveness and utility by incorporating it as the core component in a novel solver for the normalized cut graph clustering objective.\r\nOur extensive experiments on a variety of large graphs show that our expander-based algorithm outperforms state-of-the-art solvers for normalized cut with respect to solution quality by a large margin on a variety of graph classes such as citation, e-mail, and social networks or web graphs while remaining competitive in running time."}],"citation":{"ama":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. Expander hierarchies for normalized cuts on graphs. In: <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>. ACM; 2024:1016-1027. doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>","mla":"Hanauer, Kathrin, et al. “Expander Hierarchies for Normalized Cuts on Graphs.” <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, ACM, 2024, pp. 1016–27, doi:<a href=\"https://doi.org/10.1145/3637528.3671978\">10.1145/3637528.3671978</a>.","ista":"Hanauer K, Henzinger M, Münk R, Räcke H, Vötsch M. 2024. Expander hierarchies for normalized cuts on graphs. Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining. KDD: Knowledge Discovery and Data Mining, 1016–1027.","ieee":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, and M. Vötsch, “Expander hierarchies for normalized cuts on graphs,” in <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, Barcelona, Spain, 2024, pp. 1016–1027.","short":"K. Hanauer, M. Henzinger, R. Münk, H. Räcke, M. Vötsch, in:, Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, ACM, 2024, pp. 1016–1027.","chicago":"Hanauer, Kathrin, Monika Henzinger, Robin Münk, Harald Räcke, and Maximilian Vötsch. “Expander Hierarchies for Normalized Cuts on Graphs.” In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i>, 1016–27. ACM, 2024. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>.","apa":"Hanauer, K., Henzinger, M., Münk, R., Räcke, H., &#38; Vötsch, M. (2024). Expander hierarchies for normalized cuts on graphs. In <i>Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data Mining</i> (pp. 1016–1027). Barcelona, Spain: ACM. <a href=\"https://doi.org/10.1145/3637528.3671978\">https://doi.org/10.1145/3637528.3671978</a>"},"publisher":"ACM","isi":1,"tmp":{"short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png"},"has_accepted_license":"1","acknowledgement":"Monika Henzinger: This project has received funding from the European Research\r\nCouncil (ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant agreement No. 101019564) and the Austrian Science Fund (FWF) grant DOI 10.55776/Z422, grant DOI 10.55776/I5982, and grant DOI 10.55776/P33775 with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nHarald Räcke, Robin Münk: This project has received funding from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) – 498605858 and 470029389.","external_id":{"isi":["001324524201013"]},"date_published":"2024-09-01T00:00:00Z","file_date_updated":"2025-01-27T13:25:23Z","OA_place":"publisher","publication_identifier":{"isbn":["9798400704901"]},"day":"01","year":"2024","date_created":"2025-01-27T13:20:26Z","quality_controlled":"1","author":[{"first_name":"Kathrin","last_name":"Hanauer","full_name":"Hanauer, Kathrin"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"first_name":"Robin","last_name":"Münk","full_name":"Münk, Robin"},{"first_name":"Harald","last_name":"Räcke","full_name":"Räcke, Harald"},{"full_name":"Vötsch, Maximilian","last_name":"Vötsch","first_name":"Maximilian"}],"month":"09","oa":1}]