[{"date_updated":"2022-08-05T09:05:06Z","date_created":"2022-03-13T23:01:47Z","author":[{"full_name":"Tomášek, Petr","last_name":"Tomášek","first_name":"Petr"},{"first_name":"Karel","last_name":"Horák","full_name":"Horák, Karel"},{"full_name":"Aradhye, Aditya","first_name":"Aditya","last_name":"Aradhye"},{"full_name":"Bošanský, Branislav","last_name":"Bošanský","first_name":"Branislav"},{"orcid":"0000-0002-4561-241X","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu"}],"publication_status":"published","publisher":"International Joint Conferences on Artificial Intelligence","department":[{"_id":"KrCh"}],"acknowledgement":"This research was supported by the Czech Science Foundation (no. 19-24384Y), by the OP VVV MEYS funded project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics”, by the ERC CoG 863818 (ForM-SMArt), and by the Combat Capabilities Development Command Army Research Laboratory and was accomplished under Cooperative\r\nAgreement Number W911NF-13-2-0045 (ARL Cyber Security CRA). The views and conclusions contained in this document are those of the authors and should not be interpreted as\r\nrepresenting the official policies, either expressed or implied, of the Combat Capabilities Development Command Army Research Laboratory or the U.S. Government. The U.S. Government is authorized to reproduce and distribute reprints for Government purposes not withstanding any copyright notation here on. ","year":"2021","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"IJCAI: International Joint Conferences on Artificial Intelligence Organization","start_date":"2021-08-19","location":"Virtual, Online","end_date":"2021-08-27"},"doi":"10.24963/ijcai.2021/575","quality_controlled":"1","project":[{"_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","grant_number":"863818","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.24963/ijcai.2021/575"}],"oa":1,"month":"09","publication_identifier":{"isbn":["9780999241196"],"issn":["1045-0823"]},"oa_version":"Published Version","title":"Solving partially observable stochastic shortest-path games","status":"public","_id":"10847","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"We study the two-player zero-sum extension of the partially observable stochastic shortest-path problem where one agent has only partial information about the environment. We formulate this problem as a partially observable stochastic game (POSG): given a set of target states and negative rewards for each transition, the player with imperfect information maximizes the expected undiscounted total reward until a target state is reached. The second player with the perfect information aims for the opposite. We base our formalism on POSGs with one-sided observability (OS-POSGs) and give the following contributions: (1) we introduce a novel heuristic search value iteration algorithm that iteratively solves depth-limited variants of the game, (2) we derive the bound on the depth guaranteeing an arbitrary precision, (3) we propose a novel upper-bound estimation that allows early terminations, and (4) we experimentally evaluate the algorithm on a pursuit-evasion game."}],"type":"conference","date_published":"2021-09-01T00:00:00Z","page":"4182-4189","publication":"30th International Joint Conference on Artificial Intelligence","citation":{"mla":"Tomášek, Petr, et al. “Solving Partially Observable Stochastic Shortest-Path Games.” 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–89, doi:10.24963/ijcai.2021/575.","short":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, K. Chatterjee, in:, 30th International Joint Conference on Artificial Intelligence, International Joint Conferences on Artificial Intelligence, 2021, pp. 4182–4189.","chicago":"Tomášek, Petr, Karel Horák, Aditya Aradhye, Branislav Bošanský, and Krishnendu Chatterjee. “Solving Partially Observable Stochastic Shortest-Path Games.” In 30th International Joint Conference on Artificial Intelligence, 4182–89. International Joint Conferences on Artificial Intelligence, 2021. https://doi.org/10.24963/ijcai.2021/575.","ama":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. Solving partially observable stochastic shortest-path games. In: 30th International Joint Conference on Artificial Intelligence. International Joint Conferences on Artificial Intelligence; 2021:4182-4189. doi:10.24963/ijcai.2021/575","ista":"Tomášek P, Horák K, Aradhye A, Bošanský B, Chatterjee K. 2021. Solving partially observable stochastic shortest-path games. 30th International Joint Conference on Artificial Intelligence. IJCAI: International Joint Conferences on Artificial Intelligence Organization, 4182–4189.","apa":"Tomášek, P., Horák, K., Aradhye, A., Bošanský, B., & Chatterjee, K. (2021). Solving partially observable stochastic shortest-path games. In 30th International Joint Conference on Artificial Intelligence (pp. 4182–4189). Virtual, Online: International Joint Conferences on Artificial Intelligence. https://doi.org/10.24963/ijcai.2021/575","ieee":"P. Tomášek, K. Horák, A. Aradhye, B. Bošanský, and K. Chatterjee, “Solving partially observable stochastic shortest-path games,” in 30th International Joint Conference on Artificial Intelligence, Virtual, Online, 2021, pp. 4182–4189."},"day":"01","article_processing_charge":"No","scopus_import":"1"},{"abstract":[{"lang":"eng","text":"Dynamic Connectivity is a fundamental algorithmic graph problem, motivated by a wide range of applications to social and communication networks and used as a building block in various other algorithms, such as the bi-connectivity and the dynamic minimal spanning tree problems. In brief, we wish to maintain the connected components of the graph under dynamic edge insertions and deletions. In the sequential case, the problem has been well-studied from both theoretical and practical perspectives. However, much less is known about efficient concurrent solutions to this problem. This is the gap we address in this paper. We start from one of the classic data structures used to solve this problem, the Euler Tour Tree. Our first contribution is a non-blocking single-writer implementation of it. We leverage this data structure to obtain the first truly concurrent generalization of dynamic connectivity, which preserves the time complexity of its sequential counterpart, but is also scalable in practice. To achieve this, we rely on three main techniques. The first is to ensure that connectivity queries, which usually dominate real-world workloads, are non-blocking. The second non-trivial technique expands the above idea by making all queries that do not change the connectivity structure non-blocking. The third ingredient is applying fine-grained locking for updating the connected components, which allows operations on disjoint components to occur in parallel. We evaluate the resulting algorithm on various workloads, executing on both real and synthetic graphs. The results show the efficiency of each of the proposed optimizations; the most efficient variant improves the performance of a coarse-grained based implementation on realistic scenarios up to 6x on average and up to 30x when connectivity queries dominate."}],"type":"conference","date_created":"2022-03-18T08:21:47Z","date_updated":"2022-03-18T08:45:46Z","oa_version":"Preprint","author":[{"first_name":"Alexander","last_name":"Fedorov","full_name":"Fedorov, Alexander"},{"full_name":"Koval, Nikita","last_name":"Koval","first_name":"Nikita"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"publication_status":"published","title":"A scalable concurrent algorithm for dynamic connectivity","status":"public","department":[{"_id":"DaAl"}],"publisher":"Association for Computing Machinery","_id":"10853","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","day":"01","article_processing_charge":"No","publication_identifier":{"isbn":["9781450380706"]},"scopus_import":"1","language":[{"iso":"eng"}],"conference":{"name":"SPAA: Symposium on Parallelism in Algorithms and Architectures","end_date":"2021-07-08","location":"Virtual, Online","start_date":"2021-07-06"},"date_published":"2021-07-01T00:00:00Z","doi":"10.1145/3409964.3461810","quality_controlled":"1","page":"208-220","publication":"Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures","external_id":{"arxiv":["2105.08098"]},"main_file_link":[{"url":"https://arxiv.org/abs/2105.08098","open_access":"1"}],"citation":{"ama":"Fedorov A, Koval N, Alistarh D-A. A scalable concurrent algorithm for dynamic connectivity. In: Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. Association for Computing Machinery; 2021:208-220. doi:10.1145/3409964.3461810","ista":"Fedorov A, Koval N, Alistarh D-A. 2021. A scalable concurrent algorithm for dynamic connectivity. Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures. SPAA: Symposium on Parallelism in Algorithms and Architectures, 208–220.","ieee":"A. Fedorov, N. Koval, and D.-A. Alistarh, “A scalable concurrent algorithm for dynamic connectivity,” in Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Virtual, Online, 2021, pp. 208–220.","apa":"Fedorov, A., Koval, N., & Alistarh, D.-A. (2021). A scalable concurrent algorithm for dynamic connectivity. In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures (pp. 208–220). Virtual, Online: Association for Computing Machinery. https://doi.org/10.1145/3409964.3461810","mla":"Fedorov, Alexander, et al. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–20, doi:10.1145/3409964.3461810.","short":"A. Fedorov, N. Koval, D.-A. Alistarh, in:, Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, Association for Computing Machinery, 2021, pp. 208–220.","chicago":"Fedorov, Alexander, Nikita Koval, and Dan-Adrian Alistarh. “A Scalable Concurrent Algorithm for Dynamic Connectivity.” In Proceedings of the 33rd ACM Symposium on Parallelism in Algorithms and Architectures, 208–20. Association for Computing Machinery, 2021. https://doi.org/10.1145/3409964.3461810."},"oa":1},{"ec_funded":1,"abstract":[{"text":"Brain dynamics display collective phenomena as diverse as neuronal oscillations and avalanches. Oscillations are rhythmic, with fluctuations occurring at a characteristic scale, whereas avalanches are scale-free cascades of neural activity. Here we show that such antithetic features can coexist in a very generic class of adaptive neural networks. In the most simple yet fully microscopic model from this class we make direct contact with human brain resting-state activity recordings via tractable inference of the model's two essential parameters. The inferred model quantitatively captures the dynamics over a broad range of scales, from single sensor fluctuations, collective behaviors of nearly-synchronous extreme events on multiple sensors, to neuronal avalanches unfolding over multiple sensors across multiple time-bins. Importantly, the inferred parameters correlate with model-independent signatures of \"closeness to criticality\", suggesting that the coexistence of scale-specific (neural oscillations) and scale-free (neuronal avalanches) dynamics in brain activity occurs close to a non-equilibrium critical point at the onset of self-sustained oscillations.","lang":"eng"}],"type":"preprint","oa_version":"Preprint","date_created":"2022-03-21T11:41:28Z","date_updated":"2022-03-22T07:53:18Z","author":[{"full_name":"Lombardi, Fabrizio","first_name":"Fabrizio","last_name":"Lombardi","id":"A057D288-3E88-11E9-986D-0CF4E5697425","orcid":"0000-0003-2623-5249"},{"last_name":"Pepic","first_name":"Selver","id":"F93245C4-C3CA-11E9-B4F0-C6F4E5697425","full_name":"Pepic, Selver"},{"last_name":"Shriki","first_name":"Oren","full_name":"Shriki, Oren"},{"last_name":"Tkačik","first_name":"Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper"},{"full_name":"De Martino, Daniele","last_name":"De Martino","first_name":"Daniele"}],"publisher":"arXiv","department":[{"_id":"GaTk"}],"title":"Quantifying the coexistence of neuronal oscillations and avalanches","publication_status":"submitted","status":"public","ddc":["570"],"_id":"10912","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","acknowledgement":"FL acknowledges support from the European Union’s Horizon 2020 research and innovation program under the Marie Sklodowska-Curie Grant Agreement No. 754411. GT\r\nacknowledges the support of the Austrian Science Fund (FWF) under Stand-Alone Grant\r\nNo. P34015.","article_processing_charge":"No","day":"17","month":"08","language":[{"iso":"eng"}],"doi":"10.48550/ARXIV.2108.06686","date_published":"2021-08-17T00:00:00Z","project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"},{"name":"Efficient coding with biophysical realism","grant_number":"P34015","_id":"626c45b5-2b32-11ec-9570-e509828c1ba6"}],"page":"37","citation":{"ama":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. doi:10.48550/ARXIV.2108.06686","ista":"Lombardi F, Pepic S, Shriki O, Tkačik G, De Martino D. Quantifying the coexistence of neuronal oscillations and avalanches. 10.48550/ARXIV.2108.06686.","apa":"Lombardi, F., Pepic, S., Shriki, O., Tkačik, G., & De Martino, D. (n.d.). Quantifying the coexistence of neuronal oscillations and avalanches. arXiv. https://doi.org/10.48550/ARXIV.2108.06686","ieee":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, and D. De Martino, “Quantifying the coexistence of neuronal oscillations and avalanches.” arXiv.","mla":"Lombardi, Fabrizio, et al. Quantifying the Coexistence of Neuronal Oscillations and Avalanches. arXiv, doi:10.48550/ARXIV.2108.06686.","short":"F. Lombardi, S. Pepic, O. Shriki, G. Tkačik, D. De Martino, (n.d.).","chicago":"Lombardi, Fabrizio, Selver Pepic, Oren Shriki, Gašper Tkačik, and Daniele De Martino. “Quantifying the Coexistence of Neuronal Oscillations and Avalanches.” arXiv, n.d. https://doi.org/10.48550/ARXIV.2108.06686."},"external_id":{"arxiv":["2108.06686"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2108.06686","open_access":"1"}]},{"article_processing_charge":"No","day":"01","scopus_import":"1","keyword":["Geriatrics and Gerontology","Aging"],"date_published":"2021-10-01T00:00:00Z","citation":{"chicago":"Shadel, Gerald S., Peter D. Adams, W. Travis Berggren, Jolene K. Diedrich, Kenneth E. Diffenderfer, Fred H. Gage, Nasun Hah, et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” GeroScience. Springer Nature, 2021. https://doi.org/10.1007/s11357-021-00426-x.","mla":"Shadel, Gerald S., et al. “The San Diego Nathan Shock Center: Tackling the Heterogeneity of Aging.” GeroScience, vol. 43, no. 5, Springer Nature, 2021, pp. 2139–48, doi:10.1007/s11357-021-00426-x.","short":"G.S. Shadel, P.D. Adams, W.T. Berggren, J.K. Diedrich, K.E. Diffenderfer, F.H. Gage, N. Hah, M. Hansen, M. Hetzer, A.J.A. Molina, U. Manor, K. Marek, D.D. O’Keefe, A.F.M. Pinto, A. Sacco, T.O. Sharpee, M.N. Shokriev, S. Zambetti, GeroScience 43 (2021) 2139–2148.","ista":"Shadel GS, Adams PD, Berggren WT, Diedrich JK, Diffenderfer KE, Gage FH, Hah N, Hansen M, Hetzer M, Molina AJA, Manor U, Marek K, O’Keefe DD, Pinto AFM, Sacco A, Sharpee TO, Shokriev MN, Zambetti S. 2021. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. GeroScience. 43(5), 2139–2148.","ieee":"G. S. Shadel et al., “The San Diego Nathan Shock Center: Tackling the heterogeneity of aging,” GeroScience, vol. 43, no. 5. Springer Nature, pp. 2139–2148, 2021.","apa":"Shadel, G. S., Adams, P. D., Berggren, W. T., Diedrich, J. K., Diffenderfer, K. E., Gage, F. H., … Zambetti, S. (2021). The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. GeroScience. Springer Nature. https://doi.org/10.1007/s11357-021-00426-x","ama":"Shadel GS, Adams PD, Berggren WT, et al. The San Diego Nathan Shock Center: Tackling the heterogeneity of aging. GeroScience. 2021;43(5):2139-2148. doi:10.1007/s11357-021-00426-x"},"publication":"GeroScience","page":"2139-2148","article_type":"original","issue":"5","abstract":[{"lang":"eng","text":"Understanding basic mechanisms of aging holds great promise for developing interventions that prevent or delay many age-related declines and diseases simultaneously to increase human healthspan. However, a major confounding factor in aging research is the heterogeneity of the aging process itself. At the organismal level, it is clear that chronological age does not always predict biological age or susceptibility to frailty or pathology. While genetics and environment are major factors driving variable rates of aging, additional complexity arises because different organs, tissues, and cell types are intrinsically heterogeneous and exhibit different aging trajectories normally or in response to the stresses of the aging process (e.g., damage accumulation). Tackling the heterogeneity of aging requires new and specialized tools (e.g., single-cell analyses, mass spectrometry-based approaches, and advanced imaging) to identify novel signatures of aging across scales. Cutting-edge computational approaches are then needed to integrate these disparate datasets and elucidate network interactions between known aging hallmarks. There is also a need for improved, human cell-based models of aging to ensure that basic research findings are relevant to human aging and healthspan interventions. The San Diego Nathan Shock Center (SD-NSC) provides access to cutting-edge scientific resources to facilitate the study of the heterogeneity of aging in general and to promote the use of novel human cell models of aging. The center also has a robust Research Development Core that funds pilot projects on the heterogeneity of aging and organizes innovative training activities, including workshops and a personalized mentoring program, to help investigators new to the aging field succeed. Finally, the SD-NSC participates in outreach activities to educate the general community about the importance of aging research and promote the need for basic biology of aging research in particular."}],"type":"journal_article","oa_version":"Published Version","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","_id":"11053","intvolume":" 43","status":"public","title":"The San Diego Nathan Shock Center: Tackling the heterogeneity of aging","publication_identifier":{"issn":["2509-2715","2509-2723"]},"month":"10","doi":"10.1007/s11357-021-00426-x","language":[{"iso":"eng"}],"external_id":{"pmid":["34370163"]},"main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC8599742/"}],"oa":1,"quality_controlled":"1","extern":"1","author":[{"full_name":"Shadel, Gerald S.","first_name":"Gerald S.","last_name":"Shadel"},{"last_name":"Adams","first_name":"Peter D.","full_name":"Adams, Peter D."},{"first_name":"W. Travis","last_name":"Berggren","full_name":"Berggren, W. Travis"},{"first_name":"Jolene K.","last_name":"Diedrich","full_name":"Diedrich, Jolene K."},{"full_name":"Diffenderfer, Kenneth E.","last_name":"Diffenderfer","first_name":"Kenneth E."},{"full_name":"Gage, Fred H.","last_name":"Gage","first_name":"Fred H."},{"last_name":"Hah","first_name":"Nasun","full_name":"Hah, Nasun"},{"full_name":"Hansen, Malene","first_name":"Malene","last_name":"Hansen"},{"first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X","full_name":"HETZER, Martin W"},{"full_name":"Molina, Anthony J. A.","first_name":"Anthony J. A.","last_name":"Molina"},{"last_name":"Manor","first_name":"Uri","full_name":"Manor, Uri"},{"full_name":"Marek, Kurt","first_name":"Kurt","last_name":"Marek"},{"full_name":"O’Keefe, David D.","first_name":"David D.","last_name":"O’Keefe"},{"first_name":"Antonio F. M.","last_name":"Pinto","full_name":"Pinto, Antonio F. M."},{"full_name":"Sacco, Alessandra","last_name":"Sacco","first_name":"Alessandra"},{"last_name":"Sharpee","first_name":"Tatyana O.","full_name":"Sharpee, Tatyana O."},{"last_name":"Shokriev","first_name":"Maxim N.","full_name":"Shokriev, Maxim N."},{"last_name":"Zambetti","first_name":"Stefania","full_name":"Zambetti, Stefania"}],"volume":43,"date_updated":"2022-07-18T08:27:24Z","date_created":"2022-04-07T07:43:25Z","pmid":1,"year":"2021","publisher":"Springer Nature","publication_status":"published"},{"extern":"1","author":[{"first_name":"Shefali","last_name":"Krishna","full_name":"Krishna, Shefali"},{"first_name":"Rafael","last_name":"Arrojo e Drigo","full_name":"Arrojo e Drigo, Rafael"},{"first_name":"Juliana S.","last_name":"Capitanio","full_name":"Capitanio, Juliana S."},{"full_name":"Ramachandra, Ranjan","first_name":"Ranjan","last_name":"Ramachandra"},{"full_name":"Ellisman, Mark","last_name":"Ellisman","first_name":"Mark"},{"full_name":"HETZER, Martin W","first_name":"Martin W","last_name":"HETZER","id":"86c0d31b-b4eb-11ec-ac5a-eae7b2e135ed","orcid":"0000-0002-2111-992X"}],"date_updated":"2022-07-18T08:26:38Z","date_created":"2022-04-07T07:43:14Z","volume":56,"year":"2021","pmid":1,"publication_status":"published","publisher":"Elsevier","month":"11","publication_identifier":{"issn":["1534-5807"]},"doi":"10.1016/j.devcel.2021.10.008","language":[{"iso":"eng"}],"external_id":{"pmid":["34715012"]},"quality_controlled":"1","abstract":[{"text":"In order to combat molecular damage, most cellular proteins undergo rapid turnover. We have previously identified large nuclear protein assemblies that can persist for years in post-mitotic tissues and are subject to age-related decline. Here, we report that mitochondria can be long lived in the mouse brain and reveal that specific mitochondrial proteins have half-lives longer than the average proteome. These mitochondrial long-lived proteins (mitoLLPs) are core components of the electron transport chain (ETC) and display increased longevity in respiratory supercomplexes. We find that COX7C, a mitoLLP that forms a stable contact site between complexes I and IV, is required for complex IV and supercomplex assembly. Remarkably, even upon depletion of COX7C transcripts, ETC function is maintained for days, effectively uncoupling mitochondrial function from ongoing transcription of its mitoLLPs. Our results suggest that modulating protein longevity within the ETC is critical for mitochondrial proteome maintenance and the robustness of mitochondrial function.","lang":"eng"}],"issue":"21","type":"journal_article","oa_version":"None","_id":"11052","user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","title":"Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain","status":"public","intvolume":" 56","day":"08","article_processing_charge":"No","scopus_import":"1","keyword":["Developmental Biology","Cell Biology","General Biochemistry","Genetics and Molecular Biology","Molecular Biology"],"date_published":"2021-11-08T00:00:00Z","publication":"Developmental Cell","citation":{"apa":"Krishna, S., Arrojo e Drigo, R., Capitanio, J. S., Ramachandra, R., Ellisman, M., & Hetzer, M. (2021). Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. Elsevier. https://doi.org/10.1016/j.devcel.2021.10.008","ieee":"S. Krishna, R. Arrojo e Drigo, J. S. Capitanio, R. Ramachandra, M. Ellisman, and M. Hetzer, “Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain,” Developmental Cell, vol. 56, no. 21. Elsevier, p. P2952–2965.e9, 2021.","ista":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. 2021. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. 56(21), P2952–2965.e9.","ama":"Krishna S, Arrojo e Drigo R, Capitanio JS, Ramachandra R, Ellisman M, Hetzer M. Identification of long-lived proteins in the mitochondria reveals increased stability of the electron transport chain. Developmental Cell. 2021;56(21):P2952-2965.e9. doi:10.1016/j.devcel.2021.10.008","chicago":"Krishna, Shefali, Rafael Arrojo e Drigo, Juliana S. Capitanio, Ranjan Ramachandra, Mark Ellisman, and Martin Hetzer. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” Developmental Cell. Elsevier, 2021. https://doi.org/10.1016/j.devcel.2021.10.008.","short":"S. Krishna, R. Arrojo e Drigo, J.S. Capitanio, R. Ramachandra, M. Ellisman, M. Hetzer, Developmental Cell 56 (2021) P2952–2965.e9.","mla":"Krishna, Shefali, et al. “Identification of Long-Lived Proteins in the Mitochondria Reveals Increased Stability of the Electron Transport Chain.” Developmental Cell, vol. 56, no. 21, Elsevier, 2021, p. P2952–2965.e9, doi:10.1016/j.devcel.2021.10.008."},"article_type":"original","page":"P2952-2965.e9"},{"volume":35,"date_updated":"2022-06-07T06:53:36Z","date_created":"2022-06-05T22:01:52Z","author":[{"last_name":"Kungurtsev","first_name":"Vyacheslav","full_name":"Kungurtsev, Vyacheslav"},{"full_name":"Egan, Malcolm","last_name":"Egan","first_name":"Malcolm"},{"first_name":"Bapi","last_name":"Chatterjee","id":"3C41A08A-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Bapi"},{"full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh","first_name":"Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87"}],"publisher":"AAAI Press","department":[{"_id":"DaAl"}],"publication_status":"published","acknowledgement":"Vyacheslav Kungurtsev was supported by the OP VVV project CZ.02.1.01/0.0/0.0/16 019/0000765 “Research Center for Informatics. Bapi Chatterjee was supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No. 754411 (ISTPlus). Dan Alistarh has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","year":"2021","ec_funded":1,"language":[{"iso":"eng"}],"conference":{"name":"AAAI: Conference on Artificial Intelligence","end_date":"2021-02-09","start_date":"2021-02-02","location":"Virtual, Online"},"project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"},{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"quality_controlled":"1","external_id":{"arxiv":["1905.11845"]},"oa":1,"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1905.11845","open_access":"1"}],"publication_identifier":{"issn":["2159-5399"],"isbn":["9781713835974"],"eissn":["2374-3468"]},"month":"05","oa_version":"Preprint","intvolume":" 35","status":"public","title":"Asynchronous optimization methods for efficient training of deep neural networks with guarantees","_id":"11436","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"9B","abstract":[{"text":"Asynchronous distributed algorithms are a popular way to reduce synchronization costs in large-scale optimization, and in particular for neural network training. However, for nonsmooth and nonconvex objectives, few convergence guarantees exist beyond cases where closed-form proximal operator solutions are available. As training most popular deep neural networks corresponds to optimizing nonsmooth and nonconvex objectives, there is a pressing need for such convergence guarantees. In this paper, we analyze for the first time the convergence of stochastic asynchronous optimization for this general class of objectives. In particular, we focus on stochastic subgradient methods allowing for block variable partitioning, where the shared model is asynchronously updated by concurrent processes. To this end, we use a probabilistic model which captures key features of real asynchronous scheduling between concurrent processes. Under this model, we establish convergence with probability one to an invariant set for stochastic subgradient methods with momentum. From a practical perspective, one issue with the family of algorithms that we consider is that they are not efficiently supported by machine learning frameworks, which mostly focus on distributed data-parallel strategies. To address this, we propose a new implementation strategy for shared-memory based training of deep neural networks for a partitioned but shared model in single- and multi-GPU settings. Based on this implementation, we achieve on average1.2x speed-up in comparison to state-of-the-art training methods for popular image classification tasks, without compromising accuracy.","lang":"eng"}],"type":"conference","date_published":"2021-05-18T00:00:00Z","page":"8209-8216","citation":{"chicago":"Kungurtsev, Vyacheslav, Malcolm Egan, Bapi Chatterjee, and Dan-Adrian Alistarh. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” In 35th AAAI Conference on Artificial Intelligence, AAAI 2021, 35:8209–16. AAAI Press, 2021.","mla":"Kungurtsev, Vyacheslav, et al. “Asynchronous Optimization Methods for Efficient Training of Deep Neural Networks with Guarantees.” 35th AAAI Conference on Artificial Intelligence, AAAI 2021, vol. 35, no. 9B, AAAI Press, 2021, pp. 8209–16.","short":"V. Kungurtsev, M. Egan, B. Chatterjee, D.-A. Alistarh, in:, 35th AAAI Conference on Artificial Intelligence, AAAI 2021, AAAI Press, 2021, pp. 8209–8216.","ista":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. 2021. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. 35th AAAI Conference on Artificial Intelligence, AAAI 2021. AAAI: Conference on Artificial Intelligence vol. 35, 8209–8216.","ieee":"V. Kungurtsev, M. Egan, B. Chatterjee, and D.-A. Alistarh, “Asynchronous optimization methods for efficient training of deep neural networks with guarantees,” in 35th AAAI Conference on Artificial Intelligence, AAAI 2021, Virtual, Online, 2021, vol. 35, no. 9B, pp. 8209–8216.","apa":"Kungurtsev, V., Egan, M., Chatterjee, B., & Alistarh, D.-A. (2021). Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In 35th AAAI Conference on Artificial Intelligence, AAAI 2021 (Vol. 35, pp. 8209–8216). Virtual, Online: AAAI Press.","ama":"Kungurtsev V, Egan M, Chatterjee B, Alistarh D-A. Asynchronous optimization methods for efficient training of deep neural networks with guarantees. In: 35th AAAI Conference on Artificial Intelligence, AAAI 2021. Vol 35. AAAI Press; 2021:8209-8216."},"publication":"35th AAAI Conference on Artificial Intelligence, AAAI 2021","article_processing_charge":"No","day":"18","scopus_import":"1"},{"abstract":[{"lang":"eng","text":"Neuronal computations depend on synaptic connectivity and intrinsic electrophysiological properties. Synaptic connectivity determines which inputs from presynaptic neurons are integrated, while cellular properties determine how inputs are filtered over time. Unlike their biological counterparts, most computational approaches to learning in simulated neural networks are limited to changes in synaptic connectivity. However, if intrinsic parameters change, neural computations are altered drastically. Here, we include the parameters that determine the intrinsic properties,\r\ne.g., time constants and reset potential, into the learning paradigm. Using sparse feedback signals that indicate target spike times, and gradient-based parameter updates, we show that the intrinsic parameters can be learned along with the synaptic weights to produce specific input-output functions. Specifically, we use a teacher-student paradigm in which a randomly initialised leaky integrate-and-fire or resonate-and-fire neuron must recover the parameters of a teacher neuron. We show that complex temporal functions can be learned online and without backpropagation through time, relying on event-based updates only. Our results are a step towards online learning of neural computations from ungraded and unsigned sparse feedback signals with a biologically inspired learning mechanism."}],"type":"conference","oa_version":"Published Version","title":"Online learning of neural computations from sparse temporal feedback","status":"public","intvolume":" 20","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11453","day":"01","article_processing_charge":"No","scopus_import":"1","date_published":"2021-12-01T00:00:00Z","page":"16437-16450","publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","citation":{"chicago":"Braun, Lukas, and Tim P Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, 20:16437–50. Neural Information Processing Systems Foundation, 2021.","mla":"Braun, Lukas, and Tim P. Vogels. “Online Learning of Neural Computations from Sparse Temporal Feedback.” Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, vol. 20, Neural Information Processing Systems Foundation, 2021, pp. 16437–50.","short":"L. Braun, T.P. Vogels, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 16437–16450.","ista":"Braun L, Vogels TP. 2021. Online learning of neural computations from sparse temporal feedback. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 20, 16437–16450.","ieee":"L. Braun and T. P. Vogels, “Online learning of neural computations from sparse temporal feedback,” in Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 20, pp. 16437–16450.","apa":"Braun, L., & Vogels, T. P. (2021). Online learning of neural computations from sparse temporal feedback. In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems (Vol. 20, pp. 16437–16450). Virtual, Online: Neural Information Processing Systems Foundation.","ama":"Braun L, Vogels TP. Online learning of neural computations from sparse temporal feedback. In: Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. Vol 20. Neural Information Processing Systems Foundation; 2021:16437-16450."},"date_created":"2022-06-19T22:01:59Z","date_updated":"2022-06-20T07:12:58Z","volume":20,"author":[{"full_name":"Braun, Lukas","first_name":"Lukas","last_name":"Braun"},{"full_name":"Vogels, Tim P","orcid":"0000-0003-3295-6181","id":"CB6FF8D2-008F-11EA-8E08-2637E6697425","last_name":"Vogels","first_name":"Tim P"}],"publication_status":"published","department":[{"_id":"TiVo"}],"publisher":"Neural Information Processing Systems Foundation","year":"2021","acknowledgement":"We would like to thank Professor Dr. Henning Sprekeler for his valuable suggestions and Dr. Andrew Saxe, Milan Klöwer and Anna Wallis for their constructive feedback on the manuscript. Lukas Braun was supported by the Network of European Neuroscience Schools through their NENS Exchange Grant program, by the European Union through their European Community Action Scheme for the Mobility of University Students, the Woodward Scholarship awarded by Wadham College, Oxford and the Medical Research Council [MR/N013468/1]. Tim P. Vogels was supported by a Wellcome Trust Senior Research Fellowship [214316/Z/18/Z].","month":"12","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"language":[{"iso":"eng"}],"conference":{"location":"Virtual, Online","start_date":"2021-12-06","end_date":"2021-12-14","name":"NeurIPS: Neural Information Processing Systems"},"quality_controlled":"1","project":[{"name":"What’s in a memory? Spatiotemporal dynamics in strongly coupled recurrent neuronal networks.","grant_number":"214316/Z/18/Z","_id":"c084a126-5a5b-11eb-8a69-d75314a70a87"}],"main_file_link":[{"url":"https://proceedings.neurips.cc/paper/2021/file/88e1ce84f9feef5a08d0df0334c53468-Paper.pdf","open_access":"1"}],"oa":1},{"ec_funded":1,"year":"2021","acknowledgement":"We would like to thank the anonymous reviewers for helpful comments and suggestions. We also thank Aurelien Lucchi and Antonio Orvieto for fruitful discussions at an early stage of this work. FA is partially supported by the SNSF under research project No. 192363 and conducted part of this work while at IST Austria under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 805223 ScaleML). PD partly conducted this work while at IST Austria and was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","publication_status":"published","publisher":"Neural Information Processing Systems Foundation","department":[{"_id":"DaAl"}],"author":[{"first_name":"Foivos","last_name":"Alimisis","full_name":"Alimisis, Foivos"},{"full_name":"Davies, Peter","first_name":"Peter","last_name":"Davies","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524"},{"full_name":"Vandereycken, Bart","first_name":"Bart","last_name":"Vandereycken"},{"full_name":"Alistarh, Dan-Adrian","first_name":"Dan-Adrian","last_name":"Alistarh","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X"}],"date_created":"2022-06-19T22:01:58Z","date_updated":"2022-06-20T08:31:52Z","volume":4,"month":"12","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/1680e9fa7b4dd5d62ece800239bb53bd-Paper.pdf"}],"external_id":{"arxiv":["2110.14391"]},"quality_controlled":"1","project":[{"_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"},{"name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual, Online","end_date":"2021-12-14"},"language":[{"iso":"eng"}],"type":"conference","abstract":[{"lang":"eng","text":"We study efficient distributed algorithms for the fundamental problem of principal component analysis and leading eigenvector computation on the sphere, when the data are randomly distributed among a set of computational nodes. We propose a new quantized variant of Riemannian gradient descent to solve this problem, and prove that the algorithm converges with high probability under a set of necessary spherical-convexity properties. We give bounds on the number of bits transmitted by the algorithm under common initialization schemes, and investigate the dependency on the problem dimension in each case."}],"_id":"11452","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Distributed principal component analysis with limited communication","intvolume":" 4","oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","publication":"Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems","citation":{"apa":"Alimisis, F., Davies, P., Vandereycken, B., & Alistarh, D.-A. (2021). Distributed principal component analysis with limited communication. In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems (Vol. 4, pp. 2823–2834). Virtual, Online: Neural Information Processing Systems Foundation.","ieee":"F. Alimisis, P. Davies, B. Vandereycken, and D.-A. Alistarh, “Distributed principal component analysis with limited communication,” in Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 4, pp. 2823–2834.","ista":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. 2021. Distributed principal component analysis with limited communication. Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 4, 2823–2834.","ama":"Alimisis F, Davies P, Vandereycken B, Alistarh D-A. Distributed principal component analysis with limited communication. In: Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems. Vol 4. Neural Information Processing Systems Foundation; 2021:2823-2834.","chicago":"Alimisis, Foivos, Peter Davies, Bart Vandereycken, and Dan-Adrian Alistarh. “Distributed Principal Component Analysis with Limited Communication.” In Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, 4:2823–34. Neural Information Processing Systems Foundation, 2021.","short":"F. Alimisis, P. Davies, B. Vandereycken, D.-A. Alistarh, in:, Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2021, pp. 2823–2834.","mla":"Alimisis, Foivos, et al. “Distributed Principal Component Analysis with Limited Communication.” Advances in Neural Information Processing Systems - 35th Conference on Neural Information Processing Systems, vol. 4, Neural Information Processing Systems Foundation, 2021, pp. 2823–34."},"page":"2823-2834","date_published":"2021-12-01T00:00:00Z"},{"article_processing_charge":"No","day":"06","scopus_import":"1","date_published":"2021-12-06T00:00:00Z","citation":{"chicago":"Frantar, Elias, Eldar Kurtic, and Dan-Adrian Alistarh. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” In 35th Conference on Neural Information Processing Systems, 34:14873–86. Curran Associates, 2021.","short":"E. Frantar, E. Kurtic, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 14873–14886.","mla":"Frantar, Elias, et al. “M-FAC: Efficient Matrix-Free Approximations of Second-Order Information.” 35th Conference on Neural Information Processing Systems, vol. 34, Curran Associates, 2021, pp. 14873–86.","apa":"Frantar, E., Kurtic, E., & Alistarh, D.-A. (2021). M-FAC: Efficient matrix-free approximations of second-order information. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 14873–14886). Virtual, Online: Curran Associates.","ieee":"E. Frantar, E. Kurtic, and D.-A. Alistarh, “M-FAC: Efficient matrix-free approximations of second-order information,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 14873–14886.","ista":"Frantar E, Kurtic E, Alistarh D-A. 2021. M-FAC: Efficient matrix-free approximations of second-order information. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 14873–14886.","ama":"Frantar E, Kurtic E, Alistarh D-A. M-FAC: Efficient matrix-free approximations of second-order information. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:14873-14886."},"publication":"35th Conference on Neural Information Processing Systems","page":"14873-14886","abstract":[{"lang":"eng","text":"Efficiently approximating local curvature information of the loss function is a key tool for optimization and compression of deep neural networks. Yet, most existing methods to approximate second-order information have high computational\r\nor storage costs, which limits their practicality. In this work, we investigate matrix-free, linear-time approaches for estimating Inverse-Hessian Vector Products (IHVPs) for the case when the Hessian can be approximated as a sum of rank-one matrices, as in the classic approximation of the Hessian by the empirical Fisher matrix. We propose two new algorithms: the first is tailored towards network compression and can compute the IHVP for dimension d, if the Hessian is given as a sum of m rank-one matrices, using O(dm2) precomputation, O(dm) cost for computing the IHVP, and query cost O(m) for any single element of the inverse Hessian. The second algorithm targets an optimization setting, where we wish to compute the product between the inverse Hessian, estimated over a sliding window of optimization steps, and a given gradient direction, as required for preconditioned SGD. We give an algorithm with cost O(dm + m2) for computing the IHVP and O(dm + m3) for adding or removing any gradient from the sliding window. These\r\ntwo algorithms yield state-of-the-art results for network pruning and optimization with lower computational overhead relative to existing second-order methods. Implementations are available at [9] and [17]."}],"type":"conference","oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11463","intvolume":" 34","status":"public","title":"M-FAC: Efficient matrix-free approximations of second-order information","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"month":"12","conference":{"name":"NeurIPS: Neural Information Processing Systems","start_date":"2021-12-06","location":"Virtual, Online","end_date":"2021-12-14"},"language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/7cfd5df443b4eb0d69886a583b33de4c-Paper.pdf"}],"external_id":{"arxiv":["2010.08222"]},"oa":1,"project":[{"grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020"}],"quality_controlled":"1","ec_funded":1,"author":[{"last_name":"Frantar","first_name":"Elias","id":"09a8f98d-ec99-11ea-ae11-c063a7b7fe5f","full_name":"Frantar, Elias"},{"full_name":"Kurtic, Eldar","first_name":"Eldar","last_name":"Kurtic","id":"47beb3a5-07b5-11eb-9b87-b108ec578218"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"volume":34,"date_updated":"2022-06-27T07:05:12Z","date_created":"2022-06-26T22:01:35Z","acknowledgement":"We gratefully acknowledge funding the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), as well as computational support from Amazon Web Services (AWS) EC2.","year":"2021","department":[{"_id":"DaAl"}],"publisher":"Curran Associates","publication_status":"published"},{"_id":"11464","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Towards tight communication lower bounds for distributed optimisation","intvolume":" 34","oa_version":"Published Version","type":"conference","abstract":[{"text":"We consider a standard distributed optimisation setting where N machines, each holding a d-dimensional function\r\nfi, aim to jointly minimise the sum of the functions ∑Ni=1fi(x). This problem arises naturally in large-scale distributed optimisation, where a standard solution is to apply variants of (stochastic) gradient descent. We focus on the communication complexity of this problem: our main result provides the first fully unconditional bounds on total number of bits which need to be sent and received by the N machines to solve this problem under point-to-point communication, within a given error-tolerance. Specifically, we show that Ω(Ndlogd/Nε) total bits need to be communicated between the machines to find an additive ϵ-approximation to the minimum of ∑Ni=1fi(x). The result holds for both deterministic and randomised algorithms, and, importantly, requires no assumptions on the algorithm structure. The lower bound is tight under certain restrictions on parameter values, and is matched within constant factors for quadratic objectives by a new variant of quantised gradient descent, which we describe and analyse. Our results bring over tools from communication complexity to distributed optimisation, which has potential for further applications.","lang":"eng"}],"publication":"35th Conference on Neural Information Processing Systems","citation":{"mla":"Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” 35th Conference on Neural Information Processing Systems, vol. 34, Curran Associates, 2021, pp. 7254–66.","short":"D.-A. Alistarh, J. Korhonen, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 7254–7266.","chicago":"Alistarh, Dan-Adrian, and Janne Korhonen. “Towards Tight Communication Lower Bounds for Distributed Optimisation.” In 35th Conference on Neural Information Processing Systems, 34:7254–66. Curran Associates, 2021.","ama":"Alistarh D-A, Korhonen J. Towards tight communication lower bounds for distributed optimisation. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:7254-7266.","ista":"Alistarh D-A, Korhonen J. 2021. Towards tight communication lower bounds for distributed optimisation. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 7254–7266.","ieee":"D.-A. Alistarh and J. Korhonen, “Towards tight communication lower bounds for distributed optimisation,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 7254–7266.","apa":"Alistarh, D.-A., & Korhonen, J. (2021). Towards tight communication lower bounds for distributed optimisation. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 7254–7266). Virtual, Online: Curran Associates."},"page":"7254-7266","date_published":"2021-12-06T00:00:00Z","scopus_import":"1","day":"06","article_processing_charge":"No","acknowledgement":"We thank the NeurIPS reviewers for insightful comments that helped us improve the positioning of our results, as well as for pointing out the subsampling approach for complementing the randomised lower bound. We also thank Foivos Alimisis and Peter Davies for useful discussions. This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML).","year":"2021","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Curran Associates","author":[{"full_name":"Alistarh, Dan-Adrian","orcid":"0000-0003-3650-940X","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","last_name":"Alistarh","first_name":"Dan-Adrian"},{"last_name":"Korhonen","first_name":"Janne","id":"C5402D42-15BC-11E9-A202-CA2BE6697425","full_name":"Korhonen, Janne"}],"date_updated":"2022-06-27T06:54:31Z","date_created":"2022-06-26T22:01:35Z","volume":34,"ec_funded":1,"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/3b92d18aa7a6176dd37d372bc2f1eb71-Paper.pdf"}],"oa":1,"external_id":{"arxiv":["2010.08222"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","grant_number":"805223","_id":"268A44D6-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"NeurIPS: Neural Information Processing Systems","location":"Virtual, Online","start_date":"2021-12-06","end_date":"2021-12-14"},"language":[{"iso":"eng"}],"month":"12","publication_identifier":{"issn":["1049-5258"],"isbn":["9781713845393"]}},{"publication_status":"published","publisher":"EDP Sciences","acknowledgement":"We would like to thank Charlotte Mason for useful discussions and for providing the data for the curves shown in Fig. 13 and Dawn Erb for providing the observational data for the comparison sample studied by Steidel et al. (2014), also shown in Fig. 13. This work has been supported by the BMBF grant 05A14BAC and we acknowledge support by the Competitive Fund of the Leibniz Association through grant SAW-2015-AIP-2. AF acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001. JS acknowledges the support from Vici grant 639.043.409 from the Dutch Research Council (NWO). GM received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Sklodowska-Curie grant agreement No MARACAS – DLV-896778. This paper is based on observations collected at the European Organisation for Astronomical Research in the Southern Hemisphere under ESO programmes 094.A-0289(B), 095.A-0010(A), 096.A-0045(A), 096.A-0045(B), 094.A-0205, 095.A-0240, 096.A-0090, 097.A-0160, and 098.A-0017. This paper also makes use of observations made with the NASA/ESA Hubble Space Telescope obtained at STScI. This research made use of the following programs and open-source packages for Python and we are thankful to their developers: DS9 (Joye & Mandel 2003), Astropy (Astropy Collaboration 2013, 2018), APLpy (Robitaille & Bressert 2012), iPython (Pérez & Granger 2007), numpy (van der Walt et al. 2011), matplotlib (Hunter 2007), and SciPy (Jones et al. 2001).","year":"2021","date_created":"2022-07-06T08:49:03Z","date_updated":"2022-07-19T09:34:36Z","volume":654,"author":[{"last_name":"Schmidt","first_name":"K. B.","full_name":"Schmidt, K. B."},{"full_name":"Kerutt, J.","last_name":"Kerutt","first_name":"J."},{"full_name":"Wisotzki, L.","first_name":"L.","last_name":"Wisotzki"},{"full_name":"Urrutia, T.","first_name":"T.","last_name":"Urrutia"},{"full_name":"Feltre, A.","last_name":"Feltre","first_name":"A."},{"full_name":"Maseda, M. V.","last_name":"Maseda","first_name":"M. V."},{"first_name":"T.","last_name":"Nanayakkara","full_name":"Nanayakkara, T."},{"last_name":"Bacon","first_name":"R.","full_name":"Bacon, R."},{"full_name":"Boogaard, L. A.","last_name":"Boogaard","first_name":"L. A."},{"full_name":"Conseil, S.","first_name":"S.","last_name":"Conseil"},{"last_name":"Contini","first_name":"T.","full_name":"Contini, T."},{"full_name":"Herenz, E. C.","last_name":"Herenz","first_name":"E. C."},{"last_name":"Kollatschny","first_name":"W.","full_name":"Kollatschny, W."},{"first_name":"M.","last_name":"Krumpe","full_name":"Krumpe, M."},{"full_name":"Leclercq, F.","first_name":"F.","last_name":"Leclercq"},{"last_name":"Mahler","first_name":"G.","full_name":"Mahler, G."},{"full_name":"Matthee, Jorryt J","last_name":"Matthee","first_name":"Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720"},{"full_name":"Mauerhofer, V.","first_name":"V.","last_name":"Mauerhofer"},{"last_name":"Richard","first_name":"J.","full_name":"Richard, J."},{"full_name":"Schaye, J.","last_name":"Schaye","first_name":"J."}],"article_number":"A80","extern":"1","quality_controlled":"1","external_id":{"arxiv":["2108.01713"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2108.01713"}],"language":[{"iso":"eng"}],"doi":"10.1051/0004-6361/202140876","month":"10","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"title":"Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4","status":"public","intvolume":" 654","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11498","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Rest-frame ultraviolet (UV) emission lines probe electron densities, gas-phase abundances, metallicities, and ionization parameters of the emitting star-forming galaxies and their environments. The strongest main UV emission line, Lyα, has been instrumental in advancing the general knowledge of galaxy formation in the early universe. However, observing Lyα emission becomes increasingly challenging at z ≳ 6 when the neutral hydrogen fraction of the circumgalactic and intergalactic media increases. Secondary weaker UV emission lines provide important alternative methods for studying galaxy properties at high redshift. We present a large sample of rest-frame UV emission line sources at intermediate redshift for calibrating and exploring the connection between secondary UV lines and the emitting galaxies’ physical properties and their Lyα emission. The sample of 2052 emission line sources with 1.5 < z < 6.4 was collected from integral field data from the MUSE-Wide and MUSE-Deep surveys taken as part of Guaranteed Time Observations. The objects were selected through untargeted source detection (i.e., no preselection of sources as in dedicated spectroscopic campaigns) in the three-dimensional MUSE data cubes. We searched optimally extracted one-dimensional spectra of the full sample for UV emission features via emission line template matching, resulting in a sample of more than 100 rest-frame UV emission line detections. We show that the detection efficiency of (non-Lyα) UV emission lines increases with survey depth, and that the emission line strength of He IIλ1640 Å, [O III] λ1661 + O III] λ1666, and [Si III] λ1883 + Si III] λ1892 correlate with the strength of [C III] λ1907 + C III] λ1909. The rest-frame equivalent width (EW0) of [C III] λ1907 + C III] λ1909 is found to be roughly 0.22 ± 0.18 of EW0(Lyα). We measured the velocity offsets of resonant emission lines with respect to systemic tracers. For C IVλ1548 + C IVλ1551 we find that ΔvC IV ≲ 250 km s−1, whereas ΔvLyα falls in the range of 250−500 km s−1 which is in agreement with previous results from the literature. The electron density ne measured from [Si III] λ1883 + Si III] λ1892 and [C III] λ1907 + C III] λ1909 line flux ratios is generally < 105 cm−3 and the gas-phase abundance is below solar at 12 + log10(O/H)≈8. Lastly, we used “PhotoIonization Model Probability Density Functions” to infer physical parameters of the full sample and individual systems based on photoionization model parameter grids and observational constraints from our UV emission line searches. This reveals that the UV line emitters generally have ionization parameter log10(U) ≈ −2.5 and metal mass fractions that scatter around Z ≈ 10−2, that is Z ≈ 0.66 Z⊙. Value-added catalogs of the full sample of MUSE objects studied in this work and a collection of UV line emitters from the literature are provided with this paper.","lang":"eng"}],"article_type":"original","publication":"Astronomy & Astrophysics","citation":{"mla":"Schmidt, K. B., et al. “Recovery and Analysis of Rest-Frame UV Emission Lines in 2052 Galaxies Observed with MUSE at 1.5 < z < 6.4.” Astronomy & Astrophysics, vol. 654, A80, EDP Sciences, 2021, doi:10.1051/0004-6361/202140876.","short":"K.B. Schmidt, J. Kerutt, L. Wisotzki, T. Urrutia, A. Feltre, M.V. Maseda, T. Nanayakkara, R. Bacon, L.A. Boogaard, S. Conseil, T. Contini, E.C. Herenz, W. Kollatschny, M. Krumpe, F. Leclercq, G. Mahler, J.J. Matthee, V. Mauerhofer, J. Richard, J. Schaye, Astronomy & Astrophysics 654 (2021).","chicago":"Schmidt, K. B., J. Kerutt, L. Wisotzki, T. Urrutia, A. Feltre, M. V. Maseda, T. Nanayakkara, et al. “Recovery and Analysis of Rest-Frame UV Emission Lines in 2052 Galaxies Observed with MUSE at 1.5 < z < 6.4.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202140876.","ama":"Schmidt KB, Kerutt J, Wisotzki L, et al. Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4. Astronomy & Astrophysics. 2021;654. doi:10.1051/0004-6361/202140876","ista":"Schmidt KB, Kerutt J, Wisotzki L, Urrutia T, Feltre A, Maseda MV, Nanayakkara T, Bacon R, Boogaard LA, Conseil S, Contini T, Herenz EC, Kollatschny W, Krumpe M, Leclercq F, Mahler G, Matthee JJ, Mauerhofer V, Richard J, Schaye J. 2021. Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4. Astronomy & Astrophysics. 654, A80.","ieee":"K. B. Schmidt et al., “Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4,” Astronomy & Astrophysics, vol. 654. EDP Sciences, 2021.","apa":"Schmidt, K. B., Kerutt, J., Wisotzki, L., Urrutia, T., Feltre, A., Maseda, M. V., … Schaye, J. (2021). Recovery and analysis of rest-frame UV emission lines in 2052 galaxies observed with MUSE at 1.5 < z < 6.4. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202140876"},"date_published":"2021-10-15T00:00:00Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","ultraviolet: galaxies / galaxies: high-redshift / galaxies: ISM / ISM: lines and bands / methods: observational / techniques: imaging spectroscopy"],"scopus_import":"1","day":"15","article_processing_charge":"No"},{"publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"month":"03","external_id":{"arxiv":["2102.05516"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.05516"}],"quality_controlled":"1","doi":"10.1051/0004-6361/202039887","language":[{"iso":"eng"}],"article_number":"A107","extern":"1","acknowledgement":"We warmly thank ESO Paranal staff for their great professional support during all MXDF GTO observing runs. We thank the anonymous referee for a careful reading of the manuscript and helpful comments. We also thank Matthew Lehnert for fruitful discussions. RB, AF, SC acknowledge support from the ERC advanced grant 339659-MUSICOS. JB acknowledges support by Fundação para a Ciência e a Tecnologia (FCT) through the research grants UID/FIS/04434/2019, UIDB/04434/2020, UIDP/04434/2020 and through the Investigador FCT Contract No. IF/01654/2014/CP1215/CT0003. TG, AV acknowledges support from the European Research Council under grant agreement ERC-stg-757258 (TRIPLE). DM acknowledges A. Dabbech for useful interactions about IUWT and support from the GDR ISIS through the Projets exploratoires program (project TASTY). AF acknowledges the support from grant PRIN MIUR2017-20173ML3WW_001. SLZ acknowledges support by The Netherlands Organisation for Scientific Research (NWO) through a TOP Grant Module 1 under project number 614.001.652. This research made use of the following open-source software and we are thankful to the developers of these: GNU Octave (Eaton et al. 2018) and its statistics, signal and image packages, the Python packages Matplotlib (Hunter 2007), Numpy (van der Walt et al. 2010), MPDAF (Piqueras et al. 2017), Astropy (Astropy Collaboration 2018), PyWavelets (Lee et al. 2019).","year":"2021","publisher":"EDP Sciences","publication_status":"published","author":[{"last_name":"Bacon","first_name":"R.","full_name":"Bacon, R."},{"first_name":"D.","last_name":"Mary","full_name":"Mary, D."},{"last_name":"Garel","first_name":"T.","full_name":"Garel, T."},{"first_name":"J.","last_name":"Blaizot","full_name":"Blaizot, J."},{"first_name":"M.","last_name":"Maseda","full_name":"Maseda, M."},{"first_name":"J.","last_name":"Schaye","full_name":"Schaye, J."},{"last_name":"Wisotzki","first_name":"L.","full_name":"Wisotzki, L."},{"first_name":"S.","last_name":"Conseil","full_name":"Conseil, S."},{"full_name":"Brinchmann, J.","last_name":"Brinchmann","first_name":"J."},{"full_name":"Leclercq, F.","first_name":"F.","last_name":"Leclercq"},{"first_name":"V.","last_name":"Abril-Melgarejo","full_name":"Abril-Melgarejo, V."},{"last_name":"Boogaard","first_name":"L.","full_name":"Boogaard, L."},{"first_name":"N. F.","last_name":"Bouché","full_name":"Bouché, N. F."},{"full_name":"Contini, T.","last_name":"Contini","first_name":"T."},{"full_name":"Feltre, A.","first_name":"A.","last_name":"Feltre"},{"last_name":"Guiderdoni","first_name":"B.","full_name":"Guiderdoni, B."},{"first_name":"C.","last_name":"Herenz","full_name":"Herenz, C."},{"full_name":"Kollatschny, W.","last_name":"Kollatschny","first_name":"W."},{"last_name":"Kusakabe","first_name":"H.","full_name":"Kusakabe, H."},{"full_name":"Matthee, Jorryt J","orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J"},{"full_name":"Michel-Dansac, L.","first_name":"L.","last_name":"Michel-Dansac"},{"full_name":"Nanayakkara, T.","first_name":"T.","last_name":"Nanayakkara"},{"first_name":"J.","last_name":"Richard","full_name":"Richard, J."},{"last_name":"Roth","first_name":"M.","full_name":"Roth, M."},{"last_name":"Schmidt","first_name":"K. B.","full_name":"Schmidt, K. B."},{"full_name":"Steinmetz, M.","last_name":"Steinmetz","first_name":"M."},{"full_name":"Tresse, L.","last_name":"Tresse","first_name":"L."},{"full_name":"Urrutia, T.","last_name":"Urrutia","first_name":"T."},{"full_name":"Verhamme, A.","first_name":"A.","last_name":"Verhamme"},{"first_name":"P. M.","last_name":"Weilbacher","full_name":"Weilbacher, P. M."},{"last_name":"Zabl","first_name":"J.","full_name":"Zabl, J."},{"first_name":"S. L.","last_name":"Zoutendijk","full_name":"Zoutendijk, S. L."}],"volume":647,"date_created":"2022-07-06T09:31:50Z","date_updated":"2022-07-19T09:34:57Z","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: high-redshift / galaxies: groups: general / cosmology: observations"],"article_processing_charge":"No","day":"18","citation":{"mla":"Bacon, R., et al. “The MUSE Extremely Deep Field: The Cosmic Web in Emission at High Redshift.” Astronomy & Astrophysics, vol. 647, A107, EDP Sciences, 2021, doi:10.1051/0004-6361/202039887.","short":"R. Bacon, D. Mary, T. Garel, J. Blaizot, M. Maseda, J. Schaye, L. Wisotzki, S. Conseil, J. Brinchmann, F. Leclercq, V. Abril-Melgarejo, L. Boogaard, N.F. Bouché, T. Contini, A. Feltre, B. Guiderdoni, C. Herenz, W. Kollatschny, H. Kusakabe, J.J. Matthee, L. Michel-Dansac, T. Nanayakkara, J. Richard, M. Roth, K.B. Schmidt, M. Steinmetz, L. Tresse, T. Urrutia, A. Verhamme, P.M. Weilbacher, J. Zabl, S.L. Zoutendijk, Astronomy & Astrophysics 647 (2021).","chicago":"Bacon, R., D. Mary, T. Garel, J. Blaizot, M. Maseda, J. Schaye, L. Wisotzki, et al. “The MUSE Extremely Deep Field: The Cosmic Web in Emission at High Redshift.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039887.","ama":"Bacon R, Mary D, Garel T, et al. The MUSE Extremely Deep Field: The cosmic web in emission at high redshift. Astronomy & Astrophysics. 2021;647. doi:10.1051/0004-6361/202039887","ista":"Bacon R, Mary D, Garel T, Blaizot J, Maseda M, Schaye J, Wisotzki L, Conseil S, Brinchmann J, Leclercq F, Abril-Melgarejo V, Boogaard L, Bouché NF, Contini T, Feltre A, Guiderdoni B, Herenz C, Kollatschny W, Kusakabe H, Matthee JJ, Michel-Dansac L, Nanayakkara T, Richard J, Roth M, Schmidt KB, Steinmetz M, Tresse L, Urrutia T, Verhamme A, Weilbacher PM, Zabl J, Zoutendijk SL. 2021. The MUSE Extremely Deep Field: The cosmic web in emission at high redshift. Astronomy & Astrophysics. 647, A107.","apa":"Bacon, R., Mary, D., Garel, T., Blaizot, J., Maseda, M., Schaye, J., … Zoutendijk, S. L. (2021). The MUSE Extremely Deep Field: The cosmic web in emission at high redshift. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039887","ieee":"R. Bacon et al., “The MUSE Extremely Deep Field: The cosmic web in emission at high redshift,” Astronomy & Astrophysics, vol. 647. EDP Sciences, 2021."},"publication":"Astronomy & Astrophysics","article_type":"original","date_published":"2021-03-18T00:00:00Z","type":"journal_article","abstract":[{"text":"We report the discovery of diffuse extended Lyα emission from redshift 3.1 to 4.5, tracing cosmic web filaments on scales of 2.5−4 cMpc. These structures have been observed in overdensities of Lyα emitters in the MUSE Extremely Deep Field, a 140 h deep MUSE observation located in the Hubble Ultra-Deep Field. Among the 22 overdense regions identified, five are likely to harbor very extended Lyα emission at high significance with an average surface brightness of 5 × 10−20 erg s−1 cm−2 arcsec−2. Remarkably, 70% of the total Lyα luminosity from these filaments comes from beyond the circumgalactic medium of any identified Lyα emitter. Fluorescent Lyα emission powered by the cosmic UV background can only account for less than 34% of this emission at z ≈ 3 and for not more than 10% at higher redshift. We find that the bulk of this diffuse emission can be reproduced by the unresolved Lyα emission of a large population of ultra low-luminosity Lyα emitters (< 1040 erg s−1), provided that the faint end of the Lyα luminosity function is steep (α ⪅ −1.8), it extends down to luminosities lower than 1038 − 1037 erg s−1, and the clustering of these Lyα emitters is significant (filling factor < 1/6). If these Lyα emitters are powered by star formation, then this implies their luminosity function needs to extend down to star formation rates < 10−4 M⊙ yr−1. These observations provide the first detection of the cosmic web in Lyα emission in typical filamentary environments and the first observational clue indicating the existence of a large population of ultra low-luminosity Lyα emitters at high redshift.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11500","intvolume":" 647","title":"The MUSE Extremely Deep Field: The cosmic web in emission at high redshift","status":"public","oa_version":"Published Version"},{"author":[{"last_name":"Boogaard","first_name":"Leindert A.","full_name":"Boogaard, Leindert A."},{"last_name":"Bouwens","first_name":"Rychard J.","full_name":"Bouwens, Rychard J."},{"last_name":"Riechers","first_name":"Dominik","full_name":"Riechers, Dominik"},{"first_name":"Paul","last_name":"van der Werf","full_name":"van der Werf, Paul"},{"last_name":"Bacon","first_name":"Roland","full_name":"Bacon, Roland"},{"first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"last_name":"Stefanon","first_name":"Mauro","full_name":"Stefanon, Mauro"},{"full_name":"Feltre, Anna","first_name":"Anna","last_name":"Feltre"},{"full_name":"Maseda, Michael","last_name":"Maseda","first_name":"Michael"},{"first_name":"Hanae","last_name":"Inami","full_name":"Inami, Hanae"},{"first_name":"Manuel","last_name":"Aravena","full_name":"Aravena, Manuel"},{"full_name":"Brinchmann, Jarle","first_name":"Jarle","last_name":"Brinchmann"},{"full_name":"Carilli, Chris","first_name":"Chris","last_name":"Carilli"},{"full_name":"Contini, Thierry","last_name":"Contini","first_name":"Thierry"},{"first_name":"Roberto","last_name":"Decarli","full_name":"Decarli, Roberto"},{"first_name":"Jorge","last_name":"González-López","full_name":"González-López, Jorge"},{"last_name":"Nanayakkara","first_name":"Themiya","full_name":"Nanayakkara, Themiya"},{"last_name":"Walter","first_name":"Fabian","full_name":"Walter, Fabian"}],"volume":916,"date_created":"2022-07-06T13:05:50Z","date_updated":"2022-07-19T09:32:48Z","acknowledgement":"We would like to thank the referee for a constructive and helpful report. L.A.B. is grateful to Corentin Schreiber for assisting with the near-infrared spectroscopy during the early stages of this work. L.A.B. acknowledges support from the Leids Kerkhoven-Bosscha Fonds under subsidy numbers 18.2.074 and 19.1.147. D.R. acknowledges support from the National Science Foundation under grant numbers AST-1614213 and AST-1910107. D.R. also acknowledges support from the Alexander von Humboldt Foundation through a Humboldt Research Fellowship for Experienced Researchers. A.F. acknowledges the support from grant PRIN MIUR 201720173ML3WW_001. J.B. acknowledges support by Fundação para a Ciência e a Tecnologia (FCT) through the research grants UID/FIS/04434/2019, UIDB/04434/2020, UIDP/04434/2020. H.I. acknowledges support from JSPS KAKENHI grant No. JP19K23462. This work is based on observations collected at the European Southern Observatory under ESO programs 094.A-2089(B), 095.A-0010(A), 096.A-0045(A), 096.A-0045(B), 099.A-0858(A), and 0101.A-0725(A). This paper makes use of the following ALMA data: ADS/JAO.ALMA#2016.1.00324.L. ALMA is a partnership of ESO (representing its member states), NSF (USA), and NINS (Japan), together with NRC (Canada), NSC and ASIAA (Taiwan), and KASI (Republic of Korea), in cooperation with the Republic of Chile. The Joint ALMA Observatory is operated by ESO, AUI/NRAO, and NAOJ. The National Radio Astronomy Observatory is a facility of the National Science Foundation operated under cooperative agreement by Associated Universities, Inc. This work was supported by a NASA Keck PI Data Award, administered by the NASA Exoplanet Science Institute. Data presented herein were obtained at the W. M. Keck Observatory from telescope time allocated to the National Aeronautics and Space Administration through the agency's scientific partnership with the California Institute of Technology and the University of California. The Observatory was made possible by the generous financial support of the W. M. Keck Foundation. The authors wish to recognize and acknowledge the very significant cultural role and reverence that the summit of Maunakea has always had within the indigenous Hawaiian community. We are most fortunate to have the opportunity to conduct observations from this mountain.","year":"2021","publisher":"IOP Publishing","publication_status":"published","extern":"1","article_number":"12","doi":"10.3847/1538-4357/ac01d7","language":[{"iso":"eng"}],"external_id":{"arxiv":["2105.12489"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2105.12489"}],"oa":1,"quality_controlled":"1","publication_identifier":{"issn":["0004-637X"],"eissn":["1538-4357"]},"month":"07","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11512","intvolume":" 916","title":"Measuring the average molecular gas content of star-forming galaxies at z = 3–4","status":"public","issue":"1","abstract":[{"lang":"eng","text":"We study the molecular gas content of 24 star-forming galaxies at z = 3–4, with a median stellar mass of 109.1 M⊙, from the MUSE Hubble Ultra Deep Field (HUDF) Survey. Selected by their Lyα λ1216 emission and HF160W-band magnitude, the galaxies show an average $\\langle {\\mathrm{EW}}_{\\mathrm{Ly}\\alpha }^{0}\\rangle \\approx 20$ Å, below the typical selection threshold for Lyα emitters (${\\mathrm{EW}}_{\\mathrm{Ly}\\alpha }^{0}\\gt 25$ Å), and a rest-frame UV spectrum similar to Lyman-break galaxies. We use rest-frame optical spectroscopy from KMOS and MOSFIRE, and the UV features observed with MUSE, to determine the systemic redshifts, which are offset from Lyα by 〈Δv(Lyα)〉 = 346 km s−1, with a 100 to 600 km s−1 range. Stacking 12CO J = 4 → 3 and [C i]3P1 → 3P0 (and higher-J CO lines) from the ALMA Spectroscopic Survey of the HUDF, we determine 3σ upper limits on the line luminosities of 4.0 × 108 K km s−1pc2 and 5.6 × 108 K km s−1pc2, respectively (for a 300 km s−1 line width). Stacking the 1.2 mm and 3 mm dust-continuum flux densities, we find a 3σ upper limits of 9 μJy and 1.2 μJy, respectively. The inferred gas fractions, under the assumption of a \"Galactic\" CO-to-H2 conversion factor and gas-to-dust ratio, are in tension with previously determined scaling relations. This implies a substantially higher αCO ≥ 10 and δGDR ≥ 1200, consistent with the subsolar metallicity estimated for these galaxies ($12+\\mathrm{log}({\\rm{O}}/{\\rm{H}})\\approx 7.8\\pm 0.2$). The low metallicity of z ≥ 3 star-forming galaxies may thus make it very challenging to unveil their cold gas through CO or dust emission, warranting further exploration of alternative tracers, such as [C ii]."}],"type":"journal_article","date_published":"2021-07-20T00:00:00Z","citation":{"chicago":"Boogaard, Leindert A., Rychard J. Bouwens, Dominik Riechers, Paul van der Werf, Roland Bacon, Jorryt J Matthee, Mauro Stefanon, et al. “Measuring the Average Molecular Gas Content of Star-Forming Galaxies at z = 3–4.” The Astrophysical Journal. IOP Publishing, 2021. https://doi.org/10.3847/1538-4357/ac01d7.","short":"L.A. Boogaard, R.J. Bouwens, D. Riechers, P. van der Werf, R. Bacon, J.J. Matthee, M. Stefanon, A. Feltre, M. Maseda, H. Inami, M. Aravena, J. Brinchmann, C. Carilli, T. Contini, R. Decarli, J. González-López, T. Nanayakkara, F. Walter, The Astrophysical Journal 916 (2021).","mla":"Boogaard, Leindert A., et al. “Measuring the Average Molecular Gas Content of Star-Forming Galaxies at z = 3–4.” The Astrophysical Journal, vol. 916, no. 1, 12, IOP Publishing, 2021, doi:10.3847/1538-4357/ac01d7.","ieee":"L. A. Boogaard et al., “Measuring the average molecular gas content of star-forming galaxies at z = 3–4,” The Astrophysical Journal, vol. 916, no. 1. IOP Publishing, 2021.","apa":"Boogaard, L. A., Bouwens, R. J., Riechers, D., van der Werf, P., Bacon, R., Matthee, J. J., … Walter, F. (2021). Measuring the average molecular gas content of star-forming galaxies at z = 3–4. The Astrophysical Journal. IOP Publishing. https://doi.org/10.3847/1538-4357/ac01d7","ista":"Boogaard LA, Bouwens RJ, Riechers D, van der Werf P, Bacon R, Matthee JJ, Stefanon M, Feltre A, Maseda M, Inami H, Aravena M, Brinchmann J, Carilli C, Contini T, Decarli R, González-López J, Nanayakkara T, Walter F. 2021. Measuring the average molecular gas content of star-forming galaxies at z = 3–4. The Astrophysical Journal. 916(1), 12.","ama":"Boogaard LA, Bouwens RJ, Riechers D, et al. Measuring the average molecular gas content of star-forming galaxies at z = 3–4. The Astrophysical Journal. 2021;916(1). doi:10.3847/1538-4357/ac01d7"},"publication":"The Astrophysical Journal","article_type":"original","article_processing_charge":"No","day":"20","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics"]},{"month":"07","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2102.07779","open_access":"1"}],"external_id":{"arxiv":["2102.07779"]},"quality_controlled":"1","doi":"10.1093/mnras/stab1304","language":[{"iso":"eng"}],"extern":"1","acknowledgement":"We thank the referee for constructive comments and suggestions. We thank Dawn Erb, Ruari Mackenzie, Ivan Oteo, Ryan Sanders, and Johannes Zabl for useful discussions and suggestions. It is a pleasure to thank the ESO User Support, in particular Giacomo Beccari, Carlo Manara, John Pritchard, Marina Rejkuba, and Lowell Tacconi-Garman for assistance in the preparation and execution of the observations. Based on observations obtained with the VLT, programs 084.A-0303, 088.A-0672, 091.A-0413, 091.A-0546, 092.A0774, 097.A-0153, 098.A-0819, 099.A-0758, 099.A-0254, 101.B0779, and 102.A-0652. Based on data products from observations made with ESO Telescopes at the La Silla Paranal Observatory under ESO programme ID 179.A-2005 and on data products produced by CALET and the Cambridge Astronomy Survey Unit on behalf of the UltraVISTA consortium. Based on observations made with the NASA/ESA HST through programs 9133, 9367, 11694, and 12471, and obtained from the Hubble Legacy Archive, which is a collaboration between the Space Telescope Science Institute (STScI/NASA), the Space Telescope European Coordinating Facility (ST-ECF/ESA), and the Canadian Astronomy Data Centre (CADC/NRC/CSA). This work is based on observations taken by the CANDELS Multi-Cycle Treasury Program with the NASA/ESA HST, which is operated by the Association of Universities for Research in Astronomy, Inc., under NASA contract NAS5-26555. MG was supported by NASA through the NASA Hubble Fellowship grant HST-HF2-51409 and acknowledges support from HST grants\r\nHST-GO-15643.017-A, HST-AR-15039.003-A, and XSEDE grant TG-AST180036. GP acknowledges support from the Netherlands Research School for Astronomy (NOVA). RA acknowledges the support of ANID FONDECYT Regular Grant 1202007. We gratefully acknowledge the PYTHON programming language, its NUMPY, MATPLOTLIB, SCIPY, LMFIT (Jones et al. 2001; Hunter 2007; van der Walt, Colbert & Varoquaux 2011), PANDAS (McKinney 2010), and ASTROPY (Astropy Collaboration 2013) packages, and the TOPCAT analysis tool (Taylor 2013). Dedicated to the memory of A. C. J.Matthee (1953–2020).","year":"2021","publication_status":"published","publisher":"Oxford University Press","author":[{"orcid":"0000-0003-2871-127X","id":"7439a258-f3c0-11ec-9501-9df22fe06720","last_name":"Matthee","first_name":"Jorryt J","full_name":"Matthee, Jorryt J"},{"first_name":"David","last_name":"Sobral","full_name":"Sobral, David"},{"first_name":"Matthew","last_name":"Hayes","full_name":"Hayes, Matthew"},{"full_name":"Pezzulli, Gabriele","first_name":"Gabriele","last_name":"Pezzulli"},{"last_name":"Gronke","first_name":"Max","full_name":"Gronke, Max"},{"last_name":"Schaerer","first_name":"Daniel","full_name":"Schaerer, Daniel"},{"first_name":"Rohan P","last_name":"Naidu","full_name":"Naidu, Rohan P"},{"full_name":"Röttgering, Huub","first_name":"Huub","last_name":"Röttgering"},{"first_name":"João","last_name":"Calhau","full_name":"Calhau, João"},{"full_name":"Paulino-Afonso, Ana","first_name":"Ana","last_name":"Paulino-Afonso"},{"full_name":"Santos, Sérgio","last_name":"Santos","first_name":"Sérgio"},{"full_name":"Amorín, Ricardo","first_name":"Ricardo","last_name":"Amorín"}],"date_updated":"2022-08-18T10:49:00Z","date_created":"2022-07-07T09:33:39Z","volume":505,"scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: formation","galaxies: ISM","galaxies: starburst","dark ages","reionization","first stars"],"day":"01","article_processing_charge":"No","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"short":"J.J. Matthee, D. Sobral, M. Hayes, G. Pezzulli, M. Gronke, D. Schaerer, R.P. Naidu, H. Röttgering, J. Calhau, A. Paulino-Afonso, S. Santos, R. Amorín, Monthly Notices of the Royal Astronomical Society 505 (2021) 1382–1412.","mla":"Matthee, Jorryt J., et al. “The X-SHOOTER Lyman α Survey at z = 2 (XLS-Z2) I: What Makes a Galaxy a Lyman α Emitter?” Monthly Notices of the Royal Astronomical Society, vol. 505, no. 1, Oxford University Press, 2021, pp. 1382–412, doi:10.1093/mnras/stab1304.","chicago":"Matthee, Jorryt J, David Sobral, Matthew Hayes, Gabriele Pezzulli, Max Gronke, Daniel Schaerer, Rohan P Naidu, et al. “The X-SHOOTER Lyman α Survey at z = 2 (XLS-Z2) I: What Makes a Galaxy a Lyman α Emitter?” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/stab1304.","ama":"Matthee JJ, Sobral D, Hayes M, et al. The X-SHOOTER Lyman α survey at z = 2 (XLS-z2) I: What makes a galaxy a Lyman α emitter? Monthly Notices of the Royal Astronomical Society. 2021;505(1):1382-1412. doi:10.1093/mnras/stab1304","apa":"Matthee, J. J., Sobral, D., Hayes, M., Pezzulli, G., Gronke, M., Schaerer, D., … Amorín, R. (2021). The X-SHOOTER Lyman α survey at z = 2 (XLS-z2) I: What makes a galaxy a Lyman α emitter? Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab1304","ieee":"J. J. Matthee et al., “The X-SHOOTER Lyman α survey at z = 2 (XLS-z2) I: What makes a galaxy a Lyman α emitter?,” Monthly Notices of the Royal Astronomical Society, vol. 505, no. 1. Oxford University Press, pp. 1382–1412, 2021.","ista":"Matthee JJ, Sobral D, Hayes M, Pezzulli G, Gronke M, Schaerer D, Naidu RP, Röttgering H, Calhau J, Paulino-Afonso A, Santos S, Amorín R. 2021. The X-SHOOTER Lyman α survey at z = 2 (XLS-z2) I: What makes a galaxy a Lyman α emitter? Monthly Notices of the Royal Astronomical Society. 505(1), 1382–1412."},"article_type":"original","page":"1382-1412","date_published":"2021-07-01T00:00:00Z","type":"journal_article","abstract":[{"text":"We present the first results from the X-SHOOTER Lyman α survey at z = 2 (XLS-z2). XLS-z2 is a deep spectroscopic survey of 35 Lyman α emitters (LAEs) utilizing ≈90 h of exposure time with Very Large Telescope/X-SHOOTER and covers rest-frame Ly α to H α emission with R ≈ 4000. We present the sample selection, the observations, and the data reduction. Systemic redshifts are measured from rest-frame optical lines for 33/35 sources. In the stacked spectrum, our LAEs are characterized by an interstellar medium with little dust, a low metallicity, and a high ionization state. The ionizing sources are young hot stars that power strong emission lines in the optical and high-ionization lines in the ultraviolet (UV). The LAEs exhibit clumpy UV morphologies and have outflowing kinematics with blueshifted Si II absorption, a broad [O III] component, and a red-skewed Ly α line. Typically, 30 per cent of the Ly α photons escape, of which one quarter on the blue side of the systemic velocity. A fraction of Ly α photons escape directly at the systemic suggesting clear channels enabling an ≈10 per cent escape of ionizing photons, consistent with an inference based on Mg II. A combination of a low effective H I column density, a low dust content, and young starburst determines whether a star-forming galaxy is observed as an LAE. The first is possibly related to outflows and/or a fortunate viewing angle, while we find that the latter two in LAEs are typical for their stellar mass of 109 M⊙.","lang":"eng"}],"issue":"1","_id":"11523","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"The X-SHOOTER Lyman α survey at z = 2 (XLS-z2) I: What makes a galaxy a Lyman α emitter?","intvolume":" 505","oa_version":"Preprint"},{"day":"01","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"scopus_import":"1","date_published":"2021-06-01T00:00:00Z","article_type":"original","page":"16-32","publication":"Monthly Notices of the Royal Astronomical Society","citation":{"ista":"Gallego SG, Cantalupo S, Sarpas S, Duboeuf B, Lilly S, Pezzulli G, Marino RA, Matthee JJ, Wisotzki L, Schaye J, Richard J, Kusakabe H, Mauerhofer V. 2021. Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. 504(1), 16–32.","ieee":"S. G. Gallego et al., “Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations,” Monthly Notices of the Royal Astronomical Society, vol. 504, no. 1. Oxford University Press, pp. 16–32, 2021.","apa":"Gallego, S. G., Cantalupo, S., Sarpas, S., Duboeuf, B., Lilly, S., Pezzulli, G., … Mauerhofer, V. (2021). Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab796","ama":"Gallego SG, Cantalupo S, Sarpas S, et al. Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations. Monthly Notices of the Royal Astronomical Society. 2021;504(1):16-32. doi:10.1093/mnras/stab796","chicago":"Gallego, Sofia G, Sebastiano Cantalupo, Saeed Sarpas, Bastien Duboeuf, Simon Lilly, Gabriele Pezzulli, Raffaella Anna Marino, et al. “Constraining the Cosmic UV Background at z > 3 with MUSE Lyman-α Emission Observations.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/stab796.","mla":"Gallego, Sofia G., et al. “Constraining the Cosmic UV Background at z > 3 with MUSE Lyman-α Emission Observations.” Monthly Notices of the Royal Astronomical Society, vol. 504, no. 1, Oxford University Press, 2021, pp. 16–32, doi:10.1093/mnras/stab796.","short":"S.G. Gallego, S. Cantalupo, S. Sarpas, B. Duboeuf, S. Lilly, G. Pezzulli, R.A. Marino, J.J. Matthee, L. Wisotzki, J. Schaye, J. Richard, H. Kusakabe, V. Mauerhofer, Monthly Notices of the Royal Astronomical Society 504 (2021) 16–32."},"abstract":[{"text":"The intensity of the Cosmic UV background (UVB), coming from all sources of ionizing photons such as star-forming galaxies and quasars, determines the thermal evolution and ionization state of the intergalactic medium (IGM) and is, therefore, a critical ingredient for models of cosmic structure formation. Most of the previous estimates are based on the comparison between observed and simulated Lyman-α forest. We present the results of an independent method to constrain the product of the UVB photoionization rate and the covering fraction of Lyman limit systems (LLSs) by searching for the fluorescent Lyman-α emission produced by self-shielded clouds. Because the expected surface brightness is well below current sensitivity limits for direct imaging, we developed a new method based on 3D stacking of the IGM around Lyman-α emitting galaxies (LAEs) between 2.9 < z < 6.6 using deep MUSE observations. Combining our results with covering fractions of LLSs obtained from mock cubes extracted from the EAGLE simulation, we obtain new and independent constraints on the UVB at z > 3 that are consistent with previous measurements, with a preference for relatively low UVB intensities at z = 3, and which suggest a non-monotonic decrease of ΓH I with increasing redshift between 3 < z < 5. This could suggest a possible tension between some UVB models and current observations which however require deeper and wider observations in Lyman-α emission and absorption to be confirmed. Assuming instead a value of UVB from current models, our results constrain the covering fraction of LLSs at 3 < z < 4.5 to be less than 25 per cent within 150 kpc from LAEs.","lang":"eng"}],"issue":"1","type":"journal_article","oa_version":"Preprint","status":"public","title":"Constraining the cosmic UV background at z > 3 with MUSE Lyman-α emission observations","intvolume":" 504","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11525","month":"06","publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"language":[{"iso":"eng"}],"doi":"10.1093/mnras/stab796","quality_controlled":"1","external_id":{"arxiv":["2103.09250"]},"main_file_link":[{"url":"https://arxiv.org/abs/2103.09250","open_access":"1"}],"oa":1,"extern":"1","date_updated":"2022-08-18T10:54:19Z","date_created":"2022-07-07T10:07:11Z","volume":504,"author":[{"full_name":"Gallego, Sofia G","last_name":"Gallego","first_name":"Sofia G"},{"first_name":"Sebastiano","last_name":"Cantalupo","full_name":"Cantalupo, Sebastiano"},{"last_name":"Sarpas","first_name":"Saeed","full_name":"Sarpas, Saeed"},{"last_name":"Duboeuf","first_name":"Bastien","full_name":"Duboeuf, Bastien"},{"full_name":"Lilly, Simon","last_name":"Lilly","first_name":"Simon"},{"full_name":"Pezzulli, Gabriele","first_name":"Gabriele","last_name":"Pezzulli"},{"last_name":"Marino","first_name":"Raffaella Anna","full_name":"Marino, Raffaella Anna"},{"id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee","full_name":"Matthee, Jorryt J"},{"first_name":"Lutz","last_name":"Wisotzki","full_name":"Wisotzki, Lutz"},{"last_name":"Schaye","first_name":"Joop","full_name":"Schaye, Joop"},{"full_name":"Richard, Johan","first_name":"Johan","last_name":"Richard"},{"last_name":"Kusakabe","first_name":"Haruka","full_name":"Kusakabe, Haruka"},{"full_name":"Mauerhofer, Valentin","last_name":"Mauerhofer","first_name":"Valentin"}],"publication_status":"published","publisher":"Oxford University Press","year":"2021","acknowledgement":"This research made use of Astropy, a community developed core Python package for Astronomy (Astropy Collaboration et al. 2013). topcat, a graphical tool for manipulating tabular data, was also utilized in this analysis (Taylor 2005). SG would like to thank Nastasha Wijers for the discussion on the column density distribution in EAGLE. SC gratefully acknowledges support from Swiss National Science Foundation grants PP00P2 163824 and PP00P2 190092, and from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme grant agreement No 864361. GP acknowledges support from the Swiss National Science Foundation (SNF) and from the Netherlands Research School for Astronomy (NOVA)."},{"publication_identifier":{"issn":["0035-8711"],"eissn":["1365-2966"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.1093/mnras/stab2762","quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2004.14496","open_access":"1"}],"external_id":{"arxiv":["2004.14496"]},"oa":1,"extern":"1","volume":508,"date_created":"2022-07-07T09:30:21Z","date_updated":"2022-08-18T10:45:56Z","author":[{"full_name":"Gronke, Max","first_name":"Max","last_name":"Gronke"},{"first_name":"Pierre","last_name":"Ocvirk","full_name":"Ocvirk, Pierre"},{"full_name":"Mason, Charlotte","last_name":"Mason","first_name":"Charlotte"},{"full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee"},{"first_name":"Sarah E I","last_name":"Bosman","full_name":"Bosman, Sarah E I"},{"full_name":"Sorce, Jenny G","last_name":"Sorce","first_name":"Jenny G"},{"full_name":"Lewis, Joseph","first_name":"Joseph","last_name":"Lewis"},{"first_name":"Kyungjin","last_name":"Ahn","full_name":"Ahn, Kyungjin"},{"full_name":"Aubert, Dominique","last_name":"Aubert","first_name":"Dominique"},{"first_name":"Taha","last_name":"Dawoodbhoy","full_name":"Dawoodbhoy, Taha"},{"full_name":"Iliev, Ilian T","first_name":"Ilian T","last_name":"Iliev"},{"full_name":"Shapiro, Paul R","last_name":"Shapiro","first_name":"Paul R"},{"last_name":"Yepes","first_name":"Gustavo","full_name":"Yepes, Gustavo"}],"publisher":"Oxford University Press","publication_status":"published","year":"2021","acknowledgement":"The authors thank the referee for constructive feedback that improved the outcome of this study. We are grateful to Antoinette Songaila Cowie for sharing the ‘NEPLA4’ spectrum with us. This research has made use of NASA’s Astrophysics Data System, and many open source projects such as trident (Hummels et al. 2017), IPython (Pérez & Granger 2007), SciPy (Virtanen et al. 2019), NumPy (Walt et al. 2011), matplotlib (Hunter 2007), pandas (McKinney 2010), and the yt-project (Turk et al. 2011). MG was supported by NASA through the NASA Hubble Fellowship grant HST-HF2-51409 awarded by the Space Telescope Science Institute, which is operated by the Association of Universities for Research in Astronomy, Inc., for NASA, under contract NAS5-26555. MG acknowledges support from NASA grants HST-GO-15643.017, and HST-AR15797.001 as well as XSEDE grant TG-AST180036. CAM acknowledges support by NASA Headquarters through the NASA Hubble Fellowship grant HST-HF2-51413.001-A. PRS was supported in part by U.S. NSF grant AST-1009799, NASA grant NNX11AE09G, and supercomputer resources from NSF XSEDE grant TG AST090005 and the Texas Advanced Computing Center (TACC) at The University of Texas at Austin. JM acknowledges a Zwicky Prize Fellowship from ETH Zurich. GY acknowledges financial support by MICIU/FEDER under project grant PGC2018-094975-C21. SEIB acknowledges funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 669253). ITI was supported by the Science and Technology Facilities Council [grants ST/I000976/1, ST/F002858/1, ST/P000525/1, and ST/T000473/1]; and The Southeast Physics Network (SEPNet). KA was supported by NRF2016R1D1A1B04935414 and NRF-2016R1A5A1013277. KA also appreciates APCTP for its hospitality during completion of this work. PO acknowledges support from the French ANR funded project ORAGE (ANR-14-CE33-0016). ND and DA acknowledge funding from the French ANR for project ANR-12-JS05- 0001 (EMMA). The CoDa II simulation was performed at Oak Ridge National Laboratory/Oak Ridge Leadership Computing Facility on the Titan supercomputer (INCITE 2016 award AST031). Processing was performed on the Eos and Rhea clusters. Resolution study simulations were performed on Piz Daint at the Swiss National Supercomputing Center (PRACE Tier 0 award, project id pr37). The authors would like to acknowledge the High Performance Computing center of the University of Strasbourg for supporting this work by providing scientific support and access to computing resources. Part of the computing resources were funded by the Equipex EquipMeso project (Programme Investissements d’Avenir) and the CPER Alsacalcul/Big Data.","article_processing_charge":"No","day":"01","keyword":["dark ages","reionization","first stars","intergalactic medium","galaxies: formation"],"scopus_import":"1","date_published":"2021-12-01T00:00:00Z","page":"3697-3709","article_type":"original","citation":{"mla":"Gronke, Max, et al. “Lyman-α Transmission Properties of the Intergalactic Medium in the CoDaII Simulation.” Monthly Notices of the Royal Astronomical Society, vol. 508, no. 3, Oxford University Press, 2021, pp. 3697–709, doi:10.1093/mnras/stab2762.","short":"M. Gronke, P. Ocvirk, C. Mason, J.J. Matthee, S.E.I. Bosman, J.G. Sorce, J. Lewis, K. Ahn, D. Aubert, T. Dawoodbhoy, I.T. Iliev, P.R. Shapiro, G. Yepes, Monthly Notices of the Royal Astronomical Society 508 (2021) 3697–3709.","chicago":"Gronke, Max, Pierre Ocvirk, Charlotte Mason, Jorryt J Matthee, Sarah E I Bosman, Jenny G Sorce, Joseph Lewis, et al. “Lyman-α Transmission Properties of the Intergalactic Medium in the CoDaII Simulation.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/stab2762.","ama":"Gronke M, Ocvirk P, Mason C, et al. Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical Society. 2021;508(3):3697-3709. doi:10.1093/mnras/stab2762","ista":"Gronke M, Ocvirk P, Mason C, Matthee JJ, Bosman SEI, Sorce JG, Lewis J, Ahn K, Aubert D, Dawoodbhoy T, Iliev IT, Shapiro PR, Yepes G. 2021. Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical Society. 508(3), 3697–3709.","apa":"Gronke, M., Ocvirk, P., Mason, C., Matthee, J. J., Bosman, S. E. I., Sorce, J. G., … Yepes, G. (2021). Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab2762","ieee":"M. Gronke et al., “Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation,” Monthly Notices of the Royal Astronomical Society, vol. 508, no. 3. Oxford University Press, pp. 3697–3709, 2021."},"publication":"Monthly Notices of the Royal Astronomical Society","issue":"3","abstract":[{"text":"The decline in abundance of Lyman-α (Lyα) emitting galaxies at z ≳ 6 is a powerful and commonly used probe to constrain the progress of cosmic reionization. We use the CODAII simulation, which is a radiation hydrodynamic simulation featuring a box of ∼94 comoving Mpc side length, to compute the Lyα transmission properties of the intergalactic medium (IGM) at z ∼ 5.8 to 7. Our results mainly confirm previous studies, i.e. we find a declining Lyα transmission with redshift and a large sightline-to-sightline variation. However, motivated by the recent discovery of blue Lyα peaks at high redshift, we also analyse the IGM transmission on the blue side, which shows a rapid decline at z ≳ 6 of the blue transmission. This low transmission can be attributed not only to the presence of neutral regions but also to the residual neutral hydrogen within ionized regions, for which a density even as low as nHI∼10−9cm−3 (sometimes combined with kinematic effects) leads to a significantly reduced visibility. Still, we find that ∼1 per cent of sightlines towards M1600AB ∼ −21 galaxies at z ∼ 7 are transparent enough to allow a transmission of a blue Lyα peak. We discuss our results in the context of the interpretation of observations.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 508","title":"Lyman-α transmission properties of the intergalactic medium in the CoDaII simulation","status":"public","_id":"11522","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"extern":"1","publisher":"Oxford University Press","publication_status":"published","acknowledgement":"The authors thank Daichi Kashino, for providing access to unpublished zCOSMOS Deep data, and Jakob S. den Brok for sharing code used in den Brok et al. (2020). GP and SC acknowledge the support of the Swiss National Science Foundation [grant PP00P2163824]. SM is supported by the Experienced Researchers Fellowship, Alexander von Humboldt-Stiftung, Germany. This work is based on observations collected at the European Organisation for Astronomical Research in the Southern Hemisphere under the MUSE GTO programme. The major analysis and production of figures in this work was conducted in Python, using standard libraries which include NumPy (Harris et al. 2020), SciPy (Virtanen et al. 2020), Matplotlib (Hunter 2007) and the interactive command shell IPython (Pérez & Granger 2007). This research also made use of Astropy, a community-developed core Python package for Astronomy (Astropy Collaboration et al. 2013), and Photutils, an Astropy package for detection and photometry of astronomica sources (Bradley et al. 2019). The python interface dustmaps (Green 2018) was used to query galactic extinction maps. topcat, a graphical tool for manipulating tabular data, was also utilized in this analysis (Taylor 2005). This research has made use of the \"Aladin sky atlas\" developed at CDS, Strasbourg Observatory, France (Bonnarel et al. 2000).","year":"2021","volume":502,"date_created":"2022-07-07T10:11:15Z","date_updated":"2022-08-18T10:56:28Z","author":[{"last_name":"Mackenzie","first_name":"Ruari","full_name":"Mackenzie, Ruari"},{"full_name":"Pezzulli, Gabriele","first_name":"Gabriele","last_name":"Pezzulli"},{"first_name":"Sebastiano","last_name":"Cantalupo","full_name":"Cantalupo, Sebastiano"},{"full_name":"Marino, Raffaella A","first_name":"Raffaella A","last_name":"Marino"},{"first_name":"Simon","last_name":"Lilly","full_name":"Lilly, Simon"},{"last_name":"Muzahid","first_name":"Sowgat","full_name":"Muzahid, Sowgat"},{"full_name":"Matthee, Jorryt J","first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X"},{"first_name":"Joop","last_name":"Schaye","full_name":"Schaye, Joop"},{"full_name":"Wisotzki, Lutz","last_name":"Wisotzki","first_name":"Lutz"}],"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"month":"03","quality_controlled":"1","oa":1,"external_id":{"arxiv":["2010.12589"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.12589"}],"language":[{"iso":"eng"}],"doi":"10.1093/mnras/staa3277","type":"journal_article","issue":"1","abstract":[{"text":"We present the results from a MUSE survey of twelve z ≃ 3.15 quasars, which were selected to be much fainter (20 < iSDSS < 23) than in previous studies of giant Ly α nebulae around the brightest quasars (16.6 < iAB < 18.7). We detect H I Ly α nebulae around 100 per cent of our target quasars, with emission extending to scales of at least 60 physical kpc, and up to 190 pkpc. We explore correlations between properties of the nebulae and their host quasars, with the goal of connecting variations in the properties of the illuminating QSO to the response in nebular emission. We show that the surface brightness profiles of the nebulae are similar to those of nebulae around bright quasars, but with a lower normalization. Our targeted quasars are on average 3.7 mag (≃30 times) fainter in UV continuum than our bright reference sample, and yet the nebulae around them are only 4.3 times fainter in mean Ly α surface brightness, measured between 20 and 50 pkpc. We find significant correlations between the surface brightness of the nebula and the luminosity of the quasar in both UV continuum and Ly α. The latter can be interpreted as evidence for a substantial contribution from unresolved inner parts of the nebulae to the narrow components seen in the Ly α lines of some of our faint quasars, possibly from the inner circumgalactic medium or from the host galaxy’s interstellar medium.","lang":"eng"}],"intvolume":" 502","title":"Revealing the impact of quasar luminosity on giant Lyα nebulae","status":"public","_id":"11526","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","keyword":["Space and Planetary Science","Astronomy and Astrophysics","techniques: imaging spectroscopy","intergalactic medium","quasars: emission lines","quasars: general"],"scopus_import":"1","article_processing_charge":"No","day":"01","page":"494-509","article_type":"original","citation":{"short":"R. Mackenzie, G. Pezzulli, S. Cantalupo, R.A. Marino, S. Lilly, S. Muzahid, J.J. Matthee, J. Schaye, L. Wisotzki, Monthly Notices of the Royal Astronomical Society 502 (2021) 494–509.","mla":"Mackenzie, Ruari, et al. “Revealing the Impact of Quasar Luminosity on Giant Lyα Nebulae.” Monthly Notices of the Royal Astronomical Society, vol. 502, no. 1, Oxford University Press, 2021, pp. 494–509, doi:10.1093/mnras/staa3277.","chicago":"Mackenzie, Ruari, Gabriele Pezzulli, Sebastiano Cantalupo, Raffaella A Marino, Simon Lilly, Sowgat Muzahid, Jorryt J Matthee, Joop Schaye, and Lutz Wisotzki. “Revealing the Impact of Quasar Luminosity on Giant Lyα Nebulae.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/staa3277.","ama":"Mackenzie R, Pezzulli G, Cantalupo S, et al. Revealing the impact of quasar luminosity on giant Lyα nebulae. Monthly Notices of the Royal Astronomical Society. 2021;502(1):494-509. doi:10.1093/mnras/staa3277","apa":"Mackenzie, R., Pezzulli, G., Cantalupo, S., Marino, R. A., Lilly, S., Muzahid, S., … Wisotzki, L. (2021). Revealing the impact of quasar luminosity on giant Lyα nebulae. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/staa3277","ieee":"R. Mackenzie et al., “Revealing the impact of quasar luminosity on giant Lyα nebulae,” Monthly Notices of the Royal Astronomical Society, vol. 502, no. 1. Oxford University Press, pp. 494–509, 2021.","ista":"Mackenzie R, Pezzulli G, Cantalupo S, Marino RA, Lilly S, Muzahid S, Matthee JJ, Schaye J, Wisotzki L. 2021. Revealing the impact of quasar luminosity on giant Lyα nebulae. Monthly Notices of the Royal Astronomical Society. 502(1), 494–509."},"publication":"Monthly Notices of the Royal Astronomical Society","date_published":"2021-03-01T00:00:00Z"},{"citation":{"chicago":"Santos, S, D Sobral, J Butterworth, A Paulino-Afonso, B Ribeiro, E da Cunha, J Calhau, A A Khostovan, Jorryt J Matthee, and P Arrabal Haro. “The Evolution of the UV Luminosity and Stellar Mass Functions of Lyman-α Emitters from z ∼ 2 to z ∼ 6.” Monthly Notices of the Royal Astronomical Society. Oxford University Press, 2021. https://doi.org/10.1093/mnras/stab1218.","mla":"Santos, S., et al. “The Evolution of the UV Luminosity and Stellar Mass Functions of Lyman-α Emitters from z ∼ 2 to z ∼ 6.” Monthly Notices of the Royal Astronomical Society, vol. 505, no. 1, Oxford University Press, 2021, pp. 1117–34, doi:10.1093/mnras/stab1218.","short":"S. Santos, D. Sobral, J. Butterworth, A. Paulino-Afonso, B. Ribeiro, E. da Cunha, J. Calhau, A.A. Khostovan, J.J. Matthee, P. Arrabal Haro, Monthly Notices of the Royal Astronomical Society 505 (2021) 1117–1134.","ista":"Santos S, Sobral D, Butterworth J, Paulino-Afonso A, Ribeiro B, da Cunha E, Calhau J, Khostovan AA, Matthee JJ, Arrabal Haro P. 2021. The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly Notices of the Royal Astronomical Society. 505(1), 1117–1134.","apa":"Santos, S., Sobral, D., Butterworth, J., Paulino-Afonso, A., Ribeiro, B., da Cunha, E., … Arrabal Haro, P. (2021). The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly Notices of the Royal Astronomical Society. Oxford University Press. https://doi.org/10.1093/mnras/stab1218","ieee":"S. Santos et al., “The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6,” Monthly Notices of the Royal Astronomical Society, vol. 505, no. 1. Oxford University Press, pp. 1117–1134, 2021.","ama":"Santos S, Sobral D, Butterworth J, et al. The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6. Monthly Notices of the Royal Astronomical Society. 2021;505(1):1117-1134. doi:10.1093/mnras/stab1218"},"publication":"Monthly Notices of the Royal Astronomical Society","page":"1117-1134","article_type":"original","date_published":"2021-07-01T00:00:00Z","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","galaxies: evolution","galaxies: high-redshift","galaxies: luminosity function","mass function"],"article_processing_charge":"No","day":"01","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11524","intvolume":" 505","status":"public","title":"The evolution of the UV luminosity and stellar mass functions of Lyman-α emitters from z ∼ 2 to z ∼ 6","oa_version":"Preprint","type":"journal_article","issue":"1","abstract":[{"lang":"eng","text":"We measure the evolution of the rest-frame UV luminosity function (LF) and the stellar mass function (SMF) of Lyman-α (Ly α) emitters (LAEs) from z ∼ 2 to z ∼ 6 by exploring ∼4000 LAEs from the SC4K sample. We find a correlation between Ly α luminosity (LLy α) and rest-frame UV (MUV), with best fit MUV=−1.6+0.2−0.3log10(LLyα/ergs−1)+47+12−11 and a shallower relation between LLy α and stellar mass (M⋆), with best fit log10(M⋆/M⊙)=0.9+0.1−0.1log10(LLyα/ergs−1)−28+4.0−3.8. An increasing LLy α cut predominantly lowers the number density of faint MUV and low M⋆ LAEs. We estimate a proxy for the full UV LFs and SMFs of LAEs with simple assumptions of the faint end slope. For the UV LF, we find a brightening of the characteristic UV luminosity (M∗UV) with increasing redshift and a decrease of the characteristic number density (Φ*). For the SMF, we measure a characteristic stellar mass (M∗⋆/M⊙) increase with increasing redshift, and a Φ* decline. However, if we apply a uniform luminosity cut of log10(LLyα/ergs−1)≥43.0, we find much milder to no evolution in the UV and SMF of LAEs. The UV luminosity density (ρUV) of the full sample of LAEs shows moderate evolution and the stellar mass density (ρM) decreases, with both being always lower than the total ρUV and ρM of more typical galaxies but slowly approaching them with increasing redshift. Overall, our results indicate that both ρUV and ρM of LAEs slowly approach the measurements of continuum-selected galaxies at z > 6, which suggests a key role of LAEs in the epoch of reionization."}],"oa":1,"external_id":{"arxiv":["2105.00007"]},"main_file_link":[{"url":"https://arxiv.org/abs/2105.00007","open_access":"1"}],"quality_controlled":"1","doi":"10.1093/mnras/stab1218","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["1365-2966"],"issn":["0035-8711"]},"month":"07","acknowledgement":"This research made use of Astropy, a community developed core Python package for Astronomy (Astropy Collaboration et al. 2013). topcat, a graphical tool for manipulating tabular data, was also utilized in this analysis (Taylor 2005). SG would like to thank Nastasha Wijers for the discussion on the column density distribution in EAGLE. SC gratefully acknowledges support from Swiss National Science Foundation grants PP00P2 163824 and PP00P2 190092, and from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme grant agreement No 864361. GP acknowledges support from the Swiss National Science Foundation (SNF) and from the Netherlands Research School for Astronomy (NOVA).","year":"2021","publisher":"Oxford University Press","publication_status":"published","author":[{"full_name":"Santos, S","first_name":"S","last_name":"Santos"},{"first_name":"D","last_name":"Sobral","full_name":"Sobral, D"},{"first_name":"J","last_name":"Butterworth","full_name":"Butterworth, J"},{"last_name":"Paulino-Afonso","first_name":"A","full_name":"Paulino-Afonso, A"},{"full_name":"Ribeiro, B","last_name":"Ribeiro","first_name":"B"},{"last_name":"da Cunha","first_name":"E","full_name":"da Cunha, E"},{"full_name":"Calhau, J","first_name":"J","last_name":"Calhau"},{"last_name":"Khostovan","first_name":"A A","full_name":"Khostovan, A A"},{"first_name":"Jorryt J","last_name":"Matthee","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","full_name":"Matthee, Jorryt J"},{"first_name":"P","last_name":"Arrabal Haro","full_name":"Arrabal Haro, P"}],"volume":505,"date_updated":"2022-08-18T10:51:47Z","date_created":"2022-07-07T10:02:59Z","extern":"1"},{"language":[{"iso":"eng"}],"doi":"10.1038/s41550-021-01415-y","quality_controlled":"1","external_id":{"arxiv":["1802.06786"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1802.06786"}],"month":"07","publication_identifier":{"eissn":["2397-3366"]},"date_created":"2022-07-14T13:13:39Z","date_updated":"2022-08-19T08:37:58Z","volume":5,"author":[{"full_name":"Matthee, Jorryt J","id":"7439a258-f3c0-11ec-9501-9df22fe06720","orcid":"0000-0003-2871-127X","first_name":"Jorryt J","last_name":"Matthee"}],"publication_status":"published","publisher":"Springer Nature","acknowledgement":"We thank the anonymous referee for their constructive comments. JM acknowledges the support of a Huygens PhD fellowship from Leiden University. We thank Jarle Brinchmann, Rob Crain and David Sobral for discussions. We acknowledge the use of the Topcat software (Taylor 2013) for assisting in rapid exploration of multi-dimensional datasets and the use of Python and its numpy, matplotlib and pandas packages.","year":"2021","extern":"1","date_published":"2021-07-05T00:00:00Z","article_type":"original","page":"984-985","publication":"Nature Astronomy","citation":{"short":"J.J. Matthee, Nature Astronomy 5 (2021) 984–985.","mla":"Matthee, Jorryt J. “Differences in Galaxy Colours Are Not Just about the Mass.” Nature Astronomy, vol. 5, Springer Nature, 2021, pp. 984–85, doi:10.1038/s41550-021-01415-y.","chicago":"Matthee, Jorryt J. “Differences in Galaxy Colours Are Not Just about the Mass.” Nature Astronomy. Springer Nature, 2021. https://doi.org/10.1038/s41550-021-01415-y.","ama":"Matthee JJ. Differences in galaxy colours are not just about the mass. Nature Astronomy. 2021;5:984-985. doi:10.1038/s41550-021-01415-y","ieee":"J. J. Matthee, “Differences in galaxy colours are not just about the mass,” Nature Astronomy, vol. 5. Springer Nature, pp. 984–985, 2021.","apa":"Matthee, J. J. (2021). Differences in galaxy colours are not just about the mass. Nature Astronomy. Springer Nature. https://doi.org/10.1038/s41550-021-01415-y","ista":"Matthee JJ. 2021. Differences in galaxy colours are not just about the mass. Nature Astronomy. 5, 984–985."},"day":"05","article_processing_charge":"No","keyword":["Astronomy and Astrophysics","galaxies","formation - galaxies","evolution - galaxies","star formation - galaxies","abundances"],"scopus_import":"1","oa_version":"Preprint","title":"Differences in galaxy colours are not just about the mass","status":"public","intvolume":" 5","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11585","abstract":[{"lang":"eng","text":"Observations show that star-forming galaxies reside on a tight three-dimensional plane between mass, gas-phase metallicity and star formation rate (SFR), which can be explained by the interplay between metal-poor gas inflows, SFR and outflows. However, different metals are released on different time-scales, which may affect the slope of this relation. Here, we use central, star-forming galaxies with Mstar = 109.0−10.5 M\f from the EAGLE hydrodynamical simulation to examine three-dimensional relations between mass, SFR and chemical enrichment using absolute and relative C, N, O and Fe abundances. We show that the scatter is smaller when gas-phase α-enhancement is used rather than metallicity. A similar plane also exists for stellar α-enhancement, implying that present-day specific SFRs are correlated with long time-scale star formation histories. Between z = 0 and 1, the α-enhancement plane is even more insensitive to redshift than the plane using metallicity. However, it evolves at z > 1 due to lagging iron yields. At fixed mass, galaxies with higher SFRs have star formation histories shifted toward late times, are more α-enhanced and this α-enhancement increases with redshift as observed. These findings suggest that relations between physical properties inferred from observations may be affected by systematic variations in α-enhancements."}],"type":"journal_article"},{"extern":"1","article_number":"209","author":[{"full_name":"Audenaert, J.","first_name":"J.","last_name":"Audenaert"},{"full_name":"Kuszlewicz, J. S.","last_name":"Kuszlewicz","first_name":"J. S."},{"last_name":"Handberg","first_name":"R.","full_name":"Handberg, R."},{"first_name":"A.","last_name":"Tkachenko","full_name":"Tkachenko, A."},{"full_name":"Armstrong, D. J.","first_name":"D. J.","last_name":"Armstrong"},{"full_name":"Hon, M.","last_name":"Hon","first_name":"M."},{"last_name":"Kgoadi","first_name":"R.","full_name":"Kgoadi, R."},{"full_name":"Lund, M. N.","last_name":"Lund","first_name":"M. N."},{"last_name":"Bell","first_name":"K. J.","full_name":"Bell, K. J."},{"full_name":"Bugnet, Lisa Annabelle","first_name":"Lisa Annabelle","last_name":"Bugnet","id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000"},{"full_name":"Bowman, D. M.","last_name":"Bowman","first_name":"D. M."},{"full_name":"Johnston, C.","last_name":"Johnston","first_name":"C."},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"full_name":"Stello, D.","first_name":"D.","last_name":"Stello"},{"last_name":"Molnár","first_name":"L.","full_name":"Molnár, L."},{"full_name":"Plachy, E.","last_name":"Plachy","first_name":"E."},{"full_name":"Buzasi, D.","last_name":"Buzasi","first_name":"D."},{"first_name":"C.","last_name":"Aerts","full_name":"Aerts, C."}],"date_created":"2022-07-18T11:54:55Z","date_updated":"2022-08-19T10:01:56Z","volume":162,"acknowledgement":"The research leading to these results has received funding from the European Research Council (ERC) under the European Union's Horizon 2020 research and innovation program (grant agreement No. 670519: MAMSIE), from the KU Leuven Research Council (grant C16/18/005: PARADISE), from the Research Foundation Flanders (FWO) under grant agreement G0H5416N (ERC Runner Up Project), as well as from the BELgian federal Science Policy Office (BELSPO) through PRODEX grant PLATO. D.J.A acknowledges support from the STFC via an Ernest Rutherford Fellowship (ST/R00384X/1). Funding for the Stellar Astrophysics Centre is provided by The Danish National Research Foundation (grant agreement No.: DNRF106). R.H. and M.N.L. acknowledge the ESA PRODEX program. This research was supported by the National Aeronautics and Space Administration (80NSSC18K1585 and 80NSSC19K0379) awarded through the TESS Guest Investigator Program. K.J.B. is supported by the National Science Foundation under Award AST-1903828. J.S.K and K.J.B. were supported by funding from the European Research Council under the European Community's Seventh Framework Programme (FP7/2007-2013)/ERC grant agreement no. 338251 (StellarAges). D.M.B. gratefully acknowledges funding from a senior postdoctoral fellowship from the Research Foundation Flanders (FWO) with grant agreement No. 1286521N. The research leading to these results has received funding from the Research Foundation Flanders (FWO) under grant agreement G0A2917N (BlackGEM). R.A.G. acknowledges support from the GOLF and PLATO CNES grants. L.M. was supported by the Premium Postdoctoral Research Program of the Hungarian Academy of Sciences. The research leading to these results has been supported by the Hungarian National Research, Development, and Innovation Office (NKFIH) grant KH_18 130405 and the Lendület LP2014-17 and LP2018-7/2020 grants of the Hungarian Academy of Sciences. D.B. acknowledges support from the NASA TESS Guest Investigator Program under award 80NSSC19K0385.\r\n\r\nThis paper includes data collected by the TESS mission, which are publicly available from the Mikulski Archive for Space Telescopes (MAST). Funding for the TESS mission is provided by NASA's Science Mission directorate. This research has made use of NASA's Astrophysics Data System as well as the NASA/IPAC Extragalactic Database (NED) which is operated by the Jet Propulsion Laboratory, California Institute of Technology, under contract with the National Aeronautics and Space Administration. Funding for the TESS Asteroseismic Science Operations Centre is provided by the Danish National Research Foundation (Grant agreement no.: DNRF106), ESA PRODEX (PEA 4000119301), and the Stellar Astrophysics Centre (SAC) at Aarhus University. We thank the TESS team and staff and TASC/TASOC for their support of the present work.\r\n\r\nThis paper includes data collected by the Kepler mission. Funding for the Kepler and K2 mission was provided by NASA's Science Mission Directorate. The authors acknowledge the efforts of the Kepler Mission team in obtaining the light-curve data and data validation products used in this publication. These data were generated by the Kepler Mission science pipeline through the efforts of the Kepler Science Operations Center and Science Office. The Kepler light curves are archived at the Mikulski Archive for Space Telescopes.\r\n\r\nThe numerical results presented in this work were obtained at the Centre for Scientific Computing, Aarhus. 37 This research made use of Astropy, a community-developed core Python package for Astronomy (Astropy Collaboration et al. 2013, 2018).\r\n\r\nSoftware: Scikit-learn (Pedregosa et al. 2011), Numpy (Harris et al. 2020), Astropy (Astropy Collaboration et al. 2013, 2018), Scipy (Virtanen et al. 2020), Pandas (McKinney 2010; Pandas Development Team 2020), Lightkurve (Lightkurve Collaboration et al. 2018), XGBoost (Chen & Guestrin 2016), Tensorflow (Abadi et al. 2015).","year":"2021","publication_status":"published","publisher":"IOP Publishing","month":"10","publication_identifier":{"eissn":["1538-3881"],"issn":["0004-6256"]},"doi":"10.3847/1538-3881/ac166a","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/2107.06301","open_access":"1"}],"external_id":{"arxiv":["2107.06301"]},"oa":1,"quality_controlled":"1","abstract":[{"lang":"eng","text":"The NASA Transiting Exoplanet Survey Satellite (TESS) is observing tens of millions of stars with time spans ranging from ∼27 days to about 1 yr of continuous observations. This vast amount of data contains a wealth of information for variability, exoplanet, and stellar astrophysics studies but requires a number of processing steps before it can be fully utilized. In order to efficiently process all the TESS data and make it available to the wider scientific community, the TESS Data for Asteroseismology working group, as part of the TESS Asteroseismic Science Consortium, has created an automated open-source processing pipeline to produce light curves corrected for systematics from the short- and long-cadence raw photometry data and to classify these according to stellar variability type. We will process all stars down to a TESS magnitude of 15. This paper is the next in a series detailing how the pipeline works. Here, we present our methodology for the automatic variability classification of TESS photometry using an ensemble of supervised learners that are combined into a metaclassifier. We successfully validate our method using a carefully constructed labeled sample of Kepler Q9 light curves with a 27.4 days time span mimicking single-sector TESS observations, on which we obtain an overall accuracy of 94.9%. We demonstrate that our methodology can successfully classify stars outside of our labeled sample by applying it to all ∼167,000 stars observed in Q9 of the Kepler space mission."}],"issue":"5","type":"journal_article","oa_version":"Preprint","_id":"11604","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"TESS Data for Asteroseismology (T’DA) stellar variability classification pipeline: Setup and application to the Kepler Q9 data","status":"public","intvolume":" 162","day":"21","article_processing_charge":"No","scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics"],"date_published":"2021-10-21T00:00:00Z","publication":"The Astronomical Journal","citation":{"chicago":"Audenaert, J., J. S. Kuszlewicz, R. Handberg, A. Tkachenko, D. J. Armstrong, M. Hon, R. Kgoadi, et al. “TESS Data for Asteroseismology (T’DA) Stellar Variability Classification Pipeline: Setup and Application to the Kepler Q9 Data.” The Astronomical Journal. IOP Publishing, 2021. https://doi.org/10.3847/1538-3881/ac166a.","mla":"Audenaert, J., et al. “TESS Data for Asteroseismology (T’DA) Stellar Variability Classification Pipeline: Setup and Application to the Kepler Q9 Data.” The Astronomical Journal, vol. 162, no. 5, 209, IOP Publishing, 2021, doi:10.3847/1538-3881/ac166a.","short":"J. Audenaert, J.S. Kuszlewicz, R. Handberg, A. Tkachenko, D.J. Armstrong, M. Hon, R. Kgoadi, M.N. Lund, K.J. Bell, L.A. Bugnet, D.M. Bowman, C. Johnston, R.A. García, D. Stello, L. Molnár, E. Plachy, D. Buzasi, C. Aerts, The Astronomical Journal 162 (2021).","ista":"Audenaert J, Kuszlewicz JS, Handberg R, Tkachenko A, Armstrong DJ, Hon M, Kgoadi R, Lund MN, Bell KJ, Bugnet LA, Bowman DM, Johnston C, García RA, Stello D, Molnár L, Plachy E, Buzasi D, Aerts C. 2021. TESS Data for Asteroseismology (T’DA) stellar variability classification pipeline: Setup and application to the Kepler Q9 data. The Astronomical Journal. 162(5), 209.","apa":"Audenaert, J., Kuszlewicz, J. S., Handberg, R., Tkachenko, A., Armstrong, D. J., Hon, M., … Aerts, C. (2021). TESS Data for Asteroseismology (T’DA) stellar variability classification pipeline: Setup and application to the Kepler Q9 data. The Astronomical Journal. IOP Publishing. https://doi.org/10.3847/1538-3881/ac166a","ieee":"J. Audenaert et al., “TESS Data for Asteroseismology (T’DA) stellar variability classification pipeline: Setup and application to the Kepler Q9 data,” The Astronomical Journal, vol. 162, no. 5. IOP Publishing, 2021.","ama":"Audenaert J, Kuszlewicz JS, Handberg R, et al. TESS Data for Asteroseismology (T’DA) stellar variability classification pipeline: Setup and application to the Kepler Q9 data. The Astronomical Journal. 2021;162(5). doi:10.3847/1538-3881/ac166a"},"article_type":"original"},{"scopus_import":"1","keyword":["Space and Planetary Science","Astronomy and Astrophysics","methods: data analysis / stars: solar-type / stars: activity / stars: rotation / starspots"],"article_processing_charge":"No","day":"19","citation":{"ama":"Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy & Astrophysics. 2021;647. doi:10.1051/0004-6361/202039947","apa":"Breton, S. N., Santos, A. R. G., Bugnet, L. A., Mathur, S., García, R. A., & Pallé, P. L. (2021). ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039947","ieee":"S. N. Breton, A. R. G. Santos, L. A. Bugnet, S. Mathur, R. A. García, and P. L. Pallé, “ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods,” Astronomy & Astrophysics, vol. 647. EDP Sciences, 2021.","ista":"Breton SN, Santos ARG, Bugnet LA, Mathur S, García RA, Pallé PL. 2021. ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods. Astronomy & Astrophysics. 647, A125.","short":"S.N. Breton, A.R.G. Santos, L.A. Bugnet, S. Mathur, R.A. García, P.L. Pallé, Astronomy & Astrophysics 647 (2021).","mla":"Breton, S. N., et al. “ROOSTER: A Machine-Learning Analysis Tool for Kepler Stellar Rotation Periods.” Astronomy & Astrophysics, vol. 647, A125, EDP Sciences, 2021, doi:10.1051/0004-6361/202039947.","chicago":"Breton, S. N., A. R. G. Santos, Lisa Annabelle Bugnet, S. Mathur, R. A. García, and P. L. Pallé. “ROOSTER: A Machine-Learning Analysis Tool for Kepler Stellar Rotation Periods.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039947."},"publication":"Astronomy & Astrophysics","article_type":"original","date_published":"2021-03-19T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"In order to understand stellar evolution, it is crucial to efficiently determine stellar surface rotation periods. Indeed, while they are of great importance in stellar models, angular momentum transport processes inside stars are still poorly understood today. Surface rotation, which is linked to the age of the star, is one of the constraints needed to improve the way those processes are modelled. Statistics of the surface rotation periods for a large sample of stars of different spectral types are thus necessary. An efficient tool to automatically determine reliable rotation periods is needed when dealing with large samples of stellar photometric datasets. The objective of this work is to develop such a tool. For this purpose, machine learning classifiers constitute relevant bases to build our new methodology. Random forest learning abilities are exploited to automate the extraction of rotation periods in Kepler light curves. Rotation periods and complementary parameters are obtained via three different methods: a wavelet analysis, the autocorrelation function of the light curve, and the composite spectrum. We trained three different classifiers: one to detect if rotational modulations are present in the light curve, one to flag close binary or classical pulsators candidates that can bias our rotation period determination, and finally one classifier to provide the final rotation period. We tested our machine learning pipeline on 23 431 stars of the Kepler K and M dwarf reference rotation catalogue for which 60% of the stars have been visually inspected. For the sample of 21 707 stars where all the input parameters are provided to the algorithm, 94.2% of them are correctly classified (as rotating or not). Among the stars that have a rotation period in the reference catalogue, the machine learning provides a period that agrees within 10% of the reference value for 95.3% of the stars. Moreover, the yield of correct rotation periods is raised to 99.5% after visually inspecting 25.2% of the stars. Over the two main analysis steps, rotation classification and period selection, the pipeline yields a global agreement with the reference values of 92.1% and 96.9% before and after visual inspection. Random forest classifiers are efficient tools to determine reliable rotation periods in large samples of stars. The methodology presented here could be easily adapted to extract surface rotation periods for stars with different spectral types or observed by other instruments such as K2, TESS or by PLATO in the near future."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11608","intvolume":" 647","status":"public","title":"ROOSTER: A machine-learning analysis tool for Kepler stellar rotation periods","oa_version":"Preprint","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"month":"03","external_id":{"arxiv":["2101.10152"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2101.10152","open_access":"1"}],"quality_controlled":"1","doi":"10.1051/0004-6361/202039947","language":[{"iso":"eng"}],"article_number":"A125","extern":"1","year":"2021","acknowledgement":"We thank Suzanne Aigrain and Joe Llama for providing us with the simulated data used in Aigrain et al. (2015). S. N. B., L. B. and R. A. G. acknowledge the support from PLATO and GOLF CNES grants. A. R. G. S. acknowledges the support from NASA under grant NNX17AF27G. S. M. acknowledges the support from the Spanish Ministry of Science and Innovation with the Ramon y Cajal fellowship number RYC-2015-17697. P. L. P. and S. M. acknowledge support from the Spanish Ministry of Science and Innovation with the grant number PID2019-107187GB-I00. This research has made use of the NASA Exoplanet Archive, which is operated by the California Institute of Technology, under contract with the National Aeronautics and Space Administration under the Exoplanet Exploration Program. Software: Python (Van Rossum & Drake 2009), numpy (Oliphant 2006), pandas (The pandas development team 2020; McKinney 2010), matplotlib (Hunter 2007), scikit-learn (Pedregosa et al. 2011). The source code used to obtain the present results can be found at: https://gitlab.com/sybreton/pushkin ; https://gitlab.com/sybreton/ml_surface_rotation_paper .","publisher":"EDP Sciences","publication_status":"published","author":[{"first_name":"S. N.","last_name":"Breton","full_name":"Breton, S. N."},{"first_name":"A. R. G.","last_name":"Santos","full_name":"Santos, A. R. G."},{"id":"d9edb345-f866-11ec-9b37-d119b5234501","orcid":"0000-0003-0142-4000","first_name":"Lisa Annabelle","last_name":"Bugnet","full_name":"Bugnet, Lisa Annabelle"},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"full_name":"García, R. A.","first_name":"R. A.","last_name":"García"},{"first_name":"P. L.","last_name":"Pallé","full_name":"Pallé, P. L."}],"volume":647,"date_created":"2022-07-18T12:21:32Z","date_updated":"2022-08-22T08:47:47Z"},{"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/2006.10660","open_access":"1"}],"external_id":{"arxiv":["2006.10660"]},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1051/0004-6361/202038654","publication_identifier":{"issn":["0004-6361"],"eissn":["1432-0746"]},"month":"02","publisher":"EDP Sciences","publication_status":"published","year":"2021","acknowledgement":"The authors acknowledge support from the European Research Council through ERC grant SPIRE 647383 and from GOLF and PLATO CNES grants at the Department of Astrophysics at CEA Paris-Saclay. We thank the referee, Prof. A. J. Barker, for his constructive comments that allow us to improve the article.","volume":646,"date_updated":"2022-08-19T10:18:03Z","date_created":"2022-07-18T13:24:32Z","author":[{"full_name":"Park, J.","first_name":"J.","last_name":"Park"},{"first_name":"V.","last_name":"Prat","full_name":"Prat, V."},{"last_name":"Mathis","first_name":"S.","full_name":"Mathis, S."},{"orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle"}],"article_number":"A64","extern":"1","article_type":"original","citation":{"chicago":"Park, J., V. Prat, S. Mathis, and Lisa Annabelle Bugnet. “Horizontal Shear Instabilities in Rotating Stellar Radiation Zones: II. Effects of the Full Coriolis Acceleration.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202038654.","short":"J. Park, V. Prat, S. Mathis, L.A. Bugnet, Astronomy & Astrophysics 646 (2021).","mla":"Park, J., et al. “Horizontal Shear Instabilities in Rotating Stellar Radiation Zones: II. Effects of the Full Coriolis Acceleration.” Astronomy & Astrophysics, vol. 646, A64, EDP Sciences, 2021, doi:10.1051/0004-6361/202038654.","ieee":"J. Park, V. Prat, S. Mathis, and L. A. Bugnet, “Horizontal shear instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration,” Astronomy & Astrophysics, vol. 646. EDP Sciences, 2021.","apa":"Park, J., Prat, V., Mathis, S., & Bugnet, L. A. (2021). Horizontal shear instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202038654","ista":"Park J, Prat V, Mathis S, Bugnet LA. 2021. Horizontal shear instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration. Astronomy & Astrophysics. 646, A64.","ama":"Park J, Prat V, Mathis S, Bugnet LA. Horizontal shear instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration. Astronomy & Astrophysics. 2021;646. doi:10.1051/0004-6361/202038654"},"publication":"Astronomy & Astrophysics","date_published":"2021-02-08T00:00:00Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","hydrodynamics / turbulence / stars","rotation / stars","evolution"],"scopus_import":"1","article_processing_charge":"No","day":"08","intvolume":" 646","title":"Horizontal shear instabilities in rotating stellar radiation zones: II. Effects of the full Coriolis acceleration","status":"public","_id":"11609","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"journal_article","abstract":[{"text":"Context. Stellar interiors are the seat of efficient transport of angular momentum all along their evolution. In this context, understanding the dependence of the turbulent transport triggered by the instabilities of the vertical and horizontal shears of the differential rotation in stellar radiation zones as a function of their rotation, stratification, and thermal diffusivity is mandatory. Indeed, it constitutes one of the cornerstones of the rotational transport and mixing theory, which is implemented in stellar evolution codes to predict the rotational and chemical evolutions of stars.\r\n\r\nAims. We investigate horizontal shear instabilities in rotating stellar radiation zones by considering the full Coriolis acceleration with both the dimensionless horizontal Coriolis component f̃ and the vertical component f.\r\n\r\nMethods. We performed a linear stability analysis using linearized equations derived from the Navier-Stokes and heat transport equations in the rotating nontraditional f-plane. We considered a horizontal shear flow with a hyperbolic tangent profile as the base flow. The linear stability was analyzed numerically in wide ranges of parameters, and we performed an asymptotic analysis for large vertical wavenumbers using the Wentzel-Kramers-Brillouin-Jeffreys (WKBJ) approximation for nondiffusive and highly-diffusive fluids.\r\n\r\nResults. As in the traditional f-plane approximation, we identify two types of instabilities: the inflectional and inertial instabilities. The inflectional instability is destabilized as f̃ increases and its maximum growth rate increases significantly, while the thermal diffusivity stabilizes the inflectional instability similarly to the traditional case. The inertial instability is also strongly affected; for instance, the inertially unstable regime is also extended in the nondiffusive limit as 0 < f < 1 + f̃ 2/N2, where N is the dimensionless Brunt-Väisälä frequency. More strikingly, in the high thermal diffusivity limit, it is always inertially unstable at any colatitude θ except at the poles (i.e., 0° < θ < 180°). We also derived the critical Reynolds numbers for the inertial instability using the asymptotic dispersion relations obtained from the WKBJ analysis. Using the asymptotic and numerical results, we propose a prescription for the effective turbulent viscosities induced by the inertial and inflectional instabilities that can be possibly used in stellar evolution models. The characteristic time of this turbulence is short enough so that it is efficient to redistribute angular momentum and to mix chemicals in stellar radiation zones.","lang":"eng"}]},{"date_published":"2021-06-07T00:00:00Z","article_type":"original","publication":"Astronomy & Astrophysics","citation":{"ama":"Bugnet LA, Prat V, Mathis S, et al. Magnetic signatures on mixed-mode frequencies: I. An axisymmetric fossil field inside the core of red giants. Astronomy & Astrophysics. 2021;650. doi:10.1051/0004-6361/202039159","apa":"Bugnet, L. A., Prat, V., Mathis, S., Astoul, A., Augustson, K., García, R. A., … Neiner, C. (2021). Magnetic signatures on mixed-mode frequencies: I. An axisymmetric fossil field inside the core of red giants. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039159","ieee":"L. A. Bugnet et al., “Magnetic signatures on mixed-mode frequencies: I. An axisymmetric fossil field inside the core of red giants,” Astronomy & Astrophysics, vol. 650. EDP Sciences, 2021.","ista":"Bugnet LA, Prat V, Mathis S, Astoul A, Augustson K, García RA, Mathur S, Amard L, Neiner C. 2021. Magnetic signatures on mixed-mode frequencies: I. An axisymmetric fossil field inside the core of red giants. Astronomy & Astrophysics. 650, A53.","short":"L.A. Bugnet, V. Prat, S. Mathis, A. Astoul, K. Augustson, R.A. García, S. Mathur, L. Amard, C. Neiner, Astronomy & Astrophysics 650 (2021).","mla":"Bugnet, Lisa Annabelle, et al. “Magnetic Signatures on Mixed-Mode Frequencies: I. An Axisymmetric Fossil Field inside the Core of Red Giants.” Astronomy & Astrophysics, vol. 650, A53, EDP Sciences, 2021, doi:10.1051/0004-6361/202039159.","chicago":"Bugnet, Lisa Annabelle, V. Prat, S. Mathis, A. Astoul, K. Augustson, R. A. García, S. Mathur, L. Amard, and C. Neiner. “Magnetic Signatures on Mixed-Mode Frequencies: I. An Axisymmetric Fossil Field inside the Core of Red Giants.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039159."},"day":"07","article_processing_charge":"No","keyword":["Space and Planetary Science","Astronomy and Astrophysics","stars","oscillations / stars","magnetic field / stars","interiors / stars","evolution / stars","rotation"],"scopus_import":"1","oa_version":"Preprint","status":"public","title":"Magnetic signatures on mixed-mode frequencies: I. An axisymmetric fossil field inside the core of red giants","intvolume":" 650","_id":"11605","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Context. The discovery of moderate differential rotation between the core and the envelope of evolved solar-like stars could be the signature of a strong magnetic field trapped inside the radiative interior. The population of intermediate-mass red giants presenting surprisingly low-amplitude mixed modes (i.e. oscillation modes that behave as acoustic modes in their external envelope and as gravity modes in their core) could also arise from the effect of an internal magnetic field. Indeed, stars more massive than about 1.1 solar masses are known to develop a convective core during their main sequence. The field generated by the dynamo triggered by this convection could be the progenitor of a strong fossil magnetic field trapped inside the core of the star for the remainder of its evolution.\r\n\r\nAims. Observations of mixed modes can constitute an excellent probe of the deepest layers of evolved solar-like stars, and magnetic fields in those regions can impact their propagation. The magnetic perturbation on mixed modes may therefore be visible in asteroseismic data. To unravel which constraints can be obtained from observations, we theoretically investigate the effects of a plausible mixed axisymmetric magnetic field with various amplitudes on the mixed-mode frequencies of evolved solar-like stars.\r\n\r\nMethods. First-order frequency perturbations due to an axisymmetric magnetic field were computed for dipolar and quadrupolar mixed modes. These computations were carried out for a range of stellar ages, masses, and metallicities.\r\n\r\nConclusions. We show that typical fossil-field strengths of 0.1 − 1 MG, consistent with the presence of a dynamo in the convective core during the main sequence, provoke significant asymmetries on mixed-mode frequency multiplets during the red giant branch. We provide constraints and methods for the detectability of such magnetic signatures. We show that these signatures may be detectable in asteroseismic data for field amplitudes small enough for the amplitude of the modes not to be affected by the conversion of gravity into Alfvén waves inside the magnetised interior. Finally, we infer an upper limit for the strength of the field and the associated lower limit for the timescale of its action in order to redistribute angular momentum in stellar interiors.","lang":"eng"}],"type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1051/0004-6361/202039159","quality_controlled":"1","oa":1,"external_id":{"arxiv":["2102.01216"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2102.01216"}],"month":"06","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"date_updated":"2022-08-19T10:06:33Z","date_created":"2022-07-18T12:10:59Z","volume":650,"author":[{"orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","last_name":"Bugnet","first_name":"Lisa Annabelle","full_name":"Bugnet, Lisa Annabelle"},{"full_name":"Prat, V.","first_name":"V.","last_name":"Prat"},{"first_name":"S.","last_name":"Mathis","full_name":"Mathis, S."},{"full_name":"Astoul, A.","first_name":"A.","last_name":"Astoul"},{"first_name":"K.","last_name":"Augustson","full_name":"Augustson, K."},{"full_name":"García, R. A.","last_name":"García","first_name":"R. A."},{"full_name":"Mathur, S.","first_name":"S.","last_name":"Mathur"},{"full_name":"Amard, L.","first_name":"L.","last_name":"Amard"},{"last_name":"Neiner","first_name":"C.","full_name":"Neiner, C."}],"publication_status":"published","publisher":"EDP Sciences","year":"2021","extern":"1","article_number":"A53"},{"publisher":"EDP Sciences","publication_status":"published","acknowledgement":"The authors thank the referee and Pr. J. Christensen-Dalsgaard for their very constructive comments and remarks that allowed us to improve the article. St. M., L. B., V. P., and K. A. acknowledge support from the European Research Council through ERC grant SPIRE 647383. All the members from CEA acknowledge support from GOLF and PLATO CNES grants of the Astrophysics Division at CEA. S. Mathur acknowledges support by the Ramon y Cajal fellowship number RYC-2015-17697. We made great use of the megyr python package for interfacing MESA and GYRE codes.","year":"2021","volume":647,"date_updated":"2022-08-19T10:11:52Z","date_created":"2022-07-18T12:15:27Z","author":[{"first_name":"S.","last_name":"Mathis","full_name":"Mathis, S."},{"last_name":"Bugnet","first_name":"Lisa Annabelle","orcid":"0000-0003-0142-4000","id":"d9edb345-f866-11ec-9b37-d119b5234501","full_name":"Bugnet, Lisa Annabelle"},{"full_name":"Prat, V.","last_name":"Prat","first_name":"V."},{"first_name":"K.","last_name":"Augustson","full_name":"Augustson, K."},{"last_name":"Mathur","first_name":"S.","full_name":"Mathur, S."},{"first_name":"R. A.","last_name":"Garcia","full_name":"Garcia, R. A."}],"article_number":"A122","extern":"1","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2012.11050"}],"external_id":{"arxiv":["2012.11050"]},"language":[{"iso":"eng"}],"doi":"10.1051/0004-6361/202039180","publication_identifier":{"eissn":["1432-0746"],"issn":["0004-6361"]},"month":"03","intvolume":" 647","title":"Probing the internal magnetism of stars using asymptotic magneto-asteroseismology","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11606","oa_version":"Preprint","type":"journal_article","abstract":[{"lang":"eng","text":"Context. Our knowledge of the dynamics of stars has undergone a revolution through the simultaneous large amount of high-quality photometric observations collected by space-based asteroseismology and ground-based high-precision spectropolarimetry. They allowed us to probe the internal rotation of stars and their surface magnetism in the whole Hertzsprung-Russell diagram. However, new methods should still be developed to probe the deep magnetic fields in these stars.\r\n\r\nAims. Our goal is to provide seismic diagnoses that allow us to probe the internal magnetism of stars.\r\n\r\nMethods. We focused on asymptotic low-frequency gravity modes and high-frequency acoustic modes. Using a first-order perturbative theory, we derived magnetic splittings of their frequencies as explicit functions of stellar parameters.\r\n\r\nResults. As in the case of rotation, we show that asymptotic gravity and acoustic modes can allow us to probe the different components of the magnetic field in the cavities in which they propagate. This again demonstrates the high potential of using mixed-modes when this is possible."}],"article_type":"original","citation":{"chicago":"Mathis, S., Lisa Annabelle Bugnet, V. Prat, K. Augustson, S. Mathur, and R. A. Garcia. “Probing the Internal Magnetism of Stars Using Asymptotic Magneto-Asteroseismology.” Astronomy & Astrophysics. EDP Sciences, 2021. https://doi.org/10.1051/0004-6361/202039180.","mla":"Mathis, S., et al. “Probing the Internal Magnetism of Stars Using Asymptotic Magneto-Asteroseismology.” Astronomy & Astrophysics, vol. 647, A122, EDP Sciences, 2021, doi:10.1051/0004-6361/202039180.","short":"S. Mathis, L.A. Bugnet, V. Prat, K. Augustson, S. Mathur, R.A. Garcia, Astronomy & Astrophysics 647 (2021).","ista":"Mathis S, Bugnet LA, Prat V, Augustson K, Mathur S, Garcia RA. 2021. Probing the internal magnetism of stars using asymptotic magneto-asteroseismology. Astronomy & Astrophysics. 647, A122.","ieee":"S. Mathis, L. A. Bugnet, V. Prat, K. Augustson, S. Mathur, and R. A. Garcia, “Probing the internal magnetism of stars using asymptotic magneto-asteroseismology,” Astronomy & Astrophysics, vol. 647. EDP Sciences, 2021.","apa":"Mathis, S., Bugnet, L. A., Prat, V., Augustson, K., Mathur, S., & Garcia, R. A. (2021). Probing the internal magnetism of stars using asymptotic magneto-asteroseismology. Astronomy & Astrophysics. EDP Sciences. https://doi.org/10.1051/0004-6361/202039180","ama":"Mathis S, Bugnet LA, Prat V, Augustson K, Mathur S, Garcia RA. Probing the internal magnetism of stars using asymptotic magneto-asteroseismology. Astronomy & Astrophysics. 2021;647. doi:10.1051/0004-6361/202039180"},"publication":"Astronomy & Astrophysics","date_published":"2021-03-18T00:00:00Z","keyword":["Space and Planetary Science","Astronomy and Astrophysics","asteroseismology / waves / stars","magnetic field / stars","oscillations / methods","analytical"],"scopus_import":"1","article_processing_charge":"No","day":"18"},{"year":"2021","_id":"11649","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On the complexity of weight-dynamic network algorithms","status":"public","publication_status":"published","publisher":"Institute of Electrical and Electronics Engineers","author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Paz, Ami","first_name":"Ami","last_name":"Paz"},{"full_name":"Schmid, Stefan","last_name":"Schmid","first_name":"Stefan"}],"date_created":"2022-07-25T11:13:06Z","date_updated":"2023-02-09T09:11:51Z","oa_version":"Preprint","type":"conference","abstract":[{"text":"While operating communication networks adaptively may improve utilization and performance, frequent adjustments also introduce an algorithmic challenge: the re-optimization of traffic engineering solutions is time-consuming and may limit the granularity at which a network can be adjusted. This paper is motivated by question whether the reactivity of a network can be improved by re-optimizing solutions dynamically rather than from scratch, especially if inputs such as link weights do not change significantly. This paper explores to what extent dynamic algorithms can be used to speed up fundamental tasks in network operations. We specifically investigate optimizations related to traffic engineering (namely shortest paths and maximum flow computations), but also consider spanning tree and matching applications. While prior work on dynamic graph algorithms focusses on link insertions and deletions, we are interested in the practical problem of link weight changes. We revisit existing upper bounds in the weight-dynamic model, and present several novel lower bounds on the amortized runtime for recomputing solutions. In general, we find that the potential performance gains depend on the application, and there are also strict limitations on what can be achieved, even if link weights change only slightly.","lang":"eng"}],"extern":"1","publication":"IFIP Networking Conference","external_id":{"arxiv":["2105.13172"]},"citation":{"chicago":"Henzinger, Monika H, Ami Paz, and Stefan Schmid. “On the Complexity of Weight-Dynamic Network Algorithms.” In IFIP Networking Conference. Institute of Electrical and Electronics Engineers, 2021. https://doi.org/10.23919/ifipnetworking52078.2021.9472803.","short":"M.H. Henzinger, A. Paz, S. Schmid, in:, IFIP Networking Conference, Institute of Electrical and Electronics Engineers, 2021.","mla":"Henzinger, Monika H., et al. “On the Complexity of Weight-Dynamic Network Algorithms.” IFIP Networking Conference, Institute of Electrical and Electronics Engineers, 2021, doi:10.23919/ifipnetworking52078.2021.9472803.","apa":"Henzinger, M. H., Paz, A., & Schmid, S. (2021). On the complexity of weight-dynamic network algorithms. In IFIP Networking Conference. Espoo and Helsinki, Finland: Institute of Electrical and Electronics Engineers. https://doi.org/10.23919/ifipnetworking52078.2021.9472803","ieee":"M. H. Henzinger, A. Paz, and S. Schmid, “On the complexity of weight-dynamic network algorithms,” in IFIP Networking Conference, Espoo and Helsinki, Finland, 2021.","ista":"Henzinger MH, Paz A, Schmid S. 2021. On the complexity of weight-dynamic network algorithms. IFIP Networking Conference. IFIP: Networking.","ama":"Henzinger MH, Paz A, Schmid S. On the complexity of weight-dynamic network algorithms. In: IFIP Networking Conference. Institute of Electrical and Electronics Engineers; 2021. doi:10.23919/ifipnetworking52078.2021.9472803"},"oa":1,"main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.2105.13172"}],"quality_controlled":"1","conference":{"name":"IFIP: Networking","start_date":"2021-06-21","location":" Espoo and Helsinki, Finland","end_date":"2021-06-24"},"doi":"10.23919/ifipnetworking52078.2021.9472803","date_published":"2021-06-21T00:00:00Z","language":[{"iso":"eng"}],"scopus_import":"1","month":"06","day":"21","publication_identifier":{"eissn":["1861-2288"]},"article_processing_charge":"No"},{"article_processing_charge":"No","day":"04","scopus_import":"1","date_published":"2021-10-04T00:00:00Z","article_type":"original","citation":{"mla":"Bernstein, Aaron, et al. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” ACM Transactions on Algorithms, vol. 17, no. 4, 29, Association for Computing Machinery, 2021, doi:10.1145/3469833.","short":"A. Bernstein, S. Forster, M.H. Henzinger, ACM Transactions on Algorithms 17 (2021).","chicago":"Bernstein, Aaron, Sebastian Forster, and Monika H Henzinger. “A Deamortization Approach for Dynamic Spanner and Dynamic Maximal Matching.” ACM Transactions on Algorithms. Association for Computing Machinery, 2021. https://doi.org/10.1145/3469833.","ama":"Bernstein A, Forster S, Henzinger MH. A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. 2021;17(4). doi:10.1145/3469833","ista":"Bernstein A, Forster S, Henzinger MH. 2021. A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. 17(4), 29.","ieee":"A. Bernstein, S. Forster, and M. H. Henzinger, “A deamortization approach for dynamic spanner and dynamic maximal matching,” ACM Transactions on Algorithms, vol. 17, no. 4. Association for Computing Machinery, 2021.","apa":"Bernstein, A., Forster, S., & Henzinger, M. H. (2021). A deamortization approach for dynamic spanner and dynamic maximal matching. ACM Transactions on Algorithms. Association for Computing Machinery. https://doi.org/10.1145/3469833"},"publication":"ACM Transactions on Algorithms","issue":"4","abstract":[{"text":"Many dynamic graph algorithms have an amortized update time, rather than a stronger worst-case guarantee. But amortized data structures are not suitable for real-time systems, where each individual operation has to be executed quickly. For this reason, there exist many recent randomized results that aim to provide a guarantee stronger than amortized expected. The strongest possible guarantee for a randomized algorithm is that it is always correct (Las Vegas) and has high-probability worst-case update time, which gives a bound on the time for each individual operation that holds with high probability.\r\n\r\nIn this article, we present the first polylogarithmic high-probability worst-case time bounds for the dynamic spanner and the dynamic maximal matching problem.\r\n\r\n(1)\r\n\r\nFor dynamic spanner, the only known o(n) worst-case bounds were O(n3/4) high-probability worst-case update time for maintaining a 3-spanner and O(n5/9) for maintaining a 5-spanner. We give a O(1)k log3 (n) high-probability worst-case time bound for maintaining a (2k-1)-spanner, which yields the first worst-case polylog update time for all constant k. (All the results above maintain the optimal tradeoff of stretch 2k-1 and Õ(n1+1/k) edges.)\r\n\r\n(2)\r\n\r\nFor dynamic maximal matching, or dynamic 2-approximate maximum matching, no algorithm with o(n) worst-case time bound was known and we present an algorithm with O(log 5 (n)) high-probability worst-case time; similar worst-case bounds existed only for maintaining a matching that was (2+ϵ)-approximate, and hence not maximal.\r\n\r\nOur results are achieved using a new approach for converting amortized guarantees to worst-case ones for randomized data structures by going through a third type of guarantee, which is a middle ground between the two above: An algorithm is said to have worst-case expected update time ɑ if for every update σ, the expected time to process σ is at most ɑ. Although stronger than amortized expected, the worst-case expected guarantee does not resolve the fundamental problem of amortization: A worst-case expected update time of O(1) still allows for the possibility that every 1/f(n) updates requires ϴ (f(n)) time to process, for arbitrarily high f(n). In this article, we present a black-box reduction that converts any data structure with worst-case expected update time into one with a high-probability worst-case update time: The query time remains the same, while the update time increases by a factor of O(log 2(n)).\r\n\r\nThus, we achieve our results in two steps:\r\n\r\n(1) First, we show how to convert existing dynamic graph algorithms with amortized expected polylogarithmic running times into algorithms with worst-case expected polylogarithmic running times.\r\n\r\n(2) Then, we use our black-box reduction to achieve the polylogarithmic high-probability worst-case time bound. All our algorithms are Las-Vegas-type algorithms.","lang":"eng"}],"type":"journal_article","oa_version":"Preprint","intvolume":" 17","title":"A deamortization approach for dynamic spanner and dynamic maximal matching","status":"public","_id":"11663","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["1549-6325"],"eissn":["1549-6333"]},"month":"10","language":[{"iso":"eng"}],"doi":"10.1145/3469833","quality_controlled":"1","external_id":{"arxiv":["1810.10932"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/1810.10932","open_access":"1"}],"extern":"1","article_number":"29","volume":17,"date_created":"2022-07-27T11:09:06Z","date_updated":"2022-09-09T11:35:44Z","author":[{"full_name":"Bernstein, Aaron","first_name":"Aaron","last_name":"Bernstein"},{"full_name":"Forster, Sebastian","first_name":"Sebastian","last_name":"Forster"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"}],"publisher":"Association for Computing Machinery","publication_status":"published","year":"2021","acknowledgement":"The conference version of this article [10] had an error in the analysis of the dynamic matching algorithm. In particular, Lemma 4.5 assumed an independence between adversarial updates to the hierarchy that is in fact true, but which requires a sophisticated proof. We are very grateful to the anonymous reviewers of Transactions on Algorithms for pointing out this mistake in our analysis. The mistake is fixed in Section 4.5. Almost the entire fix is a matter of analysis: the only change to the algorithm itself is the introduction of responsible bits in Algorithm 2. The first author would like to thank Mikkel Thorup and Alan Roytman for a very helpful discussion of the proof of Theorem 1.1."},{"publication_identifier":{"issn":["0890-5401"]},"month":"12","doi":"10.1016/j.ic.2021.104805","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["2011.00977"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2011.00977"}],"quality_controlled":"1","extern":"1","article_number":"104805","author":[{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Peng, Pan","last_name":"Peng","first_name":"Pan"}],"volume":281,"date_updated":"2022-09-12T09:29:29Z","date_created":"2022-08-08T10:58:29Z","year":"2021","publisher":"Elsevier","publication_status":"published","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2021-12-01T00:00:00Z","citation":{"chicago":"Henzinger, Monika H, and Pan Peng. “Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest.” Information and Computation. Elsevier, 2021. https://doi.org/10.1016/j.ic.2021.104805.","mla":"Henzinger, Monika H., and Pan Peng. “Constant-Time Dynamic Weight Approximation for Minimum Spanning Forest.” Information and Computation, vol. 281, no. 12, 104805, Elsevier, 2021, doi:10.1016/j.ic.2021.104805.","short":"M.H. Henzinger, P. Peng, Information and Computation 281 (2021).","ista":"Henzinger MH, Peng P. 2021. Constant-time dynamic weight approximation for minimum spanning forest. Information and Computation. 281(12), 104805.","apa":"Henzinger, M. H., & Peng, P. (2021). Constant-time dynamic weight approximation for minimum spanning forest. Information and Computation. Elsevier. https://doi.org/10.1016/j.ic.2021.104805","ieee":"M. H. Henzinger and P. Peng, “Constant-time dynamic weight approximation for minimum spanning forest,” Information and Computation, vol. 281, no. 12. Elsevier, 2021.","ama":"Henzinger MH, Peng P. Constant-time dynamic weight approximation for minimum spanning forest. Information and Computation. 2021;281(12). doi:10.1016/j.ic.2021.104805"},"publication":"Information and Computation","article_type":"original","issue":"12","abstract":[{"lang":"eng","text":"We give two fully dynamic algorithms that maintain a (1 + ε)-approximation of the weight M of a minimum spanning forest (MSF) of an n-node graph G with edges weights in [1, W ], for any ε > 0. (1) Our deterministic algorithm takes O (W 2 log W /ε3) worst-case update time, which is O (1) if both W and ε are constants. (2) Our randomized (Monte-Carlo style) algorithm works with high probability and runs in worst-case O (log W /ε4) update time if W = O ((m∗)1/6/log2/3 n), where m∗ is the minimum number of edges in the graph throughout all the updates. It works even against an adaptive adversary. We complement our algorithmic results with two cell-probe lower bounds for dynamically maintaining an approximation of the weight of an MSF of a graph."}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11756","intvolume":" 281","title":"Constant-time dynamic weight approximation for minimum spanning forest","status":"public"},{"day":"09","article_processing_charge":"No","scopus_import":"1","date_published":"2021-08-09T00:00:00Z","page":"471–484","publication":"17th International Symposium on Algorithms and Data Structures","citation":{"ista":"Henzinger MH, Wu X. 2021. Upper and lower bounds for fully retroactive graph problems. 17th International Symposium on Algorithms and Data Structures. WADS: Workshop on Algorithms and Data Structures, LNCS, vol. 12808, 471–484.","ieee":"M. H. Henzinger and X. Wu, “Upper and lower bounds for fully retroactive graph problems,” in 17th International Symposium on Algorithms and Data Structures, Virtual, 2021, vol. 12808, pp. 471–484.","apa":"Henzinger, M. H., & Wu, X. (2021). Upper and lower bounds for fully retroactive graph problems. In 17th International Symposium on Algorithms and Data Structures (Vol. 12808, pp. 471–484). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-83508-8_34","ama":"Henzinger MH, Wu X. Upper and lower bounds for fully retroactive graph problems. In: 17th International Symposium on Algorithms and Data Structures. Vol 12808. Springer Nature; 2021:471–484. doi:10.1007/978-3-030-83508-8_34","chicago":"Henzinger, Monika H, and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive Graph Problems.” In 17th International Symposium on Algorithms and Data Structures, 12808:471–484. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-83508-8_34.","mla":"Henzinger, Monika H., and Xiaowei Wu. “Upper and Lower Bounds for Fully Retroactive Graph Problems.” 17th International Symposium on Algorithms and Data Structures, vol. 12808, Springer Nature, 2021, pp. 471–484, doi:10.1007/978-3-030-83508-8_34.","short":"M.H. Henzinger, X. Wu, in:, 17th International Symposium on Algorithms and Data Structures, Springer Nature, 2021, pp. 471–484."},"abstract":[{"lang":"eng","text":"Classic dynamic data structure problems maintain a data structure subject to a sequence S of updates and they answer queries using the latest version of the data structure, i.e., the data structure after processing the whole sequence. To handle operations that change the sequence S of updates, Demaine et al. [7] introduced retroactive data structures (RDS). A retroactive operation modifies the update sequence S in a given position t, called time, and either creates or cancels an update in S at time t. A fully retroactive data structure supports queries at any time t: a query at time t is answered using only the updates of S up to time t. While efficient RDS have been proposed for classic data structures, e.g., stack, priority queue and binary search tree, the retroactive version of graph problems are rarely studied.\r\n\r\nIn this paper we study retroactive graph problems including connectivity, minimum spanning forest (MSF), maximum degree, etc. We show that under the OMv conjecture (proposed by Henzinger et al. [15]), there does not exist fully RDS maintaining connectivity or MSF, or incremental fully RDS maintaining the maximum degree with 𝑂(𝑛1−𝜖) time per operation, for any constant 𝜖>0. Furthermore, We provide RDS with almost tight time per operation. We give fully RDS for maintaining the maximum degree, connectivity and MSF in 𝑂̃ (𝑛) time per operation. We also give an algorithm for the incremental (insertion-only) fully retroactive connectivity with 𝑂̃ (1) time per operation, showing that the lower bound cannot be extended to this setting.\r\n\r\nWe also study a restricted version of RDS, where the only change to S is the swap of neighboring updates and show that for this problem we can beat the above hardness result. This also implies the first non-trivial dynamic Reeb graph computation algorithm."}],"alternative_title":["LNCS"],"type":"conference","oa_version":"Preprint","title":"Upper and lower bounds for fully retroactive graph problems","status":"public","intvolume":" 12808","_id":"11771","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"08","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783030835088"],"eissn":["1611-3349"],"isbn":["9783030835071"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2021-08-11","location":"Virtual","start_date":"2021-08-09","name":"WADS: Workshop on Algorithms and Data Structures"},"doi":"10.1007/978-3-030-83508-8_34","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1910.03332"}],"external_id":{"arxiv":["1910.03332"]},"oa":1,"extern":"1","date_created":"2022-08-08T13:01:29Z","date_updated":"2023-02-10T08:31:50Z","volume":12808,"author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Xiaowei","last_name":"Wu","full_name":"Wu, Xiaowei"}],"publication_status":"published","publisher":"Springer Nature","year":"2021"},{"article_number":"42","extern":"1","publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","year":"2021","volume":204,"date_updated":"2023-02-14T08:28:56Z","date_created":"2022-08-12T07:04:44Z","author":[{"first_name":"Hendrik","last_name":"Fichtenberger","full_name":"Fichtenberger, Hendrik"},{"full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530"},{"full_name":"Ost, Wolfgang","first_name":"Wolfgang","last_name":"Ost"}],"publication_identifier":{"isbn":["9783959772044"],"issn":["1868-8969"]},"month":"08","quality_controlled":"1","external_id":{"arxiv":["2106.14756"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.4230/LIPIcs.ESA.2021.42"}],"language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.ESA.2021.42","conference":{"location":"Lisbon, Portual","start_date":"2021-09-06","end_date":"2021-09-08","name":"ESA: Annual European Symposium on Algorithms"},"alternative_title":["LIPIcs"],"type":"conference","abstract":[{"text":"Differentially private algorithms protect individuals in data analysis scenarios by ensuring that there is only a weak correlation between the existence of the user in the data and the result of the analysis. Dynamic graph algorithms maintain the solution to a problem (e.g., a matching) on an evolving input, i.e., a graph where nodes or edges are inserted or deleted over time. They output the value of the solution after each update operation, i.e., continuously. We study (event-level and user-level) differentially private algorithms for graph problems under continual observation, i.e., differentially private dynamic graph algorithms. We present event-level private algorithms for partially dynamic counting-based problems such as triangle count that improve the additive error by a polynomial factor (in the length T of the update sequence) on the state of the art, resulting in the first algorithms with additive error polylogarithmic in T.\r\nWe also give ε-differentially private and partially dynamic algorithms for minimum spanning tree, minimum cut, densest subgraph, and maximum matching. The additive error of our improved MST algorithm is O(W log^{3/2}T / ε), where W is the maximum weight of any edge, which, as we show, is tight up to a (√{log T} / ε)-factor. For the other problems, we present a partially-dynamic algorithm with multiplicative error (1+β) for any constant β > 0 and additive error O(W log(nW) log(T) / (ε β)). Finally, we show that the additive error for a broad class of dynamic graph algorithms with user-level privacy must be linear in the value of the output solution’s range.","lang":"eng"}],"intvolume":" 204","status":"public","title":"Differentially private algorithms for graphs under continual observation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11814","oa_version":"Published Version","scopus_import":"1","article_processing_charge":"No","day":"31","citation":{"ama":"Fichtenberger H, Henzinger MH, Ost W. Differentially private algorithms for graphs under continual observation. In: 29th Annual European Symposium on Algorithms. Vol 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.ESA.2021.42","ieee":"H. Fichtenberger, M. H. Henzinger, and W. Ost, “Differentially private algorithms for graphs under continual observation,” in 29th Annual European Symposium on Algorithms, Lisbon, Portual, 2021, vol. 204.","apa":"Fichtenberger, H., Henzinger, M. H., & Ost, W. (2021). Differentially private algorithms for graphs under continual observation. In 29th Annual European Symposium on Algorithms (Vol. 204). Lisbon, Portual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.ESA.2021.42","ista":"Fichtenberger H, Henzinger MH, Ost W. 2021. Differentially private algorithms for graphs under continual observation. 29th Annual European Symposium on Algorithms. ESA: Annual European Symposium on Algorithms, LIPIcs, vol. 204, 42.","short":"H. Fichtenberger, M.H. Henzinger, W. Ost, in:, 29th Annual European Symposium on Algorithms, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","mla":"Fichtenberger, Hendrik, et al. “Differentially Private Algorithms for Graphs under Continual Observation.” 29th Annual European Symposium on Algorithms, vol. 204, 42, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.ESA.2021.42.","chicago":"Fichtenberger, Hendrik, Monika H Henzinger, and Wolfgang Ost. “Differentially Private Algorithms for Graphs under Continual Observation.” In 29th Annual European Symposium on Algorithms, Vol. 204. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.ESA.2021.42."},"publication":"29th Annual European Symposium on Algorithms","date_published":"2021-08-31T00:00:00Z"},{"extern":"1","author":[{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","full_name":"Henzinger, Monika H"},{"first_name":"Sebastian","last_name":"Krinninger","full_name":"Krinninger, Sebastian"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"}],"volume":50,"date_created":"2022-08-17T07:54:45Z","date_updated":"2023-02-17T14:12:49Z","year":"2021","publisher":"Society for Industrial & Applied Mathematics","publication_status":"published","publication_identifier":{"issn":["0097-5397"],"eissn":["1095-7111"]},"month":"05","doi":"10.1137/16m1097808","language":[{"iso":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1504.07056"}],"external_id":{"arxiv":["1504.07056"]},"oa":1,"quality_controlled":"1","issue":"3","abstract":[{"lang":"eng","text":"We present a deterministic (1+𝑜(1))-approximation (𝑛1/2+𝑜(1)+𝐷1+𝑜(1))-time algorithm for solving the single-source shortest paths problem on distributed weighted networks (the \\sf CONGEST model); here 𝑛 is the number of nodes in the network, 𝐷 is its (hop) diameter, and edge weights are positive integers from 1 to poly(𝑛). This is the first nontrivial deterministic algorithm for this problem. It also improves (i) the running time of the randomized (1+𝑜(1))-approximation 𝑂̃ (𝑛√𝐷1/4+𝐷)-time algorithm of Nanongkai [in Proceedings of STOC, 2014, pp. 565--573] by a factor of as large as 𝑛1/8, and (ii) the 𝑂(𝜖−1log𝜖−1)-approximation factor of Lenzen and Patt-Shamir's 𝑂̃ (𝑛1/2+𝜖+𝐷)-time algorithm [in Proceedings of STOC, 2013, pp. 381--390] within the same running time. (Throughout, we use 𝑂̃ (⋅) to hide polylogarithmic factors in 𝑛.) Our running time matches the known time lower bound of Ω(𝑛/log𝑛‾‾‾‾‾‾‾√+𝐷) [M. Elkin, SIAM J. Comput., 36 (2006), pp. 433--456], thus essentially settling the status of this problem which was raised at least a decade ago [M. Elkin, SIGACT News, 35 (2004), pp. 40--57]. It also implies a (2+𝑜(1))-approximation (𝑛1/2+𝑜(1)+𝐷1+𝑜(1))-time algorithm for approximating a network's weighted diameter which almost matches the lower bound by Holzer and Pinsker [in Proceedings of OPODIS, 2015, Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, Germany, 2016, 6]. In achieving this result, we develop two techniques which might be of independent interest and useful in other settings: (i) a deterministic process that replaces the “hitting set argument” commonly used for shortest paths computation in various settings, and (ii) a simple, deterministic construction of an (𝑛𝑜(1),𝑜(1))-hop set of size 𝑛1+𝑜(1). We combine these techniques with many distributed algorithmic techniques, some of which are from problems that are not directly related to shortest paths, e.g., ruling sets [A. V. Goldberg, S. A. Plotkin, and G. E. Shannon, SIAM J. Discrete Math., 1 (1988), pp. 434--446], source detection [C. Lenzen and D. Peleg, in Proceedings of PODC, 2013, pp. 375--382], and partial distance estimation [C. Lenzen and B. Patt-Shamir, in Proceedings of PODC, 2015, pp. 153--162]. Our hop set construction also leads to single-source shortest paths algorithms in two other settings: (i) a (1+𝑜(1))-approximation 𝑛𝑜(1)-time algorithm on congested cliques, and (ii) a (1+𝑜(1))-approximation 𝑛𝑜(1)-pass 𝑛1+𝑜(1)-space streaming algorithm. The first result answers an open problem in [D. Nanongkai, in Proceedings of STOC, 2014, pp. 565--573]. The second result partially answers an open problem raised by McGregor in 2006 [List of Open Problems in Sublinear Algorithms: Problem 14]."}],"type":"journal_article","oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11886","intvolume":" 50","title":"A deterministic almost-tight distributed algorithm for approximating single-source shortest paths","status":"public","article_processing_charge":"No","day":"01","scopus_import":"1","date_published":"2021-05-01T00:00:00Z","citation":{"chicago":"Henzinger, Monika H, Sebastian Krinninger, and Danupon Nanongkai. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” SIAM Journal on Computing. Society for Industrial & Applied Mathematics, 2021. https://doi.org/10.1137/16m1097808.","mla":"Henzinger, Monika H., et al. “A Deterministic Almost-Tight Distributed Algorithm for Approximating Single-Source Shortest Paths.” SIAM Journal on Computing, vol. 50, no. 3, Society for Industrial & Applied Mathematics, 2021, pp. STOC16-98-STOC16-137, doi:10.1137/16m1097808.","short":"M.H. Henzinger, S. Krinninger, D. Nanongkai, SIAM Journal on Computing 50 (2021) STOC16-98-STOC16-137.","ista":"Henzinger MH, Krinninger S, Nanongkai D. 2021. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 50(3), STOC16-98-STOC16-137.","ieee":"M. H. Henzinger, S. Krinninger, and D. Nanongkai, “A deterministic almost-tight distributed algorithm for approximating single-source shortest paths,” SIAM Journal on Computing, vol. 50, no. 3. Society for Industrial & Applied Mathematics, pp. STOC16-98-STOC16-137, 2021.","apa":"Henzinger, M. H., Krinninger, S., & Nanongkai, D. (2021). A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. Society for Industrial & Applied Mathematics. https://doi.org/10.1137/16m1097808","ama":"Henzinger MH, Krinninger S, Nanongkai D. A deterministic almost-tight distributed algorithm for approximating single-source shortest paths. SIAM Journal on Computing. 2021;50(3):STOC16-98-STOC16-137. doi:10.1137/16m1097808"},"publication":"SIAM Journal on Computing","page":"STOC16-98-STOC16-137","article_type":"original"},{"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2010.10134"}],"oa":1,"citation":{"mla":"Bergamaschi, Thiago, et al. “New Techniques and Fine-Grained Hardness for Dynamic near-Additive Spanners.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 1836–55, doi:10.1137/1.9781611976465.110.","short":"T. Bergamaschi, M.H. Henzinger, M.P. Gutenberg, V.V. Williams, N. Wein, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 1836–1855.","chicago":"Bergamaschi, Thiago, Monika H Henzinger, Maximilian Probst Gutenberg, Virginia Vassilevska Williams, and Nicole Wein. “New Techniques and Fine-Grained Hardness for Dynamic near-Additive Spanners.” In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, 1836–55. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.110.","ama":"Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. New techniques and fine-grained hardness for dynamic near-additive spanners. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:1836-1855. doi:10.1137/1.9781611976465.110","ista":"Bergamaschi T, Henzinger MH, Gutenberg MP, Williams VV, Wein N. 2021. New techniques and fine-grained hardness for dynamic near-additive spanners. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 1836–1855.","apa":"Bergamaschi, T., Henzinger, M. H., Gutenberg, M. P., Williams, V. V., & Wein, N. (2021). New techniques and fine-grained hardness for dynamic near-additive spanners. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 1836–1855). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.110","ieee":"T. Bergamaschi, M. H. Henzinger, M. P. Gutenberg, V. V. Williams, and N. Wein, “New techniques and fine-grained hardness for dynamic near-additive spanners,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 1836–1855."},"external_id":{"arxiv":["2010.10134"]},"publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","page":"1836-1855","quality_controlled":"1","doi":"10.1137/1.9781611976465.110","date_published":"2021-01-01T00:00:00Z","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2021-01-13","location":"Alexandria, VA, United States","start_date":"2021-01-10"},"language":[{"iso":"eng"}],"scopus_import":"1","article_processing_charge":"No","publication_identifier":{"eisbn":["978-1-61197-646-5"]},"day":"01","month":"01","year":"2021","_id":"11919","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Society for Industrial and Applied Mathematics","publication_status":"published","status":"public","title":"New techniques and fine-grained hardness for dynamic near-additive spanners","author":[{"first_name":"Thiago","last_name":"Bergamaschi","full_name":"Bergamaschi, Thiago"},{"full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger"},{"full_name":"Gutenberg, Maximilian Probst","first_name":"Maximilian Probst","last_name":"Gutenberg"},{"full_name":"Williams, Virginia Vassilevska","first_name":"Virginia Vassilevska","last_name":"Williams"},{"last_name":"Wein","first_name":"Nicole","full_name":"Wein, Nicole"}],"oa_version":"Preprint","date_created":"2022-08-18T07:37:36Z","date_updated":"2023-02-17T11:28:46Z","type":"conference","abstract":[{"lang":"eng","text":"Maintaining and updating shortest paths information in a graph is a fundamental problem with many applications. As computations on dense graphs can be prohibitively expensive, and it is preferable to perform the computations on a sparse skeleton of the given graph that roughly preserves the shortest paths information. Spanners and emulators serve this purpose. Unfortunately, very little is known about dynamically maintaining sparse spanners and emulators as the graph is modified by a sequence of edge insertions and deletions. This paper develops fast dynamic algorithms for spanner and emulator maintenance and provides evidence from fine-grained complexity that these algorithms are tight. For unweighted undirected m-edge n-node graphs we obtain the following results.\r\n\r\nUnder the popular OMv conjecture, there can be no decremental or incremental algorithm that maintains an n1+o(1) edge (purely additive) +nδ-emulator for any δ < 1/2 with arbitrary polynomial preprocessing time and total update time m1+o(1). Also, under the Combinatorial k-Clique hypothesis, any fully dynamic combinatorial algorithm that maintains an n1+o(1) edge (1 + ∊, no(1))-spanner or emulator for small ∊ must either have preprocessing time mn1–o(1) or amortized update time m1–o(1). Both of our conditional lower bounds are tight.\r\n\r\nAs the above fully dynamic lower bound only applies to combinatorial algorithms, we also develop an algebraic spanner algorithm that improves over the m1–o(1) update time for dense graphs. For any constant ∊ ∊ (0, 1], there is a fully dynamic algorithm with worst-case update time O(n1.529) that whp maintains an n1+o(1) edge (1 + ∊, no(1))-spanner.\r\n\r\nOur new algebraic techniques allow us to also obtain a new fully dynamic algorithm for All-Pairs Shortest Paths (APSP) that can perform both edge updates and can report shortest paths in worst-case time O(n1.9), which are correct whp. This is the first path-reporting fully dynamic APSP algorithm with a truly subquadratic query time that beats O(n2.5) update time. It works against an oblivious adversary.\r\n\r\nFinally, we give two applications of our new dynamic spanner algorithms: (1) a fully dynamic (1 + ∊)-approximate APSP algorithm with update time O(n1.529) that can report approximate shortest paths in n1+o(1) time per query; previous subquadratic update/query algorithms could only report the distance, but not obtain the paths; (2) a fully dynamic algorithm for near-2-approximate Steiner tree maintenance with both terminal and edge updates."}],"extern":"1"},{"abstract":[{"lang":"eng","text":"We consider the following online optimization problem. We are given a graph G and each vertex of the graph is assigned to one of ℓ servers, where servers have capacity k and we assume that the graph has ℓ · k vertices. Initially, G does not contain any edges and then the edges of G are revealed one-by-one. The goal is to design an online algorithm ONL, which always places the connected components induced by the revealed edges on the same server and never exceeds the server capacities by more than ∊k for constant ∊ > 0. Whenever ONL learns about a new edge, the algorithm is allowed to move vertices from one server to another. Its objective is to minimize the number of vertex moves. More specifically, ONL should minimize the competitive ratio: the total cost ONL incurs compared to an optimal offline algorithm OPT.\r\n\r\nThe problem was recently introduced by Henzinger et al. (SIGMETRICS'2019) and is related to classic online problems such as online paging and scheduling. It finds applications in the context of resource allocation in the cloud and for optimizing distributed data structures such as union–find data structures.\r\n\r\nOur main contribution is a polynomial-time randomized algorithm, that is asymptotically optimal: we derive an upper bound of O(log ℓ + log k) on its competitive ratio and show that no randomized online algorithm can achieve a competitive ratio of less than Ω(log ℓ + log k). We also settle the open problem of the achievable competitive ratio by deterministic online algorithms, by deriving a competitive ratio of Θ(ℓ log k); to this end, we present an improved lower bound as well as a deterministic polynomial-time online algorithm.\r\n\r\nOur algorithms rely on a novel technique which combines efficient integer programming with a combinatorial approach for maintaining ILP solutions. More precisely, we use an ILP to assign the connected components induced by the revealed edges to the servers; this is similar to existing approximation schemes for scheduling algorithms. However, we cannot obtain our competitive ratios if we run the ILP after each edge insertion. Instead, we identify certain types of edge insertions, after which we can manually obtain an optimal ILP solution at zero cost without resolving the ILP. We believe this technique is of independent interest and will find further applications in the future."}],"extern":"1","type":"conference","author":[{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Neumann, Stefan","last_name":"Neumann","first_name":"Stefan"},{"full_name":"Räcke, Harald","first_name":"Harald","last_name":"Räcke"},{"first_name":"Stefan","last_name":"Schmid","full_name":"Schmid, Stefan"}],"date_updated":"2023-02-17T11:32:38Z","date_created":"2022-08-18T10:31:58Z","oa_version":"Preprint","year":"2021","_id":"11923","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Tight bounds for online graph partitioning","status":"public","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics","day":"01","month":"01","publication_identifier":{"eisbn":["978-161197646-5"]},"article_processing_charge":"No","scopus_import":"1","conference":{"location":"Alexandria, VA, United States","start_date":"2021-01-10","end_date":"2021-01-13","name":"SODA: Symposium on Discrete Algorithms"},"date_published":"2021-01-01T00:00:00Z","doi":"10.1137/1.9781611976465.166","language":[{"iso":"eng"}],"publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","external_id":{"arxiv":["2011.01017"]},"citation":{"short":"M.H. Henzinger, S. Neumann, H. Räcke, S. Schmid, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2799–2818.","mla":"Henzinger, Monika H., et al. “Tight Bounds for Online Graph Partitioning.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2799–818, doi:10.1137/1.9781611976465.166.","chicago":"Henzinger, Monika H, Stefan Neumann, Harald Räcke, and Stefan Schmid. “Tight Bounds for Online Graph Partitioning.” In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2799–2818. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.166.","ama":"Henzinger MH, Neumann S, Räcke H, Schmid S. Tight bounds for online graph partitioning. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:2799-2818. doi:10.1137/1.9781611976465.166","ieee":"M. H. Henzinger, S. Neumann, H. Räcke, and S. Schmid, “Tight bounds for online graph partitioning,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2799–2818.","apa":"Henzinger, M. H., Neumann, S., Räcke, H., & Schmid, S. (2021). Tight bounds for online graph partitioning. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2799–2818). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.166","ista":"Henzinger MH, Neumann S, Räcke H, Schmid S. 2021. Tight bounds for online graph partitioning. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2799–2818."},"main_file_link":[{"url":"https://arxiv.org/abs/2011.01017","open_access":"1"}],"oa":1,"quality_controlled":"1","page":"2799-2818"},{"language":[{"iso":"eng"}],"conference":{"end_date":"2021-01-13","location":"Alexandria, VA, United States","start_date":"2021-01-10","name":"SODA: Symposium on Discrete Algorithms"},"date_published":"2021-01-01T00:00:00Z","doi":"10.1137/1.9781611976465.150","quality_controlled":"1","page":"2537-2549","publication":"32nd Annual ACM-SIAM Symposium on Discrete Algorithms","main_file_link":[{"url":"https://arxiv.org/abs/2002.11171","open_access":"1"}],"external_id":{"arxiv":["2002.11171"]},"citation":{"mla":"Bhattacharya, Sayan, et al. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–49, doi:10.1137/1.9781611976465.150.","short":"S. Bhattacharya, M.H. Henzinger, D. Nanongkai, X. Wu, in:, 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Society for Industrial and Applied Mathematics, 2021, pp. 2537–2549.","chicago":"Bhattacharya, Sayan, Monika H Henzinger, Danupon Nanongkai, and Xiaowei Wu. “Dynamic Set Cover: Improved Amortized and Worst-Case Update Time.” In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, 2537–49. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976465.150.","ama":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. Dynamic set cover: Improved amortized and worst-case update time. In: 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. Society for Industrial and Applied Mathematics; 2021:2537-2549. doi:10.1137/1.9781611976465.150","ista":"Bhattacharya S, Henzinger MH, Nanongkai D, Wu X. 2021. Dynamic set cover: Improved amortized and worst-case update time. 32nd Annual ACM-SIAM Symposium on Discrete Algorithms. SODA: Symposium on Discrete Algorithms, 2537–2549.","ieee":"S. Bhattacharya, M. H. Henzinger, D. Nanongkai, and X. Wu, “Dynamic set cover: Improved amortized and worst-case update time,” in 32nd Annual ACM-SIAM Symposium on Discrete Algorithms, Alexandria, VA, United States, 2021, pp. 2537–2549.","apa":"Bhattacharya, S., Henzinger, M. H., Nanongkai, D., & Wu, X. (2021). Dynamic set cover: Improved amortized and worst-case update time. In 32nd Annual ACM-SIAM Symposium on Discrete Algorithms (pp. 2537–2549). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976465.150"},"oa":1,"month":"01","day":"01","publication_identifier":{"eisbn":["978-1-61197-646-5"]},"article_processing_charge":"No","scopus_import":"1","date_created":"2022-08-18T07:46:54Z","date_updated":"2023-02-17T11:31:22Z","oa_version":"Preprint","author":[{"first_name":"Sayan","last_name":"Bhattacharya","full_name":"Bhattacharya, Sayan"},{"last_name":"Henzinger","first_name":"Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"first_name":"Danupon","last_name":"Nanongkai","full_name":"Nanongkai, Danupon"},{"last_name":"Wu","first_name":"Xiaowei","full_name":"Wu, Xiaowei"}],"publication_status":"published","status":"public","title":"Dynamic set cover: Improved amortized and worst-case update time","publisher":"Society for Industrial and Applied Mathematics","_id":"11920","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","extern":"1","abstract":[{"text":"In the dynamic minimum set cover problem, a challenge is to minimize the update time while guaranteeing close to the optimal min(O(log n), f) approximation factor. (Throughout, m, n, f, and C are parameters denoting the maximum number of sets, number of elements, frequency, and the cost range.) In the high-frequency range, when f = Ω(log n), this was achieved by a deterministic O(log n)-approximation algorithm with O(f log n) amortized update time [Gupta et al. STOC'17]. In the low-frequency range, the line of work by Gupta et al. [STOC'17], Abboud et al. [STOC'19], and Bhattacharya et al. [ICALP'15, IPCO'17, FOCS'19] led to a deterministic (1 + ∊) f-approximation algorithm with O(f log(Cn)/∊2) amortized update time. In this paper we improve the latter update time and provide the first bounds that subsume (and sometimes improve) the state-of-the-art dynamic vertex cover algorithms. We obtain: (1) (1 + ∊) f-approximation ratio in O(f log2(Cn)/∊3) worst-case update time: No non-trivial worst-case update time was previously known for dynamic set cover. Our bound subsumes and improves by a logarithmic factor the O(log3 n/poly(∊)) worst-case update time for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1) by Bhattacharya et al. [SODA'17]. (2) (1 + ∊) f-approximation ratio in O ((f2/∊3) + (f/∊2) log C) amortized update time: This result improves the previous O(f log (Cn)/∊2) update time bound for most values of f in the low-frequency range, i.e. whenever f = o(log n). It is the first that is independent of m and n. It subsumes the constant amortized update time of Bhattacharya and Kulkarni [SODA'19] for unweighted dynamic vertex cover (i.e., when f = 2 and C = 1). These results are achieved by leveraging the approximate complementary slackness and background schedulers techniques. These techniques were used in the local update scheme for dynamic vertex cover. Our main technical contribution is to adapt these techniques within the global update scheme of Bhattacharya et al. [FOCS'19] for the dynamic set cover problem.","lang":"eng"}],"type":"conference"},{"extern":"1","abstract":[{"text":"Clustering is one of the most fundamental problems in unsupervised learning with a large number of applications. However, classical clustering algorithms assume that the data is static, thus failing to capture many real-world applications where data is constantly changing and evolving. Driven by this, we study the metric k-center clustering problem in the fully dynamic setting, where the goal is to efficiently maintain a clustering while supporting an intermixed sequence of insertions and deletions of points. This model also supports queries of the form (1) report whether a given point is a center or (2) determine the cluster a point is assigned to. We present a deterministic dynamic algorithm for the k-center clustering problem that provably achieves a (2 + ∊)-approximation in nearly logarithmic update and query time, if the underlying metric has bounded doubling dimension, its aspect ratio is bounded by a polynomial and ∊ is a constant. An important feature of our algorithm is that the update and query times are independent of k. We confirm the practical relevance of this feature via an extensive experimental study which shows that for large values of k, our algorithmic construction outperforms the state-of-the-art algorithm in terms of solution quality and running time.","lang":"eng"}],"type":"conference","date_created":"2022-08-19T07:33:37Z","date_updated":"2023-02-17T13:58:51Z","oa_version":"Published Version","author":[{"last_name":"Goranci","first_name":"Gramoz","full_name":"Goranci, Gramoz"},{"full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","first_name":"Monika H"},{"last_name":"Leniowski","first_name":"Dariusz","full_name":"Leniowski, Dariusz"},{"last_name":"Schulz","first_name":"Christian","full_name":"Schulz, Christian"},{"full_name":"Svozil, Alexander","last_name":"Svozil","first_name":"Alexander"}],"publication_status":"published","title":"Fully dynamic k-center clustering in low dimensional metrics","status":"public","publisher":"Society for Industrial and Applied Mathematics","_id":"11931","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","day":"01","month":"01","article_processing_charge":"No","publication_identifier":{"eisbn":["978-1-61197-647-2"],"issn":["2164-0300"]},"scopus_import":"1","language":[{"iso":"eng"}],"conference":{"end_date":"2021-01-11","start_date":"2021-01-10","location":"Alexandria, VA, United States","name":"ALENEX: Symposium on Algorithm Engineering and Experiments"},"date_published":"2021-01-01T00:00:00Z","doi":"10.1137/1.9781611976472.11","quality_controlled":"1","page":"143 -153","publication":"2021 Proceedings of the Workshop on Algorithm Engineering and Experiments","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1137/1.9781611976472.11"}],"citation":{"mla":"Goranci, Gramoz, et al. “Fully Dynamic K-Center Clustering in Low Dimensional Metrics.” 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2021, pp. 143–53, doi:10.1137/1.9781611976472.11.","short":"G. Goranci, M.H. Henzinger, D. Leniowski, C. Schulz, A. Svozil, in:, 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Society for Industrial and Applied Mathematics, 2021, pp. 143–153.","chicago":"Goranci, Gramoz, Monika H Henzinger, Dariusz Leniowski, Christian Schulz, and Alexander Svozil. “Fully Dynamic K-Center Clustering in Low Dimensional Metrics.” In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, 143–53. Society for Industrial and Applied Mathematics, 2021. https://doi.org/10.1137/1.9781611976472.11.","ama":"Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. Fully dynamic k-center clustering in low dimensional metrics. In: 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments. Society for Industrial and Applied Mathematics; 2021:143-153. doi:10.1137/1.9781611976472.11","ista":"Goranci G, Henzinger MH, Leniowski D, Schulz C, Svozil A. 2021. Fully dynamic k-center clustering in low dimensional metrics. 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments. ALENEX: Symposium on Algorithm Engineering and Experiments, 143–153.","ieee":"G. Goranci, M. H. Henzinger, D. Leniowski, C. Schulz, and A. Svozil, “Fully dynamic k-center clustering in low dimensional metrics,” in 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments, Alexandria, VA, United States, 2021, pp. 143–153.","apa":"Goranci, G., Henzinger, M. H., Leniowski, D., Schulz, C., & Svozil, A. (2021). Fully dynamic k-center clustering in low dimensional metrics. In 2021 Proceedings of the Workshop on Algorithm Engineering and Experiments (pp. 143–153). Alexandria, VA, United States: Society for Industrial and Applied Mathematics. https://doi.org/10.1137/1.9781611976472.11"}},{"publication_identifier":{"issn":["1433-7851"],"eissn":["1521-3773"]},"month":"03","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/anie.202100164"}],"oa":1,"quality_controlled":"1","doi":"10.1002/anie.202100164","language":[{"iso":"eng"}],"extern":"1","year":"2021","publisher":"Wiley","publication_status":"published","author":[{"last_name":"Schmermund","first_name":"Luca","full_name":"Schmermund, Luca"},{"first_name":"Susanne","last_name":"Reischauer","full_name":"Reischauer, Susanne"},{"last_name":"Bierbaumer","first_name":"Sarah","full_name":"Bierbaumer, Sarah"},{"full_name":"Winkler, Christoph K.","first_name":"Christoph K.","last_name":"Winkler"},{"first_name":"Alba","last_name":"Diaz‐Rodriguez","full_name":"Diaz‐Rodriguez, Alba"},{"full_name":"Edwards, Lee J.","last_name":"Edwards","first_name":"Lee J."},{"last_name":"Kara","first_name":"Selin","full_name":"Kara, Selin"},{"first_name":"Tamara","last_name":"Mielke","full_name":"Mielke, Tamara"},{"first_name":"Jared","last_name":"Cartwright","full_name":"Cartwright, Jared"},{"first_name":"Gideon","last_name":"Grogan","full_name":"Grogan, Gideon"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus"},{"first_name":"Wolfgang","last_name":"Kroutil","full_name":"Kroutil, Wolfgang"}],"volume":60,"date_created":"2022-08-24T10:47:16Z","date_updated":"2023-02-21T10:09:14Z","scopus_import":"1","article_processing_charge":"No","day":"22","citation":{"chicago":"Schmermund, Luca, Susanne Reischauer, Sarah Bierbaumer, Christoph K. Winkler, Alba Diaz‐Rodriguez, Lee J. Edwards, Selin Kara, et al. “Chromoselective Photocatalysis Enables Stereocomplementary Biocatalytic Pathways.” Angewandte Chemie International Edition. Wiley, 2021. https://doi.org/10.1002/anie.202100164.","short":"L. Schmermund, S. Reischauer, S. Bierbaumer, C.K. Winkler, A. Diaz‐Rodriguez, L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil, Angewandte Chemie International Edition 60 (2021) 6965–6969.","mla":"Schmermund, Luca, et al. “Chromoselective Photocatalysis Enables Stereocomplementary Biocatalytic Pathways.” Angewandte Chemie International Edition, vol. 60, no. 13, Wiley, 2021, pp. 6965–69, doi:10.1002/anie.202100164.","apa":"Schmermund, L., Reischauer, S., Bierbaumer, S., Winkler, C. K., Diaz‐Rodriguez, A., Edwards, L. J., … Kroutil, W. (2021). Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. Angewandte Chemie International Edition. Wiley. https://doi.org/10.1002/anie.202100164","ieee":"L. Schmermund et al., “Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways,” Angewandte Chemie International Edition, vol. 60, no. 13. Wiley, pp. 6965–6969, 2021.","ista":"Schmermund L, Reischauer S, Bierbaumer S, Winkler CK, Diaz‐Rodriguez A, Edwards LJ, Kara S, Mielke T, Cartwright J, Grogan G, Pieber B, Kroutil W. 2021. Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. Angewandte Chemie International Edition. 60(13), 6965–6969.","ama":"Schmermund L, Reischauer S, Bierbaumer S, et al. Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways. Angewandte Chemie International Edition. 2021;60(13):6965-6969. doi:10.1002/anie.202100164"},"publication":"Angewandte Chemie International Edition","page":"6965-6969","article_type":"original","date_published":"2021-03-22T00:00:00Z","type":"journal_article","issue":"13","abstract":[{"text":"Controlling the selectivity of a chemical reaction with external stimuli is common in thermal processes, but rare in visible-light photocatalysis. Here we show that the redox potential of a carbon nitride photocatalyst (CN-OA-m) can be tuned by changing the irradiation wavelength to generate electron holes with different oxidation potentials. This tuning was the key to realizing photo-chemo-enzymatic cascades that give either the (S)- or the (R)-enantiomer of phenylethanol. In combination with an unspecific peroxygenase from Agrocybe aegerita, green light irradiation of CN-OA-m led to the enantioselective hydroxylation of ethylbenzene to (R)-1-phenylethanol (99 % ee). In contrast, blue light irradiation triggered the photocatalytic oxidation of ethylbenzene to acetophenone, which in turn was enantioselectively reduced with an alcohol dehydrogenase from Rhodococcus ruber to form (S)-1-phenylethanol (93 % ee).","lang":"eng"}],"_id":"11956","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 60","status":"public","title":"Chromoselective photocatalysis enables stereocomplementary biocatalytic pathways","oa_version":"Published Version"},{"oa_version":"Published Version","intvolume":" 5","status":"public","title":"Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11965","issue":"8","abstract":[{"lang":"eng","text":"Metallaphotocatalytic cross-coupling reactions are typically carried out by combining homogeneous or heterogeneous photocatalysts with a soluble nickel complex. Previous attempts to realize recyclable catalytic systems use immobilized iridium complexes to harvest light. We present bifunctional materials based on semiconductors for metallaphotocatalytic C−S cross-coupling reactions that can be reused without losing their catalytic activity. Key to the success is the permanent immobilization of a nickel complex on the surface of a heterogeneous semiconductor through phosphonic acid anchors. The optimized catalyst harvests a broad range of the visible light spectrum and requires a nickel loading of only ∼0.1 mol %."}],"type":"journal_article","date_published":"2021-08-01T00:00:00Z","page":"716-720","article_type":"letter_note","citation":{"short":"S. Reischauer, B. Pieber, ChemPhotoChem 5 (2021) 716–720.","mla":"Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional Metallaphotocatalysts for C−S Cross‐coupling Reactions.” ChemPhotoChem, vol. 5, no. 8, Wiley, 2021, pp. 716–20, doi:10.1002/cptc.202100062.","chicago":"Reischauer, Susanne, and Bartholomäus Pieber. “Recyclable, Bifunctional Metallaphotocatalysts for C−S Cross‐coupling Reactions.” ChemPhotoChem. Wiley, 2021. https://doi.org/10.1002/cptc.202100062.","ama":"Reischauer S, Pieber B. Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. ChemPhotoChem. 2021;5(8):716-720. doi:10.1002/cptc.202100062","apa":"Reischauer, S., & Pieber, B. (2021). Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. ChemPhotoChem. Wiley. https://doi.org/10.1002/cptc.202100062","ieee":"S. Reischauer and B. Pieber, “Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions,” ChemPhotoChem, vol. 5, no. 8. Wiley, pp. 716–720, 2021.","ista":"Reischauer S, Pieber B. 2021. Recyclable, bifunctional metallaphotocatalysts for C−S cross‐coupling reactions. ChemPhotoChem. 5(8), 716–720."},"publication":"ChemPhotoChem","article_processing_charge":"No","day":"01","scopus_import":"1","volume":5,"date_created":"2022-08-25T08:31:11Z","date_updated":"2023-02-21T10:09:37Z","author":[{"first_name":"Susanne","last_name":"Reischauer","full_name":"Reischauer, Susanne"},{"full_name":"Pieber, Bartholomäus","last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726"}],"publisher":"Wiley","publication_status":"published","year":"2021","extern":"1","language":[{"iso":"eng"}],"doi":"10.1002/cptc.202100062","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1002/cptc.202100062"}],"oa":1,"publication_identifier":{"eissn":["2367-0932"]},"month":"08"},{"extern":"1","date_created":"2022-08-25T10:25:46Z","date_updated":"2023-02-21T10:09:52Z","volume":23,"author":[{"full_name":"Zhao, Zhouxiang","last_name":"Zhao","first_name":"Zhouxiang"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"full_name":"Delbianco, Martina","last_name":"Delbianco","first_name":"Martina"}],"publication_status":"published","publisher":"Royal Society of Chemistry","year":"2021","month":"06","publication_identifier":{"eissn":["1463-9270"],"issn":["1463-9262"]},"language":[{"iso":"eng"}],"doi":"10.1039/d1gc01284c","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1039/D1GC01284C"}],"oa":1,"abstract":[{"lang":"eng","text":"Carbon dots have been previosly immobilized on titanium dioxide to generate photocatalysts for pollutant degradation and water splitting. Here we demonstrate that these nanocomposites are valuable photocatalysts for metallaphotocatalytic carbon–heteroatom cross-couplings. These sustainable materials show a large applicability, high photostability, excellent reusability, and broadly absorb across the visible-light spectrum."}],"issue":"12","type":"journal_article","oa_version":"Published Version","title":"Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings","status":"public","intvolume":" 23","_id":"11972","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"21","article_processing_charge":"No","scopus_import":"1","date_published":"2021-06-21T00:00:00Z","article_type":"original","page":"4524-4530","publication":"Green Chemistry","citation":{"mla":"Zhao, Zhouxiang, et al. “Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for Metallaphotocatalytic Carbon-Heteroatom Cross-Couplings.” Green Chemistry, vol. 23, no. 12, Royal Society of Chemistry, 2021, pp. 4524–30, doi:10.1039/d1gc01284c.","short":"Z. Zhao, S. Reischauer, B. Pieber, M. Delbianco, Green Chemistry 23 (2021) 4524–4530.","chicago":"Zhao, Zhouxiang, Susanne Reischauer, Bartholomäus Pieber, and Martina Delbianco. “Carbon Dot/TiO₂ Nanocomposites as Photocatalysts for Metallaphotocatalytic Carbon-Heteroatom Cross-Couplings.” Green Chemistry. Royal Society of Chemistry, 2021. https://doi.org/10.1039/d1gc01284c.","ama":"Zhao Z, Reischauer S, Pieber B, Delbianco M. Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. Green Chemistry. 2021;23(12):4524-4530. doi:10.1039/d1gc01284c","ista":"Zhao Z, Reischauer S, Pieber B, Delbianco M. 2021. Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. Green Chemistry. 23(12), 4524–4530.","ieee":"Z. Zhao, S. Reischauer, B. Pieber, and M. Delbianco, “Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings,” Green Chemistry, vol. 23, no. 12. Royal Society of Chemistry, pp. 4524–4530, 2021.","apa":"Zhao, Z., Reischauer, S., Pieber, B., & Delbianco, M. (2021). Carbon dot/TiO₂ nanocomposites as photocatalysts for metallaphotocatalytic carbon-heteroatom cross-couplings. Green Chemistry. Royal Society of Chemistry. https://doi.org/10.1039/d1gc01284c"}},{"_id":"11974","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 24","title":"Emerging concepts in photocatalytic organic synthesis","status":"public","oa_version":"Published Version","type":"journal_article","issue":"3","abstract":[{"lang":"eng","text":"Visible light photocatalysis has become a powerful tool in organic synthesis that uses photons as traceless, sustainable reagents. Most of the activities in the field focus on the development of new reactions via common photoredox cycles, but recently a number of exciting new concepts and strategies entered less charted territories. We survey approaches that enable the use of longer wavelengths and show that the wavelength and intensity of photons are import parameters that enable tuning of the reactivity of a photocatalyst to control or change the selectivity of chemical reactions. In addition, we discuss recent efforts to substitute strong reductants, such as elemental lithium and sodium, by light and technological advances in the field."}],"citation":{"chicago":"Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic Organic Synthesis.” IScience. Elsevier, 2021. https://doi.org/10.1016/j.isci.2021.102209.","mla":"Reischauer, Susanne, and Bartholomäus Pieber. “Emerging Concepts in Photocatalytic Organic Synthesis.” IScience, vol. 24, no. 3, 102209, Elsevier, 2021, doi:10.1016/j.isci.2021.102209.","short":"S. Reischauer, B. Pieber, IScience 24 (2021).","ista":"Reischauer S, Pieber B. 2021. Emerging concepts in photocatalytic organic synthesis. iScience. 24(3), 102209.","ieee":"S. Reischauer and B. Pieber, “Emerging concepts in photocatalytic organic synthesis,” iScience, vol. 24, no. 3. Elsevier, 2021.","apa":"Reischauer, S., & Pieber, B. (2021). Emerging concepts in photocatalytic organic synthesis. IScience. Elsevier. https://doi.org/10.1016/j.isci.2021.102209","ama":"Reischauer S, Pieber B. Emerging concepts in photocatalytic organic synthesis. iScience. 2021;24(3). doi:10.1016/j.isci.2021.102209"},"publication":"iScience","article_type":"review","date_published":"2021-03-19T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"19","year":"2021","publisher":"Elsevier","publication_status":"published","author":[{"full_name":"Reischauer, Susanne","first_name":"Susanne","last_name":"Reischauer"},{"id":"93e5e5b2-0da6-11ed-8a41-af589a024726","orcid":"0000-0001-8689-388X","first_name":"Bartholomäus","last_name":"Pieber","full_name":"Pieber, Bartholomäus"}],"volume":24,"date_created":"2022-08-25T10:31:44Z","date_updated":"2023-02-21T10:09:57Z","article_number":"102209","extern":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.1016/j.isci.2021.102209","open_access":"1"}],"quality_controlled":"1","doi":"10.1016/j.isci.2021.102209","language":[{"iso":"eng"}],"publication_identifier":{"eissn":["2589-0042"]},"month":"03"},{"citation":{"ama":"Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. Organic Letters. 2021;23(2):514-518. doi:10.1021/acs.orglett.0c04026","ista":"Cavedon C, Sletten ET, Madani A, Niemeyer O, Seeberger PH, Pieber B. 2021. Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. Organic Letters. 23(2), 514–518.","apa":"Cavedon, C., Sletten, E. T., Madani, A., Niemeyer, O., Seeberger, P. H., & Pieber, B. (2021). Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups. Organic Letters. American Chemical Society. https://doi.org/10.1021/acs.orglett.0c04026","ieee":"C. Cavedon, E. T. Sletten, A. Madani, O. Niemeyer, P. H. Seeberger, and B. Pieber, “Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups,” Organic Letters, vol. 23, no. 2. American Chemical Society, pp. 514–518, 2021.","mla":"Cavedon, Cristian, et al. “Visible-Light-Mediated Oxidative Debenzylation Enables the Use of Benzyl Ethers as Temporary Protecting Groups.” Organic Letters, vol. 23, no. 2, American Chemical Society, 2021, pp. 514–18, doi:10.1021/acs.orglett.0c04026.","short":"C. Cavedon, E.T. Sletten, A. Madani, O. Niemeyer, P.H. Seeberger, B. Pieber, Organic Letters 23 (2021) 514–518.","chicago":"Cavedon, Cristian, Eric T. Sletten, Amiera Madani, Olaf Niemeyer, Peter H. Seeberger, and Bartholomäus Pieber. “Visible-Light-Mediated Oxidative Debenzylation Enables the Use of Benzyl Ethers as Temporary Protecting Groups.” Organic Letters. American Chemical Society, 2021. https://doi.org/10.1021/acs.orglett.0c04026."},"publication":"Organic Letters","page":"514-518","article_type":"letter_note","date_published":"2021-01-15T00:00:00Z","scopus_import":"1","article_processing_charge":"No","day":"15","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11981","intvolume":" 23","status":"public","title":"Visible-light-mediated oxidative debenzylation enables the use of benzyl ethers as temporary protecting groups","oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"The cleavage of benzyl ethers by catalytic hydrogenolysis or Birch reduction suffers from poor functional group compatibility and limits their use as a protecting group. The visible-light-mediated debenzylation disclosed here renders benzyl ethers temporary protective groups, enabling new orthogonal protection strategies. Using 2,3-dichloro-5,6-dicyano-1,4-benzoquinone (DDQ) as a stoichiometric or catalytic photooxidant, benzyl ethers can be cleaved in the presence of azides, alkenes, and alkynes. The reaction time can be reduced from hours to minutes in continuous flow."}],"external_id":{"pmid":["33400534"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.orglett.0c04026"}],"oa":1,"quality_controlled":"1","doi":"10.1021/acs.orglett.0c04026","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1523-7060"],"eissn":["1523-7052"]},"month":"01","pmid":1,"year":"2021","publisher":"American Chemical Society","publication_status":"published","author":[{"full_name":"Cavedon, Cristian","last_name":"Cavedon","first_name":"Cristian"},{"full_name":"Sletten, Eric T.","first_name":"Eric T.","last_name":"Sletten"},{"last_name":"Madani","first_name":"Amiera","full_name":"Madani, Amiera"},{"full_name":"Niemeyer, Olaf","last_name":"Niemeyer","first_name":"Olaf"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."},{"full_name":"Pieber, Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus"}],"volume":23,"date_updated":"2023-02-21T10:10:16Z","date_created":"2022-08-25T11:13:05Z","extern":"1"},{"publication_identifier":{"issn":["2643-1564"]},"month":"04","doi":"10.1103/physrevresearch.3.023075","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","file_date_updated":"2022-09-09T07:23:40Z","extern":"1","article_number":"023075","author":[{"full_name":"Sun, Zhixiang","last_name":"Sun","first_name":"Zhixiang"},{"last_name":"Guevara","first_name":"Jose M.","full_name":"Guevara, Jose M."},{"first_name":"Steffen","last_name":"Sykora","full_name":"Sykora, Steffen"},{"id":"8275014E-6063-11E9-9B7F-6338E6697425","orcid":"0000-0003-0853-8182","first_name":"Ekaterina","last_name":"Paerschke","full_name":"Paerschke, Ekaterina"},{"full_name":"Manna, Kaustuv","last_name":"Manna","first_name":"Kaustuv"},{"last_name":"Maljuk","first_name":"Andrey","full_name":"Maljuk, Andrey"},{"full_name":"Wurmehl, Sabine","first_name":"Sabine","last_name":"Wurmehl"},{"full_name":"van den Brink, Jeroen","last_name":"van den Brink","first_name":"Jeroen"},{"first_name":"Bernd","last_name":"Büchner","full_name":"Büchner, Bernd"},{"last_name":"Hess","first_name":"Christian","full_name":"Hess, Christian"}],"volume":3,"date_updated":"2022-09-09T07:26:01Z","date_created":"2022-09-08T15:01:16Z","year":"2021","publisher":"American Physical Society","publication_status":"published","article_processing_charge":"No","has_accepted_license":"1","day":"27","scopus_import":"1","date_published":"2021-04-27T00:00:00Z","citation":{"ista":"Sun Z, Guevara JM, Sykora S, Paerschke E, Manna K, Maljuk A, Wurmehl S, van den Brink J, Büchner B, Hess C. 2021. Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄. Physical Review Research. 3(2), 023075.","ieee":"Z. Sun et al., “Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄,” Physical Review Research, vol. 3, no. 2. American Physical Society, 2021.","apa":"Sun, Z., Guevara, J. M., Sykora, S., Paerschke, E., Manna, K., Maljuk, A., … Hess, C. (2021). Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄. Physical Review Research. American Physical Society. https://doi.org/10.1103/physrevresearch.3.023075","ama":"Sun Z, Guevara JM, Sykora S, et al. Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄. Physical Review Research. 2021;3(2). doi:10.1103/physrevresearch.3.023075","chicago":"Sun, Zhixiang, Jose M. Guevara, Steffen Sykora, Ekaterina Paerschke, Kaustuv Manna, Andrey Maljuk, Sabine Wurmehl, Jeroen van den Brink, Bernd Büchner, and Christian Hess. “Evidence for a Percolative Mott Insulator-Metal Transition in Doped Sr₂IrO₄.” Physical Review Research. American Physical Society, 2021. https://doi.org/10.1103/physrevresearch.3.023075.","mla":"Sun, Zhixiang, et al. “Evidence for a Percolative Mott Insulator-Metal Transition in Doped Sr₂IrO₄.” Physical Review Research, vol. 3, no. 2, 023075, American Physical Society, 2021, doi:10.1103/physrevresearch.3.023075.","short":"Z. Sun, J.M. Guevara, S. Sykora, E. Paerschke, K. Manna, A. Maljuk, S. Wurmehl, J. van den Brink, B. Büchner, C. Hess, Physical Review Research 3 (2021)."},"publication":"Physical Review Research","article_type":"original","issue":"2","abstract":[{"lang":"eng","text":"Despite many efforts to rationalize the strongly correlated electronic ground states in doped Mott insulators, the nature of the doping-induced insulator-to-metal transition is still a subject under intensive investigation. Here, we probe the nanoscale electronic structure of the Mott insulator Sr₂IrO₄δ with low-temperature scanning tunneling microscopy and find an enhanced local density of states (LDOS) inside the Mott gap at the location of individual defects which we interpret as defects at apical oxygen sites. A chiral behavior in the topography for those defects has been observed. We also visualize the local enhanced conductance arising from the overlapping of defect states which induces finite LDOS inside of the Mott gap. By combining these findings with the typical spatial extension of isolated defects of about 2 nm, our results indicate that the insulator-to-metal transition in Sr₂IrO₄−δ could be percolative in nature."}],"type":"journal_article","file":[{"relation":"main_file","file_id":"12075","checksum":"73f1331b9716295849e87a7d3acd9323","success":1,"date_created":"2022-09-09T07:23:40Z","date_updated":"2022-09-09T07:23:40Z","access_level":"open_access","file_name":"2021_PhysicalRevResearch_Sun.pdf","content_type":"application/pdf","file_size":4020901,"creator":"dernst"}],"oa_version":"Published Version","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12071","intvolume":" 3","title":"Evidence for a percolative Mott insulator-metal transition in doped Sr₂IrO₄","ddc":["530"],"status":"public"},{"publisher":"ChemRxiv","title":"Switching between enantiomers by combining chromoselective photocatalysis and biocatalysis","publication_status":"submitted","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12070","year":"2021","oa_version":"Preprint","date_created":"2022-09-08T11:46:45Z","date_updated":"2022-09-08T11:49:16Z","author":[{"last_name":"Schmermund","first_name":"Luca","full_name":"Schmermund, Luca"},{"last_name":"Reischauer","first_name":"Susanne","full_name":"Reischauer, Susanne"},{"last_name":"Bierbaumer","first_name":"Sarah","full_name":"Bierbaumer, Sarah"},{"last_name":"Winkler","first_name":"Christoph","full_name":"Winkler, Christoph"},{"first_name":"Alba","last_name":"Diaz-Rodriguez","full_name":"Diaz-Rodriguez, Alba"},{"full_name":"Edwards, Lee J.","first_name":"Lee J.","last_name":"Edwards"},{"full_name":"Kara, Selin","first_name":"Selin","last_name":"Kara"},{"full_name":"Mielke, Tamara","first_name":"Tamara","last_name":"Mielke"},{"full_name":"Cartwright, Jared","first_name":"Jared","last_name":"Cartwright"},{"last_name":"Grogan","first_name":"Gideon","full_name":"Grogan, Gideon"},{"last_name":"Pieber","first_name":"Bartholomäus","orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","full_name":"Pieber, Bartholomäus"},{"last_name":"Kroutil","first_name":"Wolfgang","full_name":"Kroutil, Wolfgang"}],"type":"preprint","extern":"1","abstract":[{"lang":"eng","text":"Controlling the selectivity of a chemical reaction with external stimuli is common in thermal processes, but rare in visible-light photocatalysis. Here we show that the redox potential of a carbon nitride photocatalyst (CN-OA-m) can be tuned by changing the irradiation wavelength to generate electron holes with different oxidation potentials. This tuning was the key to realizing photo-chemo-enzymatic cascades that give either the (S)- or the (R)-enantiomer of phenylethanol. In combination with an unspecific peroxygenase from Agrocybe aegerita, green light irradiation of CN-OA-m led to the enantioselective hydroxylation of ethylbenzene to (R)-1-phenylethanol (99% ee). In contrast, blue light irradiation triggered the photocatalytic oxidation of ethylbenzene to acetophenone, which in turn was enantioselectively reduced with an alcohol dehydrogenase from Rhodococcus ruber to form (S)-1-phenylethanol (93% ee)."}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.26434/chemrxiv.13521527"}],"citation":{"chicago":"Schmermund, Luca, Susanne Reischauer, Sarah Bierbaumer, Christoph Winkler, Alba Diaz-Rodriguez, Lee J. Edwards, Selin Kara, et al. “Switching between Enantiomers by Combining Chromoselective Photocatalysis and Biocatalysis.” ChemRxiv, n.d. https://doi.org/10.26434/chemrxiv.13521527.","short":"L. Schmermund, S. Reischauer, S. Bierbaumer, C. Winkler, A. Diaz-Rodriguez, L.J. Edwards, S. Kara, T. Mielke, J. Cartwright, G. Grogan, B. Pieber, W. Kroutil, (n.d.).","mla":"Schmermund, Luca, et al. Switching between Enantiomers by Combining Chromoselective Photocatalysis and Biocatalysis. ChemRxiv, doi:10.26434/chemrxiv.13521527.","apa":"Schmermund, L., Reischauer, S., Bierbaumer, S., Winkler, C., Diaz-Rodriguez, A., Edwards, L. J., … Kroutil, W. (n.d.). Switching between enantiomers by combining chromoselective photocatalysis and biocatalysis. ChemRxiv. https://doi.org/10.26434/chemrxiv.13521527","ieee":"L. Schmermund et al., “Switching between enantiomers by combining chromoselective photocatalysis and biocatalysis.” ChemRxiv.","ista":"Schmermund L, Reischauer S, Bierbaumer S, Winkler C, Diaz-Rodriguez A, Edwards LJ, Kara S, Mielke T, Cartwright J, Grogan G, Pieber B, Kroutil W. Switching between enantiomers by combining chromoselective photocatalysis and biocatalysis. 10.26434/chemrxiv.13521527.","ama":"Schmermund L, Reischauer S, Bierbaumer S, et al. Switching between enantiomers by combining chromoselective photocatalysis and biocatalysis. doi:10.26434/chemrxiv.13521527"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.26434/chemrxiv.13521527","date_published":"2021-01-06T00:00:00Z","article_processing_charge":"No","day":"06","month":"01"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12068","year":"2021","publisher":"ChemRxiv","status":"public","publication_status":"submitted","title":"Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom cross-couplings","author":[{"last_name":"Cavedon","first_name":"Cristian","full_name":"Cavedon, Cristian"},{"last_name":"Gisbertz","first_name":"Sebastian","full_name":"Gisbertz, Sebastian"},{"last_name":"Vogl","first_name":"Sarah","full_name":"Vogl, Sarah"},{"full_name":"Richter, Noah","last_name":"Richter","first_name":"Noah"},{"last_name":"Schrottke","first_name":"Stefanie","full_name":"Schrottke, Stefanie"},{"full_name":"Teutloff, Christian","last_name":"Teutloff","first_name":"Christian"},{"first_name":"Peter H.","last_name":"Seeberger","full_name":"Seeberger, Peter H."},{"first_name":"Arne","last_name":"Thomas","full_name":"Thomas, Arne"},{"orcid":"0000-0001-8689-388X","id":"93e5e5b2-0da6-11ed-8a41-af589a024726","last_name":"Pieber","first_name":"Bartholomäus","full_name":"Pieber, Bartholomäus"}],"oa_version":"Preprint","date_updated":"2022-09-08T11:44:01Z","date_created":"2022-09-08T11:42:02Z","type":"preprint","abstract":[{"lang":"eng","text":"Metallaphotocatalysis typically requires a photocatalyst to harness the energy of visible-light and transfer it to a transition metal catalyst to trigger chemical reactions. The most prominent example is the merger of photo- and nickel catalysis that unlocked various cross-couplings. However, the high reactivity of excited photocatalyst can lead to unwanted side reactions thus limiting this approach. Here we show that a bipyridine ligand that is subtly decorated with two carbazole groups forms a nickel complex that absorbs visible-light and promotes several carbon–heteroatom cross-couplings in the absence of an exogenous photocatalysts. The ligand can be polymerized in a simple one-step procedure to afford a porous organic polymer that can be used for heterogeneous nickel catalysis in the same reactions. The material can be easily recovered and reused multiple times maintaining high catalytic activity and selectivity."}],"extern":"1","oa":1,"citation":{"ista":"Cavedon C, Gisbertz S, Vogl S, Richter N, Schrottke S, Teutloff C, Seeberger PH, Thomas A, Pieber B. Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom cross-couplings. 10.26434/chemrxiv-2021-kt2wr.","apa":"Cavedon, C., Gisbertz, S., Vogl, S., Richter, N., Schrottke, S., Teutloff, C., … Pieber, B. (n.d.). Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom cross-couplings. ChemRxiv. https://doi.org/10.26434/chemrxiv-2021-kt2wr","ieee":"C. Cavedon et al., “Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom cross-couplings.” ChemRxiv.","ama":"Cavedon C, Gisbertz S, Vogl S, et al. Photocatalyst-free, visible-light-mediated nickel catalyzed carbon–heteroatom cross-couplings. doi:10.26434/chemrxiv-2021-kt2wr","chicago":"Cavedon, Cristian, Sebastian Gisbertz, Sarah Vogl, Noah Richter, Stefanie Schrottke, Christian Teutloff, Peter H. Seeberger, Arne Thomas, and Bartholomäus Pieber. “Photocatalyst-Free, Visible-Light-Mediated Nickel Catalyzed Carbon–Heteroatom Cross-Couplings.” ChemRxiv, n.d. https://doi.org/10.26434/chemrxiv-2021-kt2wr.","mla":"Cavedon, Cristian, et al. Photocatalyst-Free, Visible-Light-Mediated Nickel Catalyzed Carbon–Heteroatom Cross-Couplings. ChemRxiv, doi:10.26434/chemrxiv-2021-kt2wr.","short":"C. Cavedon, S. Gisbertz, S. Vogl, N. Richter, S. Schrottke, C. Teutloff, P.H. Seeberger, A. Thomas, B. Pieber, (n.d.)."},"main_file_link":[{"url":"https://doi.org/10.26434/chemrxiv-2021-kt2wr","open_access":"1"}],"date_published":"2021-08-04T00:00:00Z","doi":"10.26434/chemrxiv-2021-kt2wr","language":[{"iso":"eng"}],"article_processing_charge":"No","day":"04","month":"08"},{"month":"04","day":"30","article_processing_charge":"No","publication":"arXiv","external_id":{"arxiv":["2104.14946"]},"citation":{"mla":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” ArXiv, 2104.14946, doi:10.48550/arXiv.2104.14946.","short":"A.L. Shute, ArXiv (n.d.).","chicago":"Shute, Alec L. “On the Leading Constant in the Manin-Type Conjecture for Campana Points.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.14946.","ama":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv. doi:10.48550/arXiv.2104.14946","ista":"Shute AL. On the leading constant in the Manin-type conjecture for Campana points. arXiv, 2104.14946.","ieee":"A. L. Shute, “On the leading constant in the Manin-type conjecture for Campana points,” arXiv. .","apa":"Shute, A. L. (n.d.). On the leading constant in the Manin-type conjecture for Campana points. arXiv. https://doi.org/10.48550/arXiv.2104.14946"},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.14946"}],"oa":1,"doi":"10.48550/arXiv.2104.14946","date_published":"2021-04-30T00:00:00Z","language":[{"iso":"eng"}],"article_number":"2104.14946","type":"preprint","abstract":[{"text":"We compare the Manin-type conjecture for Campana points recently formulated\r\nby Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado with an alternative\r\nprediction of Browning and Van Valckenborgh in the special case of the orbifold\r\n$(\\mathbb{P}^1,D)$, where $D =\\frac{1}{2}[0]+\\frac{1}{2}[1]+\\frac{1}{2}[\\infty]$. We find that the two predicted leading constants do not agree, and we discuss whether thin sets\r\ncould explain this discrepancy. Motivated by this, we provide a counterexample\r\nto the Manin-type conjecture for Campana points, by considering orbifolds\r\ncorresponding to squareful values of binary quadratic forms.","lang":"eng"}],"_id":"12077","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The author would like to thank Damaris Schindler and Florian Wilsch for their helpful comments on the heights and Tamagawa measures used in Section 3, together with Marta Pieropan, Sho Tanimoto and Sam Streeter for providing valuable feedback on an earlier version of this paper, and Tim Browning for many useful comments and discussions during the development of this work. The author is also grateful to the anonymous referee for providing many valuable comments and suggestions that improved the quality of the paper.","publication_status":"submitted","status":"public","title":"On the leading constant in the Manin-type conjecture for Campana points","department":[{"_id":"TiBr"}],"author":[{"full_name":"Shute, Alec L","first_name":"Alec L","last_name":"Shute","id":"440EB050-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1812-2810"}],"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"12072"}]},"date_created":"2022-09-09T10:43:17Z","date_updated":"2023-02-21T16:37:30Z","oa_version":"Preprint"},{"author":[{"full_name":"Shute, Alec L","last_name":"Shute","first_name":"Alec L","orcid":"0000-0002-1812-2810","id":"440EB050-F248-11E8-B48F-1D18A9856A87"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"12072"}]},"date_updated":"2023-02-21T16:37:30Z","date_created":"2022-09-09T10:42:51Z","oa_version":"Preprint","_id":"12076","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","publication_status":"submitted","title":"Sums of four squareful numbers","status":"public","department":[{"_id":"TiBr"}],"abstract":[{"lang":"eng","text":"We find an asymptotic formula for the number of primitive vectors $(z_1,\\ldots,z_4)\\in (\\mathbb{Z}_{\\neq 0})^4$ such that $z_1,\\ldots, z_4$ are all squareful and bounded by $B$, and $z_1+\\cdots + z_4 = 0$. Our result agrees in the power of $B$ and $\\log B$ with the Campana-Manin conjecture of Pieropan, Smeets, Tanimoto and V\\'{a}rilly-Alvarado."}],"article_number":"2104.06966","type":"preprint","doi":"10.48550/arXiv.2104.06966","date_published":"2021-04-15T00:00:00Z","language":[{"iso":"eng"}],"publication":"arXiv","oa":1,"external_id":{"arxiv":["2104.06966"]},"main_file_link":[{"open_access":"1","url":"https://doi.org/10.48550/arXiv.2104.06966"}],"citation":{"ama":"Shute AL. Sums of four squareful numbers. arXiv. doi:10.48550/arXiv.2104.06966","ieee":"A. L. Shute, “Sums of four squareful numbers,” arXiv. .","apa":"Shute, A. L. (n.d.). Sums of four squareful numbers. arXiv. https://doi.org/10.48550/arXiv.2104.06966","ista":"Shute AL. Sums of four squareful numbers. arXiv, 2104.06966.","short":"A.L. Shute, ArXiv (n.d.).","mla":"Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, 2104.06966, doi:10.48550/arXiv.2104.06966.","chicago":"Shute, Alec L. “Sums of Four Squareful Numbers.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2104.06966."},"day":"15","month":"04","article_processing_charge":"No"},{"month":"02","day":"15","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2021-02-15T00:00:00Z","doi":"10.48550/arXiv.2102.07573","publication":"arXiv","oa":1,"external_id":{"arxiv":["2102.07573"]},"citation":{"ama":"Verzobio M. A recurrence relation for elliptic divisibility sequences. arXiv. doi:10.48550/arXiv.2102.07573","ieee":"M. Verzobio, “A recurrence relation for elliptic divisibility sequences,” arXiv. .","apa":"Verzobio, M. (n.d.). A recurrence relation for elliptic divisibility sequences. arXiv. https://doi.org/10.48550/arXiv.2102.07573","ista":"Verzobio M. A recurrence relation for elliptic divisibility sequences. arXiv, 2102.07573.","short":"M. Verzobio, ArXiv (n.d.).","mla":"Verzobio, Matteo. “A Recurrence Relation for Elliptic Divisibility Sequences.” ArXiv, 2102.07573, doi:10.48550/arXiv.2102.07573.","chicago":"Verzobio, Matteo. “A Recurrence Relation for Elliptic Divisibility Sequences.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2102.07573."},"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.2102.07573","open_access":"1"}],"extern":"1","abstract":[{"lang":"eng","text":"In literature, there are two different definitions of elliptic divisibility\r\nsequences. The first one says that a sequence of integers $\\{h_n\\}_{n\\geq 0}$\r\nis an elliptic divisibility sequence if it verifies the recurrence relation\r\n$h_{m+n}h_{m-n}h_{r}^2=h_{m+r}h_{m-r}h_{n}^2-h_{n+r}h_{n-r}h_{m}^2$ for every\r\nnatural number $m\\geq n\\geq r$. The second definition says that a sequence of\r\nintegers $\\{\\beta_n\\}_{n\\geq 0}$ is an elliptic divisibility sequence if it is\r\nthe sequence of the square roots (chosen with an appropriate sign) of the\r\ndenominators of the abscissas of the iterates of a point on a rational elliptic\r\ncurve. It is well-known that the two sequences are not equivalent. Hence, given\r\na sequence of the denominators $\\{\\beta_n\\}_{n\\geq 0}$, in general does not\r\nhold\r\n$\\beta_{m+n}\\beta_{m-n}\\beta_{r}^2=\\beta_{m+r}\\beta_{m-r}\\beta_{n}^2-\\beta_{n+r}\\beta_{n-r}\\beta_{m}^2$\r\nfor $m\\geq n\\geq r$. We will prove that the recurrence relation above holds for\r\n$\\{\\beta_n\\}_{n\\geq 0}$ under some conditions on the indexes $m$, $n$, and $r$."}],"article_number":"2102.07573","type":"preprint","date_created":"2023-01-16T11:46:36Z","date_updated":"2023-02-21T10:22:57Z","oa_version":"Preprint","author":[{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306","first_name":"Matteo","last_name":"Verzobio","full_name":"Verzobio, Matteo"}],"status":"public","publication_status":"submitted","title":"A recurrence relation for elliptic divisibility sequences","_id":"12314","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021"},{"article_type":"original","publication":"PNAS","citation":{"ista":"Li L, Goodrich CP, Yang H, Phillips KR, Jia Z, Chen H, Wang L, Zhong J, Liu A, Lu J, Shuai J, Brenner MP, Spaepen F, Aizenberg J. 2021. Microscopic origins of the crystallographically preferred growth in evaporation-induced colloidal crystals. PNAS. 118(32), e2107588118.","ieee":"L. Li et al., “Microscopic origins of the crystallographically preferred growth in evaporation-induced colloidal crystals,” PNAS, vol. 118, no. 32. Proceedings of the National Academy of Sciences, 2021.","apa":"Li, L., Goodrich, C. P., Yang, H., Phillips, K. R., Jia, Z., Chen, H., … Aizenberg, J. (2021). Microscopic origins of the crystallographically preferred growth in evaporation-induced colloidal crystals. PNAS. Proceedings of the National Academy of Sciences. https://doi.org/10.1073/pnas.2107588118","ama":"Li L, Goodrich CP, Yang H, et al. Microscopic origins of the crystallographically preferred growth in evaporation-induced colloidal crystals. PNAS. 2021;118(32). doi:10.1073/pnas.2107588118","chicago":"Li, Ling, Carl Peter Goodrich, Haizhao Yang, Katherine R. Phillips, Zian Jia, Hongshun Chen, Lifeng Wang, et al. “Microscopic Origins of the Crystallographically Preferred Growth in Evaporation-Induced Colloidal Crystals.” PNAS. Proceedings of the National Academy of Sciences, 2021. https://doi.org/10.1073/pnas.2107588118.","mla":"Li, Ling, et al. “Microscopic Origins of the Crystallographically Preferred Growth in Evaporation-Induced Colloidal Crystals.” PNAS, vol. 118, no. 32, e2107588118, Proceedings of the National Academy of Sciences, 2021, doi:10.1073/pnas.2107588118.","short":"L. Li, C.P. Goodrich, H. Yang, K.R. Phillips, Z. Jia, H. Chen, L. Wang, J. Zhong, A. Liu, J. Lu, J. Shuai, M.P. Brenner, F. Spaepen, J. Aizenberg, PNAS 118 (2021)."},"date_published":"2021-08-10T00:00:00Z","scopus_import":"1","day":"10","has_accepted_license":"1","article_processing_charge":"No","status":"public","title":"Microscopic origins of the crystallographically preferred growth in evaporation-induced colloidal crystals","ddc":["570"],"intvolume":" 118","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12667","file":[{"creator":"dernst","file_size":3275944,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_PNAS_Li.pdf","success":1,"checksum":"702f7ec60ce6f2815104ab649dc661a4","date_created":"2023-02-23T10:42:07Z","date_updated":"2023-02-23T10:42:07Z","file_id":"12674","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Unlike crystalline atomic and ionic solids, texture development due to crystallographically preferred growth in colloidal crystals is less studied. Here we investigate the underlying mechanisms of the texture evolution in an evaporation-induced colloidal assembly process through experiments, modeling, and theoretical analysis. In this widely used approach to obtain large-area colloidal crystals, the colloidal particles are driven to the meniscus via the evaporation of a solvent or matrix precursor solution where they close-pack to form a face-centered cubic colloidal assembly. Via two-dimensional large-area crystallographic mapping, we show that the initial crystal orientation is dominated by the interaction of particles with the meniscus, resulting in the expected coalignment of the close-packed direction with the local meniscus geometry. By combining with crystal structure analysis at a single-particle level, we further reveal that, at the later stage of self-assembly, however, the colloidal crystal undergoes a gradual rotation facilitated by geometrically necessary dislocations (GNDs) and achieves a large-area uniform crystallographic orientation with the close-packed direction perpendicular to the meniscus and parallel to the growth direction. Classical slip analysis, finite element-based mechanical simulation, computational colloidal assembly modeling, and continuum theory unequivocally show that these GNDs result from the tensile stress field along the meniscus direction due to the constrained shrinkage of the colloidal crystal during drying. The generation of GNDs with specific slip systems within individual grains leads to crystallographic rotation to accommodate the mechanical stress. The mechanistic understanding reported here can be utilized to control crystallographic features of colloidal assemblies, and may provide further insights into crystallographically preferred growth in synthetic, biological, and geological crystals.","lang":"eng"}],"issue":"32","quality_controlled":"1","external_id":{"pmid":["34341109"]},"tmp":{"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","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1073/pnas.2107588118","month":"08","publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"publication_status":"published","publisher":"Proceedings of the National Academy of Sciences","year":"2021","pmid":1,"date_created":"2023-02-21T08:51:04Z","date_updated":"2023-02-23T10:45:44Z","volume":118,"author":[{"first_name":"Ling","last_name":"Li","full_name":"Li, Ling"},{"full_name":"Goodrich, Carl Peter","orcid":"0000-0002-1307-5074","id":"EB352CD2-F68A-11E9-89C5-A432E6697425","last_name":"Goodrich","first_name":"Carl Peter"},{"last_name":"Yang","first_name":"Haizhao","full_name":"Yang, Haizhao"},{"full_name":"Phillips, Katherine R.","last_name":"Phillips","first_name":"Katherine R."},{"last_name":"Jia","first_name":"Zian","full_name":"Jia, Zian"},{"last_name":"Chen","first_name":"Hongshun","full_name":"Chen, Hongshun"},{"full_name":"Wang, Lifeng","first_name":"Lifeng","last_name":"Wang"},{"full_name":"Zhong, Jinjin","first_name":"Jinjin","last_name":"Zhong"},{"full_name":"Liu, Anhua","last_name":"Liu","first_name":"Anhua"},{"last_name":"Lu","first_name":"Jianfeng","full_name":"Lu, Jianfeng"},{"first_name":"Jianwei","last_name":"Shuai","full_name":"Shuai, Jianwei"},{"first_name":"Michael P.","last_name":"Brenner","full_name":"Brenner, Michael P."},{"full_name":"Spaepen, Frans","first_name":"Frans","last_name":"Spaepen"},{"last_name":"Aizenberg","first_name":"Joanna","full_name":"Aizenberg, Joanna"}],"article_number":"e2107588118","extern":"1","file_date_updated":"2023-02-23T10:42:07Z"},{"day":"01","month":"01","publication_identifier":{"isbn":["978012820807-6"],"issn":["0091-679X"]},"article_processing_charge":"No","scopus_import":"1","language":[{"iso":"eng"}],"doi":"10.1016/bs.mcb.2020.04.016","date_published":"2021-01-01T00:00:00Z","quality_controlled":"1","page":"33-56","publication":"Methods in Cell Biology","external_id":{"pmid":["33478696"]},"citation":{"short":"S.M. Truckenbrodt, S.O. Rizzoli, in:, Methods in Cell Biology, Elsevier, 2021, pp. 33–56.","mla":"Truckenbrodt, Sven M., and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” Methods in Cell Biology, vol. 161, Elsevier, 2021, pp. 33–56, doi:10.1016/bs.mcb.2020.04.016.","chicago":"Truckenbrodt, Sven M, and Silvio O. Rizzoli. “Simple Multi-Color Super-Resolution by X10 Microscopy.” In Methods in Cell Biology, 161:33–56. Elsevier, 2021. https://doi.org/10.1016/bs.mcb.2020.04.016.","ama":"Truckenbrodt SM, Rizzoli SO. Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. Vol 161. Elsevier; 2021:33-56. doi:10.1016/bs.mcb.2020.04.016","apa":"Truckenbrodt, S. M., & Rizzoli, S. O. (2021). Simple multi-color super-resolution by X10 microscopy. In Methods in Cell Biology (Vol. 161, pp. 33–56). Elsevier. https://doi.org/10.1016/bs.mcb.2020.04.016","ieee":"S. M. Truckenbrodt and S. O. Rizzoli, “Simple multi-color super-resolution by X10 microscopy,” in Methods in Cell Biology, vol. 161, Elsevier, 2021, pp. 33–56.","ista":"Truckenbrodt SM, Rizzoli SO. 2021.Simple multi-color super-resolution by X10 microscopy. In: Methods in Cell Biology. vol. 161, 33–56."},"abstract":[{"lang":"eng","text":"Expansion microscopy is a recently developed super-resolution imaging technique, which provides an alternative to optics-based methods such as deterministic approaches (e.g. STED) or stochastic approaches (e.g. PALM/STORM). The idea behind expansion microscopy is to embed the biological sample in a swellable gel, and then to expand it isotropically, thereby increasing the distance between the fluorophores. This approach breaks the diffraction barrier by simply separating the emission point-spread-functions of the fluorophores. The resolution attainable in expansion microscopy is thus directly dependent on the separation that can be achieved, i.e. on the expansion factor. The original implementation of the technique achieved an expansion factor of fourfold, for a resolution of 70–80 nm. The subsequently developed X10 method achieves an expansion factor of 10-fold, for a resolution of 25–30 nm. This technique can be implemented with minimal technical requirements on any standard fluorescence microscope, and is more easily applied for multi-color imaging than either deterministic or stochastic super-resolution approaches. This renders X10 expansion microscopy a highly promising tool for new biological discoveries, as discussed here, and as demonstrated by several recent applications."}],"type":"book_chapter","date_updated":"2021-03-11T08:49:08Z","date_created":"2020-06-07T22:00:55Z","volume":161,"oa_version":"None","author":[{"first_name":"Sven M","last_name":"Truckenbrodt","id":"45812BD4-F248-11E8-B48F-1D18A9856A87","full_name":"Truckenbrodt, Sven M"},{"first_name":"Silvio O.","last_name":"Rizzoli","full_name":"Rizzoli, Silvio O."}],"status":"public","publication_status":"published","title":"Simple multi-color super-resolution by X10 microscopy","intvolume":" 161","department":[{"_id":"JoDa"}],"publisher":"Elsevier","_id":"7941","year":"2021","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","pmid":1},{"volume":66,"date_created":"2022-06-17T08:45:15Z","date_updated":"2023-02-23T13:26:41Z","related_material":{"record":[{"status":"public","relation":"earlier_version","id":"8182"}]},"author":[{"full_name":"Avvakumov, Sergey","first_name":"Sergey","last_name":"Avvakumov","id":"3827DAC8-F248-11E8-B48F-1D18A9856A87"},{"id":"ecf01965-d252-11ea-95a5-8ada5f6c6a67","first_name":"Sergey","last_name":"Kudrya","full_name":"Kudrya, Sergey"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","acknowledgement":"S. Avvakumov has received funding from the European Research Council under the European Union’s Seventh Framework Programme ERC Grant agreement ERC StG 716424–CASe. S. Kudrya was supported by the Austrian Academic Exchange Service (OeAD), ICM-2019-13577.","extern":"1","language":[{"iso":"eng"}],"doi":"10.1007/s00454-021-00299-z","quality_controlled":"1","external_id":{"arxiv":["1910.12628"]},"publication_identifier":{"eissn":["1432-0444"],"issn":["0179-5376"]},"month":"10","oa_version":"Preprint","intvolume":" 66","status":"public","title":"Vanishing of all equivariant obstructions and the mapping degree","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11446","issue":"3","abstract":[{"text":"Suppose that n is not a prime power and not twice a prime power. We prove that for any Hausdorff compactum X with a free action of the symmetric group Sn, there exists an Sn-equivariant map X→Rn whose image avoids the diagonal {(x,x,…,x)∈Rn∣x∈R}. Previously, the special cases of this statement for certain X were usually proved using the equivartiant obstruction theory. Such calculations are difficult and may become infeasible past the first (primary) obstruction. We take a different approach which allows us to prove the vanishing of all obstructions simultaneously. The essential step in the proof is classifying the possible degrees of Sn-equivariant maps from the boundary ∂Δn−1 of (n−1)-simplex to itself. Existence of equivariant maps between spaces is important for many questions arising from discrete mathematics and geometry, such as Kneser’s conjecture, the Square Peg conjecture, the Splitting Necklace problem, and the Topological Tverberg conjecture, etc. We demonstrate the utility of our result applying it to one such question, a specific instance of envy-free division problem.","lang":"eng"}],"type":"journal_article","date_published":"2021-10-01T00:00:00Z","page":"1202-1216","article_type":"original","citation":{"mla":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” Discrete & Computational Geometry, vol. 66, no. 3, Springer Nature, 2021, pp. 1202–16, doi:10.1007/s00454-021-00299-z.","short":"S. Avvakumov, S. Kudrya, Discrete & Computational Geometry 66 (2021) 1202–1216.","chicago":"Avvakumov, Sergey, and Sergey Kudrya. “Vanishing of All Equivariant Obstructions and the Mapping Degree.” Discrete & Computational Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00454-021-00299-z.","ama":"Avvakumov S, Kudrya S. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 2021;66(3):1202-1216. doi:10.1007/s00454-021-00299-z","ista":"Avvakumov S, Kudrya S. 2021. Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. 66(3), 1202–1216.","apa":"Avvakumov, S., & Kudrya, S. (2021). Vanishing of all equivariant obstructions and the mapping degree. Discrete & Computational Geometry. Springer Nature. https://doi.org/10.1007/s00454-021-00299-z","ieee":"S. Avvakumov and S. Kudrya, “Vanishing of all equivariant obstructions and the mapping degree,” Discrete & Computational Geometry, vol. 66, no. 3. Springer Nature, pp. 1202–1216, 2021."},"publication":"Discrete & Computational Geometry","article_processing_charge":"No","day":"01","keyword":["Computational Theory and Mathematics","Discrete Mathematics and Combinatorics","Geometry and Topology","Theoretical Computer Science"],"scopus_import":"1"},{"date_updated":"2022-08-19T07:22:23Z","date_created":"2021-02-07T23:01:12Z","volume":11,"author":[{"full_name":"Pandey, Rakesh","last_name":"Pandey","first_name":"Rakesh"},{"first_name":"Yusur","last_name":"Al-Nuaimi","full_name":"Al-Nuaimi, Yusur"},{"id":"46CB58F2-F248-11E8-B48F-1D18A9856A87","first_name":"Rajiv Kumar","last_name":"Mishra","full_name":"Mishra, Rajiv Kumar"},{"last_name":"Spurgeon","first_name":"Sarah K.","full_name":"Spurgeon, Sarah K."},{"first_name":"Marc","last_name":"Goodfellow","full_name":"Goodfellow, Marc"}],"publication_status":"published","department":[{"_id":"PeJo"}],"publisher":"Springer Nature","year":"2021","acknowledgement":"RP acknowledges the Department of Science and Technology, India for the support through the DST-INSPIRE Faculty Award (DST/INSPIRE/04/2015/001939). This work was supported by the Engineering and Physical Sciences Research Council (EPSRC), United Kingdom (Grant numbers EP/J018295/1, EP/J018392/1, EP/N014391/1). The contribution of RP was also supported by the later Grant. This work was generously supported by the Welcome Trust Institutional Strategic Support Award (204909/Z/16/Z) too. The contribution of MG was supported by the EPSRC via EP/N014391/1 and a Wellcome Trust Institutional Strategic Support Award (WT105618MA). The contribution of YA was generously supported by the Wellcome Trust Institutional Strategic Support Award (WT105618MA).","file_date_updated":"2021-02-09T07:33:23Z","article_number":"2204","language":[{"iso":"eng"}],"doi":"10.1038/s41598-020-80507-7","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"month":"01","publication_identifier":{"eissn":["20452322"]},"oa_version":"Published Version","file":[{"content_type":"application/pdf","file_size":2885056,"creator":"dernst","access_level":"open_access","file_name":"2021_ScientificReports_Pandey.pdf","checksum":"e8a68df48750712671f5c47b0228e531","success":1,"date_updated":"2021-02-09T07:33:23Z","date_created":"2021-02-09T07:33:23Z","relation":"main_file","file_id":"9106"}],"status":"public","ddc":["570"],"title":"Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis","intvolume":" 11","_id":"9097","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"Psoriasis is a chronic inflammatory skin disease clinically characterized by the appearance of red colored, well-demarcated plaques with thickened skin and with silvery scales. Recent studies have established the involvement of a complex signalling network of interactions between cytokines, immune cells and skin cells called keratinocytes. Keratinocytes form the cells of the outermost layer of the skin (epidermis). Visible plaques in psoriasis are developed due to the fast proliferation and unusual differentiation of keratinocyte cells. Despite that, the exact mechanism of the appearance of these plaques in the cytokine-immune cell network is not clear. A mathematical model embodying interactions between key immune cells believed to be involved in psoriasis, keratinocytes and relevant cytokines has been developed. The complex network formed of these interactions poses several challenges. Here, we choose to study subnetworks of this complex network and initially focus on interactions involving TNFα, IL-23/IL-17, and IL-15. These are chosen based on known evidence of their therapeutic efficacy. In addition, we explore the role of IL-15 in the pathogenesis of psoriasis and its potential as a future drug target for a novel treatment option. We perform steady state analyses for these subnetworks and demonstrate that the interactions between cells, driven by cytokines could cause the emergence of a psoriasis state (hyper-proliferation of keratinocytes) when levels of TNFα, IL-23/IL-17 or IL-15 are increased. The model results explain and support the clinical potentiality of anti-cytokine treatments. Interestingly, our results suggest different dynamic scenarios underpin the pathogenesis of psoriasis, depending upon the dominant cytokines of subnetworks. We observed that the increase in the level of IL-23/IL-17 and IL-15 could lead to psoriasis via a bistable route, whereas an increase in the level of TNFα would lead to a monotonic and gradual disease progression. Further, we demonstrate how this insight, bistability, could be exploited to improve the current therapies and develop novel treatment strategies for psoriasis."}],"type":"journal_article","date_published":"2021-01-26T00:00:00Z","article_type":"original","publication":"Scientific Reports","citation":{"mla":"Pandey, Rakesh, et al. “Role of Subnetworks Mediated by TNF α, IL-23/IL-17 and IL-15 in a Network Involved in the Pathogenesis of Psoriasis.” Scientific Reports, vol. 11, 2204, Springer Nature, 2021, doi:10.1038/s41598-020-80507-7.","short":"R. Pandey, Y. Al-Nuaimi, R.K. Mishra, S.K. Spurgeon, M. Goodfellow, Scientific Reports 11 (2021).","chicago":"Pandey, Rakesh, Yusur Al-Nuaimi, Rajiv Kumar Mishra, Sarah K. Spurgeon, and Marc Goodfellow. “Role of Subnetworks Mediated by TNF α, IL-23/IL-17 and IL-15 in a Network Involved in the Pathogenesis of Psoriasis.” Scientific Reports. Springer Nature, 2021. https://doi.org/10.1038/s41598-020-80507-7.","ama":"Pandey R, Al-Nuaimi Y, Mishra RK, Spurgeon SK, Goodfellow M. Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis. Scientific Reports. 2021;11. doi:10.1038/s41598-020-80507-7","ista":"Pandey R, Al-Nuaimi Y, Mishra RK, Spurgeon SK, Goodfellow M. 2021. Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis. Scientific Reports. 11, 2204.","ieee":"R. Pandey, Y. Al-Nuaimi, R. K. Mishra, S. K. Spurgeon, and M. Goodfellow, “Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis,” Scientific Reports, vol. 11. Springer Nature, 2021.","apa":"Pandey, R., Al-Nuaimi, Y., Mishra, R. K., Spurgeon, S. K., & Goodfellow, M. (2021). Role of subnetworks mediated by TNF α, IL-23/IL-17 and IL-15 in a network involved in the pathogenesis of psoriasis. Scientific Reports. Springer Nature. https://doi.org/10.1038/s41598-020-80507-7"},"day":"26","article_processing_charge":"No","has_accepted_license":"1","scopus_import":"1"},{"date_published":"2021-02-20T00:00:00Z","page":"117-128","citation":{"ama":"Xia P, Heisenberg C-PJ. Quantifying tissue tension in the granulosa layer after laser surgery. In: Dosch R, ed. Germline Development in the Zebrafish. Vol 2218. Humana; 2021:117-128. doi:10.1007/978-1-0716-0970-5_10","ista":"Xia P, Heisenberg C-PJ. 2021.Quantifying tissue tension in the granulosa layer after laser surgery. In: Germline Development in the Zebrafish. Methods in Molecular Biology, vol. 2218, 117–128.","ieee":"P. Xia and C.-P. J. Heisenberg, “Quantifying tissue tension in the granulosa layer after laser surgery,” in Germline Development in the Zebrafish, vol. 2218, R. Dosch, Ed. Humana, 2021, pp. 117–128.","apa":"Xia, P., & Heisenberg, C.-P. J. (2021). Quantifying tissue tension in the granulosa layer after laser surgery. In R. Dosch (Ed.), Germline Development in the Zebrafish (Vol. 2218, pp. 117–128). Humana. https://doi.org/10.1007/978-1-0716-0970-5_10","mla":"Xia, Peng, and Carl-Philipp J. Heisenberg. “Quantifying Tissue Tension in the Granulosa Layer after Laser Surgery.” Germline Development in the Zebrafish, edited by Roland Dosch, vol. 2218, Humana, 2021, pp. 117–28, doi:10.1007/978-1-0716-0970-5_10.","short":"P. Xia, C.-P.J. Heisenberg, in:, R. Dosch (Ed.), Germline Development in the Zebrafish, Humana, 2021, pp. 117–128.","chicago":"Xia, Peng, and Carl-Philipp J Heisenberg. “Quantifying Tissue Tension in the Granulosa Layer after Laser Surgery.” In Germline Development in the Zebrafish, edited by Roland Dosch, 2218:117–28. Humana, 2021. https://doi.org/10.1007/978-1-0716-0970-5_10."},"publication":"Germline Development in the Zebrafish","article_processing_charge":"No","day":"20","keyword":["Tissue tension","Morphogenesis","Laser ablation","Zebrafish folliculogenesis","Granulosa cells"],"scopus_import":"1","oa_version":"None","intvolume":" 2218","status":"public","title":"Quantifying tissue tension in the granulosa layer after laser surgery","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9245","abstract":[{"lang":"eng","text":"Tissue morphogenesis is driven by mechanical forces triggering cell movements and shape changes. Quantitatively measuring tension within tissues is of great importance for understanding the role of mechanical signals acting on the cell and tissue level during morphogenesis. Here we introduce laser ablation as a useful tool to probe tissue tension within the granulosa layer, an epithelial monolayer of somatic cells that surround the zebrafish female gamete during folliculogenesis. We describe in detail how to isolate follicles, mount samples, perform laser surgery, and analyze the data."}],"alternative_title":["Methods in Molecular Biology"],"type":"book_chapter","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"Bio"},{"_id":"PreCl"}],"doi":"10.1007/978-1-0716-0970-5_10","project":[{"grant_number":"742573","_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation"}],"quality_controlled":"1","external_id":{"pmid":["33606227"]},"publication_identifier":{"issn":["1064-3745"],"eisbn":["978-1-0716-0970-5"],"eissn":["1940-6029"],"isbn":["978-1-0716-0969-9"]},"month":"02","volume":2218,"date_updated":"2022-06-03T10:57:55Z","date_created":"2021-03-14T23:01:34Z","author":[{"full_name":"Xia, Peng","id":"4AB6C7D0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5419-7756","first_name":"Peng","last_name":"Xia"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"publisher":"Humana","department":[{"_id":"CaHe"}],"editor":[{"full_name":"Dosch, Roland","last_name":"Dosch","first_name":"Roland"}],"publication_status":"published","pmid":1,"year":"2021","acknowledgement":"We thank Prof. Masazumi Tada and Roland Dosch for providing transgenic zebrafish lines, the Heisenberg lab for technical assistance and feedback on the manuscript, and the Bioimaging and Fish facilities of IST Austria for continuous support. This work was funded by an ERC advanced grant (MECSPEC to C.-P.H.).","ec_funded":1},{"type":"journal_article","abstract":[{"text":"Several Ising-type magnetic van der Waals (vdW) materials exhibit stable magnetic ground states. Despite these clear experimental demonstrations, a complete theoretical and microscopic understanding of their magnetic anisotropy is still lacking. In particular, the validity limit of identifying their one-dimensional (1-D) Ising nature has remained uninvestigated in a quantitative way. Here we performed the complete mapping of magnetic anisotropy for a prototypical Ising vdW magnet FePS3 for the first time. Combining torque magnetometry measurements with their magnetostatic model analysis and the relativistic density functional total energy calculations, we successfully constructed the three-dimensional (3-D) mappings of the magnetic anisotropy in terms of magnetic torque and energy. The results not only quantitatively confirm that the easy axis is perpendicular to the ab plane, but also reveal the anisotropies within the ab, ac, and bc planes. Our approach can be applied to the detailed quantitative study of magnetism in vdW materials.","lang":"eng"}],"issue":"3","_id":"9282","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3","status":"public","intvolume":" 8","oa_version":"Preprint","keyword":["Mechanical Engineering","General Materials Science","Mechanics of Materials","General Chemistry","Condensed Matter Physics"],"day":"06","article_processing_charge":"No","publication":"2D Materials","citation":{"chicago":"Nauman, Muhammad, Do Hoon Kiem, Sungmin Lee, Suhan Son, J-G Park, Woun Kang, Myung Joon Han, and Youn Jung Jo. “Complete Mapping of Magnetic Anisotropy for Prototype Ising van Der Waals FePS3.” 2D Materials. IOP Publishing, 2021. https://doi.org/10.1088/2053-1583/abeed3.","mla":"Nauman, Muhammad, et al. “Complete Mapping of Magnetic Anisotropy for Prototype Ising van Der Waals FePS3.” 2D Materials, vol. 8, no. 3, 035011, IOP Publishing, 2021, doi:10.1088/2053-1583/abeed3.","short":"M. Nauman, D.H. Kiem, S. Lee, S. Son, J.-G. Park, W. Kang, M.J. Han, Y.J. Jo, 2D Materials 8 (2021).","ista":"Nauman M, Kiem DH, Lee S, Son S, Park J-G, Kang W, Han MJ, Jo YJ. 2021. Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3. 2D Materials. 8(3), 035011.","apa":"Nauman, M., Kiem, D. H., Lee, S., Son, S., Park, J.-G., Kang, W., … Jo, Y. J. (2021). Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3. 2D Materials. IOP Publishing. https://doi.org/10.1088/2053-1583/abeed3","ieee":"M. Nauman et al., “Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3,” 2D Materials, vol. 8, no. 3. IOP Publishing, 2021.","ama":"Nauman M, Kiem DH, Lee S, et al. Complete mapping of magnetic anisotropy for prototype Ising van der Waals FePS3. 2D Materials. 2021;8(3). doi:10.1088/2053-1583/abeed3"},"article_type":"original","date_published":"2021-04-06T00:00:00Z","article_number":"035011","extern":"1","year":"2021","publication_status":"published","department":[{"_id":"KiMo"}],"publisher":"IOP Publishing","author":[{"full_name":"Nauman, Muhammad","orcid":"0000-0002-2111-4846","id":"32c21954-2022-11eb-9d5f-af9f93c24e71","last_name":"Nauman","first_name":"Muhammad"},{"first_name":"Do Hoon","last_name":"Kiem","full_name":"Kiem, Do Hoon"},{"full_name":"Lee, Sungmin","last_name":"Lee","first_name":"Sungmin"},{"full_name":"Son, Suhan","first_name":"Suhan","last_name":"Son"},{"full_name":"Park, J-G","first_name":"J-G","last_name":"Park"},{"last_name":"Kang","first_name":"Woun","full_name":"Kang, Woun"},{"first_name":"Myung Joon","last_name":"Han","full_name":"Han, Myung Joon"},{"full_name":"Jo, Youn Jung","last_name":"Jo","first_name":"Youn Jung"}],"date_created":"2021-03-23T07:10:17Z","date_updated":"2021-12-01T10:36:56Z","volume":8,"month":"04","publication_identifier":{"issn":["2053-1583"]},"external_id":{"arxiv":["2103.09029"]},"oa":1,"main_file_link":[{"url":"https://arxiv.org/abs/2103.09029","open_access":"1"}],"quality_controlled":"1","doi":"10.1088/2053-1583/abeed3","language":[{"iso":"eng"}]},{"date_created":"2021-03-26T11:29:46Z","date_updated":"2023-02-23T13:53:59Z","volume":33,"author":[{"last_name":"Henheik","first_name":"Sven Joscha","orcid":"0000-0003-1106-327X","id":"31d731d7-d235-11ea-ad11-b50331c8d7fb","full_name":"Henheik, Sven Joscha"},{"full_name":"Teufel, Stefan","last_name":"Teufel","first_name":"Stefan"}],"publication_status":"published","publisher":"World Scientific Publishing","year":"2021","extern":"1","article_number":"2060004","language":[{"iso":"eng"}],"doi":"10.1142/s0129055x20600041","quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2002.08669"}],"external_id":{"arxiv":["2002.08669"]},"month":"02","publication_identifier":{"issn":["0129-055X","1793-6659"]},"oa_version":"Preprint","status":"public","ddc":["500"],"title":"Justifying Kubo’s formula for gapped systems at zero temperature: A brief review and some new results","intvolume":" 33","_id":"9285","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We first review the problem of a rigorous justification of Kubo’s formula for transport coefficients in gapped extended Hamiltonian quantum systems at zero temperature. In particular, the theoretical understanding of the quantum Hall effect rests on the validity of Kubo’s formula for such systems, a connection that we review briefly as well. We then highlight an approach to linear response theory based on non-equilibrium almost-stationary states (NEASS) and on a corresponding adiabatic theorem for such systems that was recently proposed and worked out by one of us in [51] for interacting fermionic systems on finite lattices. In the second part of our paper, we show how to lift the results of [51] to infinite systems by taking a thermodynamic limit.","lang":"eng"}],"issue":"01","type":"journal_article","date_published":"2021-02-01T00:00:00Z","article_type":"original","publication":"Reviews in Mathematical Physics","citation":{"apa":"Henheik, S. J., & Teufel, S. (2021). Justifying Kubo’s formula for gapped systems at zero temperature: A brief review and some new results. Reviews in Mathematical Physics. World Scientific Publishing. https://doi.org/10.1142/s0129055x20600041","ieee":"S. J. Henheik and S. Teufel, “Justifying Kubo’s formula for gapped systems at zero temperature: A brief review and some new results,” Reviews in Mathematical Physics, vol. 33, no. 01. World Scientific Publishing, 2021.","ista":"Henheik SJ, Teufel S. 2021. Justifying Kubo’s formula for gapped systems at zero temperature: A brief review and some new results. Reviews in Mathematical Physics. 33(01), 2060004.","ama":"Henheik SJ, Teufel S. Justifying Kubo’s formula for gapped systems at zero temperature: A brief review and some new results. Reviews in Mathematical Physics. 2021;33(01). doi:10.1142/s0129055x20600041","chicago":"Henheik, Sven Joscha, and Stefan Teufel. “Justifying Kubo’s Formula for Gapped Systems at Zero Temperature: A Brief Review and Some New Results.” Reviews in Mathematical Physics. World Scientific Publishing, 2021. https://doi.org/10.1142/s0129055x20600041.","short":"S.J. Henheik, S. Teufel, Reviews in Mathematical Physics 33 (2021).","mla":"Henheik, Sven Joscha, and Stefan Teufel. “Justifying Kubo’s Formula for Gapped Systems at Zero Temperature: A Brief Review and Some New Results.” Reviews in Mathematical Physics, vol. 33, no. 01, 2060004, World Scientific Publishing, 2021, doi:10.1142/s0129055x20600041."},"day":"01","has_accepted_license":"1","article_processing_charge":"No","keyword":["Mathematical Physics","Statistical and Nonlinear Physics"],"scopus_import":"1"},{"scopus_import":"1","day":"16","article_processing_charge":"No","page":"221-233","publication":"15th International Conference on Algorithms and Computation","citation":{"ista":"Aichholzer O, Arroyo Guevara AM, Masárová Z, Parada I, Perz D, Pilz A, Tkadlec J, Vogtenhuber B. 2021. On compatible matchings. 15th International Conference on Algorithms and Computation. WALCOM: Algorithms and Computation, LNCS, vol. 12635, 221–233.","ieee":"O. Aichholzer et al., “On compatible matchings,” in 15th International Conference on Algorithms and Computation, Yangon, Myanmar, 2021, vol. 12635, pp. 221–233.","apa":"Aichholzer, O., Arroyo Guevara, A. M., Masárová, Z., Parada, I., Perz, D., Pilz, A., … Vogtenhuber, B. (2021). On compatible matchings. In 15th International Conference on Algorithms and Computation (Vol. 12635, pp. 221–233). Yangon, Myanmar: Springer Nature. https://doi.org/10.1007/978-3-030-68211-8_18","ama":"Aichholzer O, Arroyo Guevara AM, Masárová Z, et al. On compatible matchings. In: 15th International Conference on Algorithms and Computation. Vol 12635. Springer Nature; 2021:221-233. doi:10.1007/978-3-030-68211-8_18","chicago":"Aichholzer, Oswin, Alan M Arroyo Guevara, Zuzana Masárová, Irene Parada, Daniel Perz, Alexander Pilz, Josef Tkadlec, and Birgit Vogtenhuber. “On Compatible Matchings.” In 15th International Conference on Algorithms and Computation, 12635:221–33. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-68211-8_18.","mla":"Aichholzer, Oswin, et al. “On Compatible Matchings.” 15th International Conference on Algorithms and Computation, vol. 12635, Springer Nature, 2021, pp. 221–33, doi:10.1007/978-3-030-68211-8_18.","short":"O. Aichholzer, A.M. Arroyo Guevara, Z. Masárová, I. Parada, D. Perz, A. Pilz, J. Tkadlec, B. Vogtenhuber, in:, 15th International Conference on Algorithms and Computation, Springer Nature, 2021, pp. 221–233."},"date_published":"2021-02-16T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":" matching is compatible to two or more labeled point sets of size n with labels {1,…,n} if its straight-line drawing on each of these point sets is crossing-free. We study the maximum number of edges in a matching compatible to two or more labeled point sets in general position in the plane. We show that for any two labeled convex sets of n points there exists a compatible matching with ⌊2n−−√⌋ edges. More generally, for any ℓ labeled point sets we construct compatible matchings of size Ω(n1/ℓ) . As a corresponding upper bound, we use probabilistic arguments to show that for any ℓ given sets of n points there exists a labeling of each set such that the largest compatible matching has O(n2/(ℓ+1)) edges. Finally, we show that Θ(logn) copies of any set of n points are necessary and sufficient for the existence of a labeling such that any compatible matching consists only of a single edge.","lang":"eng"}],"status":"public","title":"On compatible matchings","intvolume":" 12635","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9296","oa_version":"Preprint","month":"02","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030682101"]},"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","name":"Game Theory","call_identifier":"FWF"}],"oa":1,"external_id":{"arxiv":["2101.03928"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2101.03928"}],"language":[{"iso":"eng"}],"conference":{"name":"WALCOM: Algorithms and Computation","start_date":"2021-02-28","location":"Yangon, Myanmar","end_date":"2021-03-02"},"doi":"10.1007/978-3-030-68211-8_18","ec_funded":1,"publication_status":"published","department":[{"_id":"UlWa"},{"_id":"HeEd"},{"_id":"KrCh"}],"publisher":"Springer Nature","year":"2021","acknowledgement":"A.A. funded by the Marie Skłodowska-Curie grant agreement No. 754411. Z.M. partially funded by Wittgenstein Prize, Austrian Science Fund (FWF), grant no. Z 342-N31. I.P., D.P., and B.V. partially supported by FWF within the collaborative DACH project Arrangements and Drawings as FWF project I 3340-N35. A.P. supported by a Schrödinger fellowship of the FWF: J-3847-N35. J.T. partially supported by ERC Start grant no. (279307: Graph Games), FWF grant no. P23499-N23 and S11407-N23 (RiSE).","date_updated":"2023-02-21T16:33:44Z","date_created":"2021-03-28T22:01:41Z","volume":12635,"author":[{"full_name":"Aichholzer, Oswin","first_name":"Oswin","last_name":"Aichholzer"},{"last_name":"Arroyo Guevara","first_name":"Alan M","orcid":"0000-0003-2401-8670","id":"3207FDC6-F248-11E8-B48F-1D18A9856A87","full_name":"Arroyo Guevara, Alan M"},{"full_name":"Masárová, Zuzana","last_name":"Masárová","first_name":"Zuzana","orcid":"0000-0002-6660-1322","id":"45CFE238-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Irene","last_name":"Parada","full_name":"Parada, Irene"},{"full_name":"Perz, Daniel","last_name":"Perz","first_name":"Daniel"},{"last_name":"Pilz","first_name":"Alexander","full_name":"Pilz, Alexander"},{"orcid":"0000-0002-1097-9684","id":"3F24CCC8-F248-11E8-B48F-1D18A9856A87","last_name":"Tkadlec","first_name":"Josef","full_name":"Tkadlec, Josef"},{"first_name":"Birgit","last_name":"Vogtenhuber","full_name":"Vogtenhuber, Birgit"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"11938"}]}},{"department":[{"_id":"GradSch"},{"_id":"KrCh"}],"intvolume":" 29","publisher":"MIT Press","editor":[{"full_name":"Hertwig, Ralph","last_name":"Hertwig","first_name":"Ralph"},{"first_name":"Christoph","last_name":"Engel","full_name":"Engel, Christoph"}],"status":"public","title":"The evolution of strategic ignorance in strategic interaction","year":"2021","_id":"9403","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","volume":29,"date_updated":"2023-02-23T13:57:04Z","date_created":"2021-05-19T12:25:42Z","author":[{"last_name":"Schmid","first_name":"Laura","orcid":"0000-0002-6978-7329","id":"38B437DE-F248-11E8-B48F-1D18A9856A87","full_name":"Schmid, Laura"},{"full_name":"Hilbe, Christian","last_name":"Hilbe","first_name":"Christian"}],"type":"book_chapter","abstract":[{"lang":"eng","text":"Optimal decision making requires individuals to know their available options and to anticipate correctly what consequences these options have. In many social interactions, however, we refrain from gathering all relevant information, even if this information would help us make better decisions and is costless to obtain. This chapter examines several examples of “deliberate ignorance.” Two simple models are proposed to illustrate how ignorance can evolve among self-interested and payoff - maximizing individuals, and open problems are highlighted that lie ahead for future research to explore."}],"page":"139-152","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://esforum.de/publications/PDFs/sfr29/SFR29_09_Hilbe%20and%20Schmid.pdf"}],"citation":{"ama":"Schmid L, Hilbe C. The evolution of strategic ignorance in strategic interaction. In: Hertwig R, Engel C, eds. Deliberate Ignorance: Choosing Not To Know. Vol 29. Strüngmann Forum Reports. MIT Press; 2021:139-152.","ieee":"L. Schmid and C. Hilbe, “The evolution of strategic ignorance in strategic interaction,” in Deliberate Ignorance: Choosing Not To Know, vol. 29, R. Hertwig and C. Engel, Eds. MIT Press, 2021, pp. 139–152.","apa":"Schmid, L., & Hilbe, C. (2021). The evolution of strategic ignorance in strategic interaction. In R. Hertwig & C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know (Vol. 29, pp. 139–152). MIT Press.","ista":"Schmid L, Hilbe C. 2021.The evolution of strategic ignorance in strategic interaction. In: Deliberate Ignorance: Choosing Not To Know. vol. 29, 139–152.","short":"L. Schmid, C. Hilbe, in:, R. Hertwig, C. Engel (Eds.), Deliberate Ignorance: Choosing Not To Know, MIT Press, 2021, pp. 139–152.","mla":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, vol. 29, MIT Press, 2021, pp. 139–52.","chicago":"Schmid, Laura, and Christian Hilbe. “The Evolution of Strategic Ignorance in Strategic Interaction.” In Deliberate Ignorance: Choosing Not To Know, edited by Ralph Hertwig and Christoph Engel, 29:139–52. Strüngmann Forum Reports. MIT Press, 2021."},"oa":1,"publication":"Deliberate Ignorance: Choosing Not To Know","language":[{"iso":"eng"}],"date_published":"2021-03-01T00:00:00Z","series_title":"Strüngmann Forum Reports","publication_identifier":{"isbn":["978-0-262-04559-9"]},"article_processing_charge":"No","month":"03","day":"01"},{"scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","page":"45-67","citation":{"short":"M. Walter, in:, Public-Key Cryptography – PKC 2021, Springer Nature, 2021, pp. 45–67.","mla":"Walter, Michael. “The Convergence of Slide-Type Reductions.” Public-Key Cryptography – PKC 2021, vol. 12710, Springer Nature, 2021, pp. 45–67, doi:10.1007/978-3-030-75245-3_3.","chicago":"Walter, Michael. “The Convergence of Slide-Type Reductions.” In Public-Key Cryptography – PKC 2021, 12710:45–67. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-75245-3_3.","ama":"Walter M. The convergence of slide-type reductions. In: Public-Key Cryptography – PKC 2021. Vol 12710. Springer Nature; 2021:45-67. doi:10.1007/978-3-030-75245-3_3","ieee":"M. Walter, “The convergence of slide-type reductions,” in Public-Key Cryptography – PKC 2021, Virtual, 2021, vol. 12710, pp. 45–67.","apa":"Walter, M. (2021). The convergence of slide-type reductions. In Public-Key Cryptography – PKC 2021 (Vol. 12710, pp. 45–67). Virtual: Springer Nature. https://doi.org/10.1007/978-3-030-75245-3_3","ista":"Walter M. 2021. The convergence of slide-type reductions. Public-Key Cryptography – PKC 2021. PKC: IACR International Conference on Practice and Theory of Public Key Cryptography, LNCS, vol. 12710, 45–67."},"publication":"Public-Key Cryptography – PKC 2021","date_published":"2021-05-01T00:00:00Z","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"In this work, we apply the dynamical systems analysis of Hanrot et al. (CRYPTO’11) to a class of lattice block reduction algorithms that includes (natural variants of) slide reduction and block-Rankin reduction. This implies sharper bounds on the polynomial running times (in the query model) for these algorithms and opens the door to faster practical variants of slide reduction. We give heuristic arguments showing that such variants can indeed speed up slide reduction significantly in practice. This is confirmed by experimental evidence, which also shows that our variants are competitive with state-of-the-art reduction algorithms.","lang":"eng"}],"intvolume":" 12710","title":"The convergence of slide-type reductions","status":"public","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9466","file":[{"creator":"dernst","content_type":"application/pdf","file_size":489017,"access_level":"open_access","file_name":"2021_PKC_Walter.pdf","success":1,"checksum":"413e564d645ed93d7318672361d9d470","date_updated":"2022-05-27T09:48:31Z","date_created":"2022-05-27T09:48:31Z","file_id":"11416","relation":"main_file"}],"oa_version":"Published Version","publication_identifier":{"isbn":["9783030752446"],"eissn":["16113349"],"issn":["03029743"]},"month":"05","project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"}],"quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-75245-3_3","conference":{"name":"PKC: IACR International Conference on Practice and Theory of Public Key Cryptography","end_date":"2021-05-13","location":"Virtual","start_date":"2021-05-10"},"ec_funded":1,"file_date_updated":"2022-05-27T09:48:31Z","publisher":"Springer Nature","department":[{"_id":"KrPi"}],"publication_status":"published","acknowledgement":"This work was initiated in discussions with Léo Ducas, when the author was visiting the Simons Institute for the Theory of Computation during the program “Lattices: Algorithms, Complexity, and Cryptography”. We thank Thomas Espitau for pointing out a bug in a proof in an earlier version of this manuscript.","year":"2021","volume":12710,"date_created":"2021-06-06T22:01:29Z","date_updated":"2023-02-23T13:58:47Z","author":[{"first_name":"Michael","last_name":"Walter","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","full_name":"Walter, Michael"}]},{"file":[{"success":1,"checksum":"e52a832f1def52a2b23d21bcc09e646f","date_created":"2021-06-11T13:16:26Z","date_updated":"2021-06-11T13:16:26Z","file_id":"9544","relation":"main_file","creator":"kschuh","file_size":694706,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_Geometry_Edelsbrunner.pdf"}],"oa_version":"Published Version","intvolume":" 112","status":"public","ddc":["510"],"title":"A step in the Delaunay mosaic of order k","_id":"9465","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","issue":"1","abstract":[{"text":"Given a locally finite set 𝑋⊆ℝ𝑑 and an integer 𝑘≥0, we consider the function 𝐰𝑘:Del𝑘(𝑋)→ℝ on the dual of the order-k Voronoi tessellation, whose sublevel sets generalize the notion of alpha shapes from order-1 to order-k (Edelsbrunner et al. in IEEE Trans Inf Theory IT-29:551–559, 1983; Krasnoshchekov and Polishchuk in Inf Process Lett 114:76–83, 2014). While this function is not necessarily generalized discrete Morse, in the sense of Forman (Adv Math 134:90–145, 1998) and Freij (Discrete Math 309:3821–3829, 2009), we prove that it satisfies similar properties so that its increments can be meaningfully classified into critical and non-critical steps. This result extends to the case of weighted points and sheds light on k-fold covers with balls in Euclidean space.","lang":"eng"}],"type":"journal_article","date_published":"2021-04-01T00:00:00Z","article_type":"original","citation":{"chicago":"Edelsbrunner, Herbert, Anton Nikitenko, and Georg F Osang. “A Step in the Delaunay Mosaic of Order K.” Journal of Geometry. Springer Nature, 2021. https://doi.org/10.1007/s00022-021-00577-4.","short":"H. Edelsbrunner, A. Nikitenko, G.F. Osang, Journal of Geometry 112 (2021).","mla":"Edelsbrunner, Herbert, et al. “A Step in the Delaunay Mosaic of Order K.” Journal of Geometry, vol. 112, no. 1, 15, Springer Nature, 2021, doi:10.1007/s00022-021-00577-4.","ieee":"H. Edelsbrunner, A. Nikitenko, and G. F. Osang, “A step in the Delaunay mosaic of order k,” Journal of Geometry, vol. 112, no. 1. Springer Nature, 2021.","apa":"Edelsbrunner, H., Nikitenko, A., & Osang, G. F. (2021). A step in the Delaunay mosaic of order k. Journal of Geometry. Springer Nature. https://doi.org/10.1007/s00022-021-00577-4","ista":"Edelsbrunner H, Nikitenko A, Osang GF. 2021. A step in the Delaunay mosaic of order k. Journal of Geometry. 112(1), 15.","ama":"Edelsbrunner H, Nikitenko A, Osang GF. A step in the Delaunay mosaic of order k. Journal of Geometry. 2021;112(1). doi:10.1007/s00022-021-00577-4"},"publication":"Journal of Geometry","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","day":"01","scopus_import":"1","volume":112,"date_created":"2021-06-06T22:01:29Z","date_updated":"2022-05-12T11:41:45Z","author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner","first_name":"Herbert"},{"full_name":"Nikitenko, Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","first_name":"Anton","last_name":"Nikitenko"},{"last_name":"Osang","first_name":"Georg F","id":"464B40D6-F248-11E8-B48F-1D18A9856A87","full_name":"Osang, Georg F"}],"department":[{"_id":"HeEd"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","file_date_updated":"2021-06-11T13:16:26Z","article_number":"15","language":[{"iso":"eng"}],"doi":"10.1007/s00022-021-00577-4","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"publication_identifier":{"eissn":["14208997"],"issn":["00472468"]},"month":"04"},{"quality_controlled":"1","project":[{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411"}],"publication":"9th International Conference on Learning Representations","main_file_link":[{"url":"https://openreview.net/pdf?id=t86MwoUCCNe","open_access":"1"}],"oa":1,"citation":{"short":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, D.-A. Alistarh, in:, 9th International Conference on Learning Representations, 2021.","mla":"Davies, Peter, et al. “New Bounds for Distributed Mean Estimation and Variance Reduction.” 9th International Conference on Learning Representations, 2021.","chicago":"Davies, Peter, Vijaykrishna Gurunanthan, Niusha Moshrefi, Saleh Ashkboos, and Dan-Adrian Alistarh. “New Bounds for Distributed Mean Estimation and Variance Reduction.” In 9th International Conference on Learning Representations, 2021.","ama":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. New bounds for distributed mean estimation and variance reduction. In: 9th International Conference on Learning Representations. ; 2021.","apa":"Davies, P., Gurunanthan, V., Moshrefi, N., Ashkboos, S., & Alistarh, D.-A. (2021). New bounds for distributed mean estimation and variance reduction. In 9th International Conference on Learning Representations. Virtual.","ieee":"P. Davies, V. Gurunanthan, N. Moshrefi, S. Ashkboos, and D.-A. Alistarh, “New bounds for distributed mean estimation and variance reduction,” in 9th International Conference on Learning Representations, Virtual, 2021.","ista":"Davies P, Gurunanthan V, Moshrefi N, Ashkboos S, Alistarh D-A. 2021. New bounds for distributed mean estimation and variance reduction. 9th International Conference on Learning Representations. ICLR: International Conference on Learning Representations."},"external_id":{"arxiv":["2002.09268"]},"language":[{"iso":"eng"}],"conference":{"name":" ICLR: International Conference on Learning Representations","location":"Virtual","start_date":"2021-05-03","end_date":"2021-05-07"},"date_published":"2021-05-01T00:00:00Z","day":"01","month":"05","article_processing_charge":"No","status":"public","publication_status":"published","title":"New bounds for distributed mean estimation and variance reduction","department":[{"_id":"DaAl"}],"_id":"9543","year":"2021","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","date_updated":"2023-02-23T14:00:40Z","date_created":"2021-06-10T19:46:08Z","oa_version":"Published Version","author":[{"last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425","full_name":"Davies, Peter"},{"full_name":"Gurunanthan, Vijaykrishna","first_name":"Vijaykrishna","last_name":"Gurunanthan"},{"first_name":"Niusha ","last_name":"Moshrefi","id":"4db776ff-ce15-11eb-96e3-bc2b90b01c16","full_name":"Moshrefi, Niusha "},{"id":"0D0A9058-257B-11EA-A937-9341C3D8BC8A","last_name":"Ashkboos","first_name":"Saleh","full_name":"Ashkboos, Saleh"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"type":"conference","abstract":[{"lang":"eng","text":"We consider the problem ofdistributed mean estimation (DME), in which n machines are each given a local d-dimensional vector xv∈Rd, and must cooperate to estimate the mean of their inputs μ=1n∑nv=1xv, while minimizing total communication cost. DME is a fundamental construct in distributed machine learning, and there has been considerable work on variants of this problem, especially in the context of distributed variance reduction for stochastic gradients in parallel SGD. Previous work typically assumes an upper bound on the norm of the input vectors, and achieves an error bound in terms of this norm. However, in many real applications, the input vectors are concentrated around the correct output μ, but μ itself has large norm. In such cases, previous output error bounds perform poorly. In this paper, we show that output error bounds need not depend on input norm. We provide a method of quantization which allows distributed mean estimation to be performed with solution quality dependent only on the distance between inputs, not on input norm, and show an analogous result for distributed variance reduction. The technique is based on a new connection with lattice theory. We also provide lower bounds showing that the communication to error trade-off of our algorithms is asymptotically optimal. As the lattices achieving optimal bounds under l2-norm can be computationally impractical, we also present an extension which leverages easy-to-use cubic lattices, and is loose only up to a logarithmic factor ind. We show experimentally that our method yields practical improvements for common applications, relative to prior approaches."}],"ec_funded":1},{"type":"journal_article","abstract":[{"text":"We prove that every n-vertex tournament G has an acyclic subgraph with chromatic number at least n5/9−o(1), while there exists an n-vertex tournament G whose every acyclic subgraph has chromatic number at most n3/4+o(1). This establishes in a strong form a conjecture of Nassar and Yuster and improves on another result of theirs. Our proof combines probabilistic and spectral techniques together with some additional ideas. In particular, we prove a lemma showing that every tournament with many transitive subtournaments has a large subtournament that is almost transitive. This may be of independent interest.","lang":"eng"}],"issue":"2","title":"Acyclic subgraphs of tournaments with high chromatic number","status":"public","intvolume":" 53","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9572","oa_version":"Preprint","scopus_import":"1","day":"03","article_processing_charge":"No","article_type":"original","page":"619-630","publication":"Bulletin of the London Mathematical Society","citation":{"chicago":"Fox, Jacob, Matthew Alan Kwan, and Benny Sudakov. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” Bulletin of the London Mathematical Society. Wiley, 2021. https://doi.org/10.1112/blms.12446.","mla":"Fox, Jacob, et al. “Acyclic Subgraphs of Tournaments with High Chromatic Number.” Bulletin of the London Mathematical Society, vol. 53, no. 2, Wiley, 2021, pp. 619–30, doi:10.1112/blms.12446.","short":"J. Fox, M.A. Kwan, B. Sudakov, Bulletin of the London Mathematical Society 53 (2021) 619–630.","ista":"Fox J, Kwan MA, Sudakov B. 2021. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 53(2), 619–630.","apa":"Fox, J., Kwan, M. A., & Sudakov, B. (2021). Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. Wiley. https://doi.org/10.1112/blms.12446","ieee":"J. Fox, M. A. Kwan, and B. Sudakov, “Acyclic subgraphs of tournaments with high chromatic number,” Bulletin of the London Mathematical Society, vol. 53, no. 2. Wiley, pp. 619–630, 2021.","ama":"Fox J, Kwan MA, Sudakov B. Acyclic subgraphs of tournaments with high chromatic number. Bulletin of the London Mathematical Society. 2021;53(2):619-630. doi:10.1112/blms.12446"},"date_published":"2021-04-03T00:00:00Z","extern":"1","publication_status":"published","publisher":"Wiley","year":"2021","date_created":"2021-06-21T06:11:56Z","date_updated":"2023-02-23T14:01:21Z","volume":53,"author":[{"full_name":"Fox, Jacob","last_name":"Fox","first_name":"Jacob"},{"last_name":"Kwan","first_name":"Matthew Alan","orcid":"0000-0002-4003-7567","id":"5fca0887-a1db-11eb-95d1-ca9d5e0453b3","full_name":"Kwan, Matthew Alan"},{"last_name":"Sudakov","first_name":"Benny","full_name":"Sudakov, Benny"}],"month":"04","publication_identifier":{"issn":["0024-6093"],"eissn":["1469-2120"]},"quality_controlled":"1","main_file_link":[{"url":"https://arxiv.org/abs/1912.07722","open_access":"1"}],"oa":1,"external_id":{"arxiv":["1912.07722"]},"language":[{"iso":"eng"}],"doi":"10.1112/blms.12446"},{"license":"https://creativecommons.org/licenses/by-nd/4.0/","file_date_updated":"2021-08-12T10:57:21Z","publication_status":"accepted","department":[{"_id":"GradSch"},{"_id":"VlKo"}],"year":"2021","date_updated":"2021-08-12T10:57:39Z","date_created":"2021-06-22T15:57:11Z","author":[{"id":"40ED02A8-C8B4-11E9-A9C0-453BE6697425","orcid":"0000-0001-5293-214X","first_name":"Martin","last_name":"Dvorak","full_name":"Dvorak, Martin"},{"last_name":"Nicholson","first_name":"Sara","full_name":"Nicholson, Sara"}],"month":"06","quality_controlled":"1","tmp":{"short":"CC BY-ND (4.0)","image":"/image/cc_by_nd.png","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode"},"external_id":{"arxiv":["2106.11247"]},"oa":1,"language":[{"iso":"eng"}],"conference":{"start_date":"2021-08-10","location":"Halifax, NS, Canada","end_date":"2021-08-12","name":"CCCG: Canadian Conference on Computational Geometry"},"type":"conference","abstract":[{"text":"The convex grabbing game is a game where two players, Alice and Bob, alternate taking extremal points from the convex hull of a point set on the plane. Rational weights are given to the points. The goal of each player is to maximize the total weight over all points that they obtain. We restrict the setting to the case of binary weights. We show a construction of an arbitrarily large odd-sized point set that allows Bob to obtain almost 3/4 of the total weight. This construction answers a question asked by Matsumoto, Nakamigawa, and Sakuma in [Graphs and Combinatorics, 36/1 (2020)]. We also present an arbitrarily large even-sized point set where Bob can obtain the entirety of the total weight. Finally, we discuss conjectures about optimum moves in the convex grabbing game for both players in general.","lang":"eng"}],"ddc":["516"],"title":"Massively winning configurations in the convex grabbing game on the plane","status":"public","_id":"9592","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"access_level":"open_access","file_name":"Convex-Grabbing-Game_CCCG_proc_version.pdf","content_type":"application/pdf","file_size":381306,"creator":"mdvorak","relation":"main_file","file_id":"9616","checksum":"45accb1de9b7e0e4bb2fbfe5fd3e6239","success":1,"date_created":"2021-06-28T20:23:13Z","date_updated":"2021-06-28T20:23:13Z"},{"date_created":"2021-08-12T10:57:21Z","date_updated":"2021-08-12T10:57:21Z","success":1,"checksum":"9199cf18c65658553487458cc24d0ab2","file_id":"9902","relation":"main_file","creator":"kschuh","content_type":"application/pdf","file_size":403645,"file_name":"Convex-Grabbing-Game_FULL-VERSION.pdf","access_level":"open_access"}],"keyword":["convex grabbing game","graph grabbing game","combinatorial game","convex geometry"],"day":"29","has_accepted_license":"1","article_processing_charge":"No","publication":"Proceedings of the 33rd Canadian Conference on Computational Geometry","citation":{"chicago":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” In Proceedings of the 33rd Canadian Conference on Computational Geometry, n.d.","short":"M. Dvorak, S. Nicholson, in:, Proceedings of the 33rd Canadian Conference on Computational Geometry, n.d.","mla":"Dvorak, Martin, and Sara Nicholson. “Massively Winning Configurations in the Convex Grabbing Game on the Plane.” Proceedings of the 33rd Canadian Conference on Computational Geometry.","ieee":"M. Dvorak and S. Nicholson, “Massively winning configurations in the convex grabbing game on the plane,” in Proceedings of the 33rd Canadian Conference on Computational Geometry, Halifax, NS, Canada.","apa":"Dvorak, M., & Nicholson, S. (n.d.). Massively winning configurations in the convex grabbing game on the plane. In Proceedings of the 33rd Canadian Conference on Computational Geometry. Halifax, NS, Canada.","ista":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. Proceedings of the 33rd Canadian Conference on Computational Geometry. CCCG: Canadian Conference on Computational Geometry.","ama":"Dvorak M, Nicholson S. Massively winning configurations in the convex grabbing game on the plane. In: Proceedings of the 33rd Canadian Conference on Computational Geometry."},"date_published":"2021-06-29T00:00:00Z"},{"article_processing_charge":"No","has_accepted_license":"1","day":"26","scopus_import":"1","date_published":"2021-01-26T00:00:00Z","article_type":"original","citation":{"apa":"Reinhardt, A., & Cheng, B. (2021). Quantum-mechanical exploration of the phase diagram of water. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-020-20821-w","ieee":"A. Reinhardt and B. Cheng, “Quantum-mechanical exploration of the phase diagram of water,” Nature Communications, vol. 12, no. 1. Springer Nature, 2021.","ista":"Reinhardt A, Cheng B. 2021. Quantum-mechanical exploration of the phase diagram of water. Nature Communications. 12(1), 588.","ama":"Reinhardt A, Cheng B. Quantum-mechanical exploration of the phase diagram of water. Nature Communications. 2021;12(1). doi:10.1038/s41467-020-20821-w","chicago":"Reinhardt, Aleks, and Bingqing Cheng. “Quantum-Mechanical Exploration of the Phase Diagram of Water.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-020-20821-w.","short":"A. Reinhardt, B. Cheng, Nature Communications 12 (2021).","mla":"Reinhardt, Aleks, and Bingqing Cheng. “Quantum-Mechanical Exploration of the Phase Diagram of Water.” Nature Communications, vol. 12, no. 1, 588, Springer Nature, 2021, doi:10.1038/s41467-020-20821-w."},"publication":"Nature Communications","issue":"1","abstract":[{"lang":"eng","text":"The set of known stable phases of water may not be complete, and some of the phase boundaries between them are fuzzy. Starting from liquid water and a comprehensive set of 50 ice structures, we compute the phase diagram at three hybrid density-functional-theory levels of approximation, accounting for thermal and nuclear fluctuations as well as proton disorder. Such calculations are only made tractable because we combine machine-learning methods and advanced free-energy techniques. The computed phase diagram is in qualitative agreement with experiment, particularly at pressures ≲ 8000 bar, and the discrepancy in chemical potential is comparable with the subtle uncertainties introduced by proton disorder and the spread between the three hybrid functionals. None of the hypothetical ice phases considered is thermodynamically stable in our calculations, suggesting the completeness of the experimental water phase diagram in the region considered. Our work demonstrates the feasibility of predicting the phase diagram of a polymorphic system from first principles and provides a thermodynamic way of testing the limits of quantum-mechanical calculations."}],"type":"journal_article","oa_version":"Published Version","file":[{"file_id":"9670","relation":"main_file","date_created":"2021-07-15T13:55:46Z","date_updated":"2021-07-15T13:55:46Z","success":1,"checksum":"8b5e1fbe2f1ab936047008043150e894","file_name":"2021_NatureCommunications_Reinhardt.pdf","access_level":"open_access","creator":"asandaue","file_size":1180227,"content_type":"application/pdf"}],"intvolume":" 12","title":"Quantum-mechanical exploration of the phase diagram of water","status":"public","ddc":["530","540"],"user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9669","publication_identifier":{"eissn":["2041-1723"]},"month":"01","language":[{"iso":"eng"}],"doi":"10.1038/s41467-020-20821-w","quality_controlled":"1","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2010.13729"],"pmid":["33500405"]},"oa":1,"extern":"1","file_date_updated":"2021-07-15T13:55:46Z","article_number":"588","volume":12,"date_created":"2021-07-15T13:48:13Z","date_updated":"2023-02-23T14:04:20Z","author":[{"first_name":"Aleks","last_name":"Reinhardt","full_name":"Reinhardt, Aleks"},{"full_name":"Cheng, Bingqing","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","first_name":"Bingqing","last_name":"Cheng"}],"publisher":"Springer Nature","publication_status":"published","pmid":1,"year":"2021"},{"publication_status":"submitted","status":"public","title":"Ranking the information content of distance measures","_id":"9695","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","year":"2021","date_created":"2021-07-20T06:31:53Z","date_updated":"2023-02-23T14:05:13Z","oa_version":"Preprint","author":[{"first_name":"Aldo","last_name":"Glielmo","full_name":"Glielmo, Aldo"},{"first_name":"Claudio","last_name":"Zeni","full_name":"Zeni, Claudio"},{"first_name":"Bingqing","last_name":"Cheng","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","orcid":"0000-0002-3584-9632","full_name":"Cheng, Bingqing"},{"full_name":"Csanyi, Gabor","last_name":"Csanyi","first_name":"Gabor"},{"first_name":"Alessandro","last_name":"Laio","full_name":"Laio, Alessandro"}],"article_number":"2104.15079","type":"preprint","extern":"1","abstract":[{"text":"Real-world data typically contain a large number of features that are often heterogeneous in nature, relevance, and also units of measure. When assessing the similarity between data points, one can build various distance measures using subsets of these features. Using the fewest features but still retaining sufficient information about the system is crucial in many statistical learning approaches, particularly when data are sparse. We introduce a statistical test that can assess the relative information retained when using two different distance measures, and determine if they are equivalent, independent, or if one is more informative than the other. This in turn allows finding the most informative distance measure out of a pool of candidates. The approach is applied to find the most relevant policy variables for controlling the Covid-19 epidemic and to find compact yet informative representations of atomic structures, but its potential applications are wide ranging in many branches of science.","lang":"eng"}],"publication":"arXiv","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2104.15079"}],"citation":{"chicago":"Glielmo, Aldo, Claudio Zeni, Bingqing Cheng, Gabor Csanyi, and Alessandro Laio. “Ranking the Information Content of Distance Measures.” ArXiv, n.d.","mla":"Glielmo, Aldo, et al. “Ranking the Information Content of Distance Measures.” ArXiv, 2104.15079.","short":"A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, A. Laio, ArXiv (n.d.).","ista":"Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. Ranking the information content of distance measures. arXiv, 2104.15079.","apa":"Glielmo, A., Zeni, C., Cheng, B., Csanyi, G., & Laio, A. (n.d.). Ranking the information content of distance measures. arXiv.","ieee":"A. Glielmo, C. Zeni, B. Cheng, G. Csanyi, and A. Laio, “Ranking the information content of distance measures,” arXiv. .","ama":"Glielmo A, Zeni C, Cheng B, Csanyi G, Laio A. Ranking the information content of distance measures. arXiv."},"external_id":{"arxiv":["2104.15079"]},"language":[{"iso":"eng"}],"date_published":"2021-04-30T00:00:00Z","day":"30","month":"04","article_processing_charge":"No"},{"author":[{"orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing","full_name":"Cheng, Bingqing"},{"last_name":"Bethkenhagen","first_name":"Mandy","full_name":"Bethkenhagen, Mandy"},{"full_name":"Pickard, Chris J.","last_name":"Pickard","first_name":"Chris J."},{"full_name":"Hamel, Sebastien","first_name":"Sebastien","last_name":"Hamel"}],"oa_version":"Preprint","date_updated":"2023-02-23T14:05:16Z","date_created":"2021-07-20T06:42:29Z","year":"2021","_id":"9696","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","title":"Predicting the phase behaviors of superionic water at planetary conditions","publication_status":"submitted","abstract":[{"text":"Most water in the universe may be superionic, and its thermodynamic and transport properties are crucial for planetary science but difficult to probe experimentally or theoretically. We use machine learning and free energy methods to overcome the limitations of quantum mechanical simulations, and characterize hydrogen diffusion, superionic transitions, and phase behaviors of water at extreme conditions. We predict that a close-packed superionic phase with mixed stacking is stable over a wide temperature and pressure range, while a body-centered cubic phase is only thermodynamically stable in a small window but is kinetically favored. Our phase boundaries, which are consistent with the existing-albeit scarce-experimental observations, help resolve the fractions of insulating ice, different superionic phases, and liquid water inside of ice giants.","lang":"eng"}],"extern":"1","type":"preprint","article_number":"2103.09035","date_published":"2021-03-16T00:00:00Z","language":[{"iso":"eng"}],"external_id":{"arxiv":["2103.09035"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.09035"}],"oa":1,"citation":{"ama":"Cheng B, Bethkenhagen M, Pickard CJ, Hamel S. Predicting the phase behaviors of superionic water at planetary conditions. arXiv.","ista":"Cheng B, Bethkenhagen M, Pickard CJ, Hamel S. Predicting the phase behaviors of superionic water at planetary conditions. arXiv, 2103.09035.","apa":"Cheng, B., Bethkenhagen, M., Pickard, C. J., & Hamel, S. (n.d.). Predicting the phase behaviors of superionic water at planetary conditions. arXiv.","ieee":"B. Cheng, M. Bethkenhagen, C. J. Pickard, and S. Hamel, “Predicting the phase behaviors of superionic water at planetary conditions,” arXiv. .","mla":"Cheng, Bingqing, et al. “Predicting the Phase Behaviors of Superionic Water at Planetary Conditions.” ArXiv, 2103.09035.","short":"B. Cheng, M. Bethkenhagen, C.J. Pickard, S. Hamel, ArXiv (n.d.).","chicago":"Cheng, Bingqing, Mandy Bethkenhagen, Chris J. Pickard, and Sebastien Hamel. “Predicting the Phase Behaviors of Superionic Water at Planetary Conditions.” ArXiv, n.d."},"publication":"arXiv","article_processing_charge":"No","day":"16","month":"03"},{"language":[{"iso":"eng"}],"date_published":"2021-01-01T00:00:00Z","doi":"10.1101/2020.12.31.425016","project":[{"grant_number":"725780","_id":"260018B0-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Principles of Neural Stem Cell Lineage Progression in Cerebral Cortex Development"}],"publication":"bioRxiv","oa":1,"citation":{"short":"D.J. Anderson, F. Pauler, A. McKenna, J. Shendure, S. Hippenmeyer, M.S. Horwitz, BioRxiv (n.d.).","mla":"Anderson, Donovan J., et al. “Simultaneous Identification of Brain Cell Type and Lineage via Single Cell RNA Sequencing.” BioRxiv, Cold Spring Harbor Laboratory, doi:10.1101/2020.12.31.425016.","chicago":"Anderson, Donovan J., Florian Pauler, Aaron McKenna, Jay Shendure, Simon Hippenmeyer, and Marshall S. Horwitz. “Simultaneous Identification of Brain Cell Type and Lineage via Single Cell RNA Sequencing.” BioRxiv. Cold Spring Harbor Laboratory, n.d. https://doi.org/10.1101/2020.12.31.425016.","ama":"Anderson DJ, Pauler F, McKenna A, Shendure J, Hippenmeyer S, Horwitz MS. Simultaneous identification of brain cell type and lineage via single cell RNA sequencing. bioRxiv. doi:10.1101/2020.12.31.425016","apa":"Anderson, D. J., Pauler, F., McKenna, A., Shendure, J., Hippenmeyer, S., & Horwitz, M. S. (n.d.). Simultaneous identification of brain cell type and lineage via single cell RNA sequencing. bioRxiv. Cold Spring Harbor Laboratory. https://doi.org/10.1101/2020.12.31.425016","ieee":"D. J. Anderson, F. Pauler, A. McKenna, J. Shendure, S. Hippenmeyer, and M. S. Horwitz, “Simultaneous identification of brain cell type and lineage via single cell RNA sequencing,” bioRxiv. Cold Spring Harbor Laboratory.","ista":"Anderson DJ, Pauler F, McKenna A, Shendure J, Hippenmeyer S, Horwitz MS. Simultaneous identification of brain cell type and lineage via single cell RNA sequencing. bioRxiv, 10.1101/2020.12.31.425016."},"main_file_link":[{"url":"https://doi.org/10.1101/2020.12.31.425016","open_access":"1"}],"month":"01","day":"01","article_processing_charge":"No","date_created":"2021-02-04T07:23:23Z","date_updated":"2021-02-04T07:29:53Z","oa_version":"Preprint","author":[{"last_name":"Anderson","first_name":"Donovan J.","full_name":"Anderson, Donovan J."},{"first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","full_name":"Pauler, Florian"},{"full_name":"McKenna, Aaron","first_name":"Aaron","last_name":"McKenna"},{"full_name":"Shendure, Jay","last_name":"Shendure","first_name":"Jay"},{"id":"37B36620-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2279-1061","first_name":"Simon","last_name":"Hippenmeyer","full_name":"Hippenmeyer, Simon"},{"last_name":"Horwitz","first_name":"Marshall S.","full_name":"Horwitz, Marshall S."}],"status":"public","publication_status":"submitted","title":"Simultaneous identification of brain cell type and lineage via single cell RNA sequencing","publisher":"Cold Spring Harbor Laboratory","department":[{"_id":"SiHi"}],"acknowledgement":"We thank Bill Bolosky, Microsoft Research, for earlier work showing proof of concept in TCGA\r\nbulk RNA-seq data. Supported by the Paul G. Allen Frontiers Group (University of Washington);\r\nNIH R00HG010152 (Dartmouth); and NÖ Forschung und Bildung n[f+b] life science call grant\r\n(C13-002) to SH, and the European Research Council (ERC) under the European Union’s\r\nHorizon 2020 research and innovation program 725780 LinPro to SH.","_id":"9082","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","abstract":[{"lang":"eng","text":"Acquired mutations are sufficiently frequent such that the genome of a single cell offers a record of its history of cell divisions. Among more common somatic genomic alterations are loss of heterozygosity (LOH). Large LOH events are potentially detectable in single cell RNA sequencing (scRNA-seq) datasets as tracts of monoallelic expression for constitutionally heterozygous single nucleotide variants (SNVs) located among contiguous genes. We identified runs of monoallelic expression, consistent with LOH, uniquely distributed throughout the genome in single cell brain cortex transcriptomes of F1 hybrids involving different inbred mouse strains. We then phylogenetically reconstructed single cell lineages and simultaneously identified cell types by corresponding gene expression patterns. Our results are consistent with progenitor cells giving rise to multiple cortical cell types through stereotyped expansion and distinct waves of neurogenesis. Compared to engineered recording systems, LOH events accumulate throughout the genome and across the lifetime of an organism, affording tremendous capacity for encoding lineage information and increasing resolution for later cell divisions. This approach can conceivably be computationally incorporated into scRNA-seq analysis and may be useful for organisms where genetic engineering is prohibitive, such as humans."}],"ec_funded":1,"type":"preprint"},{"oa":1,"tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","image":"/images/cc_by_nc.png","short":"CC BY-NC (4.0)"},"quality_controlled":"1","doi":"10.1029/2020ms002256","language":[{"iso":"eng"}],"publication_identifier":{"issn":["1942-2466","1942-2466"]},"month":"02","year":"2021","publisher":"American Geophysical Union","publication_status":"published","author":[{"full_name":"Fildier, Benjamin","first_name":"Benjamin","last_name":"Fildier"},{"last_name":"Collins","first_name":"William D.","full_name":"Collins, William D."},{"full_name":"Muller, Caroline J","id":"f978ccb0-3f7f-11eb-b193-b0e2bd13182b","orcid":"0000-0001-5836-5350","first_name":"Caroline J","last_name":"Muller"}],"volume":13,"date_updated":"2022-01-24T12:26:01Z","date_created":"2021-02-15T15:10:01Z","article_number":"e2020MS002256","file_date_updated":"2021-08-11T12:23:01Z","extern":"1","citation":{"mla":"Fildier, Benjamin, et al. “Distortions of the Rain Distribution with Warming, with and without Self‐aggregation.” Journal of Advances in Modeling Earth Systems, vol. 13, no. 2, e2020MS002256, American Geophysical Union, 2021, doi:10.1029/2020ms002256.","short":"B. Fildier, W.D. Collins, C.J. Muller, Journal of Advances in Modeling Earth Systems 13 (2021).","chicago":"Fildier, Benjamin, William D. Collins, and Caroline J Muller. “Distortions of the Rain Distribution with Warming, with and without Self‐aggregation.” Journal of Advances in Modeling Earth Systems. American Geophysical Union, 2021. https://doi.org/10.1029/2020ms002256.","ama":"Fildier B, Collins WD, Muller CJ. Distortions of the rain distribution with warming, with and without self‐aggregation. Journal of Advances in Modeling Earth Systems. 2021;13(2). doi:10.1029/2020ms002256","ista":"Fildier B, Collins WD, Muller CJ. 2021. Distortions of the rain distribution with warming, with and without self‐aggregation. Journal of Advances in Modeling Earth Systems. 13(2), e2020MS002256.","apa":"Fildier, B., Collins, W. D., & Muller, C. J. (2021). Distortions of the rain distribution with warming, with and without self‐aggregation. Journal of Advances in Modeling Earth Systems. American Geophysical Union. https://doi.org/10.1029/2020ms002256","ieee":"B. Fildier, W. D. Collins, and C. J. Muller, “Distortions of the rain distribution with warming, with and without self‐aggregation,” Journal of Advances in Modeling Earth Systems, vol. 13, no. 2. American Geophysical Union, 2021."},"publication":"Journal of Advances in Modeling Earth Systems","article_type":"original","date_published":"2021-02-01T00:00:00Z","scopus_import":"1","keyword":["Global and Planetary Change","General Earth and Planetary Sciences","Environmental Chemistry"],"has_accepted_license":"1","article_processing_charge":"No","day":"01","_id":"9151","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","intvolume":" 13","title":"Distortions of the rain distribution with warming, with and without self‐aggregation","status":"public","ddc":["550"],"file":[{"relation":"main_file","file_id":"9881","checksum":"591ce69b7a36f24346d2061ac712f0f4","success":1,"date_created":"2021-08-11T12:23:01Z","date_updated":"2021-08-11T12:23:01Z","access_level":"open_access","file_name":"2021_JAMES_Fildier.pdf","file_size":1947936,"content_type":"application/pdf","creator":"kschuh"}],"oa_version":"Published Version","type":"journal_article","issue":"2","abstract":[{"lang":"eng","text":"We investigate how mesoscale circulations associated with convective aggregation can modulate the sensitivity of the hydrologic cycle to warming. We quantify changes in the full distribution of rain across radiative‐convective equilibrium states in a cloud‐resolving model. For a given SST, the shift in mean rainfall between disorganized and organized states is associated with a shift in atmospheric radiative cooling, and is roughly analogous to the effect of a 4K SST increase. With rising temperatures, the increase in mean rain rate is insensitive to the presence of organization, while extremes can intensify faster in the aggregated state, leading to a faster amplification in the sporadic nature of rain. When convection aggregates, heavy rain is enhanced by 20‐30% and nonlinear behaviors are observed as a function of SST and strength of aggregation feedbacks. First, radiative‐ and surface‐flux aggregation feedbacks have multiplicative effects on extremes, illustrating a non‐trivial sensitivity to the degree of organization. Second, alternating Clausius‐Clapeyron and super‐Clausius‐Clapeyron regimes in extreme rainfall are found as a function of SST, corresponding to varying thermodynamic and dynamic contributions, and a large sensitivity to precipitation efficiency variations in some SST ranges.\r\nThe potential for mesoscale circulations in amplifying the hydrologic cycle is established. However these nonlinear distortions question the quantitative relevance of idealized self‐aggregation. This calls for a deeper investigation of relationships which capture the coupling between global energetics, aggregation feedbacks and local convection, and for systematic tests of their sensitivity to domain configurations, surface boundary conditions, microphysics and turbulence schemes."}]},{"page":"246-259","publication":"42nd German Conference on Pattern Recognition","citation":{"ama":"Volhejn V, Lampert C. Does SGD implicitly optimize for smoothness? In: 42nd German Conference on Pattern Recognition. Vol 12544. LNCS. Springer; 2021:246-259. doi:10.1007/978-3-030-71278-5_18","ista":"Volhejn V, Lampert C. 2021. Does SGD implicitly optimize for smoothness? 42nd German Conference on Pattern Recognition. DAGM GCPR: German Conference on Pattern Recognition LNCS vol. 12544, 246–259.","ieee":"V. Volhejn and C. Lampert, “Does SGD implicitly optimize for smoothness?,” in 42nd German Conference on Pattern Recognition, Tübingen, Germany, 2021, vol. 12544, pp. 246–259.","apa":"Volhejn, V., & Lampert, C. (2021). Does SGD implicitly optimize for smoothness? In 42nd German Conference on Pattern Recognition (Vol. 12544, pp. 246–259). Tübingen, Germany: Springer. https://doi.org/10.1007/978-3-030-71278-5_18","mla":"Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?” 42nd German Conference on Pattern Recognition, vol. 12544, Springer, 2021, pp. 246–59, doi:10.1007/978-3-030-71278-5_18.","short":"V. Volhejn, C. Lampert, in:, 42nd German Conference on Pattern Recognition, Springer, 2021, pp. 246–259.","chicago":"Volhejn, Vaclav, and Christoph Lampert. “Does SGD Implicitly Optimize for Smoothness?” In 42nd German Conference on Pattern Recognition, 12544:246–59. LNCS. Springer, 2021. https://doi.org/10.1007/978-3-030-71278-5_18."},"date_published":"2021-03-17T00:00:00Z","series_title":"LNCS","scopus_import":"1","day":"17","article_processing_charge":"No","has_accepted_license":"1","ddc":["510"],"title":"Does SGD implicitly optimize for smoothness?","status":"public","intvolume":" 12544","_id":"9210","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"relation":"main_file","file_id":"11820","date_updated":"2022-08-12T07:27:58Z","date_created":"2022-08-12T07:27:58Z","checksum":"3e3628ab1cf658d82524963f808004ea","success":1,"file_name":"2020_GCPR_submitted_Volhejn.pdf","access_level":"open_access","file_size":420234,"content_type":"application/pdf","creator":"dernst"}],"type":"conference","abstract":[{"text":"Modern neural networks can easily fit their training set perfectly. Surprisingly, despite being “overfit” in this way, they tend to generalize well to future data, thereby defying the classic bias–variance trade-off of machine learning theory. Of the many possible explanations, a prevalent one is that training by stochastic gradient descent (SGD) imposes an implicit bias that leads it to learn simple functions, and these simple functions generalize well. However, the specifics of this implicit bias are not well understood.\r\nIn this work, we explore the smoothness conjecture which states that SGD is implicitly biased towards learning functions that are smooth. We propose several measures to formalize the intuitive notion of smoothness, and we conduct experiments to determine whether SGD indeed implicitly optimizes for these measures. Our findings rule out the possibility that smoothness measures based on first-order derivatives are being implicitly enforced. They are supportive, though, of the smoothness conjecture for measures based on second-order derivatives.","lang":"eng"}],"quality_controlled":"1","oa":1,"language":[{"iso":"eng"}],"conference":{"location":"Tübingen, Germany","start_date":"2020-09-28","end_date":"2020-10-01","name":"DAGM GCPR: German Conference on Pattern Recognition "},"doi":"10.1007/978-3-030-71278-5_18","month":"03","publication_identifier":{"issn":["0302-9743"],"eissn":["1611-3349"],"isbn":["9783030712778"]},"publication_status":"published","publisher":"Springer","department":[{"_id":"ChLa"}],"year":"2021","date_updated":"2022-08-12T07:28:47Z","date_created":"2021-03-01T09:01:16Z","volume":12544,"author":[{"full_name":"Volhejn, Vaclav","first_name":"Vaclav","last_name":"Volhejn","id":"d5235fb4-7a6d-11eb-b254-f25d12d631a8"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"}],"file_date_updated":"2022-08-12T07:27:58Z"},{"volume":189,"date_updated":"2023-02-23T13:55:40Z","date_created":"2021-04-22T08:09:58Z","author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"orcid":"0000-0002-1780-2689","id":"4879BB4E-F248-11E8-B48F-1D18A9856A87","last_name":"Heiss","first_name":"Teresa","full_name":"Heiss, Teresa"},{"full_name":" Kurlin , Vitaliy","first_name":"Vitaliy","last_name":" Kurlin "},{"first_name":"Philip","last_name":"Smith","full_name":"Smith, Philip"},{"first_name":"Mathijs","last_name":"Wintraecken","id":"307CFBC8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7472-2220","full_name":"Wintraecken, Mathijs"}],"department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","publication_status":"published","acknowledgement":"The authors thank Janos Pach for insightful discussions on the topic of thispaper, Morteza Saghafian for finding the one-dimensional counterexample mentioned in Section 5,and Larry Andrews for generously sharing his crystallographic perspective.","year":"2021","ec_funded":1,"file_date_updated":"2021-04-22T08:08:14Z","language":[{"iso":"eng"}],"doi":"10.4230/LIPIcs.SoCG.2021.32","conference":{"end_date":"2021-06-11","location":"Virtual","start_date":"2021-06-07","name":"SoCG: Symposium on Computational Geometry"},"project":[{"name":"Alpha Shape Theory Extended","call_identifier":"H2020","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","grant_number":"788183"},{"name":"Discretization in Geometry and Dynamics","grant_number":"I4887","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316"},{"_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","call_identifier":"FWF","name":"The Wittgenstein Prize"},{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"publication_identifier":{"issn":["1868-8969"]},"month":"06","file":[{"checksum":"1787baef1523d6d93753b90d0c109a6d","success":1,"date_created":"2021-04-22T08:08:14Z","date_updated":"2021-04-22T08:08:14Z","relation":"main_file","file_id":"9346","content_type":"application/pdf","file_size":3117435,"creator":"mwintrae","access_level":"open_access","file_name":"df_socg_final_version.pdf"}],"oa_version":"Published Version","intvolume":" 189","ddc":["004","516"],"title":"The density fingerprint of a periodic point set","status":"public","_id":"9345","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","abstract":[{"text":"Modeling a crystal as a periodic point set, we present a fingerprint consisting of density functionsthat facilitates the efficient search for new materials and material properties. We prove invarianceunder isometries, continuity, and completeness in the generic case, which are necessary featuresfor the reliable comparison of crystals. The proof of continuity integrates methods from discretegeometry and lattice theory, while the proof of generic completeness combines techniques fromgeometry with analysis. The fingerprint has a fast algorithm based on Brillouin zones and relatedinclusion-exclusion formulae. We have implemented the algorithm and describe its application tocrystal structure prediction.","lang":"eng"}],"alternative_title":["LIPIcs"],"type":"conference","date_published":"2021-06-02T00:00:00Z","page":"32:1-32:16","citation":{"short":"H. Edelsbrunner, T. Heiss, V. Kurlin , P. Smith, M. Wintraecken, in:, 37th International Symposium on Computational Geometry (SoCG 2021), Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16.","mla":"Edelsbrunner, Herbert, et al. “The Density Fingerprint of a Periodic Point Set.” 37th International Symposium on Computational Geometry (SoCG 2021), vol. 189, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, p. 32:1-32:16, doi:10.4230/LIPIcs.SoCG.2021.32.","chicago":"Edelsbrunner, Herbert, Teresa Heiss, Vitaliy Kurlin , Philip Smith, and Mathijs Wintraecken. “The Density Fingerprint of a Periodic Point Set.” In 37th International Symposium on Computational Geometry (SoCG 2021), 189:32:1-32:16. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.32.","ama":"Edelsbrunner H, Heiss T, Kurlin V, Smith P, Wintraecken M. The density fingerprint of a periodic point set. In: 37th International Symposium on Computational Geometry (SoCG 2021). Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021:32:1-32:16. doi:10.4230/LIPIcs.SoCG.2021.32","ieee":"H. Edelsbrunner, T. Heiss, V. Kurlin , P. Smith, and M. Wintraecken, “The density fingerprint of a periodic point set,” in 37th International Symposium on Computational Geometry (SoCG 2021), Virtual, 2021, vol. 189, p. 32:1-32:16.","apa":"Edelsbrunner, H., Heiss, T., Kurlin , V., Smith, P., & Wintraecken, M. (2021). The density fingerprint of a periodic point set. In 37th International Symposium on Computational Geometry (SoCG 2021) (Vol. 189, p. 32:1-32:16). Virtual: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.32","ista":"Edelsbrunner H, Heiss T, Kurlin V, Smith P, Wintraecken M. 2021. The density fingerprint of a periodic point set. 37th International Symposium on Computational Geometry (SoCG 2021). SoCG: Symposium on Computational Geometry, LIPIcs, vol. 189, 32:1-32:16."},"publication":"37th International Symposium on Computational Geometry (SoCG 2021)","has_accepted_license":"1","article_processing_charge":"No","day":"02"},{"department":[{"_id":"VaKa"}],"title":"Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles","ddc":["500"],"status":"public","_id":"9435","year":"2021","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Submitted Version","file":[{"creator":"ekoudjin","content_type":"application/pdf","file_size":353431,"access_level":"open_access","file_name":"CoExistence 2&3 caustics 3_17_6_2_3.pdf","checksum":"b281b5c2e3e90de0646c3eafcb2c6c25","date_updated":"2021-05-30T13:57:37Z","date_created":"2021-05-30T13:57:37Z","file_id":"9436","relation":"main_file"}],"date_created":"2021-05-30T13:58:13Z","date_updated":"2021-06-01T09:10:22Z","author":[{"full_name":"Kaloshin, Vadim","id":"FE553552-CDE8-11E9-B324-C0EBE5697425","orcid":"0000-0002-6051-2628","first_name":"Vadim","last_name":"Kaloshin"},{"last_name":"Koudjinan","first_name":"Edmond","orcid":"0000-0003-2640-4049","id":"52DF3E68-AEFA-11EA-95A4-124A3DDC885E","full_name":"Koudjinan, Edmond"}],"type":"preprint","abstract":[{"text":"For any given positive integer l, we prove that every plane deformation of a circlewhich preserves the 1/2and 1/ (2l + 1) -rational caustics is trivial i.e. the deformationconsists only of similarities (rescalings and isometries).","lang":"eng"}],"file_date_updated":"2021-05-30T13:57:37Z","citation":{"apa":"Kaloshin, V., & Koudjinan, E. (2021). Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles.","ieee":"V. Kaloshin and E. Koudjinan, “Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles.” 2021.","ista":"Kaloshin V, Koudjinan E. 2021. Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles.","ama":"Kaloshin V, Koudjinan E. Non co-preservation of the 1/2 and 1/(2l+1)-rational caustics along deformations of circles. 2021.","chicago":"Kaloshin, Vadim, and Edmond Koudjinan. “Non Co-Preservation of the 1/2 and 1/(2l+1)-Rational Caustics along Deformations of Circles,” 2021.","short":"V. Kaloshin, E. Koudjinan, (2021).","mla":"Kaloshin, Vadim, and Edmond Koudjinan. Non Co-Preservation of the 1/2 and 1/(2l+1)-Rational Caustics along Deformations of Circles. 2021."},"oa":1,"language":[{"iso":"eng"}],"date_published":"2021-01-01T00:00:00Z","has_accepted_license":"1","article_processing_charge":"No"},{"author":[{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita"},{"full_name":"Cultrera di Montesano, Sebastiano","orcid":"0000-0001-6249-0832","id":"34D2A09C-F248-11E8-B48F-1D18A9856A87","last_name":"Cultrera di Montesano","first_name":"Sebastiano"},{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","first_name":"Herbert","last_name":"Edelsbrunner"},{"full_name":"Saghafian, Morteza","last_name":"Saghafian","first_name":"Morteza"}],"date_created":"2021-06-27T22:01:48Z","date_updated":"2023-02-23T14:02:28Z","volume":189,"year":"2021","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Schloss Dagstuhl - Leibniz-Zentrum für Informatik","file_date_updated":"2021-06-28T13:11:39Z","ec_funded":1,"article_number":"16","conference":{"name":"SoCG: International Symposium on Computational Geometry","end_date":"2021-06-11","location":"Online","start_date":"2021-06-07"},"doi":"10.4230/LIPIcs.SoCG.2021.16","language":[{"iso":"eng"}],"oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","name":"Alpha Shape Theory Extended","call_identifier":"H2020"},{"grant_number":"Z00342","_id":"268116B8-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF"},{"name":"Discretization in Geometry and Dynamics","_id":"0aa4bc98-070f-11eb-9043-e6fff9c6a316","grant_number":"I4887"}],"month":"06","publication_identifier":{"isbn":["9783959771849"],"issn":["18688969"]},"oa_version":"Published Version","file":[{"file_name":"2021_LIPIcs_Biswas.pdf","access_level":"open_access","file_size":727817,"content_type":"application/pdf","creator":"asandaue","relation":"main_file","file_id":"9611","date_created":"2021-06-28T13:11:39Z","date_updated":"2021-06-28T13:11:39Z","checksum":"22b11a719018b22ecba2471b51f2eb40","success":1}],"user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","_id":"9604","title":"Counting cells of order-k voronoi tessellations in ℝ3 with morse theory","status":"public","ddc":["516"],"intvolume":" 189","abstract":[{"text":"Generalizing Lee’s inductive argument for counting the cells of higher order Voronoi tessellations in ℝ² to ℝ³, we get precise relations in terms of Morse theoretic quantities for piecewise constant functions on planar arrangements. Specifically, we prove that for a generic set of n ≥ 5 points in ℝ³, the number of regions in the order-k Voronoi tessellation is N_{k-1} - binom(k,2)n + n, for 1 ≤ k ≤ n-1, in which N_{k-1} is the sum of Euler characteristics of these function’s first k-1 sublevel sets. We get similar expressions for the vertices, edges, and polygons of the order-k Voronoi tessellation.","lang":"eng"}],"type":"conference","alternative_title":["LIPIcs"],"date_published":"2021-06-02T00:00:00Z","publication":"Leibniz International Proceedings in Informatics","citation":{"chicago":"Biswas, Ranita, Sebastiano Cultrera di Montesano, Herbert Edelsbrunner, and Morteza Saghafian. “Counting Cells of Order-k Voronoi Tessellations in ℝ3 with Morse Theory.” In Leibniz International Proceedings in Informatics, Vol. 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021. https://doi.org/10.4230/LIPIcs.SoCG.2021.16.","mla":"Biswas, Ranita, et al. “Counting Cells of Order-k Voronoi Tessellations in ℝ3 with Morse Theory.” Leibniz International Proceedings in Informatics, vol. 189, 16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021, doi:10.4230/LIPIcs.SoCG.2021.16.","short":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, M. Saghafian, in:, Leibniz International Proceedings in Informatics, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, 2021.","ista":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. 2021. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. Leibniz International Proceedings in Informatics. SoCG: International Symposium on Computational Geometry, LIPIcs, vol. 189, 16.","apa":"Biswas, R., Cultrera di Montesano, S., Edelsbrunner, H., & Saghafian, M. (2021). Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. In Leibniz International Proceedings in Informatics (Vol. 189). Online: Schloss Dagstuhl - Leibniz-Zentrum für Informatik. https://doi.org/10.4230/LIPIcs.SoCG.2021.16","ieee":"R. Biswas, S. Cultrera di Montesano, H. Edelsbrunner, and M. Saghafian, “Counting cells of order-k voronoi tessellations in ℝ3 with morse theory,” in Leibniz International Proceedings in Informatics, Online, 2021, vol. 189.","ama":"Biswas R, Cultrera di Montesano S, Edelsbrunner H, Saghafian M. Counting cells of order-k voronoi tessellations in ℝ3 with morse theory. In: Leibniz International Proceedings in Informatics. Vol 189. Schloss Dagstuhl - Leibniz-Zentrum für Informatik; 2021. doi:10.4230/LIPIcs.SoCG.2021.16"},"day":"02","has_accepted_license":"1","article_processing_charge":"No","scopus_import":"1"},{"doi":"10.1007/978-3-030-79527-6_1","conference":{"location":"Wrocław, Poland","start_date":"2021-06-28","end_date":"2021-07-01","name":" SIROCCO: International Colloquium on Structural Information and Communication Complexity"},"language":[{"iso":"eng"}],"oa":1,"project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships"}],"quality_controlled":"1","publication_identifier":{"issn":["0302-9743"],"eisbn":["9783030795276"],"isbn":["9783030795269"],"eissn":["1611-3349"]},"month":"06","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"full_name":"Davies, Peter","id":"11396234-BB50-11E9-B24C-90FCE5697425","orcid":"0000-0002-5646-9524","first_name":"Peter","last_name":"Davies"}],"volume":12810,"date_updated":"2023-02-23T14:02:46Z","date_created":"2021-07-01T11:04:43Z","year":"2021","acknowledgement":"Peter Davies is supported by the European Union’s Horizon2020 research and innovation programme under the Marie Skłodowska-Curie grant agreement No. 754411.","department":[{"_id":"DaAl"}],"publisher":"Springer Nature","publication_status":"published","ec_funded":1,"file_date_updated":"2021-07-01T11:21:40Z","date_published":"2021-06-20T00:00:00Z","citation":{"mla":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 3–12, doi:10.1007/978-3-030-79527-6_1.","short":"D.-A. Alistarh, P. Davies, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 3–12.","chicago":"Alistarh, Dan-Adrian, and Peter Davies. “Collecting Coupons Is Faster with Friends.” In Structural Information and Communication Complexity, 12810:3–12. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_1.","ama":"Alistarh D-A, Davies P. Collecting coupons is faster with friends. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:3-12. doi:10.1007/978-3-030-79527-6_1","ista":"Alistarh D-A, Davies P. 2021. Collecting coupons is faster with friends. Structural Information and Communication Complexity. SIROCCO: International Colloquium on Structural Information and Communication Complexity, LNCS, vol. 12810, 3–12.","apa":"Alistarh, D.-A., & Davies, P. (2021). Collecting coupons is faster with friends. In Structural Information and Communication Complexity (Vol. 12810, pp. 3–12). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_1","ieee":"D.-A. Alistarh and P. Davies, “Collecting coupons is faster with friends,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 3–12."},"publication":"Structural Information and Communication Complexity","page":"3-12","article_processing_charge":"No","has_accepted_license":"1","day":"20","file":[{"file_id":"9621","relation":"main_file","date_updated":"2021-07-01T11:21:40Z","date_created":"2021-07-01T11:21:40Z","checksum":"fe37fb9af3f5016c1084af9d6e7109bd","file_name":"Population_Coupon_Collector.pdf","access_level":"open_access","creator":"pdavies","content_type":"application/pdf","file_size":319728}],"oa_version":"Preprint","_id":"9620","user_id":"D865714E-FA4E-11E9-B85B-F5C5E5697425","intvolume":" 12810","ddc":["000"],"title":"Collecting coupons is faster with friends","status":"public","abstract":[{"text":"In this note, we introduce a distributed twist on the classic coupon collector problem: a set of m collectors wish to each obtain a set of n coupons; for this, they can each sample coupons uniformly at random, but can also meet in pairwise interactions, during which they can exchange coupons. By doing so, they hope to reduce the number of coupons that must be sampled by each collector in order to obtain a full set. This extension is natural when considering real-world manifestations of the coupon collector phenomenon, and has been remarked upon and studied empirically (Hayes and Hannigan 2006, Ahmad et al. 2014, Delmarcelle 2019).\r\n\r\nWe provide the first theoretical analysis for such a scenario. We find that “coupon collecting with friends” can indeed significantly reduce the number of coupons each collector must sample, and raises interesting connections to the more traditional variants of the problem. While our analysis is in most cases asymptotically tight, there are several open questions raised, regarding finer-grained analysis of both “coupon collecting with friends,” and of a long-studied variant of the original problem in which a collector requires multiple full sets of coupons.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"]},{"scopus_import":"1","day":"11","article_processing_charge":"No","publication":"Topics in Cryptology – CT-RSA 2021","citation":{"short":"B. Auerbach, S. Chakraborty, K. Klein, G. Pascual Perez, K.Z. Pietrzak, M. Walter, M.X. Yeo, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 399–421.","mla":"Auerbach, Benedikt, et al. “Inverse-Sybil Attacks in Automated Contact Tracing.” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 399–421, doi:10.1007/978-3-030-75539-3_17.","chicago":"Auerbach, Benedikt, Suvradip Chakraborty, Karen Klein, Guillermo Pascual Perez, Krzysztof Z Pietrzak, Michael Walter, and Michelle X Yeo. “Inverse-Sybil Attacks in Automated Contact Tracing.” In Topics in Cryptology – CT-RSA 2021, 12704:399–421. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-75539-3_17.","ama":"Auerbach B, Chakraborty S, Klein K, et al. Inverse-Sybil attacks in automated contact tracing. In: Topics in Cryptology – CT-RSA 2021. Vol 12704. Springer Nature; 2021:399-421. doi:10.1007/978-3-030-75539-3_17","ieee":"B. Auerbach et al., “Inverse-Sybil attacks in automated contact tracing,” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 399–421.","apa":"Auerbach, B., Chakraborty, S., Klein, K., Pascual Perez, G., Pietrzak, K. Z., Walter, M., & Yeo, M. X. (2021). Inverse-Sybil attacks in automated contact tracing. In Topics in Cryptology – CT-RSA 2021 (Vol. 12704, pp. 399–421). Virtual Event: Springer Nature. https://doi.org/10.1007/978-3-030-75539-3_17","ista":"Auerbach B, Chakraborty S, Klein K, Pascual Perez G, Pietrzak KZ, Walter M, Yeo MX. 2021. Inverse-Sybil attacks in automated contact tracing. Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 399–421."},"page":"399-421","date_published":"2021-05-11T00:00:00Z","type":"conference","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"Automated contract tracing aims at supporting manual contact tracing during pandemics by alerting users of encounters with infected people. There are currently many proposals for protocols (like the “decentralized” DP-3T and PACT or the “centralized” ROBERT and DESIRE) to be run on mobile phones, where the basic idea is to regularly broadcast (using low energy Bluetooth) some values, and at the same time store (a function of) incoming messages broadcasted by users in their proximity. In the existing proposals one can trigger false positives on a massive scale by an “inverse-Sybil” attack, where a large number of devices (malicious users or hacked phones) pretend to be the same user, such that later, just a single person needs to be diagnosed (and allowed to upload) to trigger an alert for all users who were in proximity to any of this large group of devices.\r\n\r\nWe propose the first protocols that do not succumb to such attacks assuming the devices involved in the attack do not constantly communicate, which we observe is a necessary assumption. The high level idea of the protocols is to derive the values to be broadcasted by a hash chain, so that two (or more) devices who want to launch an inverse-Sybil attack will not be able to connect their respective chains and thus only one of them will be able to upload. Our protocols also achieve security against replay, belated replay, and one of them even against relay attacks."}],"_id":"9826","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Inverse-Sybil attacks in automated contact tracing","status":"public","intvolume":" 12704","oa_version":"Submitted Version","month":"05","publication_identifier":{"eissn":["16113349"],"isbn":["9783030755386"],"issn":["03029743"]},"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2020/670"}],"oa":1,"quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"},{"name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815"}],"conference":{"start_date":"2021-05-17","location":"Virtual Event","end_date":"2021-05-20","name":"CT-RSA: Cryptographers’ Track at the RSA Conference"},"doi":"10.1007/978-3-030-75539-3_17","language":[{"iso":"eng"}],"ec_funded":1,"year":"2021","acknowledgement":"Guillermo Pascual-Perez and Michelle Yeo were funded by the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska–Curie Grant Agreement No. 665385; the remaining contributors to this project have received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (682815 - TOCNeT).","publication_status":"published","department":[{"_id":"KrPi"},{"_id":"GradSch"}],"publisher":"Springer Nature","author":[{"orcid":"0000-0002-7553-6606","id":"D33D2B18-E445-11E9-ABB7-15F4E5697425","last_name":"Auerbach","first_name":"Benedikt","full_name":"Auerbach, Benedikt"},{"id":"B9CD0494-D033-11E9-B219-A439E6697425","last_name":"Chakraborty","first_name":"Suvradip","full_name":"Chakraborty, Suvradip"},{"id":"3E83A2F8-F248-11E8-B48F-1D18A9856A87","last_name":"Klein","first_name":"Karen","full_name":"Klein, Karen"},{"full_name":"Pascual Perez, Guillermo","id":"2D7ABD02-F248-11E8-B48F-1D18A9856A87","last_name":"Pascual Perez","first_name":"Guillermo"},{"last_name":"Pietrzak","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"},{"full_name":"Walter, Michael","id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","first_name":"Michael","last_name":"Walter"},{"id":"2D82B818-F248-11E8-B48F-1D18A9856A87","last_name":"Yeo","first_name":"Michelle X","full_name":"Yeo, Michelle X"}],"date_updated":"2023-02-23T14:09:56Z","date_created":"2021-08-08T22:01:30Z","volume":12704},{"volume":12704,"date_updated":"2023-02-23T14:09:54Z","date_created":"2021-08-08T22:01:30Z","author":[{"full_name":"Laarhoven, Thijs","last_name":"Laarhoven","first_name":"Thijs"},{"id":"488F98B0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3186-2482","first_name":"Michael","last_name":"Walter","full_name":"Walter, Michael"}],"department":[{"_id":"KrPi"}],"publisher":"Springer Nature","publication_status":"published","year":"2021","acknowledgement":"The authors thank Sauvik Bhattacharya, L´eo Ducas, Rachel Player, and Christine van Vredendaal for early discussions on this topic and on preliminary results. The authors further thank the reviewers of CT-RSA 2021 for their valuable feedback.","language":[{"iso":"eng"}],"doi":"10.1007/978-3-030-75539-3_20","conference":{"name":"CT-RSA: Cryptographers’ Track at the RSA Conference","location":"Virtual Event","start_date":"2021-05-17","end_date":"2021-05-20"},"quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2021/557","open_access":"1"}],"publication_identifier":{"eissn":["16113349"],"isbn":["9783030755386"],"issn":["03029743"]},"month":"05","oa_version":"Preprint","intvolume":" 12704","title":"Dual lattice attacks for closest vector problems (with preprocessing)","status":"public","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","_id":"9825","abstract":[{"text":"The dual attack has long been considered a relevant attack on lattice-based cryptographic schemes relying on the hardness of learning with errors (LWE) and its structured variants. As solving LWE corresponds to finding a nearest point on a lattice, one may naturally wonder how efficient this dual approach is for solving more general closest vector problems, such as the classical closest vector problem (CVP), the variants bounded distance decoding (BDD) and approximate CVP, and preprocessing versions of these problems. While primal, sieving-based solutions to these problems (with preprocessing) were recently studied in a series of works on approximate Voronoi cells [Laa16b, DLdW19, Laa20, DLvW20], for the dual attack no such overview exists, especially for problems with preprocessing. With one of the take-away messages of the approximate Voronoi cell line of work being that primal attacks work well for approximate CVP(P) but scale poorly for BDD(P), one may further wonder if the dual attack suffers the same drawbacks, or if it is perhaps a better solution when trying to solve BDD(P).\r\n\r\nIn this work we provide an overview of cost estimates for dual algorithms for solving these “classical” closest lattice vector problems. Heuristically we expect to solve the search version of average-case CVPP in time and space 20.293𝑑+𝑜(𝑑) in the single-target model. The distinguishing version of average-case CVPP, where we wish to distinguish between random targets and targets planted at distance (say) 0.99⋅𝑔𝑑 from the lattice, has the same complexity in the single-target model, but can be solved in time and space 20.195𝑑+𝑜(𝑑) in the multi-target setting, when given a large number of targets from either target distribution. This suggests an inequivalence between distinguishing and searching, as we do not expect a similar improvement in the multi-target setting to hold for search-CVPP. We analyze three slightly different decoders, both for distinguishing and searching, and experimentally obtain concrete cost estimates for the dual attack in dimensions 50 to 80, which confirm our heuristic assumptions, and show that the hidden order terms in the asymptotic estimates are quite small.\r\n\r\nOur main take-away message is that the dual attack appears to mirror the approximate Voronoi cell line of work – whereas using approximate Voronoi cells works well for approximate CVP(P) but scales poorly for BDD(P), the dual approach scales well for BDD(P) instances but performs poorly on approximate CVP(P).","lang":"eng"}],"alternative_title":["LNCS"],"type":"conference","date_published":"2021-05-11T00:00:00Z","page":"478-502","citation":{"chicago":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” In Topics in Cryptology – CT-RSA 2021, 12704:478–502. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-75539-3_20.","mla":"Laarhoven, Thijs, and Michael Walter. “Dual Lattice Attacks for Closest Vector Problems (with Preprocessing).” Topics in Cryptology – CT-RSA 2021, vol. 12704, Springer Nature, 2021, pp. 478–502, doi:10.1007/978-3-030-75539-3_20.","short":"T. Laarhoven, M. Walter, in:, Topics in Cryptology – CT-RSA 2021, Springer Nature, 2021, pp. 478–502.","ista":"Laarhoven T, Walter M. 2021. Dual lattice attacks for closest vector problems (with preprocessing). Topics in Cryptology – CT-RSA 2021. CT-RSA: Cryptographers’ Track at the RSA Conference, LNCS, vol. 12704, 478–502.","apa":"Laarhoven, T., & Walter, M. (2021). Dual lattice attacks for closest vector problems (with preprocessing). In Topics in Cryptology – CT-RSA 2021 (Vol. 12704, pp. 478–502). Virtual Event: Springer Nature. https://doi.org/10.1007/978-3-030-75539-3_20","ieee":"T. Laarhoven and M. Walter, “Dual lattice attacks for closest vector problems (with preprocessing),” in Topics in Cryptology – CT-RSA 2021, Virtual Event, 2021, vol. 12704, pp. 478–502.","ama":"Laarhoven T, Walter M. Dual lattice attacks for closest vector problems (with preprocessing). In: Topics in Cryptology – CT-RSA 2021. Vol 12704. Springer Nature; 2021:478-502. doi:10.1007/978-3-030-75539-3_20"},"publication":"Topics in Cryptology – CT-RSA 2021","article_processing_charge":"No","day":"11","scopus_import":"1"},{"day":"20","article_processing_charge":"No","scopus_import":"1","date_published":"2021-06-20T00:00:00Z","publication":"Structural Information and Communication Complexity","citation":{"chicago":"Alistarh, Dan-Adrian, Faith Ellen, and Joel Rybicki. “Wait-Free Approximate Agreement on Graphs.” In Structural Information and Communication Complexity, 12810:87–105. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-79527-6_6.","short":"D.-A. Alistarh, F. Ellen, J. Rybicki, in:, Structural Information and Communication Complexity, Springer Nature, 2021, pp. 87–105.","mla":"Alistarh, Dan-Adrian, et al. “Wait-Free Approximate Agreement on Graphs.” Structural Information and Communication Complexity, vol. 12810, Springer Nature, 2021, pp. 87–105, doi:10.1007/978-3-030-79527-6_6.","ieee":"D.-A. Alistarh, F. Ellen, and J. Rybicki, “Wait-free approximate agreement on graphs,” in Structural Information and Communication Complexity, Wrocław, Poland, 2021, vol. 12810, pp. 87–105.","apa":"Alistarh, D.-A., Ellen, F., & Rybicki, J. (2021). Wait-free approximate agreement on graphs. In Structural Information and Communication Complexity (Vol. 12810, pp. 87–105). Wrocław, Poland: Springer Nature. https://doi.org/10.1007/978-3-030-79527-6_6","ista":"Alistarh D-A, Ellen F, Rybicki J. 2021. Wait-free approximate agreement on graphs. Structural Information and Communication Complexity. SIROCCO: Structural Information and Communication Complexity, LNCS, vol. 12810, 87–105.","ama":"Alistarh D-A, Ellen F, Rybicki J. Wait-free approximate agreement on graphs. In: Structural Information and Communication Complexity. Vol 12810. Springer Nature; 2021:87-105. doi:10.1007/978-3-030-79527-6_6"},"page":"87-105","abstract":[{"text":"Approximate agreement is one of the few variants of consensus that can be solved in a wait-free manner in asynchronous systems where processes communicate by reading and writing to shared memory. In this work, we consider a natural generalisation of approximate agreement on arbitrary undirected connected graphs. Each process is given a vertex of the graph as input and, if non-faulty, must output a vertex such that\r\nall the outputs are within distance 1 of one another, and\r\n\r\neach output value lies on a shortest path between two input values.\r\n\r\nFrom prior work, it is known that there is no wait-free algorithm among 𝑛≥3 processes for this problem on any cycle of length 𝑐≥4 , by reduction from 2-set agreement (Castañeda et al. 2018).\r\n\r\nIn this work, we investigate the solvability and complexity of this task on general graphs. We give a new, direct proof of the impossibility of approximate agreement on cycles of length 𝑐≥4 , via a generalisation of Sperner’s Lemma to convex polygons. We also extend the reduction from 2-set agreement to a larger class of graphs, showing that approximate agreement on these graphs is unsolvable. On the positive side, we present a wait-free algorithm for a class of graphs that properly contains the class of chordal graphs.","lang":"eng"}],"type":"conference","alternative_title":["LNCS"],"oa_version":"Preprint","_id":"9823","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","title":"Wait-free approximate agreement on graphs","status":"public","intvolume":" 12810","month":"06","publication_identifier":{"issn":["03029743"],"isbn":["9783030795269"],"eissn":["16113349"]},"conference":{"name":"SIROCCO: Structural Information and Communication Complexity","end_date":"2021-07-01","start_date":"2021-06-28","location":"Wrocław, Poland"},"doi":"10.1007/978-3-030-79527-6_6","language":[{"iso":"eng"}],"oa":1,"external_id":{"arxiv":["2103.08949"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.08949"}],"quality_controlled":"1","author":[{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"},{"first_name":"Faith","last_name":"Ellen","full_name":"Ellen, Faith"},{"full_name":"Rybicki, Joel","last_name":"Rybicki","first_name":"Joel","orcid":"0000-0002-6432-6646","id":"334EFD2E-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2023-02-23T14:09:49Z","date_created":"2021-08-08T22:01:29Z","volume":12810,"year":"2021","publication_status":"published","department":[{"_id":"DaAl"}],"publisher":"Springer Nature"},{"title":"Body centered cubic grid - coordinate system and discrete analytical plane definition","status":"public","intvolume":" 12708","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"9824","oa_version":"None","alternative_title":["LNCS"],"type":"conference","abstract":[{"text":"We define a new compact coordinate system in which each integer triplet addresses a voxel in the BCC grid, and we investigate some of its properties. We propose a characterization of 3D discrete analytical planes with their topological features (in the Cartesian and in the new coordinate system) such as the interrelation between the thickness of the plane and the separability constraint we aim to obtain.","lang":"eng"}],"page":"152-163","publication":"Discrete Geometry and Mathematical Morphology","citation":{"ama":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. Body centered cubic grid - coordinate system and discrete analytical plane definition. In: Discrete Geometry and Mathematical Morphology. Vol 12708. Springer Nature; 2021:152-163. doi:10.1007/978-3-030-76657-3_10","apa":"Čomić, L., Zrour, R., Largeteau-Skapin, G., Biswas, R., & Andres, E. (2021). Body centered cubic grid - coordinate system and discrete analytical plane definition. In Discrete Geometry and Mathematical Morphology (Vol. 12708, pp. 152–163). Uppsala, Sweden: Springer Nature. https://doi.org/10.1007/978-3-030-76657-3_10","ieee":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, and E. Andres, “Body centered cubic grid - coordinate system and discrete analytical plane definition,” in Discrete Geometry and Mathematical Morphology, Uppsala, Sweden, 2021, vol. 12708, pp. 152–163.","ista":"Čomić L, Zrour R, Largeteau-Skapin G, Biswas R, Andres E. 2021. Body centered cubic grid - coordinate system and discrete analytical plane definition. Discrete Geometry and Mathematical Morphology. DGMM: International Conference on Discrete Geometry and Mathematical Morphology, LNCS, vol. 12708, 152–163.","short":"L. Čomić, R. Zrour, G. Largeteau-Skapin, R. Biswas, E. Andres, in:, Discrete Geometry and Mathematical Morphology, Springer Nature, 2021, pp. 152–163.","mla":"Čomić, Lidija, et al. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” Discrete Geometry and Mathematical Morphology, vol. 12708, Springer Nature, 2021, pp. 152–63, doi:10.1007/978-3-030-76657-3_10.","chicago":"Čomić, Lidija, Rita Zrour, Gaëlle Largeteau-Skapin, Ranita Biswas, and Eric Andres. “Body Centered Cubic Grid - Coordinate System and Discrete Analytical Plane Definition.” In Discrete Geometry and Mathematical Morphology, 12708:152–63. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-76657-3_10."},"date_published":"2021-05-16T00:00:00Z","scopus_import":"1","day":"16","article_processing_charge":"No","publication_status":"published","department":[{"_id":"HeEd"}],"publisher":"Springer Nature","year":"2021","acknowledgement":"This work has been partially supported by the Ministry of Education, Science and Technological Development of the Republic of Serbia through the project no. 451-03-68/2020-14/200156: “Innovative scientific and artistic research from the FTS (activity) domain” (LČ), the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme, grant no. 788183 (RB), and the DFG Collaborative Research Center TRR 109, ‘Discretization in Geometry and Dynamics’, Austrian Science Fund (FWF), grant no. I 02979-N35 (RB).","date_updated":"2022-05-31T06:58:21Z","date_created":"2021-08-08T22:01:29Z","volume":12708,"author":[{"first_name":"Lidija","last_name":"Čomić","full_name":"Čomić, Lidija"},{"first_name":"Rita","last_name":"Zrour","full_name":"Zrour, Rita"},{"full_name":"Largeteau-Skapin, Gaëlle","last_name":"Largeteau-Skapin","first_name":"Gaëlle"},{"full_name":"Biswas, Ranita","orcid":"0000-0002-5372-7890","id":"3C2B033E-F248-11E8-B48F-1D18A9856A87","last_name":"Biswas","first_name":"Ranita"},{"full_name":"Andres, Eric","first_name":"Eric","last_name":"Andres"}],"ec_funded":1,"quality_controlled":"1","project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"call_identifier":"FWF","name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","grant_number":"I02979-N35"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2021-05-27","location":"Uppsala, Sweden","start_date":"2021-05-24","name":"DGMM: International Conference on Discrete Geometry and Mathematical Morphology"},"doi":"10.1007/978-3-030-76657-3_10","month":"05","publication_identifier":{"issn":["03029743"],"eissn":["16113349"],"isbn":["9783030766566"]}},{"date_published":"2021-08-16T00:00:00Z","doi":"10.21203/rs.3.rs-818607/v1","language":[{"iso":"eng"}],"publication":"Research Square","tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"citation":{"mla":"Prehal, Christian, et al. “Mechanism of Li2S Formation and Dissolution in Lithium-Sulphur Batteries.” Research Square, doi:10.21203/rs.3.rs-818607/v1.","short":"C. Prehal, S.D. Talian, A. Vizintin, H. Amenitsch, R. Dominko, S.A. Freunberger, V. Wood, Research Square (n.d.).","chicago":"Prehal, Christian, Sara Drvarič Talian, Alen Vizintin, Heinz Amenitsch, Robert Dominko, Stefan Alexander Freunberger, and Vanessa Wood. “Mechanism of Li2S Formation and Dissolution in Lithium-Sulphur Batteries.” Research Square, n.d. https://doi.org/10.21203/rs.3.rs-818607/v1.","ama":"Prehal C, Talian SD, Vizintin A, et al. Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries. Research Square. doi:10.21203/rs.3.rs-818607/v1","ista":"Prehal C, Talian SD, Vizintin A, Amenitsch H, Dominko R, Freunberger SA, Wood V. Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries. Research Square, 10.21203/rs.3.rs-818607/v1.","ieee":"C. Prehal et al., “Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries,” Research Square. .","apa":"Prehal, C., Talian, S. D., Vizintin, A., Amenitsch, H., Dominko, R., Freunberger, S. A., & Wood, V. (n.d.). Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries. Research Square. https://doi.org/10.21203/rs.3.rs-818607/v1"},"main_file_link":[{"open_access":"1","url":"https://www.researchsquare.com/article/rs-818607/v1"}],"oa":1,"page":"21","month":"08","day":"16","article_processing_charge":"No","keyword":["Li2S","Lithium Sulphur Batteries","SAXS","WAXS"],"author":[{"full_name":"Prehal, Christian","first_name":"Christian","last_name":"Prehal"},{"full_name":"Talian, Sara Drvarič","last_name":"Talian","first_name":"Sara Drvarič"},{"first_name":"Alen","last_name":"Vizintin","full_name":"Vizintin, Alen"},{"full_name":"Amenitsch, Heinz","last_name":"Amenitsch","first_name":"Heinz"},{"last_name":"Dominko","first_name":"Robert","full_name":"Dominko, Robert"},{"orcid":"0000-0003-2902-5319","id":"A8CA28E6-CE23-11E9-AD2D-EC27E6697425","last_name":"Freunberger","first_name":"Stefan Alexander","full_name":"Freunberger, Stefan Alexander"},{"last_name":"Wood","first_name":"Vanessa","full_name":"Wood, Vanessa"}],"date_created":"2021-09-02T08:45:00Z","date_updated":"2021-12-03T10:35:42Z","oa_version":"Preprint","_id":"9980","year":"2021","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","acknowledgement":"This project has received funding from the European Union’s Horizon 2020 research and innovation program under the Marie Skłodowska-Curie grant NanoEvolution, grant agreement No 894042. The authors acknowledge TU Graz for support through the Lead Project LP-03. Likewise, the use of SOMAPP Lab, a core facility supported by the Austrian Federal Ministry of Education, Science and Research, the Graz University\r\n6 of Technology, the University of Graz, and Anton Paar GmbH is acknowledged. S.D.T, A.V. and R.D. acknowledge the financial support by the Slovenian Research Agency (ARRS) research core funding P2-0393. Furthermore, A.V. acknowledge the funding from the Slovenian Research Agency, research project Z2-1863. S.A.F. is indebted to IST Austria for support. ","status":"public","title":"Mechanism of Li2S formation and dissolution in Lithium-Sulphur batteries","publication_status":"submitted","ddc":["621"],"department":[{"_id":"StFr"}],"abstract":[{"text":"Insufficient understanding of the mechanism that reversibly converts sulphur into lithium sulphide (Li2S) via soluble polysulphides (PS) hampers the realization of high performance lithium-sulphur cells. Typically Li2S formation is explained by direct electroreduction of a PS to Li2S; however, this is not consistent with the size of the insulating Li2S deposits. Here, we use in situ small and wide angle X-ray scattering (SAXS/WAXS) to track the growth and dissolution of crystalline and amorphous deposits from atomic to sub-micron scales during charge and discharge. Stochastic modelling based on the SAXS data allows quantification of the chemical phase evolution during discharge and charge. We show that Li2S deposits predominantly via disproportionation of transient, solid Li2S2 to form primary Li2S crystallites and solid Li2S4 particles. We further demonstrate that this process happens in reverse during charge. These findings show that the discharge capacity and rate capability in Li-S battery cathodes are therefore limited by mass transport through the increasingly tortuous network of Li2S / Li2S4 / carbon pores rather than electron transport through a passivating surface film.","lang":"eng"}],"type":"preprint"},{"article_processing_charge":"No","day":"16","keyword":["General Earth and Planetary Sciences"],"scopus_import":"1","date_published":"2021-12-16T00:00:00Z","article_type":"letter_note","citation":{"short":"M. Menenti, X. Li, L. Jia, K. Yang, F. Pellicciotti, M. Mancini, J. Shi, M.J. Escorihuela, C. Zheng, Q. Chen, J. Lu, J. Zhou, G. Hu, S. Ren, J. Zhang, Q. Liu, Y. Qiu, C. Huang, J. Zhou, X. Han, X. Pan, H. Li, Y. Wu, B. Ding, W. Yang, P. Buri, M.J. McCarthy, E.S. Miles, T.E. Shaw, C. Ma, Y. Zhou, C. Corbari, R. Li, T. Zhao, V. Stefan, Q. Gao, J. Zhang, Q. Xie, N. Wang, Y. Sun, X. Mo, J. Jia, A.P. Jouberton, M. Kneib, S. Fugger, N. Paciolla, G. Paolini, Remote Sensing 13 (2021).","mla":"Menenti, Massimo, et al. “Multi-Source Hydrological Data Products to Monitor High Asian River Basins and Regional Water Security.” Remote Sensing, vol. 13, no. 24, 5122, MDPI, 2021, doi:10.3390/rs13245122.","chicago":"Menenti, Massimo, Xin Li, Li Jia, Kun Yang, Francesca Pellicciotti, Marco Mancini, Jiancheng Shi, et al. “Multi-Source Hydrological Data Products to Monitor High Asian River Basins and Regional Water Security.” Remote Sensing. MDPI, 2021. https://doi.org/10.3390/rs13245122.","ama":"Menenti M, Li X, Jia L, et al. Multi-source hydrological data products to monitor High Asian river basins and regional water security. Remote Sensing. 2021;13(24). doi:10.3390/rs13245122","apa":"Menenti, M., Li, X., Jia, L., Yang, K., Pellicciotti, F., Mancini, M., … Paolini, G. (2021). Multi-source hydrological data products to monitor High Asian river basins and regional water security. Remote Sensing. MDPI. https://doi.org/10.3390/rs13245122","ieee":"M. Menenti et al., “Multi-source hydrological data products to monitor High Asian river basins and regional water security,” Remote Sensing, vol. 13, no. 24. MDPI, 2021.","ista":"Menenti M, Li X, Jia L, Yang K, Pellicciotti F, Mancini M, Shi J, Escorihuela MJ, Zheng C, Chen Q, Lu J, Zhou J, Hu G, Ren S, Zhang J, Liu Q, Qiu Y, Huang C, Zhou J, Han X, Pan X, Li H, Wu Y, Ding B, Yang W, Buri P, McCarthy MJ, Miles ES, Shaw TE, Ma C, Zhou Y, Corbari C, Li R, Zhao T, Stefan V, Gao Q, Zhang J, Xie Q, Wang N, Sun Y, Mo X, Jia J, Jouberton AP, Kneib M, Fugger S, Paciolla N, Paolini G. 2021. Multi-source hydrological data products to monitor High Asian river basins and regional water security. Remote Sensing. 13(24), 5122."},"publication":"Remote Sensing","issue":"24","abstract":[{"lang":"eng","text":"This project explored the integrated use of satellite, ground observations and hydrological distributed models to support water resources assessment and monitoring in High Mountain Asia (HMA). Hydrological data products were generated taking advantage of the synergies of European and Chinese data assets and space-borne observation systems. Energy-budget-based glacier mass balance and hydrological models driven by satellite observations were developed. These models can be applied to describe glacier-melt contribution to river flow. Satellite hydrological data products were used for forcing, calibration, validation and data assimilation in distributed river basin models. A pilot study was carried out on the Red River basin. Multiple hydrological data products were generated using the data collected by Chinese satellites. A new Evapo-Transpiration (ET) dataset from 2000 to 2018 was generated, including plant transpiration, soil evaporation, rainfall interception loss, snow/ice sublimation and open water evaporation. Higher resolution data were used to characterize glaciers and their response to environmental forcing. These studies focused on the Parlung Zangbo Basin, where glacier facies were mapped with GaoFeng (GF), Sentinal-2/Multi-Spectral Imager (S2/MSI) and Landsat8/Operational Land Imager (L8/OLI) data. The geodetic mass balance was estimated between 2000 and 2017 with Zi-Yuan (ZY)-3 Stereo Images and the SRTM DEM. Surface velocity was studied with Landsat5/Thematic Mapper (L5/TM), L8/OLI and S2/MSI data over the period 2013–2019. An updated method was developed to improve the retrieval of glacier albedo by correcting glacier reflectance for anisotropy, and a new dataset on glacier albedo was generated for the period 2001–2020. A detailed glacier energy and mass balance model was developed with the support of field experiments at the Parlung No. 4 Glacier and the 24 K Glacier, both in the Tibetan Plateau. Besides meteorological measurements, the field experiments included glaciological and hydrological measurements. The energy balance model was formulated in terms of enthalpy for easier treatment of water phase transitions. The model was applied to assess the spatial variability in glacier melt. In the Parlung No. 4 Glacier, the accumulated glacier melt was between 1.5 and 2.5 m w.e. in the accumulation zone and between 4.5 and 6.0 m w.e. in the ablation zone, reaching 6.5 m w.e. at the terminus. The seasonality in the glacier mass balance was observed by combining intensive field campaigns with continuous automatic observations. The linkage of the glacier and snowpack mass balance with water resources in a river basin was analyzed in the Chiese (Italy) and Heihe (China) basins by developing and applying integrated hydrological models using satellite retrievals in multiple ways. The model FEST-WEB was calibrated using retrievals of Land Surface Temperature (LST) to map soil hydrological properties. A watershed model was developed by coupling ecohydrological and socioeconomic systems. Integrated modeling is supported by an updated and parallelized data assimilation system. The latter exploits retrievals of brightness temperature (Advanced Microwave Scanning Radiometer, AMSR), LST (Moderate Resolution Imaging Spectroradiometer, MODIS), precipitation (Tropical Rainfall Measuring Mission (TRMM) and FengYun (FY)-2D) and in-situ measurements. In the case study on the Red River Basin, a new algorithm has been applied to disaggregate the SMOS (Soil Moisture and Ocean Salinity) soil moisture retrievals by making use of the correlation between evaporative fraction and soil moisture."}],"type":"journal_article","oa_version":"Published Version","intvolume":" 13","status":"public","title":"Multi-source hydrological data products to monitor High Asian river basins and regional water security","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12584","publication_identifier":{"issn":["2072-4292"]},"month":"12","language":[{"iso":"eng"}],"doi":"10.3390/rs13245122","quality_controlled":"1","oa":1,"main_file_link":[{"url":"https://doi.org/10.3390/rs13245122","open_access":"1"}],"extern":"1","article_number":"5122","volume":13,"date_created":"2023-02-20T08:10:49Z","date_updated":"2023-02-28T13:26:53Z","author":[{"last_name":"Menenti","first_name":"Massimo","full_name":"Menenti, Massimo"},{"full_name":"Li, Xin","last_name":"Li","first_name":"Xin"},{"first_name":"Li","last_name":"Jia","full_name":"Jia, Li"},{"last_name":"Yang","first_name":"Kun","full_name":"Yang, Kun"},{"first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"},{"last_name":"Mancini","first_name":"Marco","full_name":"Mancini, Marco"},{"first_name":"Jiancheng","last_name":"Shi","full_name":"Shi, Jiancheng"},{"last_name":"Escorihuela","first_name":"Maria José","full_name":"Escorihuela, Maria José"},{"first_name":"Chaolei","last_name":"Zheng","full_name":"Zheng, Chaolei"},{"full_name":"Chen, Qiting","first_name":"Qiting","last_name":"Chen"},{"full_name":"Lu, Jing","first_name":"Jing","last_name":"Lu"},{"full_name":"Zhou, Jie","last_name":"Zhou","first_name":"Jie"},{"first_name":"Guangcheng","last_name":"Hu","full_name":"Hu, Guangcheng"},{"full_name":"Ren, Shaoting","last_name":"Ren","first_name":"Shaoting"},{"first_name":"Jing","last_name":"Zhang","full_name":"Zhang, Jing"},{"last_name":"Liu","first_name":"Qinhuo","full_name":"Liu, Qinhuo"},{"full_name":"Qiu, Yubao","last_name":"Qiu","first_name":"Yubao"},{"first_name":"Chunlin","last_name":"Huang","full_name":"Huang, Chunlin"},{"first_name":"Ji","last_name":"Zhou","full_name":"Zhou, Ji"},{"full_name":"Han, Xujun","first_name":"Xujun","last_name":"Han"},{"full_name":"Pan, Xiaoduo","last_name":"Pan","first_name":"Xiaoduo"},{"last_name":"Li","first_name":"Hongyi","full_name":"Li, Hongyi"},{"first_name":"Yerong","last_name":"Wu","full_name":"Wu, Yerong"},{"last_name":"Ding","first_name":"Baohong","full_name":"Ding, Baohong"},{"last_name":"Yang","first_name":"Wei","full_name":"Yang, Wei"},{"first_name":"Pascal","last_name":"Buri","full_name":"Buri, Pascal"},{"last_name":"McCarthy","first_name":"Michael J.","full_name":"McCarthy, Michael J."},{"first_name":"Evan S.","last_name":"Miles","full_name":"Miles, Evan S."},{"first_name":"Thomas E.","last_name":"Shaw","full_name":"Shaw, Thomas E."},{"first_name":"Chunfeng","last_name":"Ma","full_name":"Ma, Chunfeng"},{"last_name":"Zhou","first_name":"Yanzhao","full_name":"Zhou, Yanzhao"},{"last_name":"Corbari","first_name":"Chiara","full_name":"Corbari, Chiara"},{"last_name":"Li","first_name":"Rui","full_name":"Li, Rui"},{"last_name":"Zhao","first_name":"Tianjie","full_name":"Zhao, Tianjie"},{"full_name":"Stefan, Vivien","last_name":"Stefan","first_name":"Vivien"},{"first_name":"Qi","last_name":"Gao","full_name":"Gao, Qi"},{"last_name":"Zhang","first_name":"Jingxiao","full_name":"Zhang, Jingxiao"},{"first_name":"Qiuxia","last_name":"Xie","full_name":"Xie, Qiuxia"},{"full_name":"Wang, Ning","last_name":"Wang","first_name":"Ning"},{"last_name":"Sun","first_name":"Yibo","full_name":"Sun, Yibo"},{"first_name":"Xinyu","last_name":"Mo","full_name":"Mo, Xinyu"},{"last_name":"Jia","first_name":"Junru","full_name":"Jia, Junru"},{"last_name":"Jouberton","first_name":"Achille Pierre","full_name":"Jouberton, Achille Pierre"},{"first_name":"Marin","last_name":"Kneib","full_name":"Kneib, Marin"},{"first_name":"Stefan","last_name":"Fugger","full_name":"Fugger, Stefan"},{"full_name":"Paciolla, Nicola","first_name":"Nicola","last_name":"Paciolla"},{"last_name":"Paolini","first_name":"Giovanni","full_name":"Paolini, Giovanni"}],"publisher":"MDPI","publication_status":"published","year":"2021"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12590","title":"Mapping ice cliffs on debris-covered glaciers using multispectral satellite images","status":"public","intvolume":" 253","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Ice cliffs play a key role in the mass balance of debris-covered glaciers, but assessing their importance is limited by a lack of datasets on their distribution and evolution at scales larger than an individual glacier. These datasets are often derived using operator-biased and time-consuming manual delineation approaches, despite the recent emergence of semi-automatic mapping methods. These methods have used elevation or multispectral data, but the varying slope and mixed spectral signal of these dynamic features makes the transferability of these approaches particularly challenging. We develop three semi-automated and objective new approaches, based on the Spectral Curvature and Linear Spectral Unmixing of multispectral images, to map these features at a glacier to regional scale. The transferability of each method is assessed by applying it to three sites in the Himalaya, where debris-covered glaciers are widespread, with varying lithologic, glaciological and climatic settings, and encompassing different periods of the melt season. We develop the new methods keeping in mind the wide range of remote sensing platforms currently in use, and focus in particular on two products: we apply the three approaches at each site to near-contemporaneous atmospherically-corrected Pléiades (2 m resolution) and Sentinel-2 (10 m resolution) images and assess the effects of spatial and spectral resolution on the results. We find that the Spectral Curvature method works best for the high spatial resolution, four band Pléaides images, while a modification of the Linear Spectral Unmixing using the scaling factor of the unmixing is best for the coarser spatial resolution, but additional spectral information of Sentinel-2 products. In both cases ice cliffs are mapped with a Dice coefficient higher than 0.48. Comparison of the Pléiades results with other existing methods shows that the Spectral Curvature approach performs better and is more robust than any other existing automated or semi-automated approaches. Both methods outline a high number of small, sometimes shallow-sloping and thinly debris-covered ice patches that differ from our traditional understanding of cliffs but may have non-negligible impact on the mass balance of debris-covered glaciers. Overall these results pave the way for large scale efforts of ice cliff mapping that can enable inclusion of these features in debris-covered glacier melt models, as well as allow the generation of multiple datasets to study processes of cliff formation, evolution and decline.","lang":"eng"}],"issue":"2","publication":"Remote Sensing of Environment","citation":{"short":"M. Kneib, E.S. Miles, S. Jola, P. Buri, S. Herreid, A. Bhattacharya, C.S. Watson, T. Bolch, D. Quincey, F. Pellicciotti, Remote Sensing of Environment 253 (2021).","mla":"Kneib, M., et al. “Mapping Ice Cliffs on Debris-Covered Glaciers Using Multispectral Satellite Images.” Remote Sensing of Environment, vol. 253, no. 2, 112201, Elsevier, 2021, doi:10.1016/j.rse.2020.112201.","chicago":"Kneib, M., E.S. Miles, S. Jola, P. Buri, S. Herreid, A. Bhattacharya, C.S. Watson, T. Bolch, D. Quincey, and Francesca Pellicciotti. “Mapping Ice Cliffs on Debris-Covered Glaciers Using Multispectral Satellite Images.” Remote Sensing of Environment. Elsevier, 2021. https://doi.org/10.1016/j.rse.2020.112201.","ama":"Kneib M, Miles ES, Jola S, et al. Mapping ice cliffs on debris-covered glaciers using multispectral satellite images. Remote Sensing of Environment. 2021;253(2). doi:10.1016/j.rse.2020.112201","ieee":"M. Kneib et al., “Mapping ice cliffs on debris-covered glaciers using multispectral satellite images,” Remote Sensing of Environment, vol. 253, no. 2. Elsevier, 2021.","apa":"Kneib, M., Miles, E. S., Jola, S., Buri, P., Herreid, S., Bhattacharya, A., … Pellicciotti, F. (2021). Mapping ice cliffs on debris-covered glaciers using multispectral satellite images. Remote Sensing of Environment. Elsevier. https://doi.org/10.1016/j.rse.2020.112201","ista":"Kneib M, Miles ES, Jola S, Buri P, Herreid S, Bhattacharya A, Watson CS, Bolch T, Quincey D, Pellicciotti F. 2021. Mapping ice cliffs on debris-covered glaciers using multispectral satellite images. Remote Sensing of Environment. 253(2), 112201."},"article_type":"original","date_published":"2021-02-01T00:00:00Z","scopus_import":"1","keyword":["Computers in Earth Sciences","Geology","Soil Science"],"day":"01","article_processing_charge":"No","year":"2021","publication_status":"published","publisher":"Elsevier","author":[{"full_name":"Kneib, M.","last_name":"Kneib","first_name":"M."},{"full_name":"Miles, E.S.","first_name":"E.S.","last_name":"Miles"},{"full_name":"Jola, S.","first_name":"S.","last_name":"Jola"},{"last_name":"Buri","first_name":"P.","full_name":"Buri, P."},{"last_name":"Herreid","first_name":"S.","full_name":"Herreid, S."},{"full_name":"Bhattacharya, A.","first_name":"A.","last_name":"Bhattacharya"},{"first_name":"C.S.","last_name":"Watson","full_name":"Watson, C.S."},{"full_name":"Bolch, T.","first_name":"T.","last_name":"Bolch"},{"full_name":"Quincey, D.","first_name":"D.","last_name":"Quincey"},{"first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"}],"date_updated":"2023-02-28T12:53:46Z","date_created":"2023-02-20T08:12:00Z","volume":253,"article_number":"112201","extern":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.rse.2020.112201"}],"oa":1,"quality_controlled":"1","doi":"10.1016/j.rse.2020.112201","language":[{"iso":"eng"}],"month":"02","publication_identifier":{"issn":["0034-4257"]}},{"month":"04","publication_identifier":{"issn":["2072-4292"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.3390/rs13091714"}],"quality_controlled":"1","doi":"10.3390/rs13091714","language":[{"iso":"eng"}],"article_number":"1714","extern":"1","year":"2021","publication_status":"published","publisher":"MDPI","author":[{"first_name":"Shaoting","last_name":"Ren","full_name":"Ren, Shaoting"},{"full_name":"Miles, Evan S.","last_name":"Miles","first_name":"Evan S."},{"full_name":"Jia, Li","last_name":"Jia","first_name":"Li"},{"full_name":"Menenti, Massimo","last_name":"Menenti","first_name":"Massimo"},{"full_name":"Kneib, Marin","first_name":"Marin","last_name":"Kneib"},{"last_name":"Buri","first_name":"Pascal","full_name":"Buri, Pascal"},{"first_name":"Michael J.","last_name":"McCarthy","full_name":"McCarthy, Michael J."},{"full_name":"Shaw, Thomas E.","first_name":"Thomas E.","last_name":"Shaw"},{"last_name":"Yang","first_name":"Wei","full_name":"Yang, Wei"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca"}],"date_updated":"2023-02-28T12:51:10Z","date_created":"2023-02-20T08:12:06Z","volume":13,"scopus_import":"1","day":"28","article_processing_charge":"No","publication":"Remote Sensing","citation":{"short":"S. Ren, E.S. Miles, L. Jia, M. Menenti, M. Kneib, P. Buri, M.J. McCarthy, T.E. Shaw, W. Yang, F. Pellicciotti, Remote Sensing 13 (2021).","mla":"Ren, Shaoting, et al. “Anisotropy Parameterization Development and Evaluation for Glacier Surface Albedo Retrieval from Satellite Observations.” Remote Sensing, vol. 13, no. 9, 1714, MDPI, 2021, doi:10.3390/rs13091714.","chicago":"Ren, Shaoting, Evan S. Miles, Li Jia, Massimo Menenti, Marin Kneib, Pascal Buri, Michael J. McCarthy, Thomas E. Shaw, Wei Yang, and Francesca Pellicciotti. “Anisotropy Parameterization Development and Evaluation for Glacier Surface Albedo Retrieval from Satellite Observations.” Remote Sensing. MDPI, 2021. https://doi.org/10.3390/rs13091714.","ama":"Ren S, Miles ES, Jia L, et al. Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations. Remote Sensing. 2021;13(9). doi:10.3390/rs13091714","apa":"Ren, S., Miles, E. S., Jia, L., Menenti, M., Kneib, M., Buri, P., … Pellicciotti, F. (2021). Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations. Remote Sensing. MDPI. https://doi.org/10.3390/rs13091714","ieee":"S. Ren et al., “Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations,” Remote Sensing, vol. 13, no. 9. MDPI, 2021.","ista":"Ren S, Miles ES, Jia L, Menenti M, Kneib M, Buri P, McCarthy MJ, Shaw TE, Yang W, Pellicciotti F. 2021. Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations. Remote Sensing. 13(9), 1714."},"article_type":"original","date_published":"2021-04-28T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Glacier albedo determines the net shortwave radiation absorbed at the glacier surface and plays a crucial role in glacier energy and mass balance. Remote sensing techniques are efficient means to retrieve glacier surface albedo over large and inaccessible areas and to study its variability. However, corrections of anisotropic reflectance of glacier surface have been established for specific shortwave bands only, such as Landsat 5 Thematic Mapper (L5/TM) band 2 and band 4, which is a major limitation of current retrievals of glacier broadband albedo. In this study, we calibrated and evaluated four anisotropy correction models for glacier snow and ice, applicable to visible, near-infrared and shortwave-infrared wavelengths using airborne datasets of Bidirectional Reflectance Distribution Function (BRDF). We then tested the ability of the best-performing anisotropy correction model, referred to from here on as the ‘updated model’, to retrieve albedo from L5/TM, Landsat 8 Operational Land Imager (L8/OLI) and Moderate Resolution Imaging Spectroradiometer (MODIS) imagery, and evaluated these results with field measurements collected on eight glaciers around the world. Our results show that the updated model: (1) can accurately estimate anisotropic factors of reflectance for snow and ice surfaces; (2) generally performs better than prior approaches for L8/OLI albedo retrieval but is not appropriate for L5/TM; (3) generally retrieves MODIS albedo better than the MODIS standard albedo product (MCD43A3) in both absolute values and glacier albedo temporal evolution, i.e., exhibiting both fewer gaps and better agreement with field observations. As the updated model enables anisotropy correction of a maximum of 10 multispectral bands and is implemented in Google Earth Engine (GEE), it is promising for observing and analyzing glacier albedo at large spatial scales."}],"issue":"9","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12591","title":"Anisotropy parameterization development and evaluation for glacier surface albedo retrieval from satellite observations","status":"public","intvolume":" 13","oa_version":"Published Version"},{"month":"02","publication_identifier":{"issn":["1994-0424"]},"oa":1,"main_file_link":[{"url":"https://doi.org/10.5194/tc-15-595-2021","open_access":"1"}],"quality_controlled":"1","doi":"10.5194/tc-15-595-2021","language":[{"iso":"eng"}],"extern":"1","year":"2021","publication_status":"published","publisher":"Copernicus Publications","author":[{"full_name":"Shaw, Thomas E.","last_name":"Shaw","first_name":"Thomas E."},{"first_name":"Wei","last_name":"Yang","full_name":"Yang, Wei"},{"last_name":"Ayala","first_name":"Álvaro","full_name":"Ayala, Álvaro"},{"first_name":"Claudio","last_name":"Bravo","full_name":"Bravo, Claudio"},{"full_name":"Zhao, Chuanxi","first_name":"Chuanxi","last_name":"Zhao"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"}],"date_updated":"2023-02-28T12:58:27Z","date_created":"2023-02-20T08:11:56Z","volume":15,"scopus_import":"1","keyword":["Earth-Surface Processes","Water Science and Technology"],"day":"09","article_processing_charge":"No","publication":"The Cryosphere","citation":{"chicago":"Shaw, Thomas E., Wei Yang, Álvaro Ayala, Claudio Bravo, Chuanxi Zhao, and Francesca Pellicciotti. “Distributed Summer Air Temperatures across Mountain Glaciers in the South-East Tibetan Plateau: Temperature Sensitivity and Comparison with Existing Glacier Datasets.” The Cryosphere. Copernicus Publications, 2021. https://doi.org/10.5194/tc-15-595-2021.","short":"T.E. Shaw, W. Yang, Á. Ayala, C. Bravo, C. Zhao, F. Pellicciotti, The Cryosphere 15 (2021) 595–614.","mla":"Shaw, Thomas E., et al. “Distributed Summer Air Temperatures across Mountain Glaciers in the South-East Tibetan Plateau: Temperature Sensitivity and Comparison with Existing Glacier Datasets.” The Cryosphere, vol. 15, no. 2, Copernicus Publications, 2021, pp. 595–614, doi:10.5194/tc-15-595-2021.","apa":"Shaw, T. E., Yang, W., Ayala, Á., Bravo, C., Zhao, C., & Pellicciotti, F. (2021). Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets. The Cryosphere. Copernicus Publications. https://doi.org/10.5194/tc-15-595-2021","ieee":"T. E. Shaw, W. Yang, Á. Ayala, C. Bravo, C. Zhao, and F. Pellicciotti, “Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets,” The Cryosphere, vol. 15, no. 2. Copernicus Publications, pp. 595–614, 2021.","ista":"Shaw TE, Yang W, Ayala Á, Bravo C, Zhao C, Pellicciotti F. 2021. Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets. The Cryosphere. 15(2), 595–614.","ama":"Shaw TE, Yang W, Ayala Á, Bravo C, Zhao C, Pellicciotti F. Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets. The Cryosphere. 2021;15(2):595-614. doi:10.5194/tc-15-595-2021"},"article_type":"original","page":"595-614","date_published":"2021-02-09T00:00:00Z","type":"journal_article","abstract":[{"lang":"eng","text":"Near-surface air temperature (Ta) is highly important for modelling glacier ablation, though its spatio-temporal variability over melting glaciers still remains largely unknown. We present a new dataset of distributed Ta for three glaciers of different size in the south-east Tibetan Plateau during two monsoon-dominated summer seasons. We compare on-glacier Ta to ambient Ta extrapolated from several local off-glacier stations. We parameterise the along-flowline sensitivity of Ta on these glaciers to changes in off-glacier temperatures (referred to as “temperature sensitivity”) and present the results in the context of available distributed on-glacier datasets around the world. Temperature sensitivity decreases rapidly up to 2000–3000 m along the down-glacier flowline distance. Beyond this distance, both the Ta on the Tibetan glaciers and global glacier datasets show little additional cooling relative to the off-glacier temperature. In general, Ta on small glaciers (with flowline distances <1000 m) is highly sensitive to temperature changes outside the glacier boundary layer. The climatology of a given region can influence the general magnitude of this temperature sensitivity, though no strong relationships are found between along-flowline temperature sensitivity and mean summer temperatures or precipitation. The terminus of some glaciers is affected by other warm-air processes that increase temperature sensitivity (such as divergent boundary layer flow, warm up-valley winds or debris/valley heating effects) which are evident only beyond ∼70 % of the total glacier flowline distance. Our results therefore suggest a strong role of local effects in modulating temperature sensitivity close to the glacier terminus, although further work is still required to explain the variability of these effects for different glaciers."}],"issue":"2","_id":"12589","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Distributed summer air temperatures across mountain glaciers in the south-east Tibetan Plateau: Temperature sensitivity and comparison with existing glacier datasets","status":"public","intvolume":" 15","oa_version":"Published Version"},{"quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2021JF006179"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1029/2021jf006179","month":"10","publication_identifier":{"issn":["2169-9003","2169-9011"]},"publication_status":"published","publisher":"American Geophysical Union","year":"2021","date_updated":"2023-02-28T13:18:26Z","date_created":"2023-02-20T08:11:36Z","volume":126,"author":[{"full_name":"Kneib, M.","first_name":"M.","last_name":"Kneib"},{"last_name":"Miles","first_name":"E. S.","full_name":"Miles, E. S."},{"full_name":"Buri, P.","first_name":"P.","last_name":"Buri"},{"full_name":"Molnar, P.","first_name":"P.","last_name":"Molnar"},{"last_name":"McCarthy","first_name":"M.","full_name":"McCarthy, M."},{"first_name":"S.","last_name":"Fugger","full_name":"Fugger, S."},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","first_name":"Francesca","last_name":"Pellicciotti"}],"article_number":"e2021JF006179","extern":"1","article_type":"original","publication":"Journal of Geophysical Research: Earth Surface","citation":{"ista":"Kneib M, Miles ES, Buri P, Molnar P, McCarthy M, Fugger S, Pellicciotti F. 2021. Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling. Journal of Geophysical Research: Earth Surface. 126(10), e2021JF006179.","ieee":"M. Kneib et al., “Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling,” Journal of Geophysical Research: Earth Surface, vol. 126, no. 10. American Geophysical Union, 2021.","apa":"Kneib, M., Miles, E. S., Buri, P., Molnar, P., McCarthy, M., Fugger, S., & Pellicciotti, F. (2021). Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling. Journal of Geophysical Research: Earth Surface. American Geophysical Union. https://doi.org/10.1029/2021jf006179","ama":"Kneib M, Miles ES, Buri P, et al. Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling. Journal of Geophysical Research: Earth Surface. 2021;126(10). doi:10.1029/2021jf006179","chicago":"Kneib, M., E. S. Miles, P. Buri, P. Molnar, M. McCarthy, S. Fugger, and Francesca Pellicciotti. “Interannual Dynamics of Ice Cliff Populations on Debris‐covered Glaciers from Remote Sensing Observations and Stochastic Modeling.” Journal of Geophysical Research: Earth Surface. American Geophysical Union, 2021. https://doi.org/10.1029/2021jf006179.","mla":"Kneib, M., et al. “Interannual Dynamics of Ice Cliff Populations on Debris‐covered Glaciers from Remote Sensing Observations and Stochastic Modeling.” Journal of Geophysical Research: Earth Surface, vol. 126, no. 10, e2021JF006179, American Geophysical Union, 2021, doi:10.1029/2021jf006179.","short":"M. Kneib, E.S. Miles, P. Buri, P. Molnar, M. McCarthy, S. Fugger, F. Pellicciotti, Journal of Geophysical Research: Earth Surface 126 (2021)."},"date_published":"2021-10-01T00:00:00Z","keyword":["Earth-Surface Processes","Geophysics"],"scopus_import":"1","day":"01","article_processing_charge":"No","status":"public","title":"Interannual dynamics of ice cliff populations on debris‐covered glaciers from remote sensing observations and stochastic modeling","intvolume":" 126","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12586","oa_version":"Published Version","type":"journal_article","abstract":[{"lang":"eng","text":"Ice cliffs are common on debris-covered glaciers and have relatively high melt rates due to their direct exposure to incoming radiation. Previous studies have shown that their number and relative area can change considerably from year to year, but this variability has not been explored, in part because available cliff observations are irregular. Here, we systematically mapped and tracked ice cliffs across four debris-covered glaciers in High Mountain Asia for every late ablation season from 2009 to 2019 using high-resolution multi-spectral satellite imagery. We then quantified the processes occurring at the feature scale to train a stochastic birth-death model to represent the cliff population dynamics. Our results show that while the cliff relative area can change by up to 20% from year to year, the natural long-term variability is constrained, thus defining a glacier-specific cliff carrying capacity. In a subsequent step, the inclusion of external drivers related to climate, glacier dynamics, and hydrology highlights the influence of these variables on the cliff population dynamics, which is usually not a direct one due to the complexity and interdependence of the processes taking place at the glacier surface. In some extreme cases (here, a glacier surge), these external drivers may lead to a reorganization of the cliffs at the glacier surface and a change in the natural variability. These results have implications for the melt of debris-covered glaciers, in addition to showing the high rate of changes at their surface and highlighting some of the links between cliff population and glacier state."}],"issue":"10"},{"extern":"1","publication_status":"published","publisher":"Cambridge University Press","year":"2021","date_updated":"2023-02-28T13:07:11Z","date_created":"2023-02-20T08:11:42Z","volume":67,"author":[{"first_name":"Rebecca L.","last_name":"Stewart","full_name":"Stewart, Rebecca L."},{"full_name":"Westoby, Matthew","first_name":"Matthew","last_name":"Westoby"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca"},{"last_name":"Rowan","first_name":"Ann","full_name":"Rowan, Ann"},{"first_name":"Darrel","last_name":"Swift","full_name":"Swift, Darrel"},{"last_name":"Brock","first_name":"Benjamin","full_name":"Brock, Benjamin"},{"first_name":"John","last_name":"Woodward","full_name":"Woodward, John"}],"month":"04","publication_identifier":{"eissn":["1727-5652"],"issn":["0022-1430"]},"quality_controlled":"1","oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1017/jog.2020.111"}],"language":[{"iso":"eng"}],"doi":"10.1017/jog.2020.111","type":"journal_article","abstract":[{"lang":"eng","text":"Surface energy-balance models are commonly used in conjunction with satellite thermal imagery to estimate supraglacial debris thickness. Removing the need for local meteorological data in the debris thickness estimation workflow could improve the versatility and spatiotemporal application of debris thickness estimation. We evaluate the use of regional reanalysis data to derive debris thickness for two mountain glaciers using a surface energy-balance model. Results forced using ERA-5 agree with AWS-derived estimates to within 0.01 ± 0.05 m for Miage Glacier, Italy, and 0.01 ± 0.02 m for Khumbu Glacier, Nepal. ERA-5 data were then used to estimate spatiotemporal changes in debris thickness over a ~20-year period for Miage Glacier, Khumbu Glacier and Haut Glacier d'Arolla, Switzerland. We observe significant increases in debris thickness at the terminus for Haut Glacier d'Arolla and at the margins of the expanding debris cover at all glaciers. While simulated debris thickness was underestimated compared to point measurements in areas of thick debris, our approach can reconstruct glacier-scale debris thickness distribution and its temporal evolution over multiple decades. We find significant changes in debris thickness over areas of thin debris, areas susceptible to high ablation rates, where current knowledge of debris evolution is limited."}],"issue":"262","title":"Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling","status":"public","intvolume":" 67","_id":"12587","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","scopus_import":"1","day":"01","article_processing_charge":"No","article_type":"original","page":"366-384","publication":"Journal of Glaciology","citation":{"ieee":"R. L. Stewart et al., “Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling,” Journal of Glaciology, vol. 67, no. 262. Cambridge University Press, pp. 366–384, 2021.","apa":"Stewart, R. L., Westoby, M., Pellicciotti, F., Rowan, A., Swift, D., Brock, B., & Woodward, J. (2021). Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling. Journal of Glaciology. Cambridge University Press. https://doi.org/10.1017/jog.2020.111","ista":"Stewart RL, Westoby M, Pellicciotti F, Rowan A, Swift D, Brock B, Woodward J. 2021. Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling. Journal of Glaciology. 67(262), 366–384.","ama":"Stewart RL, Westoby M, Pellicciotti F, et al. Using climate reanalysis data in conjunction with multi-temporal satellite thermal imagery to derive supraglacial debris thickness changes from energy-balance modelling. Journal of Glaciology. 2021;67(262):366-384. doi:10.1017/jog.2020.111","chicago":"Stewart, Rebecca L., Matthew Westoby, Francesca Pellicciotti, Ann Rowan, Darrel Swift, Benjamin Brock, and John Woodward. “Using Climate Reanalysis Data in Conjunction with Multi-Temporal Satellite Thermal Imagery to Derive Supraglacial Debris Thickness Changes from Energy-Balance Modelling.” Journal of Glaciology. Cambridge University Press, 2021. https://doi.org/10.1017/jog.2020.111.","short":"R.L. Stewart, M. Westoby, F. Pellicciotti, A. Rowan, D. Swift, B. Brock, J. Woodward, Journal of Glaciology 67 (2021) 366–384.","mla":"Stewart, Rebecca L., et al. “Using Climate Reanalysis Data in Conjunction with Multi-Temporal Satellite Thermal Imagery to Derive Supraglacial Debris Thickness Changes from Energy-Balance Modelling.” Journal of Glaciology, vol. 67, no. 262, Cambridge University Press, 2021, pp. 366–84, doi:10.1017/jog.2020.111."},"date_published":"2021-04-01T00:00:00Z"},{"date_published":"2021-05-17T00:00:00Z","citation":{"ama":"Miles E, McCarthy M, Dehecq A, Kneib M, Fugger S, Pellicciotti F. Health and sustainability of glaciers in High Mountain Asia. Nature Communications. 2021;12. doi:10.1038/s41467-021-23073-4","ista":"Miles E, McCarthy M, Dehecq A, Kneib M, Fugger S, Pellicciotti F. 2021. Health and sustainability of glaciers in High Mountain Asia. Nature Communications. 12, 2868.","ieee":"E. Miles, M. McCarthy, A. Dehecq, M. Kneib, S. Fugger, and F. Pellicciotti, “Health and sustainability of glaciers in High Mountain Asia,” Nature Communications, vol. 12. Springer Nature, 2021.","apa":"Miles, E., McCarthy, M., Dehecq, A., Kneib, M., Fugger, S., & Pellicciotti, F. (2021). Health and sustainability of glaciers in High Mountain Asia. Nature Communications. Springer Nature. https://doi.org/10.1038/s41467-021-23073-4","mla":"Miles, Evan, et al. “Health and Sustainability of Glaciers in High Mountain Asia.” Nature Communications, vol. 12, 2868, Springer Nature, 2021, doi:10.1038/s41467-021-23073-4.","short":"E. Miles, M. McCarthy, A. Dehecq, M. Kneib, S. Fugger, F. Pellicciotti, Nature Communications 12 (2021).","chicago":"Miles, Evan, Michael McCarthy, Amaury Dehecq, Marin Kneib, Stefan Fugger, and Francesca Pellicciotti. “Health and Sustainability of Glaciers in High Mountain Asia.” Nature Communications. Springer Nature, 2021. https://doi.org/10.1038/s41467-021-23073-4."},"publication":"Nature Communications","article_type":"original","article_processing_charge":"No","day":"17","scopus_import":"1","keyword":["General Physics and Astronomy","General Biochemistry","Genetics and Molecular Biology","General Chemistry","Multidisciplinary"],"oa_version":"Published Version","_id":"12585","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12","status":"public","title":"Health and sustainability of glaciers in High Mountain Asia","abstract":[{"lang":"eng","text":"Glaciers in High Mountain Asia generate meltwater that supports the water needs of 250 million people, but current knowledge of annual accumulation and ablation is limited to sparse field measurements biased in location and glacier size. Here, we present altitudinally-resolved specific mass balances (surface, internal, and basal combined) for 5527 glaciers in High Mountain Asia for 2000–2016, derived by correcting observed glacier thinning patterns for mass redistribution due to ice flow. We find that 41% of glaciers accumulated mass over less than 20% of their area, and only 60% ± 10% of regional annual ablation was compensated by accumulation. Even without 21st century warming, 21% ± 1% of ice volume will be lost by 2100 due to current climatic-geometric imbalance, representing a reduction in glacier ablation into rivers of 28% ± 1%. The ablation of glaciers in the Himalayas and Tien Shan was mostly unsustainable and ice volume in these regions will reduce by at least 30% by 2100. The most important and vulnerable glacier-fed river basins (Amu Darya, Indus, Syr Darya, Tarim Interior) were supplied with >50% sustainable glacier ablation but will see long-term reductions in ice mass and glacier meltwater supply regardless of the Karakoram Anomaly."}],"type":"journal_article","doi":"10.1038/s41467-021-23073-4","language":[{"iso":"eng"}],"oa":1,"main_file_link":[{"url":"https://doi.org/10.1038/s41467-021-23073-4","open_access":"1"}],"quality_controlled":"1","publication_identifier":{"issn":["2041-1723"]},"month":"05","author":[{"first_name":"Evan","last_name":"Miles","full_name":"Miles, Evan"},{"first_name":"Michael","last_name":"McCarthy","full_name":"McCarthy, Michael"},{"last_name":"Dehecq","first_name":"Amaury","full_name":"Dehecq, Amaury"},{"first_name":"Marin","last_name":"Kneib","full_name":"Kneib, Marin"},{"full_name":"Fugger, Stefan","first_name":"Stefan","last_name":"Fugger"},{"first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca"}],"volume":12,"date_created":"2023-02-20T08:11:29Z","date_updated":"2023-02-28T13:21:51Z","year":"2021","publisher":"Springer Nature","publication_status":"published","extern":"1","article_number":"2868"},{"date_published":"2021-03-28T00:00:00Z","article_type":"letter_note","publication":"Geophysical Research Letters","citation":{"ieee":"P. Buri, E. S. Miles, J. F. Steiner, S. Ragettli, and F. Pellicciotti, “Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers,” Geophysical Research Letters, vol. 48, no. 6. American Geophysical Union, 2021.","apa":"Buri, P., Miles, E. S., Steiner, J. F., Ragettli, S., & Pellicciotti, F. (2021). Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers. Geophysical Research Letters. American Geophysical Union. https://doi.org/10.1029/2020gl092150","ista":"Buri P, Miles ES, Steiner JF, Ragettli S, Pellicciotti F. 2021. Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers. Geophysical Research Letters. 48(6), e2020GL092150.","ama":"Buri P, Miles ES, Steiner JF, Ragettli S, Pellicciotti F. Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers. Geophysical Research Letters. 2021;48(6). doi:10.1029/2020gl092150","chicago":"Buri, Pascal, Evan S. Miles, Jakob F. Steiner, Silvan Ragettli, and Francesca Pellicciotti. “Supraglacial Ice Cliffs Can Substantially Increase the Mass Loss of Debris‐covered Glaciers.” Geophysical Research Letters. American Geophysical Union, 2021. https://doi.org/10.1029/2020gl092150.","short":"P. Buri, E.S. Miles, J.F. Steiner, S. Ragettli, F. Pellicciotti, Geophysical Research Letters 48 (2021).","mla":"Buri, Pascal, et al. “Supraglacial Ice Cliffs Can Substantially Increase the Mass Loss of Debris‐covered Glaciers.” Geophysical Research Letters, vol. 48, no. 6, e2020GL092150, American Geophysical Union, 2021, doi:10.1029/2020gl092150."},"day":"28","article_processing_charge":"No","keyword":["General Earth and Planetary Sciences","Geophysics"],"scopus_import":"1","oa_version":"Published Version","status":"public","title":"Supraglacial ice cliffs can substantially increase the mass loss of debris‐covered glaciers","intvolume":" 48","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12588","abstract":[{"text":"The thinning patterns of debris-covered glaciers in High Mountain Asia are not well understood. Here we calculate the effect of supraglacial ice cliffs on the mass balance of all glaciers in a Himalayan catchment, using a process-based ice cliff melt model. We show that ice cliffs are responsible for higher than expected thinning rates of debris-covered glacier tongues, leading to an underestimation of their ice mass loss of 17% ± 4% in the catchment if not considered. We also show that cliffs do enhance melt where other processes would suppress it, that is, at high elevations, or where debris is thick, and that they contribute relatively more to glacier mass loss if oriented north. Our approach provides a key contribution to our understanding of the mass losses of debris-covered glaciers, and a new quantification of their catchment wide melt and mass balance.","lang":"eng"}],"issue":"6","type":"journal_article","language":[{"iso":"eng"}],"doi":"10.1029/2020gl092150","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2020GL092150"}],"oa":1,"month":"03","publication_identifier":{"eissn":["1944-8007"],"issn":["0094-8276"]},"date_created":"2023-02-20T08:11:49Z","date_updated":"2023-02-28T13:01:31Z","volume":48,"author":[{"full_name":"Buri, Pascal","first_name":"Pascal","last_name":"Buri"},{"first_name":"Evan S.","last_name":"Miles","full_name":"Miles, Evan S."},{"first_name":"Jakob F.","last_name":"Steiner","full_name":"Steiner, Jakob F."},{"first_name":"Silvan","last_name":"Ragettli","full_name":"Ragettli, Silvan"},{"full_name":"Pellicciotti, Francesca","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca"}],"publication_status":"published","publisher":"American Geophysical Union","year":"2021","extern":"1","article_number":"e2020GL092150"},{"publication":"Journal of Geophysical Research: Atmospheres","citation":{"short":"C.L. Fyffe, E. Potter, S. Fugger, A. Orr, S. Fatichi, E. Loarte, K. Medina, R.Å. Hellström, M. Bernat, C. Aubry‐Wake, W. Gurgiser, L.B. Perry, W. Suarez, D.J. Quincey, F. Pellicciotti, Journal of Geophysical Research: Atmospheres 126 (2021).","mla":"Fyffe, Catriona L., et al. “The Energy and Mass Balance of Peruvian Glaciers.” Journal of Geophysical Research: Atmospheres, vol. 126, no. 23, e2021JD034911, American Geophysical Union, 2021, doi:10.1029/2021jd034911.","chicago":"Fyffe, Catriona L., Emily Potter, Stefan Fugger, Andrew Orr, Simone Fatichi, Edwin Loarte, Katy Medina, et al. “The Energy and Mass Balance of Peruvian Glaciers.” Journal of Geophysical Research: Atmospheres. American Geophysical Union, 2021. https://doi.org/10.1029/2021jd034911.","ama":"Fyffe CL, Potter E, Fugger S, et al. The energy and mass balance of Peruvian Glaciers. Journal of Geophysical Research: Atmospheres. 2021;126(23). doi:10.1029/2021jd034911","apa":"Fyffe, C. L., Potter, E., Fugger, S., Orr, A., Fatichi, S., Loarte, E., … Pellicciotti, F. (2021). The energy and mass balance of Peruvian Glaciers. Journal of Geophysical Research: Atmospheres. American Geophysical Union. https://doi.org/10.1029/2021jd034911","ieee":"C. L. Fyffe et al., “The energy and mass balance of Peruvian Glaciers,” Journal of Geophysical Research: Atmospheres, vol. 126, no. 23. American Geophysical Union, 2021.","ista":"Fyffe CL, Potter E, Fugger S, Orr A, Fatichi S, Loarte E, Medina K, Hellström RÅ, Bernat M, Aubry‐Wake C, Gurgiser W, Perry LB, Suarez W, Quincey DJ, Pellicciotti F. 2021. The energy and mass balance of Peruvian Glaciers. Journal of Geophysical Research: Atmospheres. 126(23), e2021JD034911."},"article_type":"original","date_published":"2021-12-16T00:00:00Z","scopus_import":"1","keyword":["Space and Planetary Science","Earth and Planetary Sciences (miscellaneous)","Atmospheric Science","Geophysics"],"day":"16","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12583","title":"The energy and mass balance of Peruvian Glaciers","status":"public","intvolume":" 126","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Peruvian glaciers are important contributors to dry season runoff for agriculture and hydropower, but they are at risk of disappearing due to climate change. We applied a physically based, energy balance melt model at five on-glacier sites within the Peruvian Cordilleras Blanca and Vilcanota. Net shortwave radiation dominates the energy balance, and despite this flux being higher in the dry season, melt rates are lower due to losses from net longwave radiation and the latent heat flux. The sensible heat flux is a relatively small contributor to melt energy. At three of the sites the wet season snowpack was discontinuous, forming and melting within a daily to weekly timescale, and resulting in highly variable melt rates closely related to precipitation dynamics. Cold air temperatures due to a strong La Niña year at Shallap Glacier (Cordillera Blanca) resulted in a continuous wet season snowpack, significantly reducing wet season ablation. Sublimation was most important at the highest site in the accumulation zone of the Quelccaya Ice Cap (Cordillera Vilcanota), accounting for 81% of ablation, compared to 2%–4% for the other sites. Air temperature and precipitation inputs were perturbed to investigate the climate sensitivity of the five glaciers. At the lower sites warmer air temperatures resulted in a switch from snowfall to rain, so that ablation was increased via the decrease in albedo and increase in net shortwave radiation. At the top of Quelccaya Ice Cap warming caused melting to replace sublimation so that ablation increased nonlinearly with air temperature.","lang":"eng"}],"issue":"23","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1029/2021JD034911"}],"oa":1,"quality_controlled":"1","doi":"10.1029/2021jd034911","language":[{"iso":"eng"}],"month":"12","publication_identifier":{"eissn":["2169-8996"],"issn":["2169-897X"]},"year":"2021","publication_status":"published","publisher":"American Geophysical Union","author":[{"full_name":"Fyffe, Catriona L.","first_name":"Catriona L.","last_name":"Fyffe"},{"first_name":"Emily","last_name":"Potter","full_name":"Potter, Emily"},{"full_name":"Fugger, Stefan","first_name":"Stefan","last_name":"Fugger"},{"full_name":"Orr, Andrew","first_name":"Andrew","last_name":"Orr"},{"full_name":"Fatichi, Simone","first_name":"Simone","last_name":"Fatichi"},{"first_name":"Edwin","last_name":"Loarte","full_name":"Loarte, Edwin"},{"last_name":"Medina","first_name":"Katy","full_name":"Medina, Katy"},{"first_name":"Robert Å.","last_name":"Hellström","full_name":"Hellström, Robert Å."},{"full_name":"Bernat, Maud","first_name":"Maud","last_name":"Bernat"},{"last_name":"Aubry‐Wake","first_name":"Caroline","full_name":"Aubry‐Wake, Caroline"},{"full_name":"Gurgiser, Wolfgang","last_name":"Gurgiser","first_name":"Wolfgang"},{"last_name":"Perry","first_name":"L. Baker","full_name":"Perry, L. Baker"},{"full_name":"Suarez, Wilson","first_name":"Wilson","last_name":"Suarez"},{"last_name":"Quincey","first_name":"Duncan J.","full_name":"Quincey, Duncan J."},{"full_name":"Pellicciotti, Francesca","first_name":"Francesca","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70"}],"date_created":"2023-02-20T08:10:43Z","date_updated":"2023-02-28T13:31:08Z","volume":126,"article_number":"e2021JD034911","extern":"1"},{"external_id":{"arxiv":["2101.02594"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E","name":"Formal Methods for Stochastic Models: Algorithms and Applications","call_identifier":"H2020"}],"quality_controlled":"1","doi":"10.1007/978-3-030-72016-2","conference":{"location":"Luxembourg City, Luxembourg","start_date":"2021-03-27","end_date":"2021-04-01","name":"TACAS: Tools and Algorithms for the Construction and Analysis of Systems"},"language":[{"iso":"eng"}],"publication_identifier":{"issn":["0302-9743"],"isbn":["9783030720155"],"eissn":["1611-3349"]},"month":"03","year":"2021","acknowledgement":"We thank anonymous reviewers for valuable inputs. This work is supported in part by NSF grant 2030859 to the CRA for the CIFellows Project, NSF grants IIS-1527668, CCF-1704883, IIS-1830549, the ERC CoG 863818 (ForM-SMArt), and an award from the Maryland Procurement Office.","department":[{"_id":"KrCh"}],"publisher":"Springer Nature","publication_status":"published","author":[{"full_name":"Bansal, Suguman","first_name":"Suguman","last_name":"Bansal"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Vardi, Moshe Y.","first_name":"Moshe Y.","last_name":"Vardi"}],"volume":12651,"date_updated":"2023-03-28T11:03:11Z","date_created":"2023-03-26T22:01:09Z","ec_funded":1,"file_date_updated":"2023-03-28T11:00:33Z","citation":{"apa":"Bansal, S., Chatterjee, K., & Vardi, M. Y. (2021). On satisficing in quantitative games. In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (Vol. 12651, pp. 20–37). Luxembourg City, Luxembourg: Springer Nature. https://doi.org/10.1007/978-3-030-72016-2","ieee":"S. Bansal, K. Chatterjee, and M. Y. Vardi, “On satisficing in quantitative games,” in 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Luxembourg City, Luxembourg, 2021, vol. 12651, pp. 20–37.","ista":"Bansal S, Chatterjee K, Vardi MY. 2021. On satisficing in quantitative games. 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. TACAS: Tools and Algorithms for the Construction and Analysis of Systems, LNCS, vol. 12651, 20–37.","ama":"Bansal S, Chatterjee K, Vardi MY. On satisficing in quantitative games. In: 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems. Vol 12651. Springer Nature; 2021:20-37. doi:10.1007/978-3-030-72016-2","chicago":"Bansal, Suguman, Krishnendu Chatterjee, and Moshe Y. Vardi. “On Satisficing in Quantitative Games.” In 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, 12651:20–37. Springer Nature, 2021. https://doi.org/10.1007/978-3-030-72016-2.","short":"S. Bansal, K. Chatterjee, M.Y. Vardi, in:, 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Springer Nature, 2021, pp. 20–37.","mla":"Bansal, Suguman, et al. “On Satisficing in Quantitative Games.” 27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, vol. 12651, Springer Nature, 2021, pp. 20–37, doi:10.1007/978-3-030-72016-2."},"publication":"27th International Conference on Tools and Algorithms for the Construction and Analysis of Systems","page":"20-37","date_published":"2021-03-21T00:00:00Z","scopus_import":"1","article_processing_charge":"No","has_accepted_license":"1","day":"21","_id":"12767","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 12651","ddc":["000"],"status":"public","title":"On satisficing in quantitative games","oa_version":"Published Version","file":[{"date_updated":"2023-03-28T11:00:33Z","date_created":"2023-03-28T11:00:33Z","checksum":"b020b78b23587ce7610b1aafb4e63438","success":1,"relation":"main_file","file_id":"12777","file_size":747418,"content_type":"application/pdf","creator":"dernst","file_name":"2021_LNCS_Bansal.pdf","access_level":"open_access"}],"type":"conference","alternative_title":["LNCS"],"abstract":[{"text":"Several problems in planning and reactive synthesis can be reduced to the analysis of two-player quantitative graph games. Optimization is one form of analysis. We argue that in many cases it may be better to replace the optimization problem with the satisficing problem, where instead of searching for optimal solutions, the goal is to search for solutions that adhere to a given threshold bound.\r\nThis work defines and investigates the satisficing problem on a two-player graph game with the discounted-sum cost model. We show that while the satisficing problem can be solved using numerical methods just like the optimization problem, this approach does not render compelling benefits over optimization. When the discount factor is, however, an integer, we present another approach to satisficing, which is purely based on automata methods. We show that this approach is algorithmically more performant – both theoretically and empirically – and demonstrates the broader applicability of satisficing over optimization.","lang":"eng"}]},{"author":[{"orcid":"0000-0001-7252-8072","id":"4D23B7DA-F248-11E8-B48F-1D18A9856A87","last_name":"Hensel","first_name":"Sebastian","full_name":"Hensel, Sebastian"},{"first_name":"Tim","last_name":"Laux","full_name":"Laux, Tim"}],"oa_version":"Preprint","date_created":"2021-09-13T12:17:10Z","date_updated":"2023-05-03T10:34:38Z","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 948819), and from the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) under Germany’s Excellence Strategy – EXC-2047/1 – 390685813. The content of this paper was developed and parts of it were written during a visit of the first author to the Hausdorff Center of Mathematics (HCM), University of Bonn. The hospitality and the support of HCM are gratefully acknowledged.","_id":"10011","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","department":[{"_id":"JuFi"}],"publication_status":"submitted","title":"A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness","status":"public","ec_funded":1,"abstract":[{"lang":"eng","text":"We propose a new weak solution concept for (two-phase) mean curvature flow which enjoys both (unconditional) existence and (weak-strong) uniqueness properties. These solutions are evolving varifolds, just as in Brakke's formulation, but are coupled to the phase volumes by a simple transport equation. First, we show that, in the exact same setup as in Ilmanen's proof [J. Differential Geom. 38, 417-461, (1993)], any limit point of solutions to the Allen-Cahn equation is a varifold solution in our sense. Second, we prove that any calibrated flow in the sense of Fischer et al. [arXiv:2003.05478] - and hence any classical solution to mean curvature flow - is unique in the class of our new varifold solutions. This is in sharp contrast to the case of Brakke flows, which a priori may disappear at any given time and are therefore fatally non-unique. Finally, we propose an extension of the solution concept to the multi-phase case which is at least guaranteed to satisfy a weak-strong uniqueness principle."}],"type":"preprint","article_number":"2109.04233","date_published":"2021-09-09T00:00:00Z","doi":"10.48550/arXiv.2109.04233","language":[{"iso":"eng"}],"external_id":{"arxiv":["2109.04233"]},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2109.04233"}],"citation":{"ieee":"S. Hensel and T. Laux, “A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness,” arXiv. .","apa":"Hensel, S., & Laux, T. (n.d.). A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. https://doi.org/10.48550/arXiv.2109.04233","ista":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv, 2109.04233.","ama":"Hensel S, Laux T. A new varifold solution concept for mean curvature flow: Convergence of the Allen-Cahn equation and weak-strong uniqueness. arXiv. doi:10.48550/arXiv.2109.04233","chicago":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2109.04233.","short":"S. Hensel, T. Laux, ArXiv (n.d.).","mla":"Hensel, Sebastian, and Tim Laux. “A New Varifold Solution Concept for Mean Curvature Flow: Convergence of the Allen-Cahn Equation and Weak-Strong Uniqueness.” ArXiv, 2109.04233, doi:10.48550/arXiv.2109.04233."},"oa":1,"publication":"arXiv","project":[{"grant_number":"948819","_id":"0aa76401-070f-11eb-9043-b5bb049fa26d","name":"Bridging Scales in Random Materials","call_identifier":"H2020"}],"article_processing_charge":"No","day":"09","month":"09","keyword":["Mean curvature flow","gradient flows","varifolds","weak solutions","weak-strong uniqueness","calibrated geometry","gradient-flow calibrations"]},{"day":"08","month":"03","article_processing_charge":"No","publication":"arXiv","oa":1,"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.04817"}],"citation":{"mla":"Arguin, Louis-Pierre, et al. “Maxima of a Random Model of the Riemann Zeta Function over Intervals of Varying Length.” ArXiv, 2103.04817, doi:10.48550/arXiv.2103.04817.","short":"L.-P. Arguin, G. Dubach, L. Hartung, ArXiv (n.d.).","chicago":"Arguin, Louis-Pierre, Guillaume Dubach, and Lisa Hartung. “Maxima of a Random Model of the Riemann Zeta Function over Intervals of Varying Length.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2103.04817.","ama":"Arguin L-P, Dubach G, Hartung L. Maxima of a random model of the Riemann zeta function over intervals of varying length. arXiv. doi:10.48550/arXiv.2103.04817","ista":"Arguin L-P, Dubach G, Hartung L. Maxima of a random model of the Riemann zeta function over intervals of varying length. arXiv, 2103.04817.","apa":"Arguin, L.-P., Dubach, G., & Hartung, L. (n.d.). Maxima of a random model of the Riemann zeta function over intervals of varying length. arXiv. https://doi.org/10.48550/arXiv.2103.04817","ieee":"L.-P. Arguin, G. Dubach, and L. Hartung, “Maxima of a random model of the Riemann zeta function over intervals of varying length,” arXiv. ."},"external_id":{"arxiv":["2103.04817"]},"project":[{"grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"date_published":"2021-03-08T00:00:00Z","doi":"10.48550/arXiv.2103.04817","language":[{"iso":"eng"}],"article_number":"2103.04817","type":"preprint","abstract":[{"lang":"eng","text":"We consider a model of the Riemann zeta function on the critical axis and study its maximum over intervals of length (log T)θ, where θ is either fixed or tends to zero at a suitable rate.\r\nIt is shown that the deterministic level of the maximum interpolates smoothly between the ones\r\nof log-correlated variables and of i.i.d. random variables, exhibiting a smooth transition ‘from\r\n3/4 to 1/4’ in the second order. This provides a natural context where extreme value statistics of\r\nlog-correlated variables with time-dependent variance and rate occur. A key ingredient of the\r\nproof is a precise upper tail tightness estimate for the maximum of the model on intervals of\r\nsize one, that includes a Gaussian correction. This correction is expected to be present for the\r\nRiemann zeta function and pertains to the question of the correct order of the maximum of\r\nthe zeta function in large intervals."}],"ec_funded":1,"_id":"9230","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","acknowledgement":"The research of L.-P. A. is supported in part by the grant NSF CAREER DMS-1653602. G. D. gratefully acknowledges support from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 754411. The research of L. H. is supported in part by the Deutsche Forschungsgemeinschaft (DFG, German Research Foundation) through Project-ID 233630050 -TRR 146, Project-ID 443891315 within SPP 2265 and Project-ID 446173099.","title":"Maxima of a random model of the Riemann zeta function over intervals of varying length","status":"public","publication_status":"submitted","department":[{"_id":"LaEr"}],"author":[{"first_name":"Louis-Pierre","last_name":"Arguin","full_name":"Arguin, Louis-Pierre"},{"full_name":"Dubach, Guillaume","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","orcid":"0000-0001-6892-8137","first_name":"Guillaume","last_name":"Dubach"},{"full_name":"Hartung, Lisa","first_name":"Lisa","last_name":"Hartung"}],"date_updated":"2023-05-03T10:22:59Z","date_created":"2021-03-09T11:08:15Z","oa_version":"Preprint"},{"_id":"9281","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","department":[{"_id":"LaEr"},{"_id":"ToHe"}],"status":"public","title":"Formal verification of Zagier's one-sentence proof","publication_status":"submitted","related_material":{"record":[{"relation":"other","status":"public","id":"9946"}]},"author":[{"full_name":"Dubach, Guillaume","orcid":"0000-0001-6892-8137","id":"D5C6A458-10C4-11EA-ABF4-A4B43DDC885E","last_name":"Dubach","first_name":"Guillaume"},{"last_name":"Mühlböck","first_name":"Fabian","orcid":"0000-0003-1548-0177","id":"6395C5F6-89DF-11E9-9C97-6BDFE5697425","full_name":"Mühlböck, Fabian"}],"oa_version":"Preprint","date_updated":"2023-05-03T10:26:45Z","date_created":"2021-03-23T05:38:48Z","type":"preprint","article_number":"2103.11389","ec_funded":1,"abstract":[{"lang":"eng","text":"We comment on two formal proofs of Fermat's sum of two squares theorem, written using the Mathematical Components libraries of the Coq proof assistant. The first one follows Zagier's celebrated one-sentence proof; the second follows David Christopher's recent new proof relying on partition-theoretic arguments. Both formal proofs rely on a general property of involutions of finite sets, of independent interest. The proof technique consists for the most part of automating recurrent tasks (such as case distinctions and computations on natural numbers) via ad hoc tactics."}],"oa":1,"external_id":{"arxiv":["2103.11389"]},"citation":{"ama":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv. doi:10.48550/arXiv.2103.11389","apa":"Dubach, G., & Mühlböck, F. (n.d.). Formal verification of Zagier’s one-sentence proof. arXiv. https://doi.org/10.48550/arXiv.2103.11389","ieee":"G. Dubach and F. Mühlböck, “Formal verification of Zagier’s one-sentence proof,” arXiv. .","ista":"Dubach G, Mühlböck F. Formal verification of Zagier’s one-sentence proof. arXiv, 2103.11389.","short":"G. Dubach, F. Mühlböck, ArXiv (n.d.).","mla":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” ArXiv, 2103.11389, doi:10.48550/arXiv.2103.11389.","chicago":"Dubach, Guillaume, and Fabian Mühlböck. “Formal Verification of Zagier’s One-Sentence Proof.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2103.11389."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/2103.11389"}],"publication":"arXiv","project":[{"_id":"260C2330-B435-11E9-9278-68D0E5697425","grant_number":"754411","name":"ISTplus - Postdoctoral Fellowships","call_identifier":"H2020"}],"doi":"10.48550/arXiv.2103.11389","date_published":"2021-03-21T00:00:00Z","language":[{"iso":"eng"}],"article_processing_charge":"No","month":"03","day":"21"},{"article_number":"2112.13558","type":"preprint","abstract":[{"lang":"eng","text":"We consider a totally asymmetric simple exclusion process (TASEP) consisting of particles on a lattice that require binding by a \"token\" to move. Using a combination of theory and simulations, we address the following questions: (i) How token binding kinetics affects the current-density relation; (ii) How the current-density relation depends on the scarcity of tokens; (iii) How tokens propagate the effects of the locally-imposed disorder (such a slow site) over the entire lattice; (iv) How a shared pool of tokens couples concurrent TASEPs running on multiple lattices; (v) How our results translate to TASEPs with open boundaries that exchange particles with the reservoir. Since real particle motion (including in systems that inspired the standard TASEP model, e.g., protein synthesis or movement of molecular motors) is often catalyzed, regulated, actuated, or otherwise mediated, the token-driven TASEP dynamics analyzed in this paper should allow for a better understanding of real systems and enable a closer match between TASEP theory and experimental observations."}],"publication_status":"submitted","status":"public","ddc":["530"],"title":"Token-driven totally asymmetric simple exclusion process","department":[{"_id":"GaTk"}],"acknowledgement":"B.K. thanks Stefano Elefante, Simon Rella, and Michal Hledík for their help with the usage of the cluster. B.K. additionally thanks Călin Guet and his group for help and advice. We thank M. Hennessey-Wesen for constructive comments on the manuscript. We thank Ankita Gupta (Indian Institute of Technology) for spotting a typographical error in Eq. (49) in the preprint version of this paper.","_id":"10579","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2021","date_created":"2021-12-28T06:52:09Z","date_updated":"2023-05-03T10:54:05Z","oa_version":"Preprint","author":[{"full_name":"Kavcic, Bor","first_name":"Bor","last_name":"Kavcic","id":"350F91D2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6041-254X"},{"full_name":"Tkačik, Gašper","orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkačik","first_name":"Gašper"}],"month":"12","day":"27","has_accepted_license":"1","article_processing_charge":"No","publication":"arXiv","tmp":{"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","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"external_id":{"arxiv":["2112.13558"]},"oa":1,"citation":{"chicago":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” ArXiv, n.d. https://doi.org/10.48550/arXiv.2112.13558.","short":"B. Kavcic, G. Tkačik, ArXiv (n.d.).","mla":"Kavcic, Bor, and Gašper Tkačik. “Token-Driven Totally Asymmetric Simple Exclusion Process.” ArXiv, 2112.13558, doi:10.48550/arXiv.2112.13558.","ieee":"B. Kavcic and G. Tkačik, “Token-driven totally asymmetric simple exclusion process,” arXiv. .","apa":"Kavcic, B., & Tkačik, G. (n.d.). Token-driven totally asymmetric simple exclusion process. arXiv. https://doi.org/10.48550/arXiv.2112.13558","ista":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. arXiv, 2112.13558.","ama":"Kavcic B, Tkačik G. Token-driven totally asymmetric simple exclusion process. arXiv. doi:10.48550/arXiv.2112.13558"},"main_file_link":[{"url":"https://arxiv.org/abs/2112.13558","open_access":"1"}],"language":[{"iso":"eng"}],"date_published":"2021-12-27T00:00:00Z","doi":"10.48550/arXiv.2112.13558"},{"day":"22","has_accepted_license":"1","article_processing_charge":"Yes (via OA deal)","keyword":["general medicine"],"date_published":"2021-11-22T00:00:00Z","article_type":"original","page":"1898-1903","publication":"JACS Au","citation":{"ama":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, et al. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 2021;1(11):1898-1903. doi:10.1021/jacsau.1c00349","apa":"Calcabrini, M., Van den Eynden, D., Sanchez Ribot, S., Pokratath, R., Llorca, J., De Roo, J., & Ibáñez, M. (2021). Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. American Chemical Society. https://doi.org/10.1021/jacsau.1c00349","ieee":"M. Calcabrini et al., “Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate,” JACS Au, vol. 1, no. 11. American Chemical Society, pp. 1898–1903, 2021.","ista":"Calcabrini M, Van den Eynden D, Sanchez Ribot S, Pokratath R, Llorca J, De Roo J, Ibáñez M. 2021. Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate. JACS Au. 1(11), 1898–1903.","short":"M. Calcabrini, D. Van den Eynden, S. Sanchez Ribot, R. Pokratath, J. Llorca, J. De Roo, M. Ibáñez, JACS Au 1 (2021) 1898–1903.","mla":"Calcabrini, Mariano, et al. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” JACS Au, vol. 1, no. 11, American Chemical Society, 2021, pp. 1898–903, doi:10.1021/jacsau.1c00349.","chicago":"Calcabrini, Mariano, Dietger Van den Eynden, Sergi Sanchez Ribot, Rohan Pokratath, Jordi Llorca, Jonathan De Roo, and Maria Ibáñez. “Ligand Conversion in Nanocrystal Synthesis: The Oxidation of Alkylamines to Fatty Acids by Nitrate.” JACS Au. American Chemical Society, 2021. https://doi.org/10.1021/jacsau.1c00349."},"abstract":[{"text":"Ligands are a fundamental part of nanocrystals. They control and direct nanocrystal syntheses and provide colloidal stability. Bound ligands also affect the nanocrystals’ chemical reactivity and electronic structure. Surface chemistry is thus crucial to understand nanocrystal properties and functionality. Here, we investigate the synthesis of metal oxide nanocrystals (CeO2-x, ZnO, and NiO) from metal nitrate precursors, in the presence of oleylamine ligands. Surprisingly, the nanocrystals are capped exclusively with a fatty acid instead of oleylamine. Analysis of the reaction mixtures with nuclear magnetic resonance spectroscopy revealed several reaction byproducts and intermediates that are common to the decomposition of Ce, Zn, Ni, and Zr nitrate precursors. Our evidence supports the oxidation of alkylamine and formation of a carboxylic acid, thus unraveling this counterintuitive surface chemistry.","lang":"eng"}],"issue":"11","type":"journal_article","file":[{"success":1,"checksum":"1c66a35369e911312a359111420318a9","date_updated":"2022-03-02T15:33:18Z","date_created":"2022-03-02T15:33:18Z","file_id":"10807","relation":"main_file","creator":"cchlebak","content_type":"application/pdf","file_size":1257973,"access_level":"open_access","file_name":"2021_JACSAu_Calcabrini.pdf"}],"oa_version":"Published Version","title":"Ligand conversion in nanocrystal synthesis: The oxidation of alkylamines to fatty acids by nitrate","status":"public","ddc":["540"],"intvolume":" 1","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","_id":"10806","month":"11","publication_identifier":{"eissn":["2691-3704"],"issn":["2691-3704"]},"language":[{"iso":"eng"}],"doi":"10.1021/jacsau.1c00349","quality_controlled":"1","project":[{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","name":"International IST Doctoral Program","call_identifier":"H2020"},{"_id":"9B8F7476-BA93-11EA-9121-9846C619BF3A","name":"HighTE: The Werner Siemens Laboratory for the High Throughput Discovery of Semiconductors for Waste Heat Recovery"},{"_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854","name":"IST Austria Open Access Fund"}],"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"file_date_updated":"2022-03-02T15:33:18Z","ec_funded":1,"date_created":"2022-03-02T15:24:16Z","date_updated":"2023-05-05T08:45:36Z","volume":1,"author":[{"full_name":"Calcabrini, Mariano","id":"45D7531A-F248-11E8-B48F-1D18A9856A87","first_name":"Mariano","last_name":"Calcabrini"},{"first_name":"Dietger","last_name":"Van den Eynden","full_name":"Van den Eynden, Dietger"},{"full_name":"Sanchez Ribot, Sergi","first_name":"Sergi","last_name":"Sanchez Ribot","id":"ddae5a59-f6e0-11ea-865d-d9dc61e77a2a"},{"first_name":"Rohan","last_name":"Pokratath","full_name":"Pokratath, Rohan"},{"last_name":"Llorca","first_name":"Jordi","full_name":"Llorca, Jordi"},{"first_name":"Jonathan","last_name":"De Roo","full_name":"De Roo, Jonathan"},{"full_name":"Ibáñez, Maria","orcid":"0000-0001-5013-2843","id":"43C61214-F248-11E8-B48F-1D18A9856A87","last_name":"Ibáñez","first_name":"Maria"}],"related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.26434/chemrxiv-2021-cn2fr"}],"record":[{"status":"public","relation":"dissertation_contains","id":"12885"}]},"publication_status":"published","publisher":"American Chemical Society","department":[{"_id":"MaIb"}],"year":"2021","acknowledgement":"This work was financially supported by IST Austria and the Werner Siemens Foundation. M.C. has received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385. The work was also financially supported by University of Basel, SNSF NCCR Molecular Systems Engineering (project number: 182895) and SNSF R’equip (project number: 189622). J.L. is a Serra Húnter Fellow and is grateful to ICREA Academia program and MICINN/FEDER RTI2018-093996-B-C31 and GC 2017 SGR 128 projects."},{"article_processing_charge":"No","day":"02","keyword":["Multidisciplinary"],"scopus_import":"1","date_published":"2021-07-02T00:00:00Z","article_type":"original","citation":{"chicago":"Long, Jincheng, James Walker, Wenjing She, Billy Aldridge, Hongbo Gao, Samuel Deans, Martin Vickers, and Xiaoqi Feng. “Nurse Cell--Derived Small RNAs Define Paternal Epigenetic Inheritance in Arabidopsis.” Science. American Association for the Advancement of Science (AAAS), 2021. https://doi.org/10.1126/science.abh0556.","short":"J. Long, J. Walker, W. She, B. Aldridge, H. Gao, S. Deans, M. Vickers, X. Feng, Science 373 (2021).","mla":"Long, Jincheng, et al. “Nurse Cell--Derived Small RNAs Define Paternal Epigenetic Inheritance in Arabidopsis.” Science, vol. 373, no. 6550, American Association for the Advancement of Science (AAAS), 2021, doi:10.1126/science.abh0556.","ieee":"J. Long et al., “Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis,” Science, vol. 373, no. 6550. American Association for the Advancement of Science (AAAS), 2021.","apa":"Long, J., Walker, J., She, W., Aldridge, B., Gao, H., Deans, S., … Feng, X. (2021). Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis. Science. American Association for the Advancement of Science (AAAS). https://doi.org/10.1126/science.abh0556","ista":"Long J, Walker J, She W, Aldridge B, Gao H, Deans S, Vickers M, Feng X. 2021. Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis. Science. 373(6550).","ama":"Long J, Walker J, She W, et al. Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis. Science. 2021;373(6550). doi:10.1126/science.abh0556"},"publication":"Science","issue":"6550","abstract":[{"text":"Genomes of germ cells present an existential vulnerability to organisms because germ cell mutations will propagate to future generations. Transposable elements are one source of such mutations. In the small flowering plant Arabidopsis, Long et al. found that genome methylation in the male germline is directed by small interfering RNAs (siRNAs) imperfectly transcribed from transposons (see the Perspective by Mosher). These germline siRNAs silence germline transposons and establish inherited methylation patterns in sperm, thus maintaining the integrity of the plant genome across generations.","lang":"eng"}],"type":"journal_article","oa_version":"None","intvolume":" 373","title":"Nurse cell--derived small RNAs define paternal epigenetic inheritance in Arabidopsis","status":"public","_id":"12187","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_identifier":{"issn":["0036-8075","1095-9203"]},"month":"07","language":[{"iso":"eng"}],"doi":"10.1126/science.abh0556","quality_controlled":"1","external_id":{"pmid":["34210850"]},"extern":"1","volume":373,"date_updated":"2023-05-08T10:56:39Z","date_created":"2023-01-16T09:15:14Z","author":[{"last_name":"Long","first_name":"Jincheng","full_name":"Long, Jincheng"},{"full_name":"Walker, James","last_name":"Walker","first_name":"James"},{"first_name":"Wenjing","last_name":"She","full_name":"She, Wenjing"},{"first_name":"Billy","last_name":"Aldridge","full_name":"Aldridge, Billy"},{"last_name":"Gao","first_name":"Hongbo","full_name":"Gao, Hongbo"},{"full_name":"Deans, Samuel","first_name":"Samuel","last_name":"Deans"},{"first_name":"Martin","last_name":"Vickers","full_name":"Vickers, Martin"},{"orcid":"0000-0002-4008-1234","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","last_name":"Feng","first_name":"Xiaoqi","full_name":"Feng, Xiaoqi"}],"department":[{"_id":"XiFe"}],"publisher":"American Association for the Advancement of Science (AAAS)","publication_status":"published","pmid":1,"acknowledgement":"We thank the John Innes Centre Bioimaging Facility (S. Lopez, E. Wegel, and K. Findlay) for their assistance with microscopy and the Norwich BioScience Institute Partnership Computing Infrastructure for Science Group for high-performance computing resources. Funding: This work was funded by a European Research Council Starting Grant (“SexMeth” 804981; J.L., J.W., and X.F.), a Sainsbury Charitable Foundation studentship (J.W.), two Biotechnology and Biological Sciences Research Council (BBSRC) grants (BBS0096201 and BBP0135111; W.S., M.V., and X.F.), two John Innes Foundation studentships (B.A. and S.D.), and a BBSRC David Phillips Fellowship (BBL0250431; H.G. and X.F.). Author contributions: J.L., J.W., and X.F. designed the study and wrote the manuscript; J.L., W.S., B.A., H.G., and S.D. performed the experiments; and J.L., J.W., B.A., H.G., S.D., M.V., and X.F. analyzed the data. Competing interests: The authors declare no competing interests. Data and material availability: All sequencing data have been deposited in the Gene Expression Omnibus (GEO) under accession no. GSE161625. Accession nos. of published datasets used in this study are listed in table S6. Published software used in this study include Bowtie v1.2.2 (https://doi.org/10.1002/0471250953.bi1107s32), Bismark v0.22.2 (https://doi.org/10.1093/bioinformatics/btr167), Kallisto v0.43.0 (https://doi.org/10.1038/nbt0816-888d), Shortstack v3.8.5 (https://doi.org/10.1534/g3.116.030452), and Cutadapt v1.15 (https://doi.org/10.1089/cmb.2017.0096). TrimGalore v0.4.1 and MarkDuplicates v1.141 are available from https://github.com/FelixKrueger/TrimGalore and https://github.com/broadinstitute/picard, respectively. All remaining data are in the main paper or the supplementary materials.","year":"2021"},{"acknowledgement":"We thank the Gatsby Foundation (UK) for funding to the JDGJ laboratory. PD acknowledges support from the European Union’s Horizon 2020 Research and Innovation Program under Marie Skłodowska Curie Actions (grant agreement: 656243) and a Future Leader Fellowship from the Biotechnology and Biological Sciences Research Council (BBSRC) (grant agreement: BB/R012172/1). TS, RKS, DM, and JDGJ were supported by the Gatsby Foundation funding to the\r\nSainsbury Laboratory. NMP and KV were supported by a BOF grant from Ghent University (grant agreement: BOF24Y2019001901). WG and RZ were supported by the Scottish Government Rural and Environment Science and Analytical Services division (RESAS), and RZ also acknowledges the support from a BBSRC Bioinformatics and Biological Resources Fund (grant agreement: BB/S020160/1).BPMN was supported by the Norwich Research Park (NRP) Biosciences Doctoral Training Partnership (DTP) funded by the BBSRC (grant agreement: BB/M011216/1). SH and XF were supported by a BBSRC Responsive Mode grant (grant agreement: BB/S009620/1) and a European Research Council Starting grant ‘SexMeth’ (grant agreement: 804981). CL was supported by Deutsche Forschungsgemeinschaft (grant agreement: LI 2862/4). ","year":"2021","pmid":1,"publication_status":"published","department":[{"_id":"XiFe"}],"publisher":"Oxford University Press","author":[{"last_name":"Ding","first_name":"Pingtao","full_name":"Ding, Pingtao"},{"last_name":"Sakai","first_name":"Toshiyuki","full_name":"Sakai, Toshiyuki"},{"last_name":"Krishna Shrestha","first_name":"Ram","full_name":"Krishna Shrestha, Ram"},{"first_name":"Nicolas","last_name":"Manosalva Perez","full_name":"Manosalva Perez, Nicolas"},{"full_name":"Guo, Wenbin","last_name":"Guo","first_name":"Wenbin"},{"first_name":"Bruno Pok Man","last_name":"Ngou","full_name":"Ngou, Bruno Pok Man"},{"first_name":"Shengbo","last_name":"He","full_name":"He, Shengbo"},{"full_name":"Liu, Chang","first_name":"Chang","last_name":"Liu"},{"full_name":"Feng, Xiaoqi","id":"e0164712-22ee-11ed-b12a-d80fcdf35958","orcid":"0000-0002-4008-1234","first_name":"Xiaoqi","last_name":"Feng"},{"full_name":"Zhang, Runxuan","last_name":"Zhang","first_name":"Runxuan"},{"full_name":"Vandepoele, Klaas","last_name":"Vandepoele","first_name":"Klaas"},{"first_name":"Dan","last_name":"MacLean","full_name":"MacLean, Dan"},{"first_name":"Jonathan D G","last_name":"Jones","full_name":"Jones, Jonathan D G"}],"date_created":"2023-01-16T09:14:35Z","date_updated":"2023-05-08T11:01:18Z","volume":72,"extern":"1","external_id":{"pmid":["34387350"]},"quality_controlled":"1","doi":"10.1093/jxb/erab373","language":[{"iso":"eng"}],"month":"08","publication_identifier":{"issn":["0022-0957","1460-2431"]},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12186","title":"Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors","status":"public","intvolume":" 72","oa_version":"None","type":"journal_article","abstract":[{"lang":"eng","text":"Activation of cell-surface and intracellular receptor-mediated immunity results in rapid transcriptional reprogramming that underpins disease resistance. However, the mechanisms by which co-activation of both immune systems lead to transcriptional changes are not clear. Here, we combine RNA-seq and ATAC-seq to define changes in gene expression and chromatin accessibility. Activation of cell-surface or intracellular receptor-mediated immunity, or both, increases chromatin accessibility at induced defence genes. Analysis of ATAC-seq and RNA-seq data combined with publicly available information on transcription factor DNA-binding motifs enabled comparison of individual gene regulatory networks activated by cell-surface or intracellular receptor-mediated immunity, or by both. These results and analyses reveal overlapping and conserved transcriptional regulatory mechanisms between the two immune systems."}],"issue":"22","publication":"Journal of Experimental Botany","citation":{"apa":"Ding, P., Sakai, T., Krishna Shrestha, R., Manosalva Perez, N., Guo, W., Ngou, B. P. M., … Jones, J. D. G. (2021). Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors. Journal of Experimental Botany. Oxford University Press. https://doi.org/10.1093/jxb/erab373","ieee":"P. Ding et al., “Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors,” Journal of Experimental Botany, vol. 72, no. 22. Oxford University Press, pp. 7927–7941, 2021.","ista":"Ding P, Sakai T, Krishna Shrestha R, Manosalva Perez N, Guo W, Ngou BPM, He S, Liu C, Feng X, Zhang R, Vandepoele K, MacLean D, Jones JDG. 2021. Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors. Journal of Experimental Botany. 72(22), 7927–7941.","ama":"Ding P, Sakai T, Krishna Shrestha R, et al. Chromatin accessibility landscapes activated by cell-surface and intracellular immune receptors. Journal of Experimental Botany. 2021;72(22):7927-7941. doi:10.1093/jxb/erab373","chicago":"Ding, Pingtao, Toshiyuki Sakai, Ram Krishna Shrestha, Nicolas Manosalva Perez, Wenbin Guo, Bruno Pok Man Ngou, Shengbo He, et al. “Chromatin Accessibility Landscapes Activated by Cell-Surface and Intracellular Immune Receptors.” Journal of Experimental Botany. Oxford University Press, 2021. https://doi.org/10.1093/jxb/erab373.","short":"P. Ding, T. Sakai, R. Krishna Shrestha, N. Manosalva Perez, W. Guo, B.P.M. Ngou, S. He, C. Liu, X. Feng, R. Zhang, K. Vandepoele, D. MacLean, J.D.G. Jones, Journal of Experimental Botany 72 (2021) 7927–7941.","mla":"Ding, Pingtao, et al. “Chromatin Accessibility Landscapes Activated by Cell-Surface and Intracellular Immune Receptors.” Journal of Experimental Botany, vol. 72, no. 22, Oxford University Press, 2021, pp. 7927–41, doi:10.1093/jxb/erab373."},"article_type":"original","page":"7927-7941","date_published":"2021-08-13T00:00:00Z","scopus_import":"1","keyword":["Plant Science","Physiology"],"day":"13","article_processing_charge":"No"},{"publication_status":"published","publisher":"American Chemical Society","year":"2021","date_updated":"2023-05-08T11:31:03Z","date_created":"2021-07-20T11:18:37Z","volume":121,"author":[{"first_name":"John A.","last_name":"Keith","full_name":"Keith, John A."},{"first_name":"Valentin","last_name":"Valentin Vassilev-Galindo","full_name":"Valentin Vassilev-Galindo, Valentin"},{"full_name":"Cheng, Bingqing","orcid":"0000-0002-3584-9632","id":"cbe3cda4-d82c-11eb-8dc7-8ff94289fcc9","last_name":"Cheng","first_name":"Bingqing"},{"full_name":"Chmiela, Stefan","first_name":"Stefan","last_name":"Chmiela"},{"last_name":"Gastegger","first_name":"Michael","full_name":"Gastegger, Michael"},{"last_name":"Müller","first_name":"Klaus-Robert","full_name":"Müller, Klaus-Robert"},{"full_name":"Tkatchenko, Alexandre","first_name":"Alexandre","last_name":"Tkatchenko"}],"extern":"1","quality_controlled":"1","external_id":{"arxiv":["2102.06321"]},"oa":1,"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1021/acs.chemrev.1c00107"}],"language":[{"iso":"eng"}],"doi":"10.1021/acs.chemrev.1c00107","month":"07","publication_identifier":{"issn":["0009-2665"],"eissn":["1520-6890"]},"title":"Combining machine learning and computational chemistry for predictive insights into chemical systems","status":"public","intvolume":" 121","_id":"9698","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Machine learning models are poised to make a transformative impact on chemical sciences by dramatically accelerating computational algorithms and amplifying insights available from computational chemistry methods. However, achieving this requires a confluence and coaction of expertise in computer science and physical sciences. This review is written for new and experienced researchers working at the intersection of both fields. We first provide concise tutorials of computational chemistry and machine learning methods, showing how insights involving both can be achieved. We then follow with a critical review of noteworthy applications that demonstrate how computational chemistry and machine learning can be used together to provide insightful (and useful) predictions in molecular and materials modeling, retrosyntheses, catalysis, and drug design.","lang":"eng"}],"issue":"16","article_type":"review","page":"9816-9872","publication":"Chemical Reviews","citation":{"short":"J.A. Keith, V. Valentin Vassilev-Galindo, B. Cheng, S. Chmiela, M. Gastegger, K.-R. Müller, A. Tkatchenko, Chemical Reviews 121 (2021) 9816–9872.","mla":"Keith, John A., et al. “Combining Machine Learning and Computational Chemistry for Predictive Insights into Chemical Systems.” Chemical Reviews, vol. 121, no. 16, American Chemical Society, 2021, pp. 9816–72, doi:10.1021/acs.chemrev.1c00107.","chicago":"Keith, John A., Valentin Valentin Vassilev-Galindo, Bingqing Cheng, Stefan Chmiela, Michael Gastegger, Klaus-Robert Müller, and Alexandre Tkatchenko. “Combining Machine Learning and Computational Chemistry for Predictive Insights into Chemical Systems.” Chemical Reviews. American Chemical Society, 2021. https://doi.org/10.1021/acs.chemrev.1c00107.","ama":"Keith JA, Valentin Vassilev-Galindo V, Cheng B, et al. Combining machine learning and computational chemistry for predictive insights into chemical systems. Chemical Reviews. 2021;121(16):9816-9872. doi:10.1021/acs.chemrev.1c00107","ieee":"J. A. Keith et al., “Combining machine learning and computational chemistry for predictive insights into chemical systems,” Chemical Reviews, vol. 121, no. 16. American Chemical Society, pp. 9816–9872, 2021.","apa":"Keith, J. A., Valentin Vassilev-Galindo, V., Cheng, B., Chmiela, S., Gastegger, M., Müller, K.-R., & Tkatchenko, A. (2021). Combining machine learning and computational chemistry for predictive insights into chemical systems. Chemical Reviews. American Chemical Society. https://doi.org/10.1021/acs.chemrev.1c00107","ista":"Keith JA, Valentin Vassilev-Galindo V, Cheng B, Chmiela S, Gastegger M, Müller K-R, Tkatchenko A. 2021. Combining machine learning and computational chemistry for predictive insights into chemical systems. Chemical Reviews. 121(16), 9816–9872."},"date_published":"2021-07-07T00:00:00Z","scopus_import":"1","day":"07","article_processing_charge":"No"},{"volume":198,"date_created":"2023-01-16T11:44:54Z","date_updated":"2023-05-08T11:58:14Z","author":[{"full_name":"Verzobio, Matteo","first_name":"Matteo","last_name":"Verzobio","id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306"}],"publisher":"Institute of Mathematics, Polish Academy of Sciences","publication_status":"published","year":"2021","extern":"1","language":[{"iso":"eng"}],"doi":"10.4064/aa191016-30-7","quality_controlled":"1","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.2001.09634","open_access":"1"}],"oa":1,"external_id":{"arxiv":["2001.09634"]},"publication_identifier":{"issn":["0065-1036","1730-6264"]},"month":"01","oa_version":"Preprint","intvolume":" 198","title":"Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12309","issue":"2","abstract":[{"text":"Take a rational elliptic curve defined by the equation y2=x3+ax in minimal form and consider the sequence Bn of the denominators of the abscissas of the iterate of a non-torsion point. We show that B5m has a primitive divisor for every m. Then, we show how to generalize this method to the terms of the form Bmp with p a prime congruent to 1 modulo 4.","lang":"eng"}],"type":"journal_article","date_published":"2021-01-04T00:00:00Z","page":"129-168","article_type":"original","citation":{"short":"M. Verzobio, Acta Arithmetica 198 (2021) 129–168.","mla":"Verzobio, Matteo. “Primitive Divisors of Elliptic Divisibility Sequences for Elliptic Curves with J=1728.” Acta Arithmetica, vol. 198, no. 2, Institute of Mathematics, Polish Academy of Sciences, 2021, pp. 129–68, doi:10.4064/aa191016-30-7.","chicago":"Verzobio, Matteo. “Primitive Divisors of Elliptic Divisibility Sequences for Elliptic Curves with J=1728.” Acta Arithmetica. Institute of Mathematics, Polish Academy of Sciences, 2021. https://doi.org/10.4064/aa191016-30-7.","ama":"Verzobio M. Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728. Acta Arithmetica. 2021;198(2):129-168. doi:10.4064/aa191016-30-7","ieee":"M. Verzobio, “Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728,” Acta Arithmetica, vol. 198, no. 2. Institute of Mathematics, Polish Academy of Sciences, pp. 129–168, 2021.","apa":"Verzobio, M. (2021). Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728. Acta Arithmetica. Institute of Mathematics, Polish Academy of Sciences. https://doi.org/10.4064/aa191016-30-7","ista":"Verzobio M. 2021. Primitive divisors of elliptic divisibility sequences for elliptic curves with j=1728. Acta Arithmetica. 198(2), 129–168."},"publication":"Acta Arithmetica","article_processing_charge":"No","day":"04","keyword":["Algebra and Number Theory"],"scopus_import":"1"},{"publication_status":"published","publisher":"Springer Nature","year":"2021","date_updated":"2023-05-08T12:00:17Z","date_created":"2023-01-16T11:44:39Z","volume":7,"author":[{"id":"7aa8f170-131e-11ed-88e1-a9efd01027cb","orcid":"0000-0002-0854-0306","first_name":"Matteo","last_name":"Verzobio","full_name":"Verzobio, Matteo"}],"article_number":"37","extern":"1","quality_controlled":"1","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1007/s40993-021-00267-9"}],"oa":1,"language":[{"iso":"eng"}],"doi":"10.1007/s40993-021-00267-9","month":"05","publication_identifier":{"issn":["2522-0160","2363-9555"]},"status":"public","title":"Primitive divisors of sequences associated to elliptic curves with complex multiplication","intvolume":" 7","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12308","oa_version":"Published Version","type":"journal_article","abstract":[{"text":"Let P and Q be two points on an elliptic curve defined over a number field K. For α∈End(E), define Bα to be the OK-integral ideal generated by the denominator of x(α(P)+Q). Let O be a subring of End(E), that is a Dedekind domain. We will study the sequence {Bα}α∈O. We will show that, for all but finitely many α∈O, the ideal Bα has a primitive divisor when P is a non-torsion point and there exist two endomorphisms g≠0 and f so that f(P)=g(Q). This is a generalization of previous results on elliptic divisibility sequences.","lang":"eng"}],"issue":"2","article_type":"original","publication":"Research in Number Theory","citation":{"short":"M. Verzobio, Research in Number Theory 7 (2021).","mla":"Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic Curves with Complex Multiplication.” Research in Number Theory, vol. 7, no. 2, 37, Springer Nature, 2021, doi:10.1007/s40993-021-00267-9.","chicago":"Verzobio, Matteo. “Primitive Divisors of Sequences Associated to Elliptic Curves with Complex Multiplication.” Research in Number Theory. Springer Nature, 2021. https://doi.org/10.1007/s40993-021-00267-9.","ama":"Verzobio M. Primitive divisors of sequences associated to elliptic curves with complex multiplication. Research in Number Theory. 2021;7(2). doi:10.1007/s40993-021-00267-9","ieee":"M. Verzobio, “Primitive divisors of sequences associated to elliptic curves with complex multiplication,” Research in Number Theory, vol. 7, no. 2. Springer Nature, 2021.","apa":"Verzobio, M. (2021). Primitive divisors of sequences associated to elliptic curves with complex multiplication. Research in Number Theory. Springer Nature. https://doi.org/10.1007/s40993-021-00267-9","ista":"Verzobio M. 2021. Primitive divisors of sequences associated to elliptic curves with complex multiplication. Research in Number Theory. 7(2), 37."},"date_published":"2021-05-20T00:00:00Z","keyword":["Algebra and Number Theory"],"scopus_import":"1","day":"20","article_processing_charge":"No"},{"language":[{"iso":"eng"}],"doi":"10.3359/2021hpc","date_published":"2021-06-02T00:00:00Z","conference":{"name":"ASHPC - Austrian-Slovenian HPC Meeting","end_date":"2021-06-02","start_date":"2021-05-31","location":"Virtual"},"page":"5","citation":{"mla":"Schlögl, Alois, et al. “Managing Software on a Heterogenous HPC Cluster.” ASHPC21 – Austrian-Slovenian HPC Meeting 2021, University of Ljubljana, 2021, p. 5, doi:10.3359/2021hpc.","short":"A. Schlögl, S. Elefante, A. Hornoiu, S. Stadlbauer, in:, ASHPC21 – Austrian-Slovenian HPC Meeting 2021, University of Ljubljana, 2021, p. 5.","chicago":"Schlögl, Alois, Stefano Elefante, Andrei Hornoiu, and Stephan Stadlbauer. “Managing Software on a Heterogenous HPC Cluster.” In ASHPC21 – Austrian-Slovenian HPC Meeting 2021, 5. University of Ljubljana, 2021. https://doi.org/10.3359/2021hpc.","ama":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. Managing software on a heterogenous HPC cluster. In: ASHPC21 – Austrian-Slovenian HPC Meeting 2021. University of Ljubljana; 2021:5. doi:10.3359/2021hpc","ista":"Schlögl A, Elefante S, Hornoiu A, Stadlbauer S. 2021. Managing software on a heterogenous HPC cluster. ASHPC21 – Austrian-Slovenian HPC Meeting 2021. ASHPC - Austrian-Slovenian HPC Meeting, 5.","apa":"Schlögl, A., Elefante, S., Hornoiu, A., & Stadlbauer, S. (2021). Managing software on a heterogenous HPC cluster. In ASHPC21 – Austrian-Slovenian HPC Meeting 2021 (p. 5). Virtual: University of Ljubljana. https://doi.org/10.3359/2021hpc","ieee":"A. Schlögl, S. Elefante, A. Hornoiu, and S. Stadlbauer, “Managing software on a heterogenous HPC cluster,” in ASHPC21 – Austrian-Slovenian HPC Meeting 2021, Virtual, 2021, p. 5."},"main_file_link":[{"url":"https://vsc.ac.at/fileadmin/user_upload/vsc/conferences/ashpc21/BOOKLET_ASHPC21.pdf","open_access":"1"}],"oa":1,"publication":"ASHPC21 – Austrian-Slovenian HPC Meeting 2021","has_accepted_license":"1","article_processing_charge":"No","publication_identifier":{"isbn":["978-961-6980-77-7","978-961-6133-48-7"]},"day":"02","month":"06","file":[{"file_id":"12971","relation":"main_file","success":1,"checksum":"ba73f85858fb9d5737ebc7724646dd45","date_created":"2023-05-16T07:36:34Z","date_updated":"2023-05-16T07:36:34Z","access_level":"open_access","file_name":"2021_ASHPC_Schloegl.pdf","creator":"dernst","content_type":"application/pdf","file_size":422761}],"oa_version":"Published Version","date_updated":"2023-05-16T07:43:54Z","date_created":"2023-05-05T13:17:36Z","author":[{"full_name":"Schlögl, Alois","orcid":"0000-0002-5621-8100","id":"45BF87EE-F248-11E8-B48F-1D18A9856A87","last_name":"Schlögl","first_name":"Alois"},{"full_name":"Elefante, Stefano","id":"490F40CE-F248-11E8-B48F-1D18A9856A87","first_name":"Stefano","last_name":"Elefante"},{"full_name":"Hornoiu, Andrei","last_name":"Hornoiu","first_name":"Andrei","id":"77129392-B450-11EA-8745-D4653DDC885E"},{"full_name":"Stadlbauer, Stephan","first_name":"Stephan","last_name":"Stadlbauer","id":"4D0BC184-F248-11E8-B48F-1D18A9856A87"}],"publisher":"University of Ljubljana","department":[{"_id":"ScienComp"}],"status":"public","publication_status":"published","ddc":["000"],"title":"Managing software on a heterogenous HPC cluster","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"12909","year":"2021","file_date_updated":"2023-05-16T07:36:34Z","type":"conference_abstract"},{"abstract":[{"text":"The increasing computational requirements of deep neural networks (DNNs) have led to significant interest in obtaining DNN models that are sparse, yet accurate. Recent work has investigated the even harder case of sparse training, where the DNN weights are, for as much as possible, already sparse to reduce computational costs during training. Existing sparse training methods are often empirical and can have lower accuracy relative to the dense baseline. In this paper, we present a general approach called Alternating Compressed/DeCompressed (AC/DC) training of DNNs, demonstrate convergence for a variant of the algorithm, and show that AC/DC outperforms existing sparse training methods in accuracy at similar computational budgets; at high sparsity levels, AC/DC even outperforms existing methods that rely on accurate pre-trained dense models. An important property of AC/DC is that it allows co-training of dense and sparse models, yielding accurate sparse–dense model pairs at the end of the training process. This is useful in practice, where compressed variants may be desirable for deployment in resource-constrained settings without re-doing the entire training flow, and also provides us with insights into the accuracy gap between dense and compressed models. The code is available at: https://github.com/IST-DASLab/ACDC.","lang":"eng"}],"type":"conference","oa_version":"Published Version","intvolume":" 34","title":"AC/DC: Alternating Compressed/DeCompressed training of deep neural networks","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"11458","article_processing_charge":"No","day":"6","scopus_import":"1","date_published":"2021-12-06T00:00:00Z","page":"8557-8570","citation":{"ista":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. 2021. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. 35th Conference on Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 34, 8557–8570.","ieee":"E.-A. Peste, E. B. Iofinova, A. Vladu, and D.-A. Alistarh, “AC/DC: Alternating Compressed/DeCompressed training of deep neural networks,” in 35th Conference on Neural Information Processing Systems, Virtual, Online, 2021, vol. 34, pp. 8557–8570.","apa":"Peste, E.-A., Iofinova, E. B., Vladu, A., & Alistarh, D.-A. (2021). AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In 35th Conference on Neural Information Processing Systems (Vol. 34, pp. 8557–8570). Virtual, Online: Curran Associates.","ama":"Peste E-A, Iofinova EB, Vladu A, Alistarh D-A. AC/DC: Alternating Compressed/DeCompressed training of deep neural networks. In: 35th Conference on Neural Information Processing Systems. Vol 34. Curran Associates; 2021:8557-8570.","chicago":"Peste, Elena-Alexandra, Eugenia B Iofinova, Adrian Vladu, and Dan-Adrian Alistarh. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” In 35th Conference on Neural Information Processing Systems, 34:8557–70. Curran Associates, 2021.","mla":"Peste, Elena-Alexandra, et al. “AC/DC: Alternating Compressed/DeCompressed Training of Deep Neural Networks.” 35th Conference on Neural Information Processing Systems, vol. 34, Curran Associates, 2021, pp. 8557–70.","short":"E.-A. Peste, E.B. Iofinova, A. Vladu, D.-A. Alistarh, in:, 35th Conference on Neural Information Processing Systems, Curran Associates, 2021, pp. 8557–8570."},"publication":"35th Conference on Neural Information Processing Systems","ec_funded":1,"volume":34,"date_updated":"2023-06-01T12:54:45Z","date_created":"2022-06-20T12:11:53Z","related_material":{"record":[{"id":"13074","status":"public","relation":"dissertation_contains"}]},"author":[{"full_name":"Peste, Elena-Alexandra","last_name":"Peste","first_name":"Elena-Alexandra","id":"32D78294-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Iofinova","first_name":"Eugenia B","orcid":"0000-0002-7778-3221","id":"f9a17499-f6e0-11ea-865d-fdf9a3f77117","full_name":"Iofinova, Eugenia B"},{"full_name":"Vladu, Adrian","last_name":"Vladu","first_name":"Adrian"},{"id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh","full_name":"Alistarh, Dan-Adrian"}],"publisher":"Curran Associates","department":[{"_id":"GradSch"},{"_id":"DaAl"}],"publication_status":"published","acknowledgement":"This project has received funding from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML), and a CNRS PEPS grant. This research was supported by the Scientific Service Units (SSU) of IST Austria through resources provided by Scientific Computing (SciComp). We would also like to thank Christoph Lampert for his feedback on an earlier version of this work, as well as for providing hardware for the Transformer-XL experiments.","year":"2021","publication_identifier":{"isbn":["9781713845393"],"issn":["1049-5258"]},"month":"12","language":[{"iso":"eng"}],"acknowledged_ssus":[{"_id":"ScienComp"}],"conference":{"end_date":"2021-12-14","start_date":"2021-12-06","location":"Virtual, Online","name":"NeurIPS: Neural Information Processing Systems"},"project":[{"call_identifier":"H2020","name":"Elastic Coordination for Scalable Machine Learning","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2106.12379"]},"main_file_link":[{"open_access":"1","url":"https://proceedings.neurips.cc/paper/2021/file/48000647b315f6f00f913caa757a70b3-Paper.pdf"}]},{"type":"journal_article","issue":"4","abstract":[{"lang":"eng","text":"Recently it was shown that anyons on the two-sphere naturally arise from a system of molecular impurities exchanging angular momentum with a many-particle bath (Phys. Rev. Lett. 126, 015301 (2021)). Here we further advance this approach and rigorously demonstrate that in the experimentally realized regime the lowest spectrum of two linear molecules immersed in superfluid helium corresponds to the spectrum of two anyons on the sphere. We develop the formalism within the framework of the recently experimentally observed angulon quasiparticle"}],"intvolume":" 9","title":"Emergence of anyons on the two-sphere in molecular impurities","ddc":["530"],"status":"public","_id":"10585","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","oa_version":"Published Version","file":[{"creator":"alisjak","file_size":303070,"content_type":"application/pdf","access_level":"open_access","file_name":"2021_Atoms_Brooks.pdf","success":1,"checksum":"d0e44b95f36c9e06724f66832af0f8c3","date_created":"2022-01-03T10:15:05Z","date_updated":"2022-01-03T10:15:05Z","file_id":"10592","relation":"main_file"}],"keyword":["anyons","quasiparticles","Quantum Hall Effect","topological states of matter"],"scopus_import":"1","article_processing_charge":"Yes","has_accepted_license":"1","day":"02","article_type":"original","citation":{"short":"M. Brooks, M. Lemeshko, D. Lundholm, E. Yakaboylu, Atoms 9 (2021).","mla":"Brooks, Morris, et al. “Emergence of Anyons on the Two-Sphere in Molecular Impurities.” Atoms, vol. 9, no. 4, 106, MDPI, 2021, doi:10.3390/atoms9040106.","chicago":"Brooks, Morris, Mikhail Lemeshko, Douglas Lundholm, and Enderalp Yakaboylu. “Emergence of Anyons on the Two-Sphere in Molecular Impurities.” Atoms. MDPI, 2021. https://doi.org/10.3390/atoms9040106.","ama":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. Emergence of anyons on the two-sphere in molecular impurities. Atoms. 2021;9(4). doi:10.3390/atoms9040106","apa":"Brooks, M., Lemeshko, M., Lundholm, D., & Yakaboylu, E. (2021). Emergence of anyons on the two-sphere in molecular impurities. Atoms. MDPI. https://doi.org/10.3390/atoms9040106","ieee":"M. Brooks, M. Lemeshko, D. Lundholm, and E. Yakaboylu, “Emergence of anyons on the two-sphere in molecular impurities,” Atoms, vol. 9, no. 4. MDPI, 2021.","ista":"Brooks M, Lemeshko M, Lundholm D, Yakaboylu E. 2021. Emergence of anyons on the two-sphere in molecular impurities. Atoms. 9(4), 106."},"publication":"Atoms","date_published":"2021-12-02T00:00:00Z","article_number":"106","file_date_updated":"2022-01-03T10:15:05Z","department":[{"_id":"MiLe"},{"_id":"RoSe"}],"publisher":"MDPI","publication_status":"published","year":"2021","acknowledgement":"D. Lundholm acknowledges financial support from the Göran Gustafsson Foundation (grant no. 1804).","volume":9,"date_updated":"2023-06-15T14:51:49Z","date_created":"2022-01-02T23:01:33Z","author":[{"full_name":"Brooks, Morris","first_name":"Morris","last_name":"Brooks","id":"B7ECF9FC-AA38-11E9-AC9A-0930E6697425","orcid":"0000-0002-6249-0928"},{"id":"37CB05FA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6990-7802","first_name":"Mikhail","last_name":"Lemeshko","full_name":"Lemeshko, Mikhail"},{"full_name":"Lundholm, Douglas","last_name":"Lundholm","first_name":"Douglas"},{"first_name":"Enderalp","last_name":"Yakaboylu","id":"38CB71F6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5973-0874","full_name":"Yakaboylu, Enderalp"}],"publication_identifier":{"eissn":["2218-2004"]},"month":"12","quality_controlled":"1","oa":1,"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2108.06966"]},"language":[{"iso":"eng"}],"doi":"10.3390/atoms9040106"},{"scopus_import":"1","day":"01","has_accepted_license":"1","article_processing_charge":"No","publication":"Proceedings of the 38th International Conference on Machine Learning","citation":{"ama":"Alimisis F, Davies P, Alistarh D-A. Communication-efficient distributed optimization with quantized preconditioners. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:196-206.","ista":"Alimisis F, Davies P, Alistarh D-A. 2021. Communication-efficient distributed optimization with quantized preconditioners. Proceedings of the 38th International Conference on Machine Learning. International Conference on Machine Learning vol. 139, 196–206.","apa":"Alimisis, F., Davies, P., & Alistarh, D.-A. (2021). Communication-efficient distributed optimization with quantized preconditioners. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 196–206). Virtual: ML Research Press.","ieee":"F. Alimisis, P. Davies, and D.-A. Alistarh, “Communication-efficient distributed optimization with quantized preconditioners,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 196–206.","mla":"Alimisis, Foivos, et al. “Communication-Efficient Distributed Optimization with Quantized Preconditioners.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 196–206.","short":"F. Alimisis, P. Davies, D.-A. Alistarh, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 196–206.","chicago":"Alimisis, Foivos, Peter Davies, and Dan-Adrian Alistarh. “Communication-Efficient Distributed Optimization with Quantized Preconditioners.” In Proceedings of the 38th International Conference on Machine Learning, 139:196–206. ML Research Press, 2021."},"page":"196-206","date_published":"2021-07-01T00:00:00Z","type":"conference","abstract":[{"text":"We investigate fast and communication-efficient algorithms for the classic problem of minimizing a sum of strongly convex and smooth functions that are distributed among n\r\n different nodes, which can communicate using a limited number of bits. Most previous communication-efficient approaches for this problem are limited to first-order optimization, and therefore have \\emph{linear} dependence on the condition number in their communication complexity. We show that this dependence is not inherent: communication-efficient methods can in fact have sublinear dependence on the condition number. For this, we design and analyze the first communication-efficient distributed variants of preconditioned gradient descent for Generalized Linear Models, and for Newton’s method. Our results rely on a new technique for quantizing both the preconditioner and the descent direction at each step of the algorithms, while controlling their convergence rate. We also validate our findings experimentally, showing faster convergence and reduced communication relative to previous methods.","lang":"eng"}],"_id":"13147","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","title":"Communication-efficient distributed optimization with quantized preconditioners","ddc":["000"],"intvolume":" 139","file":[{"creator":"dernst","file_size":429087,"content_type":"application/pdf","file_name":"2021_PMLR_Alimisis.pdf","access_level":"open_access","date_created":"2023-06-19T10:41:05Z","date_updated":"2023-06-19T10:41:05Z","success":1,"checksum":"7ec0d59bac268b49c76bf2e036dedd7a","file_id":"13154","relation":"main_file"}],"oa_version":"Published Version","month":"07","publication_identifier":{"eissn":["2640-3498"],"isbn":["9781713845065"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"external_id":{"arxiv":["2102.07214"]},"oa":1,"quality_controlled":"1","project":[{"name":"Elastic Coordination for Scalable Machine Learning","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","grant_number":"805223"},{"call_identifier":"H2020","name":"ISTplus - Postdoctoral Fellowships","grant_number":"754411","_id":"260C2330-B435-11E9-9278-68D0E5697425"}],"conference":{"name":"International Conference on Machine Learning","end_date":"2021-07-24","location":"Virtual","start_date":"2021-07-18"},"language":[{"iso":"eng"}],"file_date_updated":"2023-06-19T10:41:05Z","ec_funded":1,"acknowledgement":"The authors would like to thank Janne Korhonen, Aurelien Lucchi, Celestine MendlerDunner and Antonio Orvieto for helpful discussions. FA ¨and DA were supported during this work by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No 805223 ScaleML). PD was supported by the European Union’s Horizon 2020 programme under the Marie Skłodowska-Curie grant agreement No. 754411.","year":"2021","publication_status":"published","publisher":"ML Research Press","department":[{"_id":"DaAl"}],"author":[{"last_name":"Alimisis","first_name":"Foivos","full_name":"Alimisis, Foivos"},{"full_name":"Davies, Peter","last_name":"Davies","first_name":"Peter","orcid":"0000-0002-5646-9524","id":"11396234-BB50-11E9-B24C-90FCE5697425"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","first_name":"Dan-Adrian","last_name":"Alistarh"}],"date_updated":"2023-06-19T10:44:38Z","date_created":"2023-06-18T22:00:48Z","volume":139},{"type":"conference","abstract":[{"text":"A recent line of work has analyzed the theoretical properties of deep neural networks via the Neural Tangent Kernel (NTK). In particular, the smallest eigenvalue of the NTK has been related to the memorization capacity, the global convergence of gradient descent algorithms and the generalization of deep nets. However, existing results either provide bounds in the two-layer setting or assume that the spectrum of the NTK matrices is bounded away from 0 for multi-layer networks. In this paper, we provide tight bounds on the smallest eigenvalue of NTK matrices for deep ReLU nets, both in the limiting case of infinite widths and for finite widths. In the finite-width setting, the network architectures we consider are fairly general: we require the existence of a wide layer with roughly order of N neurons, N being the number of data samples; and the scaling of the remaining layer widths is arbitrary (up to logarithmic factors). To obtain our results, we analyze various quantities of independent interest: we give lower bounds on the smallest singular value of hidden feature matrices, and upper bounds on the Lipschitz constant of input-output feature maps.","lang":"eng"}],"_id":"13146","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","intvolume":" 139","ddc":["000"],"status":"public","title":"Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks","file":[{"relation":"main_file","file_id":"13155","checksum":"19489cf5e16a0596b1f92e317d97c9b0","success":1,"date_created":"2023-06-19T10:49:12Z","date_updated":"2023-06-19T10:49:12Z","access_level":"open_access","file_name":"2021_PMLR_Nguyen.pdf","content_type":"application/pdf","file_size":591332,"creator":"dernst"}],"oa_version":"Published Version","scopus_import":"1","has_accepted_license":"1","article_processing_charge":"No","day":"01","citation":{"ista":"Nguyen Q, Mondelli M, Montufar G. 2021. Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks. Proceedings of the 38th International Conference on Machine Learning. International Conference on Machine Learning vol. 139, 8119–8129.","ieee":"Q. Nguyen, M. Mondelli, and G. Montufar, “Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks,” in Proceedings of the 38th International Conference on Machine Learning, Virtual, 2021, vol. 139, pp. 8119–8129.","apa":"Nguyen, Q., Mondelli, M., & Montufar, G. (2021). Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks. In Proceedings of the 38th International Conference on Machine Learning (Vol. 139, pp. 8119–8129). Virtual: ML Research Press.","ama":"Nguyen Q, Mondelli M, Montufar G. Tight bounds on the smallest Eigenvalue of the neural tangent kernel for deep ReLU networks. In: Proceedings of the 38th International Conference on Machine Learning. Vol 139. ML Research Press; 2021:8119-8129.","chicago":"Nguyen, Quynh, Marco Mondelli, and Guido Montufar. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” In Proceedings of the 38th International Conference on Machine Learning, 139:8119–29. ML Research Press, 2021.","mla":"Nguyen, Quynh, et al. “Tight Bounds on the Smallest Eigenvalue of the Neural Tangent Kernel for Deep ReLU Networks.” Proceedings of the 38th International Conference on Machine Learning, vol. 139, ML Research Press, 2021, pp. 8119–29.","short":"Q. Nguyen, M. Mondelli, G. Montufar, in:, Proceedings of the 38th International Conference on Machine Learning, ML Research Press, 2021, pp. 8119–8129."},"publication":"Proceedings of the 38th International Conference on Machine Learning","page":"8119-8129","date_published":"2021-07-01T00:00:00Z","file_date_updated":"2023-06-19T10:49:12Z","year":"2021","acknowledgement":"The authors would like to thank the anonymous reviewers for their helpful comments. MM was partially supported by the 2019 Lopez-Loreta Prize. QN and GM acknowledge support from the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement no 757983).","department":[{"_id":"MaMo"}],"publisher":"ML Research Press","publication_status":"published","author":[{"last_name":"Nguyen","first_name":"Quynh","full_name":"Nguyen, Quynh"},{"full_name":"Mondelli, Marco","first_name":"Marco","last_name":"Mondelli","id":"27EB676C-8706-11E9-9510-7717E6697425","orcid":"0000-0002-3242-7020"},{"last_name":"Montufar","first_name":"Guido","full_name":"Montufar, Guido"}],"volume":139,"date_created":"2023-06-18T22:00:48Z","date_updated":"2023-06-19T10:52:51Z","publication_identifier":{"eissn":["2640-3498"],"isbn":["9781713845065"]},"month":"07","external_id":{"arxiv":["2012.11654"]},"tmp":{"name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","short":"CC BY (4.0)","image":"/images/cc_by.png"},"oa":1,"project":[{"name":"Prix Lopez-Loretta 2019 - Marco Mondelli","_id":"059876FA-7A3F-11EA-A408-12923DDC885E"}],"quality_controlled":"1","conference":{"end_date":"2021-07-24","location":"Virtual","start_date":"2021-07-18","name":"International Conference on Machine Learning"},"language":[{"iso":"eng"}]},{"file":[{"creator":"mlechner","file_size":137235,"content_type":"application/pdf","access_level":"open_access","file_name":"16496-Article Text-19990-1-2-20210518 (1).pdf","success":1,"checksum":"2bc8155b2526a70fba5b7301bc89dbd1","date_created":"2022-01-26T07:41:16Z","date_updated":"2022-01-26T07:41:16Z","file_id":"10684","relation":"main_file"}],"oa_version":"Published Version","intvolume":" 35","title":"Scalable verification of quantized neural networks","status":"public","ddc":["000"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"10665","issue":"5A","abstract":[{"text":"Formal verification of neural networks is an active topic of research, and recent advances have significantly increased the size of the networks that verification tools can handle. However, most methods are designed for verification of an idealized model of the actual network which works over real arithmetic and ignores rounding imprecisions. This idealization is in stark contrast to network quantization, which is a technique that trades numerical precision for computational efficiency and is, therefore, often applied in practice. Neglecting rounding errors of such low-bit quantized neural networks has been shown to lead to wrong conclusions about the network’s correctness. Thus, the desired approach for verifying quantized neural networks would be one that takes these rounding errors\r\ninto account. In this paper, we show that verifying the bitexact implementation of quantized neural networks with bitvector specifications is PSPACE-hard, even though verifying idealized real-valued networks and satisfiability of bit-vector specifications alone are each in NP. Furthermore, we explore several practical heuristics toward closing the complexity gap between idealized and bit-exact verification. In particular, we propose three techniques for making SMT-based verification of quantized neural networks more scalable. Our experiments demonstrate that our proposed methods allow a speedup of up to three orders of magnitude over existing approaches.","lang":"eng"}],"alternative_title":["Technical Tracks"],"type":"conference","date_published":"2021-05-28T00:00:00Z","page":"3787-3795","citation":{"apa":"Henzinger, T. A., Lechner, M., & Zikelic, D. (2021). Scalable verification of quantized neural networks. In Proceedings of the AAAI Conference on Artificial Intelligence (Vol. 35, pp. 3787–3795). Virtual: AAAI Press.","ieee":"T. A. Henzinger, M. Lechner, and D. Zikelic, “Scalable verification of quantized neural networks,” in Proceedings of the AAAI Conference on Artificial Intelligence, Virtual, 2021, vol. 35, no. 5A, pp. 3787–3795.","ista":"Henzinger TA, Lechner M, Zikelic D. 2021. Scalable verification of quantized neural networks. Proceedings of the AAAI Conference on Artificial Intelligence. AAAI: Association for the Advancement of Artificial Intelligence, Technical Tracks, vol. 35, 3787–3795.","ama":"Henzinger TA, Lechner M, Zikelic D. Scalable verification of quantized neural networks. In: Proceedings of the AAAI Conference on Artificial Intelligence. Vol 35. AAAI Press; 2021:3787-3795.","chicago":"Henzinger, Thomas A, Mathias Lechner, and Dorde Zikelic. “Scalable Verification of Quantized Neural Networks.” In Proceedings of the AAAI Conference on Artificial Intelligence, 35:3787–95. AAAI Press, 2021.","short":"T.A. Henzinger, M. Lechner, D. Zikelic, in:, Proceedings of the AAAI Conference on Artificial Intelligence, AAAI Press, 2021, pp. 3787–3795.","mla":"Henzinger, Thomas A., et al. “Scalable Verification of Quantized Neural Networks.” Proceedings of the AAAI Conference on Artificial Intelligence, vol. 35, no. 5A, AAAI Press, 2021, pp. 3787–95."},"publication":"Proceedings of the AAAI Conference on Artificial Intelligence","has_accepted_license":"1","article_processing_charge":"No","day":"28","scopus_import":"1","volume":35,"date_created":"2022-01-25T15:15:02Z","date_updated":"2023-06-23T07:01:11Z","related_material":{"record":[{"id":"11362","status":"public","relation":"dissertation_contains"}]},"author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2985-7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Lechner","first_name":"Mathias","id":"3DC22916-F248-11E8-B48F-1D18A9856A87","full_name":"Lechner, Mathias"},{"last_name":"Zikelic","first_name":"Dorde","id":"294AA7A6-F248-11E8-B48F-1D18A9856A87","full_name":"Zikelic, Dorde"}],"publisher":"AAAI Press","department":[{"_id":"GradSch"},{"_id":"ToHe"}],"publication_status":"published","year":"2021","acknowledgement":"This research was supported in part by the Austrian Science Fund (FWF) under grant Z211-N23 (Wittgenstein\r\nAward), ERC CoG 863818 (FoRM-SMArt), and the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Grant Agreement No. 665385.\r\n","ec_funded":1,"file_date_updated":"2022-01-26T07:41:16Z","language":[{"iso":"eng"}],"conference":{"start_date":"2021-02-02","location":"Virtual","end_date":"2021-02-09","name":"AAAI: Association for the Advancement of Artificial Intelligence"},"project":[{"name":"International IST Doctoral Program","call_identifier":"H2020","grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"The Wittgenstein Prize","grant_number":"Z211","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","name":"Formal Methods for Stochastic Models: Algorithms and Applications","grant_number":"863818","_id":"0599E47C-7A3F-11EA-A408-12923DDC885E"}],"quality_controlled":"1","oa":1,"external_id":{"arxiv":["2012.08185"]},"main_file_link":[{"open_access":"1","url":"https://ojs.aaai.org/index.php/AAAI/article/view/16496"}],"publication_identifier":{"issn":["2159-5399"],"isbn":["978-1-57735-866-4"],"eissn":["2374-3468"]},"month":"05"}]