[{"publisher":"EDP Sciences","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"ama":"Torralba-Torregrosa A, Matthee JJ, Naidu RP, et al. Anatomy of an ionized bubble: NIRCam grism spectroscopy of the z = 6.6 double-peaked Lyman- α emitter COLA1 and its environment. Astronomy and Astrophysics. 2024;689. doi:10.1051/0004-6361/202450318","short":"A. Torralba-Torregrosa, J.J. Matthee, R.P. Naidu, R. Mackenzie, G. Pezzulli, A. Hutter, P. Arnalte-Mur, S. Gurung-López, S. Tacchella, P. Oesch, D. Kashino, C. Conroy, D. Sobral, Astronomy and Astrophysics 689 (2024).","mla":"Torralba-Torregrosa, Alberto, et al. “Anatomy of an Ionized Bubble: NIRCam Grism Spectroscopy of the z = 6.6 Double-Peaked Lyman- α Emitter COLA1 and Its Environment.” Astronomy and Astrophysics, vol. 689, A44, EDP Sciences, 2024, doi:10.1051/0004-6361/202450318.","ista":"Torralba-Torregrosa A, Matthee JJ, Naidu RP, Mackenzie R, Pezzulli G, Hutter A, Arnalte-Mur P, Gurung-López S, Tacchella S, Oesch P, Kashino D, Conroy C, Sobral D. 2024. Anatomy of an ionized bubble: NIRCam grism spectroscopy of the z = 6.6 double-peaked Lyman- α emitter COLA1 and its environment. Astronomy and Astrophysics. 689, A44.","chicago":"Torralba-Torregrosa, Alberto, Jorryt J Matthee, Rohan P. Naidu, Ruari Mackenzie, Gabriele Pezzulli, Anne Hutter, Pablo Arnalte-Mur, et al. “Anatomy of an Ionized Bubble: NIRCam Grism Spectroscopy of the z = 6.6 Double-Peaked Lyman- α Emitter COLA1 and Its Environment.” Astronomy and Astrophysics. EDP Sciences, 2024. https://doi.org/10.1051/0004-6361/202450318.","ieee":"A. Torralba-Torregrosa et al., “Anatomy of an ionized bubble: NIRCam grism spectroscopy of the z = 6.6 double-peaked Lyman- α emitter COLA1 and its environment,” Astronomy and Astrophysics, vol. 689. EDP Sciences, 2024.","apa":"Torralba-Torregrosa, A., Matthee, J. J., Naidu, R. P., Mackenzie, R., Pezzulli, G., Hutter, A., … Sobral, D. (2024). Anatomy of an ionized bubble: NIRCam grism spectroscopy of the z = 6.6 double-peaked Lyman- α emitter COLA1 and its environment. Astronomy and Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202450318"},"department":[{"_id":"JoMa"}],"article_processing_charge":"Yes (in subscription journal)","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"quality_controlled":"1","day":"01","arxiv":1,"intvolume":" 689","date_published":"2024-09-01T00:00:00Z","type":"journal_article","file_date_updated":"2024-09-11T07:35:00Z","doi":"10.1051/0004-6361/202450318","oa":1,"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"},"article_number":"A44","acknowledgement":"The authors acknowledge the financial support from the MICIU with funding from the European Union NextGenerationEU and Generalitat Valenciana in the call Programa de Planes Complementarios de I+D+i (PRTR 2022) Project (VAL-JPAS), reference ASFAE/2022/025. This work has been funded by project PID2019-109592GBI00/AEI/10.13039/501100011033 from the Spanish Ministerio de Ciencia e Innovación (MCIN)-Agencia Estatal de Investigación, by the Project of Excellence Prometeo/2020/085 from the Conselleria d’Innovació Universitats, Ciència i Societat Digital de la Generalitat Valenciana. It has also be funded by the Project of Excellence Prometeo/2020/085 from the Conselleria d’Educació, Universitats, i Ocupació de la Generalitat Valenciana. Funded by the European Union (ERC, AGENTS, 101076224). Views and opinions expressed are however those of the author(s) only and do not necessarily reflect those of the European Union or the European Research Council. Neither the European Union nor the granting authority can be held responsible for them. ST acknowledges support by the Royal Society Research Grant G125142. AH acknowledges support by the VILLUM FONDEN under grant 37459. The Cosmic Dawn Center (DAWN) is funded by the Danish National Research Foundation under grant DNRF140. We acknowledge funding from JWST program GO-1933. 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, Incorporated, under NASA contract NAS5-26555. This work has received funding from the Swiss State Secretariat for Education, Research and Innovation (SERI) under contract number MB22.00072, as well as from the Swiss National Science Foundation (SNSF) through project grant 200020_207349. This 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 # 1933. The specific observations analyzed can be accessed via https://doi.org/10.17909/s9ht-7n34.","has_accepted_license":"1","publication":"Astronomy and Astrophysics","language":[{"iso":"eng"}],"_id":"17889","scopus_import":"1","status":"public","file":[{"file_id":"18055","creator":"dernst","file_name":"2024_AstronomyAstrophysics_TorralbaTorregrosa.pdf","relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"a6c0df287c75e8929db9f42badeac859","file_size":6225413,"date_updated":"2024-09-11T07:35:00Z","success":1,"date_created":"2024-09-11T07:35:00Z"}],"title":"Anatomy of an ionized bubble: NIRCam grism spectroscopy of the z = 6.6 double-peaked Lyman- α emitter COLA1 and its environment","article_type":"original","publication_status":"published","date_updated":"2025-09-08T09:20:52Z","ddc":["520"],"author":[{"full_name":"Torralba-Torregrosa, Alberto","first_name":"Alberto","last_name":"Torralba-Torregrosa"},{"orcid":"0000-0003-2871-127X","first_name":"Jorryt J","full_name":"Matthee, Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"first_name":"Rohan P.","full_name":"Naidu, Rohan P.","last_name":"Naidu"},{"first_name":"Ruari","full_name":"Mackenzie, Ruari","last_name":"Mackenzie"},{"first_name":"Gabriele","full_name":"Pezzulli, Gabriele","last_name":"Pezzulli"},{"first_name":"Anne","full_name":"Hutter, Anne","last_name":"Hutter"},{"full_name":"Arnalte-Mur, Pablo","first_name":"Pablo","last_name":"Arnalte-Mur"},{"full_name":"Gurung-López, Siddhartha","first_name":"Siddhartha","last_name":"Gurung-López"},{"first_name":"Sandro","full_name":"Tacchella, Sandro","last_name":"Tacchella"},{"last_name":"Oesch","first_name":"Pascal","full_name":"Oesch, Pascal"},{"last_name":"Kashino","first_name":"Daichi","full_name":"Kashino, Daichi"},{"first_name":"Charlie","full_name":"Conroy, Charlie","last_name":"Conroy"},{"full_name":"Sobral, David","first_name":"David","last_name":"Sobral"}],"month":"09","abstract":[{"lang":"eng","text":"The increasingly neutral intergalactic gas at z > 6 impacts the Lyman-α (Lyα) flux observed from galaxies. One luminous galaxy, COLA1, stands out because of its unique double-peaked Lyα line at z = 6.6, unseen in any simulation of reionization. Here, we present JWST/NIRCam wide-field slitless spectroscopy in a 21 arcmin2 field centered on COLA1. We find 141 galaxies spectroscopically selected through the [O III] doublet at 5.35 < z < 6.95, with 40 of these sources showing Hβ. For COLA1, we additionally detect [O III]4363 as well as Hγ. We measure a systemic redshift of z = 6.5917 for COLA1, confirming the classical double-peak nature of the Lyα profile. This implies that it resides in a highly ionized bubble and that it is leaking ionizing photons with a high escape fraction of fesc(LyC) = 20–50%, making it a prime laboratory to study Lyman continuum escape in the Epoch of Reionization. COLA1 shows all the signs of a prolific ionizer with a Lyα escape fraction of 81 ± 5%, Balmer decrement indicating no dust, a steep UV slope (βUV = −3.2 ± 0.4), and a star-formation surface density ≳10× that of typical galaxies at similar redshift. We detect five galaxies in COLA1’s close environment (Δz < 0.02). Exploiting the high spectroscopic completeness inherent to grism surveys, and using mock simulations that fully mimic the selection function, we show that the number of detected companions is very typical for a normal similarly UV-bright (MUV ∼ −21.3) galaxy – that is, the ionized bubble around COLA1 is unlikely to be due to an excessively large over-density. Instead, the measured ionizing properties suggest that COLA1 by itself might be powering the bubble required to explain its double-peaked Lyα profile (Rion ≈ 0.7 pMpc), with only minor contributions from detected neighbors (−19.5 ≲ MUV ≲ −17.5)."}],"year":"2024","volume":689,"isi":1,"date_created":"2024-09-08T22:01:11Z","external_id":{"isi":["001303205700016"],"arxiv":["2404.10040"]},"oa_version":"Published Version"},{"date_published":"2024-08-01T00:00:00Z","intvolume":" 26","day":"01","quality_controlled":"1","publication_identifier":{"eissn":["1099-4300"]},"article_processing_charge":"Yes","issue":"8","publisher":"MDPI","citation":{"short":"H. Edelsbrunner, K. Ölsböck, H. Wagner, Entropy 26 (2024).","ama":"Edelsbrunner H, Ölsböck K, Wagner H. Understanding higher-order interactions in information space. Entropy. 2024;26(8). doi:10.3390/e26080637","chicago":"Edelsbrunner, Herbert, Katharina Ölsböck, and Hubert Wagner. “Understanding Higher-Order Interactions in Information Space.” Entropy. MDPI, 2024. https://doi.org/10.3390/e26080637.","apa":"Edelsbrunner, H., Ölsböck, K., & Wagner, H. (2024). Understanding higher-order interactions in information space. Entropy. MDPI. https://doi.org/10.3390/e26080637","ieee":"H. Edelsbrunner, K. Ölsböck, and H. Wagner, “Understanding higher-order interactions in information space,” Entropy, vol. 26, no. 8. MDPI, 2024.","ista":"Edelsbrunner H, Ölsböck K, Wagner H. 2024. Understanding higher-order interactions in information space. Entropy. 26(8), 637.","mla":"Edelsbrunner, Herbert, et al. “Understanding Higher-Order Interactions in Information Space.” Entropy, vol. 26, no. 8, 637, MDPI, 2024, doi:10.3390/e26080637."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"HeEd"}],"acknowledgement":"We thank Anton Nikitenko for first observing that the Wrap complex can be characterized as stated in Claim (ii) of the Wrap Complex Lemma, and Ondrej Draganov for correcting a critical mistake in one of our formulas in Section 2.","has_accepted_license":"1","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"},"article_number":"637","oa":1,"doi":"10.3390/e26080637","type":"journal_article","pmid":1,"file_date_updated":"2024-09-09T09:01:12Z","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Ölsböck, Katharina","first_name":"Katharina","orcid":"0000-0002-4672-8297","id":"4D4AA390-F248-11E8-B48F-1D18A9856A87","last_name":"Ölsböck"},{"full_name":"Wagner, Hubert","first_name":"Hubert","id":"379CA8B8-F248-11E8-B48F-1D18A9856A87","last_name":"Wagner"}],"month":"08","ddc":["510"],"publication_status":"published","date_updated":"2025-09-08T09:13:44Z","article_type":"original","file":[{"access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_name":"2024_Entropy_Edelsbrunner.pdf","creator":"dernst","file_id":"17948","success":1,"date_created":"2024-09-09T09:01:12Z","date_updated":"2024-09-09T09:01:12Z","file_size":8025139,"checksum":"624a9e2c5b49d6c38b88b0f675467ba3"}],"status":"public","scopus_import":"1","title":"Understanding higher-order interactions in information space","_id":"17891","language":[{"iso":"eng"}],"publication":"Entropy","oa_version":"Published Version","external_id":{"pmid":["39202107"],"isi":["001305543500001"]},"date_created":"2024-09-08T22:01:11Z","related_material":{"link":[{"url":"https://git.ista.ac.at/katharina.oelsboeck/wrap_2_3-public/","relation":"software"}]},"year":"2024","isi":1,"volume":26,"abstract":[{"lang":"eng","text":"Abstract\r\nMethods used in topological data analysis naturally capture higher-order interactions in point cloud data embedded in a metric space. This methodology was recently extended to data living in an information space, by which we mean a space measured with an information theoretical distance. One such setting is a finite collection of discrete probability distributions embedded in the probability simplex measured with the relative entropy (Kullback–Leibler divergence). More generally, one can work with a Bregman divergence parameterized by a different notion of entropy. While theoretical algorithms exist for this setup, there is a paucity of implementations for exploring and comparing geometric-topological properties of various information spaces. The interest of this work is therefore twofold. First, we propose the first robust algorithms and software for geometric and topological data analysis in information space. Perhaps surprisingly, despite working with Bregman divergences, our design reuses robust libraries for the Euclidean case. Second, using the new software, we take the first steps towards understanding the geometric-topological structure of these spaces. In particular, we compare them with the more familiar spaces equipped with the Euclidean and Fisher metrics."}]},{"ddc":["530"],"date_updated":"2025-09-08T09:17:18Z","publication_status":"published","month":"08","author":[{"id":"69dbf5fb-8a76-11ed-866b-fb486d8b5689","last_name":"Olmeda","full_name":"Olmeda, Fabrizio","first_name":"Fabrizio"},{"last_name":"Rulands","first_name":"Steffen","full_name":"Rulands, Steffen"}],"_id":"17892","language":[{"iso":"eng"}],"publication":"Physical Review E","article_type":"original","title":"Field theory of enzyme-substrate systems with restricted long-range interactions","status":"public","scopus_import":"1","file":[{"file_name":"2024_PhysReviewE_Olmeda.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"18053","date_updated":"2024-09-11T05:59:36Z","success":1,"date_created":"2024-09-11T05:59:36Z","file_size":445696,"checksum":"67fc2cc8eee3155e5c3b7380307d8284"}],"external_id":{"isi":["001299670100004"],"pmid":["39294986"]},"date_created":"2024-09-08T22:01:12Z","oa_version":"Published Version","ec_funded":1,"abstract":[{"lang":"eng","text":"Enzyme-substrate kinetics form the basis of many biomolecular processes. The interplay between substrate binding and substrate geometry can give rise to long-range interactions between enzyme binding events. Here we study a general model of enzyme-substrate kinetics with restricted long-range interactions described by an exponent −𝛾. We employ a coherent-state path integral and renormalization group approach to calculate the first moment and two-point correlation function of the enzyme-binding profile. We show that starting from an empty substrate the average occupancy follows a power law with an exponent 1/(1−𝛾) over time. The correlation function decays algebraically with two distinct spatial regimes characterized by exponents −𝛾 on short distances and −(2/3)(2−𝛾) on long distances. The crossover between both regimes scales inversely with the average substrate occupancy. Our work allows associating experimental measurements of bound enzyme locations with their binding kinetics and the spatial conformation of the substrate."}],"isi":1,"project":[{"grant_number":"101034413","name":"IST-BRIDGE: International postdoctoral program","call_identifier":"H2020","_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c"}],"volume":110,"year":"2024","day":"01","quality_controlled":"1","date_published":"2024-08-01T00:00:00Z","intvolume":" 110","department":[{"_id":"EdHa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Olmeda, Fabrizio, and Steffen Rulands. “Field Theory of Enzyme-Substrate Systems with Restricted Long-Range Interactions.” Physical Review E, vol. 110, no. 2, 024404, American Physical Society, 2024, doi:10.1103/PhysRevE.110.024404.","ieee":"F. Olmeda and S. Rulands, “Field theory of enzyme-substrate systems with restricted long-range interactions,” Physical Review E, vol. 110, no. 2. American Physical Society, 2024.","chicago":"Olmeda, Fabrizio, and Steffen Rulands. “Field Theory of Enzyme-Substrate Systems with Restricted Long-Range Interactions.” Physical Review E. American Physical Society, 2024. https://doi.org/10.1103/PhysRevE.110.024404.","apa":"Olmeda, F., & Rulands, S. (2024). Field theory of enzyme-substrate systems with restricted long-range interactions. Physical Review E. American Physical Society. https://doi.org/10.1103/PhysRevE.110.024404","ista":"Olmeda F, Rulands S. 2024. Field theory of enzyme-substrate systems with restricted long-range interactions. Physical Review E. 110(2), 024404.","ama":"Olmeda F, Rulands S. Field theory of enzyme-substrate systems with restricted long-range interactions. Physical Review E. 2024;110(2). doi:10.1103/PhysRevE.110.024404","short":"F. Olmeda, S. Rulands, Physical Review E 110 (2024)."},"issue":"2","publisher":"American Physical Society","publication_identifier":{"issn":["2470-0045"],"eissn":["2470-0053"]},"article_processing_charge":"Yes (in subscription journal)","has_accepted_license":"1","acknowledgement":"We thank F. Piazza, M. Henkel, and F. Jülicher for helpful feedback and the entire Rulands group for fruitful discussions. We thank W. Reik, S. Clark, T. Lohoff, and I. Kafetzopoulos for fruitful discussions about the biological aspects of this work. This project has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (Grant No. 950349). This project has received funding from the European Union's Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant No. 101034413.","article_number":"024404","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"},"corr_author":"1","file_date_updated":"2024-09-11T05:59:36Z","pmid":1,"type":"journal_article","oa":1,"doi":"10.1103/PhysRevE.110.024404"},{"main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2403.10656 ","open_access":"1"}],"conference":{"start_date":"2024-07-07","name":"ISIT: International Symposium on Information Theory","end_date":"2024-07-12","location":"Athens, Greece"},"type":"conference","oa":1,"doi":"10.1109/ISIT57864.2024.10619367","acknowledgement":"The work in this paper was supported in part by the Swiss National Science Foundation under Grant 200364.\r\n","corr_author":"1","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"short":"L. Jin, A.R. Esposito, M. Gastpar, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2024, pp. 3178–3183.","ama":"Jin L, Esposito AR, Gastpar M. Properties of the strong data processing constant for Rényi divergence. In: Proceedings of the 2024 IEEE International Symposium on Information Theory. Institute of Electrical and Electronics Engineers; 2024:3178-3183. doi:10.1109/ISIT57864.2024.10619367","ista":"Jin L, Esposito AR, Gastpar M. 2024. Properties of the strong data processing constant for Rényi divergence. Proceedings of the 2024 IEEE International Symposium on Information Theory. ISIT: International Symposium on Information Theory, 3178–3183.","ieee":"L. Jin, A. R. Esposito, and M. Gastpar, “Properties of the strong data processing constant for Rényi divergence,” in Proceedings of the 2024 IEEE International Symposium on Information Theory, Athens, Greece, 2024, pp. 3178–3183.","apa":"Jin, L., Esposito, A. R., & Gastpar, M. (2024). Properties of the strong data processing constant for Rényi divergence. In Proceedings of the 2024 IEEE International Symposium on Information Theory (pp. 3178–3183). Athens, Greece: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT57864.2024.10619367","chicago":"Jin, Lifu, Amedeo Roberto Esposito, and Michael Gastpar. “Properties of the Strong Data Processing Constant for Rényi Divergence.” In Proceedings of the 2024 IEEE International Symposium on Information Theory, 3178–83. Institute of Electrical and Electronics Engineers, 2024. https://doi.org/10.1109/ISIT57864.2024.10619367.","mla":"Jin, Lifu, et al. “Properties of the Strong Data Processing Constant for Rényi Divergence.” Proceedings of the 2024 IEEE International Symposium on Information Theory, Institute of Electrical and Electronics Engineers, 2024, pp. 3178–83, doi:10.1109/ISIT57864.2024.10619367."},"department":[{"_id":"MaMo"}],"publisher":"Institute of Electrical and Electronics Engineers","publication_identifier":{"isbn":["9798350382846"],"issn":["2157-8095"]},"article_processing_charge":"No","day":"19","arxiv":1,"quality_controlled":"1","date_published":"2024-08-19T00:00:00Z","abstract":[{"text":"Strong data processing inequalities (SDPI) are an important object of study in Information Theory and have been well studied for f -divergences. Universal upper and lower bounds have been provided along with several applications, connecting them to impossibility (converse) results, concentration of measure, hypercontractivity, and so on. In this paper, we study Renyi divergence and the corresponding SDPI constant whose behavior seems to deviate from that of ordinary <1>-divergences. In particular, one can find examples showing that the universal upper bound relating its SDPI constant to the one of Total Variation does not hold in general. In this work, we prove, however, that the universal lower bound involving the SDPI constant of the Chi-square divergence does indeed hold. Furthermore, we also provide a characterization of the distribution that achieves the supremum when is equal to 2 and consequently compute the SDPI constant for Renyi divergence of the general binary channel.","lang":"eng"}],"page":"3178-3183","isi":1,"year":"2024","external_id":{"arxiv":["2403.10656"],"isi":["001304426903055"]},"date_created":"2024-09-08T22:01:12Z","oa_version":"Preprint","_id":"17893","language":[{"iso":"eng"}],"publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory","title":"Properties of the strong data processing constant for Rényi divergence","status":"public","scopus_import":"1","date_updated":"2025-09-08T09:18:00Z","publication_status":"published","author":[{"last_name":"Jin","full_name":"Jin, Lifu","first_name":"Lifu"},{"last_name":"Esposito","id":"9583e921-e1ad-11ec-9862-cef099626dc9","first_name":"Amedeo Roberto","full_name":"Esposito, Amedeo Roberto"},{"first_name":"Michael","full_name":"Gastpar, Michael","last_name":"Gastpar"}],"month":"08"},{"doi":"10.1109/ISIT57864.2024.10619378","conference":{"end_date":"2024-07-12","location":"Athens, Greece","start_date":"2024-07-07","name":"ISIT: International Symposium on Information Theory"},"type":"conference","corr_author":"1","acknowledgement":"The work in this paper was supported in part by the Swiss National Science Foundation under Grant 200364.","publication_identifier":{"issn":["2157-8095"],"isbn":["9798350382846"]},"article_processing_charge":"No","publisher":"Institute of Electrical and Electronics Engineers","citation":{"short":"A.R. Esposito, M. Gastpar, I. Issa, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory , Institute of Electrical and Electronics Engineers, 2024, pp. 2110–2115.","ama":"Esposito AR, Gastpar M, Issa I. Variational characterizations of Sibson’s α-mutual information. In: Proceedings of the 2024 IEEE International Symposium on Information Theory . Institute of Electrical and Electronics Engineers; 2024:2110-2115. doi:10.1109/ISIT57864.2024.10619378","ista":"Esposito AR, Gastpar M, Issa I. 2024. Variational characterizations of Sibson’s α-mutual information. Proceedings of the 2024 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 2110–2115.","ieee":"A. R. Esposito, M. Gastpar, and I. Issa, “Variational characterizations of Sibson’s α-mutual information,” in Proceedings of the 2024 IEEE International Symposium on Information Theory , Athens, Greece, 2024, pp. 2110–2115.","chicago":"Esposito, Amedeo Roberto, Michael Gastpar, and Ibrahim Issa. “Variational Characterizations of Sibson’s α-Mutual Information.” In Proceedings of the 2024 IEEE International Symposium on Information Theory , 2110–15. Institute of Electrical and Electronics Engineers, 2024. https://doi.org/10.1109/ISIT57864.2024.10619378.","apa":"Esposito, A. R., Gastpar, M., & Issa, I. (2024). Variational characterizations of Sibson’s α-mutual information. In Proceedings of the 2024 IEEE International Symposium on Information Theory (pp. 2110–2115). Athens, Greece: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT57864.2024.10619378","mla":"Esposito, Amedeo Roberto, et al. “Variational Characterizations of Sibson’s α-Mutual Information.” Proceedings of the 2024 IEEE International Symposium on Information Theory , Institute of Electrical and Electronics Engineers, 2024, pp. 2110–15, doi:10.1109/ISIT57864.2024.10619378."},"department":[{"_id":"MaMo"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2024-08-19T00:00:00Z","day":"19","quality_controlled":"1","year":"2024","isi":1,"abstract":[{"text":"Sibson's α -mutual information has received renewed attention recently in several contexts: concentration of measure under dependence, statistical learning, hypothesis testing, and estimation theory. In this work, we introduce several variational representations of Sibson's α -mutual information: 1) as a supremum over joint distributions of (a combination of) KL divergences; and 2) as a supremum over functions of opportune expected values. Leveraging them, we produce a variety of novel and known results, including a generalization of transportation-cost inequalities and Fano's inequality.","lang":"eng"}],"page":"2110-2115","oa_version":"None","date_created":"2024-09-08T22:01:12Z","external_id":{"isi":["001304426902023"]},"scopus_import":"1","status":"public","title":"Variational characterizations of Sibson's α-mutual information","_id":"17894","publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory ","language":[{"iso":"eng"}],"author":[{"first_name":"Amedeo Roberto","full_name":"Esposito, Amedeo Roberto","last_name":"Esposito","id":"9583e921-e1ad-11ec-9862-cef099626dc9"},{"full_name":"Gastpar, Michael","first_name":"Michael","last_name":"Gastpar"},{"full_name":"Issa, Ibrahim","first_name":"Ibrahim","last_name":"Issa"}],"month":"08","publication_status":"published","date_updated":"2025-09-08T09:18:44Z"},{"year":"2024","isi":1,"doi":"10.1109/ISIT57864.2024.10619362","conference":{"name":"ISIT: International Symposium on Information Theory","start_date":"2024-07-07","location":"Athens, Greece","end_date":"2024-07-12"},"abstract":[{"text":"We propose a concatenated code construction for a class of discrete-alphabet oblivious arbitrarily varying channels (AVCs) with cost constraints. The code has time and space complexity polynomial in the blocklength n . It uses a Reed-Solomon outer code, logarithmic blocklength random inner codes, and stochastic encoding by permuting the codeword before transmission. When the channel satisfies a condition called strong DS-nonsymmetrizability (a modified version of nonsymmetrizability originally due to Dobrushin and Stambler), we show that the code achieves a rate that for a variety of oblivious AVCs (such as classically studied error/erasure channels) match the known capacities.","lang":"eng"}],"type":"conference","page":"1586-1591","oa_version":"None","acknowledgement":"The work of M. Langberg and A. D. Sarwate was supported in part by the US NSF under awards CCF-1909451 and CCF1909468. B. K. Dey was supported in part by the Bharti Centre\r\nfor Communication in IIT Bombay. ","external_id":{"isi":["001304426901091"]},"date_created":"2024-09-08T22:01:12Z","publication_identifier":{"isbn":["9798350382846"],"issn":["2157-8095"]},"status":"public","scopus_import":"1","article_processing_charge":"No","title":"Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs","publisher":"Institute of Electrical and Electronics Engineers","_id":"17895","citation":{"mla":"Dey, B. K., et al. “Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs.” Proceedings of the 2024 IEEE International Symposium on Information Theory , Institute of Electrical and Electronics Engineers, 2024, pp. 1586–91, doi:10.1109/ISIT57864.2024.10619362.","ieee":"B. K. Dey, S. Jaggi, M. Langberg, A. D. Sarwate, and Y. Zhang, “Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs,” in Proceedings of the 2024 IEEE International Symposium on Information Theory , Athens, Greece, 2024, pp. 1586–1591.","apa":"Dey, B. K., Jaggi, S., Langberg, M., Sarwate, A. D., & Zhang, Y. (2024). Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. In Proceedings of the 2024 IEEE International Symposium on Information Theory (pp. 1586–1591). Athens, Greece: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ISIT57864.2024.10619362","chicago":"Dey, B. K., S. Jaggi, M. Langberg, A. D. Sarwate, and Yihan Zhang. “Computationally Efficient Codes for Strongly Dobrushin-Stambler Nonsymmetrizable Oblivious AVCs.” In Proceedings of the 2024 IEEE International Symposium on Information Theory , 1586–91. Institute of Electrical and Electronics Engineers, 2024. https://doi.org/10.1109/ISIT57864.2024.10619362.","ista":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. 2024. Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. Proceedings of the 2024 IEEE International Symposium on Information Theory . ISIT: International Symposium on Information Theory, 1586–1591.","ama":"Dey BK, Jaggi S, Langberg M, Sarwate AD, Zhang Y. Computationally efficient codes for strongly Dobrushin-Stambler nonsymmetrizable oblivious AVCs. In: Proceedings of the 2024 IEEE International Symposium on Information Theory . Institute of Electrical and Electronics Engineers; 2024:1586-1591. doi:10.1109/ISIT57864.2024.10619362","short":"B.K. Dey, S. Jaggi, M. Langberg, A.D. Sarwate, Y. Zhang, in:, Proceedings of the 2024 IEEE International Symposium on Information Theory , Institute of Electrical and Electronics Engineers, 2024, pp. 1586–1591."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"MaMo"}],"language":[{"iso":"eng"}],"publication":"Proceedings of the 2024 IEEE International Symposium on Information Theory ","date_published":"2024-08-19T00:00:00Z","author":[{"full_name":"Dey, B. K.","first_name":"B. K.","last_name":"Dey"},{"first_name":"S.","full_name":"Jaggi, S.","last_name":"Jaggi"},{"first_name":"M.","full_name":"Langberg, M.","last_name":"Langberg"},{"full_name":"Sarwate, A. D.","first_name":"A. D.","last_name":"Sarwate"},{"id":"2ce5da42-b2ea-11eb-bba5-9f264e9d002c","last_name":"Zhang","full_name":"Zhang, Yihan","first_name":"Yihan","orcid":"0000-0002-6465-6258"}],"month":"08","day":"19","publication_status":"published","quality_controlled":"1","date_updated":"2025-09-08T09:19:25Z"},{"acknowledgement":"The authors appreciate the Analytical & Testing Center of Sichuan University and Ceshigo Research Service for their supports on material characterization. This study is financial supported by the fund of the State Key Laboratory of Solidification Processing in Northwestern Polytechnical University (NWPU, Grant SKLSP202315), the State Key Laboratory for Mechanical Behavior of Materials (Grant 20232509), and the International Scientific and Technological Innovation Cooperation of Sichuan Province (2024YFHZ0309).","doi":"10.1021/acsami.4c10489","type":"journal_article","pmid":1,"date_published":"2024-09-11T00:00:00Z","intvolume":" 16","day":"11","quality_controlled":"1","publication_identifier":{"issn":["1944-8244"],"eissn":["1944-8252"]},"article_processing_charge":"No","publisher":"American Chemical Society","issue":"36","department":[{"_id":"MaIb"}],"citation":{"short":"J. Zhou, S. Xu, Y. Shuai, Q. Sun, H. Ma, C. Wang, H. Wu, S. Tan, Z. Wang, L. Yang, ACS Applied Materials and Interfaces 16 (2024) 47923–47930.","ama":"Zhou J, Xu S, Shuai Y, et al. Decipher the wavelength and intensity using photothermoelectric detectors. ACS Applied Materials and Interfaces. 2024;16(36):47923-47930. doi:10.1021/acsami.4c10489","ieee":"J. Zhou et al., “Decipher the wavelength and intensity using photothermoelectric detectors,” ACS Applied Materials and Interfaces, vol. 16, no. 36. American Chemical Society, pp. 47923–47930, 2024.","apa":"Zhou, J., Xu, S., Shuai, Y., Sun, Q., Ma, H., Wang, C., … Yang, L. (2024). Decipher the wavelength and intensity using photothermoelectric detectors. ACS Applied Materials and Interfaces. American Chemical Society. https://doi.org/10.1021/acsami.4c10489","chicago":"Zhou, Jiamin, Shengduo Xu, Yi Shuai, Qiang Sun, Huangshui Ma, Chao Wang, Haijuan Wu, Shanshan Tan, Zegao Wang, and Lei Yang. “Decipher the Wavelength and Intensity Using Photothermoelectric Detectors.” ACS Applied Materials and Interfaces. American Chemical Society, 2024. https://doi.org/10.1021/acsami.4c10489.","ista":"Zhou J, Xu S, Shuai Y, Sun Q, Ma H, Wang C, Wu H, Tan S, Wang Z, Yang L. 2024. Decipher the wavelength and intensity using photothermoelectric detectors. ACS Applied Materials and Interfaces. 16(36), 47923–47930.","mla":"Zhou, Jiamin, et al. “Decipher the Wavelength and Intensity Using Photothermoelectric Detectors.” ACS Applied Materials and Interfaces, vol. 16, no. 36, American Chemical Society, 2024, pp. 47923–30, doi:10.1021/acsami.4c10489."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","oa_version":"None","date_created":"2024-09-08T22:01:13Z","external_id":{"pmid":["39194354"],"isi":["001300770000001"]},"year":"2024","isi":1,"volume":16,"abstract":[{"text":"Broadband photodetectors that can decipher the wavelength (λ) and intensity (I) of an unknown incident light are urgently demanded. Photothermoelectric (PTE) detectors can achieve ultrabroadband photodetection surpassing the bandgap limitation; however, their practical application is severely hampered by the lack of deciphering strategy. In this work, we report a variable elimination method to decipher λ and I of the incident lights based on an integrated Ag2Se film-based PTE detector. Nanostructured Ag2Se films with controlled thickness are synthesized using an ion sputtering of Ag and a room-temperature selenization method and then assembled into a detector. Under identical illumination, Ag2Se films of different thicknesses produce varying output photothermal voltages, influenced by factors including λ. By establishing a direct relationship between the photothermal voltage and the absorption of Ag2Se films of varied thickness, we successfully eliminate variables independent of λ, thus determining λ. Subsequently, I is determined by the calibrated responsivity relationship using obtained λ. Our PTE detector achieves a broadband spectrum from 400 to 950 nm and high accuracy, with deviations as low as ∼2.63 and ∼0.53% for deciphered λ and I, respectively. This method allows for self-powered broadband decipherable photodetection without a complex device architecture or computational assistance, which could boost the research enthusiasm and promote the commercialization of PTE broadband detectors.","lang":"eng"}],"page":"47923-47930","month":"09","author":[{"full_name":"Zhou, Jiamin","first_name":"Jiamin","last_name":"Zhou"},{"first_name":"Shengduo","full_name":"Xu, Shengduo","last_name":"Xu","id":"12ab8624-4c8a-11ec-9e11-e1ac2438f22f"},{"last_name":"Shuai","full_name":"Shuai, Yi","first_name":"Yi"},{"first_name":"Qiang","full_name":"Sun, Qiang","last_name":"Sun"},{"first_name":"Huangshui","full_name":"Ma, Huangshui","last_name":"Ma"},{"full_name":"Wang, Chao","first_name":"Chao","last_name":"Wang"},{"last_name":"Wu","full_name":"Wu, Haijuan","first_name":"Haijuan"},{"first_name":"Shanshan","full_name":"Tan, Shanshan","last_name":"Tan"},{"last_name":"Wang","first_name":"Zegao","full_name":"Wang, Zegao"},{"last_name":"Yang","full_name":"Yang, Lei","first_name":"Lei"}],"OA_type":"closed access","publication_status":"published","date_updated":"2025-09-08T09:15:07Z","article_type":"original","status":"public","scopus_import":"1","title":"Decipher the wavelength and intensity using photothermoelectric detectors","_id":"17896","language":[{"iso":"eng"}],"publication":"ACS Applied Materials and Interfaces"},{"oa_version":"None","external_id":{"isi":["001298924700001"]},"date_created":"2024-09-08T22:01:13Z","year":"2024","isi":1,"volume":17,"abstract":[{"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.","lang":"eng"}],"page":"7193-7208","month":"08","author":[{"last_name":"He","first_name":"Ren","full_name":"He, Ren"},{"first_name":"Shiqi","full_name":"Wang, Shiqi","last_name":"Wang"},{"last_name":"Yang","full_name":"Yang, Linlin","first_name":"Linlin"},{"id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc","last_name":"Horta","full_name":"Horta, Sharona","first_name":"Sharona"},{"last_name":"Ding","first_name":"Yang","full_name":"Ding, Yang"},{"first_name":"Chong","full_name":"Di, Chong","last_name":"Di"},{"full_name":"Zhang, Xuesong","first_name":"Xuesong","last_name":"Zhang"},{"last_name":"Xu","first_name":"Ying","full_name":"Xu, Ying"},{"last_name":"Ibáñez","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","first_name":"Maria","full_name":"Ibáñez, Maria"},{"last_name":"Zhou","full_name":"Zhou, Yingtang","first_name":"Yingtang"},{"full_name":"Mebs, Stefan","first_name":"Stefan","last_name":"Mebs"},{"last_name":"Dau","first_name":"Holger","full_name":"Dau, Holger"},{"last_name":"Hausmann","first_name":"Jan Niklas","full_name":"Hausmann, Jan Niklas"},{"last_name":"Huo","first_name":"Wenyi","full_name":"Huo, Wenyi"},{"last_name":"Menezes","first_name":"Prashanth W.","full_name":"Menezes, Prashanth W."},{"last_name":"Cabot","first_name":"Andreu","full_name":"Cabot, Andreu"}],"OA_type":"closed access","publication_status":"published","date_updated":"2025-09-08T09:15:49Z","article_type":"original","scopus_import":"1","status":"public","title":"Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery","_id":"17897","language":[{"iso":"eng"}],"publication":"Energy and Environmental Science","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.","doi":"10.1039/d4ee01912a","type":"journal_article","date_published":"2024-08-22T00:00:00Z","intvolume":" 17","day":"22","quality_controlled":"1","publication_identifier":{"issn":["1754-5692"],"eissn":["1754-5706"]},"article_processing_charge":"No","issue":"19","publisher":"Royal Society of Chemistry","department":[{"_id":"MaIb"}],"citation":{"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. Energy and Environmental Science. 2024;17(19):7193-7208. doi:10.1039/d4ee01912a","ieee":"R. He et al., “Active site switching on high entropy phosphides as bifunctional oxygen electrocatalysts for rechargeable/robust Zn-air battery,” Energy and Environmental Science, vol. 17, no. 19. Royal Society of Chemistry, pp. 7193–7208, 2024.","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. Energy and Environmental Science. Royal Society of Chemistry. https://doi.org/10.1039/d4ee01912a","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.” Energy and Environmental Science. Royal Society of Chemistry, 2024. https://doi.org/10.1039/d4ee01912a.","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.","mla":"He, Ren, et al. “Active Site Switching on High Entropy Phosphides as Bifunctional Oxygen Electrocatalysts for Rechargeable/Robust Zn-Air Battery.” Energy and Environmental Science, vol. 17, no. 19, Royal Society of Chemistry, 2024, pp. 7193–208, doi:10.1039/d4ee01912a."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345"},{"citation":{"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.","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: Proceedings of the 2024 IEEE International Conference on Robotics and Automation. Institute of Electrical and Electronics Engineers; 2024:2774-2782. doi:10.1109/ICRA57147.2024.10610284","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 Proceedings of the 2024 IEEE International Conference on Robotics and Automation, 2774–82. Institute of Electrical and Electronics Engineers, 2024. https://doi.org/10.1109/ICRA57147.2024.10610284.","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 Proceedings of the 2024 IEEE International Conference on Robotics and Automation, Yokohama, Japan, 2024, pp. 2774–2782.","apa":"Lechner, M., Hasani, R., Amini, A., Wang, T. H., Henzinger, T. A., & Rus, D. (2024). Overparametrization helps offline-to-online generalization of closed-loop control from pixels. In Proceedings of the 2024 IEEE International Conference on Robotics and Automation (pp. 2774–2782). Yokohama, Japan: Institute of Electrical and Electronics Engineers. https://doi.org/10.1109/ICRA57147.2024.10610284","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.","mla":"Lechner, Mathias, et al. “Overparametrization Helps Offline-to-Online Generalization of Closed-Loop Control from Pixels.” Proceedings of the 2024 IEEE International Conference on Robotics and Automation, Institute of Electrical and Electronics Engineers, 2024, pp. 2774–82, doi:10.1109/ICRA57147.2024.10610284."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ToHe"}],"publisher":"Institute of Electrical and Electronics Engineers","article_processing_charge":"No","publication_identifier":{"issn":["1050-4729"],"isbn":["9798350384574"]},"quality_controlled":"1","day":"08","date_published":"2024-08-08T00:00:00Z","type":"conference","conference":{"end_date":"2024-05-17","location":"Yokohama, Japan","start_date":"2024-05-13","name":"ICRA: International Conference on Robotics and Automation"},"doi":"10.1109/ICRA57147.2024.10610284","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.","language":[{"iso":"eng"}],"publication":"Proceedings of the 2024 IEEE International Conference on Robotics and Automation","_id":"17898","title":"Overparametrization helps offline-to-online generalization of closed-loop control from pixels","scopus_import":"1","status":"public","date_updated":"2025-09-08T09:16:28Z","publication_status":"published","month":"08","author":[{"first_name":"Mathias","full_name":"Lechner, Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","last_name":"Lechner"},{"first_name":"Ramin","full_name":"Hasani, Ramin","last_name":"Hasani"},{"last_name":"Amini","full_name":"Amini, Alexander","first_name":"Alexander"},{"last_name":"Wang","full_name":"Wang, Tsun Hsuan","first_name":"Tsun Hsuan"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A"},{"full_name":"Rus, Daniela","first_name":"Daniela","last_name":"Rus"}],"page":"2774-2782","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."}],"ec_funded":1,"isi":1,"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"year":"2024","external_id":{"isi":["001294576202044"]},"date_created":"2024-09-08T22:01:13Z","oa_version":"None"},{"type":"book_chapter","doi":"10.1007/978-1-0716-4019-7_8","place":"New York","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.","acknowledged_ssus":[{"_id":"EM-Fac"}],"corr_author":"1","alternative_title":["Neuromethods"],"department":[{"_id":"EM-Fac"},{"_id":"RySh"}],"citation":{"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. New Aspects in Analyzing the Synaptic Organization of the Brain. 1st ed. New York: Springer Nature; 2024:123-137. doi:10.1007/978-1-0716-4019-7_8","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.","mla":"Kleindienst, David, et al. “Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning.” New Aspects in Analyzing the Synaptic Organization of the Brain, edited by Joachim H.R. Lübke and Astrid Rollenhagen, 1st ed., Springer Nature, 2024, pp. 123–37, doi:10.1007/978-1-0716-4019-7_8.","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.","apa":"Kleindienst, D., Costanzo, T., & Shigemoto, R. (2024). Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning. In J. H. R. Lübke & A. Rollenhagen (Eds.), New Aspects in Analyzing the Synaptic Organization of the Brain (1st ed., pp. 123–137). New York: Springer Nature. https://doi.org/10.1007/978-1-0716-4019-7_8","ieee":"D. Kleindienst, T. Costanzo, and R. Shigemoto, “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, 1st ed., J. H. R. Lübke and A. Rollenhagen, Eds. New York: Springer Nature, 2024, pp. 123–137.","chicago":"Kleindienst, David, Tommaso Costanzo, and Ryuichi Shigemoto. “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, edited by Joachim H.R. Lübke and Astrid Rollenhagen, 1st ed., 123–37. New York: Springer Nature, 2024. https://doi.org/10.1007/978-1-0716-4019-7_8."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","article_processing_charge":"No","publication_identifier":{"eissn":["1940-6045"],"isbn":["9781071640180"],"eisbn":["9781071640197"],"issn":["0893-2336"]},"quality_controlled":"1","day":"27","date_published":"2024-08-27T00:00:00Z","page":"123-137","edition":"1","abstract":[{"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.","lang":"eng"}],"ec_funded":1,"project":[{"_id":"25CA28EA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"In situ analysis of single channel subunit composition in neurons: physiological implication in synaptic plasticity and behaviour","grant_number":"694539"}],"year":"2024","date_created":"2024-09-10T12:32:38Z","oa_version":"None","publication":"New Aspects in Analyzing the Synaptic Organization of the Brain","language":[{"iso":"eng"}],"_id":"18052","title":"Automated Imaging and Analysis of Synapses in Freeze-Fracture Replica Samples with Deep Learning","scopus_import":"1","status":"public","date_updated":"2025-04-14T07:27:15Z","editor":[{"first_name":"Joachim H.R. ","full_name":"Lübke, Joachim H.R. ","last_name":"Lübke"},{"first_name":"Astrid","full_name":"Rollenhagen, Astrid","last_name":"Rollenhagen"}],"publication_status":"published","author":[{"last_name":"Kleindienst","id":"42E121A4-F248-11E8-B48F-1D18A9856A87","first_name":"David","full_name":"Kleindienst, David"},{"orcid":"0000-0001-9732-3815","first_name":"Tommaso","full_name":"Costanzo, Tommaso","last_name":"Costanzo","id":"D93824F4-D9BA-11E9-BB12-F207E6697425"},{"orcid":"0000-0001-8761-9444","first_name":"Ryuichi","full_name":"Shigemoto, Ryuichi","last_name":"Shigemoto","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87"}],"month":"08"},{"date_published":"2024-09-05T00:00:00Z","author":[{"first_name":"Jake","orcid":"0000-0002-8698-3823","full_name":"Watson, Jake","id":"63836096-4690-11EA-BD4E-32803DDC885E","last_name":"Watson"},{"first_name":"Sandra","full_name":"Arroyo-Urea, Sandra","last_name":"Arroyo-Urea"},{"full_name":"García-Nafría, Javier","first_name":"Javier","last_name":"García-Nafría"}],"month":"09","day":"05","date_updated":"2024-09-11T11:16:58Z","publication_status":"published","quality_controlled":"1","editor":[{"full_name":"Liu, Dongyou","first_name":"Dongyou","last_name":"Liu"}],"publication_identifier":{"eisbn":["9781003055211"]},"title":"DNA Cloning","scopus_import":"1","article_processing_charge":"No","status":"public","citation":{"ieee":"J. Watson, S. Arroyo-Urea, and J. García-Nafría, “DNA Cloning,” in Handbook of Molecular Biotechnology, 1st ed., D. Liu, Ed. Boca Raton: CRC Press, 2024, pp. 66–72.","chicago":"Watson, Jake, Sandra Arroyo-Urea, and Javier García-Nafría. “DNA Cloning.” In Handbook of Molecular Biotechnology, edited by Dongyou Liu, 1st ed., 66–72. Boca Raton: CRC Press, 2024. https://doi.org/10.1201/9781003055211-8.","apa":"Watson, J., Arroyo-Urea, S., & García-Nafría, J. (2024). DNA Cloning. In D. Liu (Ed.), Handbook of Molecular Biotechnology (1st ed., pp. 66–72). Boca Raton: CRC Press. https://doi.org/10.1201/9781003055211-8","ista":"Watson J, Arroyo-Urea S, García-Nafría J. 2024.DNA Cloning. In: Handbook of Molecular Biotechnology. , 66–72.","mla":"Watson, Jake, et al. “DNA Cloning.” Handbook of Molecular Biotechnology, edited by Dongyou Liu, 1st ed., CRC Press, 2024, pp. 66–72, doi:10.1201/9781003055211-8.","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.","ama":"Watson J, Arroyo-Urea S, García-Nafría J. DNA Cloning. In: Liu D, ed. Handbook of Molecular Biotechnology. 1st ed. Boca Raton: CRC Press; 2024:66-72. doi:10.1201/9781003055211-8"},"_id":"18058","department":[{"_id":"PeJo"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"CRC Press","publication":"Handbook of Molecular Biotechnology","language":[{"iso":"eng"}],"oa_version":"None","date_created":"2024-09-11T10:40:36Z","year":"2024","place":"Boca Raton","doi":"10.1201/9781003055211-8","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."}],"type":"book_chapter","edition":"1","page":"66-72"},{"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"},"article_number":"109946","has_accepted_license":"1","corr_author":"1","type":"journal_article","file_date_updated":"2025-01-13T08:54:09Z","doi":"10.1016/j.aim.2024.109946","oa":1,"quality_controlled":"1","arxiv":1,"day":"01","intvolume":" 457","OA_place":"publisher","date_published":"2024-11-01T00:00:00Z","issue":"11","publisher":"Elsevier","department":[{"_id":"TiBr"}],"citation":{"mla":"Chan, Stephanie. “The Average Number of Integral Points on the Congruent Number Curves.” Advances in Mathematics, vol. 457, no. 11, 109946, Elsevier, 2024, doi:10.1016/j.aim.2024.109946.","ista":"Chan S. 2024. The average number of integral points on the congruent number curves. Advances in Mathematics. 457(11), 109946.","apa":"Chan, S. (2024). The average number of integral points on the congruent number curves. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2024.109946","chicago":"Chan, Stephanie. “The Average Number of Integral Points on the Congruent Number Curves.” Advances in Mathematics. Elsevier, 2024. https://doi.org/10.1016/j.aim.2024.109946.","ieee":"S. Chan, “The average number of integral points on the congruent number curves,” Advances in Mathematics, vol. 457, no. 11. Elsevier, 2024.","ama":"Chan S. The average number of integral points on the congruent number curves. Advances in Mathematics. 2024;457(11). doi:10.1016/j.aim.2024.109946","short":"S. Chan, Advances in Mathematics 457 (2024)."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"eissn":["1090-2082"],"issn":["0001-8708"]},"date_created":"2024-09-15T22:01:39Z","external_id":{"arxiv":["2112.01615"]},"oa_version":"Published Version","abstract":[{"text":" We show that the total number of non-torsion integral points on the elliptic curves ED : y\r\n2 = x3 − D2x, where D ranges over positive squarefree integers less than N, is O(N(log N)\r\n−1/4+ǫ). The proof involves a discriminant-lowering procedure on integral binary quartic forms and an application of Heath-Brown’s method on estimating the average size of the 2-Selmer group of the curves in this family.","lang":"eng"}],"year":"2024","volume":457,"publication_status":"published","date_updated":"2025-01-13T08:54:36Z","ddc":["510"],"OA_type":"hybrid","author":[{"first_name":"Yik Tung","orcid":"0000-0001-8467-4106","full_name":"Chan, Yik Tung","id":"c4c0afc8-9262-11ed-9231-d8b0bc743af1","last_name":"Chan"}],"month":"11","language":[{"iso":"eng"}],"publication":"Advances in Mathematics","_id":"18064","scopus_import":"1","status":"public","file":[{"success":1,"date_created":"2025-01-13T08:54:09Z","date_updated":"2025-01-13T08:54:09Z","file_size":564386,"checksum":"f555742540ad91a3040aeafd68b1fcde","relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_name":"2024_AdvancesMath_Chan.pdf","file_id":"18829","creator":"dernst"}],"title":"The average number of integral points on the congruent number curves","article_type":"original"},{"intvolume":" 457","OA_place":"publisher","date_published":"2024-11-01T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"01","article_processing_charge":"Yes (via OA deal)","publication_identifier":{"issn":["0001-8708"],"eissn":["1090-2082"]},"publisher":"Elsevier","department":[{"_id":"VaKa"}],"citation":{"ama":"Hou X, Pan Y, Zhou Q. Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. 2024;457. doi:10.1016/j.aim.2024.109943","short":"X. Hou, Y. Pan, Q. Zhou, Advances in Mathematics 457 (2024).","mla":"Hou, Xuanji, et al. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” Advances in Mathematics, vol. 457, 109943, Elsevier, 2024, doi:10.1016/j.aim.2024.109943.","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.","apa":"Hou, X., Pan, Y., & Zhou, Q. (2024). Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles. Advances in Mathematics. Elsevier. https://doi.org/10.1016/j.aim.2024.109943","chicago":"Hou, Xuanji, Yi Pan, and Qi Zhou. “Dynamical Classification of Analytic One-Frequency Quasi-Periodic SO(3,R)-Cocycles.” Advances in Mathematics. Elsevier, 2024. https://doi.org/10.1016/j.aim.2024.109943.","ieee":"X. Hou, Y. Pan, and Q. Zhou, “Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles,” Advances in Mathematics, vol. 457. Elsevier, 2024."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","corr_author":"1","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"},"article_number":"109943","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.","has_accepted_license":"1","doi":"10.1016/j.aim.2024.109943","oa":1,"type":"journal_article","file_date_updated":"2025-01-13T08:29:27Z","author":[{"full_name":"Hou, Xuanji","first_name":"Xuanji","last_name":"Hou"},{"id":"1e21c7f7-9070-11eb-847d-8b04c7169523","last_name":"Pan","full_name":"Pan, Yi","first_name":"Yi"},{"first_name":"Qi","full_name":"Zhou, Qi","last_name":"Zhou"}],"month":"11","publication_status":"published","date_updated":"2025-09-08T09:44:19Z","OA_type":"hybrid","ddc":["510"],"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_AdvancesMath_Hou.pdf","creator":"dernst","file_id":"18826","date_created":"2025-01-13T08:29:27Z","success":1,"date_updated":"2025-01-13T08:29:27Z","checksum":"1c80b844a91d93cf4799f4a65873b18d","file_size":713659}],"status":"public","scopus_import":"1","title":"Dynamical classification of analytic one-frequency quasi-periodic SO(3,R)-cocycles","article_type":"original","language":[{"iso":"eng"}],"publication":"Advances in Mathematics","_id":"18065","oa_version":"Published Version","external_id":{"arxiv":["2311.17537"],"isi":["001315306500001"]},"date_created":"2024-09-15T22:01:39Z","year":"2024","project":[{"grant_number":"885707","name":"Spectral rigidity and integrability for billiards and geodesic flows","call_identifier":"H2020","_id":"9B8B92DE-BA93-11EA-9121-9846C619BF3A"}],"isi":1,"volume":457,"abstract":[{"lang":"eng","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."}],"ec_funded":1},{"title":"Bidding games with charging","file":[{"checksum":"cb6f2254b84922cd7bf224f550b73f4a","file_size":854430,"date_updated":"2024-09-17T09:35:03Z","success":1,"date_created":"2024-09-17T09:35:03Z","creator":"dernst","file_id":"18083","file_name":"2024_LIPICS_Avni.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file"}],"scopus_import":"1","status":"public","_id":"18066","publication":"35th International Conference on Concurrency Theory","language":[{"iso":"eng"}],"month":"09","author":[{"last_name":"Avni","id":"463C8BC2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5588-8287","first_name":"Guy","full_name":"Avni, Guy"},{"last_name":"Goharshady","full_name":"Goharshady, Ehsan Kafshdar","first_name":"Ehsan Kafshdar"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A"},{"id":"0834ff3c-6d72-11ec-94e0-b5b0a4fb8598","last_name":"Mallik","first_name":"Kaushik","orcid":"0000-0001-9864-7475","full_name":"Mallik, Kaushik"}],"ddc":["000"],"date_updated":"2025-12-02T13:46:11Z","publication_status":"published","project":[{"grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d"},{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818"}],"volume":311,"isi":1,"year":"2024","ec_funded":1,"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?"}],"oa_version":"Published Version","date_created":"2024-09-15T22:01:39Z","external_id":{"arxiv":["2407.06288"],"isi":["001556847400008"]},"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"article_processing_charge":"Yes","citation":{"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.","apa":"Avni, G., Goharshady, E. K., Henzinger, T. A., & Mallik, K. (2024). Bidding games with charging. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.8","chicago":"Avni, Guy, Ehsan Kafshdar Goharshady, Thomas A Henzinger, and Kaushik Mallik. “Bidding Games with Charging.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.8.","ieee":"G. Avni, E. K. Goharshady, T. A. Henzinger, and K. Mallik, “Bidding games with charging,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.","mla":"Avni, Guy, et al. “Bidding Games with Charging.” 35th International Conference on Concurrency Theory, vol. 311, 8, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.8.","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: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.8"},"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","date_published":"2024-09-01T00:00:00Z","intvolume":" 311","day":"01","arxiv":1,"quality_controlled":"1","oa":1,"doi":"10.4230/LIPIcs.CONCUR.2024.8","conference":{"end_date":"2024-09-13","location":"Calgary, Canada","start_date":"2024-09-09","name":"CONCUR: Conference on Concurrency Theory"},"file_date_updated":"2024-09-17T09:35:03Z","type":"conference","corr_author":"1","has_accepted_license":"1","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.","article_number":"8","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","intvolume":" 311","day":"01","arxiv":1,"quality_controlled":"1","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"article_processing_charge":"No","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","citation":{"mla":"Boker, Udi, et al. “History-Determinism vs Fair Simulation.” 35th International Conference on Concurrency Theory, vol. 311, 12, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.12.","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.","ieee":"U. Boker, T. A. Henzinger, K. Lehtinen, and A. Prakash, “History-determinism vs fair simulation,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.","chicago":"Boker, Udi, Thomas A Henzinger, Karoliina Lehtinen, and Aditya Prakash. “History-Determinism vs Fair Simulation.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12.","apa":"Boker, U., Henzinger, T. A., Lehtinen, K., & Prakash, A. (2024). History-determinism vs fair simulation. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.12","ama":"Boker U, Henzinger TA, Lehtinen K, Prakash A. History-determinism vs fair simulation. In: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.12","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."},"alternative_title":["LIPIcs"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"ToHe"}],"corr_author":"1","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)","has_accepted_license":"1","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"},"article_number":"12","oa":1,"doi":"10.4230/LIPIcs.CONCUR.2024.12","conference":{"start_date":"2024-09-09","name":"CONCUR: Conference on Concurrency Theory","end_date":"2024-09-13","location":"Calgary, Canada"},"type":"conference","file_date_updated":"2024-09-17T07:31:18Z","month":"09","author":[{"last_name":"Boker","id":"31E297B6-F248-11E8-B48F-1D18A9856A87","full_name":"Boker, Udi","first_name":"Udi"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","orcid":"0000-0002-2985-7724"},{"last_name":"Lehtinen","full_name":"Lehtinen, Karoliina","first_name":"Karoliina"},{"last_name":"Prakash","full_name":"Prakash, Aditya","first_name":"Aditya"}],"ddc":["000"],"publication_status":"published","date_updated":"2025-12-02T13:44:54Z","status":"public","scopus_import":"1","file":[{"checksum":"66db11ef8e600a434079c278050c3f09","file_size":766902,"date_updated":"2024-09-17T07:31:18Z","success":1,"date_created":"2024-09-17T07:31:18Z","file_id":"18080","creator":"dernst","file_name":"2024_LIPICS_Boker.pdf","relation":"main_file","access_level":"open_access","content_type":"application/pdf"}],"title":"History-determinism vs fair simulation","_id":"18067","publication":"35th International Conference on Concurrency Theory","language":[{"iso":"eng"}],"oa_version":"Published Version","external_id":{"arxiv":["2407.08620"],"isi":["001556847400012"]},"date_created":"2024-09-15T22:01:40Z","year":"2024","project":[{"call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"volume":311,"isi":1,"ec_funded":1,"abstract":[{"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.","lang":"eng"}]},{"day":"01","arxiv":1,"quality_controlled":"1","date_published":"2024-09-01T00:00:00Z","intvolume":" 311","OA_place":"publisher","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","department":[{"_id":"ToHe"},{"_id":"GradSch"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"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.","ama":"Henzinger TA, Mazzocchi NA, Sarac NE. Strategic dominance: A new preorder for nondeterministic processes. In: 35th International Conference on Concurrency Theory. Vol 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2024. doi:10.4230/LIPIcs.CONCUR.2024.29","chicago":"Henzinger, Thomas A, Nicolas Adrien Mazzocchi, and Naci E Sarac. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” In 35th International Conference on Concurrency Theory, Vol. 311. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29.","apa":"Henzinger, T. A., Mazzocchi, N. A., & Sarac, N. E. (2024). Strategic dominance: A new preorder for nondeterministic processes. In 35th International Conference on Concurrency Theory (Vol. 311). Calgary, Canada: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.CONCUR.2024.29","ieee":"T. A. Henzinger, N. A. Mazzocchi, and N. E. Sarac, “Strategic dominance: A new preorder for nondeterministic processes,” in 35th International Conference on Concurrency Theory, Calgary, Canada, 2024, vol. 311.","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.","mla":"Henzinger, Thomas A., et al. “Strategic Dominance: A New Preorder for Nondeterministic Processes.” 35th International Conference on Concurrency Theory, vol. 311, 29, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2024, doi:10.4230/LIPIcs.CONCUR.2024.29."},"alternative_title":["LIPIcs"],"publication_identifier":{"issn":["1868-8969"],"isbn":["9783959773393"]},"article_processing_charge":"Yes","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.","has_accepted_license":"1","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"},"article_number":"29","corr_author":"1","conference":{"start_date":"2024-09-09","name":"CONCUR: Conference on Concurrency Theory","end_date":"2024-09-13","location":"Calgary, Canada"},"type":"conference","file_date_updated":"2024-09-17T07:48:56Z","oa":1,"doi":"10.4230/LIPIcs.CONCUR.2024.29","OA_type":"gold","ddc":["000"],"publication_status":"published","date_updated":"2025-12-02T13:45:38Z","author":[{"orcid":"0000-0002-2985-7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Nicolas Adrien","full_name":"Mazzocchi, Nicolas Adrien","last_name":"Mazzocchi","id":"b26baa86-3308-11ec-87b0-8990f34baa85"},{"id":"8C6B42F8-C8E6-11E9-A03A-F2DCE5697425","last_name":"Sarac","first_name":"Naci E","full_name":"Sarac, Naci E"}],"month":"09","_id":"18068","publication":"35th International Conference on Concurrency Theory","language":[{"iso":"eng"}],"scopus_import":"1","status":"public","file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_LIPICS_Henzinger.pdf","creator":"dernst","file_id":"18081","success":1,"date_created":"2024-09-17T07:48:56Z","date_updated":"2024-09-17T07:48:56Z","file_size":964124,"checksum":"555bd343e1fb38adeab8fc465ff4fad8"}],"title":"Strategic dominance: A new preorder for nondeterministic processes","date_created":"2024-09-15T22:01:40Z","external_id":{"arxiv":["2407.10473"],"isi":["001556847400029"]},"oa_version":"Published Version","ec_funded":1,"abstract":[{"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.","lang":"eng"}],"year":"2024","volume":311,"project":[{"name":"Vigilant Algorithmic Monitoring of Software","call_identifier":"H2020","_id":"62781420-2b32-11ec-9570-8d9b63373d4d","grant_number":"101020093"}],"isi":1},{"_id":"18069","language":[{"iso":"eng"}],"publication":"Astrophysical Journal","article_type":"original","file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2024_AstrophysicalJourn_Neufeld.pdf","file_id":"18082","creator":"dernst","success":1,"date_created":"2024-09-17T08:23:59Z","date_updated":"2024-09-17T08:23:59Z","checksum":"754b58c1d79adb9670ca76fa8c20ab16","file_size":9960685}],"scopus_import":"1","status":"public","title":"FRESCO: The Paschen-α star-forming sequence at cosmic noon","ddc":["520"],"publication_status":"published","date_updated":"2025-09-08T09:43:41Z","month":"09","author":[{"last_name":"Neufeld","first_name":"Chloe","full_name":"Neufeld, Chloe"},{"last_name":"Van Dokkum","first_name":"Pieter","full_name":"Van Dokkum, Pieter"},{"last_name":"Asali","first_name":"Yasmeen","full_name":"Asali, Yasmeen"},{"last_name":"Covelo-Paz","full_name":"Covelo-Paz, Alba","first_name":"Alba"},{"first_name":"Joel","full_name":"Leja, Joel","last_name":"Leja"},{"last_name":"Lin","full_name":"Lin, Jamie","first_name":"Jamie"},{"last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","first_name":"Jorryt J"},{"last_name":"Oesch","first_name":"Pascal A.","full_name":"Oesch, Pascal A."},{"last_name":"Reddy","first_name":"Naveen A.","full_name":"Reddy, Naveen A."},{"last_name":"Shivaei","full_name":"Shivaei, Irene","first_name":"Irene"},{"full_name":"Whitaker, Katherine E.","first_name":"Katherine E.","last_name":"Whitaker"},{"full_name":"Wuyts, Stijn","first_name":"Stijn","last_name":"Wuyts"},{"first_name":"Gabriel","full_name":"Brammer, Gabriel","last_name":"Brammer"},{"full_name":"Marchesini, Danilo","first_name":"Danilo","last_name":"Marchesini"},{"full_name":"Maseda, Michael V.","first_name":"Michael V.","last_name":"Maseda"},{"full_name":"Naidu, Rohan P.","first_name":"Rohan P.","last_name":"Naidu"},{"last_name":"Nelson","first_name":"Erica J.","full_name":"Nelson, Erica J."},{"full_name":"Velichko, Anna","first_name":"Anna","last_name":"Velichko"},{"last_name":"Weibel","first_name":"Andrea","full_name":"Weibel, Andrea"},{"full_name":"Xiao, Mengyuan","first_name":"Mengyuan","last_name":"Xiao"}],"abstract":[{"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.","lang":"eng"}],"year":"2024","isi":1,"volume":972,"external_id":{"isi":["001305987600001"]},"date_created":"2024-09-15T22:01:40Z","oa_version":"Published Version","publisher":"IOP Publishing","issue":"2","citation":{"ieee":"C. Neufeld et al., “FRESCO: The Paschen-α star-forming sequence at cosmic noon,” Astrophysical Journal, vol. 972, no. 2. IOP Publishing, 2024.","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.” Astrophysical Journal. IOP Publishing, 2024. https://doi.org/10.3847/1538-4357/ad6158.","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. Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ad6158","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.","mla":"Neufeld, Chloe, et al. “FRESCO: The Paschen-α Star-Forming Sequence at Cosmic Noon.” Astrophysical Journal, vol. 972, no. 2, 156, IOP Publishing, 2024, doi:10.3847/1538-4357/ad6158.","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. Astrophysical Journal. 2024;972(2). doi:10.3847/1538-4357/ad6158"},"department":[{"_id":"JoMa"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","publication_identifier":{"eissn":["1538-4357"],"issn":["0004-637X"]},"article_processing_charge":"Yes","day":"01","DOAJ_listed":"1","quality_controlled":"1","date_published":"2024-09-01T00:00:00Z","intvolume":" 972","type":"journal_article","file_date_updated":"2024-09-17T08:23:59Z","oa":1,"doi":"10.3847/1538-4357/ad6158","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).","has_accepted_license":"1","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"},"article_number":"156"},{"_id":"18070","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Chatterjee, Bapi, et al. “Federated SGD with Local Asynchrony.” Proceedings of the 44th International Conference on Distributed Computing Systems, IEEE, 2024, pp. 857–68, doi:10.1109/ICDCS60910.2024.00084.","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.","chicago":"Chatterjee, Bapi, Vyacheslav Kungurtsev, and Dan-Adrian Alistarh. “Federated SGD with Local Asynchrony.” In Proceedings of the 44th International Conference on Distributed Computing Systems, 857–68. IEEE, 2024. https://doi.org/10.1109/ICDCS60910.2024.00084.","ieee":"B. Chatterjee, V. Kungurtsev, and D.-A. Alistarh, “Federated SGD with local asynchrony,” in Proceedings of the 44th International Conference on Distributed Computing Systems, Jersey City, NJ, United States, 2024, pp. 857–868.","apa":"Chatterjee, B., Kungurtsev, V., & Alistarh, D.-A. (2024). Federated SGD with local asynchrony. In Proceedings of the 44th International Conference on Distributed Computing Systems (pp. 857–868). Jersey City, NJ, United States: IEEE. https://doi.org/10.1109/ICDCS60910.2024.00084","ama":"Chatterjee B, Kungurtsev V, Alistarh D-A. Federated SGD with local asynchrony. In: Proceedings of the 44th International Conference on Distributed Computing Systems. IEEE; 2024:857-868. doi:10.1109/ICDCS60910.2024.00084","short":"B. Chatterjee, V. Kungurtsev, D.-A. Alistarh, in:, Proceedings of the 44th International Conference on Distributed Computing Systems, IEEE, 2024, pp. 857–868."},"department":[{"_id":"DaAl"}],"publisher":"IEEE","publication":"Proceedings of the 44th International Conference on Distributed Computing Systems","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1063-6927"],"eissn":["2575-8411"],"isbn":["9798350386059"]},"title":"Federated SGD with local asynchrony","scopus_import":"1","article_processing_charge":"No","status":"public","day":"26","date_updated":"2025-09-08T09:23:48Z","publication_status":"published","quality_controlled":"1","date_published":"2024-07-26T00:00:00Z","month":"07","author":[{"orcid":"0000-0002-2742-4028","first_name":"Bapi","full_name":"Chatterjee, Bapi","last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav","last_name":"Kungurtsev"},{"last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian"}],"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."}],"conference":{"name":"ICDCS: International Conference on Distributed Computing Systems","start_date":"2024-07-23","location":"Jersey City, NJ, United States","end_date":"2024-07-26"},"type":"conference","page":"857-868","isi":1,"year":"2024","doi":"10.1109/ICDCS60910.2024.00084","external_id":{"isi":["001304430200075"]},"date_created":"2024-09-15T22:01:41Z","corr_author":"1","oa_version":"None"},{"author":[{"last_name":"Tsimos","full_name":"Tsimos, Giorgos","first_name":"Giorgos"},{"last_name":"Kichidis","first_name":"Anastasios","full_name":"Kichidis, Anastasios"},{"last_name":"Sonnino","first_name":"Alberto","full_name":"Sonnino, Alberto"},{"last_name":"Kokoris Kogias","id":"f5983044-d7ef-11ea-ac6d-fd1430a26d30","first_name":"Eleftherios","full_name":"Kokoris Kogias, Eleftherios"}],"month":"07","date_updated":"2025-09-08T09:42:36Z","publication_status":"published","title":"HammerHead: Leader reputation for dynamic scheduling","scopus_import":"1","status":"public","language":[{"iso":"eng"}],"publication":"Proceedings - International Conference on Distributed Computing Systems","_id":"18071","oa_version":"Preprint","date_created":"2024-09-15T22:01:41Z","external_id":{"isi":["001304430200120"],"arxiv":["2309.12713"]},"isi":1,"year":"2024","page":"1377-1387","abstract":[{"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).","lang":"eng"}],"date_published":"2024-07-26T00:00:00Z","quality_controlled":"1","arxiv":1,"day":"26","article_processing_charge":"No","publication_identifier":{"issn":["1063-6927"],"isbn":["9798350386059"],"eissn":["2575-8411"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","department":[{"_id":"ElKo"}],"citation":{"short":"G. Tsimos, A. Kichidis, A. Sonnino, E. Kokoris Kogias, in:, Proceedings - International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–1387.","ama":"Tsimos G, Kichidis A, Sonnino A, Kokoris Kogias E. HammerHead: Leader reputation for dynamic scheduling. In: Proceedings - International Conference on Distributed Computing Systems. IEEE; 2024:1377-1387. doi:10.1109/ICDCS60910.2024.00129","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 Proceedings - International Conference on Distributed Computing Systems, 1377–87. IEEE, 2024. https://doi.org/10.1109/ICDCS60910.2024.00129.","apa":"Tsimos, G., Kichidis, A., Sonnino, A., & Kokoris Kogias, E. (2024). HammerHead: Leader reputation for dynamic scheduling. In Proceedings - International Conference on Distributed Computing Systems (pp. 1377–1387). Jersey City, NJ, United States: IEEE. https://doi.org/10.1109/ICDCS60910.2024.00129","ieee":"G. Tsimos, A. Kichidis, A. Sonnino, and E. Kokoris Kogias, “HammerHead: Leader reputation for dynamic scheduling,” in Proceedings - International Conference on Distributed Computing Systems, Jersey City, NJ, United States, 2024, pp. 1377–1387.","mla":"Tsimos, Giorgos, et al. “HammerHead: Leader Reputation for Dynamic Scheduling.” Proceedings - International Conference on Distributed Computing Systems, IEEE, 2024, pp. 1377–87, doi:10.1109/ICDCS60910.2024.00129."},"publisher":"IEEE","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.","doi":"10.1109/ICDCS60910.2024.00129","oa":1,"type":"conference","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2309.12713"}],"conference":{"start_date":"2024-07-23","name":"ICDCS: International Conference on Distributed Computing Systems","end_date":"2024-07-26","location":"Jersey City, NJ, United States"}},{"ddc":["570"],"publication_status":"published","date_updated":"2025-09-08T09:23:02Z","author":[{"last_name":"Hernandez-Armendariz","first_name":"Alberto","full_name":"Hernandez-Armendariz, Alberto"},{"orcid":"0000-0002-9645-6576","first_name":"Valerio","full_name":"Sorichetti, Valerio","last_name":"Sorichetti","id":"ef8a92cb-c7b6-11ec-8bea-e1fd5847bc5b"},{"full_name":"Hayashi, Yuki","first_name":"Yuki","last_name":"Hayashi"},{"last_name":"Koskova","first_name":"Zuzana","full_name":"Koskova, Zuzana"},{"full_name":"Brunner, Andreas","first_name":"Andreas","last_name":"Brunner"},{"full_name":"Ellenberg, Jan","first_name":"Jan","last_name":"Ellenberg"},{"id":"bf63d406-f056-11eb-b41d-f263a6566d8b","last_name":"Šarić","full_name":"Šarić, Anđela","first_name":"Anđela","orcid":"0000-0002-7854-2139"},{"last_name":"Cuylen-Haering","full_name":"Cuylen-Haering, Sara","first_name":"Sara"}],"month":"09","_id":"18072","language":[{"iso":"eng"}],"publication":"Molecular Cell","article_type":"original","file":[{"checksum":"3f360e0287b8ec79fb2b8b02b5070360","file_size":11654644,"date_created":"2024-09-16T07:38:38Z","success":1,"date_updated":"2024-09-16T07:38:38Z","creator":"dernst","file_id":"18075","content_type":"application/pdf","access_level":"open_access","relation":"main_file","file_name":"2024_MolecularCell_HernandezArmendariz.pdf"}],"scopus_import":"1","status":"public","title":"A liquid-like coat mediates chromosome clustering during mitotic exit","date_created":"2024-09-15T22:01:41Z","external_id":{"pmid":["39153474"],"isi":["001309051100001"]},"oa_version":"Published Version","ec_funded":1,"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"}],"page":"P3254-3270.E9","year":"2024","isi":1,"volume":84,"project":[{"grant_number":"802960","name":"Non-Equilibrium Protein Assembly: from Building Blocks to Biological Machines","call_identifier":"H2020","_id":"eba2549b-77a9-11ec-83b8-a81e493eae4e"}],"day":"05","quality_controlled":"1","date_published":"2024-09-05T00:00:00Z","intvolume":" 84","issue":"17","publisher":"Cell Press","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","citation":{"mla":"Hernandez-Armendariz, Alberto, et al. “A Liquid-like Coat Mediates Chromosome Clustering during Mitotic Exit.” Molecular Cell, vol. 84, no. 17, Cell Press, 2024, p. P3254–3270.E9, doi:10.1016/j.molcel.2024.07.022.","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.","ieee":"A. Hernandez-Armendariz et al., “A liquid-like coat mediates chromosome clustering during mitotic exit,” Molecular Cell, vol. 84, no. 17. Cell Press, p. P3254–3270.E9, 2024.","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.” Molecular Cell. Cell Press, 2024. https://doi.org/10.1016/j.molcel.2024.07.022.","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. Molecular Cell. Cell Press. https://doi.org/10.1016/j.molcel.2024.07.022","ama":"Hernandez-Armendariz A, Sorichetti V, Hayashi Y, et al. A liquid-like coat mediates chromosome clustering during mitotic exit. Molecular Cell. 2024;84(17):P3254-3270.E9. doi:10.1016/j.molcel.2024.07.022","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."},"department":[{"_id":"AnSa"}],"publication_identifier":{"eissn":["1097-4164"],"issn":["1097-2765"]},"article_processing_charge":"Yes (in subscription journal)","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).","has_accepted_license":"1","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"},"type":"journal_article","pmid":1,"file_date_updated":"2024-09-16T07:38:38Z","oa":1,"doi":"10.1016/j.molcel.2024.07.022"}]