[{"acknowledgement":"This work has been funded by the Cluster of Excellence “Advanced Imaging of Matter” of the Deutsche Forschungsgemeinschaft (DFG) - EXC 2056 - Project ID 390715994.\r\nG.M.K. gratefully acknowledges funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 101034413.","oa":1,"quality_controlled":"1","publisher":"American Physical Society","publication":"Physical Review Research","day":"01","year":"2024","has_accepted_license":"1","date_created":"2024-03-25T08:57:07Z","date_published":"2024-03-01T00:00:00Z","doi":"10.1103/physrevresearch.6.013257","article_number":"013257","project":[{"_id":"fc2ed2f7-9c52-11eb-aca3-c01059dda49c","call_identifier":"H2020","name":"IST-BRIDGE: International postdoctoral program","grant_number":"101034413"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"short":"A. Becker, G. Koutentakis, P. Schmelcher, Physical Review Research 6 (2024).","ieee":"A. Becker, G. Koutentakis, and P. Schmelcher, “Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions,” Physical Review Research, vol. 6, no. 1. American Physical Society, 2024.","apa":"Becker, A., Koutentakis, G., & Schmelcher, P. (2024). Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.6.013257","ama":"Becker A, Koutentakis G, Schmelcher P. Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions. Physical Review Research. 2024;6(1). doi:10.1103/physrevresearch.6.013257","mla":"Becker, A., et al. “Synthetic Dimension-Induced Pseudo Jahn-Teller Effect in One-Dimensional Confined Fermions.” Physical Review Research, vol. 6, no. 1, 013257, American Physical Society, 2024, doi:10.1103/physrevresearch.6.013257.","ista":"Becker A, Koutentakis G, Schmelcher P. 2024. Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions. Physical Review Research. 6(1), 013257.","chicago":"Becker, A., Georgios Koutentakis, and P. Schmelcher. “Synthetic Dimension-Induced Pseudo Jahn-Teller Effect in One-Dimensional Confined Fermions.” Physical Review Research. American Physical Society, 2024. https://doi.org/10.1103/physrevresearch.6.013257."},"title":"Synthetic dimension-induced pseudo Jahn-Teller effect in one-dimensional confined fermions","external_id":{"arxiv":["2310.17995"]},"article_processing_charge":"Yes","author":[{"full_name":"Becker, A.","last_name":"Becker","first_name":"A."},{"full_name":"Koutentakis, Georgios","last_name":"Koutentakis","id":"d7b23d3a-9e21-11ec-b482-f76739596b95","first_name":"Georgios"},{"first_name":"P.","full_name":"Schmelcher, P.","last_name":"Schmelcher"}],"oa_version":"Published Version","abstract":[{"text":"We demonstrate the failure of the adiabatic Born-Oppenheimer approximation to describe the ground state of a quantum impurity within an ultracold Fermi gas despite substantial mass differences between the bath and impurity species. Increasing repulsion leads to the appearance of nonadiabatic couplings between the fast bath and slow impurity degrees of freedom, which reduce the parity symmetry of the latter according to the pseudo Jahn-Teller effect. The presence of this mechanism is associated to a conical intersection involving the impurity position and the inverse of the interaction strength, which acts as a synthetic dimension. We elucidate the presence of these effects via a detailed ground-state analysis involving the comparison of ab initio fully correlated simulations with effective models. Our study suggests ultracold atomic ensembles as potent emulators of complex molecular phenomena.","lang":"eng"}],"intvolume":" 6","month":"03","scopus_import":"1","language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"file_id":"15183","checksum":"4e0e58d1f58386fb016284c84db2a300","file_size":2207067,"date_updated":"2024-03-25T09:24:55Z","creator":"dernst","file_name":"2024_PhysicalReviewResearch_Becker.pdf","date_created":"2024-03-25T09:24:55Z"}],"publication_status":"published","publication_identifier":{"issn":["2643-1564"]},"ec_funded":1,"issue":"1","volume":6,"_id":"15181","status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","ddc":["530"],"date_updated":"2024-03-25T09:27:37Z","file_date_updated":"2024-03-25T09:24:55Z","department":[{"_id":"MiLe"}]},{"author":[{"full_name":"Kleinhanns, Tobias","last_name":"Kleinhanns","first_name":"Tobias","id":"8BD9DE16-AB3C-11E9-9C8C-2A03E6697425"},{"full_name":"Milillo, Francesco","last_name":"Milillo","first_name":"Francesco","id":"38b830db-ea88-11ee-bf9b-929beaf79054"},{"first_name":"Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4566-5877","full_name":"Calcabrini, Mariano","last_name":"Calcabrini"},{"last_name":"Fiedler","full_name":"Fiedler, Christine","first_name":"Christine","id":"bd3fceba-dc74-11ea-a0a7-c17f71817366"},{"last_name":"Horta","full_name":"Horta, Sharona","first_name":"Sharona","id":"03a7e858-01b1-11ec-8b71-99ae6c4a05bc"},{"last_name":"Balazs","full_name":"Balazs, Daniel","orcid":"0000-0001-7597-043X","id":"302BADF6-85FC-11EA-9E3B-B9493DDC885E","first_name":"Daniel"},{"last_name":"Strumolo","full_name":"Strumolo, Marissa J.","first_name":"Marissa J."},{"full_name":"Hasler, Roger","last_name":"Hasler","first_name":"Roger"},{"full_name":"Llorca, Jordi","last_name":"Llorca","first_name":"Jordi"},{"full_name":"Tkadletz, Michael","last_name":"Tkadletz","first_name":"Michael"},{"first_name":"Richard L.","full_name":"Brutchey, Richard L.","last_name":"Brutchey"},{"first_name":"Maria","id":"43C61214-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5013-2843","full_name":"Ibáñez, Maria","last_name":"Ibáñez"}],"article_processing_charge":"Yes (via OA deal)","title":"A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se","citation":{"apa":"Kleinhanns, T., Milillo, F., Calcabrini, M., Fiedler, C., Horta, S., Balazs, D., … Ibáñez, M. (2024). A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. Advanced Energy Materials. Wiley. https://doi.org/10.1002/aenm.202400408","ama":"Kleinhanns T, Milillo F, Calcabrini M, et al. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. Advanced Energy Materials. 2024. doi:10.1002/aenm.202400408","ieee":"T. Kleinhanns et al., “A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se,” Advanced Energy Materials. Wiley, 2024.","short":"T. Kleinhanns, F. Milillo, M. Calcabrini, C. Fiedler, S. Horta, D. Balazs, M.J. Strumolo, R. Hasler, J. Llorca, M. Tkadletz, R.L. Brutchey, M. Ibáñez, Advanced Energy Materials (2024).","mla":"Kleinhanns, Tobias, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” Advanced Energy Materials, 2400408, Wiley, 2024, doi:10.1002/aenm.202400408.","ista":"Kleinhanns T, Milillo F, Calcabrini M, Fiedler C, Horta S, Balazs D, Strumolo MJ, Hasler R, Llorca J, Tkadletz M, Brutchey RL, Ibáñez M. 2024. A route to high thermoelectric performance: Solution‐based control of microstructure and composition in Ag2Se. Advanced Energy Materials., 2400408.","chicago":"Kleinhanns, Tobias, Francesco Milillo, Mariano Calcabrini, Christine Fiedler, Sharona Horta, Daniel Balazs, Marissa J. Strumolo, et al. “A Route to High Thermoelectric Performance: Solution‐based Control of Microstructure and Composition in Ag2Se.” Advanced Energy Materials. Wiley, 2024. https://doi.org/10.1002/aenm.202400408."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"}],"article_number":"2400408","doi":"10.1002/aenm.202400408","date_published":"2024-03-13T00:00:00Z","date_created":"2024-03-25T08:57:40Z","year":"2024","day":"13","publication":"Advanced Energy Materials","publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported by the Scientific Service Units (SSU) of ISTA through resources provided by the Electron Microscopy Facility (EMF), the Lab Support Facility (LSF), and the Nanofabrication Facility (NNF). This work was financially supported by ISTA and the Werner Siemens Foundation. The USTEM Service Unit of the Technical University of Vienna is acknowledged for EBSD sample preparation and analysis. R.L.B. acknowledges the National Science Foundation for funding the mass spectrometry analysis under award DMR 1904719. J.L. is a Serra Húnter Fellow and is grateful to the ICREA Academia program and projects MICINN/FEDER PID2021-124572OB-C31 and GC 2021 SGR 01061.","department":[{"_id":"MaIb"},{"_id":"LifeSc"}],"date_updated":"2024-03-25T09:21:05Z","article_type":"original","type":"journal_article","status":"public","_id":"15182","publication_identifier":{"eissn":["1614-6840"],"issn":["1614-6832"]},"publication_status":"epub_ahead","language":[{"iso":"eng"}],"scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/aenm.202400408"}],"month":"03","abstract":[{"lang":"eng","text":"Thermoelectric materials convert heat into electricity, with a broad range of applications near room temperature (RT). However, the library of RT high-performance materials is limited. Traditional high-temperature synthetic methods constrain the range of materials achievable, hindering the ability to surpass crystal structure limitations and engineer defects. Here, a solution-based synthetic approach is introduced, enabling RT synthesis of powders and exploration of densification at lower temperatures to influence the material's microstructure. The approach is exemplified by Ag2Se, an n-type alternative to bismuth telluride. It is demonstrated that the concentration of Ag interstitials, grain boundaries, and dislocations are directly correlated to the sintering temperature, and achieve a figure of merit of 1.1 from RT to 100 °C after optimization. Moreover, insights into and resolve Ag2Se's challenges are provided, including stoichiometry issues leading to irreproducible performances. This work highlights the potential of RT solution synthesis in expanding the repertoire of high-performance thermoelectric materials for practical applications."}],"acknowledged_ssus":[{"_id":"EM-Fac"},{"_id":"LifeSc"},{"_id":"NanoFab"}],"oa_version":"Published Version"},{"publisher":"Wiley","quality_controlled":"1","oa":1,"acknowledgement":"The author gratefully acknowledges ISTA for supporting this research through funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (Project CLUSTER, grant agreement No. 805041).","doi":"10.1029/2023GL106569","date_published":"2024-03-16T00:00:00Z","date_created":"2024-03-24T23:00:58Z","day":"16","publication":"Geophysical Research Letters","has_accepted_license":"1","year":"2024","project":[{"_id":"629205d8-2b32-11ec-9570-e1356ff73576","call_identifier":"H2020","grant_number":"805041","name":"organization of CLoUdS, and implications of Tropical cyclones and for the Energetics of the tropics, in current and waRming climate"}],"article_number":"e2023GL106569","title":"A pre-monsoon signal of false alarms of Indian monsoon droughts","author":[{"full_name":"Goswami, Bidyut B","orcid":"0000-0001-8602-3083","last_name":"Goswami","first_name":"Bidyut B","id":"3a4ac09c-6d61-11ec-bf66-884cde66b64b"}],"article_processing_charge":"Yes","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"GOSWAMI, BIDYUT B. “A Pre-Monsoon Signal of False Alarms of Indian Monsoon Droughts.” Geophysical Research Letters, vol. 51, no. 5, e2023GL106569, Wiley, 2024, doi:10.1029/2023GL106569.","ieee":"B. B. GOSWAMI, “A pre-monsoon signal of false alarms of Indian monsoon droughts,” Geophysical Research Letters, vol. 51, no. 5. Wiley, 2024.","short":"B.B. GOSWAMI, Geophysical Research Letters 51 (2024).","apa":"GOSWAMI, B. B. (2024). A pre-monsoon signal of false alarms of Indian monsoon droughts. Geophysical Research Letters. Wiley. https://doi.org/10.1029/2023GL106569","ama":"GOSWAMI BB. A pre-monsoon signal of false alarms of Indian monsoon droughts. Geophysical Research Letters. 2024;51(5). doi:10.1029/2023GL106569","chicago":"GOSWAMI, BIDYUT B. “A Pre-Monsoon Signal of False Alarms of Indian Monsoon Droughts.” Geophysical Research Letters. Wiley, 2024. https://doi.org/10.1029/2023GL106569.","ista":"GOSWAMI BB. 2024. A pre-monsoon signal of false alarms of Indian monsoon droughts. Geophysical Research Letters. 51(5), e2023GL106569."},"month":"03","intvolume":" 51","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Current knowledge suggests a drought Indian monsoon (perhaps a severe one) when the El Nino Southern Oscillation and Pacific Decadal Oscillation each exhibit positive phases (a joint positive phase). For the monsoons, which are exceptions in this regard, we found northeast India often gets excess pre-monsoon rainfall. Further investigation reveals that this excess pre-monsoon rainfall is produced by the interaction of the large-scale circulation associated with the joint phase with the mountains in northeast India. We posit that a warmer troposphere, a consequence of excess rainfall over northeast India, drives a stronger monsoon circulation and enhances monsoon rainfall over central India. Hence, we argue that pre-monsoon rainfall over northeast India can be used for seasonal monsoon rainfall prediction over central India. Most importantly, its predictive value is at its peak when the Pacific Ocean exhibits a joint positive phase and the threat of extreme drought monsoon looms over India.","lang":"eng"}],"issue":"5","volume":51,"ec_funded":1,"file":[{"content_type":"application/pdf","relation":"main_file","access_level":"open_access","success":1,"checksum":"243bd966aca968ec7d9e474af8639f8d","file_id":"15178","file_size":2887134,"date_updated":"2024-03-25T08:36:00Z","creator":"dernst","file_name":"2024_GeophysResLetters_Goswami.pdf","date_created":"2024-03-25T08:36:00Z"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1944-8007"],"issn":["0094-8276"]},"publication_status":"published","status":"public","type":"journal_article","article_type":"original","tmp":{"short":"CC BY-NC-ND (4.0)","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","image":"/images/cc_by_nc_nd.png"},"_id":"15165","department":[{"_id":"CaMu"}],"file_date_updated":"2024-03-25T08:36:00Z","ddc":["550"],"date_updated":"2024-03-25T10:00:57Z"},{"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"original","status":"public","_id":"15146","department":[{"_id":"FlSc"},{"_id":"MiSi"},{"_id":"Bio"},{"_id":"EM-Fac"}],"file_date_updated":"2024-03-25T12:52:04Z","date_updated":"2024-03-25T13:03:57Z","ddc":["570"],"scopus_import":"1","intvolume":" 223","month":"03","acknowledged_ssus":[{"_id":"LifeSc"},{"_id":"ScienComp"},{"_id":"EM-Fac"},{"_id":"M-Shop"}],"abstract":[{"lang":"eng","text":"The extracellular matrix (ECM) serves as a scaffold for cells and plays an essential role in regulating numerous cellular processes, including cell migration and proliferation. Due to limitations in specimen preparation for conventional room-temperature electron microscopy, we lack structural knowledge on how ECM components are secreted, remodeled, and interact with surrounding cells. We have developed a 3D-ECM platform compatible with sample thinning by cryo-focused ion beam milling, the lift-out extraction procedure, and cryo-electron tomography. Our workflow implements cell-derived matrices (CDMs) grown on EM grids, resulting in a versatile tool closely mimicking ECM environments. This allows us to visualize ECM for the first time in its hydrated, native context. Our data reveal an intricate network of extracellular fibers, their positioning relative to matrix-secreting cells, and previously unresolved structural entities. Our workflow and results add to the structural atlas of the ECM, providing novel insights into its secretion and assembly."}],"oa_version":"Published Version","pmid":1,"ec_funded":1,"issue":"6","volume":223,"publication_status":"published","publication_identifier":{"eissn":["1540-8140"],"issn":["0021-9525"]},"language":[{"iso":"eng"}],"file":[{"success":1,"checksum":"90d1984a93660735e506c2a304bc3f73","file_id":"15188","relation":"main_file","access_level":"open_access","content_type":"application/pdf","file_name":"2024_JCB_Zens.pdf","date_created":"2024-03-25T12:52:04Z","creator":"dernst","file_size":11907016,"date_updated":"2024-03-25T12:52:04Z"}],"project":[{"name":"Structure and isoform diversity of the Arp2/3 complex","grant_number":"P33367","_id":"9B954C5C-BA93-11EA-9121-9846C619BF3A"},{"_id":"7bd318a1-9f16-11ee-852c-cc9217763180","grant_number":"E435","name":"In Situ Actin Structures via Hybrid Cryo-electron Microscopy"},{"name":"Cellular navigation along spatial gradients","grant_number":"724373","_id":"25FE9508-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"NÖ-Fonds Preis für die Jungforscherin des Jahres am IST Austria","_id":"059B463C-7A3F-11EA-A408-12923DDC885E"},{"_id":"2615199A-B435-11E9-9278-68D0E5697425","name":"Spatiotemporal regulation of chemokine-induced signalling in leukocyte chemotaxis","grant_number":"21317"},{"grant_number":"CZI01","name":"CryoMinflux-guided in-situ visual proteomics and structure determination","_id":"62909c6f-2b32-11ec-9570-e1476aab5308"}],"article_number":"e202309125","external_id":{"pmid":["38506714"]},"article_processing_charge":"Yes (via OA deal)","author":[{"id":"45FD126C-F248-11E8-B48F-1D18A9856A87","first_name":"Bettina","last_name":"Zens","full_name":"Zens, Bettina"},{"first_name":"Florian","id":"404F5528-F248-11E8-B48F-1D18A9856A87","last_name":"Fäßler","full_name":"Fäßler, Florian","orcid":"0000-0001-7149-769X"},{"first_name":"Jesse","id":"1063c618-6f9b-11ec-9123-f912fccded63","full_name":"Hansen, Jesse","last_name":"Hansen"},{"full_name":"Hauschild, Robert","orcid":"0000-0001-9843-3522","last_name":"Hauschild","first_name":"Robert","id":"4E01D6B4-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Julia","id":"3B12E2E6-F248-11E8-B48F-1D18A9856A87","full_name":"Datler, Julia","orcid":"0000-0002-3616-8580","last_name":"Datler"},{"last_name":"Hodirnau","full_name":"Hodirnau, Victor-Valentin","first_name":"Victor-Valentin","id":"3661B498-F248-11E8-B48F-1D18A9856A87"},{"id":"39C5A68A-F248-11E8-B48F-1D18A9856A87","first_name":"Vanessa","last_name":"Zheden","full_name":"Zheden, Vanessa","orcid":"0000-0002-9438-4783"},{"id":"2CC12E8C-F248-11E8-B48F-1D18A9856A87","first_name":"Jonna H","orcid":"0000-0002-7698-3061","full_name":"Alanko, Jonna H","last_name":"Alanko"},{"last_name":"Sixt","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","first_name":"Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87"},{"id":"48AD8942-F248-11E8-B48F-1D18A9856A87","first_name":"Florian KM","last_name":"Schur","orcid":"0000-0003-4790-8078","full_name":"Schur, Florian KM"}],"title":"Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix","citation":{"ista":"Zens B, Fäßler F, Hansen J, Hauschild R, Datler J, Hodirnau V-V, Zheden V, Alanko JH, Sixt MK, Schur FK. 2024. Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix. Journal of Cell Biology. 223(6), e202309125.","chicago":"Zens, Bettina, Florian Fäßler, Jesse Hansen, Robert Hauschild, Julia Datler, Victor-Valentin Hodirnau, Vanessa Zheden, Jonna H Alanko, Michael K Sixt, and Florian KM Schur. “Lift-out Cryo-FIBSEM and Cryo-ET Reveal the Ultrastructural Landscape of Extracellular Matrix.” Journal of Cell Biology. Rockefeller University Press, 2024. https://doi.org/10.1083/jcb.202309125.","ama":"Zens B, Fäßler F, Hansen J, et al. Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix. Journal of Cell Biology. 2024;223(6). doi:10.1083/jcb.202309125","apa":"Zens, B., Fäßler, F., Hansen, J., Hauschild, R., Datler, J., Hodirnau, V.-V., … Schur, F. K. (2024). Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix. Journal of Cell Biology. Rockefeller University Press. https://doi.org/10.1083/jcb.202309125","ieee":"B. Zens et al., “Lift-out cryo-FIBSEM and cryo-ET reveal the ultrastructural landscape of extracellular matrix,” Journal of Cell Biology, vol. 223, no. 6. Rockefeller University Press, 2024.","short":"B. Zens, F. Fäßler, J. Hansen, R. Hauschild, J. Datler, V.-V. Hodirnau, V. Zheden, J.H. Alanko, M.K. Sixt, F.K. Schur, Journal of Cell Biology 223 (2024).","mla":"Zens, Bettina, et al. “Lift-out Cryo-FIBSEM and Cryo-ET Reveal the Ultrastructural Landscape of Extracellular Matrix.” Journal of Cell Biology, vol. 223, no. 6, e202309125, Rockefeller University Press, 2024, doi:10.1083/jcb.202309125."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"publisher":"Rockefeller University Press","quality_controlled":"1","acknowledgement":"Open Access funding provided by IST Austria. We thank Armel Nicolas and his team at the ISTA proteomics facility, Alois Schloegl, Stefano Elefante, and colleagues at the ISTA Scientific Computing facility, Tommaso Constanzo and Ludek Lovicar at the Electron Microsocpy Facility (EMF), and Thomas Menner at the Miba Machine shop for their support. We also thank Wanda Kukulski (University of Bern) as well as Darío Porley, Andreas Thader, and other members of the Schur group for helpful discussions. Matt Swulius and Jessica Heebner provided great support in using Dragonfly. We thank Dorotea Fracciolla (Art & Science) for support in figure illustration.\r\n\r\nThis research was supported by the Scientific Service Units of ISTA through resources provided by Scientific Computing, the Lab Support Facility, and the Electron Microscopy Facility. We acknowledge funding support from the following sources: Austrian Science Fund (FWF) grant P33367 (to F.K.M. Schur), the Federation of European Biochemical Societies (to F.K.M. Schur), Niederösterreich (NÖ) Fonds (to B. Zens), FWF grant E435 (to J.M. Hansen), European Research Council under the European Union’s Horizon 2020 research (grant agreement No. 724373) (to M. Sixt), and Jenny and Antti Wihuri Foundation (to J. Alanko). This publication has been made possible in part by CZI grant DAF2021-234754 and grant DOI https://doi.org/10.37921/812628ebpcwg from the Chan Zuckerberg Initiative DAF, an advised fund of Silicon Valley Community Foundation (to F.K.M. Schur).","date_created":"2024-03-21T06:45:51Z","doi":"10.1083/jcb.202309125","date_published":"2024-03-20T00:00:00Z","year":"2024","has_accepted_license":"1","publication":"Journal of Cell Biology","day":"20"},{"oa":1,"quality_controlled":"1","publisher":"Elsevier","acknowledgement":"A.B.L. would like to thank Johannes Agerskov and Jan Philip Solovej for valuable discussions. We thank Alessandro Giuliani for helpful discussions and for pointing out the reference [18]. Funding from the European Union's Horizon 2020 research and innovation programme under the ERC grant agreement No 694227 is acknowledged. Financial support by the Austrian Science Fund (FWF) through project number I 6427-N (as part of the SFB/TRR 352) is gratefully acknowledged.","date_created":"2024-02-04T23:00:53Z","date_published":"2024-01-24T00:00:00Z","doi":"10.1016/j.jfa.2024.110320","publication":"Journal of Functional Analysis","day":"24","year":"2024","project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"},{"name":"Mathematical Challenges in BCS Theory of Superconductivity","grant_number":"I06427","_id":"bda63fe5-d553-11ed-ba76-a16e3d2f256b"}],"article_number":"110320","title":"Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion","article_processing_charge":"Yes (via OA deal)","external_id":{"arxiv":["2301.04894"]},"author":[{"first_name":"Asbjørn Bækgaard","id":"e1a2682f-dc8d-11ea-abe3-81da9ac728f1","last_name":"Lauritsen","orcid":"0000-0003-4476-2288","full_name":"Lauritsen, Asbjørn Bækgaard"},{"last_name":"Seiringer","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Ground State Energy of the Dilute Spin-Polarized Fermi Gas: Upper Bound via Cluster Expansion.” Journal of Functional Analysis. Elsevier, 2024. https://doi.org/10.1016/j.jfa.2024.110320.","ista":"Lauritsen AB, Seiringer R. 2024. Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion. Journal of Functional Analysis. 286(7), 110320.","mla":"Lauritsen, Asbjørn Bækgaard, and Robert Seiringer. “Ground State Energy of the Dilute Spin-Polarized Fermi Gas: Upper Bound via Cluster Expansion.” Journal of Functional Analysis, vol. 286, no. 7, 110320, Elsevier, 2024, doi:10.1016/j.jfa.2024.110320.","short":"A.B. Lauritsen, R. Seiringer, Journal of Functional Analysis 286 (2024).","ieee":"A. B. Lauritsen and R. Seiringer, “Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion,” Journal of Functional Analysis, vol. 286, no. 7. Elsevier, 2024.","ama":"Lauritsen AB, Seiringer R. Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion. Journal of Functional Analysis. 2024;286(7). doi:10.1016/j.jfa.2024.110320","apa":"Lauritsen, A. B., & Seiringer, R. (2024). Ground state energy of the dilute spin-polarized Fermi gas: Upper bound via cluster expansion. Journal of Functional Analysis. Elsevier. https://doi.org/10.1016/j.jfa.2024.110320"},"intvolume":" 286","month":"01","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.jfa.2024.110320"}],"scopus_import":"1","oa_version":"Published Version","abstract":[{"lang":"eng","text":"We prove an upper bound on the ground state energy of the dilute spin-polarized Fermi gas capturing the leading correction to the kinetic energy resulting from repulsive interactions. One of the main ingredients in the proof is a rigorous implementation of the fermionic cluster expansion of Gaudin et al. (1971) [15]."}],"ec_funded":1,"issue":"7","volume":286,"language":[{"iso":"eng"}],"publication_status":"epub_ahead","publication_identifier":{"eissn":["1096--0783"],"issn":["0022-1236"]},"status":"public","article_type":"original","type":"journal_article","_id":"14931","department":[{"_id":"RoSe"}],"date_updated":"2024-03-28T10:54:02Z"},{"editor":[{"last_name":"Margadant","full_name":"Margadant, Coert","first_name":"Coert"}],"title":"A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland","author":[{"full_name":"Hannezo, Edouard B","orcid":"0000-0001-6005-1561","last_name":"Hannezo","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","first_name":"Edouard B"},{"first_name":"Colinda L.G.J.","full_name":"Scheele, Colinda L.G.J.","last_name":"Scheele"}],"article_processing_charge":"No","external_id":{"pmid":["36653709"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"chicago":"Hannezo, Edouard B, and Colinda L.G.J. Scheele. “A Guide Toward Multi-Scale and Quantitative Branching Analysis in the Mammary Gland.” In Cell Migration in Three Dimensions, edited by Coert Margadant, 2608:183–205. MIMB. Springer Nature, 2023. https://doi.org/10.1007/978-1-0716-2887-4_12.","ista":"Hannezo EB, Scheele CLGJ. 2023.A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In: Cell Migration in Three Dimensions. Methods in Molecular Biology, vol. 2608, 183–205.","mla":"Hannezo, Edouard B., and Colinda L. G. J. Scheele. “A Guide Toward Multi-Scale and Quantitative Branching Analysis in the Mammary Gland.” Cell Migration in Three Dimensions, edited by Coert Margadant, vol. 2608, Springer Nature, 2023, pp. 183–205, doi:10.1007/978-1-0716-2887-4_12.","apa":"Hannezo, E. B., & Scheele, C. L. G. J. (2023). A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In C. Margadant (Ed.), Cell Migration in Three Dimensions (Vol. 2608, pp. 183–205). Springer Nature. https://doi.org/10.1007/978-1-0716-2887-4_12","ama":"Hannezo EB, Scheele CLGJ. A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland. In: Margadant C, ed. Cell Migration in Three Dimensions. Vol 2608. MIMB. Springer Nature; 2023:183-205. doi:10.1007/978-1-0716-2887-4_12","ieee":"E. B. Hannezo and C. L. G. J. Scheele, “A Guide Toward Multi-scale and Quantitative Branching Analysis in the Mammary Gland,” in Cell Migration in Three Dimensions, vol. 2608, C. Margadant, Ed. Springer Nature, 2023, pp. 183–205.","short":"E.B. Hannezo, C.L.G.J. Scheele, in:, C. Margadant (Ed.), Cell Migration in Three Dimensions, Springer Nature, 2023, pp. 183–205."},"quality_controlled":"1","publisher":"Springer Nature","oa":1,"doi":"10.1007/978-1-0716-2887-4_12","date_published":"2023-01-19T00:00:00Z","date_created":"2023-01-29T23:00:58Z","page":"183-205","day":"19","publication":"Cell Migration in Three Dimensions","has_accepted_license":"1","year":"2023","status":"public","type":"book_chapter","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"series_title":"MIMB","_id":"12428","file_date_updated":"2023-02-03T10:56:39Z","department":[{"_id":"EdHa"}],"ddc":["570"],"date_updated":"2023-02-03T10:58:56Z","month":"01","intvolume":" 2608","alternative_title":["Methods in Molecular Biology"],"scopus_import":"1","oa_version":"Published Version","pmid":1,"abstract":[{"text":"The mammary gland consists of a bilayered epithelial structure with an extensively branched morphology. The majority of this epithelial tree is laid down during puberty, during which actively proliferating terminal end buds repeatedly elongate and bifurcate to form the basic structure of the ductal tree. Mammary ducts consist of a basal and luminal cell layer with a multitude of identified sub-lineages within both layers. The understanding of how these different cell lineages are cooperatively driving branching morphogenesis is a problem of crossing multiple scales, as this requires information on the macroscopic branched structure of the gland, as well as data on single-cell dynamics driving the morphogenic program. Here we describe a method to combine genetic lineage tracing with whole-gland branching analysis. Quantitative data on the global organ structure can be used to derive a model for mammary gland branching morphogenesis and provide a backbone on which the dynamics of individual cell lineages can be simulated and compared to lineage-tracing approaches. Eventually, these quantitative models and experiments allow to understand the couplings between the macroscopic shape of the mammary gland and the underlying single-cell dynamics driving branching morphogenesis.","lang":"eng"}],"volume":2608,"file":[{"content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"aec1b8d3ba938ddf9d8fcb777f3c38ee","file_id":"12500","success":1,"date_updated":"2023-02-03T10:56:39Z","file_size":826598,"creator":"dernst","date_created":"2023-02-03T10:56:39Z","file_name":"2023_MIMB_Hannezo.pdf"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1940-6029"],"isbn":["9781071628867"],"eisbn":["9781071628874"]},"publication_status":"published"},{"ec_funded":1,"issue":"1","volume":5,"publication_status":"published","publication_identifier":{"issn":["2643-1564"]},"language":[{"iso":"eng"}],"file":[{"creator":"dernst","file_size":865150,"date_updated":"2023-02-13T10:38:10Z","file_name":"2023_PhysicalReviewResearch_Ghazaryan.pdf","date_created":"2023-02-13T10:38:10Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"12546","checksum":"6068b62874c0099628a108bb9c5c6bd2"}],"scopus_import":"1","intvolume":" 5","month":"01","abstract":[{"text":"Brownian motion of a mobile impurity in a bath is affected by spin-orbit coupling (SOC). Here, we discuss a Caldeira-Leggett-type model that can be used to propose and interpret quantum simulators of this problem in cold Bose gases. First, we derive a master equation that describes the model and explore it in a one-dimensional (1D) setting. To validate the standard assumptions needed for our derivation, we analyze available experimental data without SOC; as a byproduct, this analysis suggests that the quench dynamics of the impurity is beyond the 1D Bose-polaron approach at temperatures currently accessible in a cold-atom laboratory—motion of the impurity is mainly driven by dissipation. For systems with SOC, we demonstrate that 1D spin-orbit coupling can be gauged out even in the presence of dissipation—the information about SOC is incorporated in the initial conditions. Observables sensitive to this information (such as spin densities) can be used to study formation of steady spin polarization domains during quench dynamics.","lang":"eng"}],"oa_version":"Published Version","file_date_updated":"2023-02-13T10:38:10Z","department":[{"_id":"MiLe"}],"date_updated":"2023-02-20T07:02:00Z","ddc":["530"],"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","type":"journal_article","status":"public","_id":"12534","date_created":"2023-02-10T09:02:26Z","date_published":"2023-01-20T00:00:00Z","doi":"10.1103/physrevresearch.5.013029","year":"2023","has_accepted_license":"1","publication":"Physical Review Research","day":"20","oa":1,"quality_controlled":"1","publisher":"American Physical Society","acknowledgement":"We thank Rafael Barfknecht for help at the initial stages of this project; Fabian Brauneis for useful discussions; Miguel A. Garcia-March, Georgios Koutentakis, and Simeon Mistakidis\r\nfor comments on the paper. M.L. acknowledges support by the European Research Council (ERC) Starting Grant No. 801770 (ANGULON).","article_processing_charge":"No","author":[{"orcid":"0000-0001-9666-3543","full_name":"Ghazaryan, Areg","last_name":"Ghazaryan","id":"4AF46FD6-F248-11E8-B48F-1D18A9856A87","first_name":"Areg"},{"first_name":"Alberto","id":"9d13b3cb-30a2-11eb-80dc-f772505e8660","full_name":"Cappellaro, Alberto","orcid":"0000-0001-6110-2359","last_name":"Cappellaro"},{"first_name":"Mikhail","id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","last_name":"Lemeshko","orcid":"0000-0002-6990-7802","full_name":"Lemeshko, Mikhail"},{"orcid":"0000-0003-0393-5525","full_name":"Volosniev, Artem","last_name":"Volosniev","first_name":"Artem","id":"37D278BC-F248-11E8-B48F-1D18A9856A87"}],"title":"Dissipative dynamics of an impurity with spin-orbit coupling","citation":{"ista":"Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. 2023. Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. 5(1), 013029.","chicago":"Ghazaryan, Areg, Alberto Cappellaro, Mikhail Lemeshko, and Artem Volosniev. “Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review Research. American Physical Society, 2023. https://doi.org/10.1103/physrevresearch.5.013029.","ieee":"A. Ghazaryan, A. Cappellaro, M. Lemeshko, and A. Volosniev, “Dissipative dynamics of an impurity with spin-orbit coupling,” Physical Review Research, vol. 5, no. 1. American Physical Society, 2023.","short":"A. Ghazaryan, A. Cappellaro, M. Lemeshko, A. Volosniev, Physical Review Research 5 (2023).","ama":"Ghazaryan A, Cappellaro A, Lemeshko M, Volosniev A. Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. 2023;5(1). doi:10.1103/physrevresearch.5.013029","apa":"Ghazaryan, A., Cappellaro, A., Lemeshko, M., & Volosniev, A. (2023). Dissipative dynamics of an impurity with spin-orbit coupling. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.5.013029","mla":"Ghazaryan, Areg, et al. “Dissipative Dynamics of an Impurity with Spin-Orbit Coupling.” Physical Review Research, vol. 5, no. 1, 013029, American Physical Society, 2023, doi:10.1103/physrevresearch.5.013029."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"_id":"2688CF98-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Angulon: physics and applications of a new quasiparticle","grant_number":"801770"}],"article_number":"013029"},{"title":"Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis","article_processing_charge":"No","author":[{"full_name":"Zeller, Peter","last_name":"Zeller","first_name":"Peter"},{"id":"123012b2-db30-11eb-b4d8-a35840c0551b","first_name":"Jake","orcid":"0000-0003-1732-1559","full_name":"Yeung, Jake","last_name":"Yeung"},{"first_name":"Helena","full_name":"Viñas Gaza, Helena","last_name":"Viñas Gaza"},{"first_name":"Buys Anton","full_name":"de Barbanson, Buys Anton","last_name":"de Barbanson"},{"first_name":"Vivek","full_name":"Bhardwaj, Vivek","last_name":"Bhardwaj"},{"first_name":"Maria","full_name":"Florescu, Maria","last_name":"Florescu"},{"full_name":"van der Linden, Reinier","last_name":"van der Linden","first_name":"Reinier"},{"full_name":"van Oudenaarden, Alexander","last_name":"van Oudenaarden","first_name":"Alexander"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Zeller, Peter, et al. “Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.” Nature Genetics, vol. 55, Springer Nature, 2023, pp. 333–45, doi:10.1038/s41588-022-01260-3.","short":"P. Zeller, J. Yeung, H. Viñas Gaza, B.A. de Barbanson, V. Bhardwaj, M. Florescu, R. van der Linden, A. van Oudenaarden, Nature Genetics 55 (2023) 333–345.","ieee":"P. Zeller et al., “Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis,” Nature Genetics, vol. 55. Springer Nature, pp. 333–345, 2023.","apa":"Zeller, P., Yeung, J., Viñas Gaza, H., de Barbanson, B. A., Bhardwaj, V., Florescu, M., … van Oudenaarden, A. (2023). Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. Springer Nature. https://doi.org/10.1038/s41588-022-01260-3","ama":"Zeller P, Yeung J, Viñas Gaza H, et al. Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. 2023;55:333-345. doi:10.1038/s41588-022-01260-3","chicago":"Zeller, Peter, Jake Yeung, Helena Viñas Gaza, Buys Anton de Barbanson, Vivek Bhardwaj, Maria Florescu, Reinier van der Linden, and Alexander van Oudenaarden. “Single-Cell SortChIC Identifies Hierarchical Chromatin Dynamics during Hematopoiesis.” Nature Genetics. Springer Nature, 2023. https://doi.org/10.1038/s41588-022-01260-3.","ista":"Zeller P, Yeung J, Viñas Gaza H, de Barbanson BA, Bhardwaj V, Florescu M, van der Linden R, van Oudenaarden A. 2023. Single-cell sortChIC identifies hierarchical chromatin dynamics during hematopoiesis. Nature Genetics. 55, 333–345."},"oa":1,"publisher":"Springer Nature","quality_controlled":"1","acknowledgement":"We thank A. Giladi for sharing mRNA abundance tables of cell types together with J. van den Berg for critical reading of the manuscript. We thank M. Bartosovic for sharing method comparison data. pK19pA-MN was a gift from Ulrich Laemmli (Addgene plasmid 86973, http://n2t.net/addgene:86973; RRID:Addgene_86973). Figure 8 is adopted from Hematopoiesis (human) diagram by A. Rad and M. Häggström under CC-BY-SA 3.0 license. This work was supported by European Research Council Advanced under grant ERC-AdG 742225-IntScOmics and Nederlandse Organisatie voor Wetenschappelijk Onderzoek (NWO) TOP award NWO-CW 714.016.001. The SNF (P2BSP3-174991), HFSP (LT000209/2018-L) and Marie Skłodowska-Curie Actions (798573) supported P.Z. The SNF (P2ELP3_184488) and HFSP (LT000097/2019-L) supported J.Y. and the EMBO LTF (ALTF 1197–2019) supported V.B. This work is part of the Oncode Institute, which is partly financed by the Dutch Cancer Society. The funders had no role in study design, data collection and analysis, decision to publish or preparation of the manuscript.","date_created":"2023-01-12T12:09:09Z","doi":"10.1038/s41588-022-01260-3","date_published":"2023-02-01T00:00:00Z","page":"333-345","publication":"Nature Genetics","day":"01","year":"2023","has_accepted_license":"1","keyword":["Genetics"],"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"journal_article","article_type":"review","_id":"12158","file_date_updated":"2023-02-27T07:46:45Z","department":[{"_id":"ScienComp"}],"ddc":["570","000"],"date_updated":"2023-02-27T07:48:24Z","intvolume":" 55","month":"02","scopus_import":"1","oa_version":"Published Version","abstract":[{"text":"Post-translational histone modifications modulate chromatin activity to affect gene expression. How chromatin states underlie lineage choice in single cells is relatively unexplored. We develop sort-assisted single-cell chromatin immunocleavage (sortChIC) and map active (H3K4me1 and H3K4me3) and repressive (H3K27me3 and H3K9me3) histone modifications in the mouse bone marrow. During differentiation, hematopoietic stem and progenitor cells (HSPCs) acquire active chromatin states mediated by cell-type-specifying transcription factors, which are unique for each lineage. By contrast, most alterations in repressive marks during differentiation occur independent of the final cell type. Chromatin trajectory analysis shows that lineage choice at the chromatin level occurs at the progenitor stage. Joint profiling of H3K4me1 and H3K9me3 demonstrates that cell types within the myeloid lineage have distinct active chromatin but share similar myeloid-specific heterochromatin states. This implies a hierarchical regulation of chromatin during hematopoiesis: heterochromatin dynamics distinguish differentiation trajectories and lineages, while euchromatin dynamics reflect cell types within lineages.","lang":"eng"}],"volume":55,"language":[{"iso":"eng"}],"file":[{"relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"file_id":"12688","checksum":"6fdb8e34fbeea63edd0f2c6c2cc5823e","creator":"dernst","file_size":21484855,"date_updated":"2023-02-27T07:46:45Z","file_name":"2023_NatureGenetics_Zeller.pdf","date_created":"2023-02-27T07:46:45Z"}],"publication_status":"published","publication_identifier":{"issn":["1061-4036"],"eissn":["1546-1718"]}},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Chatterjee, Krishnendu, et al. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–605, doi:10.1137/1.9781611977554.ch173.","ieee":"K. Chatterjee, T. Meggendorfer, R. J. Saona Urmeneta, and J. Svoboda, “Faster algorithm for turn-based stochastic games with bounded treewidth,” in Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Florence, Italy, 2023, pp. 4590–4605.","short":"K. Chatterjee, T. Meggendorfer, R.J. Saona Urmeneta, J. Svoboda, in:, Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2023, pp. 4590–4605.","ama":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. Faster algorithm for turn-based stochastic games with bounded treewidth. In: Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2023:4590-4605. doi:10.1137/1.9781611977554.ch173","apa":"Chatterjee, K., Meggendorfer, T., Saona Urmeneta, R. J., & Svoboda, J. (2023). Faster algorithm for turn-based stochastic games with bounded treewidth. In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 4590–4605). Florence, Italy: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611977554.ch173","chicago":"Chatterjee, Krishnendu, Tobias Meggendorfer, Raimundo J Saona Urmeneta, and Jakub Svoboda. “Faster Algorithm for Turn-Based Stochastic Games with Bounded Treewidth.” In Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms, 4590–4605. Society for Industrial and Applied Mathematics, 2023. https://doi.org/10.1137/1.9781611977554.ch173.","ista":"Chatterjee K, Meggendorfer T, Saona Urmeneta RJ, Svoboda J. 2023. Faster algorithm for turn-based stochastic games with bounded treewidth. Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 4590–4605."},"title":"Faster algorithm for turn-based stochastic games with bounded treewidth","article_processing_charge":"No","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"full_name":"Meggendorfer, Tobias","orcid":"0000-0002-1712-2165","last_name":"Meggendorfer","first_name":"Tobias","id":"b21b0c15-30a2-11eb-80dc-f13ca25802e1"},{"first_name":"Raimundo J","id":"BD1DF4C4-D767-11E9-B658-BC13E6697425","last_name":"Saona Urmeneta","full_name":"Saona Urmeneta, Raimundo J","orcid":"0000-0001-5103-038X"},{"id":"130759D2-D7DD-11E9-87D2-DE0DE6697425","first_name":"Jakub","full_name":"Svoboda, Jakub","last_name":"Svoboda"}],"project":[{"grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"publication":"Proceedings of the 2023 Annual ACM-SIAM Symposium on Discrete Algorithms","day":"01","year":"2023","date_created":"2023-02-24T12:20:47Z","doi":"10.1137/1.9781611977554.ch173","date_published":"2023-02-01T00:00:00Z","page":"4590-4605","acknowledgement":"This research was partially supported by the ERC CoG 863818 (ForM-SMArt) grant.","oa":1,"publisher":"Society for Industrial and Applied Mathematics","quality_controlled":"1","date_updated":"2023-02-27T09:01:16Z","department":[{"_id":"GradSch"},{"_id":"KrCh"}],"_id":"12676","status":"public","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2023-01-25","location":"Florence, Italy","start_date":"2023-01-22"},"type":"conference","language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781611977554"]},"ec_funded":1,"oa_version":"Published Version","abstract":[{"lang":"eng","text":"Turn-based stochastic games (aka simple stochastic games) are two-player zero-sum games played on directed graphs with probabilistic transitions. The goal of player-max is to maximize the probability to reach a target state against the adversarial player-min. These games lie in NP ∩ coNP and are among the rare combinatorial problems that belong to this complexity class for which the existence of polynomial-time algorithm is a major open question. While randomized sub-exponential time algorithm exists, all known deterministic algorithms require exponential time in the worst-case. An important open question has been whether faster algorithms can be obtained parametrized by the treewidth of the game graph. Even deterministic sub-exponential time algorithm for constant treewidth turn-based stochastic games has remain elusive. In this work our main result is a deterministic algorithm to solve turn-based stochastic games that, given a game with n states, treewidth at most t, and the bit-complexity of the probabilistic transition function log D, has running time O ((tn2 log D)t log n). In particular, our algorithm is quasi-polynomial time for games with constant or poly-logarithmic treewidth."}],"month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611977554.ch173"}]},{"oa_version":"Preprint","abstract":[{"lang":"eng","text":"Asynchronous programming has gained significant popularity over the last decade: support for this programming pattern is available in many popular languages via libraries and native language implementations, typically in the form of coroutines or the async/await construct. Instead of programming via shared memory, this concept assumes implicit synchronization through message passing. The key data structure enabling such communication is the rendezvous channel. Roughly, a rendezvous channel is a blocking queue of size zero, so both send(e) and receive() operations wait for each other, performing a rendezvous when they meet. To optimize the message passing pattern, channels are usually equipped with a fixed-size buffer, so sends do not suspend and put elements into the buffer until its capacity is exceeded. This primitive is known as a buffered channel.\r\n\r\nThis paper presents a fast and scalable algorithm for both rendezvous and buffered channels. Similarly to modern queues, our solution is based on an infinite array with two positional counters for send(e) and receive() operations, leveraging the unconditional Fetch-And-Add instruction to update them. Yet, the algorithm requires non-trivial modifications of this classic pattern, in order to support the full channel semantics, such as buffering and cancellation of waiting requests. We compare the performance of our solution to that of the Kotlin implementation, as well as against other academic proposals, showing up to 9.8× speedup. To showcase its expressiveness and performance, we also integrated the proposed algorithm into the standard Kotlin Coroutines library, replacing the previous channel implementations."}],"month":"02","main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2211.04986"}],"oa":1,"quality_controlled":"1","scopus_import":"1","publisher":"Association for Computing Machinery","publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","language":[{"iso":"eng"}],"day":"25","year":"2023","publication_status":"published","publication_identifier":{"isbn":["9798400700156"]},"date_created":"2023-03-19T23:00:58Z","doi":"10.1145/3572848.3577481","date_published":"2023-02-25T00:00:00Z","page":"107-118","_id":"12735","status":"public","conference":{"end_date":"2023-03-01","location":"Montreal, QC, Canada","start_date":"2023-02-25","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"type":"conference","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-03-20T07:29:28Z","citation":{"ieee":"N. Koval, D.-A. Alistarh, and R. Elizarov, “Fast and scalable channels in Kotlin Coroutines,” in Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Montreal, QC, Canada, 2023, pp. 107–118.","short":"N. Koval, D.-A. Alistarh, R. Elizarov, in:, Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 107–118.","apa":"Koval, N., Alistarh, D.-A., & Elizarov, R. (2023). Fast and scalable channels in Kotlin Coroutines. In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 107–118). Montreal, QC, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577481","ama":"Koval N, Alistarh D-A, Elizarov R. Fast and scalable channels in Kotlin Coroutines. In: Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery; 2023:107-118. doi:10.1145/3572848.3577481","mla":"Koval, Nikita, et al. “Fast and Scalable Channels in Kotlin Coroutines.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 107–18, doi:10.1145/3572848.3577481.","ista":"Koval N, Alistarh D-A, Elizarov R. 2023. Fast and scalable channels in Kotlin Coroutines. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. PPoPP: Sympopsium on Principles and Practice of Parallel Programming, 107–118.","chicago":"Koval, Nikita, Dan-Adrian Alistarh, and Roman Elizarov. “Fast and Scalable Channels in Kotlin Coroutines.” In Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, 107–18. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577481."},"department":[{"_id":"DaAl"}],"title":"Fast and scalable channels in Kotlin Coroutines","external_id":{"arxiv":["2211.04986"]},"article_processing_charge":"No","author":[{"id":"2F4DB10C-F248-11E8-B48F-1D18A9856A87","first_name":"Nikita","full_name":"Koval, Nikita","last_name":"Koval"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh"},{"first_name":"Roman","full_name":"Elizarov, Roman","last_name":"Elizarov"}]},{"conference":{"location":"Montreal, QB, Canada","end_date":"2023-03-01","start_date":"2023-02-25","name":"PPoPP: Sympopsium on Principles and Practice of Parallel Programming"},"type":"conference_poster","status":"public","_id":"12736","article_processing_charge":"No","author":[{"last_name":"Aksenov","full_name":"Aksenov, Vitaly","first_name":"Vitaly"},{"full_name":"Brown, Trevor A","last_name":"Brown","id":"3569F0A0-F248-11E8-B48F-1D18A9856A87","first_name":"Trevor A"},{"id":"2e711909-896a-11ed-bdf8-eb0f5a2984c6","first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"last_name":"Kokorin","full_name":"Kokorin, Ilya","first_name":"Ilya"}],"title":"Unexpected scaling in path copying trees","department":[{"_id":"DaAl"},{"_id":"GradSch"}],"date_updated":"2023-03-20T07:57:27Z","citation":{"ieee":"V. Aksenov, T. A. Brown, A. Fedorov, and I. Kokorin, Unexpected scaling in path copying trees. Association for Computing Machinery, 2023, pp. 438–440.","short":"V. Aksenov, T.A. Brown, A. Fedorov, I. Kokorin, Unexpected Scaling in Path Copying Trees, Association for Computing Machinery, 2023.","apa":"Aksenov, V., Brown, T. A., Fedorov, A., & Kokorin, I. (2023). Unexpected scaling in path copying trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (pp. 438–440). Montreal, QB, Canada: Association for Computing Machinery. https://doi.org/10.1145/3572848.3577512","ama":"Aksenov V, Brown TA, Fedorov A, Kokorin I. Unexpected Scaling in Path Copying Trees. Association for Computing Machinery; 2023:438-440. doi:10.1145/3572848.3577512","mla":"Aksenov, Vitaly, et al. “Unexpected Scaling in Path Copying Trees.” Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming, Association for Computing Machinery, 2023, pp. 438–40, doi:10.1145/3572848.3577512.","ista":"Aksenov V, Brown TA, Fedorov A, Kokorin I. 2023. Unexpected scaling in path copying trees, Association for Computing Machinery,p.","chicago":"Aksenov, Vitaly, Trevor A Brown, Alexander Fedorov, and Ilya Kokorin. Unexpected Scaling in Path Copying Trees. Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. Association for Computing Machinery, 2023. https://doi.org/10.1145/3572848.3577512."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa":1,"main_file_link":[{"url":"https://doi.org/10.1145/3572848.3577512","open_access":"1"}],"publisher":"Association for Computing Machinery","quality_controlled":"1","month":"02","abstract":[{"text":"Although a wide variety of handcrafted concurrent data structures have been proposed, there is considerable interest in universal approaches (Universal Constructions or UCs) for building concurrent data structures. UCs (semi-)automatically convert a sequential data structure into a concurrent one. The simplest approach uses locks [3, 6] that protect a sequential data structure and allow only one process to access it at a time. However, the resulting data structure is blocking. Most work on UCs instead focuses on obtaining non-blocking progress guarantees such as obstruction-freedom, lock-freedom or wait-freedom. Many non-blocking UCs have appeared. Key examples include the seminal wait-free UC [2] by Herlihy, a NUMA-aware UC [10] by Yi et al., and an efficient UC for large objects [1] by Fatourou et al.","lang":"eng"}],"acknowledgement":"This work was supported by: the Natural Sciences and Engineering Research Council of Canada (NSERC) Discovery Program grant: RGPIN-2019-04227, and the Canada Foundation for Innovation John R. Evans Leaders Fund (CFI-JELF) with equal support from the Ontario Research Fund CFI Leaders Opportunity Fund: 38512.","oa_version":"Published Version","page":"438-440","date_created":"2023-03-19T23:00:58Z","doi":"10.1145/3572848.3577512","date_published":"2023-02-25T00:00:00Z","publication_status":"published","year":"2023","publication_identifier":{"isbn":["9798400700156"]},"publication":"Proceedings of the ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","language":[{"iso":"eng"}],"day":"25"},{"_id":"12760","type":"conference","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"name":"STACS: Symposium on Theoretical Aspects of Computer Science","location":"Hamburg, Germany","end_date":"2023-03-09","start_date":"2023-03-07"},"status":"public","date_updated":"2023-03-27T06:46:27Z","ddc":["000"],"file_date_updated":"2023-03-27T06:37:22Z","department":[{"_id":"MoHe"}],"abstract":[{"text":"Dynamic programming (DP) is one of the fundamental paradigms in algorithm design. However,\r\nmany DP algorithms have to fill in large DP tables, represented by two-dimensional arrays, which causes at least quadratic running times and space usages. This has led to the development of improved algorithms for special cases when the DPs satisfy additional properties like, e.g., the Monge property or total monotonicity.\r\nIn this paper, we consider a new condition which assumes (among some other technical assumptions) that the rows of the DP table are monotone. Under this assumption, we introduce\r\na novel data structure for computing (1 + ϵ)-approximate DP solutions in near-linear time and\r\nspace in the static setting, and with polylogarithmic update times when the DP entries change\r\ndynamically. To the best of our knowledge, our new condition is incomparable to previous conditions and is the first which allows to derive dynamic algorithms based on existing DPs. Instead of using two-dimensional arrays to store the DP tables, we store the rows of the DP tables using monotone piecewise constant functions. This allows us to store length-n DP table rows with entries in [0, W] using only polylog(n, W) bits, and to perform operations, such as (min, +)-convolution or rounding, on these functions in polylogarithmic time.\r\nWe further present several applications of our data structure. For bicriteria versions of k-balanced graph partitioning and simultaneous source location, we obtain the first dynamic algorithms with subpolynomial update times, as well as the first static algorithms using only near-linear time and space. Additionally, we obtain the currently fastest algorithm for fully dynamic knapsack.","lang":"eng"}],"oa_version":"Published Version","scopus_import":"1","alternative_title":["LIPIcs"],"month":"03","intvolume":" 254","publication_identifier":{"issn":["1868-8969"],"isbn":["9783959772662"]},"publication_status":"published","file":[{"success":1,"file_id":"12769","checksum":"22141ab8bc55188e2dfff665e5daecbd","content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_name":"2023_LIPICS_HenzingerM.pdf","date_created":"2023-03-27T06:37:22Z","file_size":872706,"date_updated":"2023-03-27T06:37:22Z","creator":"dernst"}],"language":[{"iso":"eng"}],"volume":254,"article_number":"36","citation":{"ista":"Henzinger MH, Neumann S, Räcke H, Schmid S. 2023. Dynamic maintenance of monotone dynamic programs and applications. 40th International Symposium on Theoretical Aspects of Computer Science. STACS: Symposium on Theoretical Aspects of Computer Science, LIPIcs, vol. 254, 36.","chicago":"Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” In 40th International Symposium on Theoretical Aspects of Computer Science, Vol. 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023. https://doi.org/10.4230/LIPIcs.STACS.2023.36.","short":"M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 40th International Symposium on Theoretical Aspects of Computer Science, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023.","ieee":"M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Dynamic maintenance of monotone dynamic programs and applications,” in 40th International Symposium on Theoretical Aspects of Computer Science, Hamburg, Germany, 2023, vol. 254.","ama":"Henzinger MH, Neumann S, Räcke H, Schmid S. Dynamic maintenance of monotone dynamic programs and applications. In: 40th International Symposium on Theoretical Aspects of Computer Science. Vol 254. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2023. doi:10.4230/LIPIcs.STACS.2023.36","apa":"Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2023). Dynamic maintenance of monotone dynamic programs and applications. In 40th International Symposium on Theoretical Aspects of Computer Science (Vol. 254). Hamburg, Germany: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.STACS.2023.36","mla":"Henzinger, Monika H., et al. “Dynamic Maintenance of Monotone Dynamic Programs and Applications.” 40th International Symposium on Theoretical Aspects of Computer Science, vol. 254, 36, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2023, doi:10.4230/LIPIcs.STACS.2023.36."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5008-6530","full_name":"Henzinger, Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H"},{"last_name":"Neumann","full_name":"Neumann, Stefan","first_name":"Stefan"},{"first_name":"Harald","full_name":"Räcke, Harald","last_name":"Räcke"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"external_id":{"arxiv":["2301.01744"]},"article_processing_charge":"No","title":"Dynamic maintenance of monotone dynamic programs and applications","acknowledgement":"Monika Henzinger: This project has received funding from the European Research Council\r\n(ERC) under the European Union’s Horizon 2020 research and innovation programme (Grant\r\nagreement No. 101019564 “The Design of Modern Fully Dynamic Data Structures (MoDynStruct)” and from the Austrian Science Fund (FWF) project “Fast Algorithms for a Reactive Network Layer (ReactNet)”, P 33775-N, with additional funding from the netidee SCIENCE Stiftung, 2020–2024.\r\nStefan Neumann: This research is supported by the the ERC Advanced Grant REBOUND (834862) and the EC H2020 RIA project SoBigData++ (871042).\r\nStefan Schmid: Research supported by Austrian Science Fund (FWF) project I 5025-N (DELTA), 2020-2024.","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","quality_controlled":"1","oa":1,"has_accepted_license":"1","year":"2023","day":"01","publication":"40th International Symposium on Theoretical Aspects of Computer Science","date_published":"2023-03-01T00:00:00Z","doi":"10.4230/LIPIcs.STACS.2023.36","date_created":"2023-03-26T22:01:07Z"},{"month":"03","alternative_title":["ISTA Thesis"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"The process of detecting and evaluating sensory information to guide behaviour is termed perceptual decision-making (PDM), and is critical for the ability of an organism to interact with its external world. Individuals with autism, a neurodevelopmental condition primarily characterised by social and communication difficulties, frequently exhibit altered sensory processing and PDM difficulties are widely reported. Recent technological advancements have pushed forward our understanding of the genetic changes accompanying this condition, however our understanding of how these mutations affect the function of specific neuronal circuits and bring about the corresponding behavioural changes remains limited. Here, we use an innate PDM task, the looming avoidance response (LAR) paradigm, to identify a convergent behavioural abnormality across three molecularly distinct genetic mouse models of autism (Cul3, Setd5 and Ptchd1). Although mutant mice can rapidly detect threatening visual stimuli, their responses are consistently delayed, requiring longer to initiate an appropriate response than their wild-type siblings. Mutant animals show abnormal adaptation in both their stimulus- evoked escape responses and exploratory dynamics following repeated stimulus presentations. Similarly delayed behavioural responses are observed in wild-type animals when faced with more ambiguous threats, suggesting the mutant phenotype could arise from a dysfunction in the flexible control of this PDM process.\r\nOur knowledge of the core neuronal circuitry mediating the LAR facilitated a detailed dissection of the neuronal mechanisms underlying the behavioural impairment. In vivo extracellular recording revealed that visual responses were unaffected within a key brain region for the rapid processing of visual threats, the superior colliculus (SC), indicating that the behavioural delay was unlikely to originate from sensory impairments. Delayed behavioural responses were recapitulated in the Setd5 model following optogenetic stimulation of the excitatory output neurons of the SC, which are known to mediate escape initiation through the activation of cells in the underlying dorsal periaqueductal grey (dPAG). In vitro patch-clamp recordings of dPAG cells uncovered a stark hypoexcitability phenotype in two out of the three genetic models investigated (Setd5 and Ptchd1), that in Setd5, is mediated by the misregulation of voltage-gated potassium channels. Overall, our results show that the ability to use visual information to drive efficient escape responses is impaired in three diverse genetic mouse models of autism and that, in one of the models studied, this behavioural delay likely originates from differences in the intrinsic excitability of a key subcortical node, the dPAG. Furthermore, this work showcases the use of an innate behavioural paradigm to mechanistically dissect PDM processes in autism."}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"},{"_id":"LifeSc"},{"_id":"M-Shop"},{"_id":"CampIT"}],"ec_funded":1,"file":[{"file_id":"12717","checksum":"6c6d9cc2c4cdacb74e6b1047a34d7332","access_level":"closed","relation":"source_file","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_created":"2023-03-08T15:08:46Z","file_name":"Burnett_Thesis_2023.docx","creator":"lburnett","date_updated":"2023-03-08T15:08:46Z","file_size":23029260},{"file_name":"Burnett_Thesis_2023_pdfA.pdf","date_created":"2023-03-08T15:08:46Z","file_size":11959869,"date_updated":"2023-03-08T15:08:46Z","creator":"lburnett","success":1,"file_id":"12718","checksum":"cebc77705288bf4382db9b3541483cd0","content_type":"application/pdf","relation":"main_file","access_level":"open_access"}],"language":[{"iso":"eng"}],"publication_identifier":{"issn":["2663-337X"]},"degree_awarded":"PhD","publication_status":"published","status":"public","type":"dissertation","_id":"12716","file_date_updated":"2023-03-08T15:08:46Z","department":[{"_id":"GradSch"},{"_id":"MaJö"}],"ddc":["599","573"],"supervisor":[{"full_name":"Jösch, Maximilian A","orcid":"0000-0002-3937-1330","last_name":"Jösch","first_name":"Maximilian A","id":"2BD278E6-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-04-05T10:59:04Z","publisher":"Institute of Science and Technology Austria","oa":1,"date_published":"2023-03-10T00:00:00Z","doi":"10.15479/at:ista:12716","date_created":"2023-03-08T15:19:45Z","page":"178","day":"10","has_accepted_license":"1","year":"2023","project":[{"_id":"2634E9D2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Circuits of Visual Attention","grant_number":"756502"}],"title":"To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism","author":[{"first_name":"Laura","id":"3B717F68-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8937-410X","full_name":"Burnett, Laura","last_name":"Burnett"}],"article_processing_charge":"No","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","citation":{"mla":"Burnett, Laura. To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism. Institute of Science and Technology Austria, 2023, doi:10.15479/at:ista:12716.","ieee":"L. Burnett, “To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism,” Institute of Science and Technology Austria, 2023.","short":"L. Burnett, To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism, Institute of Science and Technology Austria, 2023.","ama":"Burnett L. To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. 2023. doi:10.15479/at:ista:12716","apa":"Burnett, L. (2023). To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. Institute of Science and Technology Austria. https://doi.org/10.15479/at:ista:12716","chicago":"Burnett, Laura. “To Flee, or Not to Flee? Using Innate Defensive Behaviours to Investigate Rapid Perceptual Decision-Making through Subcortical Circuits in Mouse Models of Autism.” Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/at:ista:12716.","ista":"Burnett L. 2023. To flee, or not to flee? Using innate defensive behaviours to investigate rapid perceptual decision-making through subcortical circuits in mouse models of autism. Institute of Science and Technology Austria."}},{"acknowledgement":"This work was supported by the ERC-2020-AdG 10102009 grant.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","year":"2023","has_accepted_license":"1","publication":"Tools and Algorithms for the Construction and Analysis of Systems","day":"20","page":"535-540","date_created":"2023-04-20T08:22:53Z","doi":"10.1007/978-3-031-30820-8_32","date_published":"2023-04-20T00:00:00Z","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","name":"Vigilant Algorithmic Monitoring of Software","grant_number":"101020093"}],"citation":{"ama":"Chalupa M, Henzinger TA. Bubaak: Runtime monitoring of program verifiers. In: Tools and Algorithms for the Construction and Analysis of Systems. Vol 13994. Springer Nature; 2023:535-540. doi:10.1007/978-3-031-30820-8_32","apa":"Chalupa, M., & Henzinger, T. A. (2023). Bubaak: Runtime monitoring of program verifiers. In Tools and Algorithms for the Construction and Analysis of Systems (Vol. 13994, pp. 535–540). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30820-8_32","ieee":"M. Chalupa and T. A. Henzinger, “Bubaak: Runtime monitoring of program verifiers,” in Tools and Algorithms for the Construction and Analysis of Systems, Paris, France, 2023, vol. 13994, pp. 535–540.","short":"M. Chalupa, T.A. Henzinger, in:, Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2023, pp. 535–540.","mla":"Chalupa, Marek, and Thomas A. Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” Tools and Algorithms for the Construction and Analysis of Systems, vol. 13994, Springer Nature, 2023, pp. 535–40, doi:10.1007/978-3-031-30820-8_32.","ista":"Chalupa M, Henzinger TA. 2023. Bubaak: Runtime monitoring of program verifiers. Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 13994, 535–540.","chicago":"Chalupa, Marek, and Thomas A Henzinger. “Bubaak: Runtime Monitoring of Program Verifiers.” In Tools and Algorithms for the Construction and Analysis of Systems, 13994:535–40. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30820-8_32."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","full_name":"Chalupa, Marek","last_name":"Chalupa"},{"first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","last_name":"Henzinger"}],"title":"Bubaak: Runtime monitoring of program verifiers","abstract":[{"text":"The main idea behind BUBAAK is to run multiple program analyses in parallel and use runtime monitoring and enforcement to observe and control their progress in real time. The analyses send information about (un)explored states of the program and discovered invariants to a monitor. The monitor processes the received data and can force an analysis to stop the search of certain program parts (which have already been analyzed by other analyses), or to make it utilize a program invariant found by another analysis.\r\nAt SV-COMP 2023, the implementation of data exchange between the monitor and the analyses was not yet completed, which is why BUBAAK only ran several analyses in parallel, without any coordination. Still, BUBAAK won the meta-category FalsificationOverall and placed very well in several other (sub)-categories of the competition.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["LNCS"],"intvolume":" 13994","month":"04","publication_status":"published","publication_identifier":{"eisbn":["9783031308208"],"issn":["0302-9743"],"isbn":["9783031308192"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-04-25T06:58:36Z","file_size":16096413,"creator":"dernst","date_created":"2023-04-25T06:58:36Z","file_name":"2023_LNCS_Chalupa.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"120d2c2a38384058ad0630fdf8288312","file_id":"12864","success":1}],"ec_funded":1,"volume":13994,"_id":"12854","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"conference":{"start_date":"2023-04-22","end_date":"2023-04-27","location":"Paris, France","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"type":"conference","status":"public","date_updated":"2023-04-25T07:02:43Z","ddc":["000"],"department":[{"_id":"ToHe"}],"file_date_updated":"2023-04-25T06:58:36Z"},{"article_number":"2303.14555","_id":"12846","project":[{"_id":"34bc2376-11ca-11ed-8bc3-9a3b3961a088","name":"Computational Discovery of Numerical Algorithms for Animation and Simulation of Natural Phenomena","grant_number":"101045083"}],"status":"public","type":"preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv, 2303.14555.","chicago":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2303.14555.","ieee":"A. Chern and S. Ishida, “Area formula for spherical polygons via prequantization,” arXiv. .","short":"A. Chern, S. Ishida, ArXiv (n.d.).","apa":"Chern, A., & Ishida, S. (n.d.). Area formula for spherical polygons via prequantization. arXiv. https://doi.org/10.48550/arXiv.2303.14555","ama":"Chern A, Ishida S. Area formula for spherical polygons via prequantization. arXiv. doi:10.48550/arXiv.2303.14555","mla":"Chern, Albert, and Sadashige Ishida. “Area Formula for Spherical Polygons via Prequantization.” ArXiv, 2303.14555, doi:10.48550/arXiv.2303.14555."},"date_updated":"2023-04-25T06:51:21Z","title":"Area formula for spherical polygons via prequantization","department":[{"_id":"GradSch"},{"_id":"ChWo"}],"external_id":{"arxiv":["2303.14555"]},"article_processing_charge":"No","author":[{"last_name":"Chern","full_name":"Chern, Albert","first_name":"Albert"},{"last_name":"Ishida","full_name":"Ishida, Sadashige","id":"6F7C4B96-A8E9-11E9-A7CA-09ECE5697425","first_name":"Sadashige"}],"acknowledgement":"The authors acknowledge Chris Wojtan for his continuous support to the present work through discussions and advice. The second author thanks Anna Sisak for a fruitful discussion on prequantum bundles. This project was funded in part by the European Research Council (ERC Consolidator Grant 101045083 CoDiNA).","oa_version":"Preprint","abstract":[{"lang":"eng","text":"We present a formula for the signed area of a spherical polygon via prequantization. In contrast to the traditional formula based on the Gauss-Bonnet theorem that requires measuring angles, the new formula mimics Green's theorem and is applicable to a wider range of degenerate spherical curves and polygons."}],"month":"03","oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2303.14555","open_access":"1"}],"language":[{"iso":"eng"}],"publication":"arXiv","day":"25","year":"2023","publication_status":"submitted","date_created":"2023-04-18T19:16:06Z","doi":"10.48550/arXiv.2303.14555","date_published":"2023-03-25T00:00:00Z"},{"publisher":"Springer Nature","quality_controlled":"1","oa":1,"acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. The authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","doi":"10.1007/978-3-031-30826-0_15","date_published":"2023-04-20T00:00:00Z","date_created":"2023-04-20T08:29:42Z","page":"260-281","day":"20","publication":"Fundamental Approaches to Software Engineering","has_accepted_license":"1","year":"2023","project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"title":"Vamos: Middleware for best-effort third-party monitoring","author":[{"id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek","last_name":"Chalupa","full_name":"Chalupa, Marek"},{"last_name":"Mühlböck","orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","first_name":"Fabian"},{"last_name":"Muroya Lei","full_name":"Muroya Lei, Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff","first_name":"Stefanie"},{"last_name":"Henzinger","orcid":"0000-0002-2985-7724","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, “Vamos: Middleware for best-effort third-party monitoring,” in Fundamental Approaches to Software Engineering, Paris, France, 2023, vol. 13991, pp. 260–281.","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, in:, Fundamental Approaches to Software Engineering, Springer Nature, 2023, pp. 260–281.","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). Vamos: Middleware for best-effort third-party monitoring. In Fundamental Approaches to Software Engineering (Vol. 13991, pp. 260–281). Paris, France: Springer Nature. https://doi.org/10.1007/978-3-031-30826-0_15","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. Vamos: Middleware for best-effort third-party monitoring. In: Fundamental Approaches to Software Engineering. Vol 13991. Springer Nature; 2023:260-281. doi:10.1007/978-3-031-30826-0_15","mla":"Chalupa, Marek, et al. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” Fundamental Approaches to Software Engineering, vol. 13991, Springer Nature, 2023, pp. 260–81, doi:10.1007/978-3-031-30826-0_15.","ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. Vamos: Middleware for best-effort third-party monitoring. Fundamental Approaches to Software Engineering. FASE: Fundamental Approaches to Software Engineering, LNCS, vol. 13991, 260–281.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. “Vamos: Middleware for Best-Effort Third-Party Monitoring.” In Fundamental Approaches to Software Engineering, 13991:260–81. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-30826-0_15."},"month":"04","intvolume":" 13991","alternative_title":["LNCS"],"oa_version":"Published Version","abstract":[{"lang":"eng","text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch."}],"volume":13991,"related_material":{"record":[{"relation":"earlier_version","id":"12407","status":"public"}]},"ec_funded":1,"file":[{"creator":"dernst","file_size":580828,"date_updated":"2023-04-25T07:16:36Z","file_name":"2023_LNCS_ChalupaM.pdf","date_created":"2023-04-25T07:16:36Z","relation":"main_file","access_level":"open_access","content_type":"application/pdf","success":1,"checksum":"17a7c8e08be609cf2408d37ea55e322c","file_id":"12865"}],"language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1611-3349"],"isbn":["9783031308253"],"issn":["0302-9743"],"eisbn":["9783031308260"]},"publication_status":"published","status":"public","type":"conference","conference":{"name":"FASE: Fundamental Approaches to Software Engineering","start_date":"2023-04-22","end_date":"2023-04-27","location":"Paris, France"},"tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"_id":"12856","department":[{"_id":"ToHe"}],"file_date_updated":"2023-04-25T07:16:36Z","ddc":["000"],"date_updated":"2023-04-25T07:19:07Z"},{"project":[{"_id":"62781420-2b32-11ec-9570-8d9b63373d4d","call_identifier":"H2020","grant_number":"101020093","name":"Vigilant Algorithmic Monitoring of Software"}],"citation":{"ista":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. 2023. VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 38p.","chicago":"Chalupa, Marek, Fabian Mühlböck, Stefanie Muroya Lei, and Thomas A Henzinger. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023. https://doi.org/10.15479/AT:ISTA:12407.","ama":"Chalupa M, Mühlböck F, Muroya Lei S, Henzinger TA. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria; 2023. doi:10.15479/AT:ISTA:12407","apa":"Chalupa, M., Mühlböck, F., Muroya Lei, S., & Henzinger, T. A. (2023). VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria. https://doi.org/10.15479/AT:ISTA:12407","short":"M. Chalupa, F. Mühlböck, S. Muroya Lei, T.A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring, Institute of Science and Technology Austria, 2023.","ieee":"M. Chalupa, F. Mühlböck, S. Muroya Lei, and T. A. Henzinger, VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023.","mla":"Chalupa, Marek, et al. VAMOS: Middleware for Best-Effort Third-Party Monitoring. Institute of Science and Technology Austria, 2023, doi:10.15479/AT:ISTA:12407."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"last_name":"Chalupa","full_name":"Chalupa, Marek","id":"87e34708-d6c6-11ec-9f5b-9391e7be2463","first_name":"Marek"},{"orcid":"0000-0003-1548-0177","full_name":"Mühlböck, Fabian","last_name":"Mühlböck","first_name":"Fabian","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425"},{"full_name":"Muroya Lei, Stefanie","last_name":"Muroya Lei","first_name":"Stefanie","id":"a376de31-8972-11ed-ae7b-d0251c13c8ff"},{"last_name":"Henzinger","full_name":"Henzinger, Thomas A","orcid":"0000-0002-2985-7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"title":"VAMOS: Middleware for Best-Effort Third-Party Monitoring","acknowledgement":"This work was supported in part by the ERC-2020-AdG 101020093. \r\nThe authors would like to thank the anonymous FASE reviewers for their valuable feedback and suggestions.","oa":1,"publisher":"Institute of Science and Technology Austria","year":"2023","has_accepted_license":"1","day":"27","page":"38","date_created":"2023-01-27T03:18:08Z","date_published":"2023-01-27T00:00:00Z","doi":"10.15479/AT:ISTA:12407","_id":"12407","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"type":"technical_report","keyword":["runtime monitoring","best effort","third party"],"status":"public","date_updated":"2023-04-25T07:19:06Z","ddc":["005"],"file_date_updated":"2023-01-27T03:18:34Z","department":[{"_id":"ToHe"}],"abstract":[{"text":"As the complexity and criticality of software increase every year, so does the importance of run-time monitoring. Third-party monitoring, with limited knowledge of the monitored software, and best-effort monitoring, which keeps pace with the monitored software, are especially valuable, yet underexplored areas of run-time monitoring. Most existing monitoring frameworks do not support their combination because they either require access to the monitored code for instrumentation purposes or the processing of all observed events, or both.\r\n\r\nWe present a middleware framework, VAMOS, for the run-time monitoring of software which is explicitly designed to support third-party and best-effort scenarios. The design goals of VAMOS are (i) efficiency (keeping pace at low overhead), (ii) flexibility (the ability to monitor black-box code through a variety of different event channels, and the connectability to monitors written in different specification languages), and (iii) ease-of-use. To achieve its goals, VAMOS combines aspects of event broker and event recognition systems with aspects of stream processing systems.\r\n\r\nWe implemented a prototype toolchain for VAMOS and conducted experiments including a case study of monitoring for data races. The results indicate that VAMOS enables writing useful yet efficient monitors, is compatible with a variety of event sources and monitor specifications, and simplifies key aspects of setting up a monitoring system from scratch.","lang":"eng"}],"oa_version":"Published Version","alternative_title":["IST Austria Technical Report"],"month":"01","publication_status":"published","publication_identifier":{"eissn":["2664-1690"]},"language":[{"iso":"eng"}],"file":[{"date_updated":"2023-01-27T03:18:34Z","file_size":662409,"creator":"fmuehlbo","date_created":"2023-01-27T03:18:34Z","file_name":"main.pdf","content_type":"application/pdf","access_level":"open_access","relation":"main_file","checksum":"55426e463fdeafe9777fc3ff635154c7","file_id":"12408","success":1}],"ec_funded":1,"related_material":{"record":[{"relation":"later_version","id":"12856","status":"public"}]}},{"ec_funded":1,"publication_status":"published","publication_identifier":{"isbn":["9781450399135"]},"language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2303.04014","open_access":"1"}],"month":"06","abstract":[{"text":"In this paper we introduce a pruning of the medial axis called the (λ,α)-medial axis (axλα). We prove that the (λ,α)-medial axis of a set K is stable in a Gromov-Hausdorff sense under weak assumptions. More formally we prove that if K and K′ are close in the Hausdorff (dH) sense then the (λ,α)-medial axes of K and K′ are close as metric spaces, that is the Gromov-Hausdorff distance (dGH) between the two is 1/4-Hölder in the sense that dGH (axλα(K),axλα(K′)) ≲ dH(K,K′)1/4. The Hausdorff distance between the two medial axes is also bounded, by dH (axλα(K),λα(K′)) ≲ dH(K,K′)1/2. These quantified stability results provide guarantees for practical computations of medial axes from approximations. Moreover, they provide key ingredients for studying the computability of the medial axis in the context of computable analysis.","lang":"eng"}],"oa_version":"Preprint","department":[{"_id":"HeEd"}],"date_updated":"2023-05-22T08:15:19Z","conference":{"end_date":"2023-06-23","location":"Orlando, FL, United States","start_date":"2023-06-20","name":"STOC: Symposium on Theory of Computing"},"type":"conference","status":"public","_id":"13048","page":"1768-1776","date_created":"2023-05-22T08:02:02Z","doi":"10.1145/3564246.3585113","date_published":"2023-06-02T00:00:00Z","year":"2023","publication":"Proceedings of the 55th Annual ACM Symposium on Theory of Computing","day":"02","oa":1,"publisher":"Association for Computing Machinery","quality_controlled":"1","acknowledgement":"We are greatly indebted to Erin Chambers for posing a number of questions that eventually led to this paper. We would also like to thank the other organizers of the workshop on ‘Algorithms\r\nfor the medial axis’. We are also indebted to Tatiana Ezubova for helping with the search for and translation of Russian literature. The second author thanks all members of the Edelsbrunner and Datashape groups for the atmosphere in which the research was conducted.\r\nThe research leading to these results has received funding from the European Research Council (ERC) under the European Union’s Seventh Framework Programme (FP/2007-2013) / ERC Grant Agreement No. 339025 GUDHI (Algorithmic Foundations of Geometry Understanding in Higher Dimensions). Supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411. The Austrian science fund (FWF) M-3073.","external_id":{"arxiv":["2303.04014"]},"article_processing_charge":"No","author":[{"first_name":"André","full_name":"Lieutier, André","last_name":"Lieutier"},{"id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","first_name":"Mathijs","last_name":"Wintraecken","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"title":"Hausdorff and Gromov-Hausdorff stable subsets of the medial axis","citation":{"ista":"Lieutier A, Wintraecken M. 2023. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. Proceedings of the 55th Annual ACM Symposium on Theory of Computing. STOC: Symposium on Theory of Computing, 1768–1776.","chicago":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” In Proceedings of the 55th Annual ACM Symposium on Theory of Computing, 1768–76. Association for Computing Machinery, 2023. https://doi.org/10.1145/3564246.3585113.","ieee":"A. Lieutier and M. Wintraecken, “Hausdorff and Gromov-Hausdorff stable subsets of the medial axis,” in Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Orlando, FL, United States, 2023, pp. 1768–1776.","short":"A. Lieutier, M. Wintraecken, in:, Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–1776.","apa":"Lieutier, A., & Wintraecken, M. (2023). Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In Proceedings of the 55th Annual ACM Symposium on Theory of Computing (pp. 1768–1776). Orlando, FL, United States: Association for Computing Machinery. https://doi.org/10.1145/3564246.3585113","ama":"Lieutier A, Wintraecken M. Hausdorff and Gromov-Hausdorff stable subsets of the medial axis. In: Proceedings of the 55th Annual ACM Symposium on Theory of Computing. Association for Computing Machinery; 2023:1768-1776. doi:10.1145/3564246.3585113","mla":"Lieutier, André, and Mathijs Wintraecken. “Hausdorff and Gromov-Hausdorff Stable Subsets of the Medial Axis.” Proceedings of the 55th Annual ACM Symposium on Theory of Computing, Association for Computing Machinery, 2023, pp. 1768–76, doi:10.1145/3564246.3585113."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","project":[{"call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411"},{"_id":"fc390959-9c52-11eb-aca3-afa58bd282b2","name":"Learning and triangulating manifolds via collapses","grant_number":"M03073"}]},{"month":"05","oa":1,"main_file_link":[{"open_access":"1","url":"https://openreview.net/pdf?id=_eTZBs-yedr"}],"quality_controlled":"1","acknowledgement":"AP, EK, DA received funding from the European Research Council (ERC) under the European\r\nUnion’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). AV acknowledges the support of the French Agence Nationale de la Recherche (ANR), under grant ANR-21-CE48-0016 (project COMCOPT). We further acknowledge the support from the Scientific Service Units (SSU) of ISTA through resources provided by Scientific Computing (SciComp)-","oa_version":"Preprint","acknowledged_ssus":[{"_id":"ScienComp"}],"abstract":[{"text":"Deep neural networks (DNNs) often have to be compressed, via pruning and/or quantization, before they can be deployed in practical settings. In this work we propose a new compression-aware minimizer dubbed CrAM that modifies the optimization step in a principled way, in order to produce models whose local loss behavior is stable under compression operations such as pruning. Thus, dense models trained via CrAM should be compressible post-training, in a single step, without significant accuracy loss. Experimental results on standard benchmarks, such as residual networks for ImageNet classification and BERT models for language modelling, show that CrAM produces dense models that can be more accurate than the standard SGD/Adam-based baselines, but which are stable under weight pruning: specifically, we can prune models in one-shot to 70-80% sparsity with almost no accuracy loss, and to 90% with reasonable (∼1%) accuracy loss, which is competitive with gradual compression methods. Additionally, CrAM can produce sparse models which perform well for transfer learning, and it also works for semi-structured 2:4 pruning patterns supported by GPU hardware. The code for reproducing the results is available at this https URL .","lang":"eng"}],"date_created":"2023-05-23T11:36:18Z","ec_funded":1,"date_published":"2023-05-01T00:00:00Z","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"13074"}]},"publication":"11th International Conference on Learning Representations ","language":[{"iso":"eng"}],"publication_status":"accepted","year":"2023","status":"public","project":[{"call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning"}],"conference":{"start_date":"2023-05-01","location":"Kigali, Rwanda ","end_date":"2023-05-05","name":"ICLR: International Conference on Learning Representations"},"type":"conference","_id":"13053","department":[{"_id":"GradSch"},{"_id":"DaAl"},{"_id":"ChLa"}],"title":"CrAM: A Compression-Aware Minimizer","article_processing_charge":"No","external_id":{"arxiv":["2207.14200"]},"author":[{"id":"32D78294-F248-11E8-B48F-1D18A9856A87","first_name":"Elena-Alexandra","full_name":"Peste, Elena-Alexandra","last_name":"Peste"},{"first_name":"Adrian","last_name":"Vladu","full_name":"Vladu, Adrian"},{"full_name":"Kurtic, Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218","first_name":"Eldar"},{"id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","orcid":"0000-0001-8622-7887","full_name":"Lampert, Christoph","last_name":"Lampert"},{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Peste, Elena-Alexandra, et al. “CrAM: A Compression-Aware Minimizer.” 11th International Conference on Learning Representations .","ieee":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, and D.-A. Alistarh, “CrAM: A Compression-Aware Minimizer,” in 11th International Conference on Learning Representations , Kigali, Rwanda .","short":"E.-A. Peste, A. Vladu, E. Kurtic, C. Lampert, D.-A. Alistarh, in:, 11th International Conference on Learning Representations , n.d.","apa":"Peste, E.-A., Vladu, A., Kurtic, E., Lampert, C., & Alistarh, D.-A. (n.d.). CrAM: A Compression-Aware Minimizer. In 11th International Conference on Learning Representations . Kigali, Rwanda .","ama":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. In: 11th International Conference on Learning Representations .","chicago":"Peste, Elena-Alexandra, Adrian Vladu, Eldar Kurtic, Christoph Lampert, and Dan-Adrian Alistarh. “CrAM: A Compression-Aware Minimizer.” In 11th International Conference on Learning Representations , n.d.","ista":"Peste E-A, Vladu A, Kurtic E, Lampert C, Alistarh D-A. CrAM: A Compression-Aware Minimizer. 11th International Conference on Learning Representations . ICLR: International Conference on Learning Representations."},"date_updated":"2023-06-01T12:54:45Z"},{"publication_status":"published","publication_identifier":{"issn":["0302-9743"],"isbn":["9783031313677"],"eissn":["1611-3349"]},"language":[{"iso":"eng"}],"volume":13940,"abstract":[{"text":"GIMPS and PrimeGrid are large-scale distributed projects dedicated to searching giant prime numbers, usually of special forms like Mersenne and Proth primes. The numbers in the current search-space are millions of digits large and the participating volunteers need to run resource-consuming primality tests. Once a candidate prime N has been found, the only way for another party to independently verify the primality of N used to be by repeating the expensive primality test. To avoid the need for second recomputation of each primality test, these projects have recently adopted certifying mechanisms that enable efficient verification of performed tests. However, the mechanisms presently in place only detect benign errors and there is no guarantee against adversarial behavior: a malicious volunteer can mislead the project to reject a giant prime as being non-prime.\r\nIn this paper, we propose a practical, cryptographically-sound mechanism for certifying the non-primality of Proth numbers. That is, a volunteer can – parallel to running the primality test for N – generate an efficiently verifiable proof at a little extra cost certifying that N is not prime. The interactive protocol has statistical soundness and can be made non-interactive using the Fiat-Shamir heuristic.\r\nOur approach is based on a cryptographic primitive called Proof of Exponentiation (PoE) which, for a group G, certifies that a tuple (x,y,T)∈G2×N satisfies x2T=y (Pietrzak, ITCS 2019 and Wesolowski, J. Cryptol. 2020). In particular, we show how to adapt Pietrzak’s PoE at a moderate additional cost to make it a cryptographically-sound certificate of non-primality.","lang":"eng"}],"oa_version":"Submitted Version","main_file_link":[{"url":"https://eprint.iacr.org/2023/238","open_access":"1"}],"scopus_import":"1","alternative_title":["LNCS"],"intvolume":" 13940","month":"05","date_updated":"2023-06-19T08:03:37Z","department":[{"_id":"KrPi"}],"_id":"13143","conference":{"name":"PKC: Public-Key Cryptography","start_date":"2023-05-07","end_date":"2023-05-10","location":"Atlanta, GA, United States"},"type":"conference","status":"public","year":"2023","publication":"Public-Key Cryptography - PKC 2023","day":"02","page":"530-553","date_created":"2023-06-18T22:00:47Z","date_published":"2023-05-02T00:00:00Z","doi":"10.1007/978-3-031-31368-4_19","acknowledgement":"We are grateful to Pavel Atnashev for clarifying via e-mail several aspects of the primality tests implementated in the PrimeGrid project. Pavel Hubáček is supported by the Czech Academy of Sciences (RVO 67985840), the Grant Agency of the Czech Republic under the grant agreement no. 19-27871X, and by the Charles University project UNCE/SCI/004. Chethan Kamath is supported by Azrieli International Postdoctoral Fellowship, ISF grants 484/18 and 1789/19, and ERC StG project SPP: Secrecy Preserving Proofs.","oa":1,"publisher":"Springer Nature","quality_controlled":"1","citation":{"ista":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. 2023. Certifying giant nonprimes. Public-Key Cryptography - PKC 2023. PKC: Public-Key Cryptography, LNCS, vol. 13940, 530–553.","chicago":"Hoffmann, Charlotte, Pavel Hubáček, Chethan Kamath, and Krzysztof Z Pietrzak. “Certifying Giant Nonprimes.” In Public-Key Cryptography - PKC 2023, 13940:530–53. Springer Nature, 2023. https://doi.org/10.1007/978-3-031-31368-4_19.","apa":"Hoffmann, C., Hubáček, P., Kamath, C., & Pietrzak, K. Z. (2023). Certifying giant nonprimes. In Public-Key Cryptography - PKC 2023 (Vol. 13940, pp. 530–553). Atlanta, GA, United States: Springer Nature. https://doi.org/10.1007/978-3-031-31368-4_19","ama":"Hoffmann C, Hubáček P, Kamath C, Pietrzak KZ. Certifying giant nonprimes. In: Public-Key Cryptography - PKC 2023. Vol 13940. Springer Nature; 2023:530-553. doi:10.1007/978-3-031-31368-4_19","short":"C. Hoffmann, P. Hubáček, C. Kamath, K.Z. Pietrzak, in:, Public-Key Cryptography - PKC 2023, Springer Nature, 2023, pp. 530–553.","ieee":"C. Hoffmann, P. Hubáček, C. Kamath, and K. Z. Pietrzak, “Certifying giant nonprimes,” in Public-Key Cryptography - PKC 2023, Atlanta, GA, United States, 2023, vol. 13940, pp. 530–553.","mla":"Hoffmann, Charlotte, et al. “Certifying Giant Nonprimes.” Public-Key Cryptography - PKC 2023, vol. 13940, Springer Nature, 2023, pp. 530–53, doi:10.1007/978-3-031-31368-4_19."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","author":[{"first_name":"Charlotte","id":"0f78d746-dc7d-11ea-9b2f-83f92091afe7","last_name":"Hoffmann","full_name":"Hoffmann, Charlotte"},{"first_name":"Pavel","full_name":"Hubáček, Pavel","last_name":"Hubáček"},{"first_name":"Chethan","full_name":"Kamath, Chethan","last_name":"Kamath"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z"}],"title":"Certifying giant nonprimes"}]