[{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"external_id":{"isi":["001379155900003"]},"language":[{"iso":"eng"}],"isi":1,"fulldoi":"https://doi.org/10.1103/PhysRevApplied.22.064026","file":[{"access_level":"open_access","file_id":"18662","content_type":"application/pdf","file_name":"2024_PhysicalReviewApplied_Hickie.pdf","file_size":3560132,"checksum":"bc29a40819abc4969867b6cd6563f7ad","date_updated":"2024-12-16T11:13:48Z","relation":"main_file","date_created":"2024-12-16T11:13:48Z","success":1,"creator":"dernst"}],"day":"01","date_published":"2024-12-01T00:00:00Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"American Physical Society","doi":"10.1103/PhysRevApplied.22.064026","_id":"18653","status":"public","project":[{"_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1","name":"High impedance circuit quantum electrodynamics with hole spins","grant_number":"I05060"},{"grant_number":"101069515","name":"Integrated Germanium Quantum Technology","_id":"34c0acea-11ca-11ed-8bc3-8775e10fd452"}],"type":"journal_article","date_updated":"2025-09-09T11:47:52Z","title":"Automated long-range compensation of an rf quantum dot sensor","abstract":[{"lang":"eng","text":"Charge sensing is a sensitive technique for probing quantum devices, of particular importance for spin-qubit readout. To achieve good readout sensitivities, the proximity of the charge sensor to the device to be measured is a necessity. However, this proximity also means that the operation of the device affects, in turn, the sensor tuning and ultimately the readout sensitivity. We present an approach for compensating for this crosstalk effect allowing for the gate voltages of the measured device to be swept in a 1-V × 1-V window while maintaining a sensor configuration chosen by a Bayesian optimizer. Our algorithm will hopefully be a major contribution to the suite of fully automated solutions required for the operation of large quantum device architectures."}],"file_date_updated":"2024-12-16T11:13:48Z","oa":1,"year":"2024","article_processing_charge":"No","month":"12","issue":"6","intvolume":" 22","oa_version":"Published Version","author":[{"first_name":"Joseph","full_name":"Hickie, Joseph","last_name":"Hickie"},{"last_name":"Van Straaten","first_name":"Barnaby","full_name":"Van Straaten, Barnaby"},{"last_name":"Fedele","first_name":"Federico","full_name":"Fedele, Federico"},{"last_name":"Jirovec","first_name":"Daniel","full_name":"Jirovec, Daniel","orcid":"0000-0002-7197-4801","id":"4C473F58-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Andrea","full_name":"Ballabio, Andrea","last_name":"Ballabio"},{"first_name":"Daniel","full_name":"Chrastina, Daniel","last_name":"Chrastina"},{"last_name":"Isella","full_name":"Isella, Giovanni","first_name":"Giovanni"},{"last_name":"Katsaros","id":"38DB5788-F248-11E8-B48F-1D18A9856A87","first_name":"Georgios","full_name":"Katsaros, Georgios","orcid":"0000-0001-8342-202X"},{"first_name":"Natalia","full_name":"Ares, Natalia","last_name":"Ares"}],"publication_status":"published","article_type":"original","ddc":["530"],"article_number":"064026","acknowledgement":"We thank Nicholas Sim for providing help with the experiment and Sebastian Orbell for helpful discussions. This work was supported by the Royal Society, the Engineering and Physical Sciences Research Council (EPSRC) National Quantum Technology Hub in Networked Quantum Information Technology (Grant No. EP/M013243/1), Quantum Technology Capital (Grant No. EP/N014995/1), the EPSRC Platform Grant (Grant No. EP/R029229/1), the European Research Council (Grant Agreement No. 948932), the Scientific Service Units of the Institute of Science and Technology Austria through resources provided by the nanofabrication facility and, the FWF-I 05060 and HORIZON-RIA 101069515 projects.","publication_identifier":{"eissn":["2331-7019"]},"volume":22,"quality_controlled":"1","OA_place":"publisher","OA_type":"hybrid","citation":{"chicago":"Hickie, Joseph, Barnaby Van Straaten, Federico Fedele, Daniel Jirovec, Andrea Ballabio, Daniel Chrastina, Giovanni Isella, Georgios Katsaros, and Natalia Ares. “Automated Long-Range Compensation of an Rf Quantum Dot Sensor.” Physical Review Applied. American Physical Society, 2024. https://doi.org/10.1103/PhysRevApplied.22.064026.","apa":"Hickie, J., Van Straaten, B., Fedele, F., Jirovec, D., Ballabio, A., Chrastina, D., … Ares, N. (2024). Automated long-range compensation of an rf quantum dot sensor. Physical Review Applied. American Physical Society. https://doi.org/10.1103/PhysRevApplied.22.064026","ieee":"J. Hickie et al., “Automated long-range compensation of an rf quantum dot sensor,” Physical Review Applied, vol. 22, no. 6. American Physical Society, 2024.","short":"J. Hickie, B. Van Straaten, F. Fedele, D. Jirovec, A. Ballabio, D. Chrastina, G. Isella, G. Katsaros, N. Ares, Physical Review Applied 22 (2024).","mla":"Hickie, Joseph, et al. “Automated Long-Range Compensation of an Rf Quantum Dot Sensor.” Physical Review Applied, vol. 22, no. 6, 064026, American Physical Society, 2024, doi:10.1103/PhysRevApplied.22.064026.","ama":"Hickie J, Van Straaten B, Fedele F, et al. Automated long-range compensation of an rf quantum dot sensor. Physical Review Applied. 2024;22(6). doi:10.1103/PhysRevApplied.22.064026","ista":"Hickie J, Van Straaten B, Fedele F, Jirovec D, Ballabio A, Chrastina D, Isella G, Katsaros G, Ares N. 2024. Automated long-range compensation of an rf quantum dot sensor. Physical Review Applied. 22(6), 064026."},"has_accepted_license":"1","acknowledged_ssus":[{"_id":"NanoFab"}],"date_created":"2024-12-15T23:01:50Z","department":[{"_id":"GeKa"}],"scopus_import":"1","publication":"Physical Review Applied"},{"type":"journal_article","project":[{"grant_number":"F8607","name":"Center for Correlated Quantum Materials and Solid State Quantum Systems: Scale- invariance in entangled quantum spin systems","_id":"34ac8b51-11ca-11ed-8bc3-86c15daa9f8f"}],"status":"public","_id":"18654","doi":"10.1103/PhysRevB.110.L201114","publisher":"American Physical Society","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"We compute the rotational anisotropy of the free energy of 𝛼−RuCl3 in an external magnetic field. This quantity, known as the magnetotropic susceptibility, 𝑘, relates to the second derivative of the free energy with respect to the angle of rotation. We have used approximation-free, auxiliary-field quantum Monte Carlo simulations for a realistic model of 𝛼−RuCl3 and optimized the path integral to alleviate the negative sign problem. This allows us to reach temperatures down to 30K—an energy scale below the dominant Kitaev coupling. We demonstrate that the magnetotropic spin susceptibility in this model of 𝛼−RuCl3 displays scaling behavior 𝑘=𝑇𝑓(𝐵/𝑇) at high temperatures. Once the uniform susceptibility departs from the Curie law (i.e., at the energy scale of the exchange interactions), it appears to transition to an emergent scalinglike behavior, characterized by a different function 𝑓 at lower temperatures, stemming from the locality of torque fluctuations. We observe a remarkable numerical match between experiment and simulations and we also find qualitative agreement with the pure Kitaev model. In comparison, for the XXZ Heisenberg Hamiltonian, the scaling 𝑘=𝑇𝑓(𝐵/𝑇) breaks down at a temperature scale where the uniform spin susceptibility deviates from the Curie law and never reemerges at low temperatures."}],"title":"Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study","date_updated":"2025-09-09T11:48:35Z","date_published":"2024-11-15T00:00:00Z","day":"15","isi":1,"fulldoi":"https://doi.org/10.1103/PhysRevB.110.L201114","language":[{"iso":"eng"}],"external_id":{"arxiv":["2312.03080"],"isi":["001447562900001"]},"OA_type":"green","arxiv":1,"quality_controlled":"1","OA_place":"repository","publication_identifier":{"eissn":["2469-9969"],"issn":["2469-9950"]},"volume":110,"acknowledgement":"We gratefully acknowledge the Gauss Centre for Supercomputing e.V. for funding this project by providing computing time on the GCS Supercomputer SUPERMUC-NG at the Leibniz Supercomputing Centre (Project No. pn73xu) as well as the scientific support and HPC resources provided by the Erlangen National High Performance Computing Center (NHR@FAU) of the Friedrich-Alexander-Universität Erlangen-Nürnberg (FAU) under the NHR Project b133ae. NHR funding is provided by federal and Bavarian state authorities. NHR@FAU hardware is partially funded by the German Research Foundation (DFG) – 440719683. T.S. thanks funding from the Deutsche Forschungsgemeinschaft under Grant No. SA 3986/1-1 as well as the Würzburg-Dresden Cluster of Excellence on Complexity and Topology in Quantum Matter ct.qmat (EXC 2147, Project ID 390858490). F.F.A. acknowledges financial support from the German Research Foundation (DFG) under the Grant AS 120/16-1 (Project No. 493886309) that is part of the collaborative research project SFB Q-M&S funded by the Austrian Science Fund (FWF) F 86. K.A.M. thanks financial support from the Austrian Science Fund, SFB F 86, Q-M&S.","article_number":"L201114","publication":"Physical Review B","scopus_import":"1","department":[{"_id":"KiMo"}],"date_created":"2024-12-15T23:01:50Z","citation":{"ieee":"T. Sato, B. J. Ramshaw, K. A. Modic, and F. F. Assaad, “Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study,” Physical Review B, vol. 110, no. 20. American Physical Society, 2024.","apa":"Sato, T., Ramshaw, B. J., Modic, K. A., & Assaad, F. F. (2024). Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. American Physical Society. https://doi.org/10.1103/PhysRevB.110.L201114","short":"T. Sato, B.J. Ramshaw, K.A. Modic, F.F. Assaad, Physical Review B 110 (2024).","chicago":"Sato, Toshihiro, B. J. Ramshaw, Kimberly A Modic, and Fakher F. Assaad. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B. American Physical Society, 2024. https://doi.org/10.1103/PhysRevB.110.L201114.","ista":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. 2024. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 110(20), L201114.","ama":"Sato T, Ramshaw BJ, Modic KA, Assaad FF. Scale-invariant magnetic anisotropy in α-RuCl3: A quantum Monte Carlo study. Physical Review B. 2024;110(20). doi:10.1103/PhysRevB.110.L201114","mla":"Sato, Toshihiro, et al. “Scale-Invariant Magnetic Anisotropy in α-RuCl3: A Quantum Monte Carlo Study.” Physical Review B, vol. 110, no. 20, L201114, American Physical Society, 2024, doi:10.1103/PhysRevB.110.L201114."},"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2312.03080","open_access":"1"}],"issue":"20","intvolume":" 110","oa_version":"Preprint","month":"11","article_processing_charge":"No","oa":1,"year":"2024","publication_status":"published","article_type":"letter_note","author":[{"last_name":"Sato","first_name":"Toshihiro","full_name":"Sato, Toshihiro"},{"full_name":"Ramshaw, B. J.","first_name":"B. J.","last_name":"Ramshaw"},{"first_name":"Kimberly A","full_name":"Modic, Kimberly A","orcid":"0000-0001-9760-3147","id":"13C26AC0-EB69-11E9-87C6-5F3BE6697425","last_name":"Modic"},{"last_name":"Assaad","full_name":"Assaad, Fakher F.","first_name":"Fakher F."}]},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"fulldoi":"https://doi.org/10.1214/24-ECP639","isi":1,"file":[{"creator":"dernst","success":1,"date_created":"2024-12-16T07:33:34Z","relation":"main_file","checksum":"307a9d049325e6ca9bfe8b4a1f275983","date_updated":"2024-12-16T07:33:34Z","file_size":530169,"file_name":"2024_ElectrCommProbability_Anastos.pdf","content_type":"application/pdf","file_id":"18657","access_level":"open_access"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2311.16631"],"isi":["001356019700001"]},"day":"24","date_published":"2024-11-24T00:00:00Z","doi":"10.1214/24-ECP639","publisher":"Duke University Press","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"type":"journal_article","_id":"18655","status":"public","date_updated":"2025-09-09T11:46:53Z","file_date_updated":"2024-12-16T07:33:34Z","abstract":[{"text":"Let Qd be the d-dimensional binary hypercube. We say that P={v1,…,vk} is an increasing path of length k−1 in Qd, if for every i∈[k−1] the edge vivi+1 is obtained by switching some zero coordinate in vi to a one coordinate in vi+1.\r\nForm a random subgraph Qdp by retaining each edge in E(Qd) independently with probability p. We show that there is a phase transition with respect to the length of a longest increasing path around p=ed. Let α be a constant and let p=αd. When αe, whp there is a path of length d−2 in Qdp, and in fact, whether it is of length d−2,d−1, or d depends on whether the all-zero and all-one vertices percolate or not.","lang":"eng"}],"title":"Climbing up a random subgraph of the hypercube","article_processing_charge":"Yes","oa":1,"year":"2024","oa_version":"Published Version","intvolume":" 29","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2311.16631"}],"month":"11","article_type":"original","publication_status":"published","author":[{"full_name":"Anastos, Michael","first_name":"Michael","id":"0b2a4358-bb35-11ec-b7b9-e3279b593dbb","last_name":"Anastos"},{"last_name":"Diskin","first_name":"Sahar","full_name":"Diskin, Sahar"},{"full_name":"Elboim, Dor","first_name":"Dor","last_name":"Elboim"},{"full_name":"Krivelevich, Michael","first_name":"Michael","last_name":"Krivelevich"}],"ddc":["510"],"acknowledgement":"Research supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 101034413.\r\nThe authors wish to thank Ross Pinsky for his comments on an earlier version of the paper, and for bringing reference [12] to our attention. The authors are grateful to the anonymous referees for their helpful comments and suggestions.","article_number":"70","OA_type":"gold","OA_place":"repository","arxiv":1,"quality_controlled":"1","ec_funded":1,"volume":29,"publication_identifier":{"eissn":["1083-589X"]},"has_accepted_license":"1","corr_author":"1","citation":{"chicago":"Anastos, Michael, Sahar Diskin, Dor Elboim, and Michael Krivelevich. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability. Duke University Press, 2024. https://doi.org/10.1214/24-ECP639.","apa":"Anastos, M., Diskin, S., Elboim, D., & Krivelevich, M. (2024). Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. Duke University Press. https://doi.org/10.1214/24-ECP639","ieee":"M. Anastos, S. Diskin, D. Elboim, and M. Krivelevich, “Climbing up a random subgraph of the hypercube,” Electronic Communications in Probability, vol. 29. Duke University Press, 2024.","short":"M. Anastos, S. Diskin, D. Elboim, M. Krivelevich, Electronic Communications in Probability 29 (2024).","mla":"Anastos, Michael, et al. “Climbing up a Random Subgraph of the Hypercube.” Electronic Communications in Probability, vol. 29, 70, Duke University Press, 2024, doi:10.1214/24-ECP639.","ama":"Anastos M, Diskin S, Elboim D, Krivelevich M. Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. 2024;29. doi:10.1214/24-ECP639","ista":"Anastos M, Diskin S, Elboim D, Krivelevich M. 2024. Climbing up a random subgraph of the hypercube. Electronic Communications in Probability. 29, 70."},"publication":"Electronic Communications in Probability","scopus_import":"1","department":[{"_id":"MaKw"}],"date_created":"2024-12-15T23:01:51Z"},{"_id":"18673","status":"public","project":[{"grant_number":"788183","name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425"},{"grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes","call_identifier":"FWF"}],"type":"preprint","doi":"10.48550/arXiv.2408.16575","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Motivated by applications to crystalline materials, we generalize the merge tree and the related barcode of a filtered complex to the periodic setting in Euclidean space. They are invariant under isometries, changing bases, and indeed changing lattices. In addition, we prove stability under perturbations and provide an algorithm that under mild geometric conditions typically satisfied by crystalline materials takes O((n+m)logn) time, in which n and m are the numbers of vertices and edges in the quotient complex, respectively.\r\n"}],"title":"Merge trees of periodic filtrations","date_updated":"2026-04-07T12:54:09Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"day":"29","date_published":"2024-08-29T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.48550/arXiv.2408.16575","external_id":{"arxiv":["2408.16575"]},"OA_place":"repository","arxiv":1,"ec_funded":1,"acknowledgement":"Both authors are partially supported by the European Research Council (ERC) Horizon 2020 project\r\n‘Alpha Shape Theory Extended’, grant no. 788183. The first author is also partially supported by the DFG\r\nCollaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund\r\n(FWF), grant no. I 02979-N35.","publication":"arXiv","date_created":"2024-12-18T14:06:57Z","department":[{"_id":"HeEd"}],"related_material":{"record":[{"id":"18667","relation":"dissertation_contains","status":"public"}]},"citation":{"ista":"Edelsbrunner H, Heiss T. Merge trees of periodic filtrations. arXiv, 10.48550/arXiv.2408.16575.","mla":"Edelsbrunner, Herbert, and Teresa Heiss. “Merge Trees of Periodic Filtrations.” ArXiv, doi:10.48550/arXiv.2408.16575.","ama":"Edelsbrunner H, Heiss T. Merge trees of periodic filtrations. arXiv. doi:10.48550/arXiv.2408.16575","short":"H. Edelsbrunner, T. Heiss, ArXiv (n.d.).","ieee":"H. Edelsbrunner and T. Heiss, “Merge trees of periodic filtrations,” arXiv. .","apa":"Edelsbrunner, H., & Heiss, T. (n.d.). Merge trees of periodic filtrations. arXiv. https://doi.org/10.48550/arXiv.2408.16575","chicago":"Edelsbrunner, Herbert, and Teresa Heiss. “Merge Trees of Periodic Filtrations.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2408.16575."},"corr_author":"1","oa_version":"Preprint","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2408.16575","open_access":"1"}],"month":"08","oa":1,"year":"2024","article_processing_charge":"No","author":[{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","first_name":"Herbert","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner"},{"first_name":"Teresa","orcid":"0000-0002-1780-2689","full_name":"Heiss, Teresa","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss"}],"publication_status":"draft"},{"tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"day":"18","date_published":"2024-12-18T00:00:00Z","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.15479/at:ista:18674","file":[{"creator":"jlyudchi","success":1,"relation":"main_file","date_created":"2024-12-18T14:17:34Z","checksum":"1b42b8073e2bc09fc504da52372248c1","date_updated":"2024-12-18T14:17:34Z","file_size":160536833,"file_name":"18122024_PhDthesis_corrected_final_pdfa.pdf","content_type":"application/pdf","file_id":"18675","access_level":"open_access"},{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","file_name":"18122024_PhDthesis_corrected_final_JL_markup.docx","file_id":"18676","access_level":"closed","creator":"jlyudchi","relation":"source_file","date_created":"2024-12-18T14:21:06Z","date_updated":"2024-12-18T14:41:53Z","checksum":"b4da84624060745519723698f7ddf54b","file_size":99172203}],"_id":"18674","status":"public","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"type":"dissertation","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","publisher":"Institute of Science and Technology Austria","doi":"10.15479/at:ista:18674","title":"Image analysis for brain tissue reconstruction with super-resolution light microscopy","abstract":[{"lang":"eng","text":"Mapping the complex and dense arrangement of cells and their connectivity in brain tissue requires volumetric imaging at nanoscale spatial resolution. While light microscopy excels at visualizing specific molecules and individual cells, achieving dense, synapse-level circuit reconstruction has not been possible with any light microscopy technique. Thus, the goal of my work was to develop image and data analysis pipelines for brain tissue visualization and reconstruction with light microscopy. To achieve dense circuit reconstruction with single-synapse resolution, I developed both conventional and deep-learning-based synapse detection algorithms, as well as connectivity analysis pipelines that integrate synapse detection with volumetric segmentation of brain tissue."}],"file_date_updated":"2024-12-18T14:41:53Z","page":"217","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","date_updated":"2026-04-14T08:34:35Z","month":"12","oa_version":"Published Version","year":"2024","oa":1,"degree_awarded":"PhD","article_processing_charge":"No","ddc":["004"],"author":[{"last_name":"Lyudchik","id":"46E28B80-F248-11E8-B48F-1D18A9856A87","first_name":"Julia","full_name":"Lyudchik, Julia"}],"publication_status":"published","ec_funded":1,"publication_identifier":{"isbn":[" 978-3-99078-051-0"],"issn":["2663-337X"]},"OA_place":"publisher","supervisor":[{"last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8559-3973","full_name":"Danzl, Johann G","first_name":"Johann G"}],"date_created":"2024-12-18T14:24:43Z","department":[{"_id":"GradSch"},{"_id":"JoDa"}],"citation":{"ista":"Lyudchik J. 2024. Image analysis for brain tissue reconstruction with super-resolution light microscopy. Institute of Science and Technology Austria.","ama":"Lyudchik J. Image analysis for brain tissue reconstruction with super-resolution light microscopy. 2024. doi:10.15479/at:ista:18674","mla":"Lyudchik, Julia. Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy. Institute of Science and Technology Austria, 2024, doi:10.15479/at:ista:18674.","ieee":"J. Lyudchik, “Image analysis for brain tissue reconstruction with super-resolution light microscopy,” Institute of Science and Technology Austria, 2024.","apa":"Lyudchik, J. (2024). Image analysis for brain tissue reconstruction with super-resolution light microscopy. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:18674","short":"J. Lyudchik, Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy, Institute of Science and Technology Austria, 2024.","chicago":"Lyudchik, Julia. “Image Analysis for Brain Tissue Reconstruction with Super-Resolution Light Microscopy.” Institute of Science and Technology Austria, 2024. https://doi.org/10.15479/at:ista:18674."},"corr_author":"1","has_accepted_license":"1","acknowledged_ssus":[{"_id":"Bio"}],"alternative_title":["ISTA Thesis"],"related_material":{"record":[{"id":"11160","status":"public","relation":"part_of_dissertation"},{"status":"public","relation":"part_of_dissertation","id":"18677"},{"status":"public","relation":"part_of_dissertation","id":"13267"},{"relation":"part_of_dissertation","status":"public","id":"14257"}]}},{"file_date_updated":"2025-01-02T09:34:25Z","abstract":[{"text":"We measure the mass distribution of main-sequence (MS) companions to hot subdwarf B stars (sdBs) in post-common envelope binaries (PCEBs). We carried out a spectroscopic survey of 14 eclipsing systems (\"HW Vir binaries\") with orbital periods of 3.8 < Porb < 12 hr, resulting in a well-understood selection function and a near-complete sample of HW Vir binaries with G < 16. We constrain companion masses from the radial velocity curves of the sdB stars. The companion mass distribution peaks at MMS ≈ 0.15 M⊙ and drops off at MMS > 0.2 M⊙, with only two systems hosting companions above the fully convective limit. There is no correlation between Porb and MMS within the sample. A similar drop-off in the companion mass distribution of white dwarf (WD) + MS PCEBs has been attributed to disrupted magnetic braking (MB) below the fully convective limit. We compare the sdB companion mass distribution to predictions of binary evolution simulations with a range of MB laws. Because sdBs have short lifetimes compared to WDs, explaining the lack of higher-mass MS companions to sdBs with disrupted MB requires MB to be boosted by a factor of 20–100 relative to MB laws inferred from the rotation evolution of single stars. We speculate that such boosting may be a result of irradiation-driven enhancement of the MS stars' winds. An alternative possibility is that common envelope evolution favors low-mass companions in short-period orbits, but the existence of massive WD companions to sdBs with similar periods disfavors this scenario.","lang":"eng"}],"title":"The companion mass distribution of post common envelope hot subdwarf binaries: Evidence for boosted and disrupted magnetic braking?","date_updated":"2025-09-09T11:55:13Z","type":"journal_article","_id":"18709","status":"public","doi":"10.1088/1538-3873/ad94a2","publisher":"IOP Publishing","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2024-12-01T00:00:00Z","day":"01","fulldoi":"https://doi.org/10.1088/1538-3873/ad94a2","file":[{"date_created":"2025-01-02T09:34:25Z","relation":"main_file","creator":"dernst","success":1,"file_size":7539133,"checksum":"56fe719e26bc0c2a99ac5322791107e5","date_updated":"2025-01-02T09:34:25Z","file_name":"2024_PASP_Blomberg.pdf","content_type":"application/pdf","access_level":"open_access","file_id":"18719"}],"isi":1,"language":[{"iso":"eng"}],"external_id":{"isi":["001379604600001"],"arxiv":["2408.15334"]},"tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"publication":"Publications of the Astronomical Society of the Pacific","department":[{"_id":"IlCa"}],"scopus_import":"1","date_created":"2024-12-29T23:01:57Z","has_accepted_license":"1","citation":{"short":"L. Blomberg, K. El-Badry, K. Breivik, I. Caiazzo, P. Nagarajan, A. Rodriguez, J. Van Roestel, Z.P. Vanderbosch, N. Yamaguchi, Publications of the Astronomical Society of the Pacific 136 (2024).","ieee":"L. Blomberg et al., “The companion mass distribution of post common envelope hot subdwarf binaries: Evidence for boosted and disrupted magnetic braking?,” Publications of the Astronomical Society of the Pacific, vol. 136, no. 12. IOP Publishing, 2024.","apa":"Blomberg, L., El-Badry, K., Breivik, K., Caiazzo, I., Nagarajan, P., Rodriguez, A., … Yamaguchi, N. (2024). The companion mass distribution of post common envelope hot subdwarf binaries: Evidence for boosted and disrupted magnetic braking? Publications of the Astronomical Society of the Pacific. IOP Publishing. https://doi.org/10.1088/1538-3873/ad94a2","chicago":"Blomberg, Lisa, Kareem El-Badry, Katelyn Breivik, Ilaria Caiazzo, Pranav Nagarajan, Antonio Rodriguez, Jan Van Roestel, Zachary P. Vanderbosch, and Natsuko Yamaguchi. “The Companion Mass Distribution of Post Common Envelope Hot Subdwarf Binaries: Evidence for Boosted and Disrupted Magnetic Braking?” Publications of the Astronomical Society of the Pacific. IOP Publishing, 2024. https://doi.org/10.1088/1538-3873/ad94a2.","ista":"Blomberg L, El-Badry K, Breivik K, Caiazzo I, Nagarajan P, Rodriguez A, Van Roestel J, Vanderbosch ZP, Yamaguchi N. 2024. The companion mass distribution of post common envelope hot subdwarf binaries: Evidence for boosted and disrupted magnetic braking? Publications of the Astronomical Society of the Pacific. 136(12), 124201.","ama":"Blomberg L, El-Badry K, Breivik K, et al. The companion mass distribution of post common envelope hot subdwarf binaries: Evidence for boosted and disrupted magnetic braking? Publications of the Astronomical Society of the Pacific. 2024;136(12). doi:10.1088/1538-3873/ad94a2","mla":"Blomberg, Lisa, et al. “The Companion Mass Distribution of Post Common Envelope Hot Subdwarf Binaries: Evidence for Boosted and Disrupted Magnetic Braking?” Publications of the Astronomical Society of the Pacific, vol. 136, no. 12, 124201, IOP Publishing, 2024, doi:10.1088/1538-3873/ad94a2."},"OA_type":"hybrid","arxiv":1,"OA_place":"publisher","quality_controlled":"1","publication_identifier":{"issn":["0004-6280"]},"volume":136,"acknowledgement":"We thank the referee for their constructive comments. We also thank Jim Fuller and Stefan Geier for helpful discussions. The Kavli Institute for Theoretical Physics (KITP) hosted the program, \"White Dwarfs as Probes of the Evolution of Planets, Stars, the Milky Way, and the Expanding Universe,\" during which this project was initiated.\r\n\r\nThis research was supported in part by the U.S. National Science Foundation (NSF) grant AST-2307232, and in part by grants PHY-1748958 and AST-2107070.\r\n\r\nThis work has made use of data from the European Space Agency (ESA) mission Gaia (https://www.cosmos.esa.int/gaia), processed by the Gaia Data Processing and Analysis Consortium (DPAC, https://www.cosmos.esa.int/web/gaia/dpac/consortium). Funding for the DPAC has been provided by national institutions, in particular the institutions participating in the Gaia Multilateral Agreement.\r\n\r\nThis work is based in part on observations obtained with the Samuel Oschin 48 inch Telescope at the Palomar Observatory as part of the Zwicky Transient Facility project. ZTF is supported by the NSF under grant AST-1440341 and a collaboration including Caltech, IPAC, the Weizmann Institute for Science, the Oskar Klein Center at Stockholm University, the University of Maryland, the University of Washington, Deutsches Elektronen-Synchrotron and Humboldt University, Los Alamos National Laboratories, the TANGO Consortium of Taiwan, the University of Wisconsin at Milwaukee, and the Lawrence Berkeley National Laboratory. Operations are conducted by the Caltech Optical Observatories (COO), the Infrared Processing and Analysis Center (IPAC), and the University of Washington (UW).\r\n\r\nSome of the data presented herein were obtained at Keck Observatory, which is a private 501(c)3 non-profit organization operated as a scientific partnership among the California Institute of Technology, the University of California, and the National Aeronautics and Space Administration. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation.","article_number":"124201","ddc":["520"],"article_type":"original","publication_status":"published","author":[{"first_name":"Lisa","full_name":"Blomberg, Lisa","last_name":"Blomberg"},{"first_name":"Kareem","full_name":"El-Badry, Kareem","last_name":"El-Badry"},{"last_name":"Breivik","full_name":"Breivik, Katelyn","first_name":"Katelyn"},{"id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d","orcid":"0000-0002-4770-5388","full_name":"Caiazzo, Ilaria","first_name":"Ilaria","last_name":"Caiazzo"},{"last_name":"Nagarajan","full_name":"Nagarajan, Pranav","first_name":"Pranav"},{"first_name":"Antonio","full_name":"Rodriguez, Antonio","last_name":"Rodriguez"},{"first_name":"Jan","full_name":"Van Roestel, Jan","last_name":"Van Roestel"},{"last_name":"Vanderbosch","full_name":"Vanderbosch, Zachary P.","first_name":"Zachary P."},{"full_name":"Yamaguchi, Natsuko","first_name":"Natsuko","last_name":"Yamaguchi"}],"intvolume":" 136","oa_version":"Published Version","issue":"12","month":"12","article_processing_charge":"No","oa":1,"year":"2024"},{"month":"09","main_file_link":[{"url":"https://doi.org/10.5281/zenodo.13833474","open_access":"1"}],"oa_version":"None","article_processing_charge":"No","oa":1,"year":"2024","day":"24","date_published":"2024-09-24T00:00:00Z","ddc":["530"],"fulldoi":"https://doi.org/10.5281/ZENODO.13833474","author":[{"last_name":"Hrast","first_name":"Mateja","full_name":"Hrast, Mateja","id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d"}],"type":"research_data_reference","_id":"18716","status":"public","publisher":"Zenodo","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.5281/ZENODO.13833474","department":[{"_id":"MiLe"}],"title":"Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl","date_created":"2025-01-02T08:21:55Z","abstract":[{"lang":"eng","text":"Data for publication 10.1039/d4cp03727h"}],"corr_author":"1","citation":{"short":"M. Hrast, (2024).","apa":"Hrast, M. (2024). Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl. Zenodo. https://doi.org/10.5281/ZENODO.13833474","ieee":"M. Hrast, “Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl.” Zenodo, 2024.","chicago":"Hrast, Mateja. “Data for: Ab Initio Auger Spectrum of the Ultrafast Dissociating 2p3/2−1σ* Resonance in HCl.” Zenodo, 2024. https://doi.org/10.5281/ZENODO.13833474.","ista":"Hrast M. 2024. Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl, Zenodo, 10.5281/ZENODO.13833474.","ama":"Hrast M. Data for: Ab initio Auger spectrum of the ultrafast dissociating 2p3/2−1σ* resonance in HCl. 2024. doi:10.5281/ZENODO.13833474","mla":"Hrast, Mateja. Data for: Ab Initio Auger Spectrum of the Ultrafast Dissociating 2p3/2−1σ* Resonance in HCl. Zenodo, 2024, doi:10.5281/ZENODO.13833474."},"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"18710"}]},"date_updated":"2025-05-19T14:03:18Z"},{"type":"conference","_id":"18755","status":"public","doi":"10.1007/978-981-96-0891-1_7","publisher":"Springer Nature","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","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"},"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"}],"title":"Strongly secure universal thresholdizer","date_updated":"2025-09-09T12:00:12Z","page":"207-239","day":"12","date_published":"2024-12-12T00:00:00Z","fulldoi":"https://doi.org/10.1007/978-981-96-0891-1_7","isi":1,"language":[{"iso":"eng"}],"external_id":{"isi":["001443889100007"]},"OA_type":"green","OA_place":"repository","quality_controlled":"1","publication_identifier":{"isbn":["9789819608904"],"issn":["0302-9743"],"eissn":["1611-3349"]},"volume":15486,"acknowledgement":"Ehsan Ebrahimi is supported by the Luxembourg National Research Fund under the Junior CORE project QSP (C22/IS/17272217/QSP/Ebrahimi).","publication":"30th International Conference on the Theory and Application of Cryptology and Information Security","scopus_import":"1","department":[{"_id":"KrPi"}],"date_created":"2025-01-05T23:01:56Z","citation":{"ama":"Ebrahimi E, Yadav A. Strongly secure universal thresholdizer. In: 30th International Conference on the Theory and Application of Cryptology and Information Security. Vol 15486. Springer Nature; 2024:207-239. doi:10.1007/978-981-96-0891-1_7","mla":"Ebrahimi, Ehsan, and Anshu Yadav. “Strongly Secure Universal Thresholdizer.” 30th International Conference on the Theory and Application of Cryptology and Information Security, vol. 15486, Springer Nature, 2024, pp. 207–39, doi:10.1007/978-981-96-0891-1_7.","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.","chicago":"Ebrahimi, Ehsan, and Anshu Yadav. “Strongly Secure Universal Thresholdizer.” In 30th International Conference on the Theory and Application of Cryptology and Information Security, 15486:207–39. Springer Nature, 2024. https://doi.org/10.1007/978-981-96-0891-1_7.","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.","apa":"Ebrahimi, E., & Yadav, A. (2024). Strongly secure universal thresholdizer. In 30th International Conference on the Theory and Application of Cryptology and Information Security (Vol. 15486, pp. 207–239). Kolkata, India: Springer Nature. https://doi.org/10.1007/978-981-96-0891-1_7","ieee":"E. Ebrahimi and A. Yadav, “Strongly secure universal thresholdizer,” in 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, 2024, vol. 15486, pp. 207–239."},"intvolume":" 15486","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2024/2078"}],"oa_version":"Preprint","month":"12","article_processing_charge":"No","oa":1,"year":"2024","publication_status":"published","author":[{"first_name":"Ehsan","full_name":"Ebrahimi, Ehsan","last_name":"Ebrahimi"},{"last_name":"Yadav","id":"dc8f1524-403e-11ee-bf07-9649ad996e21","first_name":"Anshu","full_name":"Yadav, Anshu"}]},{"citation":{"mla":"Brzuska, Chris, et al. “Evasive LWE Assumptions: Definitions, Classes, and Counterexamples.” 30th International Conference on the Theory and Application of Cryptology and Information Security, vol. 15487, Springer Nature, 2024, pp. 418–49, doi:10.1007/978-981-96-0894-2_14.","ama":"Brzuska C, Ünal A, Woo IKY. Evasive LWE assumptions: Definitions, classes, and counterexamples. In: 30th International Conference on the Theory and Application of Cryptology and Information Security. Vol 15487. Springer Nature; 2024:418-449. doi:10.1007/978-981-96-0894-2_14","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.","chicago":"Brzuska, Chris, Akin Ünal, and Ivy K.Y. Woo. “Evasive LWE Assumptions: Definitions, Classes, and Counterexamples.” In 30th International Conference on the Theory and Application of Cryptology and Information Security, 15487:418–49. Springer Nature, 2024. https://doi.org/10.1007/978-981-96-0894-2_14.","ieee":"C. Brzuska, A. Ünal, and I. K. Y. Woo, “Evasive LWE assumptions: Definitions, classes, and counterexamples,” in 30th International Conference on the Theory and Application of Cryptology and Information Security, Kolkata, India, 2024, vol. 15487, pp. 418–449.","apa":"Brzuska, C., Ünal, A., & Woo, I. K. Y. (2024). Evasive LWE assumptions: Definitions, classes, and counterexamples. In 30th International Conference on the Theory and Application of Cryptology and Information Security (Vol. 15487, pp. 418–449). Kolkata, India: Springer Nature. https://doi.org/10.1007/978-981-96-0894-2_14","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."},"alternative_title":["LNCS"],"date_created":"2025-01-05T23:01:56Z","scopus_import":"1","department":[{"_id":"KrPi"}],"publication":"30th International Conference on the Theory and Application of Cryptology and Information Security","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.","publication_identifier":{"isbn":["9789819608935"],"eissn":["1611-3349"],"issn":["0302-9743"]},"volume":15487,"OA_place":"repository","quality_controlled":"1","OA_type":"green","author":[{"first_name":"Chris","full_name":"Brzuska, Chris","last_name":"Brzuska"},{"full_name":"Ünal, Akin","orcid":"0000-0002-8929-0221","first_name":"Akin","id":"f6b56fb6-dc63-11ee-9dbf-f6780863a85a","last_name":"Ünal"},{"first_name":"Ivy K.Y.","full_name":"Woo, Ivy K.Y.","last_name":"Woo"}],"publication_status":"published","year":"2024","oa":1,"article_processing_charge":"No","month":"12","intvolume":" 15487","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2024/2000"}],"oa_version":"Preprint","date_updated":"2025-09-09T12:00:51Z","page":"418-449","title":"Evasive LWE assumptions: Definitions, classes, and counterexamples","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."}],"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"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publisher":"Springer Nature","doi":"10.1007/978-981-96-0894-2_14","_id":"18756","status":"public","type":"conference","external_id":{"isi":["001443890800014"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.1007/978-981-96-0894-2_14","isi":1,"date_published":"2024-12-13T00:00:00Z","day":"13"},{"publication":"19th International Symposium on Parameterized and Exact Computation","date_created":"2025-01-05T23:01:57Z","department":[{"_id":"MaKw"}],"scopus_import":"1","has_accepted_license":"1","alternative_title":["LIPIcs"],"related_material":{"record":[{"status":"public","relation":"later_version","id":"19603"}]},"citation":{"ama":"Lill J, Petrova KH, Weber S. Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In: 19th International Symposium on Parameterized and Exact Computation. Vol 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.IPEC.2024.2","mla":"Lill, Jonas, et al. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” 19th International Symposium on Parameterized and Exact Computation, vol. 321, 2, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.IPEC.2024.2.","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.","chicago":"Lill, Jonas, Kalina H Petrova, and Simon Weber. “Linear-Time MaxCut in Multigraphs Parameterized above the Poljak-Turzík Bound.” In 19th International Symposium on Parameterized and Exact Computation, Vol. 321. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.IPEC.2024.2.","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.","ieee":"J. Lill, K. H. Petrova, and S. Weber, “Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound,” in 19th International Symposium on Parameterized and Exact Computation, Egham, United Kingdom, 2024, vol. 321.","apa":"Lill, J., Petrova, K. H., & Weber, S. (2024). Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound. In 19th International Symposium on Parameterized and Exact Computation (Vol. 321). Egham, United Kingdom: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.IPEC.2024.2"},"corr_author":"1","quality_controlled":"1","OA_place":"publisher","arxiv":1,"OA_type":"gold","volume":321,"ec_funded":1,"publication_identifier":{"isbn":["9783959773539"],"issn":["1868-8969"]},"article_number":"2","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","ddc":["500"],"author":[{"first_name":"Jonas","full_name":"Lill, Jonas","last_name":"Lill"},{"first_name":"Kalina H","full_name":"Petrova, Kalina H","id":"554ff4e4-f325-11ee-b0c4-a10dbd523381","last_name":"Petrova"},{"last_name":"Weber","first_name":"Simon","full_name":"Weber, Simon"}],"publication_status":"published","intvolume":" 321","oa_version":"Published Version","month":"12","year":"2024","oa":1,"article_processing_charge":"Yes","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"}],"file_date_updated":"2025-01-08T09:14:59Z","conference":{"end_date":"2024-09-06","start_date":"2024-09-04","location":"Egham, United Kingdom","name":"IPEC: Symposium on Parameterized and Exact Computation"},"title":"Linear-time MaxCut in multigraphs parameterized above the Poljak-Turzík bound","date_updated":"2026-01-05T13:46:07Z","_id":"18758","status":"public","type":"conference","project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"doi":"10.4230/LIPIcs.IPEC.2024.2","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","day":"05","date_published":"2024-12-05T00:00:00Z","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","file_name":"2024_LIPIcs_Lill.pdf","file_id":"18775","access_level":"open_access","creator":"dernst","success":1,"date_created":"2025-01-08T09:14:59Z","relation":"main_file","date_updated":"2025-01-08T09:14:59Z","checksum":"a64b9a0e41f7b867d25cb155825ccd53","file_size":927326}],"fulldoi":"https://doi.org/10.4230/LIPIcs.IPEC.2024.2","isi":1,"external_id":{"isi":["001534851900002"],"arxiv":["2407.01071"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"}},{"year":"2024","oa":1,"article_processing_charge":"Yes","month":"12","issue":"2","oa_version":"Published Version","intvolume":" 976","author":[{"first_name":"Erica","full_name":"Nelson, Erica","last_name":"Nelson"},{"last_name":"Brammer","full_name":"Brammer, Gabriel","first_name":"Gabriel"},{"last_name":"Giménez-Arteaga","first_name":"Clara","full_name":"Giménez-Arteaga, Clara"},{"last_name":"Oesch","first_name":"Pascal A.","full_name":"Oesch, Pascal A."},{"last_name":"Naidu","full_name":"Naidu, Rohan P.","first_name":"Rohan P."},{"full_name":"Übler, Hannah","first_name":"Hannah","last_name":"Übler"},{"full_name":"Matharu, Jasleen","first_name":"Jasleen","last_name":"Matharu"},{"last_name":"Shapley","full_name":"Shapley, Alice E.","first_name":"Alice E."},{"first_name":"Katherine E.","full_name":"Whitaker, Katherine E.","last_name":"Whitaker"},{"last_name":"Wisnioski","first_name":"Emily","full_name":"Wisnioski, Emily"},{"full_name":"Förster Schreiber, Natascha M.","first_name":"Natascha M.","last_name":"Förster Schreiber"},{"full_name":"Smit, Renske","first_name":"Renske","last_name":"Smit"},{"last_name":"Van Dokkum","first_name":"Pieter","full_name":"Van Dokkum, Pieter"},{"last_name":"Chisholm","first_name":"John","full_name":"Chisholm, John"},{"last_name":"Endsley","first_name":"Ryan","full_name":"Endsley, Ryan"},{"first_name":"Abigail I.","full_name":"Hartley, Abigail I.","last_name":"Hartley"},{"full_name":"Gibson, Justus","first_name":"Justus","last_name":"Gibson"},{"last_name":"Giovinazzo","first_name":"Emma","full_name":"Giovinazzo, Emma"},{"last_name":"Illingworth","first_name":"Garth","full_name":"Illingworth, Garth"},{"last_name":"Labbe","full_name":"Labbe, Ivo","first_name":"Ivo"},{"last_name":"Maseda","first_name":"Michael V.","full_name":"Maseda, Michael V."},{"last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","first_name":"Jorryt J"},{"first_name":"Alba","full_name":"Covelo Paz, Alba","last_name":"Covelo Paz"},{"full_name":"Price, Sedona H.","first_name":"Sedona H.","last_name":"Price"},{"full_name":"Reddy, Naveen A.","first_name":"Naveen A.","last_name":"Reddy"},{"last_name":"Shivaei","first_name":"Irene","full_name":"Shivaei, Irene"},{"last_name":"Weibel","full_name":"Weibel, Andrea","first_name":"Andrea"},{"first_name":"Stijn","full_name":"Wuyts, Stijn","last_name":"Wuyts"},{"last_name":"Xiao","full_name":"Xiao, Mengyuan","first_name":"Mengyuan"},{"first_name":"Stacey","full_name":"Alberts, Stacey","last_name":"Alberts"},{"full_name":"Baker, William M.","first_name":"William M.","last_name":"Baker"},{"last_name":"Bunker","full_name":"Bunker, Andrew J.","first_name":"Andrew J."},{"first_name":"Alex J.","full_name":"Cameron, Alex J.","last_name":"Cameron"},{"full_name":"Charlot, Stephane","first_name":"Stephane","last_name":"Charlot"},{"first_name":"Daniel J.","full_name":"Eisenstein, Daniel J.","last_name":"Eisenstein"},{"first_name":"Anna","full_name":"De Graaff, Anna","last_name":"De Graaff"},{"full_name":"Ji, Zhiyuan","first_name":"Zhiyuan","last_name":"Ji"},{"last_name":"Johnson","full_name":"Johnson, Benjamin D.","first_name":"Benjamin D."},{"last_name":"Jones","first_name":"Gareth C.","full_name":"Jones, Gareth C."},{"last_name":"Maiolino","first_name":"Roberto","full_name":"Maiolino, Roberto"},{"last_name":"Robertson","first_name":"Brant","full_name":"Robertson, Brant"},{"last_name":"Sandles","full_name":"Sandles, Lester","first_name":"Lester"},{"last_name":"Suess","first_name":"Katherine A.","full_name":"Suess, Katherine A."},{"last_name":"Tacchella","full_name":"Tacchella, Sandro","first_name":"Sandro"},{"first_name":"Christina C.","full_name":"Williams, Christina C.","last_name":"Williams"},{"last_name":"Witstok","first_name":"Joris","full_name":"Witstok, Joris"}],"publication_status":"published","article_type":"letter_note","ddc":["520"],"article_number":"L27","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).","volume":976,"publication_identifier":{"issn":["2041-8205"],"eissn":["2041-8213"]},"quality_controlled":"1","arxiv":1,"OA_place":"publisher","OA_type":"gold","citation":{"ieee":"E. Nelson et al., “Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4,” Astrophysical Journal Letters, 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. Astrophysical Journal Letters. IOP Publishing. https://doi.org/10.3847/2041-8213/ad7b17","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).","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.” Astrophysical Journal Letters. IOP Publishing, 2024. https://doi.org/10.3847/2041-8213/ad7b17.","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.","mla":"Nelson, Erica, et al. “Ionized Gas Kinematics with FRESCO: An Extended, Massive, Rapidly Rotating Galaxy at z = 5.4.” Astrophysical Journal Letters, vol. 976, no. 2, L27, IOP Publishing, 2024, doi:10.3847/2041-8213/ad7b17.","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. Astrophysical Journal Letters. 2024;976(2). doi:10.3847/2041-8213/ad7b17"},"has_accepted_license":"1","date_created":"2025-01-05T23:01:58Z","scopus_import":"1","department":[{"_id":"JoMa"}],"publication":"Astrophysical Journal Letters","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"external_id":{"isi":["001364636000001"],"arxiv":["2310.06887"]},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.3847/2041-8213/ad7b17","file":[{"access_level":"open_access","file_id":"18771","file_name":"2024_AstrophysicalJour_Nelson.pdf","content_type":"application/pdf","file_size":1822989,"date_updated":"2025-01-08T08:18:39Z","checksum":"5c7320196586b4340e55f215d8737185","relation":"main_file","date_created":"2025-01-08T08:18:39Z","success":1,"creator":"dernst"}],"isi":1,"date_published":"2024-12-01T00:00:00Z","day":"01","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","publisher":"IOP Publishing","doi":"10.3847/2041-8213/ad7b17","_id":"18760","status":"public","type":"journal_article","date_updated":"2025-09-09T11:58:02Z","title":"Ionized gas kinematics with FRESCO: An extended, massive, rapidly rotating galaxy at z = 5.4","abstract":[{"lang":"eng","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."}],"file_date_updated":"2025-01-08T08:18:39Z"},{"ddc":["510"],"article_type":"original","publication_status":"published","author":[{"id":"e796e4f9-dc8d-11ea-abe3-97e26a0323e9","first_name":"Jana","full_name":"Reker, Jana","last_name":"Reker"}],"month":"12","oa_version":"Published Version","intvolume":" 29","article_processing_charge":"Yes","oa":1,"year":"2024","scopus_import":"1","department":[{"_id":"LaEr"}],"date_created":"2025-01-05T23:01:58Z","publication":"Electronic Journal of Probability","corr_author":"1","citation":{"chicago":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” Electronic Journal of Probability. Institute of Mathematical Statistics, 2024. https://doi.org/10.1214/24-EJP1247.","apa":"Reker, J. (2024). Multi-point functional central limit theorem for Wigner matrices. Electronic Journal of Probability. Institute of Mathematical Statistics. https://doi.org/10.1214/24-EJP1247","ieee":"J. Reker, “Multi-point functional central limit theorem for Wigner matrices,” Electronic Journal of Probability, vol. 29. Institute of Mathematical Statistics, 2024.","short":"J. Reker, Electronic Journal of Probability 29 (2024).","ama":"Reker J. Multi-point functional central limit theorem for Wigner matrices. Electronic Journal of Probability. 2024;29. doi:10.1214/24-EJP1247","mla":"Reker, Jana. “Multi-Point Functional Central Limit Theorem for Wigner Matrices.” Electronic Journal of Probability, vol. 29, 191, Institute of Mathematical Statistics, 2024, doi:10.1214/24-EJP1247.","ista":"Reker J. 2024. Multi-point functional central limit theorem for Wigner matrices. Electronic Journal of Probability. 29, 191."},"related_material":{"record":[{"id":"17173","status":"public","relation":"earlier_version"}]},"has_accepted_license":"1","publication_identifier":{"eissn":["1083-6489"]},"volume":29,"ec_funded":1,"OA_type":"gold","arxiv":1,"quality_controlled":"1","OA_place":"publisher","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.","article_number":"191","date_published":"2024-12-20T00:00:00Z","day":"20","external_id":{"isi":["001381599200001"],"arxiv":["2307.11028"]},"file":[{"content_type":"application/pdf","file_name":"2024_ElectrJournProbability_Reker.pdf","access_level":"open_access","file_id":"18773","relation":"main_file","date_created":"2025-01-08T08:44:03Z","creator":"dernst","success":1,"file_size":812428,"checksum":"67178feaa8630a332599d3037a3fe70e","date_updated":"2025-01-08T08:44:03Z"}],"fulldoi":"https://doi.org/10.1214/24-EJP1247","isi":1,"language":[{"iso":"eng"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"title":"Multi-point functional central limit theorem for Wigner matrices","file_date_updated":"2025-01-08T08:44:03Z","abstract":[{"lang":"eng","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."}],"date_updated":"2025-09-09T11:59:15Z","project":[{"grant_number":"101020331","_id":"62796744-2b32-11ec-9570-940b20777f1d","call_identifier":"H2020","name":"Random matrices beyond Wigner-Dyson-Mehta"}],"type":"journal_article","status":"public","_id":"18762","publisher":"Institute of Mathematical Statistics","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","DOAJ_listed":"1","doi":"10.1214/24-EJP1247"},{"article_number":"89361","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. ","OA_place":"publisher","quality_controlled":"1","OA_type":"gold","publication_identifier":{"issn":["2050-084X"]},"volume":12,"has_accepted_license":"1","citation":{"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.” ELife. eLife Sciences Publications, 2024. https://doi.org/10.7554/elife.89361.","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,” eLife, vol. 12. eLife Sciences Publications, 2024.","apa":"Dávid, C., Giber, K., Szigeti, M. K., 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. eLife Sciences Publications. https://doi.org/10.7554/elife.89361","short":"C. Dávid, K. Giber, M.K. Szigeti, M. Köllő, Z. Nusser, L. Acsady, ELife 12 (2024).","mla":"Dávid, Csaba, et al. “A Novel Image Segmentation Method Based on Spatial Autocorrelation Identifies A-Type Potassium Channel Clusters in the Thalamus.” ELife, vol. 12, 89361, eLife Sciences Publications, 2024, doi:10.7554/elife.89361.","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. eLife. 2024;12. doi:10.7554/elife.89361","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."},"publication":"eLife","date_created":"2025-01-08T13:25:45Z","department":[{"_id":"GaNo"}],"scopus_import":"1","year":"2024","oa":1,"article_processing_charge":"Yes","oa_version":"Published Version","intvolume":" 12","month":"12","author":[{"last_name":"Dávid","first_name":"Csaba","full_name":"Dávid, Csaba"},{"last_name":"Giber","first_name":"Kristóf","full_name":"Giber, Kristóf"},{"id":"44F4BDC0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9500-8758","full_name":"Szigeti, Margit Katalin","first_name":"Margit Katalin","last_name":"Szigeti"},{"full_name":"Köllő, Mihály","first_name":"Mihály","last_name":"Köllő"},{"full_name":"Nusser, Zoltan","first_name":"Zoltan","last_name":"Nusser"},{"last_name":"Acsady","full_name":"Acsady, Laszlo","first_name":"Laszlo"}],"article_type":"original","publication_status":"published","ddc":["570"],"doi":"10.7554/elife.89361","DOAJ_listed":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"eLife Sciences Publications","status":"public","_id":"18779","type":"journal_article","date_updated":"2025-01-08T13:37:04Z","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 I 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."}],"file_date_updated":"2025-01-08T13:33:05Z","title":"A novel image segmentation method based on spatial autocorrelation identifies A-type potassium channel clusters in the thalamus","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.7554/elife.89361","file":[{"file_id":"18780","access_level":"open_access","content_type":"application/pdf","file_name":"2024_eLife_David.pdf","date_updated":"2025-01-08T13:33:05Z","checksum":"1d64265f62a3bf14550b4f5c684f1782","file_size":9992462,"creator":"dernst","success":1,"relation":"main_file","date_created":"2025-01-08T13:33:05Z"}],"date_published":"2024-12-10T00:00:00Z","day":"10"},{"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_published":"2024-09-25T00:00:00Z","day":"25","external_id":{"arxiv":["2405.17151"]},"file":[{"file_name":"2024_ICML_Cadei.pdf","content_type":"application/pdf","file_id":"18896","access_level":"open_access","success":1,"creator":"dernst","relation":"main_file","date_created":"2025-01-27T11:42:24Z","date_updated":"2025-01-27T11:42:24Z","checksum":"beedf05388bbdb7ddda81ec3d5ec7026","file_size":4453014}],"language":[{"iso":"eng"}],"type":"conference","status":"public","_id":"18847","publisher":"Curran Associates","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Smoke and mirrors in causal downstream tasks","file_date_updated":"2025-01-27T11:42:24Z","conference":{"name":"ICML: International Conference on Machine Learning","start_date":"2024-07-26","end_date":"2024-07-26"},"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."}],"date_updated":"2025-07-10T11:51:50Z","month":"09","intvolume":" 38","oa_version":"Published Version","article_processing_charge":"No","oa":1,"year":"2024","ddc":["000","570"],"publication_status":"published","author":[{"id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","full_name":"Cadei, Riccardo","first_name":"Riccardo","last_name":"Cadei"},{"id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455","first_name":"Lukas","full_name":"Lindorfer, Lukas","last_name":"Lindorfer"},{"last_name":"Cremer","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","first_name":"Sylvia","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"},{"last_name":"Schmid","first_name":"Cordelia","full_name":"Schmid, Cordelia"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","first_name":"Francesco","last_name":"Locatello"}],"volume":38,"OA_type":"gold","quality_controlled":"1","arxiv":1,"OA_place":"publisher","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.","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"scopus_import":"1","date_created":"2025-01-14T07:27:26Z","publication":"ICML 2024 Workshop AI4Science","corr_author":"1","citation":{"short":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, F. Locatello, in:, ICML 2024 Workshop AI4Science, Curran Associates, 2024.","ieee":"R. Cadei, L. Lindorfer, S. Cremer, C. Schmid, and F. Locatello, “Smoke and mirrors in causal downstream tasks,” in ICML 2024 Workshop AI4Science, 2024, vol. 38.","apa":"Cadei, R., Lindorfer, L., Cremer, S., Schmid, C., & Locatello, F. (2024). Smoke and mirrors in causal downstream tasks. In ICML 2024 Workshop AI4Science (Vol. 38). Curran Associates.","chicago":"Cadei, Riccardo, Lukas Lindorfer, Sylvia Cremer, Cordelia Schmid, and Francesco Locatello. “Smoke and Mirrors in Causal Downstream Tasks.” In ICML 2024 Workshop AI4Science, 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.","mla":"Cadei, Riccardo, et al. “Smoke and Mirrors in Causal Downstream Tasks.” ICML 2024 Workshop AI4Science, vol. 38, Curran Associates, 2024.","ama":"Cadei R, Lindorfer L, Cremer S, Schmid C, Locatello F. Smoke and mirrors in causal downstream tasks. In: ICML 2024 Workshop AI4Science. Vol 38. Curran Associates; 2024."},"related_material":{"link":[{"relation":"software","url":"https://github.com/CausalLearningAI/ISTAnt"}],"record":[{"status":"public","relation":"research_data","id":"18895"},{"relation":"is_continued_by","status":"for_moderation","id":"19509"}]},"has_accepted_license":"1"},{"quality_controlled":"1","OA_place":"publisher","OA_type":"gold","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.","publication":"Journal of Spatial Information Science","date_created":"2025-01-19T23:01:53Z","scopus_import":"1","department":[{"_id":"ChLa"}],"has_accepted_license":"1","related_material":{"link":[{"url":"https://github.com/K4TEL/geo-twitter.git","relation":"software"}]},"citation":{"mla":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” Journal of Spatial Information Science, no. 29, University of Maine, 2024, pp. 69–99, doi:10.5311/JOSIS.2024.29.295.","ama":"Lutsai K, Lampert C. Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. 2024;(29):69-99. doi:10.5311/JOSIS.2024.29.295","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.","chicago":"Lutsai, Kateryna, and Christoph Lampert. “Predicting the Geolocation of Tweets Using Transformer Models on Customized Data.” Journal of Spatial Information Science. University of Maine, 2024. https://doi.org/10.5311/JOSIS.2024.29.295.","short":"K. Lutsai, C. Lampert, Journal of Spatial Information Science (2024) 69–99.","ieee":"K. Lutsai and C. Lampert, “Predicting the geolocation of tweets using transformer models on customized data,” Journal of Spatial Information Science, no. 29. University of Maine, pp. 69–99, 2024.","apa":"Lutsai, K., & Lampert, C. (2024). Predicting the geolocation of tweets using transformer models on customized data. Journal of Spatial Information Science. University of Maine. https://doi.org/10.5311/JOSIS.2024.29.295"},"corr_author":"1","oa_version":"Published Version","issue":"29","month":"12","year":"2024","oa":1,"article_processing_charge":"Yes","ddc":["500"],"author":[{"full_name":"Lutsai, Kateryna","first_name":"Kateryna","last_name":"Lutsai"},{"first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"}],"publication_status":"published","article_type":"original","_id":"18856","status":"public","type":"journal_article","doi":"10.5311/JOSIS.2024.29.295","user_id":"68b8ca59-c5b3-11ee-8790-cd641c68093d","DOAJ_listed":"1","publisher":"University of Maine","abstract":[{"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.","lang":"eng"}],"file_date_updated":"2025-01-20T08:41:10Z","title":"Predicting the geolocation of tweets using transformer models on customized data","page":"69-99","date_updated":"2025-06-05T13:47:12Z","tmp":{"short":"CC BY (3.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/3.0/legalcode","name":"Creative Commons Attribution 3.0 Unported (CC BY 3.0)"},"day":"26","date_published":"2024-12-26T00:00:00Z","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","file_name":"2024_JourSpatialInfoScience_Lutsai.pdf","access_level":"open_access","file_id":"18857","date_created":"2025-01-20T08:41:10Z","relation":"main_file","success":1,"creator":"dernst","file_size":7250655,"date_updated":"2025-01-20T08:41:10Z","checksum":"b82413f00398ffb5168e8e747571a98d"}],"fulldoi":"https://doi.org/10.5311/JOSIS.2024.29.295"},{"oa":1,"year":"2024","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.33232/001c.117476"}],"intvolume":" 7","oa_version":"Published Version","month":"05","author":[{"first_name":"Jeremy","full_name":"Heyl, Jeremy","last_name":"Heyl"},{"full_name":"González-Caniulef, Denis","first_name":"Denis","last_name":"González-Caniulef"},{"last_name":"Caiazzo","id":"8ae5b6e7-2a03-11ee-914d-b58ed7a3b47d","first_name":"Ilaria","orcid":"0000-0002-4770-5388","full_name":"Caiazzo, Ilaria"}],"publication_status":"published","article_type":"original","arxiv":1,"quality_controlled":"1","OA_place":"publisher","OA_type":"gold","volume":7,"publication_identifier":{"issn":["2565-6120"]},"extern":"1","citation":{"ama":"Heyl J, González-Caniulef D, Caiazzo I. Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. 2024;7. doi:10.33232/001c.117476","mla":"Heyl, Jeremy, et al. “Optimal Summary Statistics for X-Ray Polarization.” The Open Journal of Astrophysics, vol. 7, Maynooth Academic Publishing, 2024, doi:10.33232/001c.117476.","ista":"Heyl J, González-Caniulef D, Caiazzo I. 2024. Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. 7.","chicago":"Heyl, Jeremy, Denis González-Caniulef, and Ilaria Caiazzo. “Optimal Summary Statistics for X-Ray Polarization.” The Open Journal of Astrophysics. Maynooth Academic Publishing, 2024. https://doi.org/10.33232/001c.117476.","apa":"Heyl, J., González-Caniulef, D., & Caiazzo, I. (2024). Optimal summary statistics for X-ray polarization. The Open Journal of Astrophysics. Maynooth Academic Publishing. https://doi.org/10.33232/001c.117476","ieee":"J. Heyl, D. González-Caniulef, and I. Caiazzo, “Optimal summary statistics for X-ray polarization,” The Open Journal of Astrophysics, vol. 7. Maynooth Academic Publishing, 2024.","short":"J. Heyl, D. González-Caniulef, I. Caiazzo, The Open Journal of Astrophysics 7 (2024)."},"publication":"The Open Journal of Astrophysics","date_created":"2025-01-21T15:54:16Z","scopus_import":"1","language":[{"iso":"eng"}],"fulldoi":"https://doi.org/10.33232/001c.117476","external_id":{"arxiv":["2311.07805"]},"day":"01","date_published":"2024-05-01T00:00:00Z","doi":"10.33232/001c.117476","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","DOAJ_listed":"1","publisher":"Maynooth Academic Publishing","_id":"18868","status":"public","type":"journal_article","date_updated":"2025-01-27T10:48:19Z","abstract":[{"lang":"eng","text":"We develop two new highly efficient estimators to measure the polarization (Stokes parameters) in experiments that constrain the position angle of individual photons such as scattering and gas-pixel-detector polarimeters, and analyse in detail a previously proposed estimator. All three of these estimators are at least fifty percent more efficient on typical datasets than the standard estimator used in the field. We present analytic estimates of the variance of these estimators and numerical experiments to verify these estimates. Two of the three estimators can be calculated quickly and directly through summations over the measurements of individual photons."}],"title":"Optimal summary statistics for X-ray polarization"},{"publication_status":"published","author":[{"full_name":"Kalinin, Nikita","first_name":"Nikita","id":"4b14526e-14d2-11ed-ba64-c14c9553d137","last_name":"Kalinin"},{"last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","first_name":"Christoph"}],"ddc":["000"],"article_processing_charge":"No","oa":1,"year":"2024","month":"12","intvolume":" 37","oa_version":"Published Version","corr_author":"1","citation":{"chicago":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024.","apa":"Kalinin, N., & Lampert, C. (2024). Banded square root matrix factorization for differentially private model training. In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"N. Kalinin and C. Lampert, “Banded square root matrix factorization for differentially private model training,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","short":"N. Kalinin, C. Lampert, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","ama":"Kalinin N, Lampert C. Banded square root matrix factorization for differentially private model training. In: 38th Annual Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024.","mla":"Kalinin, Nikita, and Christoph Lampert. “Banded Square Root Matrix Factorization for Differentially Private Model Training.” 38th Annual Conference on Neural Information Processing Systems, 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."},"alternative_title":["Advances in Neural Information Processing Systems"],"has_accepted_license":"1","scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"ChLa"}],"date_created":"2025-01-24T17:58:16Z","publication":"38th Annual Conference on Neural Information Processing Systems","publication_identifier":{"eissn":["1049-5258"]},"volume":37,"OA_type":"gold","OA_place":"publisher","arxiv":1,"quality_controlled":"1","external_id":{"arxiv":["2405.13763"]},"file":[{"content_type":"application/pdf","file_name":"2024_NeurIPS_Nikita.pdf","file_id":"18888","access_level":"open_access","success":1,"creator":"dernst","relation":"main_file","date_created":"2025-01-27T09:52:15Z","checksum":"a216cab8eddc1fe7840aede0e2c0d41e","date_updated":"2025-01-27T09:52:15Z","file_size":1144656}],"language":[{"iso":"eng"}],"day":"01","date_published":"2024-12-01T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"date_updated":"2025-05-14T11:34:20Z","title":"Banded square root matrix factorization for differentially private model training","file_date_updated":"2025-01-27T09:52:15Z","conference":{"start_date":"2024-12-16","location":"Vancouver, Canada","name":"NeurIPS: Neural Information Processing Systems","end_date":"2024-12-16"},"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"}],"publisher":"Neural Information Processing Systems Foundation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","type":"conference","status":"public","_id":"18875"},{"year":"2024","oa":1,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://openreview.net/forum?id=lJ1jdl2K9k"}],"intvolume":" 37","oa_version":"Preprint","month":"12","author":[{"full_name":"Beaglehole, Daniel","first_name":"Daniel","last_name":"Beaglehole"},{"id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","first_name":"Peter","full_name":"Súkeník, Peter","last_name":"Súkeník"},{"last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"},{"last_name":"Belkin","full_name":"Belkin, Mikhail","first_name":"Mikhail"}],"publication_status":"published","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. ","arxiv":1,"OA_place":"repository","quality_controlled":"1","OA_type":"green","volume":37,"publication_identifier":{"eissn":["1049-5258"]},"alternative_title":["Advances in Neural Information Processing Systems"],"citation":{"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.","mla":"Beaglehole, Daniel, et al. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” 38th Annual Conference on Neural Information Processing Systems, 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: 38th Annual Conference on Neural Information Processing Systems. Vol 37. Neural Information Processing Systems Foundation; 2024.","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.","apa":"Beaglehole, D., Súkeník, P., Mondelli, M., & Belkin, M. (2024). Average gradient outer product as a mechanism for deep neural collapse. In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"D. Beaglehole, P. Súkeník, M. Mondelli, and M. Belkin, “Average gradient outer product as a mechanism for deep neural collapse,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Beaglehole, Daniel, Peter Súkeník, Marco Mondelli, and Mikhail Belkin. “Average Gradient Outer Product as a Mechanism for Deep Neural Collapse.” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024."},"corr_author":"1","publication":"38th Annual Conference on Neural Information Processing Systems","date_created":"2025-01-27T11:11:40Z","scopus_import":"1","department":[{"_id":"GradSch"},{"_id":"MaMo"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["2402.13728"]},"day":"01","date_published":"2024-12-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation","status":"public","_id":"18890","type":"conference","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"date_updated":"2025-05-14T11:29:45Z","abstract":[{"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.","lang":"eng"}],"conference":{"end_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","location":"Vancouver, Canada","start_date":"2024-12-16"},"title":"Average gradient outer product as a mechanism for deep neural collapse"},{"ddc":["000"],"author":[{"first_name":"Peter","full_name":"Súkeník, Peter","id":"d64d6a8d-eb8e-11eb-b029-96fd216dec3c","last_name":"Súkeník"},{"full_name":"Lampert, Christoph","orcid":"0000-0001-8622-7887","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","last_name":"Lampert"},{"last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","first_name":"Marco","orcid":"0000-0002-3242-7020","full_name":"Mondelli, Marco"}],"publication_status":"published","month":"12","oa_version":"Published Version","intvolume":" 37","oa":1,"year":"2024","article_processing_charge":"No","date_created":"2025-01-27T11:15:18Z","department":[{"_id":"GradSch"},{"_id":"MaMo"},{"_id":"ChLa"}],"publication":"38th Annual Conference on Neural Information Processing Systems","citation":{"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.","ama":"Súkeník P, Lampert C, Mondelli M. Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In: 38th Annual Conference on Neural Information Processing Systems. 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?” 38th Annual Conference on Neural Information Processing Systems, vol. 37, Neural Information Processing Systems Foundation, 2024.","short":"P. Súkeník, C. Lampert, M. Mondelli, in:, 38th Annual Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2024.","apa":"Súkeník, P., Lampert, C., & Mondelli, M. (2024). Neural collapse versus low-rank bias: Is deep neural collapse really optimal? In 38th Annual Conference on Neural Information Processing Systems (Vol. 37). Vancouver, Canada: Neural Information Processing Systems Foundation.","ieee":"P. Súkeník, C. Lampert, and M. Mondelli, “Neural collapse versus low-rank bias: Is deep neural collapse really optimal?,” in 38th Annual Conference on Neural Information Processing Systems, Vancouver, Canada, 2024, vol. 37.","chicago":"Súkeník, Peter, Christoph Lampert, and Marco Mondelli. “Neural Collapse versus Low-Rank Bias: Is Deep Neural Collapse Really Optimal?” In 38th Annual Conference on Neural Information Processing Systems, Vol. 37. Neural Information Processing Systems Foundation, 2024."},"corr_author":"1","acknowledged_ssus":[{"_id":"ScienComp"}],"has_accepted_license":"1","alternative_title":["Advances in Neural Information Processing Systems"],"volume":37,"OA_place":"publisher","arxiv":1,"quality_controlled":"1","OA_type":"gold","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).","day":"01","date_published":"2024-12-01T00:00:00Z","external_id":{"arxiv":["2405.14468"]},"language":[{"iso":"eng"}],"file":[{"access_level":"open_access","file_id":"18989","file_name":"2024_NeurIPS_Sukenik.pdf","content_type":"application/pdf","file_size":1784118,"checksum":"b7b79f1ea3ac1e9e11b3d91faaeb0780","date_updated":"2025-02-04T08:11:25Z","date_created":"2025-02-04T08:11:25Z","relation":"main_file","success":1,"creator":"dernst"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)"},"title":"Neural collapse versus low-rank bias: Is deep neural collapse really optimal?","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."}],"conference":{"location":"Vancouver, Canada","start_date":"2024-12-16","name":"NeurIPS: Neural Information Processing Systems","end_date":"2024-12-16"},"file_date_updated":"2025-02-04T08:11:25Z","date_updated":"2025-06-04T07:19:21Z","status":"public","_id":"18891","type":"conference","project":[{"_id":"059876FA-7A3F-11EA-A408-12923DDC885E","name":"Prix Lopez-Loretta 2019 - Marco Mondelli"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation"},{"article_processing_charge":"No","oa":1,"year":"2024","month":"10","main_file_link":[{"open_access":"1","url":"https://10.6084/M9.FIGSHARE.26484934.V2"}],"oa_version":"Published Version","fulldoi":"https://doi.org/10.6084/M9.FIGSHARE.26484934.V2","author":[{"full_name":"Cadei, Riccardo","first_name":"Riccardo","id":"0fa8b76f-72f0-11ef-b75a-a5da96e5ad6b","last_name":"Cadei"},{"first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello"},{"orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia M","first_name":"Sylvia M","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","last_name":"Cremer"},{"last_name":"Lindorfer","full_name":"Lindorfer, Lukas","first_name":"Lukas","id":"85f0e6d3-06b3-11ec-8982-8c5049fa4455"},{"last_name":"Schmid","first_name":"Cordelia","full_name":"Schmid, Cordelia"}],"date_published":"2024-10-23T00:00:00Z","day":"23","ddc":["570"],"publisher":"Institute of Science and Technology Austria","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","doi":"10.6084/M9.FIGSHARE.26484934.V2","type":"research_data_reference","_id":"18895","status":"public","OA_type":"gold","OA_place":"repository","corr_author":"1","citation":{"chicago":"Cadei, Riccardo, Francesco Locatello, Sylvia Cremer, Lukas Lindorfer, and Cordelia Schmid. “ISTAnt.” Institute of Science and Technology Austria, 2024. https://doi.org/10.6084/M9.FIGSHARE.26484934.V2.","short":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, C. Schmid, (2024).","apa":"Cadei, R., Locatello, F., Cremer, S., Lindorfer, L., & Schmid, C. (2024). ISTAnt. Institute of Science and Technology Austria. https://doi.org/10.6084/M9.FIGSHARE.26484934.V2","ieee":"R. Cadei, F. Locatello, S. Cremer, L. Lindorfer, and C. Schmid, “ISTAnt.” Institute of Science and Technology Austria, 2024.","mla":"Cadei, Riccardo, et al. ISTAnt. Institute of Science and Technology Austria, 2024, doi:10.6084/M9.FIGSHARE.26484934.V2.","ama":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. ISTAnt. 2024. doi:10.6084/M9.FIGSHARE.26484934.V2","ista":"Cadei R, Locatello F, Cremer S, Lindorfer L, Schmid C. 2024. ISTAnt, Institute of Science and Technology Austria, 10.6084/M9.FIGSHARE.26484934.V2."},"related_material":{"record":[{"id":"18847","relation":"used_in_publication","status":"public"}]},"date_updated":"2025-01-27T11:58:38Z","department":[{"_id":"SyCr"},{"_id":"FrLo"},{"_id":"GradSch"}],"date_created":"2025-01-27T11:45:43Z","title":"ISTAnt","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"}]}]