[{"issue":"19","volume":17,"year":"2024","status":"public","intvolume":"        17","type":"journal_article","abstract":[{"lang":"eng","text":"High-entropy materials (HEMs) offer a quasi-continuous spectrum of active sites and have generated great expectations in fields such as electrocatalysis and energy storage. Despite their potential, the complex composition and associated surface phenomena of HEMs pose challenges to their rational design and development. In this context, we have synthesized FeCoNiPdWP high entropy phosphide (HEP) nanoparticles using a low-temperature colloidal method, and explored their application as bifunctional electrocatalysts for the oxygen evolution and reduction reactions (OER/ORR). Our analysis provides a detailed understanding of the individual roles and transformations of each element during OER/ORR operation. Notably, the HEPs exhibit an exceptionally low OER overpotential of 227 mV at 10 mA cm−2, attributed to the reconstructed HEP surface into a FeCoNiPdW high entropy oxyhydroxide with high oxidation states of Fe, Co, and Ni serving as the active sites. Additionally, Pd and W play crucial roles in modulating the electronic structure to optimize the adsorption energy of oxygen intermediates. For the ORR, Pd emerges as the most active component. In the reconstructed catalyst, the strong d–d orbital coupling of especially Pd, Co, and W fine-tunes ORR electron transfer pathways, delivering an ORR half-wave potential of 0.81 V with a pure four-electron reduction mechanism. The practicality of these HEPs catalysts is showcased through the assembly of aqueous zinc–air batteries. These batteries demonstrate a superior specific capacity of 886 mA h gZn−1 and maintain excellent stability over more than 700 hours of continuous operation. Overall, this study not only elucidates the role of each element in HEMs but also establishes a foundational framework for the design and development of next-generation bifunctional oxygen catalysts, broadening the potential applications of these complex materials in advanced energy systems."}],"title":"Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery","isi":1,"department":[{"_id":"MaIb"}],"OA_type":"closed access","article_processing_charge":"No","_id":"17897","quality_controlled":"1","page":"7193-7208","oa_version":"None","date_updated":"2025-09-08T09:15:49Z","date_published":"2024-08-22T00:00:00Z","external_id":{"isi":["001298924700001"]},"article_type":"original","doi":"10.1039/d4ee01912a","month":"08","author":[{"last_name":"He","full_name":"He, Ren","first_name":"Ren"},{"first_name":"Shiqi","full_name":"Wang, Shiqi","last_name":"Wang"},{"full_name":"Yang, Linlin","last_name":"Yang","first_name":"Linlin"},{"last_name":"Horta","full_name":"Horta, Sharona","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc"},{"full_name":"Ding, Yang","last_name":"Ding","first_name":"Yang"},{"full_name":"Di, Chong","last_name":"Di","first_name":"Chong"},{"first_name":"Xuesong","full_name":"Zhang, Xuesong","last_name":"Zhang"},{"first_name":"Ying","full_name":"Xu, Ying","last_name":"Xu"},{"first_name":"Maria","full_name":"Ibáñez, Maria","last_name":"Ibáñez","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zhou, Yingtang","last_name":"Zhou","first_name":"Yingtang"},{"last_name":"Mebs","full_name":"Mebs, Stefan","first_name":"Stefan"},{"first_name":"Holger","full_name":"Dau, Holger","last_name":"Dau"},{"full_name":"Hausmann, Jan Niklas","last_name":"Hausmann","first_name":"Jan Niklas"},{"first_name":"Wenyi","full_name":"Huo, Wenyi","last_name":"Huo"},{"first_name":"Prashanth W.","full_name":"Menezes, Prashanth W.","last_name":"Menezes"},{"first_name":"Andreu","last_name":"Cabot","full_name":"Cabot, Andreu"}],"publication":"Energy and Environmental Science","date_created":"2024-09-08T22:01:13Z","acknowledgement":"This work was financially supported by the SyDEC at project from the Spanish MCIN/AEI/FEDER (PID2022-136883OB-C22) and Generalitat de Catalunya 2021SGR01581. J. N. H. and P. W. M. acknowledge support from the German Federal Ministry of Education and Research in the framework of the project “Catlab” (03EW0015A/B). L. Yang thanks the China Scholarship Council (CSC) for the scholarship support (202008130132). This work was supported by the European Union Horizon 2020 research and innovation program (No. 857470) and the European Regional Development Fund via the Foundation for Polish Science International Research Agenda PLUS program (No. MAB PLUS/2018/8). The publication was created within the framework of the project of the Minister of Science and Higher Education, Poland “Support for the activities of Centres of Excellence established in Poland under Horizon 2020” under contract no. MEiN/2023/DIR/3795. H. D. and S. M. thank the German Federal Ministry of Education and Research (BMBF) for supporting the Live-XAS project (05K22KE1) and the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) for support under Germany's Excellence Strategy – EXC 2008/1 – 390540038 – UniSysCat. The authors thank the Helmholtz-Zentrum Berlin (HZB) for beamtime allocation at the KMC-3 synchrotron beamline of the BESSY synchrotron in Berlin-Adlershof and Dr Ivo Zizak as well as Dr Michael Haumann for technical support.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ieee":"R. He <i>et al.</i>, “Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery,” <i>Energy and Environmental Science</i>, vol. 17, no. 19. Royal Society of Chemistry, pp. 7193–7208, 2024.","ista":"He R, Wang S, Yang L, Horta S, Ding Y, Di C, Zhang X, Xu Y, Ibáñez M, Zhou Y, Mebs S, Dau H, Hausmann JN, Huo W, Menezes PW, Cabot A. 2024. Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery. Energy and Environmental Science. 17(19), 7193–7208.","chicago":"He, Ren, Shiqi Wang, Linlin Yang, Sharona Horta, Yang Ding, Chong Di, Xuesong Zhang, et al. “Active Site Switching on High Entropy Phosphides as Bifunctional Oxygen Electrocatalysts for Rechargeable/Robust Zn-Air Battery.” <i>Energy and Environmental Science</i>. Royal Society of Chemistry, 2024. <a href=\"https://doi.org/10.1039/d4ee01912a\">https://doi.org/10.1039/d4ee01912a</a>.","short":"R. He, S. Wang, L. Yang, S. Horta, Y. Ding, C. Di, X. Zhang, Y. Xu, M. Ibáñez, Y. Zhou, S. Mebs, H. Dau, J.N. Hausmann, W. Huo, P.W. Menezes, A. Cabot, Energy and Environmental Science 17 (2024) 7193–7208.","ama":"He R, Wang S, Yang L, et al. Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery. <i>Energy and Environmental Science</i>. 2024;17(19):7193-7208. doi:<a href=\"https://doi.org/10.1039/d4ee01912a\">10.1039/d4ee01912a</a>","apa":"He, R., Wang, S., Yang, L., Horta, S., Ding, Y., Di, C., … Cabot, A. (2024). Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery. <i>Energy and Environmental Science</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/d4ee01912a\">https://doi.org/10.1039/d4ee01912a</a>","mla":"He, Ren, et al. “Active Site Switching on High Entropy Phosphides as Bifunctional Oxygen Electrocatalysts for Rechargeable/Robust Zn-Air Battery.” <i>Energy and Environmental Science</i>, vol. 17, no. 19, Royal Society of Chemistry, 2024, pp. 7193–208, doi:<a href=\"https://doi.org/10.1039/d4ee01912a\">10.1039/d4ee01912a</a>."},"publication_identifier":{"issn":["1754-5692"],"eissn":["1754-5706"]},"scopus_import":"1","language":[{"iso":"eng"}],"day":"22","publisher":"Royal Society of Chemistry","publication_status":"published"},{"ec_funded":1,"year":"2024","status":"public","title":"Overparametrization helps offline-to-online generalization of closed-loop control from pixels","abstract":[{"lang":"eng","text":"There is an ever-growing zoo of modern neural network models that can efficiently learn end-to-end control from visual observations. These advanced deep models, ranging from convolutional to Vision Transformers, from small to gigantic networks, have been extensively tested on offline image classification tasks. In this paper, we study these vision models with respect to the open-loop training to closed-loop generalization abilities, i.e., deployment realizes a causal feedback loop that is not present during training. This causality gap typically emerges in robotics applications such as autonomous driving, where a network is trained to imitate the control commands of a human. In this setting, two situations arise: 1) Closed-loop testing in-distribution, where the test environment shares properties with those of offline training data. 2) Closed-loop testing under distribution shifts and out-of-distribution. Contrary to recently reported results, we show that under proper training guidelines, all vision architectures perform indistinguishably well on in-distribution deployment, resolving the causality gap. In situation 2, We observe that scale is the strongest factor in improving closed-loop generalization regardless of the choice of the model architecture. Our results predict the trend that in the future we will see larger and larger models being used in offline-training-online-deployment imitation learning tasks in robotic applications."}],"type":"conference","department":[{"_id":"ToHe"}],"isi":1,"article_processing_charge":"No","page":"2774-2782","quality_controlled":"1","_id":"17898","date_published":"2024-08-08T00:00:00Z","date_updated":"2025-09-08T09:16:28Z","oa_version":"None","external_id":{"isi":["001294576202044"]},"month":"08","doi":"10.1109/ICRA57147.2024.10610284","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","last_name":"Lechner","id":"3DC22916-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"first_name":"Alexander","full_name":"Amini, Alexander","last_name":"Amini"},{"last_name":"Wang","full_name":"Wang, Tsun Hsuan","first_name":"Tsun Hsuan"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"first_name":"Daniela","last_name":"Rus","full_name":"Rus, Daniela"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"This work was partially supported in parts by the ERC-2020-AdG 101020093. Additionally, it was partially sponsored by the United States Air Force Research Laboratory and the United States Air Force Artificial Intelligence Accelerator and was accomplished under Cooperative Agreement Number FA8750-19-2-1000. The views and conclusions contained in this document are those of the authors and should not be interpreted as representing the official policies, either expressed or implied, of the United States Air Force or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes notwithstanding any copyright notation herein. This work was further supported by The Boeing Company and the Office of Naval Research (ONR) Grant N00014-18-1-2830.","date_created":"2024-09-08T22:01:13Z","publication":"Proceedings of the 2024 IEEE International Conference on Robotics and Automation","citation":{"apa":"Lechner, M., Hasani, R., Amini, A., Wang, T. H., Henzinger, T. A., &#38; Rus, D. (2024). Overparametrization helps offline-to-online generalization of closed-loop control from pixels. In <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i> (pp. 2774–2782). Yokohama, Japan: Institute of Electrical and Electronics Engineers. <a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">https://doi.org/10.1109/ICRA57147.2024.10610284</a>","chicago":"Lechner, Mathias, Ramin Hasani, Alexander Amini, Tsun Hsuan Wang, Thomas A Henzinger, and Daniela Rus. “Overparametrization Helps Offline-to-Online Generalization of Closed-Loop Control from Pixels.” In <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, 2774–82. Institute of Electrical and Electronics Engineers, 2024. <a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">https://doi.org/10.1109/ICRA57147.2024.10610284</a>.","short":"M. Lechner, R. Hasani, A. Amini, T.H. Wang, T.A. Henzinger, D. Rus, in:, Proceedings of the 2024 IEEE International Conference on Robotics and Automation, Institute of Electrical and Electronics Engineers, 2024, pp. 2774–2782.","ista":"Lechner M, Hasani R, Amini A, Wang TH, Henzinger TA, Rus D. 2024. Overparametrization helps offline-to-online generalization of closed-loop control from pixels. Proceedings of the 2024 IEEE International Conference on Robotics and Automation. ICRA: International Conference on Robotics and Automation, 2774–2782.","ama":"Lechner M, Hasani R, Amini A, Wang TH, Henzinger TA, Rus D. Overparametrization helps offline-to-online generalization of closed-loop control from pixels. In: <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>. Institute of Electrical and Electronics Engineers; 2024:2774-2782. doi:<a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">10.1109/ICRA57147.2024.10610284</a>","ieee":"M. Lechner, R. Hasani, A. Amini, T. H. Wang, T. A. Henzinger, and D. Rus, “Overparametrization helps offline-to-online generalization of closed-loop control from pixels,” in <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, Yokohama, Japan, 2024, pp. 2774–2782.","mla":"Lechner, Mathias, et al. “Overparametrization Helps Offline-to-Online Generalization of Closed-Loop Control from Pixels.” <i>Proceedings of the 2024 IEEE International Conference on Robotics and Automation</i>, Institute of Electrical and Electronics Engineers, 2024, pp. 2774–82, doi:<a href=\"https://doi.org/10.1109/ICRA57147.2024.10610284\">10.1109/ICRA57147.2024.10610284</a>."},"project":[{"call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"}],"day":"08","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"isbn":["9798350384574"],"issn":["1050-4729"]},"publisher":"Institute of Electrical and Electronics Engineers","publication_status":"published","conference":{"location":"Yokohama, Japan","start_date":"2024-05-13","end_date":"2024-05-17","name":"ICRA: International Conference on Robotics and Automation"}},{"quality_controlled":"1","_id":"18052","page":"123-137","edition":"1","acknowledged_ssus":[{"_id":"EM-Fac"}],"article_processing_charge":"No","department":[{"_id":"EM-Fac"},{"_id":"RySh"}],"alternative_title":["Neuromethods"],"type":"book_chapter","title":"Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning","abstract":[{"lang":"eng","text":"Sodium dodecyl sulfate-digested freeze-fracture replica labeling (SDS-FRL) is an electron microscope (EM) sample preparation technique which allows for high-resolution visualization of membrane proteins with high sensitivity. However, image acquisition of specific replica profiles such as synapses in a large field of EM view needs a valid experience and a long time for manual searching. Here, we describe how to utilize deep learning for automatizing image acquisition of specific profiles of interest in replica samples. This protocol facilitates the labor-intensive collection of EM images, in particular for rare profiles. We provide instructions for using SerialEM image acquisition software in conjunction with object detection by our newly developed deep learning software DarEM, to automatically acquire tilt series of all synapses in a selected region. We then show how to perform a mostly automated analysis of gold particle labeling in the acquired images by utilizing Darea software."}],"status":"public","year":"2024","ec_funded":1,"publisher":"Springer Nature","publication_status":"published","publication_identifier":{"isbn":["9781071640180"],"eisbn":["9781071640197"],"issn":["0893-2336"],"eissn":["1940-6045"]},"day":"27","project":[{"name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","_id":"25CA28EA-B435-11E9-9278-68D0E5697425","grant_number":"694539","call_identifier":"H2020"}],"scopus_import":"1","language":[{"iso":"eng"}],"citation":{"apa":"Kleindienst, D., Costanzo, T., &#38; Shigemoto, R. (2024). Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning. In J. H. R. Lübke &#38; A. Rollenhagen (Eds.), <i>New Aspects in Analyzing the Synaptic Organization of the Brain</i> (1st ed., pp. 123–137). New York: Springer Nature. <a href=\"https://doi.org/10.1007/978-1-0716-4019-7_8\">https://doi.org/10.1007/978-1-0716-4019-7_8</a>","chicago":"Kleindienst, David, Tommaso Costanzo, and Ryuichi Shigemoto. “Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning.” In <i>New Aspects in Analyzing the Synaptic Organization of the Brain</i>, edited by Joachim H.R.  Lübke and Astrid Rollenhagen, 1st ed., 123–37. New York: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-1-0716-4019-7_8\">https://doi.org/10.1007/978-1-0716-4019-7_8</a>.","ista":"Kleindienst D, Costanzo T, Shigemoto R. 2024.Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning. In: New Aspects in Analyzing the Synaptic Organization of the Brain. Neuromethods, , 123–137.","ama":"Kleindienst D, Costanzo T, Shigemoto R. Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning. In: Lübke JHR, Rollenhagen A, eds. <i>New Aspects in Analyzing the Synaptic Organization of the Brain</i>. 1st ed. New York: Springer Nature; 2024:123-137. doi:<a href=\"https://doi.org/10.1007/978-1-0716-4019-7_8\">10.1007/978-1-0716-4019-7_8</a>","short":"D. Kleindienst, T. Costanzo, R. Shigemoto, in:, J.H.R. Lübke, A. Rollenhagen (Eds.), New Aspects in Analyzing the Synaptic Organization of the Brain, 1st ed., Springer Nature, New York, 2024, pp. 123–137.","ieee":"D. Kleindienst, T. Costanzo, and R. Shigemoto, “Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning,” in <i>New Aspects in Analyzing the Synaptic Organization of the Brain</i>, 1st ed., J. H. R. Lübke and A. Rollenhagen, Eds. New York: Springer Nature, 2024, pp. 123–137.","mla":"Kleindienst, David, et al. “Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning.” <i>New Aspects in Analyzing the Synaptic Organization of the Brain</i>, edited by Joachim H.R.  Lübke and Astrid Rollenhagen, 1st ed., Springer Nature, 2024, pp. 123–37, doi:<a href=\"https://doi.org/10.1007/978-1-0716-4019-7_8\">10.1007/978-1-0716-4019-7_8</a>."},"date_created":"2024-09-10T12:32:38Z","publication":"New Aspects in Analyzing the Synaptic Organization of the Brain","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This research was supported by the European Research Council Advanced Grant 694539 to RS and by the Scientific Service Units of IST Austria through resources provided by the Electron Microscopy Facility.","editor":[{"full_name":"Lübke, Joachim H.R. ","last_name":"Lübke","first_name":"Joachim H.R. "},{"last_name":"Rollenhagen","full_name":"Rollenhagen, Astrid","first_name":"Astrid"}],"author":[{"last_name":"Kleindienst","full_name":"Kleindienst, David","first_name":"David","id":"42E121A4-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-9732-3815","id":"D93824F4-D9BA-11E9-BB12-F207E6697425","first_name":"Tommaso","full_name":"Costanzo, Tommaso","last_name":"Costanzo"},{"orcid":"0000-0001-8761-9444","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto"}],"doi":"10.1007/978-1-0716-4019-7_8","month":"08","corr_author":"1","place":"New York","date_updated":"2025-04-14T07:27:15Z","oa_version":"None","date_published":"2024-08-27T00:00:00Z"},{"year":"2024","doi":"10.1201/9781003055211-8","month":"09","editor":[{"first_name":"Dongyou","full_name":"Liu, Dongyou","last_name":"Liu"}],"status":"public","author":[{"orcid":"0000-0002-8698-3823","id":"63836096-4690-11EA-BD4E-32803DDC885E","first_name":"Jake","last_name":"Watson","full_name":"Watson, Jake"},{"first_name":"Sandra","full_name":"Arroyo-Urea, Sandra","last_name":"Arroyo-Urea"},{"first_name":"Javier","last_name":"García-Nafría","full_name":"García-Nafría, Javier"}],"oa_version":"None","date_updated":"2024-09-11T11:16:58Z","date_published":"2024-09-05T00:00:00Z","place":"Boca Raton","publication_identifier":{"eisbn":["9781003055211"]},"language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","day":"05","_id":"18058","publication_status":"published","publisher":"CRC Press","quality_controlled":"1","edition":"1","page":"66-72","type":"book_chapter","publication":"Handbook of Molecular Biotechnology","date_created":"2024-09-11T10:40:36Z","abstract":[{"lang":"eng","text":"DNA cloning is a core technique in biomedical and biotechnological research and is used to assemble and modify DNA fragments at will. While DNA cloning has traditionally relied on restriction enzymes, recent homology-based methods offer improved protocols together with seamless and directional assembly of desired products, overcoming the main disadvantages of restriction enzyme DNA cloning. This chapter provides a historical perspective on DNA cloning, presents a detailed discussion on state-of-the-art in vitro and in vivo homology-based methodologies, covering the basics of how to perform all major plasmid modifications (sub-cloning, site-directed mutagenesis, insertions, and deletions), and gives examples of how to apply these techniques for complex DNA cloning projects."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"DNA Cloning","department":[{"_id":"PeJo"}],"citation":{"mla":"Watson, Jake, et al. “DNA Cloning.” <i>Handbook of Molecular Biotechnology</i>, edited by Dongyou Liu, 1st ed., CRC Press, 2024, pp. 66–72, doi:<a href=\"https://doi.org/10.1201/9781003055211-8\">10.1201/9781003055211-8</a>.","apa":"Watson, J., Arroyo-Urea, S., &#38; García-Nafría, J. (2024). DNA Cloning. In D. Liu (Ed.), <i>Handbook of Molecular Biotechnology</i> (1st ed., pp. 66–72). Boca Raton: CRC Press. <a href=\"https://doi.org/10.1201/9781003055211-8\">https://doi.org/10.1201/9781003055211-8</a>","short":"J. Watson, S. Arroyo-Urea, J. García-Nafría, in:, D. Liu (Ed.), Handbook of Molecular Biotechnology, 1st ed., CRC Press, Boca Raton, 2024, pp. 66–72.","ista":"Watson J, Arroyo-Urea S, García-Nafría J. 2024.DNA Cloning. In: Handbook of Molecular Biotechnology. , 66–72.","chicago":"Watson, Jake, Sandra Arroyo-Urea, and Javier García-Nafría. “DNA Cloning.” In <i>Handbook of Molecular Biotechnology</i>, edited by Dongyou Liu, 1st ed., 66–72. Boca Raton: CRC Press, 2024. <a href=\"https://doi.org/10.1201/9781003055211-8\">https://doi.org/10.1201/9781003055211-8</a>.","ama":"Watson J, Arroyo-Urea S, García-Nafría J. DNA Cloning. In: Liu D, ed. <i>Handbook of Molecular Biotechnology</i>. 1st ed. Boca Raton: CRC Press; 2024:66-72. doi:<a href=\"https://doi.org/10.1201/9781003055211-8\">10.1201/9781003055211-8</a>","ieee":"J. Watson, S. Arroyo-Urea, and J. García-Nafría, “DNA Cloning,” in <i>Handbook of Molecular Biotechnology</i>, 1st ed., D. Liu, Ed. Boca Raton: CRC Press, 2024, pp. 66–72."}},{"pmid":1,"file_date_updated":"2024-09-17T09:44:29Z","volume":7,"has_accepted_license":"1","file":[{"date_created":"2024-09-17T09:44:29Z","date_updated":"2024-09-17T09:44:29Z","creator":"dernst","content_type":"application/pdf","relation":"main_file","file_name":"2024_CommBiology_Peng.pdf","success":1,"checksum":"7d66af41c90e73d1b8a375eb652a9561","access_level":"open_access","file_id":"18084","file_size":7718758}],"status":"public","intvolume":"         7","year":"2024","related_material":{"record":[{"status":"public","id":"20117","relation":"dissertation_contains"}]},"department":[{"_id":"EvBe"},{"_id":"JiFr"}],"isi":1,"title":"Polarly localized Bro1 domain proteins regulate PIN-FORMED abundance and root gravitropic growth in Arabidopsis","abstract":[{"lang":"eng","text":"The developmental plasticity of the root system plays an essential role in the adaptation of plants to the environment. Among many other signals, auxin and its directional, intercellular transport are critical in regulating root growth and development. In particular, the PIN-FORMED2 (PIN2) auxin exporter acts as a key regulator of root gravitropic growth. Multiple regulators have been reported to be involved in PIN2-mediated root growth; however, our information remains incomplete. Here, we identified ROWY Bro1-domain proteins as important regulators of PIN2 sorting control. Genetic analysis revealed that Arabidopsis rowy1 single mutants and higher-order rowy1 rowy2 rowy3 triple mutants presented a wavy root growth phenotype. Cell biological experiments revealed that ROWY1 and PIN2 colocalized to the apical side of the plasma membrane in the root epidermis and that ROWYs are required for correct PM targeting of PIN2. In addition, ROWYs also affected PIN3 protein abundance in the stele, suggesting the potential involvement of additional PIN transporters as well as other proteins. A global transcriptome analysis revealed that ROWY genes are involved in the Fe2+ availability perception pathway. This work establishes ROWYs as important novel regulators of root gravitropic growth by connecting micronutrient availability to the proper subcellular targeting of PIN auxin transporters."}],"type":"journal_article","quality_controlled":"1","_id":"18063","article_processing_charge":"Yes","external_id":{"isi":["001306499600002"],"pmid":["39232040"]},"article_number":"1085","date_published":"2024-09-04T00:00:00Z","date_updated":"2026-04-07T11:49:33Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","author":[{"last_name":"Peng","full_name":"Peng, Yakun","first_name":"Yakun"},{"last_name":"Ji","full_name":"Ji, Kangkang","first_name":"Kangkang"},{"first_name":"Yanbo","last_name":"Mao","full_name":"Mao, Yanbo"},{"first_name":"Yiqun","full_name":"Wang, Yiqun","last_name":"Wang","id":"82F537F2-B517-11E9-84D7-6433E6697425"},{"last_name":"Korbei","full_name":"Korbei, Barbara","first_name":"Barbara"},{"first_name":"Christian","last_name":"Luschnig","full_name":"Luschnig, Christian"},{"first_name":"Jinbo","full_name":"Shen, Jinbo","last_name":"Shen"},{"first_name":"Eva","full_name":"Benková, Eva","last_name":"Benková","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Friml","full_name":"Friml, Jiří","first_name":"Jiří","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"},{"orcid":"0000-0002-0471-8285","id":"2DE75584-F248-11E8-B48F-1D18A9856A87","first_name":"Shutang","full_name":"Tan, Shutang","last_name":"Tan"}],"license":"https://creativecommons.org/licenses/by/4.0/","ddc":["570"],"oa":1,"month":"09","doi":"10.1038/s42003-024-06747-9","article_type":"original","citation":{"apa":"Peng, Y., Ji, K., Mao, Y., Wang, Y., Korbei, B., Luschnig, C., … Tan, S. (2024). Polarly localized Bro1 domain proteins regulate PIN-FORMED abundance and root gravitropic growth in Arabidopsis. <i>Communications Biology</i>. Springer Nature. <a href=\"https://doi.org/10.1038/s42003-024-06747-9\">https://doi.org/10.1038/s42003-024-06747-9</a>","ieee":"Y. Peng <i>et al.</i>, “Polarly localized Bro1 domain proteins regulate PIN-FORMED abundance and root gravitropic growth in Arabidopsis,” <i>Communications Biology</i>, vol. 7. Springer Nature, 2024.","chicago":"Peng, Yakun, Kangkang Ji, Yanbo Mao, Yiqun Wang, Barbara Korbei, Christian Luschnig, Jinbo Shen, Eva Benková, Jiří Friml, and Shutang Tan. “Polarly Localized Bro1 Domain Proteins Regulate PIN-FORMED Abundance and Root Gravitropic Growth in Arabidopsis.” <i>Communications Biology</i>. Springer Nature, 2024. <a href=\"https://doi.org/10.1038/s42003-024-06747-9\">https://doi.org/10.1038/s42003-024-06747-9</a>.","short":"Y. Peng, K. Ji, Y. Mao, Y. Wang, B. Korbei, C. Luschnig, J. Shen, E. Benková, J. Friml, S. Tan, Communications Biology 7 (2024).","ista":"Peng Y, Ji K, Mao Y, Wang Y, Korbei B, Luschnig C, Shen J, Benková E, Friml J, Tan S. 2024. Polarly localized Bro1 domain proteins regulate PIN-FORMED abundance and root gravitropic growth in Arabidopsis. Communications Biology. 7, 1085.","ama":"Peng Y, Ji K, Mao Y, et al. Polarly localized Bro1 domain proteins regulate PIN-FORMED abundance and root gravitropic growth in Arabidopsis. <i>Communications Biology</i>. 2024;7. doi:<a href=\"https://doi.org/10.1038/s42003-024-06747-9\">10.1038/s42003-024-06747-9</a>","mla":"Peng, Yakun, et al. “Polarly Localized Bro1 Domain Proteins Regulate PIN-FORMED Abundance and Root Gravitropic Growth in Arabidopsis.” <i>Communications Biology</i>, vol. 7, 1085, Springer Nature, 2024, doi:<a href=\"https://doi.org/10.1038/s42003-024-06747-9\">10.1038/s42003-024-06747-9</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"We thank Drs. Erika Isono (University of Constance), Grégory Vert (University of Toulouse), and Liwen Jiang (The Chinese University of Hong Kong) for kindly sharing published Arabidopsis lines; Dr. Yuzhou Zhang (ISTA) for help with molecular cloning, and Drs. Melinda Abas (BOKU), Eugenia Russinova (Ghent University), and Zhaojun Ding (Shandong University) for valuable discussions. This work was supported by grants to S.T. from the National Natural Science Foundation of China (32321001), the USTC Research Funds of the Double First-Class Initiative (YD9100002016), the Research Funds from the Center for Advanced Interdisciplinary Science and Biomedicine of IHM, the Division of Life Sciences and Medicine, the University of Science and Technology of China (QYPY20220012), the Fundamental Research Funds for the Central Universities (WK9100000021), and start-up funding from the University of Science and Technology of China and the Chinese Academy of Sciences (GG9100007007, KY9100000026, KY9100000051, and KJ2070000079). J.S. was supported by the National Natural Science Foundation of China (31970181 and 32170342). J.F. was supported by Austrian Science Fund (FWF; projects I6123 and P37051-B).","date_created":"2024-09-15T22:01:38Z","publication":"Communications Biology","publication_status":"published","publisher":"Springer Nature","project":[{"_id":"bd76d395-d553-11ed-ba76-f678c14f9033","name":"Peptide receptors for auxin canalization in Arabidopsis","grant_number":"I06123"},{"grant_number":"P37051","name":"Guanylate cyclase activity of TIR1/AFBs auxin receptors","_id":"7bcece63-9f16-11ee-852c-ae94e099eeb6"}],"day":"04","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["2399-3642"]}},{"external_id":{"arxiv":["2311.17537"],"isi":["001315306500001"]},"article_number":"109943","date_published":"2024-11-01T00:00:00Z","date_updated":"2025-09-08T09:44:19Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"author":[{"full_name":"Hou, Xuanji","last_name":"Hou","first_name":"Xuanji"},{"id":"1e21c7f7-9070-11eb-847d-8b04c7169523","last_name":"Pan","full_name":"Pan, Yi","first_name":"Yi"},{"full_name":"Zhou, Qi","last_name":"Zhou","first_name":"Qi"}],"oa":1,"ddc":["510"],"corr_author":"1","month":"11","doi":"10.1016/j.aim.2024.109943","OA_place":"publisher","article_type":"original","citation":{"apa":"Hou, X., Pan, Y., &#38; Zhou, Q. (2024). Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. <i>Advances in Mathematics</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.aim.2024.109943\">https://doi.org/10.1016/j.aim.2024.109943</a>","ieee":"X. Hou, Y. Pan, and Q. Zhou, “Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles,” <i>Advances in Mathematics</i>, vol. 457. Elsevier, 2024.","ista":"Hou X, Pan Y, Zhou Q. 2024. Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. 457, 109943.","short":"X. Hou, Y. Pan, Q. Zhou, Advances in Mathematics 457 (2024).","chicago":"Hou, Xuanji, Yi Pan, and Qi Zhou. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>. Elsevier, 2024. <a href=\"https://doi.org/10.1016/j.aim.2024.109943\">https://doi.org/10.1016/j.aim.2024.109943</a>.","ama":"Hou X, Pan Y, Zhou Q. Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. <i>Advances in Mathematics</i>. 2024;457. doi:<a href=\"https://doi.org/10.1016/j.aim.2024.109943\">10.1016/j.aim.2024.109943</a>","mla":"Hou, Xuanji, et al. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” <i>Advances in Mathematics</i>, vol. 457, 109943, Elsevier, 2024, doi:<a href=\"https://doi.org/10.1016/j.aim.2024.109943\">10.1016/j.aim.2024.109943</a>."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"X. Hou is partially supported by National Natural Science Foundation of China (Grant \r\n12071083) and Funds for Distinguished Youths of Hubei Province of China (\r\n2019CFA680). Y. Pan is supported by ERC Advanced Grant (#885707). Q. Zhou is partially supported by National Key R&D Program of China (2020YFA0713300), NSFC grant (\r\n12071232) and Nankai Zhide Foundation.","date_created":"2024-09-15T22:01:39Z","publication":"Advances in Mathematics","publisher":"Elsevier","publication_status":"published","project":[{"grant_number":"885707","name":"Spectral rigidity and integrability for billiards and geodesic flows","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A","call_identifier":"H2020"}],"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"arxiv":1,"publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"file_date_updated":"2025-01-13T08:29:27Z","has_accepted_license":"1","volume":457,"file":[{"file_size":713659,"file_id":"18826","access_level":"open_access","checksum":"1c80b844a91d93cf4799f4a65873b18d","success":1,"file_name":"2024_AdvancesMath_Hou.pdf","relation":"main_file","content_type":"application/pdf","creator":"dernst","date_created":"2025-01-13T08:29:27Z","date_updated":"2025-01-13T08:29:27Z"}],"status":"public","intvolume":"       457","ec_funded":1,"year":"2024","department":[{"_id":"VaKa"}],"isi":1,"title":"Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles","abstract":[{"text":"We establish a close connection between acceleration and dynamical degree for one-frequency quasi-periodic compact cocycles, by showing that two vectors derived separately from each coincide. Based on this, we provide a dynamical classification of one-frequency quasi-periodic  SO(3, R)-cocycles.","lang":"eng"}],"type":"journal_article","quality_controlled":"1","_id":"18065","article_processing_charge":"Yes (via OA deal)","OA_type":"hybrid"},{"quality_controlled":"1","_id":"18066","article_processing_charge":"Yes","department":[{"_id":"ToHe"}],"isi":1,"alternative_title":["LIPIcs"],"type":"conference","title":"Bidding games with charging","abstract":[{"lang":"eng","text":"Graph games lie at the algorithmic core of many automated design problems in computer science. These are games usually played between two players on a given graph, where the players keep moving a token along the edges according to pre-determined rules (turn-based, concurrent, etc.), and the winner is decided based on the infinite path (aka play) traversed by the token from a given initial position. In bidding games, the players initially get some monetary budgets which they need to use to bid for the privilege of moving the token at each step. Each round of bidding affects the players' available budgets, which is the only form of update that the budgets experience. We introduce bidding games with charging where the players can additionally improve their budgets during the game by collecting vertex-dependent monetary rewards, aka the \"charges.\" Unlike traditional bidding games (where all charges are zero), bidding games with charging allow non-trivial recurrent behaviors. For example, a reachability objective may require multiple detours to vertices with high charges to earn additional budget. We show that, nonetheless, the central property of traditional bidding games generalizes to bidding games with charging: For each vertex there exists a threshold ratio, which is the necessary and sufficient fraction of the total budget for winning the game from that vertex. While the thresholds of traditional bidding games correspond to unique fixed points of linear systems of equations, in games with charging, these fixed points are no longer unique. This significantly complicates the proof of existence and the algorithmic computation of thresholds for infinite-duration objectives. We also provide the lower complexity bounds for computing thresholds for Rabin and Streett objectives, which are the first known lower bounds in any form of bidding games (with or without charging), and we solve the following repair problem for safety and reachability games that have unsatisfiable objectives: Can we distribute a given amount of charge to the players in a way such that the objective can be satisfied?"}],"file":[{"content_type":"application/pdf","date_created":"2024-09-17T09:35:03Z","date_updated":"2024-09-17T09:35:03Z","creator":"dernst","relation":"main_file","file_name":"2024_LIPICS_Avni.pdf","success":1,"checksum":"cb6f2254b84922cd7bf224f550b73f4a","access_level":"open_access","file_id":"18083","file_size":854430}],"status":"public","intvolume":"       311","year":"2024","ec_funded":1,"file_date_updated":"2024-09-17T09:35:03Z","volume":311,"has_accepted_license":"1","publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"start_date":"2024-09-09","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory","location":"Calgary, Canada"},"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"arxiv":1,"day":"01","project":[{"name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093","call_identifier":"H2020"},{"call_identifier":"H2020","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"language":[{"iso":"eng"}],"scopus_import":"1","citation":{"mla":"Avni, Guy, et al. “Bidding Games with Charging.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>.","ista":"Avni G, Goharshady EK, Henzinger TA, Mallik K. 2024. Bidding games with charging. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 8.","chicago":"Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>.","short":"G. Avni, E.K. Goharshady, T.A. Henzinger, K. Mallik, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Avni G, Goharshady EK, Henzinger TA, Mallik K. Bidding games with charging. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">10.4230/LIPIcs.CONCUR.2024.8</a>","ieee":"G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","apa":"Avni, G., Goharshady, E. K., Henzinger, T. A., &#38; Mallik, K. (2024). Bidding games with charging. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.8\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.8</a>"},"date_created":"2024-09-15T22:01:39Z","publication":"35th International Conference on Concurrency Theory","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC projects ERC-2020-AdG 101020093 and CoG 863818 (ForM-SMArt) and by ISF grant no. 1679/21.","author":[{"id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","full_name":"Avni, Guy","last_name":"Avni","first_name":"Guy"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Kaushik","full_name":"Mallik, Kaushik","last_name":"Mallik","orcid":"0000-0001-9864-7475","id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598"}],"doi":"10.4230/LIPIcs.CONCUR.2024.8","ddc":["000"],"oa":1,"corr_author":"1","month":"09","external_id":{"arxiv":["2407.06288"],"isi":["001556847400008"]},"article_number":"8","date_updated":"2025-12-02T13:46:11Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_published":"2024-09-01T00:00:00Z"},{"abstract":[{"lang":"eng","text":"An automaton 𝒜 is history-deterministic if its nondeterminism can be resolved on the fly, only using the prefix of the word read so far. This mild form of nondeterminism has attracted particular attention for its applications in synthesis problems. An automaton 𝒜 is guidable with respect to a class C of automata if it can fairly simulate every automaton in C, whose language is contained in that of 𝒜. In other words, guidable automata are those for which inclusion and simulation coincide, making them particularly interesting for model-checking. We study the connection between these two notions, and specifically the question of when they coincide. For classes of automata on which they do, deciding guidability, an otherwise challenging decision problem, reduces to deciding history-determinism, a problem that is starting to be well-understood for many classes. We provide a selection of sufficient criteria for a class of automata to guarantee the coincidence of the notions, and use them to show that the notions coincide for the most common automata classes, among which are ω-regular automata and many infinite-state automata with safety and reachability acceptance conditions, including vector addition systems with states, one-counter nets, pushdown-, Parikh-, and timed-automata. We also demonstrate that history-determinism and guidability do not always coincide, for example, for the classes of timed automata with a fixed number of clocks."}],"title":"History-determinism vs fair simulation","type":"conference","alternative_title":["LIPIcs"],"isi":1,"department":[{"_id":"ToHe"}],"article_processing_charge":"No","_id":"18067","quality_controlled":"1","has_accepted_license":"1","volume":311,"file_date_updated":"2024-09-17T07:31:18Z","ec_funded":1,"year":"2024","status":"public","intvolume":"       311","file":[{"access_level":"open_access","checksum":"66db11ef8e600a434079c278050c3f09","success":1,"file_size":766902,"file_id":"18080","file_name":"2024_LIPICS_Boker.pdf","relation":"main_file","content_type":"application/pdf","date_created":"2024-09-17T07:31:18Z","date_updated":"2024-09-17T07:31:18Z","creator":"dernst"}],"acknowledgement":"Udi Boker: Israel Science Foundation grant 2410/22\r\nThomas A. Henzinger: ERC-2020-AdG 101020093 (VAMOS)\r\nKaroliina Lehtinen: ANR QUASY 23-CE48-0008-01\r\nAditya Prakash: Chancellors’ International Scholarship from the University of Warwick and Centre for Discrete Mathematics and Its Applications (DIMAP)","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"35th International Conference on Concurrency Theory","date_created":"2024-09-15T22:01:40Z","citation":{"mla":"Boker, Udi, et al. “History-Determinism vs Fair Simulation.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>.","apa":"Boker, U., Henzinger, T. A., Lehtinen, K., &#38; Prakash, A. (2024). History-determinism vs fair simulation. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>","ista":"Boker U, Henzinger TA, Lehtinen K, Prakash A. 2024. History-determinism vs fair simulation. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 12.","chicago":"Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.12</a>.","short":"U. Boker, T.A. Henzinger, K. Lehtinen, A. Prakash, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ama":"Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.12\">10.4230/LIPIcs.CONCUR.2024.12</a>","ieee":"U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism vs fair simulation,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311."},"scopus_import":"1","language":[{"iso":"eng"}],"day":"01","project":[{"grant_number":"101020093","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020"}],"arxiv":1,"publication_identifier":{"isbn":["9783959773393"],"issn":["1868-8969"]},"conference":{"location":"Calgary, Canada","start_date":"2024-09-09","end_date":"2024-09-13","name":"CONCUR: Conference on Concurrency Theory"},"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","date_published":"2024-09-01T00:00:00Z","oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-12-02T13:44:54Z","article_number":"12","external_id":{"isi":["001556847400012"],"arxiv":["2407.08620"]},"corr_author":"1","month":"09","ddc":["000"],"oa":1,"doi":"10.4230/LIPIcs.CONCUR.2024.12","author":[{"id":"31E297B6-F248-11E8-B48F-1D18A9856A87","last_name":"Boker","full_name":"Boker, Udi","first_name":"Udi"},{"first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Lehtinen, Karoliina","last_name":"Lehtinen","first_name":"Karoliina"},{"first_name":"Aditya","full_name":"Prakash, Aditya","last_name":"Prakash"}]},{"has_accepted_license":"1","volume":311,"file_date_updated":"2024-09-17T07:48:56Z","year":"2024","ec_funded":1,"file":[{"file_name":"2024_LIPICS_Henzinger.pdf","relation":"main_file","creator":"dernst","date_updated":"2024-09-17T07:48:56Z","date_created":"2024-09-17T07:48:56Z","content_type":"application/pdf","file_size":964124,"file_id":"18081","access_level":"open_access","checksum":"555bd343e1fb38adeab8fc465ff4fad8","success":1}],"status":"public","intvolume":"       311","type":"conference","title":"Strategic dominance: A new preorder for nondeterministic processes","abstract":[{"lang":"eng","text":"We study the following refinement relation between nondeterministic state-transition models: model ℬ strategically dominates model 𝒜 iff every deterministic refinement of 𝒜 is language contained in some deterministic refinement of ℬ. While language containment is trace inclusion, and the (fair) simulation preorder coincides with tree inclusion, strategic dominance falls strictly between the two and can be characterized as \"strategy inclusion\" between 𝒜 and ℬ: every strategy that resolves the nondeterminism of 𝒜 is dominated by a strategy that resolves the nondeterminism of ℬ. Strategic dominance can be checked in 2-ExpTime by a decidable first-order Presburger logic with quantification over words and strategies, called resolver logic. We give several other applications of resolver logic, including checking the co-safety, co-liveness, and history-determinism of boolean and quantitative automata, and checking the inclusion between hyperproperties that are specified by nondeterministic boolean and quantitative automata."}],"department":[{"_id":"ToHe"},{"_id":"GradSch"}],"isi":1,"alternative_title":["LIPIcs"],"OA_type":"gold","article_processing_charge":"Yes","quality_controlled":"1","_id":"18068","date_updated":"2025-12-02T13:45:38Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_published":"2024-09-01T00:00:00Z","external_id":{"arxiv":["2407.10473"],"isi":["001556847400029"]},"article_number":"29","doi":"10.4230/LIPIcs.CONCUR.2024.29","OA_place":"publisher","ddc":["000"],"oa":1,"corr_author":"1","month":"09","author":[{"first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicolas Adrien","last_name":"Mazzocchi","full_name":"Mazzocchi, Nicolas Adrien","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","first_name":"Naci E","last_name":"Sarac","full_name":"Sarac, Naci E"}],"date_created":"2024-09-15T22:01:40Z","publication":"35th International Conference on Concurrency Theory","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. N. Mazzocchi was affiliated with ISTA when this work was submitted for publication.","citation":{"mla":"Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” <i>35th International Conference on Concurrency Theory</i>, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>.","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance: A new preorder for nondeterministic processes,” in <i>35th International Conference on Concurrency Theory</i>, Calgary, Canada, 2024, vol. 311.","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In <i>35th International Conference on Concurrency Theory</i>, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>.","short":"T.A. Henzinger, N.A. Mazzocchi, N.E. Sarac, in:, 35th International Conference on Concurrency Theory, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Henzinger TA, Mazzocchi NA, Sarac NE. 2024. Strategic dominance: A new preorder for nondeterministic processes. 35th International Conference on Concurrency Theory. CONCUR: Conference on Concurrency Theory, LIPIcs, vol. 311, 29.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: <i>35th International Conference on Concurrency Theory</i>. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">10.4230/LIPIcs.CONCUR.2024.29</a>","apa":"Henzinger, T. A., Mazzocchi, N. A., &#38; Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In <i>35th International Conference on Concurrency Theory</i> (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.CONCUR.2024.29\">https://doi.org/10.4230/LIPIcs.CONCUR.2024.29</a>"},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"arxiv":1,"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093","call_identifier":"H2020"}],"day":"01","scopus_import":"1","language":[{"iso":"eng"}],"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","conference":{"location":"Calgary, Canada","name":"CONCUR: Conference on Concurrency Theory","end_date":"2024-09-13","start_date":"2024-09-09"}},{"has_accepted_license":"1","volume":972,"issue":"2","file_date_updated":"2024-09-17T08:23:59Z","year":"2024","file":[{"content_type":"application/pdf","date_created":"2024-09-17T08:23:59Z","creator":"dernst","date_updated":"2024-09-17T08:23:59Z","file_name":"2024_AstrophysicalJourn_Neufeld.pdf","relation":"main_file","success":1,"access_level":"open_access","checksum":"754b58c1d79adb9670ca76fa8c20ab16","file_id":"18082","file_size":9960685}],"status":"public","intvolume":"       972","title":"FRESCO: The Paschen-α star-forming sequence at cosmic noon","abstract":[{"lang":"eng","text":"We present results from the JWST First Reionization Epoch Spectroscopically Complete Observations survey on the star-forming sequence (SFS) of galaxies at 1.0 < z < 1.7, around the peak of the cosmic star formation history. Star formation rates (SFRs) are measured from the redshifted, relatively dust-insensitive Paschen-α emission line, and stellar mass measurements include the F444W (4.4 μm; rest-frame H) band. We find SFRs of galaxies with log(M*/M⊙) > 9.5 that are lower than found in many earlier studies by up to 0.6 dex, but in good agreement with recent results obtained with the Prospector fitting framework. The difference (log(SFR(Paα)-SFR(Prospector)) is −0.09 ± 0.04 dex at 1010−11M⊙. We also measure the empirical relation between Paschen-α luminosity and rest-frame H-band magnitude and find that the scatter is only 0.04 dex lower than that of the SFR–M* relation and is much lower than the systematic differences among relations in the literature due to various methods of converting observed measurements to physical properties. We additionally identify examples of sources—that, with standard cutoffs via the UVJ diagram, would be deemed quiescent—with significant (log(sSFR)> −11 yr−1), typically extended, Paschen-α emission. Our results may be indicative of the potential unification of methods used to derive the SFS with careful selection of star-forming galaxies and independent SFR and stellar mass indicators."}],"type":"journal_article","department":[{"_id":"JoMa"}],"isi":1,"article_processing_charge":"Yes","quality_controlled":"1","_id":"18069","date_published":"2024-09-01T00:00:00Z","date_updated":"2025-09-08T09:43:41Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","external_id":{"isi":["001305987600001"]},"article_number":"156","ddc":["520"],"oa":1,"month":"09","doi":"10.3847/1538-4357/ad6158","article_type":"original","author":[{"first_name":"Chloe","last_name":"Neufeld","full_name":"Neufeld, Chloe"},{"first_name":"Pieter","full_name":"Van Dokkum, Pieter","last_name":"Van Dokkum"},{"first_name":"Yasmeen","full_name":"Asali, Yasmeen","last_name":"Asali"},{"full_name":"Covelo-Paz, Alba","last_name":"Covelo-Paz","first_name":"Alba"},{"full_name":"Leja, Joel","last_name":"Leja","first_name":"Joel"},{"first_name":"Jamie","full_name":"Lin, Jamie","last_name":"Lin"},{"last_name":"Matthee","full_name":"Matthee, Jorryt J","first_name":"Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"last_name":"Oesch","full_name":"Oesch, Pascal A.","first_name":"Pascal A."},{"first_name":"Naveen A.","last_name":"Reddy","full_name":"Reddy, Naveen A."},{"last_name":"Shivaei","full_name":"Shivaei, Irene","first_name":"Irene"},{"first_name":"Katherine E.","full_name":"Whitaker, Katherine E.","last_name":"Whitaker"},{"first_name":"Stijn","full_name":"Wuyts, Stijn","last_name":"Wuyts"},{"full_name":"Brammer, Gabriel","last_name":"Brammer","first_name":"Gabriel"},{"full_name":"Marchesini, Danilo","last_name":"Marchesini","first_name":"Danilo"},{"first_name":"Michael V.","full_name":"Maseda, Michael V.","last_name":"Maseda"},{"first_name":"Rohan P.","last_name":"Naidu","full_name":"Naidu, Rohan P."},{"first_name":"Erica J.","full_name":"Nelson, Erica J.","last_name":"Nelson"},{"full_name":"Velichko, Anna","last_name":"Velichko","first_name":"Anna"},{"full_name":"Weibel, Andrea","last_name":"Weibel","first_name":"Andrea"},{"full_name":"Xiao, Mengyuan","last_name":"Xiao","first_name":"Mengyuan"}],"DOAJ_listed":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"The authors thank the anonymous referee whose comments and suggestions improved the quality of this work.\r\nThis work is based on observations made with the NASA/ESA/CSA James Webb Space Telescope. The data were obtained from the Mikulski Archive for Space Telescopes at the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS 5-03127 for JWST. These observations are associated with program No. 1895.\r\nSupport 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.\r\nThis 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\nR.P.N. acknowledges funding from JWST programs GO-1933 and GO-2279. Support for this work was 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 NAS 5-26555\r\nCloud-based data processing and file storage for this work is provided by the AWS Cloud Credits for Research program.\r\nThis paper made use of several publicly available software packages. We thank the respective authors for sharing their work: IPython (Pérez & Granger 2007), matplotlib (Hunter 2007), seaborn (Waskom et al. 2018), NumPy (Harris et al. 2020), SciPy (Virtanen et al. 2020), jupyter (Kluyver et al. 2016), Astropy (Astropy Collaboration et al. 2013, 2018, 2022), grizli (Brammer 2018; Brammer et al. 2022), Prospector (Leja et al. 2019, 2017; Johnson et al. 2021), FSPS (Conroy et al. 2009a, 2010; Conroy & Gunn 2010a, 2010b; Foreman-Mackey et al. 2014), dynesty (Speagle 2020), EAZY (Brammer et al. 2008), Bagpipes (Carnall et al. 2018), and SExtractor (Bertin & Arnouts 1996).","date_created":"2024-09-15T22:01:40Z","publication":"Astrophysical Journal","citation":{"apa":"Neufeld, C., Van Dokkum, P., Asali, Y., Covelo-Paz, A., Leja, J., Lin, J., … Xiao, M. (2024). FRESCO: The Paschen-α star-forming sequence at cosmic noon. <i>Astrophysical Journal</i>. IOP Publishing. <a href=\"https://doi.org/10.3847/1538-4357/ad6158\">https://doi.org/10.3847/1538-4357/ad6158</a>","ieee":"C. Neufeld <i>et al.</i>, “FRESCO: The Paschen-α star-forming sequence at cosmic noon,” <i>Astrophysical Journal</i>, vol. 972, no. 2. IOP Publishing, 2024.","short":"C. Neufeld, P. Van Dokkum, Y. Asali, A. Covelo-Paz, J. Leja, J. Lin, J.J. Matthee, P.A. Oesch, N.A. Reddy, I. Shivaei, K.E. Whitaker, S. Wuyts, G. Brammer, D. Marchesini, M.V. Maseda, R.P. Naidu, E.J. Nelson, A. Velichko, A. Weibel, M. Xiao, Astrophysical Journal 972 (2024).","ama":"Neufeld C, Van Dokkum P, Asali Y, et al. FRESCO: The Paschen-α star-forming sequence at cosmic noon. <i>Astrophysical Journal</i>. 2024;972(2). doi:<a href=\"https://doi.org/10.3847/1538-4357/ad6158\">10.3847/1538-4357/ad6158</a>","ista":"Neufeld C, Van Dokkum P, Asali Y, Covelo-Paz A, Leja J, Lin J, Matthee JJ, Oesch PA, Reddy NA, Shivaei I, Whitaker KE, Wuyts S, Brammer G, Marchesini D, Maseda MV, Naidu RP, Nelson EJ, Velichko A, Weibel A, Xiao M. 2024. FRESCO: The Paschen-α star-forming sequence at cosmic noon. Astrophysical Journal. 972(2), 156.","chicago":"Neufeld, Chloe, Pieter Van Dokkum, Yasmeen Asali, Alba Covelo-Paz, Joel Leja, Jamie Lin, Jorryt J Matthee, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic Noon.” <i>Astrophysical Journal</i>. IOP Publishing, 2024. <a href=\"https://doi.org/10.3847/1538-4357/ad6158\">https://doi.org/10.3847/1538-4357/ad6158</a>.","mla":"Neufeld, Chloe, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic Noon.” <i>Astrophysical Journal</i>, vol. 972, no. 2, 156, IOP Publishing, 2024, doi:<a href=\"https://doi.org/10.3847/1538-4357/ad6158\">10.3847/1538-4357/ad6158</a>."},"day":"01","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"publisher":"IOP Publishing","publication_status":"published"},{"citation":{"mla":"Chatterjee, Bapi, et al. “Federated SGD with Local Asynchrony.” <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, IEEE, 2024, pp. 857–68, doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">10.1109/ICDCS60910.2024.00084</a>.","apa":"Chatterjee, B., Kungurtsev, V., &#38; Alistarh, D.-A. (2024). Federated SGD with local asynchrony. In <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i> (pp. 857–868). Jersey City, NJ, United States: IEEE. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">https://doi.org/10.1109/ICDCS60910.2024.00084</a>","ama":"Chatterjee B, Kungurtsev V, Alistarh D-A. Federated SGD with local asynchrony. In: <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>. IEEE; 2024:857-868. doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">10.1109/ICDCS60910.2024.00084</a>","ista":"Chatterjee B, Kungurtsev V, Alistarh D-A. 2024. Federated SGD with local asynchrony. Proceedings of the 44th International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems, 857–868.","short":"B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the 44th International Conference on Distributed Computing Systems, IEEE, 2024, pp. 857–868.","chicago":"Chatterjee, Bapi, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Federated SGD with Local Asynchrony.” In <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, 857–68. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00084\">https://doi.org/10.1109/ICDCS60910.2024.00084</a>.","ieee":"B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Federated SGD with local asynchrony,” in <i>Proceedings of the 44th International Conference on Distributed Computing Systems</i>, Jersey City, NJ, United States, 2024, pp. 857–868."},"isi":1,"department":[{"_id":"DaAl"}],"abstract":[{"lang":"eng","text":"Parallel SGD in a shared-memory setting is oft-represented by the popular Hogwild! algorithm, in which lock-free updates are asynchronously performed by multiple computing processes. Unfortunately, scaling Hogwild! to distributed workers is largely unexplored. Specifically, it is unknown if any adaptation of Hogwild! to the popular decentralized multi-GPU setting offers any competitive speedup, either empirically or theoretically. In this work, we investigate the potential of decentralizing Hogwild! by incorporating simultaneously (a) asynchronous local gradient updates on the shared memory of GPUs, and (b) non-blocking asynchronous decentralized federated averaging. A naive direct implementation shows degradation in performance, arising from scheduling overheads and concurrent write conflicts on GPUs. To mitigate these drawbacks, we investigate and propose a new method, based on careful block selection rules, which update only portions of the parameter vectors. Our experiments show that the resulting decentralized training method exhibits improved throughput and competitive accuracy for standard image classification benchmarks on the CIFAR-10, CIFAR-100, and Imagenet datasets. On the theoretical side, we prove that our method guarantees sublinear ergodic convergence rates for non-convex objectives."}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","title":"Federated SGD with local asynchrony","publication":"Proceedings of the 44th International Conference on Distributed Computing Systems","type":"conference","date_created":"2024-09-15T22:01:41Z","page":"857-868","conference":{"location":"Jersey City, NJ, United States","end_date":"2024-07-26","name":"ICDCS: International Conference on Distributed Computing Systems","start_date":"2024-07-23"},"_id":"18070","quality_controlled":"1","publication_status":"published","publisher":"IEEE","scopus_import":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"day":"26","publication_identifier":{"issn":["1063-6927"],"eissn":["2575-8411"],"isbn":["9798350386059"]},"external_id":{"isi":["001304430200075"]},"date_published":"2024-07-26T00:00:00Z","oa_version":"None","date_updated":"2025-09-08T09:23:48Z","status":"public","author":[{"full_name":"Chatterjee, Bapi","last_name":"Chatterjee","first_name":"Bapi","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2742-4028"},{"first_name":"Vyacheslav","last_name":"Kungurtsev","full_name":"Kungurtsev, Vyacheslav"},{"last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"corr_author":"1","month":"07","year":"2024","doi":"10.1109/ICDCS60910.2024.00084"},{"page":"1377-1387","_id":"18071","quality_controlled":"1","article_processing_charge":"No","isi":1,"department":[{"_id":"ElKo"}],"abstract":[{"lang":"eng","text":"Recent advancements on DAG-based consensus protocols allow for blockchains with improved metrics and properties, such as throughput and censorship-resistance. Variants of the Bullshark [18] consensus protocol are adopted for practical use by the Sui blockchain, for improved latency. However, the protocol is leader-based, and is strongly affected by crashed leaders that can lead to various performance issues, for example, decreased transaction throughput. In this paper, we propose HammerHead, a DAG-based consensus protocol, that is inspired by Carousel [8] and provides Leader-Utilization. Our proposal differs from Carousel, which is built for a chained consensus protocol; in HammerHead chain quality is inherited by the DAG. HammerHead needs to preserve safety and liveness, despite validators committing leader vertices asynchronously. The key idea is to update leader schedules dynamically, based on the validators' scores during the previous schedule. We implement HammerHead and show a minor improvement in performance for cases without faults. The major improvements in comparison to Bullshark appear in faulty settings. Specifically, we show a drastic, 2x-latency improvement and up to 40% increased throughput when crash faults occur (100 validators, 33 faults)."}],"title":"HammerHead: Leader reputation for dynamic scheduling","type":"conference","status":"public","year":"2024","conference":{"end_date":"2024-07-26","name":"ICDCS: International Conference on Distributed Computing Systems","start_date":"2024-07-23","location":"Jersey City, NJ, United States"},"publisher":"IEEE","publication_status":"published","language":[{"iso":"eng"}],"scopus_import":"1","day":"26","publication_identifier":{"issn":["1063-6927"],"eissn":["2575-8411"],"isbn":["9798350386059"]},"arxiv":1,"citation":{"apa":"Tsimos, G., Kichidis, A., Sonnino, A., &#38; Kokoris Kogias, E. (2024). HammerHead: Leader reputation for dynamic scheduling. In <i>Proceedings - International Conference on Distributed Computing Systems</i> (pp. 1377–1387). Jersey City, NJ, United States: IEEE. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>","ama":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. HammerHead: Leader reputation for dynamic scheduling. In: <i>Proceedings - International Conference on Distributed Computing Systems</i>. IEEE; 2024:1377-1387. doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>","short":"G. Tsimos, A. Kichidis, A. Sonnino, E. Kokoris Kogias, in:, Proceedings - International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–1387.","ista":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. 2024. HammerHead: Leader reputation for dynamic scheduling. Proceedings - International Conference on Distributed Computing Systems. ICDCS: International Conference on Distributed Computing Systems, 1377–1387.","chicago":"Tsimos, Giorgos, Anastasios Kichidis, Alberto Sonnino, and Eleftherios Kokoris Kogias. “HammerHead: Leader Reputation for Dynamic Scheduling.” In <i>Proceedings - International Conference on Distributed Computing Systems</i>, 1377–87. IEEE, 2024. <a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">https://doi.org/10.1109/ICDCS60910.2024.00129</a>.","ieee":"G. Tsimos, A. Kichidis, A. Sonnino, and E. Kokoris Kogias, “HammerHead: Leader reputation for dynamic scheduling,” in <i>Proceedings - International Conference on Distributed Computing Systems</i>, Jersey City, NJ, United States, 2024, pp. 1377–1387.","mla":"Tsimos, Giorgos, et al. “HammerHead: Leader Reputation for Dynamic Scheduling.” <i>Proceedings - International Conference on Distributed Computing Systems</i>, IEEE, 2024, pp. 1377–87, doi:<a href=\"https://doi.org/10.1109/ICDCS60910.2024.00129\">10.1109/ICDCS60910.2024.00129</a>."},"acknowledgement":"This work is supported by Mysten Labs. We thank the Mysten Labs Engineering teams for valuable feedback broadly, and specifically to Laura Makdah for helping implementing the early reputation score system for validators and Dmitry Perelman for managing the overall implementation effort.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication":"Proceedings - International Conference on Distributed Computing Systems","date_created":"2024-09-15T22:01:41Z","author":[{"first_name":"Giorgos","last_name":"Tsimos","full_name":"Tsimos, Giorgos"},{"last_name":"Kichidis","full_name":"Kichidis, Anastasios","first_name":"Anastasios"},{"first_name":"Alberto","last_name":"Sonnino","full_name":"Sonnino, Alberto"},{"id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios","last_name":"Kokoris Kogias"}],"month":"07","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2309.12713"}],"doi":"10.1109/ICDCS60910.2024.00129","external_id":{"arxiv":["2309.12713"],"isi":["001304430200120"]},"date_published":"2024-07-26T00:00:00Z","oa_version":"Preprint","date_updated":"2025-09-08T09:42:36Z"},{"_id":"18072","quality_controlled":"1","page":"P3254-3270.E9","article_processing_charge":"Yes (in subscription journal)","isi":1,"department":[{"_id":"AnSa"}],"type":"journal_article","abstract":[{"text":"The individualization of chromosomes during early mitosis and their clustering upon exit from cell division are two key transitions that ensure efficient segregation of eukaryotic chromosomes. Both processes are regulated by the surfactant-like protein Ki-67, but how Ki-67 achieves these diametric functions has remained unknown. Here, we report that Ki-67 radically switches from a chromosome repellent to a chromosome attractant during anaphase in human cells. We show that Ki-67 dephosphorylation during mitotic exit and the simultaneous exposure of a conserved basic patch induce the RNA-dependent formation of a liquid-like condensed phase on the chromosome surface. Experiments and coarse-grained simulations support a model in which the coalescence of chromosome surfaces, driven by co-condensation of Ki-67 and RNA, promotes clustering of chromosomes. Our study reveals how the switch of Ki-67 from a surfactant to a liquid-like condensed phase can generate mechanical forces during genome segregation that are required for re-establishing nuclear-cytoplasmic compartmentalization after mitosis.","lang":"eng"}],"title":"A liquid-like coat mediates chromosome clustering during mitotic exit","status":"public","intvolume":"        84","file":[{"date_updated":"2024-09-16T07:38:38Z","creator":"dernst","date_created":"2024-09-16T07:38:38Z","content_type":"application/pdf","relation":"main_file","file_name":"2024_MolecularCell_HernandezArmendariz.pdf","success":1,"checksum":"3f360e0287b8ec79fb2b8b02b5070360","access_level":"open_access","file_id":"18075","file_size":11654644}],"year":"2024","ec_funded":1,"file_date_updated":"2024-09-16T07:38:38Z","pmid":1,"issue":"17","has_accepted_license":"1","volume":84,"publication_status":"published","publisher":"Cell Press","publication_identifier":{"issn":["1097-2765"],"eissn":["1097-4164"]},"language":[{"iso":"eng"}],"scopus_import":"1","day":"05","project":[{"name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e","grant_number":"802960","call_identifier":"H2020"}],"citation":{"mla":"Hernandez-Armendariz, Alberto, et al. “A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” <i>Molecular Cell</i>, vol. 84, no. 17, Cell Press, 2024, p. P3254–3270.E9, doi:<a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">10.1016/j.molcel.2024.07.022</a>.","apa":"Hernandez-Armendariz, A., Sorichetti, V., Hayashi, Y., Koskova, Z., Brunner, A., Ellenberg, J., … Cuylen-Haering, S. (2024). A liquid-like coat mediates chromosome clustering during mitotic exit. <i>Molecular Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">https://doi.org/10.1016/j.molcel.2024.07.022</a>","ieee":"A. Hernandez-Armendariz <i>et al.</i>, “A liquid-like coat mediates chromosome clustering during mitotic exit,” <i>Molecular Cell</i>, vol. 84, no. 17. Cell Press, p. P3254–3270.E9, 2024.","ama":"Hernandez-Armendariz A, Sorichetti V, Hayashi Y, et al. A liquid-like coat mediates chromosome clustering during mitotic exit. <i>Molecular Cell</i>. 2024;84(17):P3254-3270.E9. doi:<a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">10.1016/j.molcel.2024.07.022</a>","short":"A. Hernandez-Armendariz, V. Sorichetti, Y. Hayashi, Z. Koskova, A. Brunner, J. Ellenberg, A. Šarić, S. Cuylen-Haering, Molecular Cell 84 (2024) P3254–3270.E9.","ista":"Hernandez-Armendariz A, Sorichetti V, Hayashi Y, Koskova Z, Brunner A, Ellenberg J, Šarić A, Cuylen-Haering S. 2024. A liquid-like coat mediates chromosome clustering during mitotic exit. Molecular Cell. 84(17), P3254–3270.E9.","chicago":"Hernandez-Armendariz, Alberto, Valerio Sorichetti, Yuki Hayashi, Zuzana Koskova, Andreas Brunner, Jan Ellenberg, Anđela Šarić, and Sara Cuylen-Haering. “A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” <i>Molecular Cell</i>. Cell Press, 2024. <a href=\"https://doi.org/10.1016/j.molcel.2024.07.022\">https://doi.org/10.1016/j.molcel.2024.07.022</a>."},"publication":"Molecular Cell","date_created":"2024-09-15T22:01:41Z","acknowledgement":"We thank Daniel W. Gerlich for providing cell lines, the EMBL Advanced Light Microscopy Facility (ALMF) for support, Christian H. Haering and Thomas Quail for input on the manuscript, and Martina Dees for cloning several Ki-67 constructs. This work was supported by the German Research Foundation (DFG project number 402723784) and the Human Frontier Science Program (CDA00045/2019). A.H.-A. and A.B. have received PhD fellowships from the Boehringer Ingelheim Fonds, V.S. and A.Š. were supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant no. 802960), and Y.H. was supported by a fellowship from the EMBL interdisciplinary Postdoc (EIPOD) program (Marie Sklodowska-Curie Actions, COFUND grant agreement 664726).","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","author":[{"first_name":"Alberto","full_name":"Hernandez-Armendariz, Alberto","last_name":"Hernandez-Armendariz"},{"orcid":"0000-0002-9645-6576","id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b","first_name":"Valerio","full_name":"Sorichetti, Valerio","last_name":"Sorichetti"},{"last_name":"Hayashi","full_name":"Hayashi, Yuki","first_name":"Yuki"},{"last_name":"Koskova","full_name":"Koskova, Zuzana","first_name":"Zuzana"},{"last_name":"Brunner","full_name":"Brunner, Andreas","first_name":"Andreas"},{"first_name":"Jan","last_name":"Ellenberg","full_name":"Ellenberg, Jan"},{"first_name":"Anđela","last_name":"Šarić","full_name":"Šarić, Anđela","orcid":"0000-0002-7854-2139","id":"bf63d406-f056-11eb-b41d-f263a6566d8b"},{"first_name":"Sara","last_name":"Cuylen-Haering","full_name":"Cuylen-Haering, Sara"}],"article_type":"original","doi":"10.1016/j.molcel.2024.07.022","month":"09","ddc":["570"],"oa":1,"external_id":{"isi":["001309051100001"],"pmid":["39153474"]},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-09-08T09:23:02Z","date_published":"2024-09-05T00:00:00Z"},{"isi":1,"department":[{"_id":"MaLo"},{"_id":"JiFr"}],"type":"journal_article","abstract":[{"text":"Conserved signaling cascades monitor protein-folding homeostasis to ensure proper cellular function. One of the evolutionary conserved key players is IRE1, which maintains endoplasmic reticulum (ER) homeostasis through the unfolded protein response (UPR). Upon accumulation of misfolded proteins in the ER, IRE1 forms clusters on the ER membrane to initiate UPR signaling. What regulates IRE1 cluster formation is not fully understood. Here, we show that the ER lumenal domain (LD) of human IRE1α forms biomolecular condensates in vitro. IRE1α LD condensates were stabilized both by binding to unfolded polypeptides as well as by tethering to model membranes, suggesting their role in assembling IRE1α into signaling-competent stable clusters. Molecular dynamics simulations indicated that weak multivalent interactions drive IRE1α LD clustering. Mutagenesis experiments identified disordered regions in IRE1α LD to control its clustering in vitro and in cells. Importantly, dysregulated clustering of IRE1α mutants led to defects in IRE1α signaling. Our results revealed that disordered regions in IRE1α LD control its clustering and suggest their role as a common strategy in regulating protein assembly on membranes.","lang":"eng"}],"title":"Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering","_id":"18073","quality_controlled":"1","page":"4668-4698","OA_type":"gold","article_processing_charge":"Yes","file_date_updated":"2025-01-13T08:43:20Z","pmid":1,"issue":"20","volume":43,"has_accepted_license":"1","status":"public","intvolume":"        43","file":[{"relation":"main_file","file_name":"2024_Embo_Kettel.pdf","content_type":"application/pdf","date_updated":"2025-01-13T08:43:20Z","date_created":"2025-01-13T08:43:20Z","creator":"dernst","file_size":10080854,"file_id":"18827","checksum":"04f4df1a561083f2846676442fc4eb3c","access_level":"open_access","success":1}],"year":"2024","citation":{"ieee":"P. Kettel <i>et al.</i>, “Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering,” <i>EMBO Journal</i>, vol. 43, no. 20. Embo Press, pp. 4668–4698, 2024.","ista":"Kettel P, Marosits L, Spinetti E, Rechberger M, Giannini C, Radler P, Niedermoser I, Fischer I, Versteeg GA, Loose M, Covino R, Karagöz GE. 2024. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. EMBO Journal. 43(20), 4668–4698.","ama":"Kettel P, Marosits L, Spinetti E, et al. Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. 2024;43(20):4668-4698. doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>","short":"P. Kettel, L. Marosits, E. Spinetti, M. Rechberger, C. Giannini, P. Radler, I. Niedermoser, I. Fischer, G.A. Versteeg, M. Loose, R. Covino, G.E. Karagöz, EMBO Journal 43 (2024) 4668–4698.","chicago":"Kettel, Paulina, Laura Marosits, Elena Spinetti, Michael Rechberger, Caterina Giannini, Philipp Radler, Isabell Niedermoser, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>. Embo Press, 2024. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>.","apa":"Kettel, P., Marosits, L., Spinetti, E., Rechberger, M., Giannini, C., Radler, P., … Karagöz, G. E. (2024). Disordered regions in the IRE1α ER lumenal domain mediate its stress-induced clustering. <i>EMBO Journal</i>. Embo Press. <a href=\"https://doi.org/10.1038/s44318-024-00207-0\">https://doi.org/10.1038/s44318-024-00207-0</a>","mla":"Kettel, Paulina, et al. “Disordered Regions in the IRE1α ER Lumenal Domain Mediate Its Stress-Induced Clustering.” <i>EMBO Journal</i>, vol. 43, no. 20, Embo Press, 2024, pp. 4668–98, doi:<a href=\"https://doi.org/10.1038/s44318-024-00207-0\">10.1038/s44318-024-00207-0</a>."},"publication":"EMBO Journal","date_created":"2024-09-15T22:01:42Z","acknowledgement":"We thank late Thomas Peterbauer at the Max Perutz Labs Biooptics Light Microscopy Facility for his help and support. We are grateful to Kitti Csalyi and Thomas Sauer at Max Perutz Labs Biooptics FACS facility for their help. We thank Grzegorz Scibisz and Sertan Atilla for their support with the expression and purification of mCherry-IRE1α LD-10His. We are grateful to Aleksandra S Anisimova with her help in the generation of stable cell lines and the statistical analyses of the data. We thank Venja Vieweger for her help with the characterization of the WLLI and D123P IRE1 mutants in cells. We are thankful to Monika Kubickova for the help with the AUC experiments. We acknowledge CF BIC of CIISB, Instruct-CZ Centre, supported by MEYS CR (LM2023042)) and European Regional Development Fund-Project, UP CIISB“ (No. CZ.02.1.01/0.0/0.0/18_046/0015974). We thank the members of the Karagöz lab for the critical reading and editing of the manuscript. We are thankful to our colleagues Diego Acosta-Alvear, Vladislav Belyy, Jirka Peschek, Yasin Dagdas, Javier Martinez, Sascha Martens and Alwin Köhler for their invaluable input on the manuscript. We are grateful to Life Science Editors, especially Katrina Woolcock for her useful edits and comments on the manuscript. We acknowledge funding from Austrian Science Fund (FWF-SFB F79 and FWF-W 1261) to GEK. PK acknowledges the support of the Max Perutz PhD fellowship. GAV is funded by Stand-Alone grants (P30231-B, P30415-B, P36572), Special Research Grant (SFB grant F79), and Doctoral School grant (DK grant W1261) from the Austrian Science Fund (FWF). ES and RC acknowledge support and funding by the Frankfurt Institute of Advanced Studies, the LOEWE Center for Multiscale Modelling in Life Sciences of the state of Hesse, the Collaborative Research Center 1507 “Membrane-associated Protein Assemblies, Machineries, and Supercomplexes” (Project ID 450648163), and the International Max Planck Research School on Cellular Biophysics (to RC), the Center for Scientific Computing of the Goethe University and the Jülich Supercomputing Centre for computational resources and support.","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_status":"published","publisher":"Embo Press","publication_identifier":{"eissn":["1460-2075"],"issn":["0261-4189"]},"language":[{"iso":"eng"}],"scopus_import":"1","day":"15","external_id":{"pmid":["39232130"],"isi":["001306286100002"]},"oa_version":"Published Version","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"date_updated":"2025-09-08T09:22:11Z","date_published":"2024-10-15T00:00:00Z","author":[{"first_name":"Paulina","last_name":"Kettel","full_name":"Kettel, Paulina"},{"first_name":"Laura","last_name":"Marosits","full_name":"Marosits, Laura"},{"last_name":"Spinetti","full_name":"Spinetti, Elena","first_name":"Elena"},{"full_name":"Rechberger, Michael","last_name":"Rechberger","first_name":"Michael"},{"first_name":"Caterina","full_name":"Giannini, Caterina","last_name":"Giannini","id":"e3fdddd5-f6e0-11ea-865d-ca99ee6367f4"},{"full_name":"Radler, Philipp","last_name":"Radler","first_name":"Philipp","id":"40136C2A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9198-2182 "},{"first_name":"Isabell","full_name":"Niedermoser, Isabell","last_name":"Niedermoser"},{"first_name":"Irmgard","full_name":"Fischer, Irmgard","last_name":"Fischer"},{"first_name":"Gijs A.","last_name":"Versteeg","full_name":"Versteeg, Gijs A."},{"last_name":"Loose","full_name":"Loose, Martin","first_name":"Martin","id":"462D4284-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7309-9724"},{"full_name":"Covino, Roberto","last_name":"Covino","first_name":"Roberto"},{"full_name":"Karagöz, G. Elif","last_name":"Karagöz","first_name":"G. Elif"}],"OA_place":"publisher","article_type":"original","doi":"10.1038/s44318-024-00207-0","month":"10","ddc":["570"],"oa":1},{"article_processing_charge":"No","acknowledged_ssus":[{"_id":"NanoFab"},{"_id":"M-Shop"}],"_id":"18076","page":"111","type":"dissertation","abstract":[{"lang":"eng","text":"The new era of Ge has opened up new possibilities in quantum computing. The maturity of Ge\r\nspin qubits is unquestioned, while hybrid semiconductor-superconductor Ge circuits are on track\r\nto enter the game. Gate-tunable transmons (gatemons) employing semiconductor Josephson\r\njunctions have recently emerged as building blocks for such hybrid quantum circuits. In this\r\nthesis, we present a gatemon fabricated in planar Germanium. We induce superconductivity\r\nin a two-dimensional hole gas by evaporating aluminum atop a thin spacer, which separates\r\nthe superconductor from the Ge quantum well. The Josephson junction is then integrated\r\ninto an Xmon circuit and capacitively coupled to a transmission line resonator. We showcase\r\nthe qubit tunability in a broad frequency range with resonator and two-tone spectroscopy.\r\nTime-domain characterizations reveal energy relaxation and coherence times up to 75 ns. Our\r\nresults, combined with the recent advances in the spin qubit field, pave the way towards novel\r\nhybrid and protected qubits in a group IV, CMOS-compatible material."}],"title":"Hybrid circuits on planar Germanium","department":[{"_id":"GradSch"},{"_id":"GeKa"}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"17202"}]},"alternative_title":["ISTA Thesis"],"year":"2024","ec_funded":1,"status":"public","file":[{"success":1,"access_level":"open_access","checksum":"d01d0e2846c2f3ac5bb14d321554a4cd","file_id":"18093","file_size":86679095,"content_type":"application/pdf","date_updated":"2024-09-18T14:13:01Z","date_created":"2024-09-18T14:13:01Z","creator":"osagi","relation":"main_file","file_name":"OliverSagi_Thesis_pdfa.pdf"},{"relation":"source_file","file_name":"Thesis_OliverSagi.zip","content_type":"application/x-zip-compressed","date_created":"2024-09-18T14:14:02Z","creator":"osagi","date_updated":"2024-09-19T09:20:33Z","file_size":172098524,"file_id":"18094","access_level":"local","checksum":"0543f473d509ee545f4ed3a56f742f4b"}],"has_accepted_license":"1","file_date_updated":"2024-09-19T09:20:33Z","publication_identifier":{"issn":["2663-337X"]},"language":[{"iso":"eng"}],"project":[{"grant_number":"P36507","name":"Merging spin and superconducting qubits in planar Ge","_id":"bd8bd29e-d553-11ed-ba76-f0070d4b237a"},{"grant_number":"I05060","name":"High impedance circuit quantum electrodynamics with hole spins","_id":"c0977eea-5a5b-11eb-8a69-a862db0cf4d1"},{"name":"Hybrid Semiconductor - Superconductor Quantum Devices","_id":"262116AA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"237E5020-32DE-11EA-91FC-C7463DDC885E","name":"TOPOLOGICALLY PROTECTED AND SCALABLE QUANTUM BITS","grant_number":"862046"}],"day":"18","publisher":"Institute of Science and Technology Austria","publication_status":"published","date_created":"2024-09-16T12:58:36Z","user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","citation":{"ieee":"O. Sagi, “Hybrid circuits on planar Germanium,” Institute of Science and Technology Austria, 2024.","chicago":"Sagi, Oliver. “Hybrid Circuits on Planar Germanium.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>.","ista":"Sagi O. 2024. Hybrid circuits on planar Germanium. Institute of Science and Technology Austria.","short":"O. Sagi, Hybrid Circuits on Planar Germanium, Institute of Science and Technology Austria, 2024.","ama":"Sagi O. Hybrid circuits on planar Germanium. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>","apa":"Sagi, O. (2024). <i>Hybrid circuits on planar Germanium</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18076\">https://doi.org/10.15479/at:ista:18076</a>","mla":"Sagi, Oliver. <i>Hybrid Circuits on Planar Germanium</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18076\">10.15479/at:ista:18076</a>."},"OA_place":"publisher","degree_awarded":"PhD","doi":"10.15479/at:ista:18076","corr_author":"1","month":"09","oa":1,"ddc":["539"],"license":"https://creativecommons.org/licenses/by-nc-sa/4.0/","author":[{"id":"71616374-A8E9-11E9-A7CA-09ECE5697425","full_name":"Sagi, Oliver","last_name":"Sagi","first_name":"Oliver"}],"oa_version":"Published Version","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"date_updated":"2026-04-16T12:20:39Z","date_published":"2024-09-18T00:00:00Z","supervisor":[{"id":"38DB5788-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8342-202X","full_name":"Katsaros, Georgios","last_name":"Katsaros","first_name":"Georgios"}]},{"volume":14974,"year":"2024","intvolume":"     14974","status":"public","title":"DeCAF: Decentralizable CGKA with fast healing","abstract":[{"lang":"eng","text":"Abstract. Continuous group key agreement (CGKA) allows a group of\r\nusers to maintain a continuously updated shared key in an asynchronous\r\nsetting where parties only come online sporadically and their messages\r\nare relayed by an untrusted server. CGKA captures the basic primitive\r\nunderlying group messaging schemes.\r\nCurrent solutions including TreeKEM (“Messaging Layer Security”\r\n(MLS) IETF RFC 9420) cannot handle concurrent requests while retaining low communication complexity. The exception being CoCoA, which\r\nis concurrent while having extremely low communication complexity (in\r\ngroups of size n and for m concurrent updates the communication per\r\nuser is log(n), i.e., independent of m). The main downside of CoCoA\r\nis that in groups of size n, users might have to do up to log(n) update\r\nrequests to the server to ensure their (potentially corrupted) key material has been refreshed.\r\nIn this work we present a “fast healing” concurrent CGKA protocol,\r\nnamed DeCAF, where users will heal after at most log(t) requests, with\r\nt being the number of corrupted users. While also suitable for the standard central-server setting, our protocol is particularly interesting for\r\nrealizing decentralized group messaging, where protocol messages (add,\r\nremove, update) are being posted on some append-only data structure\r\nrather than sent to a server. In this setting, concurrency is crucial once\r\nthe rate of requests exceeds, say, the rate at which new blocks are added\r\nto a blockchain.\r\nIn the central-server setting, CoCoA (the only alternative with concurrency, sub-linear communication and basic post-compromise security)\r\nenjoys much lower download communication. However, in the decentralized setting – where there is no server which can craft specific messages\r\nfor different users to reduce their download communication – our protocol\r\nsignificantly outperforms CoCoA. DeCAF heals in fewer epochs (log(t)\r\nvs. log(n)) while incurring a similar per epoch per user communication\r\ncost."}],"type":"conference","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18088"}]},"alternative_title":["LNCS"],"department":[{"_id":"GradSch"},{"_id":"KrPi"}],"isi":1,"article_processing_charge":"No","page":"294–313","quality_controlled":"1","_id":"18086","date_published":"2024-09-10T00:00:00Z","date_updated":"2026-04-07T13:01:26Z","oa_version":"None","external_id":{"isi":["001330408000014"]},"place":"Cham","month":"09","corr_author":"1","doi":"10.1007/978-3-031-71073-5_14","author":[{"id":"2A8DFA8C-F248-11E8-B48F-1D18A9856A87","full_name":"Alwen, Joel F","last_name":"Alwen","first_name":"Joel F"},{"first_name":"Benedikt","last_name":"Auerbach","full_name":"Auerbach, Benedikt","orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425"},{"orcid":"0000-0002-2505-4246","id":"ffc563a3-f6e0-11ea-865d-e3cce03d17cc","first_name":"Miguel","last_name":"Cueto Noval","full_name":"Cueto Noval, Miguel"},{"first_name":"Karen","last_name":"Klein","full_name":"Klein, Karen","id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0001-8630-415X","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","first_name":"Guillermo","full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez"},{"orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z"}],"editor":[{"first_name":"Clemente","last_name":"Galdi","full_name":"Galdi, Clemente"},{"first_name":"Duong Hieu","full_name":"Phan, Duong Hieu","last_name":"Phan"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2024-09-18T11:35:14Z","publication":"Security and Cryptography for Networks: 14th International Conference","citation":{"mla":"Alwen, Joel F., et al. “DeCAF: Decentralizable CGKA with Fast Healing.” <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, vol. 14974, Springer Nature, 2024, pp. 294–313, doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>.","apa":"Alwen, J. F., Auerbach, B., Cueto Noval, M., Klein, K., Pascual Perez, G., &#38; Pietrzak, K. Z. (2024). DeCAF: Decentralizable CGKA with fast healing. In C. Galdi &#38; D. H. Phan (Eds.), <i>Security and Cryptography for Networks: 14th International Conference</i> (Vol. 14974, pp. 294–313). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>","short":"J.F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, K.Z. Pietrzak, in:, C. Galdi, D.H. Phan (Eds.), Security and Cryptography for Networks: 14th International Conference, Springer Nature, Cham, 2024, pp. 294–313.","ama":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. DeCAF: Decentralizable CGKA with fast healing. In: Galdi C, Phan DH, eds. <i>Security and Cryptography for Networks: 14th International Conference</i>. Vol 14974. Cham: Springer Nature; 2024:294–313. doi:<a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">10.1007/978-3-031-71073-5_14</a>","ista":"Alwen JF, Auerbach B, Cueto Noval M, Klein K, Pascual Perez G, Pietrzak KZ. 2024. DeCAF: Decentralizable CGKA with fast healing. Security and Cryptography for Networks: 14th International Conference. SCN: Security and Cryptography for Networks, LNCS, vol. 14974, 294–313.","chicago":"Alwen, Joel F, Benedikt Auerbach, Miguel Cueto Noval, Karen Klein, Guillermo Pascual Perez, and Krzysztof Z Pietrzak. “DeCAF: Decentralizable CGKA with Fast Healing.” In <i>Security and Cryptography for Networks: 14th International Conference</i>, edited by Clemente Galdi and Duong Hieu Phan, 14974:294–313. Cham: Springer Nature, 2024. <a href=\"https://doi.org/10.1007/978-3-031-71073-5_14\">https://doi.org/10.1007/978-3-031-71073-5_14</a>.","ieee":"J. F. Alwen, B. Auerbach, M. Cueto Noval, K. Klein, G. Pascual Perez, and K. Z. Pietrzak, “DeCAF: Decentralizable CGKA with fast healing,” in <i>Security and Cryptography for Networks: 14th International Conference</i>, Amalfi, Italy, 2024, vol. 14974, pp. 294–313."},"day":"10","language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9783031710728"],"eisbn":["9783031710735"],"eissn":["1611-3349"],"issn":["0302-9743"]},"publisher":"Springer Nature","publication_status":"published","conference":{"location":"Amalfi, Italy","start_date":"2024-09-11","name":"SCN: Security and Cryptography for Networks","end_date":"2024-09-13"}},{"external_id":{"arxiv":["2310.00095"]},"article_number":"033277","date_published":"2024-09-10T00:00:00Z","date_updated":"2026-04-07T11:52:53Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","author":[{"full_name":"Maslov, Mikhail","last_name":"Maslov","first_name":"Mikhail","id":"2E65BB0E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4074-2570"},{"id":"d7b23d3a-9e21-11ec-b482-f76739596b95","full_name":"Koutentakis, Georgios","last_name":"Koutentakis","first_name":"Georgios"},{"id":"48dbb294-2a9c-11ef-905d-f56be71f0e5d","last_name":"Hrast","full_name":"Hrast, Mateja","first_name":"Mateja"},{"first_name":"Oliver H.","full_name":"Heckl, Oliver H.","last_name":"Heckl"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail","last_name":"Lemeshko","first_name":"Mikhail"}],"DOAJ_listed":"1","ddc":["530"],"oa":1,"month":"09","corr_author":"1","doi":"10.1103/physrevresearch.6.033277","OA_place":"publisher","article_type":"original","citation":{"mla":"Maslov, Mikhail, et al. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>, vol. 6, no. 3, 033277, American Physical Society, 2024, doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>.","apa":"Maslov, M., Koutentakis, G., Hrast, M., Heckl, O. H., &#38; Lemeshko, M. (2024). Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. American Physical Society. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>","ieee":"M. Maslov, G. Koutentakis, M. Hrast, O. H. Heckl, and M. Lemeshko, “Theory of angular momentum transfer from light to molecules,” <i>Physical Review Research</i>, vol. 6, no. 3. American Physical Society, 2024.","ama":"Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. Theory of angular momentum transfer from light to molecules. <i>Physical Review Research</i>. 2024;6(3). doi:<a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">10.1103/physrevresearch.6.033277</a>","ista":"Maslov M, Koutentakis G, Hrast M, Heckl OH, Lemeshko M. 2024. Theory of angular momentum transfer from light to molecules. Physical Review Research. 6(3), 033277.","chicago":"Maslov, Mikhail, Georgios Koutentakis, Mateja Hrast, Oliver H. Heckl, and Mikhail Lemeshko. “Theory of Angular Momentum Transfer from Light to Molecules.” <i>Physical Review Research</i>. American Physical Society, 2024. <a href=\"https://doi.org/10.1103/physrevresearch.6.033277\">https://doi.org/10.1103/physrevresearch.6.033277</a>.","short":"M. Maslov, G. Koutentakis, M. Hrast, O.H. Heckl, M. Lemeshko, Physical Review Research 6 (2024)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"We are grateful to Emilio Pisanty and Philipp Lunt for valuable discussions. This research was funded wholly or in part by the Austrian Science Fund (FWF) [10.55776/F1004]. G.M.K. gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON). O.H.H. acknowledges support by the Austrian Science Fund (FWF) [10.55776/P36040]. Furthermore, the financial support by the Austrian Federal Ministry for Digital and Economic Affairs, the National Foundation for Research, Technology and Development, and the Christian Doppler Research Association is gratefully acknowledged.","date_created":"2024-09-18T11:43:16Z","publication":"Physical Review Research","publication_status":"published","publisher":"American Physical Society","project":[{"name":"Coherent Optical Metrology Beyond Electric-Dipole-Allowed Transitions","_id":"7c040762-9f16-11ee-852c-dd79eeee4ab3","grant_number":"F100403"},{"call_identifier":"H2020","grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"},{"call_identifier":"H2020","_id":"2688CF98-B435-11E9-9278-68D0E5697425","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770"},{"_id":"3AC91DDA-15DF-11EA-824D-93A3E7B544D1","name":"FWF Open Access Fund","call_identifier":"FWF"}],"day":"10","language":[{"iso":"eng"}],"scopus_import":"1","arxiv":1,"publication_identifier":{"eissn":["2643-1564"]},"file_date_updated":"2024-09-23T09:46:20Z","has_accepted_license":"1","volume":6,"issue":"3","file":[{"file_size":1563824,"file_id":"18125","checksum":"8f744d94956a1683b473b1cf9b411a37","access_level":"open_access","success":1,"file_name":"2024_PhysicalReviewResearch_Maslov.pdf","relation":"main_file","content_type":"application/pdf","date_created":"2024-09-23T09:46:20Z","date_updated":"2024-09-23T09:46:20Z","creator":"dernst"}],"status":"public","intvolume":"         6","ec_funded":1,"APC_amount":"3028,31 EUR","year":"2024","related_material":{"record":[{"relation":"dissertation_contains","id":"19048","status":"public"}]},"department":[{"_id":"GradSch"},{"_id":"MiLe"}],"title":"Theory of angular momentum transfer from light to molecules","abstract":[{"lang":"eng","text":"We present a theory describing the interaction of structured light, such as light carrying orbital angular momentum, with molecules. The light-matter interaction Hamiltonian we derive is expressed through couplings between spherical gradients of the electric field and the (transition) electric multipole moments of a particle of any nontrivial rotation point group. Our model can therefore accommodate an arbitrary complexity of the molecular and electric field structure, and it can be straightforwardly extended to atoms or nanostructures. Applying this framework to rovibrational spectroscopy of molecules, we uncover the general mechanism of angular momentum exchange between the spin and orbital angular momenta of light, molecular rotation, and its center-of-mass motion. We show that the nonzero vorticity of Laguerre-Gaussian beams can strongly enhance certain rovibrational transitions that are considered forbidden in the case of nonhelical light. We discuss the experimental requirements for the observation of these forbidden transitions in state-of-the-art spatially resolved spectroscopy measurements."}],"type":"journal_article","quality_controlled":"1","_id":"18087","article_processing_charge":"Yes","OA_type":"gold"},{"author":[{"id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8630-415X","full_name":"Pascual Perez, Guillermo","last_name":"Pascual Perez","first_name":"Guillermo"}],"month":"09","corr_author":"1","oa":1,"ddc":["000"],"OA_place":"publisher","doi":"10.15479/at:ista:18088","degree_awarded":"PhD","supervisor":[{"id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","full_name":"Pietrzak, Krzysztof Z","first_name":"Krzysztof Z"}],"date_published":"2024-09-18T00:00:00Z","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by-nc-sa/4.0/legalcode","short":"CC BY-NC-SA (4.0)","image":"/images/cc_by_nc_sa.png","name":"Creative Commons Attribution-NonCommercial-ShareAlike 4.0 International (CC BY-NC-SA 4.0)"},"oa_version":"Published Version","date_updated":"2026-04-07T13:01:26Z","publisher":"Institute of Science and Technology Austria","publication_status":"published","language":[{"iso":"eng"}],"day":"18","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"}],"publication_identifier":{"issn":["2663-337X"]},"citation":{"apa":"Pascual Perez, G. (2024). <i>On the efficiency and security of secure group messaging</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>","chicago":"Pascual Perez, Guillermo. “On the Efficiency and Security of Secure Group Messaging.” Institute of Science and Technology Austria, 2024. <a href=\"https://doi.org/10.15479/at:ista:18088\">https://doi.org/10.15479/at:ista:18088</a>.","ista":"Pascual Perez G. 2024. On the efficiency and security of secure group messaging. Institute of Science and Technology Austria.","ama":"Pascual Perez G. On the efficiency and security of secure group messaging. 2024. doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>","short":"G. Pascual Perez, On the Efficiency and Security of Secure Group Messaging, Institute of Science and Technology Austria, 2024.","ieee":"G. Pascual Perez, “On the efficiency and security of secure group messaging,” Institute of Science and Technology Austria, 2024.","mla":"Pascual Perez, Guillermo. <i>On the Efficiency and Security of Secure Group Messaging</i>. Institute of Science and Technology Austria, 2024, doi:<a href=\"https://doi.org/10.15479/at:ista:18088\">10.15479/at:ista:18088</a>."},"user_id":"ba8df636-2132-11f1-aed0-ed93e2281fdd","date_created":"2024-09-18T12:59:49Z","status":"public","file":[{"checksum":"ce0dca715b3df48e52e2e891b6ac1bc5","access_level":"closed","file_size":11917734,"file_id":"18099","relation":"source_file","file_name":"thesis_bundle.zip","date_created":"2024-09-19T12:35:38Z","creator":"gpascual","date_updated":"2024-09-19T12:35:38Z","content_type":"application/x-zip-compressed"},{"date_created":"2024-09-19T12:36:08Z","creator":"gpascual","date_updated":"2024-09-19T12:36:08Z","content_type":"application/pdf","relation":"main_file","file_name":"thesis_gpasper.pdf","file_id":"18100","file_size":2729427,"checksum":"4a2c72e90f1a0ef2a13cff800f8d1265","access_level":"open_access"}],"ec_funded":1,"year":"2024","file_date_updated":"2024-09-19T12:36:08Z","has_accepted_license":"1","page":"239","_id":"18088","article_processing_charge":"No","alternative_title":["ISTA Thesis"],"related_material":{"record":[{"relation":"part_of_dissertation","id":"10408","status":"public"},{"relation":"part_of_dissertation","id":"11476","status":"public"},{"status":"public","id":"18086","relation":"part_of_dissertation"},{"status":"public","id":"10049","relation":"part_of_dissertation"}]},"department":[{"_id":"KrPi"},{"_id":"GradSch"}],"abstract":[{"lang":"eng","text":"Instant messaging applications like Whatsapp, Signal or Telegram have become ubiquitous in today's society.\r\nMany of them provide not only end-to-end encryption, but also security guarantees even when the key material gets compromised.\r\nThese are achieved through frequent key update performed by users.\r\nIn particular, the compromise of a group key should preserve confidentiality of previously exchanged messages (forward secrecy), and a subsequent key update will ensure security for future ones (post-compromise security).\r\nThough great protocols for one-on-one communication have been known for some time, the design of ones that scale efficiently for larger groups while achieving akin security guarantees is a hard problem.\r\nA great deal of research has been aimed at this topic, much of it under the umbrella of the Messaging Layer Security (MLS) working group at the IETF. \r\nStarted in 2018, this joint effort by academics and industry culminated in 2023 with the publication of the first standard for secure group messaging [IETF, RFC9420].\r\n\r\nAt the core of secure group messaging is a cryptographic primitive termed Continuous Group Key Agreement, or CGKA [Alwen et al. 2021], that essentially allows a changing group of users to agree on a common key with the added functionality security against compromises is achieved by users asynchronously issuing a key update. In this thesis we contribute to the understanding of CGKA across different angles.\r\nFirst, we present a new technique to effect dynamic operations in groups, i.e., add or remove members, that can be more efficient that the one employed by MLS in certain settings.\r\nConsidering the setting of users belonging to multiple overlapping groups, we then show lowerbounds on the communication cost of constructions that leverage said overlap, at the same time showing protocols that are asymptotically optimal and efficient for practical settings, respectively. Along the way, we show that the communication cost of key updates in MLS is average-cost optimal.\r\nAn important feature in CGKA protocols, particularly for big groups, is the possibility of executing several group operations concurrently. While later versions of MLS support this, they do at the cost of worsening the communication efficiency of future group operations.\r\nIn this thesis we introduce two new protocols that permit concurrency without any negative effect on efficiency. Our protocols circumvent previously existing lower bounds by satisfying a new notion of post-compromise security that only asks for security to be re-established after a certain number of key updates have taken place. While this can be slower than MLS in terms of rounds of communication, we show that it leads to more efficient overall communication. \r\nAdditionally, we introduce a new technique that allows group members to decrease the information they need to store and download, which makes one of our protocols enjoy much lower download cost than any other existing CGKA constructions. "}],"title":"On the efficiency and security of secure group messaging","type":"dissertation"},{"ec_funded":1,"year":"2024","status":"public","intvolume":"       293","file":[{"file_id":"18098","file_size":3507177,"success":1,"access_level":"open_access","checksum":"9355c2e60b8ec285e1b22719c5b73f1a","content_type":"application/pdf","creator":"dernst","date_created":"2024-09-19T10:30:37Z","date_updated":"2024-09-19T10:30:37Z","file_name":"2024_LIPICs_Attali.pdf","relation":"main_file"}],"has_accepted_license":"1","volume":293,"file_date_updated":"2024-09-19T10:30:37Z","article_processing_charge":"Yes","_id":"18097","quality_controlled":"1","abstract":[{"lang":"eng","text":"In our companion paper \"Tight bounds for the learning of homotopy à la Niyogi, Smale, and Weinberger for subsets of Euclidean spaces and of Riemannian manifolds\" we gave optimal bounds (in terms of the two one-sided Hausdorff distances) on a sample P of an input shape 𝒮 (either manifold or general set with positive reach) such that one can infer the homotopy of 𝒮 from the union of balls with some radius centred at P, both in Euclidean space and in a Riemannian manifold of bounded curvature. The construction showing the optimality of the bounds is not straightforward. The purpose of this video is to visualize and thus elucidate said construction in the Euclidean setting."}],"title":"The ultimate frontier: An optimality construction for homotopy inference (media exposition)","type":"conference","alternative_title":["LIPIcs"],"department":[{"_id":"HeEd"}],"month":"06","corr_author":"1","oa":1,"ddc":["000"],"doi":"10.4230/LIPIcs.SoCG.2024.87","author":[{"first_name":"Dominique","last_name":"Attali","full_name":"Attali, Dominique"},{"first_name":"Hana","full_name":"Kourimska, Hana","last_name":"Kourimska","orcid":"0000-0001-7841-0091","id":"D9B8E14C-3C26-11EA-98F5-1F833DDC885E"},{"id":"35638A5C-AAC7-11E9-B0BF-5503E6697425","full_name":"Fillmore, Christopher D","last_name":"Fillmore","first_name":"Christopher D"},{"last_name":"Ghosh","full_name":"Ghosh, Ishika","first_name":"Ishika","id":"ee449b28-344d-11ef-a6d5-9ca430e9e9ff"},{"full_name":"Lieutier, Andre","last_name":"Lieutier","first_name":"Andre"},{"first_name":"Elizabeth R","full_name":"Stephenson, Elizabeth R","last_name":"Stephenson","orcid":"0000-0002-6862-208X","id":"2D04F932-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-7472-2220","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","full_name":"Wintraecken, Mathijs","last_name":"Wintraecken"}],"date_published":"2024-06-06T00:00:00Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","date_updated":"2025-04-15T07:16:58Z","article_number":"87","language":[{"iso":"eng"}],"day":"06","project":[{"_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","grant_number":"788183","call_identifier":"H2020"},{"grant_number":"Z00342","name":"Mathematics, Computer Science","_id":"268116B8-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"},{"call_identifier":"FWF","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","name":"Persistence and stability of geometric complexes"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}],"publication_identifier":{"isbn":["9783959773164"]},"conference":{"location":"Athens, Greece","end_date":"2024-06-14","name":"SoCG: Symposium on Computational Geometry","start_date":"2024-06-11"},"publication_status":"published","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","acknowledgement":"This research has been supported by the European Research Council (ERC), grant No. 788183, by the Wittgenstein Prize, Austrian Science Fund (FWF), grant No. Z 342-N31, and by the DFG Collaborative Research Center TRR 109, Austrian Science Fund (FWF), grant No. I02979-N35. Mathijs Wintraecken: Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411, the Austrian science fund (FWF) grant No. M-3073, and the welcome package from IDEX of the Université Côte d’Azur.\r\nWe thank Jean-Daniel Boissonnat, Herbert Edelsbrunner, and Mariette Yvinec for discussion.","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication":"40th International Symposium on Computational Geometry","date_created":"2024-09-19T10:29:48Z","citation":{"mla":"Attali, Dominique, et al. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” <i>40th International Symposium on Computational Geometry</i>, vol. 293, 87, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>.","ieee":"D. Attali <i>et al.</i>, “The ultimate frontier: An optimality construction for homotopy inference (media exposition),” in <i>40th International Symposium on Computational Geometry</i>, Athens, Greece, 2024, vol. 293.","ama":"Attali D, Kourimska H, Fillmore CD, et al. The ultimate frontier: An optimality construction for homotopy inference (media exposition). In: <i>40th International Symposium on Computational Geometry</i>. Vol 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:<a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">10.4230/LIPIcs.SoCG.2024.87</a>","short":"D. Attali, H. Kourimska, C.D. Fillmore, I. Ghosh, A. Lieutier, E.R. Stephenson, M. Wintraecken, in:, 40th International Symposium on Computational Geometry, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024.","ista":"Attali D, Kourimska H, Fillmore CD, Ghosh I, Lieutier A, Stephenson ER, Wintraecken M. 2024. The ultimate frontier: An optimality construction for homotopy inference (media exposition). 40th International Symposium on Computational Geometry. SoCG: Symposium on Computational Geometry, LIPIcs, vol. 293, 87.","chicago":"Attali, Dominique, Hana Kourimska, Christopher D Fillmore, Ishika Ghosh, Andre Lieutier, Elizabeth R Stephenson, and Mathijs Wintraecken. “The Ultimate Frontier: An Optimality Construction for Homotopy Inference (Media Exposition).” In <i>40th International Symposium on Computational Geometry</i>, Vol. 293. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>.","apa":"Attali, D., Kourimska, H., Fillmore, C. D., Ghosh, I., Lieutier, A., Stephenson, E. R., &#38; Wintraecken, M. (2024). The ultimate frontier: An optimality construction for homotopy inference (media exposition). In <i>40th International Symposium on Computational Geometry</i> (Vol. 293). Athens, Greece: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. <a href=\"https://doi.org/10.4230/LIPIcs.SoCG.2024.87\">https://doi.org/10.4230/LIPIcs.SoCG.2024.87</a>"}},{"project":[{"_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b","name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427"}],"day":"09","language":[{"iso":"eng"}],"scopus_import":"1","publication_identifier":{"issn":["2050-5094"]},"arxiv":1,"publication_status":"published","publisher":"Cambridge University Press","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"Financial support by the Austrian Science Fund (FWF) through grant DOI: 10.55776/I6427 (as part of the SFB/TRR 352) is gratefully acknowledged.","date_created":"2024-09-20T12:25:25Z","publication":"Forum of Mathematics, Sigma","citation":{"ieee":"A. B. Lauritsen and R. Seiringer, “Pressure of a dilute spin-polarized Fermi gas: Lower bound,” <i>Forum of Mathematics, Sigma</i>, vol. 12. Cambridge University Press, 2024.","short":"A.B. Lauritsen, R. Seiringer, Forum of Mathematics, Sigma 12 (2024).","ista":"Lauritsen AB, Seiringer R. 2024. Pressure of a dilute spin-polarized Fermi gas: Lower bound. Forum of Mathematics, Sigma. 12, e78.","ama":"Lauritsen AB, Seiringer R. Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. 2024;12. doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>","chicago":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>. Cambridge University Press, 2024. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>.","apa":"Lauritsen, A. B., &#38; Seiringer, R. (2024). Pressure of a dilute spin-polarized Fermi gas: Lower bound. <i>Forum of Mathematics, Sigma</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/fms.2024.56\">https://doi.org/10.1017/fms.2024.56</a>","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Pressure of a Dilute Spin-Polarized Fermi Gas: Lower Bound.” <i>Forum of Mathematics, Sigma</i>, vol. 12, e78, Cambridge University Press, 2024, doi:<a href=\"https://doi.org/10.1017/fms.2024.56\">10.1017/fms.2024.56</a>."},"ddc":["510"],"oa":1,"month":"09","corr_author":"1","doi":"10.1017/fms.2024.56","article_type":"original","author":[{"last_name":"Lauritsen","full_name":"Lauritsen, Asbjørn Bækgaard","first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","orcid":"0000-0003-4476-2288"},{"first_name":"Robert","last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"date_published":"2024-09-09T00:00:00Z","date_updated":"2026-04-07T13:01:40Z","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"oa_version":"Published Version","external_id":{"isi":["001307817400001"],"arxiv":["2407.05990"]},"article_number":"e78","article_processing_charge":"Yes","quality_controlled":"1","_id":"18107","title":"Pressure of a dilute spin-polarized Fermi gas: Lower bound","abstract":[{"text":"We consider a dilute fully spin-polarized Fermi gas at positive temperature in dimensions  d∈{1,2,3} . We show that the pressure of the interacting gas is bounded from below by that of the free gas plus, to leading order, an explicit term of order  adρ2+2/d, where a is the p-wave scattering length of the repulsive interaction and  ρ  is the particle density. The results are valid for a wide range of repulsive interactions, including that of a hard core, and uniform in temperatures at most of the order of the Fermi temperature. A central ingredient in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin, Gillespie and Ripka (Nucl. Phys. A, 176.2 (1971), pp. 237–260).","lang":"eng"}],"type":"journal_article","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"18135"}]},"department":[{"_id":"GradSch"},{"_id":"RoSe"}],"isi":1,"year":"2024","file":[{"content_type":"application/pdf","date_updated":"2024-09-23T09:56:17Z","creator":"dernst","date_created":"2024-09-23T09:56:17Z","relation":"main_file","file_name":"2024_ForumMath_Lauritsen.pdf","file_id":"18126","file_size":599886,"success":1,"access_level":"open_access","checksum":"330b881240013213a8e08538fec13d29"}],"intvolume":"        12","status":"public","has_accepted_license":"1","volume":12,"file_date_updated":"2024-09-23T09:56:17Z"}]